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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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,056 篇 会议
6 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

305 篇 工学
- 292 篇 计算机科学与技术...
- 193 篇 软件工程
- 77 篇 信息与通信工程
- 75 篇 电气工程
- 15 篇 控制科学与工程
- 11 篇 光学工程
- 8 篇 电子科学与技术（可...
- 5 篇 安全科学与工程
- 3 篇 机械工程
- 3 篇 仪器科学与技术
- 3 篇 轻工技术与工程
- 3 篇 生物工程
- 2 篇 化学工程与技术
- 2 篇 生物医学工程（可授...
- 2 篇 网络空间安全
- 1 篇 动力工程及工程热...
57 篇 医学
- 56 篇 临床医学
- 2 篇 基础医学(可授医学...
54 篇 理学
- 41 篇 数学
- 14 篇 物理学
- 13 篇 统计学（可授理学、...
- 6 篇 系统科学
- 4 篇 生物学
- 1 篇 化学
42 篇 管理学
- 31 篇 图书情报与档案管...
- 15 篇 管理科学与工程(可...
- 8 篇 工商管理
8 篇 法学
- 5 篇 法学
- 4 篇 社会学
2 篇 教育学
- 2 篇 教育学
2 篇 农学

主题

220 篇 information tech...
180 篇 computer science
111 篇 information retr...
94 篇 internet
85 篇 application soft...
69 篇 image coding
62 篇 cryptography
61 篇 data mining
56 篇 computer archite...
55 篇 costs
55 篇 information secu...
55 篇 computer network...
51 篇 information syst...
49 篇 protection
47 篇 grid computing
45 篇 bandwidth
45 篇 humans
44 篇 mobile computing
42 篇 watermarking
41 篇 robustness

机构

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 篇 department of co...
4 篇 information syst...
4 篇 community grids ...
4 篇 deis university ...
4 篇 center for advan...
4 篇 department of co...
4 篇 gippsland school...
4 篇 school of comput...
4 篇 information scie...
3 篇 univ lecce ctr a...
3 篇 department of co...
3 篇 iit dept comp sc...
3 篇 department of co...
3 篇 illinois institu...

作者

10 篇 d. grossman
8 篇 l.s. dooley
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 篇 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,062 篇 英文

检索条件"任意字段=ITCC 2005 - International Conference on Information Technology: Coding and Computing"

共 1062 条记录，以下是611-620 订阅

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

详细简洁

排序：

Replicate relational and XML databases for Internet computing

Replicate relational and XML databases for Internet computin...

引用

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

作者： J. Fong H.K. Wong Computer Science Department City University of Hong Kong Hong Kong China

Most XML-enabled database management systems can only translate a few relations into an XML document. Moreover, the translation is without data semantics constraints consideration, which may not be sufficient for information highway on the Web. The demand on database is increased in e-commerce. Not only relational database (RDB) is needed for traditional data processing, but also its equivalent XML documents (database) are needed for B2B applications. Therefore, performance for online conversion from relational data to XML document is an issue. This paper aims to create a replicate XML database for a company's RDB to improve database performance, and to automate XML database recovery in case of system failures. For any successful update to the RDB, corresponding update will be applied to its replicate XML database. The result is an incrementally maintained XML database for efficient and effective computing for e-commerce. In summary, Internet computing performance can be improved because a replicate XML database and its counterpart RDB can be parallel processing for both internal data and external data transmission on the Internet. Furthermore, an XML database can be recovered by its counterpart RDB once it is down.

关键词： XML Relational databases Internet Data processing Concurrent computing Parallel processing Search engines Computer science Database systems Road transportation

来源：评论

学校读者我要写书评

暂无评论

ProtoMon: embedded monitors for cryptographic protocol intrusion detection and prevention

ProtoMon: embedded monitors for cryptographic protocol intru...

引用

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

作者： S.P. Joglekar S.R. Tate Department of Computer Science and Engineering University of North Texas Denton TX USA

Intrusion detection systems (IDS) are responsible for monitoring and analyzing host or network activity to detect intrusions in order to protect information from unauthorized access or manipulation. There are two main approaches for intrusion detection: signature-based and anomaly-based. Signature-based detection employs pattern matching to match attack signatures with observed data making it ideal for detecting known attacks. However, it cannot detect unknown attacks for which there is no signature available. Anomaly-based detection uses machine-learning techniques to create a profile of normal system behavior and uses this profile to detect deviations from the normal behavior. Although this technique is effective in detecting unknown attacks, it has a drawback of a high false alarm rate. In this paper, we describe our anomaly-based IDS designed for detecting malicious use of cryptographic and application-level protocols. Our system has several unique characteristics and benefits, such as the ability to monitor cryptographic protocols and application-level protocols embedded in encrypted sessions, a very lightweight monitoring process, and the ability to react to protocol misuse by modifying protocol response directly.

关键词： Cryptographic protocols Intrusion detection Cryptography Communication system security Pattern matching Computer displays Computer science Computerized monitoring information analysis Protection

来源：评论

学校读者我要写书评

暂无评论

Modelling long duration transactions with time constraints in active database

Modelling long duration transactions with time constraints i...

引用

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

作者： D.S. Yadav R. Agrawal D.S. Chauhan R.C. Saraswat A.K. Majumdar Institute of Engineering & Technology Uttar Pradesh Technical University Lucknow India Department of Computer Science Kettering University Flint MI USA Department of Computer Science and Engineering Indian Institute of Technology Kharagpur India

The applications like situation assessment, object tracking, trading & stock control, and workflow management require actions to be taken in stringent time frame for full benefit of the system. These applications also require identifying the occurrence of desired event, to take appropriate action when an event of interest is found to have occurred while maintaining timing constraints. Active database with ECA rule provides the mechanism to capture the different database events and provide timely response but do not guarantee timely processing of real time transactions because of their inability to express time constraints explicitly. Most of the time constrained real life application requires both active and real time characteristics. Long duration transactions with explicit time constraints are more vulnerable to failures and they are subject to heavy compensations in case of aborts. The paper intends to investigate the construct required for modelling of transactions with timing constraints, cooperation semantics and run time monitoring of these constraints in active database.

关键词： Time factors Transaction databases Timing Database systems Real time systems Data engineering Computer science Application software Radio control technology management

来源：评论

学校读者我要写书评

暂无评论

A new framework for uncertainty sampling: exploiting uncertain and positive-certain examples in similarity-based text classification

A new framework for uncertainty sampling: exploiting uncerta...

引用

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

作者： K.H. Lee B.H. Kang School of Information Technologies University of Sydney NSW Australia School of Computing University of Tasmania Hobart TAS Australia

One of the major concerns with supervised learning approaches to text classification is that they require a large number of labeled examples to achieve a high level of effectiveness. Labeling such a large number of examples poses a considerable burden on human experts. Two common approaches to reduce the amount of labeled examples required are: (1) selecting informative uncertain examples for human-labeling and (2) using many inexpensive unlabeled data with a small number of labeled examples. While previous work in text classification focused only on one approach, we investigate a framework to combine both approaches in similarity-based text classification. By applying our new thresholding strategy (RinSCut) to uncertainty sampling, we propose a new framework which automatically selects informative uncertain data that should be presented to human expert for labeling and positive-certain data that are directly used for learning without human-labeling. With our similarity-based learning algorithm (KAN), experiments have been conducted on Reuters-21578 data set. Our proposed scheme has been compared with random sampling and previous conventional uncertainly sampling, based on micro and macroaveraged F/sub 1/. The results showed that if both macro and microaveraged measures are concerned, the optimal choice might be our framework.

关键词： Uncertainty Sampling methods Text categorization Labeling Humans information technology Australia Machine learning Supervised learning Natural languages

来源：评论

学校读者我要写书评

暂无评论

Building decision trees using functional dependencies

Building decision trees using functional dependencies

引用

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

作者： Kwok-Wa Lam V.C.S. Lee Department of Computer Science City University of Hong Kong Hong Kong China

Decision tree (DT) induction is regarded as a representative of traditional approaches to classification rule mining which is an important technique for many data mining applications. Using a heuristic-based local search, DT induction appends attribute at a time to rules in the order of goodness. This method may eliminate some typical structures that several attributes collectively determine the class. Recently, there has been growing interest in the problem of discovering functional dependencies (FDs) from existing databases [[Flach et al.], [Y. Huhtala et al., (1999)], [Lopes et al.], [Novelli et al.]]. Some efficient and scalable algorithms have been proposed. In this paper, we present a new method to build a DT classifier using approximate FDs [Y. Huhtala et al., (1999)]. The new method is different from the traditional ways of building DTs in that it searches composite attributes for individual node of a DT which leads to substantially smaller and more understandable DTs without adversely affecting the accuracy gains. Experiments showed that the new method not only builds more accurate classifiers, but also does this with more compact structures.

关键词： Decision trees Data mining Classification tree analysis Relational databases Computer science Application software Buildings Tree data structures information technology Data warehouses

来源：评论

学校读者我要写书评

暂无评论

A Web-service oriented framework for building SCORM compatible learning management systems

A Web-service oriented framework for building SCORM compatib...

引用

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

作者： Chih-Ping Chu Ching-Pao Chang Chung-Wei Yeh Yu-Fang Yeh Department of computer science & Info. Engineering National Cheng Kung University Tainan Taiwan Institute of Computer Science & Info. Education National Tainan Teachers College Taiwan

ISBN: (纸本)0769521088

Managing the large amount of learning content involved in the development of an expandable learning management system (LMS) is a critical task for most educational organizations. In designing such a system, consideration must be given not only to the requirement of instructors and students, but also to the adaptive qualities of the system itself, because of the rapidly changing software environment. Unlike most enterprises, educational organization can't afford high system maintenance. Development of a flexible, expandable and reliable learning management system is, therefore, imperative. This paper proposes a Web service oriented framework in building a sharable content object reference model (SCORM) compatible LMS. We integrated the SCORM concept with distributed computing technologies to build the components of the LMS and demonstrate how these services can be configured to create a complete system. This framework increases reusability and reduces the maintenance requirements of the LMS. It provides a way for small educational organizations, with limited resources, to build a complete SCORM compatible LMS. In such an ideal situation, the content provider not only provides the content, but also the service for the consumers of that content.

关键词： Least squares approximation Web services Programming profession Content management Computer science Distributed computing Educational technology technology management Computer architecture Computer science education

来源：评论

学校读者我要写书评

暂无评论

Security protection and checking in embedded system integration against buffer overflow attacks

Security protection and checking in embedded system integrat...

引用

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

作者： Zili Shao Chun Xue Qingfeng Zhuge E.H.-M. Sha Bin Xiao Department of Computer Science University of Texas Dallas Richardson TX USA Department of Computing Hong Kong Polytechnic University Hong Kong China

With more embedded systems networked, it becomes an important research problem to effectively defend embedded systems against buffer overflow attacks and efficiently check if systems have been protected. In this paper, we propose the HSDefender (hardware/software Defender) technique that considers the protection and checking together to solve this problem. Our basic idea is to design a secure instruction set and require third-party software developers to use secure instructions to call functions. Then the security checking can be easily performed by system integrators even without the knowledge of the source code. We first classify buffer overflow attacks into two categories, stack smashing attacks and function pointer attacks, and then provide two corresponding defending strategies. We analyze the HSDefender technique in respect of hardware cost, security, and performance, and experiment with it on the SimpleScalar/ARM simulator using benchmarks from MiBench. The results show that HSDefender can defend a system against more types of buffer overflow attacks with less overhead compared with the previous work.

关键词： Protection Embedded system Buffer overflow Security Hardware Costs Application software Embedded software Computer crashes Computer science

来源：评论

学校读者我要写书评

暂无评论

On-line generation of suggestions for Web users

On-line generation of suggestions for Web users

引用

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

作者： F. Silvestri R. Baraglia P. Palmerini M. Serrano National Research Council Information Science and Technologies Institute Pisa Italy

The knowledge extracted from the analysis of historical information of a Web server can be used to develop personalization or recommendation systems. Web usage mining (WUM) systems are specifically designed to carry out this task by analyzing the data representing usage data about a particular Web site. Typically these systems are composed by two parts. One, executed offline, that analyze the server access logs in order to find a suitable categorization, and another executed online which is aimed at classifying the active requests, according to the previous offline analysis. In this paper we propose a WUM recommendation system, implemented as a module of the Apache Web server that is able to dynamically generate suggestions to pages that have not yet been visited by a user and might be of his potential interest. Differently from previously proposed WUM systems, SUGGEST 2.0 incrementally builds and maintains the historical information, without the need for an offline component, by means of an incremental graph partitioning algorithm. In the last part, we also analyze the quality of the suggestions generated and the performance of the module implemented. To this purpose we introduce also a new quality metric, which try to estimate the effectiveness of a recommendation system as the capacity of anticipating users' requests that will be made farther in the future.

关键词： Web server Data mining Data analysis Delta modulation File servers information science Councils information analysis Web page design Partitioning algorithms

来源：评论

学校读者我要写书评

暂无评论

On the importance of protecting /spl Delta/ in SFLASH against side channel attacks

On the importance of protecting /spl Delta/ in SFLASH agains...

引用

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

作者： K. Okeya T. Takagi C. Vuillaume Systems Development Laboratory Hitachi and Limited Yokohama Japan Fachbereich Informatik Technische Universität Darmstadt Darmstadt Germany

SFLASH was chosen as one of the final selection of the NESSIE project in 2003. It is one of the most efficient digital signature schemes and is suitable for implementation on memory-constrained devices such as smartcards. Side channel attacks (SCA) are a serious threat to memory-constrained devices. If the implementation on them is careless, we are able to break the secret key. We experimentally analyze the effectiveness of a side channel attack on SFLASH. There are two different secret keys for SFLASH, namely the proper secret key (s, t) and the random seed /spl Delta/ used for the hash function SHA-1. Whereas many papers discussed the security of (s, t), little is known about that of /spl Delta/. Steinwandt et al. proposed a theoretical DPA on finding /spl Delta/ by observing the XOR operations. We propose another DPA on /spl Delta/ using the addition operation modulo 2/sup 32/, and present an experimental result of the DPA. After obtaining the secret key /spl Delta/, the underlying problem of SFLASH can be reduced to the C* problem broken by Patarin. From our simulation, about 1408 pairs of messages and signatures are needed to break SFLASH. Consequently, we have to carefully implement SHA-1 in order to resist SCA on SFLASH.

关键词： Protection Public key cryptography information security information technology Public key Resists Galois fields

来源：评论

学校读者我要写书评

暂无评论

Arbitrary trajectories tracking using multiple model based particle filtering in infrared image sequence

Arbitrary trajectories tracking using multiple model based p...

引用

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

作者： M.A. Zaveri S.N. Merchant U.B. Desai SPANN Laboratory Electrical Engineering Department Indian Institute of Technology Bombay India

Particle filtering is being investigated extensively due to its important feature of target tracking based on nonlinear and non-Gaussian model. It tracks a trajectory with a known model at a given time. It means that particle filter tracks an arbitrary trajectory only if the time instant when trajectory switches from one model to another model is known apriori. Because of this reason particle filter is not able to track any arbitrary trajectory where transition from one model to another model is not known. For real world application, trajectory is always random in nature and may follow more than one model. In this paper we propose a novel method, which overcomes the above problem. In the proposed method an interacting multiple model based approach is used along with particle filtering, which automates the model selection process for tracking an arbitrary trajectory. We have utilized nearest neighbor (NN) method for data association, which is fast and easy to implement. In the proposed approach, there is no need to have apriori information about the exact model that a target may follow.

关键词： Trajectory Particle tracking Filtering Infrared imaging Image sequences Target tracking Particle filters Switches Nearest neighbor searches Neural networks

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共107页 << < 58 59 60 61 62 63 64 65 66 67 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：