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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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 篇 期刊文献
18 册 图书

馆藏范围

499 篇 电子文献
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 篇 工商管理
24 篇 医学
- 18 篇 临床医学
- 9 篇 特种医学
- 7 篇 医学技术（可授医学...
4 篇 农学
3 篇 经济学
3 篇 法学
3 篇 教育学
3 篇 文学

主题

105 篇 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 篇 algorithm analys...
9 篇 partitioning alg...
8 篇 discrete mathema...
8 篇 databases
7 篇 scalability
7 篇 deep 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

语言

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

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

共 500 条记录，以下是41-50 订阅

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

详细简洁

排序：

Lineage for Markovian stream event queries

Lineage for Markovian stream event queries

引用

10th ACM international workshop on data Engineering for Wireless and Mobile Access, MobiDE'11

作者： Letchner, Julie Balazinska, Magdalena Microsoft United States University of Washington United States

ISBN: (纸本)9781450306560

Imprecise, sequential data, such as location sequences inferred from RFID/GPS, are often represented as Markovian (probabilistic, temporally-correlated) streams. Event queries, which detect instances of specific patterns in these streams, have become the standard tool for analysis of these streams;however, many data mining applications require richer information such as how a pattern is matched, how long the match is, or what stream elements matched specific pattern predicates. Such queries can dramatically increase the power of applications, but they cannot be answered by existing tools. In this paper, we present novel techniques for processing the above queries on Markovian streams. Central to our approach are algorithms for computing and manipulating the lineage of Markovian stream event queries. We provide formal definitions and linear-time algorithms for computing lineage, which may be exponentially-sized in the length of the input stream. We additionally demonstrate the importance of flexible lineage projections, and provide definitions of, and two efficient algorithms for, these projections. We evaluate all algorithms on two real-world data sets (location from RFID and words from spoken audio), and demonstrate that lineage can greatly increase the analytical power of applications while incurring small processing overhead. Copyright © 2011 ACM.

关键词： data mining

来源：评论

学校读者我要写书评

暂无评论

A new data processing method for space-borne Fourier Transform Spectrometers 10

A new data processing method for space-borne Fourier Transfo...

引用

10th IEEE international workshop on Metrology for AeroSpace, MetroAeroSpace 2023

作者： Appiani, Andrea Scaccabarozzi, Diego Saggin, Bortolino Politecnico di Milano Department of Mechanical Engineering Milan Italy

ISBN: (纸本)9781665456906

One of the main limitations of Fourier Transform Spectrometers (FTS) is represented by their sensitivity to vibrations, which in general leads to a reduction of the Signal to Noise Ratio (SNR) and may generate ghosts of spectral features tricky to detect. A possible implementation to mitigate such errors is to exploit correction algorithms that allow obtaining signals sampled at constant optical path steps by processing data sampled at high frequency. In this work, a new processing method is presented, based on the arccosine method and exploiting two reference signals in the quadrature phase. Performances of the proposed method are compared to those of other algorithms by comparing an index expressing the distortion spectral lines. © 2023 IEEE.

关键词： Signal to noise ratio

来源：评论

学校读者我要写书评

暂无评论

An Improved Sparsity Adaptive Matching Pursuit Algorithm for Sparse Channel Estimation 10

An Improved Sparsity Adaptive Matching Pursuit Algorithm for...

引用

10th international workshop on Signal Design and its Applications in Communications (IWSDA)

作者： Bai, Chaoyuan Yang, Liu Fan, Pingzhi Southwest Jiaotong Univ CSNMT Int Coop Res Ctr MoST Informat Coding & Transmiss Key Lab Sichuan Prov Chengdu 611756 Sichuan Peoples R China Natl Engn Lab Integrated Transportat Big Data App Chengdu 611756 Sichuan Peoples R China

ISBN: (数字)9781665452984

ISBN: (纸本)9781665452984

It is known that wireless channel is sparse in most cases, and this makes it possible to estimate channel with compressed sensing(CS). In this paper, an improved greedy reconstruction algorithm is proposed for sparse signal, i.e. variable step-size sparsity adaptive matching pursuit (SAMP) algorithm based on Dice coefficient and variable step-size(DV). In the proposed DV-SAMP algorithm, the similarity calculation method is optimized first, and then, the estimated sparsity is used to approach the real sparsity accurately and quickly with the variable step-size. Our simulation results show that the proposed DV-SAMP algorithm outperforms the SAMP and other greedy reconstruction algorithms in reconstructing sparse signals.

关键词： compressed sensing reconstruction algorithm variable step-size Dice coefficient channel estimation

来源：评论

学校读者我要写书评

暂无评论

Classification algorithms for Damage Identification in Framed structures by Means of Natural Frequencies 10th

Classification Algorithms for Damage Identification in Frame...

