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

Use of color in visual coding of information for augmented reality environments

VIRTUAL REALITY 2025年第2期29卷 1-13页

作者： Bautista, Luis Eduardo Maradei, Fernanda Vargas, Paula Andrea Galvis Moreno, Laura Marcela Univ Ind Santander Santander Colombia

Students have benefited greatly from immersive learning environments that use augmented reality. Some visual features of instructional material, such as color coding, have shown potential in improving learning performance. However, the effect in Immersive Learning Environments is still unknown in detail. The objective of this research is to know how the use of color-coded material affects the performance and mental effort of participants in Immersive Learning Environments in augmented reality. Therefore, an experimental study was executed with 29 students, in a study case for learning anatomy related to an exploratory knee arthroscopy surgical procedure, using an Immersive Learning Environment in augmented reality. The results suggested no differences in the participants' performance in terms of time and percentage of correct answers. Participants who used non-coded material, on the other hand, suggested a high level of mental effort. These results provide valuable information for the design of Immersive Learning Environments, with the purpose of creating environments under conditions that foster learning.

关键词： Augmented reality color-coding Learning environment Performance Mental effort

来源：评论

学校读者我要写书评

暂无评论

color-coding reveals tandem repeats in the Escherichia coli genome

引用

JOURNAL OF MOLECULAR BIOLOGY 2000年第3期298卷 343-349页

作者： Yoshida, T Obata, N Oosawa, K Nagoya Univ Grad Sch Math Chikusa Ku Nagoya Aichi 4648602 Japan Toagosei Co Ltd Nagoya R&D Inst Adv Mat Res Lab Minato Ku Nagoya Aichi 4550027 Japan JST ERATO Proton Nanomachine Project Soura Ku Kyoto 6190237 Japan

Genomic DNA contains a wide variety of repetitive sequences. In Escherichia coli, there have been several classes of repetitive sequences reported some of which cluster as tandem repeats. We propose a novel method for analyzing symbolic sequences by two-dimensional pattern formation with color-coding. We applied this method for searching tandem repeats in the E. coli genome and found approximately 50 repeats with periods longer than 30 bases. The longest repeat has a period of 1267 bases. (C) 2000 Academic Press.

关键词： color-coding tandem repeat sequence analysis genome periodicity

来源：评论

学校读者我要写书评

暂无评论

Parallel color-coding

引用

PARALLEL COMPUTING 2015年 47卷 51-69页

作者： Slota, George M. Madduri, Kamesh Penn State Univ Dept Comp Sci & Engn University Pk PA 16802 USA

We present new parallelization and memory-reducing strategies for the graph-theoretic color-coding approximation technique, with applications to biological network analysis. color-coding is a technique that gives fixed parameter tractable algorithms for several well-known NP-hard optimization problems. In this work, by efficiently parallelizing steps in color-coding, we create two new biological protein interaction network analysis tools: FASCIA for subgraph counting and motif finding and FASTPATH for signaling pathway detection. We demonstrate considerable speedup over prior work, and the optimizations introduced in this paper can also be used for other problems where color-coding is applicable. (C) 2015 Elsevier B.V. All rights reserved.

关键词： color-coding Parallelization Protein interaction networks Motifs Subgraph counting Pathways

来源：评论

学校读者我要写书评

暂无评论

color-coding Print Versus Digital Technology to Teach Functional Community Knowledge to Rural Students With Autism and Complex Communication Needs

引用

RURAL SPECIAL EDUCATION QUARTERLY 2021年第4期40卷 180-190页

作者： Robertson, Colleen E. Spooner, Fred Wood, Charles L. Pennington, Robert C. Colorado Coll 14 E Cache La Poudre St Colorado Springs CO 80903 USA Univ N Carolina Charlotte NC USA

Post-school outcomes in the areas of health, safety, and independent living are poor among students with complex communication needs and autism spectrum disorder, particularly for those in rural areas. This study examined the comparative effects of print versus digital technology instruction on participants' cumulative accuracy of answering Wh-(who, what, where, and when) functional community knowledge comprehension questions during print and digital technology instructional sessions, with four high school-age students with moderate to severe intellectual disabilities and autism. Using a single-case research, alternating treatments design, the researchers provided instruction to the participants through a model-lead-test procedure with shared reading, color-coded vocabulary words, and adapted stories following a Fitzgerald Key Format, using print and digital technology instructional conditions. All participants made gains across conditions. Contributions to the research literature, limitations of the study, recommendations for future research, and implications for practice are discussed.

关键词： autism complex communication needs rural special education high school students color-coding

来源：评论

学校读者我要写书评

暂无评论

Calorie disclosure and color-coding on QSR menus: A multi-method approach using eye-tracking technology, grouping and surveys

引用

INTERNATIONAL JOURNAL OF HOSPITALITY & TOURISM ADMINISTRATION 2020年第1期21卷 38-64页

