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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

458 篇 会议
24 篇 期刊文献
3 册 图书

馆藏范围

484 篇 电子文献
1 种 纸本馆藏

日期分布

学科分类号

323 篇 工学
- 254 篇 计算机科学与技术...
- 142 篇 软件工程
- 52 篇 电气工程
- 44 篇 信息与通信工程
- 34 篇 土木工程
- 20 篇 生物医学工程（可授...
- 17 篇 建筑学
- 16 篇 材料科学与工程（可...
- 15 篇 控制科学与工程
- 13 篇 仪器科学与技术
- 12 篇 机械工程
- 11 篇 光学工程
- 10 篇 力学（可授工学、理...
- 10 篇 测绘科学与技术
- 10 篇 生物工程
- 6 篇 化学工程与技术
113 篇 理学
- 68 篇 数学
- 22 篇 物理学
- 20 篇 生物学
- 13 篇 统计学（可授理学、...
- 9 篇 化学
- 7 篇 地质学
- 7 篇 系统科学
- 6 篇 地球物理学
43 篇 管理学
- 23 篇 图书情报与档案管...
- 22 篇 管理科学与工程(可...
- 10 篇 工商管理
23 篇 医学
- 18 篇 临床医学
- 9 篇 特种医学
- 7 篇 医学技术（可授医学...
4 篇 农学
3 篇 经济学
3 篇 法学
3 篇 教育学
3 篇 文学

主题

98 篇 data structures
36 篇 data mining
22 篇 computer science
17 篇 clustering algor...
12 篇 algorithms
12 篇 internet
12 篇 algorithm design...
10 篇 structural healt...
10 篇 classification a...
10 篇 data models
9 篇 computer archite...
9 篇 image segmentati...
9 篇 protocols
9 篇 hardware
9 篇 partitioning alg...
8 篇 databases
7 篇 scalability
7 篇 deep learning
7 篇 costs
7 篇 machine learning

机构

5 篇 fujian prov univ...
5 篇 hubei univ techn...
4 篇 microsoft resear...
3 篇 chandigarh unive...
3 篇 wuhan fiberhome ...
2 篇 univ michigan an...
2 篇 institute of aer...
2 篇 engineer dxc tec...
2 篇 fermilab natl ac...
2 篇 southwest jiaoto...
2 篇 department of co...
2 篇 lovely professio...
2 篇 univ maryland de...
2 篇 int hellen univ ...
2 篇 aeronautics-tech...
2 篇 peking univ ctr ...
2 篇 lloyd institute ...
2 篇 nci frederick ca...
2 篇 college of engin...
2 篇 heriot watt univ...

作者

5 篇 ye zhiwei
3 篇 lehner wolfgang
2 篇 shatsky maxim
2 篇 monaco ernesto
2 篇 montenegro manue...
2 篇 catthoor francky
2 篇 scholz sven-bodo
2 篇 napoli amedeo
2 篇 tjortjis christo...
2 篇 chen chen
2 篇 thiele maik
2 篇 weifeng lv
2 篇 fischer ulrike
2 篇 yan lingyu
2 篇 praveen
2 篇 saxena sanjeev
2 篇 dror oranit
2 篇 tongyu zhu
2 篇 wolfson haim j.
2 篇 ouyang cheng

语言

476 篇 英文
4 篇 其他
2 篇 俄文
2 篇 中文
1 篇 乌克兰文

检索条件"任意字段=10th International Workshop on Algorithms and Data Structures"

共 485 条记录，以下是351-360 订阅

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

详细简洁

排序：

Multi-threaded data mining of EDGAR CIKs (Central Index Keys) from ticker symbols

Multi-threaded data mining of EDGAR CIKs (Central Index Keys...

引用

10th workshop on Advances in Parallel and Distributed Computational Models/22nd IEEE international Parallel and Distributed Processing Symposium

作者： Lyon, Douglas A. Fairfield Univ Dept Comp Engn Fairfield CT 06824 USA

ISBN: (纸本)9781424416936

this paper describes how use the Java Swing HTMLEditorKit to perform multi-threaded web data mining on the EDGAR system (Electronic data-Gathering, Analysis, and Retrieval system). EDGAR is the SEC's (U.S. Securities and Exchange Commission) means of automating the collection, validation, indexing, acceptance, and forwarding of submissions. Some entities are regulated by the SEC (e.g. publicly traded firms) and are required, by law, to file with the SEC. Our focus is on making use of EDGAR to get information about company filings. these offers are filed with companies, using their Central Index Key (CIK). the CIK is used on the SEC's computer system to identify entities that filed a disclosure with the SEC We show how to map a stock ticker symbol into a CIK. the methodology for converting the web data source into internal data structures is based on using HTML as the input into a context-sensitive parser-call-back facility. Screen scraping is a popular means of data mining, but the unstructured nature of HTML pages makes this a challenge. the stop-and-wait nature of HTTP queries, as well as the non-deterministic nature of the response time, adversely impacts performance. We show that a combination of caching and multi-threading can improve performance by several orders of magnitude.

关键词： data mining

来源：评论

学校读者我要写书评

暂无评论

Performance adaptive UDP for high-speed bulk data transfer over dedicated links

Performance adaptive UDP for high-speed bulk data transfer o...

引用

10th workshop on Advances in Parallel and Distributed Computational Models/22nd IEEE international Parallel and Distributed Processing Symposium

作者： Eckart, Ben He, Xubin Wu, Qishi Tennessee Technol Univ Cookeville TN 38505 USA Univ Memphis Dept Comp Sci Memphis TN 38152 USA

ISBN: (纸本)9781424416936

New types of networks are emerging for the purpose of transmitting large amounts of scientific data among research institutions quickly and reliably. these exotic networks are characterized by being high-bandwidth, high-latency, and free from congestion. In this environment, TCP ceases to be an appropriate protocol for reliable bulk data transfer because it fails to saturate link throughput. Of the new protocols designed to take advantage of these networks, a subclass has emerged using UDP for data transfer and TCP for control. these high-speed variants of reliable UDP, however tend to under perform on all but high-end systems due to constraints of the CPU, network, and hard disk. It is therefore necessary to build a high-speed protocol adaptive to the performance of each system. this paper develops such a protocol, Performance Adaptive UDP (henceforth PA-UDP), which aims to dynamically and autonomously maximize performance under different systems. A mathematical model and related algorithms are proposed to describe the theoretical basis behind effective buffer and CPU management. Based on this model, we implemented a prototype under Linux and the experimental results demonstrate that PA-UDP outperforms an existing high-speed protocol on commodity hardware in terms of throughput and packet loss. PA-UDP is efficient not only for high-speed research networks but also for reliable high-performance bulk data transfer over dedicated local area networks where congestion and fairness are typically not a concern.

关键词： Transmission control protocol

来源：评论

学校读者我要写书评

暂无评论

Efficient automated marshaling of C++ data structures for MPI applications

Efficient automated marshaling of C++ data structures for MP...

引用

10th workshop on Advances in Parallel and Distributed Computational Models/22nd IEEE international Parallel and Distributed Processing Symposium

作者： Tansey, Wesley Tilevich, Eli Virginia Tech Dept Comp Sci Ctr High End Comp Syst Blacksburg VA 24061 USA

ISBN: (纸本)9781424416936

We present an automated approach for marshaling C++ data structures in High Performance Computing (HPC) applications. Our approach utilizes a graphical editor through which the user can express a subset of an object's state to be marshaled and sent across a network. Our tool, MPI Serializer, then automatically generates efficient marshaling and unmarshaling code for use with the Message Passing Interface (MPI), the predominant communication middleware for HPC systems. Our approach provides a more comprehensive level of support for C++ language features than the existing state of the art, and does so in full compliance with the C++ Language Standard. Specifically, we can marshal effectively and efficiently non-trivial language constructs such as polymorphic pointers, dynamically allocated arrays, non-public member fields, inherited members, and STL container classes. Additionally, our marshaling approach is also applicable to third part), libraries, as it does not require any modifications to the existing C++ source code. We validate our approach through two case studies of applying our tool to automatically generate the marshaling functionality of two realistic HPC applications. the case studies demonstrate that the automatically generated code matches the performance of typical hand-written implementations and surpasses current state-of-the-art C++ marshaling libraries, in some cases by more than an order of magnitude. the results of our case studies indicate that our approach can be beneficial for both the initial construction of HPC applications as well as for the refactoring of sequential applications for parallel execution.

关键词： Message passing

来源：评论

学校读者我要写书评

暂无评论

Identification of human operation using data clustering and its application to automated system

Identification of human operation using data clustering and ...

引用

10th IEEE international workshop on Advanced Motion Control (AMC'08), vol.2

作者： Hayato Sato Tadanao Zanma Muneaki IshIda Graduate school of Engineering Mie University Tsu Mie Japan

Human operation is realized by the combination of continuous operations and logical judgements. Such a system is called a hybrid dynamical system (HDS). In this paper, we consider a driving task. then we identify the task using the clustering method which is one of identification methods of the HDS. Furthermore, we apply to an automatic driving system. Both simulation and application results illustrate the effectiveness of the system.

关键词： Humans Neural networks Educational institutions data engineering Clustering methods Automation Clustering algorithms Vehicle driving Instruments Turning

来源：评论

学校读者我要写书评

暂无评论

Termination Analysis by Program Inversion

Termination Analysis by Program Inversion

引用

international Symposium on Symbolic and Numeric algorithms for Scientific Computing (SYNASC)

作者： Stefan Andrei Department of Computer Science Lamar University Beaumont TX USA

Automatic methods for discovering program runtime and proving program termination have always been a challenging problem in computer science. We present here a novel and systematic approach for calculating an upper bound of the maximum runtime of functions for a non-trivial class of programs. the proof is based on an induction over a tree of execution traces - a new mathematical data structure. As a consequence, this can also show termination for these functions. the approach uses symbolic-numeric algorithms over a novel mathematical data structure, and can systematically find the maximum runtime for a wide class of functions.

关键词： Runtime Computer science Scientific computing Algorithm design and analysis Upper bound Tree data structures data structures Partitioning algorithms Arithmetic Delay effects

来源：评论

学校读者我要写书评

暂无评论

Non-Well-Founded Probabilities and Coinductive Probability Logic

Non-Well-Founded Probabilities and Coinductive Probability L...

引用

international Symposium on Symbolic and Numeric algorithms for Scientific Computing (SYNASC)

作者： Andrew Schumann Department of Philosophy and Science Methodology Belarusian State University Minsk Belarus

One of the most useful computer algebra used today is calgebra and its versions, e.g. stream calculus. In the paper I show that p-adic arithmetic can be regarded as one of the natural interpretation of stream calculus on a finite set of positive integers. Further, I define probabilities on streams using bisimulation and construct probability logic with non-well-founded syntax and non-well-founded semantics.

关键词： Probabilistic logic Differential equations Calculus Set theory Scientific computing data structures Algebra Arithmetic

来源：评论

学校读者我要写书评

暂无评论

Time Slot Groups - A data Structure for QoS-Constrained Advance Bandwidth Reservation and Admission Control

Time Slot Groups - A Data Structure for QoS-Constrained Adva...

引用

international Symposium on Symbolic and Numeric algorithms for Scientific Computing (SYNASC)

作者： Mugurel Ionut Andreica Nicolae Tapus Computer Science and Engineering Department Politehnica University of Bucharest Bucharest Romania

In this paper we present time slot groups (TSG), a novel, efficient data structure for QoS-constrained advance bandwidth reservation and admission control. the data structure divides the time horizon into T equally sized time slots and can be used for serving efficiently complex bandwidth reservation requests specifying the duration of the reservation, the minimum required bandwidth, the earliest possible starting time and the latest possible finish time. the data structure supports reservation queries in time O(k+(T/k)* log(k)) and reservation updates in time O(k+(T/k)), where k is a user-defined parameter.

关键词： data structures Bandwidth Admission control Streaming media Scientific computing Computer science data engineering Time factors Multimedia systems Testing

来源：评论

学校读者我要写书评

暂无评论

Some Structural and Security Properties of the Modular Secret Sharing

Some Structural and Security Properties of the Modular Secre...

引用

international Symposium on Symbolic and Numeric algorithms for Scientific Computing (SYNASC)

作者： Tatsiana Galibus Gennadii Matveev Nikolay Shenets Department of Mathematical Modelling and Data Analysis Belarusian State University Minsk Belarus Department of Higher Mathematics Belarusian State University Minsk Belarus

We mainly study the modular secret sharing over the ring of univariate polynomials over the Galois field. the proposed modular schemes over these rings achieve improvements both in security and applicability compared to classical schemes over the ring of integers. Our threshold schemes are perfect i.e. secure in the sense of information theory and ideal i.e. efficient in the terms of memory storage (the size of the secret is equal to the size of the shares). then we consider the modular secret sharing schemes with pairwise co-prime moduli over the ring of polynomials and the ring of integers. We give a complete description of the access structures that can be realized by such modular schemes.

关键词： Cryptography Polynomials Mathematical model data analysis Scientific computing data security Mathematics Galois fields Information security Information theory

来源：评论

学校读者我要写书评

暂无评论

Timed and Hybrid Automata in SAL

Timed and Hybrid Automata in SAL

引用

international Symposium on Symbolic and Numeric algorithms for Scientific Computing (SYNASC)

作者： P. Vijay Suman Paritosh K. Pandya School of Technology and Computer Science Tata Institute of Fundamental Research Mumbai India

Various methodologies to model and analyze timed and hybrid systems using SAL are reported. We assume that the system is specified as a network of timed/hybrid automata with synchronized transitions and urgency. We show how to translate the system into a SAL model with the time domain being either discrete or dense, and the clocks being either saturated or unsaturated. Depending on these choices, various tools provided by SAL to model check reachability properties over the system are used to establish safety properties of timed systems. We profile the performance of these tools with a comparative study.

关键词： Automata Clocks Computer science Synchronization Real time systems Job shop scheduling Context modeling data structures Surface-mount technology Scientific computing

来源：评论

学校读者我要写书评

暂无评论

On-board processing of video image sequences

On-board processing of video image sequences

引用

international workshop on Signal Processing for Space Communications (SPSC)

作者： J. Dahl Andersen O. Chanrion S. Forchhammer I. Lundgaard Rasmussen Department of Photonics Engineering Technical University of Denmark Denmark National Space Institute Technical University of Denmark Denmark

the ldquoatmosphere-space interactions monitorrdquo (ASIM) is a payload to be mounted on one of the external platforms of the Columbus module of the international Space Station (ISS). the instruments include six video cameras, six photometers and one X-ray detector. the main scientific objective of the mission is to study transient luminous events (TLE) above severe thunderstorms: the sprites, jets and elves. Other atmospheric phenomena are also studied including aurora, gravity waves and meteors. As part of the ASIM Phase B study, on-board processing of data from the cameras is being developed and evaluated. On-board there are six video cameras each capturing images of 1024times1024 pixels of 12 bpp at a frame rate of 15 fps, thus totalling 1080 Mbits/s. In comparison the average downlink data rate for these images is projected to be 50 kbit/s. this calls for efficient on-board processing to select and compress the data. algorithms for on-board processing of the image data are presented as well as evaluation of the performance. the main processing steps are event detection, image cropping and image compression. the on-board processing requirements are also evaluated.

关键词： Image sequences Cameras Image coding Monitoring Payloads international Space Station Instruments Photometry X-ray detectors Sprites (computer)

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共49页 << < 32 33 34 35 36 37 38 39 40 41 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：