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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

199 篇 会议
10 册 图书
7 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

132 篇 工学
- 116 篇 计算机科学与技术...
- 58 篇 软件工程
- 27 篇 信息与通信工程
- 23 篇 电气工程
- 9 篇 控制科学与工程
- 5 篇 电子科学与技术（可...
- 5 篇 生物工程
- 4 篇 生物医学工程（可授...
- 3 篇 仪器科学与技术
- 3 篇 化学工程与技术
- 2 篇 材料科学与工程（可...
- 2 篇 动力工程及工程热...
- 1 篇 机械工程
- 1 篇 光学工程
39 篇 理学
- 30 篇 数学
- 6 篇 生物学
- 6 篇 统计学（可授理学、...
- 5 篇 系统科学
- 4 篇 物理学
- 2 篇 化学
- 1 篇 地球物理学
- 1 篇 地质学
14 篇 管理学
- 12 篇 管理科学与工程(可...
- 4 篇 图书情报与档案管...
- 3 篇 工商管理
6 篇 医学
- 5 篇 临床医学
- 3 篇 基础医学(可授医学...
2 篇 经济学
- 2 篇 应用经济学
1 篇 法学
- 1 篇 社会学
1 篇 教育学
- 1 篇 教育学
1 篇 艺术学

主题

21 篇 evolutionary com...
11 篇 optimization
10 篇 computation theo...
10 篇 computational mo...
8 篇 algorithms
8 篇 heuristic algori...
7 篇 signal processin...
6 篇 convergence
6 篇 genetic algorith...
6 篇 machine learning
6 篇 clustering algor...
6 篇 data structures
5 篇 statistics
5 篇 resource managem...
5 篇 servers
5 篇 algorithm design...
5 篇 artificial intel...
5 篇 edge computing
4 篇 computer science
4 篇 theory of comput...

机构

2 篇 univ bonn bonn
2 篇 univ manitoba de...
2 篇 hunan univ coll ...
2 篇 college of infor...
2 篇 bangladesh univ ...
2 篇 department of el...
2 篇 qingdao univ col...
2 篇 peng cheng labor...
2 篇 suny coll new pa...
2 篇 polytechnic inst...
2 篇 univ jember jemb...
2 篇 college of compu...
2 篇 national univers...
2 篇 school of commun...
2 篇 dipartimento di ...
2 篇 key laboratory o...
2 篇 beijing universi...
2 篇 college of compu...
2 篇 zhejiang univ te...
1 篇 ramrao adik inst...

作者

3 篇 jiang fan
3 篇 slamin
2 篇 wang lei
2 篇 wu yuan
2 篇 rahman md. saidu...
2 篇 li kenli
2 篇 mutzel petra
2 篇 leung carson kai...
2 篇 yu jie
2 篇 li hao
2 篇 jiao licheng
2 篇 li keqin
2 篇 pazdor adam g. m...
2 篇 peddle aaron m.
2 篇 zhang qi
2 篇 peng jiwu
1 篇 frangu laurentiu
1 篇 becchetti luca
1 篇 ha yajun
1 篇 jizhao yin

语言

211 篇 英文
3 篇 其他
2 篇 中文

检索条件"任意字段=16th International Conference and Workshops on Algorithms and Computation"

共 216 条记录，以下是131-140 订阅

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

详细简洁

排序：

SHADE: Secure HAmming DistancE computation from Oblivious Transfer

SHADE: Secure HAmming DistancE Computation from Oblivious Tr...

引用

16th international conference on Financial Cryptography and Data Security

作者： Bringer, Julien Chabanne, Herve Patey, Alain Morpho Tokyo Japan

ISBN: (纸本)9783642413193;9783642413209

We introduce two new schemes for securely computing Hamming distance in the two-party setting. Our first scheme is a very efficient protocol, based solely on 1-out-of-2 Oblivious Transfer, that achieves full security in the semi-honest setting and one-sided security in the malicious setting. Moreover we show that this protocol is significantly more efficient than the previous proposals, that are either based on garbled circuits or on homomorphic encryption. Our second scheme achieves full security against malicious adversaries and is based on Committed Oblivious Transfer. these protocols have direct applications to secure biometric identification.

关键词： Secure Multi-Party computation Hamming Distance Oblivious Transfer Biometric Identification

来源：评论

学校读者我要写书评

暂无评论

Financial Cryptography and Data Security - FC 2013 workshops, USEC and WAHC 2013, Revised Selected Papers

Financial Cryptography and Data Security - FC 2013 Workshops...

引用

16th international conference on Financial Cryptography and Data Security, FC 2013

ISBN: (纸本)9783642413193

the proceedings contain 16 papers. the topics discussed include: the impact of length and mathematical operators on the usability and security of system-assigned one-time PINs;QRishing: the susceptibility of smartphone users to QR code phishing attacks;soulmate or acquaintance? visualizing tie strength for trust inference;awareness about photos on the web and how privacy-privacy-tradeoffs could help;bootstrapping trust in online dating: social verification of online dating profiles;SHADE: secure hamming distance computation from oblivious transfer;privacy preserving data processing with collaboration of homomorphic cryptosystems;and targeting FPGA DSP slices for a large integer multiplier for integer based FHE.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Combining technical analysis and grammatical evolution in a trading system 1

引用

16th European conference on Applications of Evolutionary computation, EvoApplications 2013

作者： Contreras, Iván Hidalgo, J. Ignacio Núñez-Letamendia, Laura Facultad de Informática Universidad Complutense de Madrid Spain IE Business School Madrid Spain

ISBN: (数字)9783642371929

ISBN: (纸本)9783642371912

Trading Systems are beneficial for financial investments due to the complexity of nowadays markets. On one hand, finance markets are influenced by a great amount of factors of different sources such as government policies, natural disasters, international trade, political factors etc. On the other hand, traders, brokers or practitioners in general could be affected by human emotions, so their behaviour in the stock market becomes nonobjective. the high pressure induced by handling a large volume of money is the main reason of the so-called market psychology. Trading systems are able to avoid a great amount of these factors, allowing investors to abstract the complex flow of information and the emotions related to the investments. In this paper we compare two trading systems based on Evolutionary computation. the first is a GA-based one and was already proposed and tested with data from 2006. the second one is a grammatical evolution approach which uses a new evaluation method. Experimental results show that the later outperforms the GA approach with a set of selected companies of the spanish market with 2012 data. © Springer-Verlag Berlin Heidelberg 2013.

关键词： international trade

来源：评论

学校读者我要写书评

暂无评论

Mining frequent serial episodes over uncertain sequence data

Mining frequent serial episodes over uncertain sequence data

引用

16th international conference on Extending Database Technology, EDBT 2013

作者： Wan, Li Chen, Ling Zhang, Chengqi Computer Science and Technology College Chongqing University China Centre for Quantum Computation and Intelligent Systems University of Technology Sydney Australia UTS/QCIS Australia State Key Laboratory of Networking and Switching Technology Beijing University of Posts and Telecommunications China

ISBN: (纸本)9781450315975

Data uncertainty has posed many unique challenges to nearly all types of data mining tasks, creating a need for uncertain data mining. In this paper, we focus on the particular task of mining probabilistic frequent serial episodes (P-FSEs) from uncertain sequence data, which applies to many real applications including sensor readings as well as customer purchase sequences. We first define the notion of P-FSEs, based on the frequentness probabilities of serial episodes under possible world semantics. To discover P-FSEs over an uncertain sequence, we propose: 1) an exact approach that computes the accurate frequentness probabilities of episodes;2) an approximate approach that approximates the frequency of episodes using probability models;3) an optimized approach that efficiently prunes a candidate episode by estimating an upper bound of its frequentness probability using approximation techniques. We conduct extensive experiments to evaluate the performance of the developed data mining algorithms. Our experimental results show that: 1) while existing research demonstrates that approximate approaches are orders of magnitudes faster than exact approaches, for P-FSE mining, the efficiency improvement of the approximate approach over the exact approach is marginal;2) although it has been recognized that the normal distribution based approximation approach is fairly accurate when the data set is large enough, for P-FSE mining, the binomial distribution based approximation achieves higher accuracy when the the number of episode occurrences is limited;3) the optimized approach clearly outperforms the other two approaches in terms of the runtime, and achieves very high accuracy. © 2013 ACM.

