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

INTERNATIONAL JOURNAL OF EMERGING TECHNOLOGIES IN LEARNING 2019年第22期14卷 154-174页

作者： Tezer, Murat Yildiz, Ezgi Pelin Masalimova, Alfiya R. Fatkhutdinova, Albina M. Zheltukhina, Marina R. Khairullina, Elmira R. Near East Univ Fac Sci & Literature Math Dept Nicosia Turkey Near East Univ Educ Fac Nicosia Turkey Kafkas Univ Kazim Karabekir Vocat Sch Tech Sci Dept Comp Programming Kars Turkey Fed Univ Kazan Russia Financial Univ Govt Russian Federat Dept Legal Regulat Econ Act 49 Lenin Gradsky Prospect Moscow 125993 Russia Volgograd State Sociopedag Univ Philol 27 Lenin Ave Volgograd 400066 Russia Volgograd State Sociopedag Univ Dept English Philol 27 Lenin Ave Volgograd 400066 Russia Kazan Natl Res Technol Univ Educ 68 Karl Marks St Kazan 420015 Russia Kazan Natl Res Technol Univ 68 Karl Marks St Kazan 420015 Russia Kazan Natl Res Technol Univ Fac Design & Software Engn 68 Karl Marks St Kazan 420015 Russia

Our aim in this research was to analyze studies in the area of Augmented Reality applications and research throughout the world using meta-analysis methods in order to determine trends in the area. For the purpose of the study, a total of 1008 pieces of research, published between 2001 and 2019 and selected by purposeful sampling method were analyzed. Trends of Augmented Reality applications and research throughout the world were examined under 13 criteria. These criteria were;index, year of publication, number of authors, country of research, area of research, method, education grade, sample group, sample number, data collection method, bibliography number, analysis techniques, purpose of research, and research trends. These data were interpreted based on percentage and frequency. In Augmented Reality, technologies are integrated in many fields such as education technology, engineering arts, visual arts education and special education.

关键词： Augmented Reality Applications Augmented Reality in Education Meta-Analysis Publication Classification

来源：评论

学校读者我要写书评

暂无评论

A hybrid heuristic for restricted 4-dimensional TSP (r-4DTSP) 1st

