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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

332 篇 会议
9 册 图书

馆藏范围

337 篇 电子文献
4 种 纸本馆藏

日期分布

学科分类号

336 篇 工学
- 336 篇 计算机科学与技术...
- 107 篇 信息与通信工程
- 18 篇 软件工程
130 篇 理学
- 130 篇 数学

主题

12 篇 event-b
10 篇 multi-objective ...
8 篇 genetic programm...
8 篇 evolutionary alg...
7 篇 computers
6 篇 refinement
6 篇 formal methods
6 篇 runtime analysis
5 篇 reinforcement le...
5 篇 approximation al...
5 篇 robots
5 篇 combinatorial op...
5 篇 verification
4 篇 graph algorithms
4 篇 deep learning
4 篇 model checking
4 篇 abstract state m...
4 篇 graph theory
4 篇 theory
4 篇 machine learning

机构

6 篇 sorbonne univ li...
5 篇 swiss fed inst t...
5 篇 univ bergen dept...
5 篇 eindhoven univ t...
5 篇 univ southampton...
5 篇 zhejiang univ ui...
4 篇 univ utrecht utr...
4 篇 charles univ pra...
4 篇 univ tokyo jfli ...
4 篇 univ dusseldorf ...
3 篇 tech univ darmst...
3 篇 slovak acad sci ...
3 篇 univ warsaw inst...
3 篇 univ primorska f...
3 篇 ryerson univ dep...
3 篇 beijing univ tec...
3 篇 univ milan dipar...
3 篇 beijing univ tec...
3 篇 warsaw univ tech...
3 篇 itmo univ st pet...

作者

6 篇 doerr carola
6 篇 leuschel michael
5 篇 schewe klaus-die...
5 篇 doerr benjamin
4 篇 neumann frank
4 篇 coello carlos a....
4 篇 butler michael
4 篇 back thomas
4 篇 liefooghe arnaud
4 篇 hoang thai son
4 篇 riccobene elvini...
3 篇 neumann aneta
3 篇 bloznelis mindau...
3 篇 sudo yuichi
3 篇 yao xin
3 篇 ait-ameur yamine
3 篇 taubenfeld gadi
3 篇 bossek jakob
3 篇 snook colin
3 篇 paulusma daniel

语言

336 篇 英文
5 篇 中文

检索条件"丛书名=Lecture Notes in Computer Science - Theoretical Computer Science and General Issues"

共 341 条记录，以下是1-10 订阅

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

详细简洁

排序：

On Fair Covering and Hitting Problems 1

引用

47th International Workshop on Graph-Theoretic Concepts in computer science (WG)

作者： Bandyapadhyay, Sayan Banik, Aritra Bhore, Sujoy Univ Bergen Dept Informat Bergen Norway NISER Sch Comp Sci Bhubaneswar India Indian Inst Sci Educ & Res Bhopal India

ISBN: (数字)9783030868383

ISBN: (纸本)9783030868376;9783030868383

In this paper, we study two generalizations of Vertex Cover and Edge Cover, namely Colorful Vertex Cover and Colorful Edge Cover. In the Colorful Vertex Cover problem, given an n-vertex edge-colored graph G with colors from {1,...,w} and coverage requirements r(1), r(2),..., r(w), the goal is to find a minimum-sized set of vertices that are incident on at least r(i) edges of color i, for each 1 <= i <= w, i.e., we need to cover at least r(i) edges of color i. Colorful Edge Cover is similar to Colorful Vertex Cover except here we are given a vertex-colored graph and the goal is to cover at least r(i) vertices of color i, for each 1 <= i <= w, by a minimum-sized set of edges. These problems have several applications in fair covering and hitting of geometric set systems involving points and lines that are divided into multiple groups. Here, "fairness" ensures that the coverage (resp. hitting) requirement of every group is fully satisfied. We obtain a (2+ epsilon)-approximation for the Colorful Vertex Cover problem in time n(O(w/epsilon)), i.e., we obtain an O(1)-approximation in polynomial time for constant number of colors. Next, for the Colorful Edge Cover problem, we design an O(wn(3)) time exact algorithm, via a chain of reductions to a matching problem. For all intermediate problems in this chain of reductions, we design polynomial time algorithms, which might be of independent interest.