引用

10th international Operational Modal Analysis Conference (IOMAC)

作者： Sepe, Vincenzo Buccella, Armando Potenza, Francesco Diaferio, Mariella Univ G dAnnunzio Dept Engn & Geol I-65127 Pescara Italy Univ G dAnnunzio Res Ctr UdA TechLab Pescara Italy Polytech Univ Bari Dept Civil Environm Land Bldg Engn & Chem I-70125 Bari Italy

ISBN: (纸本)9783031614279;9783031614255;9783031614248

the identification and localization of structural damage plays an important role in the health monitoring of civil structures. However, when the number of potentially damaged structures is high it can be difficult to distinguish which ones have actually suffered damage and where further investigations need to be directed. It can be therefore useful to have procedures and algorithms that allow indicating automatically, as a preliminary step of deeper investigations, the possible occurrence of damage and its approximate position. In this context, the paper explores the variations of the natural frequencies for plane and 3D framed structures due to localized damage within macro-regions into which the structure can be divided. Based on numerically generated data, it is shown how the position of the damage within different macro-regions produces different and recognizable scenarios with respect to the variations of the natural frequencies. this allows to make use of classic data classification procedures, through which it is possible to automatically obtain indications on the macro-region of the structure subject to damage, thus limiting the extent of the investigations to be carried out on site.

关键词： Health monitoring of framed structures Damage identification Classification algorithms Machine learning Vibration-based procedures

来源：评论

学校读者我要写书评

暂无评论

MIxBN: library for learning Bayesian networks from mixed data 10

MIxBN: library for learning Bayesian networks from mixed dat...

引用

10th international Young Scientists Conference in Computational Science (YSC)

作者： Bubnova, Anna, V Deeva, Irina Kalyuzhnaya, Anna, V ITMO Univ St Petersburg Russia

this paper describes a new library for learning Bayesian networks from data containing discrete and continuous variables (mixed data). In addition to the classical learning methods on discretized data, this library proposes its algorithm that allows structural learning and parameters learning from mixed data without discretization since data discretization leads to information loss. this algorithm based on mixed MI score function for structural learning, and also linear regression and Gaussian distribution approximation for parameters learning. the library also offers two algorithms for enumerating graph structures - the greedy Hill-Climbing algorithm and the evolutionary algorithm. thus the key capabilities of the proposed library are as follows: (1) structural and parameters learning of a Bayesian network on discretized data, (2) structural and parameters learning of a Bayesian network on mixed data using the MI mixed score function and Gaussian approximation, (3) launching learning algorithms on one of two algorithms for enumerating graph structures - Hill-Climbing and the evolutionary algorithm. Since the need for mixed data representation comes from practical necessity, the advantages of our implementations are evaluated in the context of solving approximation and gap recovery problems on synthetic data and real datasets. (C) 2021 the Authors. Published by Elsevier B.V.

关键词： Bayesian Networks Structured Learning Parameters learning Mutual Information Differential Entropy

来源：评论

学校读者我要写书评

暂无评论

Improved algorithms for data migration

引用

9th international workshop on Approximation algorithms for Combinatorial Optimization Problems/10th international workshop on Randomization and Computation

作者： Khuller, Samir Kim, Yoo-Ah Malekian, Azarakhsh Univ Maryland Dept Comp Sci College Pk MD 20742 USA Univ Connecticut Dept Comp Sci & Engn Storrs CT 06269 USA

ISBN: (纸本)3540380442

Our work is motivated by the need to manage data on a collection of storage devices to handle dynamically changing demand. As demand for data changes, the system needs to automatically respond to changes in demand for different data items. the problem of computing a migration plan among the storage devices is called the data migration problem. this problem was shown to be NP-hard, and an approximation algorithm achieving an approximation factor of 9.5 was presented for the half-duplex communication model in [Khuller, Kim and Wan: algorithms for data Migration with Cloning, SIAM J. on Computing, Vol. 33(2):448-461 (2004)]. In this paper we develop an improved approximation algorithm that gives a bound of 6.5 + o(1) using various new ideas. In addition, we develop better algorithms using external disks and get an approximation factor of 4.5. We also consider the full duplex communication model and develop an improved bound of 4 + o(1) for this model, with no external disks.

关键词： algorithms

来源：评论

学校读者我要写书评

暂无评论

Some Structural and Security Properties of the Modular Secret Sharing

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

引用

10th international Symposium on Symbolic and Numeric algorithms for Scientific Computing

作者： Galibus, Tatsiana Matveev, Gennadii Shenets, Nikolay Belarusian State Univ Dept Math Modelling & Data Anal Minsk 220050 BELARUS Belarusian State Univ Dept Higher Math Minsk 220050 BELARUS Belarusian State Univ Dept Math Modelling & Data Anal Minsk 220050 BELARUS