A hybrid heuristic for restricted 4-dimensional TSP (r-4DTSP...

引用

1st International Conference on Frontiers in Optimization: Theory and Applications, FOTA 2016

作者： Roy, Arindam Chakraborty, Goutam Khan, Indadul Maity, Samir Maiti, Manoranjan Department of Computer Science Prabhat Kumar College Contai Purba MedinipurW.B721401 India Faculty of Software and Information Science Iwate Prefectural University Takizawa Japan Department of Computer Science Vidyasagar University MedinipurW.B721102 India Department of Applied Mathematics with Oceanology and Computer Programming Vidyasagar University MedinipurW.B721102 India

ISBN: (纸本)9789811078132

In this paper, we proposed a hybridized soft computing technique to solve a restricted 4-dimensional TSP (r-4DTSP) where different paths with various numbers of conveyances are available to travel between two cities. Here, some restrictions on paths and conveyances are imposed. The algorithm is a hybridization of genetic algorithm (GA) and swap operator-based particle swarm optimization (PSO). The initial solutions are produced by proposed GA which used as swarm in PSO. The said hybrid algorithm (GA-PSO) is tested against some test functions, and efficiency of the proposed algorithm is established. The r-4DTSPs are considered with crisp costs. The models are illustrated with some numerical data. © 2018, Springer Nature Singapore Pte Ltd.

关键词： Genetic algorithms

来源：评论

学校读者我要写书评

暂无评论

ClonoCalc and ClonoPlot: immune repertoire analysis from raw files to publication figures with graphical user interface

引用

BMC BIOINFORMATICS 2017年第1期18卷 1-6页

作者： Faehnrich, Anke Krebbel, Moritz Decker, Normann Leucker, Martin Lange, Felix D. Kalies, Kathrin Moeller, Steffen Inst Anat Ratzeburger Allee 160 D-23562 Lubeck Germany Inst Software Engn & Programming Languages Ratzeburger Allee 160 D-23562 Lubeck Germany Inst Biostat & Informat Med & Ageing Res Ernst Heydemann Str 8 D-18057 Rostock Germany

Background: Next generation sequencing (NGS) technologies enable studies and analyses of the diversity of both T and B cell receptors (TCR and BCR) in human and animal systems to elucidate immune functions in health and disease. Over the last few years, several algorithms and tools have been developed to support respective analyses of raw sequencing data of the immune repertoire. These tools focus on distinct aspects of the data processing and require a strong bioinformatics background. To facilitate the analysis of T and B cell repertoires by less experienced users, software is needed that combines the most common tools for repertoire analysis. Results: We introduce a graphical user interface (GUI) providing a complete analysis pipeline for processing raw NGS data for human and animal TCR and BCR clonotype determination and advanced differential repertoire studies. It provides two applications. ClonoCalc prepares the raw data for downstream analyses. It combines a demultiplexer for barcode splitting and employs MiXCR for paired- end read merging and the extraction of human and animal TCR/BCR sequences. ClonoPlot wraps the R package tcR and further contributes self-developed plots for the descriptive comparative investigation of immune repertoires. Conclusion: This workflow reduces the amount of programming required to perform the respective analyses and supports both communication and training between scientists and technicians, and across scientific disciplines. The Open Source development in Java and R is modular and invites advanced users to extend its functionality. software and documentation are freely available at https://***/ClonoSuite/clonocalc-plot.

关键词： Next-generation sequencing Immune repertoire analysis Graphical user interface

来源：评论

学校读者我要写书评

暂无评论

Co-evolution of Meta-Modeling Syntax and Informal Semantics in Domain-Specific Modeling Environments - A Case Study of AUTOSAR 17

Co-evolution of Meta-Modeling Syntax and Informal Semantics ...

引用

ACM/IEEE 20th International Conference on Model Driven Engineering Languages and Systems (MODELS)

作者： Durisic, Darko Motta, Corrado Staron, Miroslaw Tichy, Matthias Volvo Car Grp Dept Elect Syst Design Gothenburg Sweden Univ Gothenburg Dept Comp Sci & Engn Gothenburg Sweden Ulm Univ Inst Software Engn & Programming Languages Ulm Germany

ISBN: (纸本)9781538634929

One domain-specific modeling environment is centered around a domain-specific meta-model which defines syntax (modeling elements, e.g., classes) for the domain models. However, in order for the system designers to be able to construct meaningful models, semantics of the domain-specific meta-model needs to be described as well. This semantics is often provided in a form of informal natural language specifications that contain a set of design requirements, each describing the intended use of one or more modeling elements. Intuitively, introduction of new concepts into the modeling environment is expected to require changes in both meta-modeling syntax and informal semantics in such a way that their co-evolution is highly correlated. In order to test this hypothesis, we analyzed the relation between added classes, attributes, and connectors, as meta-modeling syntax, and modified/ added design requirements, as meta-modeling semantics, in a case study of the AUTOSAR meta-modeling environment. We found that new AUTOSAR concepts usually require both new modeling elements and new design requirements, but surprisingly adding more elements is not always followed by more requirements. This finding is also validated by the moderately strong correlation between the evolution of these two AUTOSAR metamodeling artifacts (Spearman's. 0,63 and Kendall's t 0,49). For system designers, this means that both meta-modeling syntax and informal semantics is important to be considered in the analysis of domain-specific meta-model evolution, but it may not be enough for understanding the use of all modeling elements. For designers responsible for the maintenance of domain-specific meta-models, this means that more effort shall be put into describing the semantics of all introduced modeling elements.

关键词： Syntactics Semantics Metamodeling Unified modeling language Analytical models Connectors Correlation Metamodeling Semantics Design Requirements Connector Device Component UML semiotics ANALYSIS MODELS syntax Coevolution meta-models Modeling Informal Instruction repertory

来源：评论

学校读者我要写书评

暂无评论

Monitoring modulo theories

引用

INTERNATIONAL JOURNAL ON software TOOLS FOR TECHNOLOGY TRANSFER 2016年第2期18卷 205-225页

作者： Decker, Normann Leucker, Martin Thoma, Daniel Med Univ Lubeck Inst Software Engn & Programming Languages D-23538 Lubeck Germany

This paper considers a generic approach to run-time verification of temporal properties over first-order theories. This allows especially for the verification of multi-threaded, object-oriented systems. It presents a general framework lifting monitor synthesis procedures for propositional temporal logics to a temporal logic over structures within some first-order theory. To evaluate such specifications SMT solving and classical monitoring of propositional temporal properties are combined. The monitoring procedure was implemented for linear-time temporal logic based on the Z3 SMT solver and evaluated regarding runtime performance.

关键词： Runtime verification Monitoring SMT Monitor synthesis First-order temporal logic

来源：评论

学校读者我要写书评

暂无评论

A Heuristic Search Algorithm Using the Stability of Learning Algorithms in Certain Scenarios as the Fitness Function: An Artificial General Intelligence Engineering Approach

arXiv

引用

arXiv 2017年

作者： Li, Zengkun Huawei 2012 Lab Central Software Institute Compiler and Programming Language Lab

This paper presents a non-manual design engineering method based on heuristic search algorithm to search for candidate agents in the solution space which formed by artificial intelligence agents modeled on the base of bionics. Compared with the artificial design method represented by meta-learning and the bionics method represented by the neural architecture chip, this method is more feasible for realizing artificial general intelligence, and it has a much better interaction with cognitive neuroscience;at the same time, the engineering method is based on the theoretical hypothesis that the final learning algorithm is stable in certain scenarios, and has generalization ability in various scenarios. The paper discusses the theory preliminarily and proposes the possible correlation between the theory and the fixed-point theorem in the field of mathematics. Limited by the author’s knowledge level, this correlation is proposed only as a kind of conjecture. Copyright © 2017, The Authors. All rights reserved.

关键词： Heuristic algorithms

来源：评论

学校读者我要写书评

暂无评论

A decidable confluence test for cognitive models in ACT-R

arXiv

引用

arXiv 2017年

作者： Gall, Daniel Frühwirth, Thom Institute of Software Engineering and Programming Languages Ulm University Ulm89069 Germany

Computational cognitive modeling investigates human cognition by building detailed computational models for cognitive processes. Adaptive Control of Thought – Rational (ACT-R) is a rule-based cognitive architecture that offers a widely employed framework to build such models. There is a sound and complete embedding of ACT-R in Constraint Handling Rules (CHR). Therefore analysis techniques from CHR can be used to reason about computational properties of ACT-R models. For example, confluence is the property that a program yields the same result for the same input regardless of the rules that are applied. In ACT-R models, there are often cognitive processes that should always yield the same result while others e.g. implement strategies to solve a problem that could yield different results. In this paper, a decidable confluence criterion for ACT-R is presented. It allows to identify ACT-R rules that are not confluent. Thereby, the modeler can check if his model has the desired behavior. The sound and complete translation of ACT-R to CHR from prior work is used to come up with a suitable invariant-based confluence criterion from the CHR literature. Proper invariants for translated ACT-R models are identified and proven to be decidable. The presented method coincides with confluence of the original ACT-R models. Copyright © 2017, The Authors. All rights reserved.

关键词： Computability and decidability

来源：评论

学校读者我要写书评

暂无评论

System-Wide Elimination of Unreferenced Code and Data in Dynamically Linked Programs

System-Wide Elimination of Unreferenced Code and Data in Dyn...

引用

Ivannikov ISPRAS Open Conference (ISPRAS)

作者： Vladislav Ivanishin Evgeny Kudryashov Alexander Monakov Dmitry Melnik Jehyung Lee Ivannikov Institute for System Programming of Russian Academy of Sciences Samsung Electronics Software Center

Embedded devices may be significantly constrained in main memory, storage and CPU loads they can accommodate. The smaller the program, the faster it is loaded into memory. The smaller the system image, the cheaper can be production of the device. There are two ways to approach system image minification. The first way is to carefully write software adding no unnecessary parts from the start. The second way is to use existing software with unnecessary parts removed. In this work we implement the latter approach. Our work is concerned with eliminating unused code and data from dynamically linked programs; for statically linked programs, simple linker analysis is sufficient and has already been implemented.

关键词： Libraries software Optimization Ground penetrating radar Geophysical measurement techniques Manuals Electronic mail

来源：评论

学校读者我要写书评

暂无评论

Highlights in systems verification

引用

Queue 2017年第4期15卷

作者： Kwon, Albert Wilcox, James EECS Department MIT United States University of Washington Programming Languages and Software Engineering Lab United States

来源：评论

学校读者我要写书评

暂无评论

On Combinations of Static and Dynamic Analysis - Panel Introduction 7th

On Combinations of Static and Dynamic Analysis - Panel Intro...

引用

7th International Symposium on Leveraging Applications of Formal Methods, Verification and Validation (ISoLA)

作者： Leucker, Martin Univ Lubeck Inst Software Engn & Programming Languages Lubeck Germany

ISBN: (纸本)9783319471662;9783319471655

Model checking [1] deals with the problem of deciding whether all runs of a system under scrutiny satisfy a given specification. As typically infinite runs of the system are of interest, a dynamic analysis of complete runs is not possible. Hence, model checking is necessarily a static analysis technique. Runtime verification [2] on the other hand concentrates on prefixes of runs of the system as it typically considers the actual, necessarily finite run of the system. So while both model checking and runtime verification focus on runs of the system under scrutiny they have a different focus and are applied on a different level of abstraction. In this presentation we elaborate on the similarities and differences of model checking and runtime verification, yet, we mainly introduce question but questions to be studied in the future. We recall the work pointed out in [3] putting runtime verification and (LTL-based) model checking into the same formal framework.

关键词： Model checking

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：