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

Realistic details in visualizations require color cues to foster retention

COMPUTERS & EDUCATION 2018年第Jul.期122卷 23-31页

作者： Skulmowski, Alexander Rey, Guenter Daniel Tech Univ Chemnitz Psychol Learning Digital Media Str Nationen 12 D-09111 Chemnitz Germany

Research on visualizations suggests that realism can be distracting and cognitively demanding, thereby lowering learning performance. These results have been explained using cognitive load theory, assuming that realistic details act as unnecessary mental load. Recent findings from disfluency research, however, imply that under certain circumstances harder-to-perceive learning materials are able to keep learners' attention focused and trigger them to invest more effort. We contrasted these conflicting results by assessing the role of realistic details on learning. For the study, we generated a fictional bone model and varied the level of arbitrary detail (low vs. high). As previous research has revealed positive effects of color coding on visual attention, we used color coding as a second experimental factor (with vs. without) and hypothesized that color coding will primarily help participants learning with a detailed model. We conducted a 2 x 2 factorial between-subjects study (n = 108) and found an interaction between the level of detail and color coding: Highly detailed renderings result in a high retention performance when color coding is available, while color coding on a low-detail model even lowered retention scores. These findings suggest that realistic visualizations require appropriate visual aids in order to be effective.

关键词： Visualizations Realism Disfluency Cognitive load color coding

来源：评论

学校读者我要写书评

暂无评论

The Complexity of Finding Fair Many-to-One Matchings

引用

ACM TRANSACTIONS ON ALGORITHMS 2024年第2期20卷 1-37页

作者： Boehmer, Niclas Koana, Tomohiro Tech Univ Berlin Str 17 Juni 135 D-10623 Berlin Germany

We analyze the (parameterized) computational complexity of "fair" variants of bipartite many-to-one matching, where each vertex from the "left" side is matched to exactly one vertex and each vertex from the "right" side may be matched to multiple vertices. We want to find a "fair" matching, in which each vertex from the right side is matched to a "fair" set of vertices. Assuming that each vertex from the left side has one color modeling its "attribute", we study two fairness criteria. For instance, in one of them, we deem a vertex set fair if for any two colors, the difference between the numbers of their occurrences does not exceed a given threshold. Fairness is, for instance, relevant when finding many-to-one matchings between students and colleges, voters and constituencies, and applicants and firms. Here colors may model sociodemographic attributes, party memberships, and qualifications, respectively. We show that finding a fair many-to-one matching is NP-hard even for three colors and maximum degree five. Our main contribution is the design of fixed-parameter tractable algorithms with respect to the number of vertices on the right side. Our algorithms make use of a variety of techniques including color coding. At the core lie integer linear programs encoding Hall like conditions. We establish the correctness of our integer programs, based on Frank's separation theorem [Frank, Discrete Math. 1982]. We further obtain complete complexity dichotomies regarding the number of colors and the maximum degree of each side.

关键词： Graph theory polynomial-time algorithms NP-hardness FPT ILP color coding submodular and supermodular functions algorithmic fairness

来源：评论

学校读者我要写书评

暂无评论

cXR plus Voxel-Based Semantic Compression for Networked Immersion

引用

IEEE ACCESS 2023年 11卷 52763-52777页

作者： Rezwan, Sifat Wu, Huanzhuo Cabrera, Juan A. Nguyen, Giang T. Reisslein, Martin Fitzek, Frank H. P. Tech Univ Dresden TU Dresden Deutsch Telekom Chair Commun Networks D-01062 Dresden Germany Nokia D-81541 Munich Germany Tech Univ Dresden TU Dresden Hapt Commun Syst D-01062 Dresden Germany Arizona State Univ Sch Elect Comp & Energy Engn Tempe AZ 85287 USA Tech Univ Dresden Ctr Tactile Internet Human Loop CeTI D-01062 Dresden Germany