ISBN: (纸本)9780769535234

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.

关键词： Information theory

来源：评论

学校读者我要写书评

暂无评论

the SIGNAL approach to the design of system architectures 10

The SIGNAL approach to the design of system architectures

引用

10th IEEE international Conference and workshop on the Engineering of Computer-Based Systems

作者： Gamatié, A Gautier, T INRIA IRISA F-35042 Rennes France

ISBN: (纸本)0769519172

Modeling plays a central role in system engineering. It significantly reduces costs and efforts in the design by providing developers with means for cheaper and more relevant experimentations. So, design choices can be assessed earlier the use of a formalism, such as the synchronous language SIGNAL which relies on solid mathematical foundations for the modeling, allows validation. this is the aim of the methodology defined for the design of embedded systems where emphasis is put on formal techniques for verification, analysis, and code generation. this paper mainly focuses on the modeling of architecture components using SIGNAL. For illustration, we consider the modeling of a bounded FIFO queue, which is intended to be used for communication protocols. We bring out the capabilities of SIGNAL to allow specifications in an elegant way, and we check few elementary properties on the resulting model for correctness.

关键词： Costs data engineering data structures Embedded system Mathematical model Protocols Signal design Solid modeling Systems engineering and theory Unified modeling language

来源：评论

学校读者我要写书评

暂无评论

10th international workshop on algorithms in Bioinformatics, WABI 2010

引用

10th international workshop on algorithms in Bioinformatics, WABI 2010

ISBN: (纸本)9783642152931

the proceedings contain 30 papers. the special focus in this conference is on algorithms in Bioinformatics. the topics include: Fixed-parameter algorithm for haplotype inferences on general pedigrees with small number of sites;haplotypes versus genotypes on pedigrees;haplotype inference on pedigrees with recombinations and mutations;identifying rare cell populations in comparative flow cytometry;Fast mapping and precise alignment of AB SOLiD color reads to reference DNA;design of an efficient out-of-core read alignment algorithm;Estimation of alternative splicing isoform frequencies from RNA-seq data;improved orientations of physical networks;enumerating chemical organisations in consistent metabolic networks: Complexity and algorithms;sparse estimation for structural variability;efficient subgraph frequency estimation with G-Tries;accuracy guarantees for phylogeny reconstruction algorithms based on balanced minimum evolution;the complexity of inferring a minimally resolved phylogenetic supertree;reducing multi-state to binary perfect phylogeny with applications to missing, removable, inserted, and deleted data;an experimental study of quartets MaxCut and other supertree methods;An efficient method for DNA-based species assignment via gene tree and species tree reconciliation;effective algorithms for fusion gene detection;swiftly computing center strings;speeding up exact motif discovery by bounding the expected clump size;Pair HMM based gap statistics for re-evaluation of indels in alignments with affine gap penalties;data structures for accelerating tanimoto queries on real valued vectors;quantifying the strength of natural selection of a motif sequence;Sparsification of RNA structure prediction including pseudoknots;Prediction of RNA secondary structure including kissing hairpin motifs;Genomic distance with DCJ and indels.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Efficient processing of narrow range queries in multi-dimensional data structures

Efficient processing of narrow range queries in multi-dimens...

引用

10th international database Engineering and Applications Symposium (IDEAS 2006)

作者： Kratky, Michal Snasel, Vaclav Pokorny, Jaroslav Zezula, Pavel Tech Univ Ostrava VSB Ostrava Czech Republic Charles Univ Prague Prague Czech Republic Masaryk Univ Brno Czech Republic

ISBN: (纸本)9780769525778

Multi-dimensional data structures are applied in many real index applications, i.e. data mining, indexing multimedia data, indexing of text documents and so on. Many index structures and algorithms have been proposed. there are two major approaches to multi-dimensional indexing: data structures to indexing metric and vector spaces. R-trees, R*-trees and (B)UB-trees are representatives of the vector data structures. these data structures provide efficient processing of many types of queries, i.e. point queries, range queries and so on. As far as the vector data structures are concerned, the range query retrieves all points in defined hyper box in an n-dimensional space. the narrow range query is an important type of the range query. Its processing is inefficient in vector data structures. Moreover, the efficiency decreases as the dimension of the indexed space increases. We depict an application of the signature for more efficient processing of narrow range queries. the approach puts the signature into the multi-dimensional data structures like R-tree or UB-tree but original functionalities are preserved, i.e. the range query algorithm for general range query. the novel data structure is called the signature data structure, e.g., Signature R-tree or Signature UB-tree.

关键词： multi-dimensional data-structure narrow range query R-tree (B)UB-tree

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共50页 << < 1 2 3 4 5 6 7 8 9 10 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：