关键词： Color

来源：评论

学校读者我要写书评

暂无评论

Minimize Travel Time with Traffic Flow Density Equilibrium on Road Network 10th

Minimize Travel Time with Traffic Flow Density Equilibrium o...

引用

10th International Conference on Computational Data and Social Networks (CSoNet)

作者： Tang, Qinghua Li, Demin Zhou, Shuang Fu, Yue Donghua Univ Coll Informat Sci & Technol Shanghai 201620 Peoples R China Minist Educ Engn Res Ctr Digitized Textile & Apparel Technol Shanghai 201620 Peoples R China

ISBN: (纸本)9783030914349;9783030914332

With the complexity of the urban road network and the increase of the automatic electric vehicles (AEVs) on the road, the time spend on traffic is gradually increasing. Therefore, how to find the travel path with the minimize time in the complex road network to make balanced use of road resources remains a challenge. In is paper, we first propose a minimum travel time optimization model for AEV, which takes into account the constraints of traffic flow density. One of the reasons that affect the travel time cost is the choice of travel path, the other is the traffic flow density of the road section. When a large number of vehicles rush into the same road at the same time, which will increase the traffic flow density on the road, and then increase the travel cost of AEV. Therefore, second, we further consider the equilibrium of the traffic flow density of the road section, and obtain the AEV minimum travel time optimization model based on the equilibrium of the traffic flow density on road network, which can reduces the occurrence of traffic congestion and the travel cost of AEV. Finally, we propose optimal path planning (OPP) algorithm to solve the optimization problem and some real scenes of Songjiang District in Shanghai are used to verify the feasibility of the proposed model.

关键词： Automatic electric vehicle Traffic flow density Minimum travel time Equilibrium

来源：评论

学校读者我要写书评

暂无评论

The CamilleX Framework for the Rodin Platform 8th

The CamilleX Framework for the Rodin Platform

引用

7th International Conference on Rigorous State-Based Methods (ABZ)

作者： Hoang, Thai Son Snook, Colin Dghaym, Dana Fathabadi, Asieh Salehi Butler, Michael Univ Southampton ECS Southampton Hants England

ISBN: (纸本)9783030775421;9783030775438

We present the CamilleX framework for the Rodin platform in this paper. The framework provides a textual representation and persistence for the Event-B modelling constructs. It supports direct extensions to the Event-B syntax such as machine inclusion and record structures, as well as indirect extensions provided by other plugins such as UML-B diagrams. We discusses CamilleX's design and in particular, its extension mechanisms and examples of their use.

关键词： Event-B Rodin platform XText CamilleX

来源：评论

学校读者我要写书评

暂无评论

Fake News Detection Using LDA Topic Modelling and K-Nearest Neighbor Classifier 10th

Fake News Detection Using LDA Topic Modelling and K-Nearest ...

引用

10th International Conference on Computational Data and Social Networks (CSoNet)

作者： Casillo, Mario Colace, Francesco Gupta, Brij B. Santaniello, Domenico Valentino, Carmine Univ Salerno Fisciano SA Italy Natl Inst Technol Kurukshetra Kurukshetra Haryana India

ISBN: (纸本)9783030914349;9783030914332

The spread of the COVID 19 virus has dramatically impacted global society by modifying its lifestyle. Social networks, video streaming tools, virtual collaborative environments have been the primary source of communication through the Internet. This suspension of the "real" has led all activities to be declined through new places and contexts of virtual discussion, increasing new problems, including the most important related to the spread of so-called Fake News. The spread of such news can be devastating: consider what is happening during the critical vaccination phase for COVID 19. In this scenario, systems able to recognize, in a practical way, the truthfulness of news are becoming more and more valuable. This paper aims to present an approach that combines probabilistic and machine learning techniques such as Latent Dirichlet Allocation and K-NN in combination with Context-Awareness techniques to identify the veracity of the news. Adopting Context-Awareness techniqueswithin the proposed system allows a better definition of the operational context FakeNews refers to, reducing the problems of semantic polysemy. The first results obtained through standard datasets or using data from real contexts are very interesting and promising.

