• 学术搜索
  • 科研智能体
    • Research Labs
    • AI 阅读
    • AI 文库
    • 深度研究
    • 学者亮点
  • 学术资源
    • AI2000
    • 期刊/会议
    • 学者库
    • 学术API
    • 溯源树
    • 数据集
  • 知识沉淀
    • 学术空间
订阅小程序
旧版功能
aminer vip
开通会员低至0.73元/天
一次搞定AI科研
立即登录
  • English
  • 联系方式
    奥

    奥伦堡州立大学

    Orenburg State University
    院校EST. 1955
    3,012论文总数
    7,792引用总数

    论文量&引用量时间轴

    机构学者

    排序
    Irina Pavlovna Bolodurina
    Irina Pavlovna Bolodurina
    Department of Mathematics and Information Technology, Orenburg State University
    论文:108引用:0H-index:0
    M. G. Kucherenko
    M. G. Kucherenko
    Center for Laser and Informational Biophysics, Orenburg State University
    论文:82引用:0H-index:0
    Denis Parfenov
    Denis Parfenov
    Orenburg State University
    论文:70引用:0H-index:0
    Alexander Shukhman
    Alexander Shukhman
    Department of Mathematics and Information Technology, Orenburg State University
    论文:49引用:0H-index:0
    Anatoly Skalny
    Anatoly Skalny
    Department of Medical Elementology, Institute of Medicine, RUDN University;Trace Element Institute for UNESCO;Laboratory of Biotechnology and Applied Bioelementology, Yaroslavl Demidov State University;Department of Nutrition and Bioelementology, Orenburg State University;Institute of Bioelementology, Orenburg State University;Center for Biotic Medicine
    论文:41引用:0H-index:0
    Alexey A. Tinkov
    Alexey A. Tinkov
    Laboratory of Biotechnology and Applied Bioelementology, P. G. Demidov Yaroslavl State University;Laboratory for Molecular Dietetics, I.M. Sechenov First Moscow State Medical University;Department of Medical Elementology, RUDN University
    论文:35引用:0H-index:0
    Leonid Legashev
    Leonid Legashev
    Orenburg State University
    论文:34引用:0H-index:0
    S. N. Letuta
    S. N. Letuta
    Orenburg State University
    论文:32引用:0H-index:0
    Jie Cui
    Jie Cui
    School of Computer Science and Technology of Anhui University
    论文:30引用:0H-index:0

    论文(3012)

    年份
    起
    –
    止
    排序
    1Justifying Priorities in Regional Development Through an Integrated Assessment of a Region's Overall Potential
    Natalia V. Speshilova, Pavel O. Nesedov

    Uneven socio-economic development in Russian regions stems not from some regions lagging behind the leaders, but from inefficient and fragmented use of internal potential. This study offers a methodological approach to inform strategic regional development using a comprehensive assessment of a region's potential. The analysis uses official statistical data from 2014 to 2023 and examines 87 indicators across 20 areas of regional development using classical analysis and synthesis. The proposed methodology assesses regional potential by accounting for neighbouring regions, population density, and interdependencies among indicators. An original matrix of inter-potential interactions is introduced to identify both limiting and enabling factors in regional economic performance. The methodology's validity is supported by expert evaluation. It is applied to regions of the Volga Federal Okrug, with a particular focus on Orenburg Oblast, which is notable for its combination of agriculture, industry, extractive sectors, and border location. Comparison of the results with the region's 2030 Development Strategy reveals gaps and priorities for investment, industry, R&D, and logistics. Analysis of regional growth drivers in relation to neighbouring regions also reveals potential for creating interregional specialized territories to enhance cooperation. The methodology has practical relevance for designing regional development strategies and policy programs. Due to the complexity of the calculations, digitalizing the evaluation algorithm is recommended. The findings can be of interest to state and municipal authorities.

    2026ECONOMY OF REGION(2026)引用:3
    引用
    AI阅读
    加入学术空间
    2Blockchain-Assisted Secure Announcement Sharing Scheme with Controllable Verifiable Distributed Security for VANETs
    Wenjing Chen,Jie Cui,Jing Zhang,Ru Li, Yimin Wang,Irina Bolodurina,Hong Zhong

    In recent years, vehicle announcement sharing has become increasingly important in intelligent transportation networks. However, the demand for secure communication and real-time responses necessitates the development of an efficient and confidential announcement sharing scheme. Existing solutions are constrained by inadequate privacy in inter-group sharing and lack of storage security consideration. To address these issues, we propose a blockchain-assisted secure announcement sharing scheme with controllable verifiable distributed security. This scheme constructs a re-encrypted group signature framework to achieve controlled confidentiality of announcements while ensuring efficient and secure sharing. Additionally, by designing a lightweight verification algorithm powered by the Inter Planetary File System (IPFS) and blockchain, the scheme ensures rapid verifiable secure both the initial and long-term storage of announcements. Security proof and analysis show that the proposed scheme offers enhanced security and robust privacy protection. Performance analysis demonstrates that, while providing better computational efficiency than other schemes, the proposed scheme maintains low communication overhead and smaller storage verification costs, outperforming existing announcement sharing schemes.

    2026IEEE TRANSACTIONS ON MOBILE COMPUTING(2026)引用:1
    引用
    AI阅读
    加入学术空间
    3Post-quantum Secure Authenticated Key Agreement Scheme for Vehicular Digital Twin
    Jie Cui, Jiyu Liu,Lu Wei,Irina Bolodurina, Jiaxin Li,Hong Zhong

    The advent of digital twins, which leverage the server's robust data-processing and storage capacities to manage vehicular tasks, effectively addresses the limitations of traditional Internet of Vehicles (IoV). However, the communication link between a vehicle and its digital twin remains open and insecure, necessitating the development of an Authenticated Key Agreement (AKA) scheme to secure this channel. Existing AKA schemes for Vehicular Digital Twin (VDT) fail to achieve post-quantum security, and the progression of quantum computing has intensified the urgency to establish post-quantum secure solutions. To address these shortcomings, we propose a lightweight, quantum-resistant three-party AKA scheme for VDT networks based on the Ring Learning With Errors (RLWE) computational problem. Our scheme enables one-round interaction with privacy preservation while ensuring the efficiency of the AKA protocol through its RLWE-based design. Additionally, our approach mitigates the risk of temporary key reuse during Gaussian sampling, thereby resisting newly discovered key reuse attacks targeting lattice-based key agreement schemes. Security proofs and analyses prove that the proposed scheme meets the fundamental security and privacy requirements of IoV. Furthermore, performance evaluations indicate that our scheme achieves post-quantum security with low computational overhead and energy consumption, making it compatible with quantum-resistant VDT communications.

    2026IEEE TRANSACTIONS ON MOBILE COMPUTING(2026)引用:1
    引用
    AI阅读
    加入学术空间
    4Game Theory and Trust Management Driven Dynamic Proof-of-Work Blockchain Consensus Algorithm for Securing Internet of Vehicles
    Lu Wei, Yuanzhi Cao,Jie Cui,Hong Zhong,Irina Bolodurina,Debiao He

    Recently, the dynamic Proof of Work (PoW) mechanism has attracted considerable attention as a promising consensus mechanism for implementing blockchain in the Internet of Vehicles (IoV) due to its superior scalability, security, and efficiency. However, existing protocols fail to address two critical issues, i.e., how to precisely quantify the relationship between dynamic difficulty and trust value and how to assess the motivation for mining in relation to mining costs. Addressing these issues is crucial for developing a secure, efficient, and adaptable dynamic PoW mechanism. To address these issues, we propose a trust management algorithm that assesses the trustworthiness of Roadside Units (RSUs) that function as consensus or mining nodes. Based on the results of this trust evaluation, a difficulty adjustment algorithm rooted in the Principal-Agent game theory was designed to implement a dynamic PoW mechanism for IoV. This approach leads to a Nash equilibrium between vehicles and RSUs, thereby ensuring the security, efficiency, and stability of the IoV blockchain system. Simulations demonstrated that the proposed dynamic PoW consensus algorithm significantly improves consensus efficiency, enhances system security, and reduces computational costs, offering a robust solution for data sharing in IoV.

    2026IEEE TRANSACTIONS ON MOBILE COMPUTING(2026)引用:1
    引用
    AI阅读
    加入学术空间
    5Russian President's Television Address Symbolism As a Media Format in the Determinants of the First `wave' of the Coronavirus Pandemic
    Aleksander A. Yefanov, Vitaly V. Tomin

    The article records the symbolic significance of the Russian President's television address as a media format in the determinants of the first `wave' of the coronavirus pandemic (COvID-19). Seven Tv addresses, synchronously aired by all Russian federal Tv channels from March to June 2020, are studied. It is determined that the television address of the President of Russia as a media format allowed setting the agenda in the media space as a whole unity. The symbolism of the Russian President's televised address is ensured using the narrative model of paternalistic trust conversations. The effectiveness of the narrative model is manifested in the level of loyalty of citizens, first, to the President as a special political actor with symbolic significance, but it is also reflected in the level of support for program political projects.

    2026RUSSIAN POLITICS(2026)引用:1
    引用
    AI阅读
    加入学术空间
    立即登录,查看全部 3012 篇论文

    合作机构(100)

    俄罗斯科学院合作论文 147
    俄罗斯人民友谊大学合作论文 38
    Orenburg State Agrarian University合作论文 28
    喀山联邦大学合作论文 27
    安徽大学合作论文 23
    武汉大学合作论文 21
    Yaroslavl State University合作论文 20
    Bashkir State University合作论文 18
    Ufa State Petroleum Technological University合作论文 18
    Gzhel State University合作论文 17

    机构统计