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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

625 篇 会议
533 篇 期刊文献
7 册 图书

馆藏范围

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

日期分布

学科分类号

687 篇 工学
- 340 篇 计算机科学与技术...
- 268 篇 软件工程
- 114 篇 信息与通信工程
- 86 篇 电气工程
- 81 篇 电子科学与技术（可...
- 77 篇 控制科学与工程
- 75 篇 土木工程
- 75 篇 生物工程
- 71 篇 船舶与海洋工程
- 66 篇 生物医学工程（可授...
- 48 篇 化学工程与技术
- 42 篇 光学工程
- 38 篇 材料科学与工程（可...
- 35 篇 机械工程
- 30 篇 动力工程及工程热...
- 29 篇 仪器科学与技术
470 篇 理学
- 147 篇 数学
- 121 篇 生物学
- 112 篇 物理学
- 67 篇 海洋科学
- 58 篇 化学
- 55 篇 统计学（可授理学、...
- 37 篇 系统科学
170 篇 管理学
- 120 篇 管理科学与工程(可...
- 68 篇 工商管理
- 51 篇 图书情报与档案管...
97 篇 医学
- 65 篇 临床医学
- 58 篇 基础医学(可授医学...
- 31 篇 药学(可授医学、理...
32 篇 教育学
- 31 篇 教育学
30 篇 法学
28 篇 农学
20 篇 经济学
2 篇 艺术学
1 篇 文学
1 篇 军事学

主题

21 篇 computer archite...
19 篇 optimization
18 篇 computer science
18 篇 computational mo...
16 篇 conferences
16 篇 accuracy
16 篇 training
15 篇 neural networks
15 篇 machine learning
15 篇 software
14 篇 software enginee...
14 篇 feature extracti...
14 篇 data models
13 篇 systems engineer...
13 篇 predictive model...
13 篇 semantics
13 篇 equations
12 篇 visualization
12 篇 uncertainty
12 篇 hardware

机构

12 篇 wireless and mic...
11 篇 systems engineer...
8 篇 health managemen...
8 篇 ieee
8 篇 wireless and mic...
7 篇 department of bi...
7 篇 tércio pacitti i...
7 篇 university colle...
7 篇 the pillar of in...
7 篇 postgraduate pro...
7 篇 systems engineer...
6 篇 department of ph...
6 篇 department of co...
6 篇 karachi pakistan
6 篇 health systems a...
6 篇 department of pu...
6 篇 julius centre fo...
6 篇 department of co...
6 篇 the school of au...
6 篇 electrical and c...

作者

19 篇 baylis charles
14 篇 daniel schneider
11 篇 charles baylis
10 篇 niyato dusit
10 篇 jano moreira de ...
9 篇 xiong zehui
9 篇 du hongyang
8 篇 fellows matthew
8 篇 marks robert j.
8 篇 cohen lawrence
8 篇 antónio correia
7 篇 llanos carlos h.
7 篇 barbosa valmir c...
7 篇 marcos antonio d...
7 篇 kang jiawen
7 篇 robert j. marks
6 篇 moldovan matthew
6 篇 martin josh
6 篇 abdelmalek kouad...
6 篇 carlos h. llanos

语言

1,131 篇 英文
24 篇 其他
8 篇 中文
3 篇 日文
1 篇 德文
1 篇 法文
1 篇 葡萄牙文

检索条件"机构=Program of Systems and Computer Engineering"

共 1165 条记录，以下是261-270 订阅

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

详细简洁

排序：

Who is right? Evaluating empirical contradictions in the readability & comprehensibility of source code 20

Who is right? Evaluating empirical contradictions in the rea...

引用

20th Ibero-American Conference on Software engineering, CIbSE 2017

作者： Ribeiro, Talita Vieira Travassos, Guilherme Horta PESC/COPPE/UFRJ - Systems Engineering and Computer Science Program Centro de Tecnologia Federal University of Rio de Janeiro Cidade Universitária Bloco H Sala 319 Rio de Janeiro RJ Brazil

ISBN: (纸本)9789873806988

Context: Several code guidelines aim at providing a common perspective on the readability and comprehensibility of source code. However, in many cases, they are contradictory on how to improve these quality characteristics. Objective: To analyze the influence of three contradictory source code attributes - indentation spacing, identifier length and code size - on the source code reada-bility and comprehensibility, interpreting whether programming experience and domain knowledge can support explaining these contradictions. Method: To per-form an empirical study with software developers collecting quantitative (Likert scale) and qualitative data to assess the readability and comprehensibility of de-velopers regarding Python snippets. To observe eventual perceptions contradic-tions and whether their levels of experience and knowledge have something to do with such contrary results. Results: Regardless their programming experience, 4-spaces indentation dominated the readability preference of participants. While the readability and comprehensibility preferences towards long and complete-word identifiers were mostly true for both novice/experts, developers with more experience and low domain knowledge level seemed to be more affected by the length of identifiers. Furthermore, while all participants showed more positive comprehensibility perceptions for Pythin snippets with more lines of code, their readability perceptions regardnig code size were contradictory since the less experienced participants preferred more lines of code and the more experienced ones prefer fewer lines. Conclusion: The results presented in the technical literature seemed to be caused by the interchangeable use of the readability and comprehensibility concepts. Further investigation is still needed to observe whether other confounding factors might support the explanation of such contrary results.

关键词： Codes (symbols)

来源：评论

学校读者我要写书评

暂无评论

Modeling the breakage-fusion-bridge mechanism: Combinatorics and cancer genomics

引用

16th Annual International Conference on Research in Computational Molecular Biology, RECOMB 2012

作者： Kinsella, Marcus Bafna, Vineet Bioinformatics and Systems Biology Program University of California San Diego San Diego CA 92093 United States Department of Computer Science and Engineering University of California San Diego San Diego CA 92093 United States

ISBN: (纸本)9783642296260

The breakage-fusion-bridge (BFB) mechanism was proposed over seven decades ago and is a source of genomic variability and gene amplification in cancer. Here we formally model and analyze the BFB mechanism, to our knowledge this first time this has been undertaken. We show that BFB can be modeled as successive inverted prefix duplications of a string. Using this model, we show that BFB can achieve a surprisingly broad range of amplification patterns. We find that a sequence of BFB operations can be found that nearly fits most patterns of copy number increases along a chromosome. We conclude that this limits the usefulness of methods like array CGH for detecting BFB and discuss other implications for understanding mechanisms of genomic instability. © 2012 Springer-Verlag Berlin Heidelberg.

关键词： Pattern matching

来源：评论

学校读者我要写书评

暂无评论

Exploring provenance in high performance scientific computing

Exploring provenance in high performance scientific computin...

引用

1st Annual 2011 Workshop on High-Performance Computing Meets Databases, HPCDB'11, Co-located with Supercomputing, SC'11

作者： Gadelha Jr., Luiz M.R. Wilde, Michael Mattoso, Marta Foster, Ian Computer and Systems Engineering Program Federal University of Rio de Janeiro Brazil National Laboratory for Scientific Computing Brazil Mathematics and Computer Science Division Argonne National Laboratory United States Computation Institute Argonne National Laboratory University of Chicago United States Department of Computer Science University of Chicago United States

ISBN: (纸本)9781450311571

Large-scale scientific computations are often organized as a composition of many computational tasks linked through data flow. After the completion of a computational scientific experiment, a scientist has to analyze its outcome, for instance, by checking inputs and outputs of computational tasks that are part of the experiment. This analysis can be automated using provenance management systems that describe, for instance, the production and consumption relationships between data artifacts, such as files, and the computational tasks that compose the scientific application. In this article, we explore the relationship between high performance computing and provenance management systems, observing that storing provenance as structured data enriched with information about the runtime behavior of computational tasks in high performance computing environments can enable interesting and useful queries to correlate computational resource usage, scientific parameters, and data set derivation. We briefly describe how provenance of many-task scientific computations specified and coordinated by the Swift parallel scripting system is gathered and queried. © 2011 ACM.

关键词： Information management

来源：评论

学校读者我要写书评

暂无评论

Provenance traces of the swift parallel scripting system 13

Provenance traces of the swift parallel scripting system

引用

Joint EDBT/ICDT 2013 Workshops

作者： Gadelha Jr., Luiz M. R. Wilde, Michael Mattoso, Marta Foster, Ian National Laboratory for Scientific Computing Brazil Mathematics and Computer Science Division Argonne National Laboratory United States Computation Institute Argonne National Laboratory University of Chicago United States Computer and Systems Engineering Program Federal University of Rio de Janeiro Brazil Department of Computer Science University of Chicago United States

ISBN: (纸本)9781450315999

In this abstract, we describe provenance traces generated from executions of scientific workflows managed by the Swift parallel scripting system. They follow a provenance data model, used by MTCProv, the provenance management component of Swift. It is similar to PROV, representing most of its core concepts and including additional information about the scientific domain, computational resource consumption, and prospective provenance. We describe provenance queries that follow patterns commonly found in high performance computing and that are straightforward to support with MTCProv's built-in procedures. These queries often involve costly relational join operations and recursion, providing a relevant case for benchmarking. © 2013 Authors.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Hardware-based parallel firefly algorithm for embedded applications

Hardware-based parallel firefly algorithm for embedded appli...

引用

2013 NASA/ESA Conference on Adaptive Hardware and systems, AHS 2013

作者： Muñoz, Daniel M. Llanos, Carlos H. Dos Santos Coelho, Leandro Ayala-Rincón, Mauricio Electronics Engineering Graduate Program Faculty of Gama University of Brasilia Brasilia DF Brazil Department of Mechanical Engineering Automation and Control Group/GRACO University of Brasilia Brasilia DF Brazil Industrial and Systems Engineering Graduate Program LAS/PPGEPS Pontifical Catholic University of Parana Curitiba Parana Brazil Departments of Computer Science and Mathematics University of Brasilia Brasilia DF Brazil

ISBN: (纸本)9781467363839

The firefly algorithm (FA) is a new population-based metaheuristic bioinspired on the behavior of the flashing characteristics of fireflies. As a population-based algorithm, the FA suffers from large execution times specifically for embedded optimization problems with computational limitations. For reducing execution times we propose a hardware parallel architecture of the FA algorithm that facilitates the implementation in Field programmable Gate Arrays (FPGAs). In addition, this work proposes the application of the opposition-based learning (OBL) approach to the FA algorithm. The respective hardware implementation (HPOFA) was mapped into a Virtex5 FPGA device and numerical experiments using four well-known benchmark problems demonstrate that the opposition-based approach allows the FA algorithm to improve its functionality, preserving the swarm diversity and avoiding the premature convergence problem. Synthesis results point out that the HPOFA architecture is effectively mapped in hardware and is suitable for embedded applications. © 2013 IEEE.

关键词： Parallel architectures

来源：评论

学校读者我要写书评

暂无评论

Detecting defects of railway tracks by using computer vision methodology

Detecting defects of railway tracks by using computer vision...

引用

IISE Annual Conference and Expo 2021

作者： Ravishankar, Premkumar Tokgoz, Berna Eren Zhang, Xulong Zhang, Jing Hwang, Seokyon Department of Industrial and Systems Engineering Lamar University BeaumontTX United States Department of Computer Science Lamar University BeaumontTX United States Construction Management Program Lamar University BeaumontTX United States

ISBN: (纸本)9781713838470

Maintaining railway tracks in healthy conditions is critical to ensuring the safe operation of railroad transportation. According to the Federal Railroad Administration (FRA), nearly 23% of train accidents that occurred between 2015 to 2020 were due to the defects of the tracks. In an effort to prevent such accidents, railway companies regularly inspect tracks to detect and fix defects of track systems. This research proposes an innovative method for conducting railroad track inspection to enhance the maintenance operation. The proposed approach aims to overcome the existing inspection practices based on human observation that is costly, time-consuming, and error prone. To this end, the proposed method utilizes computer vision methodologies to achieve high-level automation and accuracy of defect detection through the analysis of digital images. The outcome of this study is envisioned to help railway companies perform predictive maintenance more effectively and, thereby, reduce the risk of train accidents and increase the resiliency of their assets. © 2021 IISE Annual Conference and Expo 2021. All rights reserved.

关键词： Railroad tracks

来源：评论

学校读者我要写书评

暂无评论

Logic as energy: A SAT-based approach

Logic as energy: A SAT-based approach

引用

2nd International Symposium on Brain, Vision, and Artificial Intelligence, BVAI 2007

作者： Lima, Priscila M. V. Morveli-Espinoza, M. Mariela M. França, Felipe M. G. LAM - Computer Architecture and Microelectronics Laboratory Universidade Federal Do Rio de Janeiro Brazil Departament d'Informàtica Universitat Autònoma de Barcelona Spain COPPE - Systems Engineering and Computer Science Program Universidade Federal Do Rio de Janeiro Brazil

ISBN: (纸本)3540755543

This paper presents the implementation of ARQ-PROP II, a limited-depth propositional reasoner, via the compilation of its specification into an exact formulation using the satyrus platform. satyrus' compiler takes as input the definition of a problem as a set of pseudo-Boolean constraints and produces, as output, the Energy function of a higher-order artificial neural network. This way, satisfiability of a formula can be associated to global optima. In the case of ARQ-PROP II, global optima is associated to Resolution-based refutation, in such a way that allows for simplified abduction and prediction to be unified with deduction. Besides experimental results on deduction with ARQ-PROP II, this work also corrects the mapping of satisfiability into Energy minima originally proposed by Gadi Pinkas. © 2007 Springer-Verlag Berlin Heidelberg.

关键词： Neural networks

来源：评论

学校读者我要写书评

暂无评论

Incorporating ethics education into an electrical and computer engineering undergraduate program 125

Incorporating ethics education into an electrical and comput...

引用

125th ASEE Annual Conference and Exposition

作者： Ghorbani, Mahsa Maciejewski, Anthony A. Siller, Thomas J. Chong, Edwin K.P. Omur-Ozbek, Pinar Atadero, Rebecca A. Colorado State University Program of Systems Engineering United States Colorado State University Department of Electrical and Computer Engineering United States Colorado State University Department in Civil and Environmental Engineering United States Colorado State University Department of Electrical and Computer Engineering and of Mathematics United States Colorado State University Civil and Environmental Engineering Department United States Colorado State University Department of Civil and Environmental Engineering United States

来源：评论

学校读者我要写书评

暂无评论

Performance Enhancement of Stream-Based Decompression Process by Notifying Compression Buffer Size

Performance Enhancement of Stream-Based Decompression Proces...

引用

IEEE Symposium on computers and Communications (ISCC)

作者： Taiki Kato Shinichi Yamagiwa Koichi Marumo Master's Program in Computer Science Degree Program in Systems and Information Engineering University of Tsukuba Tsukuba Ibalaki Japan Faculty of Engineering Information and Systems University of Tsukuba Tsukuba Ibalaki Japan

This paper focuses on a performance enhancement of communication performance by compressing data stream. ASE coding is an effective lossless data compression method for data stream. The software implementation of the coding/decoding method inevitably meets a performance mismatch in memory and storage devices. In the compressor side, it is predictable to decide the size of an original data block and is available to process a flexible buffer memory. However, the decompressor is not able to predict the buffer size because the original data size is not obvious before the decompression. This causes a performance mismatch in the filesystem level. This paper proposes a novel method to address the performance mismatch by applying a notification mechanism of compression size from the compressor. This paper describes the mechanism focusing on the system call usage. Through experimental evaluations, we show the performance improvement of the decompression performance for handling data stream.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Toward Parallelization Technique for Stream-based Lossless Data Compression

Toward Parallelization Technique for Stream-based Lossless D...

引用

IEEE International Conference on Big Data

作者： Taiki Kato Shinichi Yamagiwa Koichi Wada Master’s Program in Computer Science Degree Program in Systems and Information Engineering University of Tsukuba Tsukuba Ibalaki Japan Faculty of Engineering Information and Systems University of Tsukuba Tsukuba Ibalaki Japan

IoT edge platform has become popular in various distributed environments. The edge devices need to communicate BigData among them or with the cloud servers by collaborating with AI technologies for finding events from the applications. Those devices exchange data streams from such as distributed sensors and remote image/video devices. We focus on an acceleration technique for the communication performance using a stream-based lossless data compression technology. This paper proposes a parallelization technique for the compression process in a software environment running on a multicore processor. The technique invokes concurrent compression processes assigned to multiple threads with splitting a data stream to chunks. The paper exposes three scheduling methods for assigning the chunks to the threads: in-order, hybrid and out-of-order. As an original data order of chunks must be obtained in decompression side, the proposed technique introduces packeting mechanisms in each chunk by adding headers to support the scheduling methods. Through experimental performance evaluations, we discuss the packeting overhead focusing on compression ratio and speedup by the parallelization with three scheduling methods.

关键词：

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共117页 << < 23 24 25 26 27 28 29 30 31 32 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：