关键词： Fake news Fake news detection Latent Dirichlet allocation Machine learning Text classification

来源：评论

学校读者我要写书评

暂无评论

Complementation in T-perfect Graphs 1

引用

47th International Workshop on Graph-Theoretic Concepts in computer science (WG)

作者： Caw, Yixin Wang, Shenghua Hong Kong Polytech Univ Dept Comp Hong Kong Peoples R China

ISBN: (数字)9783030868383

ISBN: (纸本)9783030868376;9783030868383

Inspired by applications of perfect graphs in combinatorial optimization, Chv ' atal defined t-perfect graphs in 1970s. The long efforts of characterizing t-perfect graphs started immediately, but embarrassingly, even a working conjecture on it is still missing after nearly 50 years. Unlike perfection, t-perfection is not closed under substitution or complementation. A full characterization of t-perfection with respect to substitution has been obtained in the Ph.D. thesis of Benchetrit. Through this work we attempt to understand t-perfection with respect to complementation. In particular, we show there are only five pairs of graphs such that both the graphs and their complements are minimally t-imperfect.

关键词： Combinatorial optimization

来源：评论

学校读者我要写书评

暂无评论

Deep Bangla Authorship Attribution Using Transformer Models 10th

Deep Bangla Authorship Attribution Using Transformer Models

引用

10th International Conference on Computational Data and Social Networks (CSoNet)

作者： Al Imran, Abdullah Amin, Md Nur Amer Int Univ Bangladesh Dhaka Bangladesh Univ Jean Monnet St Etienne France

ISBN: (纸本)9783030914349;9783030914332

Authorship attribution is one of the renowned problems in the domain of Natural Language Processing (NLP). Leveraging the stateof-the-art (SOTA) techniques of NLP such as transformer models, this problem domain has achieved a considerable advancement. However, this progress is unfortunately only bound to the well-resourced languages like English, French, and German. Under-resourced language like Bangla is yet to leverage such SOTA techniques to make a breakthrough in this domain. In this study, we address this research gap and aim to contribute to the Bangla authorship attribution problem by building highly accurate models using several SOTA variants of transformer models like mBERT, bnBERT, bnElectra, and bnRoBERTa. Using the pre-trained weights of these models we have performed fine-tuning and tackled the task of authorship attribution of 16 prominent Bangla writers. Outcomes show that our bnBERT model can classify the authors with superior accuracy of 98% and also outperform all the existing models available in the literature.

关键词： Bangla Authorship attribution Text classification Natural Language Processing Transformer models BERT

来源：评论

学校读者我要写书评

暂无评论

The Role of Information Organization and Knowledge Structuring in Combatting Misinformation: A Literary Analysis 10th

The Role of Information Organization and Knowledge Structuri...

引用

10th International Conference on Computational Data and Social Networks (CSoNet)

作者： Caramancion, Kevin Matthe SUNY Albany Albany NY 12222 USA

ISBN: (纸本)9783030914349;9783030914332

This paper seeks to explore how the three hallmark dimensions of Information Organization-(1) Access, (2) Discovery, and (3) Retrieval-each as a construct paves the way for the rise of misinformation and, consequently, be the essential areas of interest for its control and regulations. Furthermore, the role of social networking platforms, grounded on folksonomy-designed environments, is examined on how they function as a seminal contributing factor for the creation and persistence of misinformation. A taxonomic approach as an addendum for the remedy of misinformation is assessed, including suggestions for its more robust implementation. This paper concludes with a summative precis of the presented ideas and literature on this subject and stipulates the general limitations of Information Organization and Knowledge Structuring in their applications in the domain of misinformation.

