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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

335 篇 会议
24 篇 期刊文献
1 册 图书

馆藏范围

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

日期分布

学科分类号

137 篇 工学
- 104 篇 计算机科学与技术...
- 84 篇 软件工程
- 24 篇 信息与通信工程
- 20 篇 控制科学与工程
- 19 篇 电气工程
- 19 篇 电子科学与技术（可...
- 8 篇 机械工程
- 6 篇 生物工程
- 5 篇 材料科学与工程（可...
- 5 篇 生物医学工程（可授...
- 4 篇 光学工程
- 4 篇 动力工程及工程热...
- 3 篇 仪器科学与技术
- 3 篇 建筑学
- 3 篇 土木工程
- 3 篇 安全科学与工程
- 2 篇 交通运输工程
- 2 篇 农业工程
56 篇 理学
- 39 篇 数学
- 11 篇 统计学（可授理学、...
- 10 篇 物理学
- 8 篇 系统科学
- 6 篇 生物学
- 3 篇 化学
25 篇 管理学
- 14 篇 图书情报与档案管...
- 13 篇 管理科学与工程(可...
- 5 篇 工商管理
4 篇 法学
- 3 篇 社会学
3 篇 教育学
- 3 篇 教育学
2 篇 经济学
- 2 篇 应用经济学
2 篇 农学
2 篇 医学
1 篇 军事学
1 篇 艺术学

主题

55 篇 computer science
35 篇 information scie...
17 篇 application soft...
15 篇 testing
14 篇 neural networks
12 篇 computer archite...
12 篇 computational mo...
12 篇 costs
11 篇 bandwidth
11 篇 humans
11 篇 protocols
10 篇 educational inst...
9 篇 programming
9 篇 informatics
9 篇 data mining
9 篇 switches
9 篇 internet
9 篇 software
9 篇 distributed comp...
9 篇 telecommunicatio...

机构

11 篇 department of co...
10 篇 dept. of comput....
10 篇 dept. of comput....
8 篇 oxford-man insti...
8 篇 department of co...
6 篇 national taiwan ...
6 篇 dept. of inf. & ...
5 篇 dept. of comput....
5 篇 dept. of comput....
5 篇 dept. of compute...
5 篇 dept. of compute...
4 篇 dept. of comput....
4 篇 dept. of comput....
4 篇 dept. of compute...
4 篇 department of co...
4 篇 dept. of compute...
4 篇 department of co...
4 篇 dept. of cs and ...
3 篇 department of co...
3 篇 dept. of inf. sc...

作者

7 篇 calì andrea
5 篇 mylopoulos john
4 篇 taufer michela
4 篇 tsutomu kawabata
4 篇 xie min
4 篇 wood peter t.
4 篇 memon nasir
3 篇 hirose keikichi
3 篇 pieris andreas
3 篇 nazih hajri
3 篇 felix dobslaw
3 篇 frosini riccardo
3 篇 yamazaki yoichi
3 篇 lakshmanan laks ...
3 篇 minematsu nobuak...
2 篇 hemaspaandra edi...
2 篇 néji youssef
2 篇 swersky kevin
2 篇 preitl stefan
2 篇 keller jörg

语言

353 篇 英文
6 篇 其他
1 篇 中文

检索条件"机构=Dept. of Inf. Engineering and Computer Science"

共 360 条记录，以下是221-230 订阅

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

详细简洁

排序：

A simulation study of the proactive server roaming for mitigating denial of service attacks

A simulation study of the proactive server roaming for mitig...

引用

Annual Symposium on Simulation

作者： C. Sanetachatanaruk S.M. Khattab T. Znati R. Melhem D. Mosse Dept. of Inf. Sci. & Telecommun. Pittsburgh Univ. PA USA Department of Computer Science University of Pittsburgh Pittsburgh PA USA Department of Information Science and Telecommunication

The main goal of the NETSEC project is to design and implement a framework for mitigating the effects of the node-based and link-based denial of service (DoS) attacks. Our strategy employs three lines of defense. The first line of defense is to restrict the access to the defended services using offline service subscription, encryption and other traditional security techniques. The second line of defense is server roaming, by which we mean the migration of the service from one server to another, where the new server has a different IP address. Finally, each server and firewall(s) implement resource management schemes as a third line of defense. For example, deploying separate input queues to allocate different classes of service requests. We show our simulation study on the second line of defense, the server roaming. The design and procedure of the sever roaming on the NS2 is described. The promising results of applying the server roaming to mitigate the DoS attack in the simulation are also shown with analysis.

关键词： computer crime Network servers Web server File servers Cryptography Bandwidth Operating systems Internet Authentication Computational modeling

来源：评论

学校读者我要写书评

暂无评论

Local exploration: online algorithms and a probabilistic framework

Local exploration: online algorithms and a probabilistic fra...

引用

IEEE International Conference on Robotics and Automation (ICRA)

作者： V. Isler S. Kannan K. Daniilidis Dept. of Comput. & Inf. Sci. Pennsylvania Univ. Philadelphia PA USA Department of Computer and Information Science University of Pennsylvania Philadelphia PA USA

Mapping an environment with an imaging sensor becomes very challenging if the environment to be mapped is unknown and has to be explored. Exploration involves the planning of views so that the entire environment is covered. The majority of implemented mapping systems use a heuristic planning while theoretical approaches regard only the traveled distance as cost. However, practical range acquisition systems spend a considerable amount of time for acquisition. In this paper, we address the problem of minimizing the cost of looking around a corner, involving the time spent in traveling as well as the time spent for reconstruction. Such a local exploration can be used as a subroutine for global algorithms. We prove competitive ratios for two online algorithms. Then, we provide two representations of local exploration as a Markov Decision Process and apply a known policy iteration algorithm. Simulation results show that for some distributions the probabilistic approach outperforms deterministic strategies.

关键词： Costs Algorithms Mobile robots Robot sensing systems Simultaneous localization and mapping inf.rmation science Image sensors Image reconstruction Landmine detection Robot vision systems

来源：评论

学校读者我要写书评

暂无评论

Identification of functionality during development on a virtual Sblock FPGA

Identification of functionality during development on a virt...

引用

Congress on Evolutionary Computation

作者： G. Tufte P.C. Haddow Dept. of Comput. & Inf. Sci. Norwegian Univ. of Sci. & Technol. Trondheim Norway Department of Computer and Information Science The Norwegian University of Science and Technology Trondheim Norway

Artificial development is a newer approach aimed at achieving complex solutions. This work aims to develop electronic circuits although the results presented are, in fact, of a more general interest to artificial development research. In theory, a circuit may be described by a relatively simple genotype which is then grown to the final circuit. One of the challenges that exists, is how and when to interpret the functionality of the growing phenotype i.e. the growing circuit solution. This challenge is addressed. The development process described is a rule-based system on a nonuniform cellular automata topology. The experiments presented investigate the effect of different start states as well as considering the number of state and development steps in the development process.

关键词： Field programmable gate arrays Electronic circuits Organisms Circuit topology Shape Automata Hardware Art inf.rmation science

来源：评论

学校读者我要写书评

暂无评论

Analytics and algorithms for geometric average trigger reset options

Analytics and algorithms for geometric average trigger reset...

引用

Proceedings of the IEEE/IAFE Computational Intelligence for Financial engineering (CIFEr)

作者： Tian-Shyr Dai I-Yuan Chen Yuh-Yuan Fang Yuh-Dauh Lyuu Dept. of Comput. Sci. & Inf. Eng. Nat. Taiwan Univ. Taipei Taiwan Department of Computer Science & Information Engineering National Taiwan University Taipei Taiwan Department of Computer Science & Information Engineering National Taiwan University Taiwan Department of Finance and Department of Computer Science & Information Engineering National Taiwan University Taiwan

ISBN: (纸本)0780376544

The geometric average trigger reset option resets the strike price based on the geometric average of the underlying asset's prices over a monitoring window. This paper derives an analytic formula and two numerical methods for pricing this option with multiple resets. The analytic formula in fact is a corollary of a general formula that holds for a large class of path-dependent options: It prices any option whose payoff function can be written as e/sup b/spl middot/X/1/sub {X/spl isin/A}/. For general American-style reset options, an O(n/sup 4/h/sup 2/)-time algorithm on n-period binomial lattice is presented. A much more efficient O(n/sup 3/ hm)-time algorithm prices European-style reset options. Monte Carlo simulation suggests that the European-style geometric average trigger reset option and the arithmetic version have similar option values. This implies that results in this paper give tight prices for the difficult arithmetic version.

关键词： Algorithm design and analysis computer science Arithmetic Investments Pricing Finance computerized monitoring Lattices Monte Carlo methods Protection

来源：评论

学校读者我要写书评

暂无评论

CoMRI: a compressed multiresolution index structure for sequence similarity queries

CoMRI: a compressed multiresolution index structure for sequ...

引用

IEEE Conference on Bioinf.rmatics

作者： H. Sun O. Ozturk H. Ferhatosmanoglu Department of Computer and Information Science Ohio State Uinversity USA Ohio State University Columbus OH US Dept. of Comput. & Inf. Sci. Ohio State Univ. Columbus OH USA

In this paper, we present CoMRI, compressed multiresolution index, our system for fast sequence similarity search in DNA sequence databases. We employ virtual bounding rectangle (VBR) concept to build a compressed, grid style index structure. An advantage of grid format over trees is subsequence location inf.rmation is given by the order of corresponding VBR in the VBR list. Taking advantage of VBRs, our index structure fits into a reasonable size of memory easily. Together with a new optimized multiresolution search algorithm, the query speed is improved significantly. Extensive performance evaluations on human chromosome sequence data show that VBRs save 80%-93% index storage size compared to MBRs (minimum bounding rectangles) and new search algorithm prunes almost all unnecessary VBRs which guarantees efficient disk I/O and CPU cost. According to the results of our experiments, the performance of CoMRI is at least 100 times faster than MRS which is another grid index structure introduced very recently.

关键词： Sequences DNA Indexes Bioinf.rmatics Genomics Spatial databases Multidimensional systems Multiresolution analysis Sun Biomedical computing

来源：评论

学校读者我要写书评

暂无评论

Relational database linkage of scientific applications and their data files

Relational database linkage of scientific applications and t...

引用

IEEE Workshop on Soft Computing in Industrial Applications (SMCia)

作者： I. Rudowskyi O. Kulyba M. Kunin D. Ogarodnikov T. Raphan Dept. of Comput. & Inf. Sci. City Univ. of New York Brooklyn NY USA Brooklyn College City University of New York Brooklyn NY USA Department of Computer and Information Science Institute of Neural & Intelligent Systems New York Department of Neurology Mt Sinai School of Medicine New York New York USA

Research in computational neuroscience has been following a model-based approach where data is comprised of digitized streams of sampled analog data, images and voice. The data are generally contained in files and specialized programs are used to analyze the data. In this study we developed a prototype system for indexing and retrieving inf.rmation for use by an application that analyzes data. The data in the files consist of channels derived from analog and event driven sources. It is also linked to video images associated with the data acquisition. In this research, we developed an indexing capability that threads into the data acquisition and analysis programs to give the system a broad data base capability. We designed tables and relations within the database for indexing the files and inf.rmation contained within the file. The system has the potential of giving us retrieval capabilities that include analog, event, and video data types.

关键词： Relational databases Couplings Data analysis Indexing inf.rmation retrieval Data acquisition Analog computers Neuroscience Streaming media Prototypes

来源：评论

学校读者我要写书评

暂无评论

Statistical language modeling with prosodic boundaries and its use for continuous speech recognition 7

Statistical language modeling with prosodic boundaries and i...

引用

7th International Conference on Spoken Language Processing, ICSLP 2002

作者： Hirose, Keikichi Minematsu, Nobuaki Terao, Makoto Dept. of Frontier Informatics School of Frontier Sciences University of Tokyo Bunkyo-ku Tokyo113-0033 Japan Dept. of Inf. and Commu. Engineering School of Inf. Science and Tech. University of Tokyo Bunkyo-ku Tokyo113-0033 Japan Dept. of Inf. and Commu. Engineering School of Engineering University of Tokyo Bunkyo-ku Tokyo113-0033 Japan

A new statistical language modeling was proposed where word n-gram was counted separately for the cases crossing and not crossing accent phrase boundaries. Since such counting requires a large speech corpus, which hardly can be prepared, part-of-speech (POS) n-gram was first counted for a small-sized speech corpus for the two cases instead, and then the result is applied to word n-gram counts of a large text corpus to divide them accordingly. Thus, the two types of word n-gram model can be obtained. Using ATR continuous speech corpus by two speakers, perplexity reduction from the baseline model to the proposed model was calculated for the word bi-gram. When accent phrase boundary inf.rmation of the speech corpus was used, the reduction reached 11%, and when boundaries were extracted using our formerly developed method based on mora-F0 transition modeling, it still exceeded 8%. The reduction around 5% was still observed for sentences not included for the calculation of POS bi-gram and using boundaries automatically extracted from another speaker's speech. The obtained bigram was applied to continuous speech recognition, resulted in a two-percentage improvement of word accuracy from when the baseline model was used.

关键词： Modeling languages

来源：评论

学校读者我要写书评

暂无评论

An efficient strategy for adding bulky data into B+-tree indices in inf.rmation retrieval systems 5th

引用

5th International Conference on Asian Digital Libraries, ICADL 2002

作者： Kim, Jin-Ho Kim, Ju-Young Kim, Sang-Wook Ok, Soo-Ho Roh, Hi-Young Dept. of Computer Science Kangwon Nat’l University Korea Republic of Dept. of Inf. and Telecomm Eng. Kangwon Nat’l University Chunchon Korea Republic of Dept. of Computer Science Kosin University Busan Korea Republic of

ISBN: (纸本)3540002618

In Internet-based inf.rmation retrieval systems, a large amount of data are periodically collected from the Internet by robot agents and stored into a database. For fast retrieval, their key values are also added into an existing index, widely constructed as an inverted file using a B+-tree. Obviously, the simplest method of adding multiple key values into a B+-tree is to apply the insertion algorithm repeatedly. However, this method inserts new key values into a B+-tree in a random order without considering adjacency between them. This makes each page within the B+-tree accessed a lot of times, and thus requires large processing time. To solve this problem, we present a new method called Bulk_Add that effectively adds a bulky set of new key values into an existing B+-tree index.

关键词：

来源：评论

学校读者我要写书评

暂无评论

An improved α-Shapes algorithm for geometric reconstruction 22

An improved α-Shapes algorithm for geometric reconstruction

引用

22nd International Conference on Distributed Computing Systems Workshops, ICDCSW 2002

作者： Jong, Bin Shyan Lin, Tsong Wu Yang, Wen Hao Jong, Kun Shyan Dept. of Inf. Eng. Chung Yuan Christian Univ. Chung-li Taiwan Department of Computer and Information Science Soochow University China

ISBN: (纸本)0769515886

Combining virtual reality and network multimedia techniques in applications is becoming popular. 3D geometry models are used in such applications. It is difficult to build mathematical models manually, but reverse engineering for building such models. Such a model is suitable for Internet transmission. However, there is still a bottleneck in using reverse engineering to reconstruct a relationship between vertices. The α-Shapes is an old method used for this purpose, and we propose methods to improve its efficiency. Our method can generate a compact model, and the average storage space required by our method is about half that of the original method. The advantage of our method is not the storage space but also reconstruction time. © 2002 IEEE.

关键词： Geometry

来源：评论

学校读者我要写书评

暂无评论

Effective delivery of virtual class on parallel media stream server

Effective delivery of virtual class on parallel media stream...

引用

International Conference on computers in Education, ICCE 2002

作者： Kim, Seogyun Nam, Jiseung Yeom, Soon-Ja R and D Planning Dept. Inst. of Inf. Technol. Assessment Seoul Korea Republic of Department of Computer Engineering Chonnam National University Korea Republic of School of Computing University of Tasmania Australia

ISBN: (纸本)0769515096

A virtual class delivers most of its content through multimedia learning objects. To support such multimedia learning objects, its multimedia data service system should have a capacity to serve the growing number of clients and new data. A streaming server transfers multimedia files to clients from a repository of files in real time. The server must guarantee concurrent and uninterrupted delivery of each video stream requested by clients. To provide efficient services, many stream servers adopt multi-processors, sufficient memory, and RAID or SAN in their systems. In this paper, we propose a Linux-based parallel media streaming server. This system uses a unique striping policy to distribute multimedia files into the parallel storage nodes. If a service request occurs, each storage node transmits striped files concurrently to the client. Its performance is better than the existing single media streaming service. © 2002 IEEE.

关键词： Media streaming

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共36页 << < 19 20 21 22 23 24 25 26 27 28 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：