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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

188 篇 会议
15 册 图书
7 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

141 篇 工学
- 135 篇 计算机科学与技术...
- 51 篇 软件工程
- 21 篇 信息与通信工程
- 15 篇 电气工程
- 9 篇 控制科学与工程
- 6 篇 网络空间安全
- 4 篇 化学工程与技术
- 3 篇 建筑学
- 3 篇 土木工程
- 2 篇 机械工程
- 2 篇 测绘科学与技术
- 2 篇 轻工技术与工程
- 2 篇 生物医学工程（可授...
- 1 篇 光学工程
56 篇 理学
- 44 篇 数学
- 9 篇 物理学
- 5 篇 统计学（可授理学、...
- 4 篇 化学
- 2 篇 生物学
- 2 篇 系统科学
18 篇 管理学
- 16 篇 图书情报与档案管...
- 3 篇 管理科学与工程(可...
- 2 篇 工商管理
3 篇 法学
- 3 篇 社会学
- 1 篇 法学
3 篇 教育学
- 3 篇 教育学
3 篇 医学
- 3 篇 基础医学(可授医学...
- 3 篇 临床医学
- 2 篇 药学(可授医学、理...
1 篇 文学
- 1 篇 新闻传播学

主题

13 篇 graph theory
9 篇 artificial intel...
8 篇 automata theory
7 篇 discrete mathema...
6 篇 theory of comput...
6 篇 computers
5 篇 computer communi...
4 篇 software enginee...
4 篇 software enginee...
4 篇 algorithm analys...
4 篇 information stor...
3 篇 turing machines
3 篇 database managem...
3 篇 game theory
3 篇 complexity theor...
3 篇 software
3 篇 computer program...
3 篇 information retr...
2 篇 data storage rep...
2 篇 computer science

机构

3 篇 university of be...
2 篇 department of co...
2 篇 charles universi...
2 篇 department of co...
2 篇 dept. of compute...
2 篇 warsaw universit...
2 篇 dept. of compute...
2 篇 school of comput...
2 篇 university of li...
2 篇 institute of com...
2 篇 the institute of...
2 篇 university of am...
2 篇 department of in...
2 篇 central universi...
2 篇 department of co...
2 篇 school of comput...
1 篇 university of ca...
1 篇 faculty of elect...
1 篇 cern 1 esplanade...
1 篇 ist austria klos...

作者

3 篇 van leeuwen jan
3 篇 šíma jiří
3 篇 saurabh saket
2 篇 peleg david
2 篇 zhaoquan gu
2 篇 bieliková mária
2 篇 žák stanislav
2 篇 ono hirotaka
2 篇 mária bieliková
2 篇 leszek pacholski
2 篇 freivalds rūsiņš
2 篇 shaohua wang
2 篇 paulusma daniel
2 篇 inenaga shunsuke
2 篇 xinchen wang
2 篇 kiya hironori
2 篇 rossmanith peter
2 篇 wiedermann jiri
2 篇 pokorný jaroslav
2 篇 iliopoulos costa...

语言

206 篇 英文
4 篇 中文

检索条件"任意字段=38th Conference on Current Trends in Theory and Practice of Computer Science"

共 210 条记录，以下是181-190 订阅

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

详细简洁

排序：

Supporting group-by and pipelining in bitmap-enabled query processors 26th

Supporting group-by and pipelining in bitmap-enabled query p...

引用

26th conference on current trends in theory and practice of Informatics, SOFSEM 1999

作者： Buchmann, Alejandro P. Wu, Ming-Chuan Database Research Group Computer Science Department Technische Universität Darmstadt Germany

ISBN: (纸本)354066694X

the Group-By operation is widely used in relational Data Warehouses for the aggregation and presentation of results according to user-defined criteria. Rearranging Group-By and join operations has been proposed as an optimization technique that reduces the size of the input relation. Pipelining is another optimization technique that promotes intra-query parallelism by transfering intermediate results to the next operation without materializing them. In Data Warehouses and environments in which exploratory on-line queries are common, pipelining can be used both for optimizing joins and for the reduction of response time by presenting partial results to the user. Efficient pipelining often depends on the order of the intermediate results. Orderdependent operations, such as Group-By, typically require the complete result set before ordering it, thereby making efficient pipelining impossible. In this paper we exploit bitmap indexing to implement Group-By in a manner that can be used for pipelining. Algorithms are presented for different assumptions about buffer availability and for different sort orders. © Springer-Verlag Berlin Heidelberg 1999.

关键词： Data warehouses

来源：评论

学校读者我要写书评

暂无评论

On majority voting games in trees 28th

引用

28th International conference on current trends in theory and practice of Informatics, SOFSEM 2001

作者： Kràlovič, Rastislav Department of Computer Science Physics and Informatics Comenius University Bratislava Slovakia

ISBN: (纸本)9783540429128

We consider the following synchronous colouring game played on a simple connected graph with vertices coloured black or white. During one step of the game, each vertex is recoloured accordingto the majority of its neighbours. the variants of the model differ by the choice of a particular tie-breaking rule and possible rule for enforcing monotonicity. Two tie-breaking rules we consider are simple majority and strong majority, the first in case of a tie recolours the vertex black and the latter does not change the colour. the monotonicity-enforcing rule allows the voting only in white vertices, thus leavin gall black vertices intact. this model is called irreversible. these synchronous dynamic systems have been extensively studied and have many applications in molecular biology, distributed systems modelling, etc. In this paper we give two results describing the behaviour of these systems on trees. First we count the number of fix points of strong majority rule on complete binary trees to be asymptotically 4N ・ (2α)N where N is the number of vertices and 0.7685 ≤ α ≤ 0.7686. the second result is an algorithm for testing whether a given configuration on an arbitrary tree evolves into an all-black state under irreversible simple majority rule. the algorithm works in time O(t log t) where t is the number of black vertices and uses labels of length O(logN). © Springer-Verlag Berlin Heidelberg 2001.

关键词： Molecular biology

来源：评论

学校读者我要写书评

暂无评论

Grammars and a random generator for deterministic chain regular expressions 46

Grammars and a random generator for deterministic chain regu...

引用

46th International conference on current trends in theory and practice of computer science Doctoral Student Research Forum, SOFSEM-SRF 2020

作者： Chu, Xinyu Lu, Ping Chen, Haiming State Key Laboratory of Computer Science Institute of Software Chinese Academy of Sciences Beijing100190 China University of Chinese Academy of Sciences China Beijing Advanced Innovation Center for Big Data and Brain Computing Beihang University Beijing100191 China

Deterministic regular expressions (DREs) are a core part of XML Schema and widely used in other applications. there are context-free grammars for DREs, which are not efficient for being used and also lead to the problem of being unable to generate expressions of the given length in an efficient manner. Deterministic chain regular expressions (dCHAREs) are a very practical subclass of DREs. In many practical situations, dCHAREs are more suitable than standard or deterministic regular expressions. But dCHAREs do not have a simple syntax, which puts a burden on the applications of these expressions. In this paper, we propose derivation rules and give regular grammars for dCHAREs which are more succinct than the grammars of DREs. Based on the grammars, we further design an algorithm to randomly generate dCHAREs of the given length, which fills the gap in the generation of DREs. Experimental results demonstrate that our generator is efficient in terms of running time and complexity. Copyright © 2020 for this paper by its authors. Use permitted under Creative Commons License Attribution 4.0 International (CC BY 4.0).

关键词： Pattern matching

来源：评论

学校读者我要写书评

暂无评论

Cyclic cutwidth of the mesh 26th

Cyclic cutwidth of the mesh

引用

26th conference on current trends in theory and practice of Informatics, SOFSEM 1999

作者： Schröder, Heiko Sýkora, Ondrej Vrfo, Imrich School of Applied Science Nanyang Technological University Nanyang Avenue 639798 Singapore Department of Computer Science Loughborough University Loughborough LeicestershireLE11 3TU United Kingdom Department of Informatics Institute for Mathematics Slovak Academy of Sciences P. O. Box 56 Bratislava840 00 Slovakia

ISBN: (纸本)354066694X

the cutwidth problem is to find a linear layout of a network so that the maximal number of cuts (cw) of a line separating consecutive vertices is minimized. A related and more natural problem is the cyclic cutwidth (ccw) when a circular layout is considered. the main question is to compare both measures cw and ccw for specific networks, whether adding an edge to a path and forming a cycle reduces the cutwidth essentially. We prove exact values for the cyclic cutwidths of the 2-dimensional ordinary and cylindrical meshes Pm× Pnand Pm× Cn, respectively. Especially, if m > n + 3, then ccw(Pm× Pn) = cw(Pm× Pn) = n + 1 and if n is even then ccw(Pn× Pn) = n - 1 and cw(pn× Pn) = n + 1 and if m≥ 2,n≥ 3, then ccw(Pm× Cn) = min{m + 1,n + 2}. © Springer-Verlag Berlin Heidelberg 1999.

关键词： computers

来源：评论

学校读者我要写书评

暂无评论

A hybrid task scheduling approach based on genetic algorithm and particle swarm optimization technique in cloud environment 6th

A hybrid task scheduling approach based on genetic algorithm...

引用

6th International conference on Frontiers of Intelligent Computing: theory and Applications, FICTA-2017

作者： Jana, Bappaditya Poray, Jayanta Department of Computer Science & Engineering Techno India University KolkataWest Bengal India

ISBN: (纸本)9789811075650

As per current trends, cloud services are becoming more popular day by day. Because these services satisfy several demands for heterogeneous resources without using dedicated IT infrastructure. In cloud platform, user gets shared pool of resources through Internet irrespective of any geographical location. But cloud services need to handle a gigantic amount of request, as the number of users increases exponentially. In order to manage a pool of requests till now no effective scheduling mechanism is available in practice. So to minimize the time delay and optimize the overall complexity, suitable scheduling methodology is very much required. In our study, we have presented a novel scheme for scheduling algorithm after the enhancement of genetic algorithm and particle swarm optimization technique. We have proposed a methodology that can provide a better response time from cloud provider and minimize the waiting time for particular clients in cloud environment. © Springer Nature Singapore Pte Ltd. 2018.

关键词： Scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

Rethinking Exploration in Reinforcement Learning with Effective Metric-Based Exploration Bonus 38

Rethinking Exploration in Reinforcement Learning with Effect...

引用

38th conference on Neural Information Processing Systems, NeurIPS 2024

作者： Wang, Yiming Zhao, Kaiyan Liu, Furui Hou, Leong U. State Key Laboratory of Internet of Things for Smart City University of Macau China School of Computer Science Wuhan University Wuhan China Zhejiang Lab Hangzhou China

Enhancing exploration in reinforcement learning (RL) through the incorporation of intrinsic rewards, specifically by leveraging state discrepancy measures within various metric spaces as exploration bonuses, has emerged as a prevalent strategy to encourage agents to visit novel states. the critical factor lies in how to quantify the difference between adjacent states as novelty for promoting effective exploration. Nonetheless, existing methods that evaluate state discrepancy in the latent space under L1 or L2 norm often depend on count-based episodic terms as scaling factors for exploration bonuses, significantly limiting their scalability. Additionally, methods that utilize the bisimulation metric for evaluating state discrepancies face a theory-practice gap due to improper approximations in metric learning, particularly struggling with hard exploration tasks. To overcome these challenges, we introduce the Effective Metric-based Exploration-bonus (EME). EME critically examines and addresses the inherent limitations and approximation inaccuracies of current metric-based state discrepancy methods for exploration, proposing a robust metric for state discrepancy evaluation backed by comprehensive theoretical analysis. Furthermore, we propose the diversity-enhanced scaling factor integrated into the exploration bonus to be dynamically adjusted by the variance of prediction from an ensemble of reward models, thereby enhancing exploration effectiveness in particularly challenging scenarios. Extensive experiments are conducted on hard exploration tasks within Atari games, Minigrid, Robosuite, and Habitat, which illustrate our method's scalability to various scenarios. the project website can be found at https://***/view/effective-metric-exploration. © 2024 Neural information processing systems foundation. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Recent advances in wavelength routing 28th

引用

28th International conference on current trends in theory and practice of Informatics, SOFSEM 2001

作者： Kaklamanis, Christos Computer Technology Institute Dept. of Computer Engineering and Informatics University of Patras Rio26500 Greece

ISBN: (纸本)9783540429128

We study the problem of allocating optical bandwidth to sets of communication requests in all–optical networks that utilize Wavelength Division Multiplexing (WDM). WDM technology establishes communication between pairs of network nodes by establishing transmitter– receiver paths and assigning wavelengths to each path so that no two paths going through the same fiber link use the same wavelength. Optical bandwidth is the number of distinct wavelengths. Since state–of–the–art technology allows for a limited number of wavelengths, the engineering problem to be solved is to establish communication between pairs of nodes so that the total number of wavelengths used is minimized;this is known as the wavelength routing problem. In this paper we survey recent advances in bandwidth allocation in tree– shaped WDM all–optical networks. We present hardness results and lower bounds for the general problem and the special case of symmetric communication. We also survey various techniques that have been developed recently, and explain how they can be used to attack the problem. First, we give the main ideas of deterministic greedy algorithms and study their limitations. then, we show how to use various ways and models of wavelength conversion in order to achieve almost optimal bandwidth utilization. Finally, we show that randomization can help to improve the deterministic upper bounds. © Springer-Verlag Berlin Heidelberg 2001.

关键词： Surveys

来源：评论

学校读者我要写书评

暂无评论

Navigating Extremes: Dynamic Sparsity in Large Output Spaces 38

Navigating Extremes: Dynamic Sparsity in Large Output Spaces

引用

38th conference on Neural Information Processing Systems, NeurIPS 2024

作者： Ullah, Nasib Schultheis, Erik Lasby, Mike Ioannou, Yani Babbar, Rohit Department of Computer Science Aalto University Helsinki Finland Schulich School of Engineering University of Calgary CalgaryAB Canada Department of Computer Science University of Bath Bath United Kingdom

In recent years, Dynamic Sparse Training (DST) has emerged as an alternative to post-training pruning for generating efficient models. In principle, DST allows for a more memory efficient training process, as it maintains sparsity throughout the entire training run. However, current DST implementations fail to capitalize on this in practice. Because sparse matrix multiplication is much less efficient than dense matrix multiplication on GPUs, most implementations simulate sparsity by masking weights. In this paper, we leverage recent advances in semi-structured sparse training to apply DST in the domain of classification with large output spaces, where memory-efficiency is paramount. With a label space of possibly millions of candidates, the classification layer alone will consume several gigabytes of memory. Switching from a dense to a fixed fan-in sparse layer updated with sparse evolutionary training (SET);however, severely hampers training convergence, especially at the largest label spaces. We find that poor gradient flow from the sparse classifier to the dense text encoder make it difficult to learn good input representations. By employing an intermediate layer or adding an auxiliary training objective, we recover most of the generalisation performance of the dense model. Overall, we demonstrate the applicability and practical benefits of DST in a challenging domain - characterized by a highly skewed label distribution that differs substantially from typical DST benchmark datasets - which enables end-to-end training with millions of labels on commodity hardware. © 2024 Neural information processing systems foundation. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Work in progress-improving feedback using an automatic assessment tool

Work in progress-improving feedback using an automatic asses...

引用

Frontiers in Education (FIE) conference

作者： Daniel Jimenez-Gonzalez Carlos Alvarez David Lopez Joan-M. Parcerisa Javier Alonso Christian Perez Ruben Tous Pere Barlet Montse Fernandez Jordi Tubella Computer Architecture Department Technical University of Catalonia Spain

Students of computer science freshman year usually develop assembler programs to learn processor architecture. Homework exercises are done on paper, while those in lab sessions are solved with the aid of programming tools. Students perceive theory and lab as different subjects, so they donpsilat use lab tools to test their theory solved problems. Moreover, during lab sessions, students often tend to ask for the teacherpsilas guide and advice instead of using the debugging tools because these are new and unfriendly for them, and do not offer a quick and clear feedback. In this paper we present an automatic and friendly assessment tool, SISA-EMU, with a novel feature: exercise driven feedback with teacherpsilas expertise. It provides correctness information and clues to help the students solve their most common mistakes for each individual problem (and not typical generic debug information) without the physical support of a teacher. SISA-EMU is currently in pre-deploy phase via a Moodle learning platform and we will have first evaluation results by the end of the current term.

关键词： computer architecture Debugging computer science Testing State feedback Automatic programming Memory architecture Computational modeling Assembly systems Costs

来源：评论

学校读者我要写书评

暂无评论

Early prediction of test case verdict with bag-of-words vs. word embeddings 46

Early prediction of test case verdict with bag-of-words vs. ...

引用

46th International conference on current trends in theory and practice of computer science Doctoral Student Research Forum, SOFSEM-SRF 2020

作者： Al-Sabbagh, Khaled Walid Staron, Miroslaw Ochodek, Miroslaw Meding, Wilhelm University of Gothenburg Computer Science and Engineering Department Gothenburg Sweden Institute of Computing Science Poznan University of Technology China

Regression testing is an important testing activity in continuous integration (CI) since it provides confidence that modified parts of the system have not adversely affected its expected behavior. As test suites grow in size over the evolutionary cycle of software, executing large test suites becomes costly and precluding. Since CI provides a large volume of data, machine learning approaches can be used to allow test orchestrators make inferences about which subset of test cases to run at each CI cycle. MeBoTS is a machine-learning-based method that utilizes CI data to improve test case selection (TCS). In order to decide which extraction algorithm is more suitable, we designed and performed an experiment to investigate the effect of using one of two widely used feature extraction algorithms-Bag of Words (BoW) and Word Embeddings (WE)-on the predictive performance of the MeBoTS classifier. We used stratified cross-validation and precision and recall measures to evaluate the performance of two machine-learning models trained on the input generated by the feature-extraction algorithms. the results from this experiment show a significant difference between the models' performance scores with a higher mean precision and recall scores for the BoW based classifier. We conclude that the use of BoW allows training a more accurate MeBoTS classifier than WE. Copyright © 2020 for this paper by its authors. Use permitted under Creative Commons License Attribution 4.0 International (CC BY 4.0).

关键词： Embeddings

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共21页 << < 12 13 14 15 16 17 18 19 20 21 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：