Extended Reality (XR) applications, which may encompass Augmented Reality (AR) and Virtual Reality (VR), commonly involve immersive virtual environments that are based on real physical environments. Transmitting the extensive color and depth image data for representing a physical environment over a communication network to create a corresponding immersive environment at a remote location is very challenging due to the enormous data volumes and the time constraints of real-time immersion. We explore semantic compression, which conveys the semantic meaning of the data through color-codes (CCs) to reduce the transmitted data volume. The creation of an immersive environment conventionally involves five steps (with corresponding output): calibration (single-frame point cloud), registration (registered point cloud), volume reconstruction (voxel frame), marching cubes (meshes), and rendering (3D environment). We develop the novel cXR+ semantic compression that splits the volume reconstruction into a client-side virtual network function (VNF) that represents the registered point cloud as CCs for network transmission to a server-side VNF that decodes the CCs to obtain the voxel frames so as to complete the volume reconstruction. We consider an analogous splitting of the calibration into two VNFs with Graph coloring (GC) compression of the color and depth image data as a comparison benchmark. Additionally, we consider the transmission of the raw and JPG compressed point cloud data as well as the volume reconstruction at the client-side and subsequent transmission of the voxel frames as benchmarks. We conduct measurements of the compression (computing) time, transmission time, compression ratio, and reconstruction accuracy for real-world data sets so as to elucidate the trade-offs in employing voxel-based semantic compression for transmitting immersive environments over communication networks.

关键词： Semantics Point cloud compression Three-dimensional displays Image color analysis Image coding Image reconstruction Servers Extended reality color coding communication network functional compression semantic compression virtual reality volumetric semantic compression voxel

来源：评论

学校读者我要写书评

暂无评论

Faster algorithms for k-subset sum and variations

引用

JOURNAL OF COMBINATORIAL OPTIMIZATION 2023年第1期45卷 1-21页

作者： Antonopoulos, Antonis Pagourtzis, Aris Petsalakis, Stavros Vasilakis, Manolis Natl Tech Univ Athens Sch Elect & Comp Engn Athens 15780 Greece

We present new, faster pseudopolynomial time algorithms for the k-SUBSET SUM problem, defined as follows: given a set Z of n positive integers and k targets t(1), ... , t(k), determine whether there exist k disjoint subsets Z(1), ... , Z(k) subset of Z, such that E(Z(i)) = t(i), for i = 1, ... , k. Assuming t = max{t(1), ... , t(k)} is the maximum among the given targets, a standard dynamic programming approach based on Bellman's algorithm can solve the problem in O(nt(k)) time. We build upon recent advances on SUBSET SUM due to Koiliaris and Xu, as well as Bringmann, in order to provide faster algorithms for k-SUBSET SUM. We devise two algorithms: a deterministic one of time complexity (SIC)(n(k/(k+1))t(k)) and a randomised one of (SIC)(n + t(k)) complexity. Additionally, we show how these algorithms can be modified in order to incorporate cardinality constraints enforced on the solution subsets. We further demonstrate how these algorithms can be used in order to cope with variations of k-SUBSET SUM, namely SUBSET SUM RATIO, k-SUBSET SUM RATIO and MULTIPLE SUBSET SUM.

关键词： color coding FFT k-Subset Sum Multiple Knapsack Multiple Subset Sum Pseudopolynomial algorithms Subset Sum

来源：评论

学校读者我要写书评

暂无评论

Fringe projection profilometry based on complementary color-encoded fringe patterns

引用

OPTICS AND LASER TECHNOLOGY 2012年第8期44卷 2332-2339页

作者： Da, Feipeng Wang, Luyang Hu, Luyao Southeast Univ Sch Automat Nanjing 210096 Jiangsu Peoples R China

3D measurement techniques based on color-encoded fringe pattern projection have been widely used in various fields of engineering recently. There is one problem that the surface color of measured object may interfere with the color of projected fringe pattern. To solve this problem, a novel method based on complementary color-encoded fringe projection is proposed. Two color-encoded fringe patterns whose fringe colors are complementary are designed. The first pattern is with the sinusoidal fringe embedding into the green color channel which is used to evaluate phases by Fourier transform method. The fringe color of the captured image is established with the help of the complementary color fringe pattern, which is based on the feature of color complementation. Thus, the influence brought by the color of object surface can be eliminated, and decoding errors can be further reduced. Experiment results indicate that the proposed method is valid and can be applied to the measured colorful objects. (c) 2012 Elsevier Ltd. All rights reserved.

