首页 > 最新文献

Vestnik Tomskogo Gosudarstvennogo Universiteta-Upravlenie Vychislitelnaja Tehnika i Informatika-Tomsk State University Journal of Control and Computer Science最新文献

英文 中文
Estimation of present value of n-year life annuity for endowment insurance 养老保险n年终身年金现值的估计
O. Gubina, G. Koshkin
N x n i i N i N i i
N x N i i N i i i
{"title":"Estimation of present value of n-year life annuity for endowment insurance","authors":"O. Gubina, G. Koshkin","doi":"10.17223/19988605/50/5","DOIUrl":"https://doi.org/10.17223/19988605/50/5","url":null,"abstract":"N x n i i N i N i i","PeriodicalId":42063,"journal":{"name":"Vestnik Tomskogo Gosudarstvennogo Universiteta-Upravlenie Vychislitelnaja Tehnika i Informatika-Tomsk State University Journal of Control and Computer Science","volume":"43 1","pages":""},"PeriodicalIF":0.1,"publicationDate":"2020-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74083521","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Optimal estimate of the states of a generalized asynchronous event flow with an arbitrary number of states under conditions of unextendable dead time 不可扩展死时间条件下具有任意数量状态的广义异步事件流状态的最优估计
A. Gortsev, L. Nezhel'skaya
Рассматривается задача оптимальной оценки состояний обобщенного асинхронного дважды стохастического потока событий с произвольным (конечным) числом состояний, являющегося одной из математических моделей информационных потоков сообщений, функционирующих в телекоммуникационных сетях. Условия наблюдения за потоком таковы, что каждое наблюдаемое событие порождает период мертвого времени, в течение которого другие события потока недоступны наблюдению и не вызывают продления его периода (непродлевающееся мертвое время). Находится явный вид апостериорных вероятностей состояний потока. Решение о состоянии потока выносится по критерию максимума апостериорной вероятности. Ключевые слова: обобщенный асинхронный дважды стохастический поток событий; апостериорная вероятность; оптимальная оценка состояний; непродлевающееся мертвое время.
目前正在考虑最佳地评估在电信网络中运行的信息流的数学模型中的任意(有限)状态下的异步通量。观察流的条件是,每一件事件都会产生一段死亡时间,在此期间,其他流事件无法被监测,也不会导致其延长(未延长的死亡时间)。流态的使徒概率是显而易见的。流程状态的决定是根据使徒概率的最高标准作出的。关键词:广义异步双随机事件流;后验概率;最佳状态评价一段无法延长的死亡时间。
{"title":"Optimal estimate of the states of a generalized asynchronous event flow with an arbitrary number of states under conditions of unextendable dead time","authors":"A. Gortsev, L. Nezhel'skaya","doi":"10.17223/19988605/49/5","DOIUrl":"https://doi.org/10.17223/19988605/49/5","url":null,"abstract":"Рассматривается задача оптимальной оценки состояний обобщенного асинхронного дважды стохастического потока событий с произвольным (конечным) числом состояний, являющегося одной из математических моделей информационных потоков сообщений, функционирующих в телекоммуникационных сетях. Условия наблюдения за потоком таковы, что каждое наблюдаемое событие порождает период мертвого времени, в течение которого другие события потока недоступны наблюдению и не вызывают продления его периода (непродлевающееся мертвое время). Находится явный вид апостериорных вероятностей состояний потока. Решение о состоянии потока выносится по критерию максимума апостериорной вероятности. Ключевые слова: обобщенный асинхронный дважды стохастический поток событий; апостериорная вероятность; оптимальная оценка состояний; непродлевающееся мертвое время.","PeriodicalId":42063,"journal":{"name":"Vestnik Tomskogo Gosudarstvennogo Universiteta-Upravlenie Vychislitelnaja Tehnika i Informatika-Tomsk State University Journal of Control and Computer Science","volume":"22 1","pages":""},"PeriodicalIF":0.1,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88309316","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Selection of features into the object's own space based on the measure of its compactness 根据物体的紧度度量,选择特征到物体自身的空间中
N. Ignatyev, A. Mirzaev
 Z ( S d , ρ) ≠  . The compactness of the object S d ∊ K t on the set X ( d i t i d t X k S K O S Z S K         The object S i ∊ K i ,ρ)|/| K 3- t |,       3 , m i n , r t i j t j i j r S K g S K S S S S     3 -t ∩ Γ ( p ) is the nearest one. The set X ( u )  X ( n ), computed on E 0 { S i } as             m a x d d X k X n X u X k     is considered informative for the object S d ∊ K t , and the value of θ d ( X ( u )) is considered as a measure of its compactness. To implement the algorithm of step by step selection of features into an informative set, data preprocessing is performed. The purpose of preprocessing is to select the first pair ( x i , x j ) into an informative set based on the proposed criterion. The criterion is used to search for a cluster of data with a maximum density of descriptions of objects of one with S d class
Z (S d, ρ)≠。对象的密实度S d∊K t在集合X (d我t d t X K K O年代Z S K对象我∊K,ρ)| | | K / 3 - t,3 m我n,我t j t j r K g S K年代年代年代3 - t∩Γ(p)最近的一个。集合X (u)X (n),在E 0 {S i}上计算为ma X d d X k X k X n X u X k被认为是对象S d k t的信息量,θ d (X (u))的值被认为是其紧性的度量。为了实现将特征逐步选择为信息集的算法,对数据进行预处理。预处理的目的是根据提出的标准选择第一对(x i, x j)到一个信息集中。该准则用于搜索一类对象描述密度最大的数据簇,该类对象的描述密度为1
{"title":"Selection of features into the object's own space based on the measure of its compactness","authors":"N. Ignatyev, A. Mirzaev","doi":"10.17223/19988605/49/7","DOIUrl":"https://doi.org/10.17223/19988605/49/7","url":null,"abstract":" Z ( S d , ρ) ≠  . The compactness of the object S d ∊ K t on the set X ( d i t i d t X k S K O S Z S K         The object S i ∊ K i ,ρ)|/| K 3- t |,       3 , m i n , r t i j t j i j r S K g S K S S S S     3 -t ∩ Γ ( p ) is the nearest one. The set X ( u )  X ( n ), computed on E 0 { S i } as             m a x d d X k X n X u X k     is considered informative for the object S d ∊ K t , and the value of θ d ( X ( u )) is considered as a measure of its compactness. To implement the algorithm of step by step selection of features into an informative set, data preprocessing is performed. The purpose of preprocessing is to select the first pair ( x i , x j ) into an informative set based on the proposed criterion. The criterion is used to search for a cluster of data with a maximum density of descriptions of objects of one with S d class","PeriodicalId":42063,"journal":{"name":"Vestnik Tomskogo Gosudarstvennogo Universiteta-Upravlenie Vychislitelnaja Tehnika i Informatika-Tomsk State University Journal of Control and Computer Science","volume":"85 1","pages":""},"PeriodicalIF":0.1,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89891034","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
On the lengths of the paths in self-testing checkers based on CLB 基于CLB的自检检查器路径长度的研究
N. B. Butorina, E. Pakhomova
{"title":"On the lengths of the paths in self-testing checkers based on CLB","authors":"N. B. Butorina, E. Pakhomova","doi":"10.17223/19988605/48/11","DOIUrl":"https://doi.org/10.17223/19988605/48/11","url":null,"abstract":"","PeriodicalId":42063,"journal":{"name":"Vestnik Tomskogo Gosudarstvennogo Universiteta-Upravlenie Vychislitelnaja Tehnika i Informatika-Tomsk State University Journal of Control and Computer Science","volume":"66 1","pages":""},"PeriodicalIF":0.1,"publicationDate":"2019-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88427877","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Estimation of the unextendable dead time duration in correlated synchronous generalized flow of the second order 二阶相关同步广义流不可扩展死区时间的估计
L. Nezhelskaya, E. Sidorova
{"title":"Estimation of the unextendable dead time duration in correlated synchronous generalized flow of the second order","authors":"L. Nezhelskaya, E. Sidorova","doi":"10.17223/19988605/48/3","DOIUrl":"https://doi.org/10.17223/19988605/48/3","url":null,"abstract":"","PeriodicalId":42063,"journal":{"name":"Vestnik Tomskogo Gosudarstvennogo Universiteta-Upravlenie Vychislitelnaja Tehnika i Informatika-Tomsk State University Journal of Control and Computer Science","volume":"22 1","pages":""},"PeriodicalIF":0.1,"publicationDate":"2019-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80457918","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Subcircuits discovery in transistor level CMOS circuits using Graph Mining 利用图挖掘在晶体管级CMOS电路中发现子电路
D. Cheremisinov, L. Cheremisinova
{"title":"Subcircuits discovery in transistor level CMOS circuits using Graph Mining","authors":"D. Cheremisinov, L. Cheremisinova","doi":"10.17223/19988605/48/9","DOIUrl":"https://doi.org/10.17223/19988605/48/9","url":null,"abstract":"","PeriodicalId":42063,"journal":{"name":"Vestnik Tomskogo Gosudarstvennogo Universiteta-Upravlenie Vychislitelnaja Tehnika i Informatika-Tomsk State University Journal of Control and Computer Science","volume":"227 1","pages":""},"PeriodicalIF":0.1,"publicationDate":"2019-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87030367","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
75 years to professor Anatoly Grigorievich Dmitrenko 给阿纳托利·格里戈里耶维奇·德米特里科教授75年
{"title":"75 years to professor Anatoly Grigorievich Dmitrenko","authors":"","doi":"10.17223/19988605/48/13","DOIUrl":"https://doi.org/10.17223/19988605/48/13","url":null,"abstract":"","PeriodicalId":42063,"journal":{"name":"Vestnik Tomskogo Gosudarstvennogo Universiteta-Upravlenie Vychislitelnaja Tehnika i Informatika-Tomsk State University Journal of Control and Computer Science","volume":"21 1","pages":""},"PeriodicalIF":0.1,"publicationDate":"2019-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86857770","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Optimization of constructing the neuromorphic fault dictionary for testing and diagnostics of analog ICs 用于模拟集成电路测试与诊断的神经形态故障字典构建优化
S. Mosin
{"title":"Optimization of constructing the neuromorphic fault dictionary for testing and diagnostics of analog ICs","authors":"S. Mosin","doi":"10.17223/19988605/48/12","DOIUrl":"https://doi.org/10.17223/19988605/48/12","url":null,"abstract":"","PeriodicalId":42063,"journal":{"name":"Vestnik Tomskogo Gosudarstvennogo Universiteta-Upravlenie Vychislitelnaja Tehnika i Informatika-Tomsk State University Journal of Control and Computer Science","volume":"133 1","pages":""},"PeriodicalIF":0.1,"publicationDate":"2019-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82679738","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
The study of the assembly of poisson flows 泊松流集合的研究
G. Tsitsiashvili, M. Osipova
{"title":"The study of the assembly of poisson flows","authors":"G. Tsitsiashvili, M. Osipova","doi":"10.17223/19988605/48/6","DOIUrl":"https://doi.org/10.17223/19988605/48/6","url":null,"abstract":"","PeriodicalId":42063,"journal":{"name":"Vestnik Tomskogo Gosudarstvennogo Universiteta-Upravlenie Vychislitelnaja Tehnika i Informatika-Tomsk State University Journal of Control and Computer Science","volume":"111 1","pages":""},"PeriodicalIF":0.1,"publicationDate":"2019-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75944997","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
3D object identification based on global shape descriptors 基于全局形状描述符的三维目标识别
A. V. Pristupa, I. Lapatin, A. Zamyatin
{"title":"3D object identification based on global shape descriptors","authors":"A. V. Pristupa, I. Lapatin, A. Zamyatin","doi":"10.17223/19988605/48/7","DOIUrl":"https://doi.org/10.17223/19988605/48/7","url":null,"abstract":"","PeriodicalId":42063,"journal":{"name":"Vestnik Tomskogo Gosudarstvennogo Universiteta-Upravlenie Vychislitelnaja Tehnika i Informatika-Tomsk State University Journal of Control and Computer Science","volume":"125 1","pages":""},"PeriodicalIF":0.1,"publicationDate":"2019-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80380048","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
期刊
Vestnik Tomskogo Gosudarstvennogo Universiteta-Upravlenie Vychislitelnaja Tehnika i Informatika-Tomsk State University Journal of Control and Computer Science
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1