关键词： Normal distribution

来源：评论

学校读者我要写书评

暂无评论

Track Loss versus computation Time Dilemma in Multitarget Ground Target Tracking Performance

Track Loss versus Computation Time Dilemma in Multitarget Gr...

引用

international conference on Information Fusion

作者： Yusuf Korkmaz Buyurman Baykal Department of Electronics and Communication Engineering Cankaya University Department of Electrical and Electronics Engineering Middle East Technical University

ISBN: (纸本)9781479902842

Tracking of multiple ground targets with airborne Ground Moving Target Indicator (GMTI) sensor measurements is a challenging problem where heavy and dense false alarms with high target density are inevitably encountered in the surveillance scenes. Hence, optimal approaches require heavy computational load where the duration of overall computation rises exponentially with the number of target tracks and measurements in observation per scan. Consequently, more practical suboptimal approaches, such as Linear Multi-Target (LM) approach, is explored due to linear number of operations in the number of target tracks with a negligible performance loss compared to optimal approaches. Although LM approach performs modestly adequate with significantly less computation duration than optimal approaches, it is highly susceptible to track loss, as in the rest of suboptimal approaches, when the targets are closely spaced and the number of targets and measurements are considerably high. Simulations are carried out in realistic test scenarios to compare single target tracking algorithms including IMM-PDA and IMM-IPDA algorithms;Optimal approaches in multitarget tracking including IMM-JPDA, IMM-IJPDA and IMM-JIPDA algorithms and an example of Linear Multi-target approaches in multitarget tracking including IMM-LMIPDA algorithm. Benchmarkings of these algorithms are done under RMSE performance, track loss and computation time evaluation results.