关键词： Optical inspection Phase unwrapping color coding

来源：评论

学校读者我要写书评

暂无评论

Fast microscopic method for large scale determination of structure, morphology, and quality of thin colloidal crystals

引用

LANGMUIR 2006年第4期22卷 1828-1838页

作者： Schöpe, HJ Fontecha, AB König, H Marques-Hueso, J Biehl, R Johannes Gutenberg Univ Mainz Inst Phys D-55099 Mainz Germany

We present a novel fast microscopic method to analyze the crystal structures of air-dried or suspended colloidal multilayer systems. Once typical lattice spacings of such films are in the range of visible light, characteristic Bragg scattering patterns are observed. If in microscopic observations these are excluded from image construction, a unique color coding for regions of different structures, morphologies, and layer numbers results. Incoherently scattering defect structures, however, may not be excluded from image construction and thus remain visible with high resolution.

关键词： .colloidal crystals Large Scale Bragg scattering small scale color coding regions of different Fast Microscopic Method image construction layer numbers

来源：评论

学校读者我要写书评

暂无评论

Teaching Series and Parallel Connections

引用

IEEE TRANSACTIONS ON EDUCATION 2022年第3期65卷 461-470页

作者： Skromme, B. J. Wong, M. L. Redshaw, C. J. O'Donnell, M. A. Arizona State Univ Sch Elect Comp & Energy Engn Tempe AZ 85287 USA Arizona State Univ Coll Res & Evaluat Serv Team Tempe AZ 85287 USA

Contribution: A new operational definition of series connections is given based on elements belonging to the same two meshes, which is properly dual to the usual definition of parallel elements being connected to the same two nodes. Furthermore, computer-based exercises have been developed and tested to teach students about such connections in gateway linear circuits courses, using color coding of nodes and meshes as a pedagogical device. Background: Series and parallel connections are a crucial but difficult concept. Existing textbooks give them limited attention, resulting in later difficulties learning circuit analysis. Research Questions: RQ1: Can an improved definition of series elements aid student understanding and student satisfaction? RQ2: Can a computer-based ``game'' lead to effective mastery and student satisfaction at a wide range of institutions, including minority-serving ones? Methodology: Standard and new definitions were elaborated in a multiple-choice tutorial. A game was developed focusing on identifying series and parallel connections, with color coding of both nodes and meshes. Student learning was assessed over eight years using pretest and posttest in 14 varied institutions. Student opinions were assessed using several types of surveys. Findings: Strong learning gains were observed every semester from built-in pretest and posttest, with average scores of 28% and 87%, respectively. Large improvements were observed at every institution including five minority-serving ones. The posttest score is increased by a statistically significant amount after introducing the new definition of series elements. Students preferred the new definition of series and recommended its use, and very strongly endorsed color coding.

关键词： Resistors Voltage Image color analysis Encoding Software color Circuit analysis Circuit topology color coding computer-aided instruction conceptual learning linear circuit analysis parallel connections series connections

来源：评论

学校读者我要写书评

暂无评论

One hundred million years of mantle geochemical history suggest the retiring of mantle plumes is premature

引用

EARTH AND PLANETARY SCIENCE LETTERS 2008年第3-4期275卷 285-295页

作者： Konter, Jasper G. Hanan, Barry B. Blichert-Toft, Janne Koppers, Anthony A. P. Plank, Terry Staudigel, Hubert Univ Calif San Diego SIO La Jolla CA 92093 USA San Diego State Univ San Diego CA 92182 USA Ecole Normale Super Lyon CNRS UMR 5570 F-69364 Lyon 7 France Boston Univ Boston MA 02215 USA

