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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

1,034 篇 会议
6 篇 期刊文献
1 册 图书

馆藏范围

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

日期分布

学科分类号

290 篇 工学
- 278 篇 计算机科学与技术...
- 178 篇 软件工程
- 76 篇 电气工程
- 73 篇 信息与通信工程
- 13 篇 控制科学与工程
- 10 篇 光学工程
- 7 篇 电子科学与技术（可...
- 6 篇 安全科学与工程
- 3 篇 轻工技术与工程
- 2 篇 机械工程
- 2 篇 仪器科学与技术
- 2 篇 生物医学工程（可授...
- 2 篇 生物工程
- 2 篇 网络空间安全
- 1 篇 材料科学与工程（可...
- 1 篇 动力工程及工程热...
- 1 篇 土木工程
- 1 篇 化学工程与技术
56 篇 医学
- 56 篇 临床医学
43 篇 理学
- 32 篇 数学
- 12 篇 物理学
- 9 篇 统计学（可授理学、...
- 5 篇 系统科学
- 2 篇 生物学
38 篇 管理学
- 30 篇 图书情报与档案管...
- 12 篇 管理科学与工程(可...
- 7 篇 工商管理
8 篇 法学
- 5 篇 法学
- 4 篇 社会学
1 篇 教育学
- 1 篇 教育学

主题

217 篇 information tech...
177 篇 computer science
112 篇 information retr...
94 篇 internet
83 篇 application soft...
67 篇 image coding
63 篇 data mining
63 篇 cryptography
57 篇 computer archite...
57 篇 information secu...
55 篇 computer network...
53 篇 costs
51 篇 protection
50 篇 information syst...
46 篇 bandwidth
46 篇 grid computing
46 篇 humans
43 篇 mobile computing
43 篇 watermarking
41 篇 streaming media

机构

9 篇 university of te...
7 篇 department of co...
5 篇 department of el...
5 篇 school of inform...
5 篇 univ sci & techn...
4 篇 department of co...
4 篇 information syst...
4 篇 community grids ...
4 篇 deis university ...
4 篇 center for advan...
4 篇 department of co...
4 篇 school of comput...
4 篇 information scie...
3 篇 school of comput...
3 篇 univ lecce ctr a...
3 篇 department of co...
3 篇 department of co...
3 篇 iit dept comp sc...
3 篇 department of co...
3 篇 illinois institu...

作者

10 篇 d. grossman
7 篇 m. murshed
7 篇 k. taghva
7 篇 aloisio g
7 篇 m. cafaro
7 篇 cafaro m
7 篇 a. abraham
7 篇 g. aloisio
7 篇 m. hanmandlu
6 篇 n. ansari
6 篇 l.s. dooley
6 篇 g. fox
6 篇 a. spink
6 篇 r. steele
6 篇 s. vasikarla
6 篇 e. lawrence
6 篇 o. frieder
6 篇 j. domingo-ferre...
5 篇 s.i. ahamed
5 篇 m. cannataro

语言

1,041 篇 英文

检索条件"任意字段=International Conference on Information Technology: Coding Computing, ITCC 2004"

共 1041 条记录，以下是841-850 订阅

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

详细简洁

排序：

FSM implementation in embedded memory blocks of programmable logic devices using functional decomposition

FSM implementation in embedded memory blocks of programmable...

引用

international conference on information technology: coding and computing (itcc)

作者： H. Selvaraj M. Rawski T. Luba University of Nevada Las Vegas Las Vegas NV USA Institute of Telecommunications Warsaw University of Technology Warsaw Poland

Since modern programmable devices contain embedded memory blocks, there exists the possibility of implementing finite state machines (FSM) using such blocks. However, the size of the memory available in programmable devices is limited. The paper presents a general method for the synthesis of sequential circuits using embedded memory blocks. The method is based on the serial decomposition concept and relies on decomposing the memory block into two blocks: a combinational address modifier and a smaller memory block. An appropriately chosen decomposition strategy may allow reducing the required memory size at the cost of additional logic cells for address modifier implementation. This makes possible the implementation of FSMs that exceed available memory by using embedded memory blocks and additional programmable logic.

关键词： Programmable logic devices CMOS logic circuits Logic design Circuit synthesis Sequential circuits Costs Programmable logic arrays Digital circuits Boolean functions Microelectronics

来源：评论

学校读者我要写书评

暂无评论

Video transfer control protocol for a wireless video demonstrator

Video transfer control protocol for a wireless video demonst...

引用

international conference on information technology: coding and computing (itcc)

作者： J. Suhonen M. Hannikainen O. Lehtoranta M. Kuorilehto M. Niemi T. Hamalainen Institute ofDig ital and Computer Systems Tampere University of Technology Tampere Finland Nokia Mobile Phones Limited Tampere Finland

Real-time streaming video is expected to emerge as a key service in different telecommunications systems, including wireless networks. This paper presents the functionality and implementation of the wireless Video Control Protocol (VCP). The protocol has been implemented for developing the functionality for real-time video stream transmission over heterogeneous wireless network technologies. VCP is embedded into a wireless video demonstrator. The demonstrator consists of Windows NT hosts containing a real-time H.263 encoder, video stream parsing functionality, and several network connections, such as wireless LAN, Bluetooth and GSM data. The protocol contains functionality for protecting the video stream transfer and adapting different network technologies together.

关键词： Wireless application protocol Streaming media Videoconference Quality of service Centralized control Decoding Wireless LAN Encoding Wireless networks Wireless personal area networks

来源：评论

学校读者我要写书评

暂无评论

Cost-effective planning of timed mobile agents

Cost-effective planning of timed mobile agents

引用

international conference on information technology: coding and computing (itcc)

作者： Jin-Wook Baek Gyu-Tae Kim Heon-Young Yeom School of Computer Science and Engineering Seoul National University Seoul South Korea

ISBN: (纸本)0769515061

The two most significant planning factors in mobile agent planning (MAP) are the number of agents used and each agent's itinerary. These two planning factors must be well-scheduled, since badly-scheduled factors can cause longer execution times because of the higher routing costs. In addition to these two factors, the time constraints that reside on the nodes of the information repository (i.e. the information servers) also have to be dealt with. Consider the nodes that present correct information only for a certain time interval. If an agent is sent to gather information and arrives earlier than a specified update time, it may retrieve useless or corrupted information. To cope with these types of information retrieval, we propose a time-constrained MAP method which finds the minimum number of agents needed and the best scheduled agent itineraries for retrieving information from a distributed computing environment. The method works under the time constraints mentioned above, allows the completion time to be lower-bounded and minimizes routing overheads. Simulation results show that the proposed method produces results that are highly applicable to the time-constrained distributed information retrieval problem domain.

关键词： Mobile agents information retrieval Time factors Processor scheduling Routing Distributed computing Bandwidth Costs Computer science Computational modeling

来源：评论

学校读者我要写书评

暂无评论

A classified and comparative study of edge detection algorithms

A classified and comparative study of edge detection algorit...

引用

international conference on information technology: coding and computing (itcc)

作者： M. Sharifi M. Fathy M.T. Mahmoudi Department of Computer Engineering Iran University of Science and Technology Tehran Iran

Since edge detection is in the forefront of image processing for object detection, it is crucial to have a good understanding of edge detection algorithms. This paper introduces a new classification of most important and commonly used edge detection algorithms, namely ISEF, Canny, Marr-Hildreth, Sobel, Kirsch, Lapla1 and Lapla2. Five categories are included in our classification, and then advantages and disadvantages of some available algorithms within this category are discussed. A representative group containing the above seven algorithms are the implemented in C++ and compared subjectively, using 30 images out of 100 images. Two sets of images resulting from the application of those algorithms are then presented. It is shown that under noisy conditions, ISEF, Canny, Marr-Hildreth, Kirsch, Sobel, Lapla2, Lapla1 exhibit better performance, respectively.

关键词： Image edge detection Detectors Laplace equations Image processing Filtering algorithms Object detection Image color analysis Image sequence analysis Shape Geometrical optics

来源：评论

学校读者我要写书评

暂无评论

A methodology for collection selection in heterogeneous contexts

A methodology for collection selection in heterogeneous cont...

引用

international conference on information technology: coding and computing (itcc)

作者： F. Abbaci J. Savoy M. Beigbeder Ecole des Mines de Saint Etienne Saint Etienne France Universita de Neuchâtel Neuchatel Switzerland

Demonstrates that, in an ideal distributed information retrieval environment, it can be effective to take into account the ability of each collection server to return relevant documents when selecting collections. Based on this assumption, we suggest a new approach to resolve the collection selection problem. In order to predict a collection's ability to return relevant documents, we inspect a limited number (n) of documents retrieved from each collection and analyse the proximity of search keywords within them. In our experiments, we vary the underlying parameter n of our suggested model in order to define the most appropriate number of top documents to be inspected. Moreover, we evaluate the retrieval effectiveness of our approach and compare it with both the centralized indexing and the CORI (COllection Retrieval Inference) approaches. Preliminary results from these experiments, conducted on the WT10g test collection of Web pages, tend to demonstrate that our suggested method can achieve appreciable retrieval effectiveness.

关键词： information retrieval Web server Indexing Merging Internet Statistical distributions Database languages Veins Automatic testing Performance evaluation

来源：评论

学校读者我要写书评

暂无评论

FCBHS: a fast center-biased hybrid search algorithm for fast block motion estimation

FCBHS: a fast center-biased hybrid search algorithm for fast...

引用

international conference on information technology: coding and computing (itcc)

作者： Su-Bong Hong Hyoseok Lee Geun-Young Chun Hyunki Baik Myong-Soon Park Department of Computer Science and Engineering Korea University Seoul South Korea

ISBN: (纸本)0769515061

Describes a fast block-matching algorithm (BMA) for motion estimation exploiting the center-biased motion vector distribution characteristic more efficiently than the center-biased hybrid search (CBHS) algorithm does. This proposed algorithm, which is called the "fast center-biased hybrid search" (FCBHS), employs a hybrid method of a compact plus-shaped search, an X-shaped search and a diamond search to reduce the search point for motion vectors which are distributed within a 2-pixel radius of the center of the search window. Experimental results show that the FCBHS algorithm is about 44 times faster than a full search and 7-10% faster than the CBHS algorithm. Such a fast sub-optimal motion estimation algorithm is essential for situations which have limited processing power and constraints on the amount of power consumption, like real-time mobile video coding applications. This paper compares the popular sub-optimal block-matching technique with FCBHS, for which both the processing speed and the accuracy of motion compensation are tested over widely-used H.263 test video sequences.

关键词： Motion estimation Video coding Video sequences Software algorithms Computer science Motion compensation Testing Streaming media Mobile computing Application software

来源：评论

学校读者我要写书评

暂无评论

Performance of KDB-trees with query-based splitting

Performance of KDB-trees with query-based splitting

引用

international conference on information technology: coding and computing (itcc)

作者： Y. Lepouchard R. Orlandic J.L. Pfaltz Department of Computer Science University of Virginia Charlottesville VA USA Department of Computer Science Illinois Institute of Technology Chicago IL USA

While the persistent data of many advanced database applications, such as OLAP and scientific studies, are characterized by very high dimensionality, typical queries posed on these data appeal to a small number of relevant dimensions. Unfortunately, the multidimensional access methods designed for high-dimensional data perform rather poorly for these partially specified queries. A potentially very appealing idea, frequently suggested in the literature, is to adopt a node-splitting policy that takes into account the "importance" of individual dimensions, which could be determined either a priori or through a statistical sampling of actual queries. This paper presents the results of some carefully controlled experiments conducted to observe the effects of query-based splitting on the performance of KDB-trees. The strategy is compared to a splitting policy that selects the split dimensions in a "cyclic" fashion, which has been shown to be very effective, especially in high-dimensional situations. Based on the results, the query-based splitting does not appear to be a very appealing splitting strategy for KDB-trees.

关键词： Computer science Databases Multidimensional systems Design methodology Sampling methods Tree data structures Physics US Department of Energy Application software information retrieval

来源：评论

学校读者我要写书评

暂无评论

Self-adjusted network transmission for multimedia data

Self-adjusted network transmission for multimedia data

引用

international conference on information technology: coding and computing (itcc)

作者： Mei-Ling Shyu Shu-Ching Chen Hongli Luo Department of Electrical and Computer Engineering University of Miami Coral Gables FL USA School of Computer Science Florida International University Miami FL USA

ISBN: (纸本)0769515061

High bandwidth requirements in multimedia transmission make the efficient use of limited network resource a challenging task, especially when multiple clients make their requests to the server simultaneously. We propose a self-adjusted network transmission mechanism for multiple clients. Instead of assigning a fixed bandwidth for each client, the server determines the transmission rate for each client connection according to the buffer packets and playback rate at each client. Transmission rates are adjusted when the total requested bandwidth is larger than the network bandwidth. In addition, the proposed mechanism can minimize the bandwidth allocation and maximize the client buffer utilization. A simulation is performed and the simulation results show that the proposed mechanism can dynamically change the transmission rate for each client to avoid overflow of the client buffer, and achieve the optimal utilization of the limited network resource in multiple client network environments.

关键词： Bandwidth Resource management Jitter Streaming media Videos Network servers Bit rate Buffer storage Computer science Channel allocation

来源：评论

学校读者我要写书评

暂无评论

Taxonomy-based adaptive Web search method

Taxonomy-based adaptive Web search method

引用

international conference on information technology: coding and computing (itcc)

作者： S.M. Pahlevi H. Kitagawa University of Tsukuba Tsukuba Ibaraki Japan

Current crawler-based search engines usually return a long list of search results containing a lot of noise documents. By indexing collected documents on a topic path in taxonomy, taxonomy-based search engines can improve the search result quality. However the searches are limited to the locally compiled databases. We propose an adaptive Web search method to improve the search result quality enabling the users to search many databases existing in the Web space. The method has a characteristic that combines the taxonomy-based search engines and a machine learning technique. More specifically, we construct a rule-based classifier using pre-classified documents provided by a taxonomy-based search engine based on a selected context category on its taxonomy, and then use it to modify the user query. The resulting modified query will be sent to the crawler-based search engines and the returned results will be presented to the user. We evaluate the effectiveness of our method by showing that the returned results from the modified query almost contain documents that will be categorized into the selected context category.

关键词： Web search Search engines Taxonomy Databases Web pages Machine learning Indexing Humans information technology

来源：评论

学校读者我要写书评

暂无评论

Bridging O-telos and XML with XML schema: the authoring environment for KBS Adaptive Hyperbook

Bridging O-telos and XML with XML schema: the authoring envi...

引用

international conference on information technology: coding and computing (itcc)

作者： Changtao Qu W. Nejdl Institute of Computer Engineering University of Hannover Hanover Germany

KBS Adaptive Hyperbook is a framework designed for modeling, organizing, and maintaining distributed hypermedia resources on the Web with the purpose of supporting Web-based distance education. Since the Hyperbook system is implemented based on a sophisticated meta modeling language (O-Telos), its authoring depends to a great extent on the Hyperbook developers instead of lecturers who have rich teaching experience but generally no knowledge of O-Telos and meta modeling. This has become a notable obstacle to enrich the content of existing Hyperbooks and further construct new Hyperbooks which are applicable to different specialties. In this paper we present a novel approach which can achieve schema-level transformation between O-Telos schema and W3C standard XML schema. By transforming Hyperbook data models, which are originally represented in O-Telos, into XML schemas, we can provide a standalone Hyperbook authoring environment which is able to directly utilize XML-schema-aware XML visual editors as a front-end GUI and enable lecturers to easily accomplish Hyperbook authoring.

关键词： XML Knowledge based systems Education Data models Graphical user interfaces Distributed computing Maintenance engineering Design engineering Organizing Distance learning

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共105页 << < 81 82 83 84 85 86 87 88 89 90 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：