关键词： Target tracking multiple target tracking Targets operation number computational time Track ground algorithms Heavy Dilemma

来源：评论

学校读者我要写书评

暂无评论

Shadow removal in depth images morphology-based for Kinect cameras

Shadow removal in depth images morphology-based for Kinect c...

引用

2012 16th international conference on System theory, Control and Computing, ICSTCC 2012

作者： Danciu, Gabriel Banu, Simona Maria CǍliman, Alexandru MIV Imaging Venture Laboratory Department of Automatics Electronics and Computers Transilvania University Braşov Romania

ISBN: (纸本)9786068348483

In this paper we propose two methods to remove the black regions that appear on Kinect camera depth images. We describe the various reasons why these regions of missing information appear. the proposed algorithms will be applied on only one frame of the captured video stream. Each method is based on applying a morphological filter designed to remove the black regions from the depth image. We present the results and then we conclude the paper. © 2012 Dunarea de Jos University.

关键词： computation theory

来源：评论

学校读者我要写书评

暂无评论

Fast layout computation of hierarchically clustered networks: Algorithmic advances and experimental analysis

Fast layout computation of hierarchically clustered networks...

引用

2012 16th international conference on Information Visualisation, IV 2012

作者： Didimo, Walter Montecchiani, Fabrizio Dipartimento di Ingegneria Elettronica e dell'Informazione Università degli Studi di Perugia Italy

ISBN: (纸本)9780769547718