Linear chains of intraplate volcanoes and their geochemistry provide a record of mantle melting through geological time. The isotopic compositions of their lavas characterize their mantle sources, and their ages help backtrack these volcanoes to their original, eruptive source regions. Such data may shed light on a much-debated issue in Earth Sciences: the origin of intraplate volcanism and its underlying mantle and lithosphere dynamics. We show here that three major Western Pacific Seamount groups, similar to 50-100 million years in age, display distinct Sr, Nd, Hf, and Pb isotopic signatures that can be traced back in time, both geographically and geochemically, to three separate, recently-active intraplate volcanoes in the South Pacific Cook-Austral Islands. Their unique 100 million year history, which shows a persistent geochemical fingerprint, suggests formation from large volumes of laterally fixed, long-lived source regions. Such longevity is unlikely to be attained in the relatively dynamic upper mantle. Therefore, these sources are likely anchored deep in the mantle, isolated from homogenization by mantle convection, and imply a primary origin from deep mantle plumes rather than resulting from lithosphere extension. (c) 2008 Elsevier B.V. All rights reserved.

关键词： Pacific seamount Tokelau Gilbert hotspot intraplate plume isotope color coding

来源：评论

学校读者我要写书评

暂无评论

OCULAR MEASURES OF REDUNDANCY GAIN DURING VISUAL-SEARCH OF color SYMBOLIC DISPLAYS

引用

ERGONOMICS 1995年第9期38卷 1831-1840页

作者： BACKS, RW WALRATH, LC MCDONNELL DOUGLAS CORP HUMAN PERFORMANCE LABST LOUISMO 63166

Sixteen observers participated in a visual search experiment in which colour coding, search type, and the amount of pre-search information available to the observers were varied. Observers searched simulated symbolic tactical displays to find the number of target symbols (i.e. exhaustive search) or the quadrant of the display in which a single target symbol was located (i.e. self-terminating search). Displays varied in the way in which the symbology was colour coded: colour was either relevant (i.e. redundant with symbol shape) or irrelevant (orthogonal to symbol shape), or the display was monochrome. Half of the observers were cued with regard to the coding scheme prior to display onset, while the other observers were not. There was no overall difference in search time or accuracy, number of eye fixations, or pupillary response between cued and non-cued observers, but only because cued and non-cued observers used the coding schemes differently. Redundancy gain was only evident for cued observers, who searched colour relevant displays faster and with fewer fixations than colour irrelevant or monochrome displays. Non-cued observers' search pattern did not differ across colour coding schemes, but they searched colour irrelevant and monochrome displays faster than the cued observers. Differences between cued and non-cued observers' search strategy are discussed with regard to their implications for design and evaluation of colour multipurpose displays.

关键词： color coding REDUNDANCY GAIN VISUAL SEARCH EYE MOVEMENTS PUPILLARY RESPONSE

来源：评论

学校读者我要写书评

暂无评论

Randomised Enumeration of Small Witnesses Using a Decision Oracle

引用

ALGORITHMICA 2019年第2期81卷 519-540页

作者： Meeks, Kitty Univ Glasgow Sch Comp Sci Sir Alwyn Williams Bldg Glasgow G12 8RZ Lanark Scotland

Many combinatorial problems involve determining whether a universe of n elements contains a witness consisting of k elements which have some specified property. In this paper we investigate the relationship between the decision and enumeration versions of such problems: efficient methods are known for transforming a decision algorithm into a search procedure that finds a single witness, but even finding a second witness is not so straightforward in general. We show that, if the decision version of the problem can be solved in time f(k) . poly(n), there is a randomised algorithm which enumerates all witnesses in time e(k+o(k)) . f(k) . poly(n) . N, where N is the total number of witnesses. If the decision version of the problem is solved by a randomised algorithm which may return false negatives, then the same method allows us to output a list of witnesses in which any given witness will be included with high probability. The enumeration algorithm also gives rise to an efficient algorithm to count the total number of witnesses when this number is small.

关键词： Enumeration algorithms Parameterized complexity Randomized algorithms Approximate enumeration color coding

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：