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

Sick Moves! Motion Parameters as Indicators of Simulator Sickness

IEEE TRANSACTIONS ON VISUALIZATION AND COMPUTER GRAPHICS 2019年第11期25卷 3146-3157页

作者： Feigl, Tobias Roth, Daniel Gradl, Stefan Wirth, Markus Latoschik, Marc Erich Eskofier, Bjoern M. Philippsen, Michael Mutschler, Christopher Friedrich Alexander Univ Erlangen Nurnberg FAU Programming Syst Grp Erlangen Germany Univ Wurzburg JMU Human Comp Interact Grp Wurzburg Germany FAU Machine Learning & Data Analyt Lab Erlangen Germany Fraunhofer Inst Integrated Circuits IIS Nurnberg Machine Learning & Informat Fus Dept Erlangen Germany

We explore motion parameters, more specifically gait parameters, as an objective indicator to assess simulator sickness in Virtual Reality (VR). We discuss the potential relationships between simulator sickness, immersion, and presence. We used two different camera pose (position and orientation) estimation methods for the evaluation of motion tasks in a large-scale VR environment: a simple model and an optimized model that allows for a more accurate and natural mapping of human senses. Participants performed multiple motion tasks (walking, balancing, running) in three conditions: a physical reality baseline condition, a VR condition with the simple model, and a VR condition with the optimized model. We compared these conditions with regard to the resulting sickness and gait, as well as the perceived presence in the VR conditions. The subjective measures confirmed that the optimized pose estimation model reduces simulator sickness and increases the perceived presence. The results further show that both models affect the gait parameters and simulator sickness, which is why we further investigated a classification approach that deals with non-linear correlation dependencies between gait parameters and simulator sickness. We argue that our approach could be used to assess and predict simulator sickness based on human gait parameters and we provide implications for future research.

关键词： Human-centered computing virtual reality user studies computing methodologies perception machine learning

来源：评论

学校读者我要写书评

暂无评论

Effective consistency management for large-scale product data

引用

JOURNAL OF INDUSTRIAL INFORMATION INTEGRATION 2019年 13卷 13-21页

作者： Semenov, Vitaly Ilyin, Denis Morozov, Sergey Tarlapan, Oleg Russian Acad Sci Ivannikov Inst Syst Programming 25 Alexander Solzhenitsyn Str Moscow 109004 Russia Lomonosov Moscow State Univ GSP 1 Vorobiyovy Gory Moscow 119991 Russia State Univ Moscow Inst Phys & Technol 9 Inst Per Dolgoprudnyi 141700 Moscow Region Russia Natl Res Univ Higher Sch Econ 11 Myasnitskaya str Moscow 101000 Russia

The research presented is aimed to develop and investigate an effective method for management of consistency of large-scale product data. Such data are usually driven by formal models in EXPRESS language being part of the STEP standard (ISO 10303). To be consistent and unambiguously interpretable by computer programs the data must satisfy syntactic and semantic rules defined by the standards. Although ACID principles (Atomicity, Consistency, Isolation, and Durability) are widely recognized and recommended for any information system, it is hard to guarantee the consistency of such complex data. Complete semantic validation requires extremely high costs, often exceeding the processing time of individual transactions. Periodic validation or validation on user demand is possible, but at a high risk of losing data that become useless in case of rule violation. In the paper an effective incremental method for semantic validation of product data is presented. It is guaranteed that the final data revision is consistent if only the original revision was consistent and the spot rules were not violated. Static analysis of the model specifications is applied and a dependency graph is formed. The dependency graph enables to identify the spot rules and the data that should be inspected against the rules. Computational experiments prove the effectiveness of the method in conformity to complex large-scale product data managed under an innovative platform PDMhub.

关键词： Product data management Data consistency ACID EXPRESS STEP IFC

来源：评论

学校读者我要写书评

暂无评论

Effective Scheduling of Strict Periodic Task Sets with Given Permissible Periods in RTOS 1

引用

