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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

14,455 篇 会议
1,287 篇 期刊文献
2 篇 资讯
1 篇 学位论文

馆藏范围

15,745 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

3,673 篇 工学
- 1,946 篇 计算机科学与技术...
- 1,735 篇 电气工程
- 710 篇 信息与通信工程
- 554 篇 控制科学与工程
- 546 篇 软件工程
- 286 篇 机械工程
- 232 篇 电子科学与技术（可...
- 231 篇 仪器科学与技术
- 46 篇 测绘科学与技术
- 38 篇 交通运输工程
- 30 篇 网络空间安全
- 22 篇 航空宇航科学与技...
- 16 篇 材料科学与工程（可...
- 16 篇 生物医学工程（可授...
- 15 篇 矿业工程
- 13 篇 土木工程
- 12 篇 石油与天然气工程
- 9 篇 动力工程及工程热...
371 篇 管理学
- 368 篇 管理科学与工程(可...
310 篇 理学
- 131 篇 系统科学
- 73 篇 数学
- 55 篇 物理学
- 28 篇 生物学
- 25 篇 地球物理学
- 12 篇 统计学（可授理学、...
82 篇 医学
- 75 篇 临床医学
59 篇 文学
- 59 篇 新闻传播学
21 篇 艺术学
- 21 篇 设计学（可授艺术学...
16 篇 农学
14 篇 军事学
- 14 篇 军队指挥学
10 篇 教育学
- 9 篇 教育学
2 篇 经济学
2 篇 法学

主题

15,745 篇 partitioning alg...
4,684 篇 clustering algor...
3,088 篇 algorithm design...
1,673 篇 computer science
1,281 篇 heuristic algori...
1,133 篇 data mining
889 篇 computational mo...
749 篇 hardware
735 篇 costs
724 篇 optimization
720 篇 image segmentati...
658 篇 iterative algori...
593 篇 parallel process...
576 篇 approximation al...
576 篇 testing
561 篇 routing
505 篇 computer archite...
477 篇 concurrent compu...
461 篇 very large scale...
444 篇 shape

机构

40 篇 ibm thomas j. wa...
38 篇 department of co...
31 篇 school of comput...
25 篇 department of co...
22 篇 department of co...
20 篇 department of el...
18 篇 school of comput...
18 篇 department of co...
18 篇 department of el...
18 篇 at and t bell la...
17 篇 department of co...
17 篇 school of electr...
16 篇 school of comput...
16 篇 department of el...
16 篇 institute of com...
16 篇 department of el...
15 篇 department of co...
15 篇 department of co...
15 篇 department of el...
15 篇 school of electr...

作者

25 篇 xianlong hong
19 篇 hichem frigui
15 篇 yici cai
14 篇 sanghamitra band...
13 篇 jun wang
13 篇 g. karypis
13 篇 li li
13 篇 jing wang
12 篇 sriparna saha
12 篇 tzung-pei hong
12 篇 a.k. jain
12 篇 thambipillai sri...
11 篇 suleyman s. koza...
11 篇 hau-san wong
11 篇 yu wang
11 篇 hui wang
11 篇 jian-jia chen
11 篇 p. banerjee
11 篇 sanjoy baruah
11 篇 francisco de a.t...

语言

15,591 篇 英文
122 篇 其他
32 篇 中文

检索条件"主题词=partitioning algorithms"

共 15745 条记录，以下是4941-4950 订阅

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

详细简洁

排序：

Efficient compositing methods for the sort-last-sparse parallel volume rendering system on distributed memory multicomputers

Efficient compositing methods for the sort-last-sparse paral...

引用

International Conference on Parallel Processing (ICPP)

作者： Don-Lin Yang Jen-Chih Yu Yeh-Ching Chung Department of Information Engineering Feng Chia University FCU Taichung Taiwan

ISBN: (纸本)0769503500

In the sort-last-sparse parallel volume rendering system on distributed memory multicomputers, as the number of processors increases, in the rendering phase, we can get a good speedup because each processor renders images locally without communicating with other processors. However, in the compositing phase, a processor has to exchange local images with other processors. When the number of processors is over a threshold, the image compositing time becomes a bottleneck. In this paper, we proposed three compositing methods, the binary-swap with bounding rectangle method, the binary-swap with run-length encoding and static load-balancing method, and the binary-swap with bounding rectangle and run-length encoding method, to efficiently reduce the compositing time in the sort-last-sparse parallel volume rendering system on distributed memory multicomputers. The proposed methods were implemented on an SP2 parallel machine along with the binary-swap compositing method. The experimental results show that the binary-swap with bounding rectangle and run-length encoding method has the best performance among the four methods.

关键词： Rendering (computer graphics) Data visualization Encoding partitioning algorithms Computer graphics Multiprocessing systems Ray tracing Merging

来源：评论

学校读者我要写书评

暂无评论

Bandwidth efficient and error resilient image coding for Rayleigh fading channels

Bandwidth efficient and error resilient image coding for Ray...

引用

IEEE Conference on Vehicular Technology (VTC)

作者： S. Manji G. Djuknic Lucent Technologies Inc. Whippany NJ USA

The transmission of still images over wireless channels is an exercise in tradeoffs. For bandwidth efficiency, a high source compression rate is required. However, the transmission must be robust towards channel errors since wireless channels are subject to fading. These are conflicting requirements. High source compression rates result in images that are very vulnerable to any single bit error. Low-rate channel coding to protect highly compressed images from channel errors drastically reduces the bandwidth efficiency. The combinations of set partitioning in hierarchical trees (SPIHT) wavelet based source coding and list Viterbi (1971) algorithm (LVA) for channel decoding allows for bandwidth efficient, error resilient image transmission over wireless channels. SPIHT offers compression superior to existing DCT and fractal based algorithms. LVA decoding outperforms conventional Viterbi decoding at the expense of an increase in complexity. We construct a system model to transmit raw images over AWGN and narrowband Rayleigh fading channels with SPIHT source coding and LVA decoding using rate compatible punctured convolutional (RCPC) codes. We also propose a method of unequal error protection over the channel. We show that this scheme is superior to equal error protection under the premise that there is a minimum acceptable level of image quality below which the received image has no utility.

关键词： Bandwidth Image coding Decoding Protection Source coding Viterbi algorithm partitioning algorithms Robustness Rayleigh channels Channel coding

来源：评论

学校读者我要写书评

暂无评论

Reconfigurable hardware for addition chains based modular exponentiation

Reconfigurable hardware for addition chains based modular ex...

引用

International Conference on Information Technology: Coding and Computing (ITCC)

作者： L. de Macedo Mourelle N. Nedjah Department of Systems Engineering and Computation State University of Rio de Janeiro Brazil Department of Electronics Engineering and Telecommunications Faculty of Engineering State University of Rio de Janeiro Brazil

In several public-key cryptosystems, the main operation consists of the modular exponentiation, which is performed using successive modular multiplications. The size of the operands that are used in these cryptosystems is considerably large (1024 bits), consuming a considerable amount of time. This impacts on the performance of the cryptosystem, especially in real time applications. In order to reduce the execution time in these cryptosystems, the total number of modular multiplications must be reduced. There are several methods that attempt to reduce this number either by partitioning the exponent in windows or by reducing the number of elements to be multiplied. In this paper, we propose a fast and compact reconfigurable hardware for computing modular exponentiation using the addition-chain methods.

关键词： Hardware Elliptic curve cryptography Public key cryptography partitioning algorithms Systems engineering and theory Telecommunication computing Elliptic curves Computer architecture Information technology

来源：评论

学校读者我要写书评

暂无评论

Event log analysis with the LogCluster tool

Event log analysis with the LogCluster tool

引用

MILCOM, Military Communications Conference

作者： Risto Vaarandi Markus Kont Mauno Pihelgas Tallinna Tehnikaulikool Tallinn Harjumaa EE Technology Branch NATO CCD COE Tallinn Estonia

ISBN: (纸本)9781509037827

Today, event logging is a widely accepted concept with a number of event formatting standards and event collection protocols. Event logs contain valuable information not only about system faults and performance issues, but also about security incidents. Unfortunately, since modern data centers and computer networks are known to produce large volumes of log data, the manual review of collected data is beyond human capabilities. For automating this task, a number of data mining algorithms and tools have been suggested in recent research papers. In this paper, we will describe the application of the LogCluster tool for mining event patterns and anomalous events from security and system logs.

关键词： Clustering algorithms Data mining Mars Filtering Computer security partitioning algorithms

来源：评论

学校读者我要写书评

暂无评论

A public mesh watermarking algorithm based on addition property of Fourier transform

A public mesh watermarking algorithm based on addition prope...

引用

International Conference on Image and Graphics (ICIG)

作者： Li Li Zhigeng Pan David Zhang Hangzhou Dianzi University Hangzhou China State Key Laboratory of CAD&CG University of Zhejiang Hangzhou China Multimedia Signal Processing and Department of Computing Hong Kong Polytechnic University Kowloon Hong Kong China

This paper presents a public mesh watermarking algorithm. First, the resultant watermarked image minus the original image is the watermark information. According to the addition property of the Fourier transform, a change of spatial domain will cause a change in the frequency domain. Then, the watermark information is scaled down and embedded in one part of the x-coordinate of the original mesh. Finally, the x-coordinate of the test mesh is amplified before extraction. Experimental results prove that our algorithm is resistant to a variety of attacks without the need for any preprocessing.

关键词： Watermarking Fourier transforms Signal processing algorithms Data mining Frequency domain analysis Wavelet domain partitioning algorithms Noise robustness Equations Electronic mail

来源：评论

学校读者我要写书评

暂无评论

Optimizing Mobile Computational Offloading with Delay Constraints

Optimizing Mobile Computational Offloading with Delay Constr...

引用

IEEE Global Communications Conference

作者： Yi-Hsuan Kao Bhaskar Krishnamachari Dept. of Electr. Eng. Univ. of Southern California Los Angeles CA USA

ISBN: (纸本)9781479935130

Computation Offloading, sending computational tasks to more resourceful servers, is becoming a widely-used approach to save limited resources on mobile devices like battery life, storage, processor, etc. Given an application that is partitioned into multiple tasks, the offloading decisions can be made on each of them. However, considering the delay constraint and the extra costs on data transmission and remote computation, it is not trivial to make optimized decisions. Existing works have formulated offloading decision problems as either graph-partitioning or binary integer programming problems. The first approach can solve the problem in polynomial time but is not applicable to delay constraints. The second approach relies on an integer programming solver without a polynomial time guarantee. We provide an algorithm, DTP (Deterministic delay constrained Task partitioning), to solve the offloading decision problem with delay constraints. DTP gives near-optimal solution and runs in polynomial time in the number of tasks. Going beyond prior work on linear delay constraints that apply only to serial tasks, we generalize the delay constraints to settings where the dependency between tasks can be described by a tree. Furthermore, we provide another algorithm, PTP (Probabilistic delay constrained Task partitioning), which gives stronger QoS guarantees. Simulation results show that our algorithms are accurate and robust, and scale well with the number of tasks.

关键词： integer programming mobile computing mobile handsets probability binary integer programming data transmission deterministic delay constrained task partitioning graph-partitioning integer programming solver linear delay constraints mobile computational offloading mobile devices offloading decisions probabilistic delay constrained task partitioning remote computation Delays Mobile communication Optimization partitioning algorithms Polynomials Quantization (signal) Radio frequency

来源：评论

学校读者我要写书评

暂无评论

Performance Tuning of Steganography Algorithm for Privacy Preserving Association Rule Mining in Heterogeneous Data Base

Performance Tuning of Steganography Algorithm for Privacy Pr...

引用

New Technologies, Mobility and Security (NTMS)

作者： Mahmoud Hussein Ashraf El-Sisi Nabil Ismail Computer Science Department Faculty of computers and Information Menoufia University Shibin El Kom Egypt

Privacy and security issues in data mining become an important property in any data mining system. A considerable research has focused on developing new data mining algorithms that incorporate privacy constraints. In this paper, we focus on privately mining association rules in vertically partitioned data where the problem has been reduced to privately computing Boolean scalar products. We propose a modification of steganography-based multiparty protocols for this problem. The proposed modification fine tune the performance to be faster in case of very large database, with acceptable level of reduction in privacy.

关键词： Steganography Data privacy Association rules Data mining Distributed databases partitioning algorithms Cryptographic protocols Data security Information security Circuits

来源：评论

学校读者我要写书评

暂无评论

GDILC: a grid-based density-isoline clustering algorithm

GDILC: a grid-based density-isoline clustering algorithm

引用

International Conferences on Info-tech and Info-net (ICII)

作者： Zhao Yanchang Song Junde CTI Centre of BUPT Electronic Engineering School Beijing University of Posts and Telecommunications Beijing China

A novel clustering algorithm, the grid-based density-isoline clustering (GDILC) algorithm is put forward in this paper. The central idea of GDILC is that the density-isoline figure depicts the distribution of data samples very well. We use a grid-based method to calculate the density of each data sample, and find relatively dense regions, which are just clusters. GDILC is capable of eliminating outliers and finding clusters of various shapes. It is an unsupervised clustering algorithm because it requires no human interaction. The high speed and accuracy of the GDILC clustering algorithm is shown in our experiments.

关键词： Clustering algorithms partitioning algorithms Shape Data mining Histograms Humans Density functional theory Clustering methods

来源：评论

学校读者我要写书评

暂无评论

A multiple description coding method based on 3-D SPIHT for videos

A multiple description coding method based on 3-D SPIHT for ...

引用

International Conference on Machine Learning and Cybernetics (ICMLC)

作者： Shung-Fu Yang Chin-Pan Huang Bor-Jiunn Hwang Department of Computer and Communication Engineering Ming Chuan University Taoyuan Taiwan

This study presents a new multiple description coding method based on a three-dimensional set partitioning in hierarchical trees (3-D SPIHT) algorithm in WiMAX for videos. Applying a poly-phase sampling technique to sample an input video over its intra-frame or inter-frame, several independent and highly correlated descriptions are generated. Then, a 3-D SPIHT algorithm is applied to each of the produced descriptions. Finally, the coding results are transmitted via different channels. This proposed approach achieves high compression ratio, enhances transmission speed, and more importantly, attains acceptable video quality when channel congestion occurs. Experimental results are provided to demonstrate promising performance of the proposed method.

关键词： Videos PSNR WiMAX Image coding Encoding partitioning algorithms Algorithm design and analysis

来源：评论

学校读者我要写书评

暂无评论

Efficient search approaches for k-medoids-based algorithms

Efficient search approaches for k-medoids-based algorithms

引用

IEEE Region 10 International Conference TENCON

作者： Shu-Chuan Chu J.F. Roddick Tsong-Yi Chen Jeng-Shyang Pan School of Informatics and Engineering Flinders University of South Australia Australia Department of Electronic Engineering National Kaohsiung University of Applied Sciences Taiwan Department of Electrical and Electronic Engineering University of Adelaide Australia

In this paper, the concept of previous medoid index is introduced. The utilization of memory for efficient medoid search is also presented. We propose a hybrid search approach for the problem of nearest neighbor search. The hybrid search approach combines the previous medoid index, the utilization of memory, the criterion of triangular inequality elimination and the partial distance search. The proposed hybrid search approach is applied to the k-medoids-based algorithms. Experimental results based on Gauss-Markov source, curve data set and elliptic clusters demonstrate that the proposed algorithm applied to the CLARANS algorithm may reduce the number of distance calculations from 88.4% to 95.2% with the same average distance per object compared with CLARANS. The proposed hybrid search approach can also be applied to nearest neighbor searching and the other clustering algorithms.

关键词： Clustering algorithms partitioning algorithms Computational complexity Nearest neighbor searches Data mining Vector quantization Simulated annealing Iterative algorithms Informatics Gaussian processes

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 491 492 493 494 495 496 497 498 499 500 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：