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

2019 International Multidisciplinary Information Technology and Engineering Conference, IMITEC 2019

作者： Abbott, Simon G Ade-Ibijola, Abejide Formal Structures Algorithms and Industrial Applications Research Cluster School of Consumer Intelligence and Information Systems University of Johannesburg Department of Applied Information Systems South Africa

ISBN: (纸本)9781728100401

The use of medical surveillance and predictive analysis is now more readily available through the intelligent use of modern technology with the use of software tools. Google Trends (GT) is an internet research tool initially utilised for the surveillance of the occurrence of influenza (Flu) internet search trends. Within the last 20 years the internet has become integral to health surveillance by reducing the time to the actual recognition of a disease outbreak, or the detection of a disease trend. GT primarily focused on detecting an outbreak of various strains of the Flu infecting different regions, sporadically or endemically, by monitoring the internet user seeking such medical information. It is currently utilised as an adjunct to the traditional surveillance tools used in traditional modern medicine. In this paper we have attempted to apply such search criteria using GT within a typical healthcare scenario or disease trend. We focused on the most common diseases found within the South African healthcare environment and presented the results accordingly. The results were found to be aligned to the results of traditional medical surveillance tools. The GT results presented in this paper may have similar applications in other areas of medicine and disease monitoring efforts in South Africa whereby the general population can derive meaningful insights of such disease trends. In addition there is a distinct awareness of this research tool, where many users are utilising the tool for healthcare searches which is becoming more evident in the medical literature. © 2019 IEEE.

关键词： Search engines

来源：评论

学校读者我要写书评

暂无评论

Subject-Oriented operating system development based on System Predicate Classes

Subject-Oriented operating system development based on Syste...

引用

10th Symposium on Programming Languages and Software Tools, SPLST 2007

作者： Balogh, Ádám Csörnyei, Zoltán Department of Algorithms and their Applications Eötvös Loránd University Budapest Hungary Department of Programming Languages and Compilers Eötvös Loránd University Budapest Hungary

ISBN: (纸本)9789634639251

Portable and scalable operating systems must satisfy very different needs on very different hardware architectures. Therefore they consist of several modules implementing different functionalities, and the actual system is composed of a set of these modules. The modules may be very different, e.g. device drivers, security subsystems or user interfaces, but they work in the same computer system using the same hardware and software resources, so they must conform to predefined interfaces to cooperate with each other. However, these interfaces are usually defined to be very restrictive to avoid enormous complexity of the operating system. In this paper we describe a new approach for operating system design that allows modules to be connected through less restrictive interfaces without increasing the complexity of the system. Our suggested solution is the application of the Subject-Oriented, Programming [10] where different modules are considered as subjects which work with hardware and software resources as objects. Objects are instances of System Predicate Classes, our new technology for using object-oriented language elements in system programming. We also suggest various techniques for implementation without performance degradation.

关键词： Object oriented programming

来源：评论

学校读者我要写书评

暂无评论

A Metric for Estimating the Difficulty of Programming Problems by Ranking the Constructs in their Solutions

A Metric for Estimating the Difficulty of Programming Proble...

引用

2019 International Multidisciplinary Information Technology and Engineering Conference, IMITEC 2019

作者： Kalemba, Elsa Ade-Ibijola, Abejide Formal Structures Algorithms and Industrial Applications Research Cluster School of Consumer Intelligence and Information Systems University of Johannesburg Department of Applied Information Systems Johannesburg South Africa

ISBN: (纸本)9781728100401

Several studies have been conducted on the complexity of computer programs. Metrics of quantifying computer programs based on programming language, lines of code, or number of modules have been studied. One open problem is: how to measure the complexity of computer programming problems, based on the constructs in their solutions. In this paper, we present a tool called NOPCE (The NOvice Program Complexity Estimator) that measures the complexity of programming problems based on the constructs they contain. NOPCE takes any given novice program written in C# and computes an aggregated weight based on a look-up table of predefined weights for programming constructs. We have presented an evaluation that compares the human perception of problem complexity with that of NOPCE. Results show that, humans agreed with NOPCE on problem ranking, most of the time. This tool may find applications in computer education, where difficulty balancing of programming problems is paramount. © 2019 IEEE.

关键词： Table lookup

来源：评论

学校读者我要写书评

暂无评论

3D trajectory registration for sensor calibration 26