Fast computation of two-dimensional layouts of hierarchically clustered networks is a well-studied problem in graph visualization. We present algorithmic and experimental advances on the subject: (i) We propose a new drawing algorithm that combines space-filling and fast force-directed methods;it runs in O(nlogn+m) time, where n and m are the number of vertices and edges of the network, respectively. this running time does not depend on the number of clusters, thus the algorithm guarantees good time performances independently of the structure of the cluster hierarchy. As a further advantage, the algorithm can be easily parallelized. (ii) We present an experimental analysis aimed at understanding which clustering algorithms can be used, in combination with our visualization technique, to generate better quality drawings for medium and large networks with small-world and scale-free structure. As far as we know, no previous similar experiments have been done in this respect. © 2012 IEEE.

关键词： Clustering algorithms

来源：评论

学校读者我要写书评

暂无评论

On uncertainty sources and artifacts compensation of airborne ultrasonic images

On uncertainty sources and artifacts compensation of airborn...

引用

2012 16th international conference on System theory, Control and Computing, ICSTCC 2012

作者： Aiordachioaie, Dorel Frangu, Laurentiu Electronics and Telecommunications Department Dunarea de Jos University of Galati Domneasca-47 Galati - 800008 Romania

ISBN: (纸本)9786068348483

the paper considers the uncertainty modeling and compensation in the context of ultrasonic image generation with fixed working frequency. From the set of uncertainty sources, which could be considered at the level of sonar systems, the present work considers only one source: the uncertainty at the level of the receiver transducers, expressed by two phenomena: side-lobes, possibly slow time variables, as normal behavior or artifact of the physical transducer, and the finite width of the main lobe. the two effects are considered as independent and are described from math point of view in order to generate compensation models and algorithms. the investigated solutions are verified and discussed on real ultrasonic images. © 2012 Dunarea de Jos University.

关键词： computation theory

来源：评论

学校读者我要写书评

暂无评论

Practical applications for robotic arms using image processing

Practical applications for robotic arms using image processi...

引用

2012 16th international conference on System theory, Control and Computing, ICSTCC 2012

作者： Dragusu, Mihai Mihalache, Anca Nicoleta Solea, Razvan Faculty of Automatic Control Computers Electric and Electronic Engineering Dunarea de Jos University of Galati Romania

ISBN: (纸本)9786068348483

the following paper presents various applications for a robotic arm using image processing. these applications have as a basis a video camera that captures the images to be processed for either recognition and sorting or for contour coordinates extraction. Based on these captures, there were developed algorithms that enable the arm to either sort objects recognized to be having different shapes, or to draw shapes based on the coordinates received. Both the object detection and the contour coordinates extraction methods are implemented using a series of image processing techniques like border extraction, contour detection, contour extraction, along with match template and the aid of OpenCV library. Also, a PI controller that ensures the position of the robotic arm was developed. © 2012 Dunarea de Jos University.

关键词： computation theory

来源：评论

学校读者我要写书评

暂无评论

Fast Layout computation of Hierarchically Clustered Networks: Algorithmic Advances and Experimental Analysis

Fast Layout Computation of Hierarchically Clustered Networks...

引用

international conference on Information Visualisation (IV)

作者： Walter Didimo Fabrizio Montecchiani Dipartimento di Ingegneria Elettronica e dell'Informazione Università degli Studi di Perugia Italy

Fast computation of two-dimensional layouts of hierarchically clustered networks is a well-studied problem in graph visualization. We present algorithmic and experimental advances on the subject: (i) We propose a new drawing algorithm that combines space-filling and fast force-directed methods; it runs in O(nlogn+m) time, where n and m are the number of vertices and edges of the network, respectively. this running time does not depend on the number of clusters, thus the algorithm guarantees good time performances independently of the structure of the cluster hierarchy. As a further advantage, the algorithm can be easily parallelized. (ii) We present an experimental analysis aimed at understanding which clustering algorithms can be used, in combination with our visualization technique, to generate better quality drawings for medium and large networks with small-world and scale-free structure. As far as we know, no previous similar experiments have been done in this respect.

关键词： Clustering algorithms Algorithm design and analysis Layout Partitioning algorithms Communities Image edge detection Visualization

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共22页 << < 10 11 12 13 14 15 16 17 18 19 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：