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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

32 篇 会议
1 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

15 篇 工学
- 15 篇 计算机科学与技术...
- 13 篇 软件工程
- 3 篇 信息与通信工程
- 1 篇 动力工程及工程热...
- 1 篇 控制科学与工程
- 1 篇 化学工程与技术
- 1 篇 生物工程
- 1 篇 安全科学与工程
9 篇 理学
- 7 篇 数学
- 1 篇 化学
- 1 篇 生物学
- 1 篇 系统科学
- 1 篇 统计学（可授理学、...
8 篇 管理学
- 5 篇 图书情报与档案管...
- 3 篇 管理科学与工程(可...
- 2 篇 工商管理
1 篇 经济学
- 1 篇 应用经济学

主题

3 篇 hidden markov mo...
2 篇 discrete wavelet...
2 篇 computational mo...
2 篇 approximation me...
1 篇 iris recognition
1 篇 computer circuit...
1 篇 access control
1 篇 routing
1 篇 mobile ad hoc ne...
1 篇 computational co...
1 篇 internet protoco...
1 篇 computer crashes
1 篇 ad hoc networks
1 篇 bismuth
1 篇 integrated circu...
1 篇 manganese
1 篇 logic gates
1 篇 iterative method...
1 篇 optimization
1 篇 expert systems

机构

2 篇 punjabi universi...
2 篇 samsung india so...
2 篇 department of co...
2 篇 noida institute ...
2 篇 department of co...
2 篇 department of ma...
2 篇 department of co...
2 篇 department of co...
2 篇 department of co...
2 篇 ymca university ...
1 篇 department of co...
1 篇 information tech...
1 篇 ymca university ...
1 篇 dept. of electri...
1 篇 department of co...
1 篇 department of co...
1 篇 department of co...
1 篇 university of du...
1 篇 department of co...
1 篇 dst-centre for i...

作者

1 篇 makker silky
1 篇 agrawal ankit
1 篇 a.k. sharma
1 篇 mohanty rakesh
1 篇 h.s. behera
1 篇 b.k. mishra
1 篇 li wenjun
1 篇 aggarwal neha
1 篇 li jin
1 篇 neelam duhan
1 篇 gupta shilpy
1 篇 taneja sunil
1 篇 neha aggarwal
1 篇 s.k. das
1 篇 behera h.s.
1 篇 sunita choudhary
1 篇 manjari gupta
1 篇 zhao gansen
1 篇 gulati payai
1 篇 tripathy sasmita

语言

33 篇 英文

检索条件"任意字段=2nd International Conference on Methods and Models in Computer Science, ICM2CS-2010"

共 33 条记录，以下是11-20 订阅

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

详细简洁

排序：

Selection of cluster-head using PSO in CGSR protocol

Selection of cluster-head using PSO in CGSR protocol

引用

2nd international conference on methods and models in computer science, icm2cs-2010

作者： Raza, Haider Nandal, Poonam Makker, Silky Dept. of Computer Science and Engg. Manav. Rachna International University Faridabad India Dept. of Information Technology Manav. Rachna International University Faridabad India

ISBN: (纸本)9781424497034

Routing protocol for Ad Hoc Wireless Networks are categorised on the basis of routing information update mechanism, use of temporal information for routing, topolgy information organization and miscellaneous classification based on ultization of specific resources. The CGSR lies under table driven or proactive protocol based on routing information update mechanism. CGSR is a hierarchical routing scheme which enables partial cooridnation between nodes by electing cluster-heads. The main disadvantage of CGSR is increase in path length and instabilty in the system at high mobility when the rate of change of cluster-heads is high. The power consumption at the cluster-head node is also a matter of concern because the battery-draining rate at the cluster-head is higher than the normal node. This could lead to frequent change in cluster-head which may result in mulitple path breaks. In order to deal with this problem we have used PSO for choosing cluster-head in CGSR. The results obtained are good as compared to Least Cluster Change(LCC) algorithm and Genetic Algorithm (GA). This experiment is performed on MATLAB. © 2010 IEEE.

关键词： Routing protocols

来源：评论

学校读者我要写书评

暂无评论

Web search result optimization by mining the search engine query logs

Web search result optimization by mining the search engine q...

引用

2nd international conference on methods and models in computer science, icm2cs-2010

作者： Sharma, A.K. Aggarwal, Neha Duhan, Neelam Gupta, Ranjna Department of Computer Engineering YMCA University of Science and Technology Faridabad India Department of Computer Science and Engineering B.S.A. Institute of Technology and Management Faridabad India

ISBN: (纸本)9781424497034

Modern Information Retrieval Systems match the terms of a user query with available documents in their index and return a large number of Web pages generally in the form of a ranked list. It becomes almost impractical at the user end to examine every returned document, thus necessitating the need to look for some means of result optimization. In this paper, a novel result optimization technique based on learning from historical query logs is being proposed, which predicts users' information needs and reduces their navigation time within the result list. The method first performs query clustering in query logs based on a novel similarity function and then captures the sequential patterns of clicked web pages in each cluster using a sequential pattern mining algorithm. Finally, search result list is re-ranked by updating the existing PageRank values of pages using the discovered sequential patterns. The proposed work results in reduced search space as user intended pages tend to move upwards in the result list. © 2010 IEEE.

关键词： Websites

来源：评论

学校读者我要写书评

暂无评论

Applications of clustering algorithms and self organizing maps as data mining and business intelligence tools on real world data sets

Applications of clustering algorithms and self organizing ma...

引用

2nd international conference on methods and models in computer science, icm2cs-2010

作者： Singh, Lavneet Singh, Savleen Dubey, Parminder Kumar Faculty of Management and Computer Application R.B.S. College Agra India Noida Institute of Engineering and Technology Greater Noida India

ISBN: (纸本)9781424497034

Partitioning a large set of objects into homogeneous clusters is a fundamental operation in data mining. The k-means algorithm is best suited for implementing this operation because of its efficiency in clustering large data sets. In this paper we present a comparative study on different clustering algorithms with respect to k - means clustering to work on large data sets. In this paper we present a comparison among some nonhierarchical and hierarchical clustering algorithms including SOM (Self-Organization Map) neural networks methods. Data were simulated considering correlated and uncorrelated variables, non overlapping and overlapping clusters with and without outliers. Tested with Telecommunication Users and Iris Flower data set, the comparative algorithms had demonstrated a very good classification performance. Experiments on a very large telecommunication data set set consisting of 1000 records and 32 categorical attributes & Iris Flower data set consisting of 150 samples show that the SOM clustering with respect to k means & hierarchical clustering algorithm is scalable in terms of both the number of clusters and the number of records. © 2010 IEEE.

关键词： Self organizing maps

来源：评论

学校读者我要写书评

暂无评论

Design Pattern Detection by normalized cross correlation

Design Pattern Detection by normalized cross correlation

引用

2nd international conference on methods and models in computer science, icm2cs-2010

作者： Gupta, Manjari Pande, Akshara Rao, Rajwant Singh Tripathi, A.K. DST-Centre for Interdisciplinary Mathematical Sciences Department of Computer Science Banaras Hindu University Varanasi-221005 India Department of Computer Science Banaras Hindu University Varanasi-2210054 India Department of Computer Engineering Institute of Technology Banaras Hindu University Varanasi-221005 India

ISBN: (纸本)9781424497034

Design Pattern Detection has been documented so far in the literature. The knowledge of design Pattern existence in the program improves the program understanding and software maintenance. Design pattern is a technology for design reuse. Experts store their experiences in the form of design patterns. Reengineering done by novice users will be successful if a reliable design pattern mining exists. There are 23 design patterns defined by experts. Here we are taking the UML diagrams corresponding to design pattern and corresponding to source code. Our main aim is to find out whether a particular design pattern exists in system design (source code) or not. For this we have extracted the relationship graphs (consisting of nodes and edges), and then tried to detect the design pattern. In this paper we have applied normalized cross correlation and taking design pattern as a template tried to find out its existence in system design. Normalized cross correlation (NCC) has been used extensively for many machine vision applications. Normalized cross correlation has been commonly used to evaluate the degree of similarity or dissimilarity between two images. © 2010 IEEE.

关键词： Systems analysis

来源：评论

学校读者我要写书评

暂无评论

An improved architecture for minimizing handover latency in MIPv6

An improved architecture for minimizing handover latency in ...

引用

2nd international conference on methods and models in computer science, icm2cs-2010

作者： Gupta, Shilpy Gambhir, Sapna YMCA University of Science and Technology Faridabad Haryana India Department of Computer Science YMCA University of Science and Technology Faridabad Haryana India

ISBN: (纸本)9781424497034

With the advent of mobile devices, the internet now undertook a huge and unexpected explosion of growth. The wireless mobile internet gives users access to the internet services while they are on the move. This mobility has been supported through the Internet Protocol known as Mobile IP. Mobile IP allows users with mobile devices to have continuous network connectivity to the internet without changing their IP addresses when moving from one network to another. While on move, the Mobile Node (MN) undergoes a handover process, in which the MN gets disconnected from one network and tries to connect to another network, i.e., New Access Router (NAR). The handover process involves various time-consuming procedures as Neighbor Discovery, Care-of-Address (CoA) configuration, Duplicate-Address-Detection (DAD), Binding Registration and Route Optimization. Various researches have been devoted to the acceleration of movement detection and registration. However, a time-consuming operation, i.e., duplicate-address detection (DAD), was overlooked by most studies. An improved architecture for minimizing the handover latency in MIPv6 is improved in this paper. The improved architecture suggests the removal of DAD procedure and configuration of a new CoA for the MN by the NAR. The result is evaluated on the basis of numerical analysis. © 2010 IEEE.

关键词： Internet protocols

来源：评论

学校读者我要写书评

暂无评论

Image compression analysis using multistage vector quantization based on discrete wavelet transform

Image compression analysis using multistage vector quantizat...

引用

2nd international conference on methods and models in computer science, icm2cs-2010

作者： Brifcani, Adnan Mohsin Abdulazeez Al-Bamerny, Jwan Najeeb University of Duhok Computer Science Department Duhok City Iraq Technical Institute of Duhok Computer Systems Department Duhok City Iraq

ISBN: (纸本)9781424497034

A fundamental goal of digital image compression is to reduce the bit rate for transmission or data storage while maintaining an acceptable fidelity or image quality. In this study a proposed coding (compression) scheme for grey scale image by combining discrete wavelet transform (DWT), multistage vector quantization (MSVQ) and Huffman coding is presented. These combinations are utilized to take the advantages provided by all of them to get high compression ratio with acceptable recovered image quality in term of Peak Signal to Noise Ratio (PSNR) instead of using each method separately. First, the discrete wavelet transform is performed on the original image using bi-orthogonal 9/7 filter (bior4.4) resulting in number of sub-bands according to the decomposition level that can be one, two or three in the proposed scheme. Huffman coding applied on the approximation sub-band, and on the indices of the last level detail sub-bands that are vector quantized by two stages using LBG algorithm which forms the basis of most vector quantizer designs, other detail sub-bands set to zero if the decomposition level is greater than one to increase the compression ratio. © 2010 IEEE.

关键词： Discrete wavelet transforms

来源：评论

学校读者我要写书评

暂无评论

Optimization of media processor performance through sub word virtual register design

Optimization of media processor performance through sub word...

引用

2nd international conference on methods and models in computer science, icm2cs-2010

作者： Chauhan, Munesh Singh Information Technology Department College of Applied Sciences Ministry of Higher Education Sultanate of Oman Oman

ISBN: (纸本)9781424497034

Subword data is widely used in embedded applications, particularly related to media and network processing. The highest concentration of subword data length in embedded systems is in the 16-bit range. Since the conventional word size is 32-bit, on the average half of the registers remain unoccupied during the register allocation phase. Subword parallelism though less effective as compared to ILP (Instruction Level Parallelism), plays a defining role in latency reduction efforts. The latency issues are important to streaming media processing. In order to provide for the efficient use of registers, new primitive data types are proposed which enables packing of multiple subwords on a register. Since these new data types are operated on conventional instructions, there is very little increase in code size of a program. The work around creates a flexible packing algorithm which prevents the register to remain partially vacant. The use of gate logic to solve the subword packing in registers makes the algorithm efficient and fast. The technique further creates an opportunity to have a single programmable core for different application-specific media needs. In addition to this the use of simplified gate logic for the algorithm implementation makes the hardware implementation/ mapping of the algorithm much easier and error free. © 2010 IEEE.

关键词： computer circuits

来源：评论

学校读者我要写书评

暂无评论

Preface

Preface

引用

Proceeding of international conference on methods and models in computer science (icm2cs)

作者： T.V. Vijay Kumar Zahid Raza School of Engineering and Computer Science Victoria University of Wellington Wellington New Zealand Department of Electrical and Computer Engineering University of Canterbury Christchurch New Zealand

The School of computer and Systems sciences, Jawaharlal Nehru University, New Delhi organized its second international conference on methods and models in computer science, icm2cs-2010, on December 13–14, 2010. This was the fifth conference organized by the school after the success of the three national conferences and one international conference in past four years. The organizing committee wishes to express their sincere thanks to Prof. B.B. Bhattacharya, Vice Chancellor, Jawaharlal Nehru University for providing support to organize the conference.

关键词： Computational modeling

来源：评论

学校读者我要写书评

暂无评论

Comparison of Hidden Markov models and Support Vector Machines for vehicle crash detection

Comparison of Hidden Markov Models and Support Vector Machin...

引用

Proceeding of international conference on methods and models in computer science (icm2cs)

作者： Gautam B. Singh Haiping Song Department of Computer Science and Engineering Oakland University Rochester MI USA

In this paper, machine-learning techniques, such as Hidden Markov models (HMMs) and Support Vector Machines (SVMs), are applied to discriminate vehicle crashes. Both HMMs and SVMs are optimal with respect to their individual objectives. However, the performances between these two models may be very different depending on how their respective assumptions match with reality. With the exception of some benchmark reports, there is little literature comparing these two promising pattern recognition approaches. In this paper, we compare these two models analytically and experimentally, using a third intermediary method of the Linear Discriminant Analysis (LDA) for detection of crash pulses.

关键词： Hidden Markov models Driver circuits computer crashes

来源：评论

学校读者我要写书评

暂无评论

The application of sixth order accurate parallel quarter sweep alternating group explicit algorithm for nonlinear boundary value problems with singularity

The application of sixth order accurate parallel quarter swe...

引用

Proceeding of international conference on methods and models in computer science (icm2cs)

作者： Navnit Jha Department of Mathematics Rajiv Gandhi Institute of Petroleum Technology Rae Bareli Uttar Pradesh India

The aim of this paper is to describe the formulation of quarter sweep alternating group explicit (QSAGE) iterative method using six order accurate finite difference approaches for solving nonlinear singular two point boundary value problems. The proposed QSAGE method shows the superiority over corresponding full sweep AGE and SOR method. The proposed method is applicable to problems both in Cartesian and polar coordinate and suitable for use on parallel computers. Computational results are provided to illustrate the proposed method.

关键词： Approximation methods

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：