3D trajectory registration for sensor calibration

引用

26th Computer Vision Winter Workshop, CVWW 2023

作者： Tóth, Tekla Valasek, Gábor Hajder, Levente Department of Algorithms and Their Applications Eötvös Loránd University Pázmány Péter s. 1/C Budapest1117 Hungary

Automatic sensor calibration is ubiquitous for robots and autonomous vehicles. Traditional target-based calibration methods typically require multiple registrations of an object in the field of view. However, by moving the object continuously while recording, the 3D positions of the target generate a path that may improve the calibration quality. In this work, we propose a novel curve-based trajectory registration method to enhance calibration accuracy with spherical and checkerboard targets. This approach supplements the existing target position point set with estimated intermediate points after applying spline fitting techniques to the measurements. The curvature of the movement is aligned between the point sets resulting in reduced error between the registered point clouds and more accurate extrinsic calibration parameters. We validate these properties in indoor and outdoor real-world scenarios. © 2023 Copyright for this paper by its authors.

关键词： Calibration

来源：评论

学校读者我要写书评

暂无评论

Lecturer's Apprentice: A Chatbot for Assisting Novice Programmers

Lecturer's Apprentice: A Chatbot for Assisting Novice Progra...

引用

2019 International Multidisciplinary Information Technology and Engineering Conference, IMITEC 2019

作者： Ismail, Mohammed Ade-Ibijola, Abejide Formal Structures Algorithms and Industrial Applications Research Cluster School of Consumer Intelligence and Information Systems University of Johannesburg Department of Applied Information Systems Johannesburg South Africa

ISBN: (纸本)9781728100401

Students often struggle to communicate with their peers or lecturers about some of the issues they face during their time at university, either it be academic or personal. One of these issues is introductory programming, in instances were they choose to memorise code in order to pass rather than understanding how the logic behind the code actually works. Programming requires an understanding of how a certain logical flows and algorithm work. In this article, we discuss the difficulties that students face in introductory programming. We have also developed an interactive AI chatbot tool that students can interact with on some of the academic issues they may face. They can ask for advice on how to understand algorithms and what measures to take in order to understand programming logic and visualise metal models of the algorithms. The chatbot can also be used for personal advice. A survey that was conducted showed that there is a need for such a tool in aiding students through their university life. © 2019 IEEE.

关键词： Students

来源：评论

学校读者我要写书评

暂无评论

Affine transformation from fundamental matrix and two directions 15

Affine transformation from fundamental matrix and two direct...

引用

15th International Joint Conference on Computer Vision, Imaging and Computer Graphics Theory and applications, VISIGRAPP 2020

作者： Le Minh, Nghia Hajder, Levente Department of Algorithms and Their Applications Eötvös Loránd University Pázmány Péter stny. 1/C BudapestH-1117 Hungary

ISBN: (纸本)9789897584022

Researchers have recently shown that affine transformations between corresponding patches of two images can be applied for 3D reconstruction, including the reconstruction of surface normals. However, the accurate estimation of affine transformations between image patches is very challenging. This paper mainly proposes a novel method to estimate affine transformations from two directions if epipolar geometry of the image pair is known. A reconstruction pipeline is also proposed here in short. As side effects, two proofs are also given. The first one is to determine the relationship between affine transformations and the fundamental matrix, the second one shows how optimal surface normal estimation can be obtained via the roots of a cubic polynomial. A visual debugger is also proposed to validate the estimated surface normals in real images. Copyright © 2020 by SCITEPRESS – Science and Technology Publications, Lda. All rights reserved.

关键词： Linear transformations

来源：评论

学校读者我要写书评

暂无评论

On the power of permitting features in cooperating context-free array grammar systems

On the power of permitting features in cooperating context-f...

引用

作者： Subramanian, K.G. Venkat, Ibrahim Csuhaj-Varjú, Erzsébet School of Computer Sciences Universiti Sains Malaysia 11800 Penang Malaysia Department of Algorithms and Applications Faculty of Informatics Eötvös Loránd University Budapest Hungary

Among many grammar models for picture description, cooperating context-free distributed array grammar systems utilize the mechanism of cooperation between component array grammars. Here, we endow these grammar systems with the feature of permitting symbols, and examine the generative capacity of the resulting permitting cooperating context-free distributed array grammar systems with certain other kinds of isometric and non-isometric array grammars. An advantage is that the number of components is reduced when this permitting feature is used in a cooperating context-free distributed array grammar system. © 2012 Elsevier B.V. All rights reserved.