12th International Andrei P. Ershov Informatics Conference (PSI)

作者： Zelenova, Sophia A. Zelenov, Sergey, V Russian Acad Sci ISP RAS Ivannikov Inst Syst Programming 25 Alexander Solzhenitsyn St Moscow Russia Natl Res Univ Higher Sch Econ HSE 20 Myasnitskaya Ulitsa Moscow 101000 Russia

ISBN: (数字)9783030374877

ISBN: (纸本)9783030374877;9783030374860

In the paper, we suggest new approach to schedulability problem for strict periodic tasks (a periodic task is strict if it must be started in equal intervals of time - task's period). Given permissible tasks' periods, our approach allows to obtain quickly all schedulable sets of tasks with such periods and to build immediately a conflict-free schedule for each obtained set. The approach is based on mathematical methods of graph theory and number theory. We illustrate the approach by a number of examples and present current practical results.

关键词： Scheduling Real-time system Strict periodic task

来源：评论

学校读者我要写书评

暂无评论

Development of a new OpenFOAM solver using regularized gas dynamic equations

引用

COMPUTERS & FLUIDS 2018年 166卷 163-175页

作者： Kraposhin, Matvey V. Smirnova, Elena V. Elizarova, Tatiana G. Istomina, Maria A. RAS Ivannikov Inst Syst Programming Alexander Solzhenitsyn St 25 Moscow Russia RAS Keldysh Inst Appl Math Miusskaya Sq 4 Moscow Russia

The paper introduces the development of a new OpenFOAM solver QGDFoam for the numerical simulation of viscous compressible flows within a wide range of Mach numbers in the framework of the OpenFOAM formalism. The new solver is based on the implementation of regularized, or quasi-gas dynamic (QGD) equations. The mixed finite-volume and finite-difference approximation is constructed on unstructured space grids with co-located variables storage and explicit time scheme for convection approximation. The solver has been tested for a range of 1D Riemann problems and 2D cases, comparing results with analytic solutions and OpenFOAM's implementation of the Kurganov-Tadmor scheme known as rhoCentralFoam. (C) 2018 Elsevier Ltd. All rights reserved.

关键词： Quasi-gas dynamic equations Compressible flows OpenFOAM Unstructured grids RhoCentralFoam QGDFoam Riemann problem Finite volume method Computational fluid dynamics Supersonic jets

来源：评论

学校读者我要写书评

暂无评论

Comparative Analysis of Two Approaches to Static Taint Analysis

引用

programming AND COMPUTER SOFTWARE 2018年第6期44卷 459-466页

作者： Belyaev, M. V. Shimchik, N. V. Ignatyev, V. N. Belevantsev, A. A. Russian Acad Sci Ivannikov Inst Syst Programming Moscow 109004 Russia Moscow MV Lomonosov State Univ Moscow 119992 Russia

Currently, one of the most efficient ways to detect software security flaws is taint analysis. It can be based on static code analysis, and it helps detect bugs that lead to vulnerabilities, such as code injection or leaks of private data. Two approaches to the implementation of tainted data propagation over the program intermediate representation are proposed and compared. One of them is based on dataflow analysis (IFDS), and the other is based on symbolic execution. In this paper, the implementation of both approaches in the framework of the existing static analyzer infrastructure for detecting bugs in C# programs are described. These approaches are compared from the viewpoint of the scope of application, quality of results, performance, and resource requirements. Since both approaches use a common infrastructure for accessing information about the program and are implemented by the same team of developers, the results of the comparison are more significant and accurate than usual, and they can be used to select the best option in the context of the specific program and task. Our experiments show that it is possible to achieve the same completeness regardless of the chosen approach. The IFDS-based implementation has higher performance comparing with the symbolic execution for detectors with a small amount of tainted data sources. In the case of multiple detectors and a large number of sources, the scalability of the IFDS approach is worse than the scalability of the symbolic execution.

关键词： taint analysis static analysis IFDS symbolic execution

来源：评论

学校读者我要写书评

暂无评论

Security Checking Experiments with Mobile Services 19

Security Checking Experiments with Mobile Services

引用

19th International Conference of Young Specialists on Micro/Nanotechnologies and Electron Devices (EDM)

作者： Ermakov, Anton D. Prokopenko, Svetlana A. Yevtushenko, Nina, V Tomsk State Univ Tomsk Russia RAS Inst Syst Programming Moscow Russia

ISBN: (纸本)9781538650219

In this paper, we continue to investigate the problem of software security. The problem is to check if software under test has some vulnerabilities such as exceeding of admissible values of input/output parameters or internal variables or can reach states where the software (service) behavior is not defined. We illustrate by experiments that the well-known verifier Java Path Finder (JPF) can be utilized for this purpose. We apply JPF-mobile to Android applications and results of security checking experiments are presented.

关键词： JPF-mobile security checking

来源：评论

学校读者我要写书评

暂无评论

Evaluating the Complexity of Deriving Adaptive Homing, Synchronizing and Distinguishing Sequences for Nondeterministic FSMs 31st

Evaluating the Complexity of Deriving Adaptive Homing, Synch...

引用

31st IFIP WG 6.1International Conference on Testing Software and systems (ICTSS)

作者： Yevtushenko, Nina Kuliamin, Victor Kushik, Natalia Russian Acad Sci Ivannikov Inst Syst Programming 25 Alexander Solzhenitsyn St Moscow 109004 Russia Univ Paris Saclay Telecom SudParis CNRS SAMOVAR 9 Rue Charles Fourier F-91000 Evry France

ISBN: (纸本)9783030312800;9783030312794

Homing, synchronizing and distinguishing sequences (HSs, SSs, and DSs) are used in FSM (Finite State Machine) based testing for state identification and can significantly reduce the size of a returned test suite with guaranteed fault coverage. However, such preset sequences not always exist for nondeterministic FSMs and are rather long when existing. Adaptive HSs, SSs and DSs are known to exist more often and be much shorter that makes them attractive for deriving test suites and adaptive checking sequences. As nowadays, a number of specifications are represented by nondeterministic FSMs, the deeper study of such sequences, their derivation strategies, and related complexity estimations/reductions is in great demand. In this paper, we evaluate the complexity of deriving adaptive HSs and SSs for noninitialized FSMs, the complexity of deriving DSs for noninitialized merging-free FSMs.

关键词： Nondeterministic Finite State Machine (FSM) Adaptive homing sequence Adaptive synchronizing sequence Adaptive distinguishing sequence

来源：评论

学校读者我要写书评

暂无评论

Methods for Information Diffusion Analysis

引用

programming AND COMPUTER SOFTWARE 2019年第7期45卷 372-380页

作者： Avetisyan, A. A. Drobyshevskiy, M. D. Turdakov, D. Yu Ghukasyan, Tsolak Russian Acad Sci Ivannikov Inst Syst Programming Ul Solzhenitsyna 25 Moscow 109004 Russia Moscow MV Lomonosov State Univ Moscow 119991 Russia Moscow Inst Phys & Technol Inst Skii 9 Dolgoprudnyi 141701 Moscow Oblast Russia Natl Res Univ Higher Sch Econ Ul Myasnitskaya 20 Moscow 101000 Russia Russian Armenian Univ Ul Ovsepa Emina 123 Yerevan 0051 Armenia

Information diffusion is a fundamental process taking place on the Internet. Every day, various pieces of information are published and further disseminated through news articles and user messages. Even though this process can be explicitly observed, it is difficult to determine individual information pathways. The penetration of the global information environment into all spheres of everyday life radically changes the rate and ways of information diffusion. In this review, we discuss models of online information flows while dividing them into two groups: explanatory models (which imply the existence of an underlying network over which information propagates) and predictive models (which are used to investigate the spread of individual information flows). Despite the complexity of analyzing basic characteristics of information diffusion, this analysis is necessary to understand general processes that occur in the information society.

关键词： Software engineering

来源：评论

学校读者我要写书评

暂无评论

Scalable Data Storage Design for Nonstationary IoT Environment With Adaptive Security and Reliability

引用

IEEE INTERNET OF THINGS JOURNAL 2020年第10期7卷 10171-10188页

作者： Tchernykh, Andrei Babenko, Mikhail Chervyakov, Nikolay Miranda-Lopez, Vanessa Avetisyan, Arutyun Drozdov, Alexander Yu Rivera-Rodriguez, Raul Radchenko, Gleb Du, Zhihui CICESE Res Ctr Comp Sci Dept Ensenada 22860 Baja California Mexico Russian Acad Sci Inst Syst Programming Moscow 109004 Russia South Ural State Univ Dept Comp Engn Chelyabinsk 454080 Russia North Caucasus Fed Univ Dept Appl Math & Math Modeling Stavropol 355009 Russia CICESE Res Ctr Ensenada 22860 Baja California Mexico Moscow Inst Phys & Technol Lab Modeling & Designing Architectures Special Co Moscow 141701 Russia CICESE Res Ctr Dept Elect & Telecommun Ensenada 22860 Baja California Mexico Tsinghua Univ Dept Comp Sci & Technol Beijing 100084 Peoples R China

Internet-of-Things (IoT) environment has a dynamic nature with high risks of confidentiality, integrity, and availability violations. The loss of information, denial of access, information leakage, collusion, technical failures, and data security breaches are difficult to predict and anticipate in advance. These types of nonstationarity are one of the main issues in the design of the reliable IoT infrastructure capable of mitigating their consequences. It is not sufficient to propose solutions for a given scenario, but mechanisms to adapt the current solution to changes in the environment. In this article, we present a multicloud storage architecture called WA-MRC-RRNS that combines the weighted access scheme, threshold secret sharing, and redundant residue number system with multiple failure detection/recovery mechanisms and homomorphic ciphers. We provide a theoretical analysis of the probability of information loss, data redundancy, speed of encoding/decoding, and show how to dynamically configure parameters to cope with different objective preferences, workloads, and cloud properties. We propose a multiobjective optimization mechanism to adjust redundancy, encryption-decryption speed, and data loss probability. Comprehensive experimental analysis with real data shows that our approach provides a secure way to mitigate the uncertainty of the use of untrusted and not reliable IoT infrastructure.

关键词： Cloud computing Internet of Things Cryptography Software reliability Computer architecture Multicloud storage reliability residue number system resource management safety security

来源：评论

学校读者我要写书评

暂无评论

Dynamic Detection of Use-After-Free Bugs

引用

programming AND COMPUTER SOFTWARE 2019年第7期45卷 365-371页

作者： Asryan, S. A. Gaissaryan, S. S. Kurmangaleev, Sh F. Aghabalyan, A. M. Hovsepyan, N. G. Sargsyan, S. S. Russian Acad Sci Ivannikov Inst Syst Programming Moscow 109004 Russia Armenia Natl Acad Sci Inst Problems Informat & Automat Yerevan 0014 Armenia Moscow MV Lomonosov State Univ Fac Computat Math & Cybernet Moscow 119991 Russia Erevan State Univ Yerevan 0025 Armenia Moscow Inst Phys & Technol Dolgoprudnyi Moscow Oblast Russia State Univ Higher Sch Econ Moscow 101000 Russia

A novel method for detecting use-after-free bugs based on the program dynamic analysis is described. In memory unsafe programming languages, such as C or C++, this class of bugs mainly occurs when the program tries to access an area of dynamically allocated memory that has been already freed. For each program execution path, the method checks the correction of the allocation, deallocation, and access operations. Since the dynamic analysis is used, bugs can be found only in the parts of the code that was actually executed. The symbolic program execution with the help of SMT (Satisfiability Modulo Theories) solvers is used. This allows us to generate data the processing of which produces new execution paths.

关键词： C++ (programming language)

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：