作者： Schwebler, Sina A. Harrington, Robert J. Ottenbacher, Michael C. Heilbronn Univ Fak Int Business Heilbronn Germany Washington State Univ Sch Hospitality Business Management Richland WA 99354 USA Kansas State Univ Dept Hospitality Management Manhattan KS 66506 USA

Several attempts have been made to assess the efficacy of healthy menu labeling with mixed findings. Recent studies have focused mainly on traditional survey techniques;the present study focused on the effects and relationships of disclosure of calories and color-coding as well as the role of gender, hunger level, quick service restaurant (QSR) dining frequency and calorie consciousness using eye-tracking technology, surveys and qualitative results. Based on these techniques, results indicated relatively equal effects for calorie disclosure and color-coding treatments, but when calorie information was provided QSR menu selections changed to less caloric choices when participants had higher hunger levels, were less frequent QSR diners and when calorie information in menus was deemed as higher importance by participants.

关键词： Eye-tracking menu labeling calorie disclosure color-coding nutrition QSR

来源：评论

学校读者我要写书评

暂无评论

Balanced Hashing, color coding and Approximate Counting

Balanced Hashing, Color Coding and Approximate Counting

引用

4th International Workshop on Parameterized and Exact Computation

作者： Alou, Noga Gutner, Shai Tel Aviv Univ Sch Math IL-69978 Tel Aviv Israel Tel Aviv Univ Sch Comp Sci IL-69978 Tel Aviv Israel IAS Princeton NJ 08540 USA

ISBN: (纸本)9783642112683

color coding is an algorithmic technique for deciding efficiently if a given input graph contains a path of a given length (or another small subgraph of constant tree-width). Applications of the method in computational biology motivate the study of similar algorithms for counting the number of copies of a given subgraph. While it is unlikely that exact counting of this type can be performed efficiently, as the problem is #14111-complete even for paths, approximate counting is possible, imd leads to the investigation of an intriguing variant of families of perfect hash functions. A family of functions from (n] to [k] is an (c, k)-balanced family of hash functions, if there exists a positive T so that for every K c [it] of size vertical bar K vertical bar = k, the number of functions in the family that are one-to-one on K is between (1-epsilon) and (it. The family is perfectly k-balanced if it is (0,0-balanced. We show that every such perfectly k-balanced faniily is of size at least c(k)(n[k/2]), and that for every e > Imil,;(0 there are explicit constructions of (6, k)-balanced families of hash functions froin [ii] to [k] of size e1'4m k logn. This is tight up to the o(1)-term in the exponent, and supplies deterministic polynomial time algorithms for approximately counting the number of paths or cycles of a specified length k (or copies of any graph 11 with k vertices and bounded tree-width) in a given input graph of size n, up to relative error E, for all k < 0(logn).

关键词： Approximate counting of subgraphs color-coding deran-domization expanders perfect hashing k-wise independence.

来源：评论

学校读者我要写书评

暂无评论

Comparison of Haloperidol- Versus Phenazepam- Induced Anxiolytic Effect on Rodent Behavior 17th

Comparison of Haloperidol- Versus Phenazepam- Induced Anxiol...

引用

17th International Conference on Brain Informatics, BI 2024

作者： Makarov, Mark Andreev, Alexandr Apushkin, Danila Sysoev, Yuri I. Prikhodko, Veronika A. Okovityi, Sergey Korkotian, Eduard Department of Brain Sciences The Weizmann Institute of Science Rehovot7610001 Israel Department of Pharmacology and Clinical Pharmacology Saint Petersburg State Chemical and Pharmaceutical University Saint Petersburg197022 Russia Laboratory of Neuroprosthetics Institute of Translational Biomedicine Saint Petersburg State University St Petersburg199034 Russia Laboratory of Neuromodulation of Motor and Visceral Functions I.P. Pavlov Institute of Physiology of the Russian Academy of Sciences St. Petersburg199034 Russia Laboratory of Targeted Intra-Brain Drug Delivery N.P. Bechtereva Institute of the Human Brain of the Russian Academy of Sciences Saint Petersburg197376 Russia Faculty of Biology Perm State University Perm614068 Russia Faculty of Chemistry Perm State University Perm614068 Russia Department of Mental and Physical Health and Preventive Medicine University of Campania "Luigi Vanvitelli" Caserta Italy

ISBN: (纸本)9789819632930