关键词： Computational methods

来源：评论

学校读者我要写书评

暂无评论

Pose-graph via Adaptive Image Re-ordering 33

Pose-graph via Adaptive Image Re-ordering

引用

33rd British Machine Vision Conference Proceedings, BMVC 2022

作者： Barath, Daniel Noskova, Jana Eichhardt, Ivan Matas, Jiri Computer Vision and Geometry Group ETH Zurich Switzerland Visual Recognition Group FEE CTU in Prague Czech Republic Algorithms and Applications Department Eotvos Lorand University Budapest Hungary

We introduce novel methods that speed up the pose-graph generation for global Structure-from-Motion algorithms. We replace the widely used "accept-or-reject" strategy for image pairs, where often thousands of RANSAC iterations are wasted on pairs with low inlier ratio or on non-matchable ones. The new algorithm exploits the fact that every unsuccessful RANSAC iteration reduces the probability of an image pair being matchable, i.e., it reduces its inlier ratio expectation. The method always selects the most promising pair for matching. While running RANSAC on the pair, it updates the distribution of its inlier ratio probability in a principled way via a Bayesian approach. Once the expected inlier ratio drops below an adaptive threshold, the method puts back the pair in the processing queue ordered by the updated inlier ratio expectations. The algorithms are tested on more than 600k real image pairs. They accelerate the pose-graph generation by an order-of-magnitude on average. The source code is available at https://***/danini/pose-graph-creation. © 2022. The copyright of this document resides with its authors.

关键词： Iterative methods

来源：评论

学校读者我要写书评

暂无评论

Self-Healing of Trotter Error in Digital Adiabatic State Preparation

引用

Physical Review Letters 2023年第6期131卷 060602-060602页

作者： Lucas K. Kovalsky Fernando A. Calderon-Vargas Matthew D. Grace Alicia B. Magann James B. Larsen Andrew D. Baczewski Mohan Sarovar Quantum Algorithms and Applications Collaboratory Sandia National Laboratories Livermore California 94550 USA Quantum Algorithms and Applications Collaboratory Sandia National Laboratories Albuquerque New Mexico 87185 USA Department of Mathematics Brigham Young University Provo Utah 84602 USA

Adiabatic time evolution can be used to prepare a complicated quantum many-body state from one that is easier to synthesize and Trotterization can be used to implement such an evolution digitally. The complex interplay between nonadiabaticity and digitization influences the infidelity of this process. We prove that the first-order Trotterization of a complete adiabatic evolution has a cumulative infidelity that scales as O(T−2δt2) instead of O(T2δt2) expected from general Trotter error bounds, where δt is the time step and T is the total time. This result suggests a self-healing mechanism and explains why, despite increasing T, infidelities for fixed-δt digitized evolutions still decrease for a wide variety of Hamiltonians. It also establishes a correspondence between the quantum approximate optimization algorithm and digitized quantum annealing.

关键词： Adiabatic quantum optimization Quantum algorithms Quantum computation Quantum simulation

来源：评论

学校读者我要写书评

暂无评论

On tree-restricted regular-controlled context-free grammars

引用

International Journal of Computer Mathematics: Computer Systems Theory 2017年第4期2卷 147-163页

作者： Meduna, A. Soukup, O. Csuhaj-Varjú, E. Brno University of Technology Faculty of Information Technology IT4Innovations Centre of Excellence Brno Czech Republic Department of Algorithms And Their Applications Faculty of Informatics Eötvös Loránd University Budapest Hungary

This paper gives simple tree-based conditions under which regular-controlled context-free grammars generate context-free languages of finite index, so they cannot even generate all context-free languages. It defines the notion of path-changing derivation step which corresponds to performing two consecutive rewritings of nonterminal symbols present in the different branches of the derivation tree. It proves that if there exists a certain constant that limits the number of path-changing derivation steps, then, the regular-controlled grammar generates a context-free language of finite index. At the end, we generalize achieved result and provide some open problems for future study. © 2017, © 2017 Informa UK Limited, trading as Taylor & Francis Group.

关键词： context-freeness of finite index Regular-controlled context-free grammars restricted derivation trees

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：