关键词： Taxonomy Folksonomy Misinformation

来源：评论

学校读者我要写书评

暂无评论

Feedback Vertex Set on Hamiltonian Graphs 1

引用

47th International Workshop on Graph-Theoretic Concepts in computer science (WG)

作者： Cavallaro, Dario Fluschnik, Till Tech Univ Berlin Fac 4 Algorithm & Computat Complex Berlin Germany

ISBN: (数字)9783030868383

ISBN: (纸本)9783030868376;9783030868383

We study the computational complexity of Feedback Vertex Set on subclasses of Hamiltonian graphs. In particular, we consider Hamiltonian graphs that are regular or are planar and regular. Moreover, we study the less known class of p-Hamiltonian-ordered graphs, which are graphs that admit for any p-tuple of vertices a Hamiltonian cycle visiting them in the order given by the tuple. We prove that Feedback Vertex Set remains NP-hard in these restricted cases, even if a Hamiltonian cycle is additionally given as part of the input.

关键词： Planar graphs Regular graphs Connected graphs Ordered graphs Hamiltonian-ordered graphs

来源：评论

学校读者我要写书评

暂无评论

Security Breaches in the Healthcare Domain: A Spatiotemporal Analysis 10th

Security Breaches in the Healthcare Domain: A Spatiotemporal...

引用

10th International Conference on Computational Data and Social Networks (CSoNet)

作者： Al Kinoon, Mohammed Omar, Marwan Mohaisen, Manar Mohaisen, David Univ Cent Florida Orlando FL USA NE Illinois Univ Chicago IL USA

ISBN: (纸本)9783030914349;9783030914332

Over the past several years, data breaches have grown and become more expensive in the healthcare sector. Healthcare organizations are the main target of cybercriminals due to the sensitive and valuable data, such as patient demographics, SSNs, and personal treatment records. Data breaches are costly to breached organizations and affected individuals;hospitals can suffer substantial damage after the breach, while losing customer trust. Attackers often use breached data maliciously, e.g., demanding ransom or selling patient's information on the dark web. To this end, this paper investigates data breaches incidents in the healthcare sector, including community, federal, and non-federal hospitals. Our analysis focuses on the reasoning and vulnerabilities that lead to data breaches, including the compromised information assets, geographical distribution of incidents, size of healthcare providers, the timeline discovery of incidents, and the discovery tools for external and internal incidents. We use correlation to examine the impact of several dimensions on data breaches. Among other interesting findings, our in-depth analysis and measurements revealed that the average number of data breaches in the United States is significantly higher than in the rest of the world, and the size of the health provider, accounting for factors such as the population and number of adults in a region, highly influences the level of exposure to data breaches in each state.

关键词： Healthcare data breaches Confidentiality Data security

来源：评论

学校读者我要写书评

暂无评论

Towards Refinement of Unbounded Parallelism in ASMs Using Concurrency and Reflection 8th

Towards Refinement of Unbounded Parallelism in ASMs Using Co...

引用

7th International Conference on Rigorous State-Based Methods (ABZ)

作者： Jiang, Fengqing Xiong, Neng Lian, Xinyu Gonzalez, Senen Schewe, Klaus-Dieter Zhejiang Univ UIUC Inst Haining Peoples R China TMConnected Linz Austria

ISBN: (纸本)9783030775421;9783030775438

The BSP bridging model can be exploited to support MapReduce processing. This article describes how this can be realised using a work-stealing approach, where an idle processor can autonomously grab a thread from a partially ordered pool of open threads and execute it. It is further outlined that this can be generalised for the refinement of an unboundedly parallel ASM by a concurrent, reflective BSP-ASM, i.e. the individual agents are associated with reflective ASMs, i.e. they can adapt their own program.

关键词： MapReduce Work stealing Reflection Abstract State Machine BSP bridging model

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：