This study investigated the effects of phenazepam and haloperidol, recognized as a tranquilizer and an antipsychotic, respectively, on anxiety using the open field test. We employed conventional behavioral assessments alongside color-tracing and color-coding methodologies to examine the comparative influences of two chosen drugs. Both compounds induced a reduction in locomotor activity, though with nuanced differences. Phenazepam’s suppressive effect manifested later, countered by increased traverses along the periphery, while haloperidol’s impact was evident earlier, accompanied by localized movements. Analysis of movement initiation revealed distinct patterns between the groups, suggesting phenazepam’s influence on cortical processes and haloperidol’s Impact on anxiety-related behavior. Despite reduced central exploration, interpretation of anxiety levels necessitates consideration of drug effects and environmental context. Our findings underscore the complexity of assessing anxiety solely based on motor activity, emphasizing the importance of incorporating emotional dimensions in clinical evaluations. This nuanced understanding is vital for optimizing therapeutic interventions in psychiatric care. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Behavior color-coding color-Tracing Haloperidol Open Field Test Phenazepam

来源：评论

学校读者我要写书评

暂无评论

Value visualization in Product Service Systems preliminary design

引用

JOURNAL OF CLEANER PRODUCTION 2013年第Aug.15期53卷 103-117页

作者： Bertoni, Alessandro Bertoni, Marco Isaksson, Ola Lulea Univ Technol Div Innovat & Design S-97187 Lulea Sweden Blekinge Inst Technol Dept Mech Engn S-37179 Karlskrona Sweden GKN Aerosp Engine Syst Sweden Trollhattan Sweden

Emerging from a study in the European aerospace industry, this paper identifies a gap in the way value-related information is communicated to designers of hardware in the preliminary stages of Product Service System (PSS) design. To fit this gap a Lifecycle Value Representation Approach, named LiVReA, that uses color-coded 3D CAD models to enable value information to be translated into visual features, is presented. Such approach aims at enhancing designers' awareness of the value contribution of an early design concept on the overall PSS offer by complementing requirements-based information with criteria reflecting the fulfillment of customers and system value. The paper details the development of the approach, its underlying rationale, the results of preliminary validation activities and the potential for industrial application in the light of the currently available PSS representation tools. (C) 2013 Elsevier Ltd. All rights reserved.

关键词： Preliminary design Product Service Systems color-coding Value visualization Decision making Lifecycle value

来源：评论

学校读者我要写书评

暂无评论

Parameterized and approximation algorithms for finding two disjoint matchings

引用

THEORETICAL COMPUTER SCIENCE 2014年第0期556卷 85-93页

作者： Chen, Zhi-Zhong Fan, Ying Wang, Lusheng Tokyo Denki Univ Div Informat Syst Design Hatoyama Saitama 3500394 Japan City Univ Hong Kong Dept Comp Sci Kowloon Hong Kong Peoples R China

We first present a randomized fixed-parameter algorithm for the NP-hard problem of deciding if there are two matchings M-1 and M-2 in a given graph G such that vertical bar M-1 vertical bar+ vertical bar M-2 vertical bar is a given number k. The algorithm runs in O (2(k)k(m + n)) expected time and can be derandomized to run in O (2(2k+12 log2 (2k)) kn (m + n) time, where n (respectively, m) is the number of vertices (respectively, edges) in G. We then extend the algorithm to the weighted version of the problem. We further present a combinatorial approximation algorithm for the NP-hard problem of finding two disjoint matchings in a given edge-weighted graph G so that their total weight is maximized. The algorithm achieves an approximation ratio close to 0.76 and runs in O(m + n(3) alpha(n)) time, where alpha is the inverse Ackermann function. (C) 2014 Elsevier B.V. All rights reserved.

关键词： Fixed-parameter algorithms Approximation algorithms color-coding Universal sets Matchings

来源：评论

学校读者我要写书评

暂无评论

Parameterized Algorithms for Disjoint Matchings in Weighted Graphs with Applications

引用

IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES 2016年第6期E99A卷 1050-1058页

作者： Chen, Zhi-Zhong Tsukiji, Tatsuie Yamada, Hiroki Tokyo Denki Univ Div Informat Syst Design Hatogaya Saitama 3500394 Japan

It is a well-known and useful problem to find a matching in a given graph G whose size is at most a given parameter k and whose weight is maximized (over all matchings of size at most k in G). In this paper, we consider two natural extensions of this problem. One is to find t disjoint matchings in a given graph G whose total size is at most a given parameter k and whose total weight is maximized, where t is a (small) constant integer. Previously, only the special case where t = 2 was known to be fixed -parameter tractable. In this paper, we show that the problem is fixed parameter tractable for any constant t. When t = 2, the time complexity of the new algorithm is significantly better than that of the previously known algorithm. The other is to find a set of vertex -disjoint paths each of length 1 or 2 in a given graph whose total length is at most a given parameter k and whose total weight is maximized. As interesting applications, we further use the algorithms to speed up several known approximation algorithms (for related NP -hard problems) whose approximation ratio depends on a fixed parameter 0 < epsilon < 1 and whose running time is dominated by the time needed for exactly solving the problems on graphs in which each connected component has at most epsilon(-1) vertices.

关键词： fixed-parameter algorithms randomized algorithms matchings color-coding universal sets

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：