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

IEEE Information Theory Workshop

作者： Milenkovic, O Vasic, B Univ Colorado Dept Elect & Comp Engn Boulder CO 80309 USA

ISBN: (纸本)0780387201

The aim of this paper is to describe a new class of problems and some new results in coding theory arising from the analysis of the composition and functionality of the genetic code. The major goal of the proposed work is to initiate research on investigating possible connections between the regulatory network of gene interactions (RNGI) and the proofreading (error-control) mechanism of the processes of the central dogma of genetics. New results include establishing a direct relationship between Boolean Network (BN) Models of RNGI and Gallager's LDPC decoding algorithms. The proposed research topics and described results are expected to have a two-fold impact on coding theory and genetics research. Firstly, they may provide a different setting in which to analyze standard LDPC decoding algorithms, by using dynamical systems and Boolean function theory. Secondly, they may be of use in establishing deeper relationships between the DNA proofreading mechanism, RNGIs, as well as their joint influence on the development and possible treatment of genetic diseases like cancer.

关键词： parity check codes genetics Boolean functions error correction codes cancer information theory coding problems coding theory genetic code regulatory network of gene interactions RNGI proofreading mechanism error-control mechanism Boolean network models LDPC decoding algorithms Boolean function theory genetic diseases Genetics Shannon's theory Boolean functions Information Theory Hereditary Diseases Genetic Code parity check codes network model

来源：评论

学校读者我要写书评

暂无评论

SETH-hardness of coding problems 60

SETH-hardness of Coding Problems

引用

60th IEEE Annual Symposium on Foundations of Computer Science (FOCS)

作者： Stephens-Davidowitz, Noah Vaikuntanathan, Vinod MIT 77 Massachusetts Ave Cambridge MA 02139 USA

ISBN: (纸本)9781728149523

We show that assuming the strong exponential time hypothesis (SETH), there are no non-trivial algorithms for the nearest codeword problem (NCP), the minimum distance problem (MDP), or the nearest codeword problem with preprocessing (NCPP) on linear codes over any finite field. More precisely, we show that there are no NCP, MDP, or NCPP algorithms running in time q(1-')' for any constants > 0 for codes with q' codewords. (In the case of NCPP, we assume non -uniform SETH.) We also show that there are no sub -exponential time algorithms for -y-approximate versions of these problems for some constant 7 > 1, under different versions of the exponential -time hypothesis.

关键词： coding problems fine-grained hardness SETH linear codes

来源：评论

学校读者我要写书评

暂无评论

Analysis of the Existing problems in the coding of Disease and Operation in Homepage of the Medical Record

引用

Chinese Medical Record English Edition 2013年第6期1卷 221-223页

Objective. The implementation of diagnosis-related groups – prospective payment system (DRGs-PPS) and the work of classifying and coding disease play a very important role in the operation and management of a hospital. This paper aims to discover problems affecting the accuracy of coding, to improve accuracy of the disease and operation coding, and to improve the report quality, through the retrospective examination of the coding contents on the homepage of medical *** Six Sigma method was used for randomly inspecting a part of the medical record data statistically reported by tertiary hospitals and secondary hospitals from the information center of the Beijing Municipal Health Bureau, and on-site inspection was performed, in order to find out reasons affecting the coding *** the 695 medical records inspected, there were 258 cases having problems in the selection of the main diagnosis and the coding of the operation, accounting for 37% of the *** are the key people responsible for the medical indices and economic benefits of the hospital, and should learn the relevant knowledge of disease and surgery/operation classification from sorters, in order to ensure the correctness of diagnosis-related groups. Coders should strengthen the training, exchanging and grasping of new classification knowledge so as to improve their professional level.

关键词： Homepage of the medical record coding problems Analysis

来源：评论

学校读者我要写书评

暂无评论

Characterization and Prediction of Questions without Accepted Answers on Stack Overflow 29

Characterization and Prediction of Questions without Accepte...

引用

29th IEEE/ACM International Conference on Program Comprehension (ICPC) / 18th IEEE/ACM International Conference on Mining Software Repositories (MSR)

作者： Yazdaninia, Mohamad Lo, David Sami, Ashkan Shiraz Univ Dept CSE & IT Shiraz Iran Singapore Management Univ Sch Informat Syst Singapore Singapore

ISBN: (纸本)9781665414036

A fast and effective approach to obtain information regarding software development problems is to search them to find similar solved problems or post questions on community question answering (CQA) websites. Solving coding problems in a short time is important, so these CQAs have a considerable impact on the software development process. However, if developers do not get their expected answers, the websites will not be useful, and software development time will increase. Stack Overflow is the most popular CQA concerning programming problems. According to its rules, the only sign that shows a question poser has achieved the desired answer is the user's acceptance. In this paper, we investigate unresolved questions, without accepted answers, on Stack Overflow. The number of unresolved questions is increasing. As of August 2019, 47% of Stack Overflow questions were unresolved. In this study, we analyze the effectiveness of various features, including some novel features, to resolve a question. We do not use the features that contain information not present at the time of asking a question, such as answers. To evaluate our features, we deploy several predictive models trained on the features of 18 million questions to predict whether a question will get an accepted answer or not. The results of this study show a significant relationship between our proposed features and getting accepted answers. Finally, we introduce an online tool that predicts whether a question will get an accepted answer or not. Currently, Stack Overflow's users do not receive any feedback on their questions before asking them, so they could carelessly ask unclear, unreadable, or inappropriately tagged questions. By using this tool, they can modify their questions and tags to check the different results of the tool and deliberately improve their questions to get accepted answers.

关键词： empirical software engineering coding problems Stack Overflow

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：