The Effect of Configural Graphs on Concurrent and Retrospective Performance

1996 ◽  
Vol 40 (23) ◽  
pp. 1160-1164
Author(s):  
Karel Hurts
Keyword(s):  
Data Structure ◽  
Task Performance ◽  
Search Time ◽  
Graph Structure ◽  
Reversal Effect ◽  
High Data ◽  
Graph Type ◽  
Data Graph ◽  
Structure Complexity ◽  
Integrated Tasks

Following up on a previous study showing the performance on integrated tasks for non-configural graphs to be superior to that for configural graphs if the memory for the graph is tested (retrospective or memory-based conditions), this paper further contrasts retrospective and concurrent (display-based) task performance. This was done by experimentally investigating the effect of various configural and non-configural static graphs on integrated task performance (requiring the consideration of lower-level graph information as well as higher-level graph information), using both retrospective and concurrent conditions. Subjects were asked to answer a question about each graph, which was phrased in terms of the domain of the data and which could not be easily anticipated. Graphs also differed in the amount of fit between graph structure and data structure (data-graph compatibility). The results confirmed the expectation that the reversal effect (inferior performance for configural graphs) is only found under memory-based conditions. Both display-based and memory-based performance were better for the configural graphs with high data-graph compatibility, although only significantly so for display-based search time. The two separable types of graphs could only be compared with respect to the amount of time needed to memorize the graphs: longer times were found for the graph type with low data-graph compatibility. However, the latter effect may also be due to a difference in data structure complexity, as this factor was confounded with data-graph compatibility in the two separable graph types. Although more research is needed to disambiguate some of the present results and to make other and better comparisons, the results of this study still show the importance of structural and semantic factors in determining the effectiveness of configurality in statistical graphs.

scholarly journals Lensless Optical Encryption of Multilevel Digital Data Containers Using Spatially Incoherent Illumination

2021 ◽  
Vol 12 (1) ◽  
pp. 406
Author(s):  
Pavel Cheremkhin ◽  
Nikolay Evtikhiev ◽  
Vitaly Krasnov ◽  
Ilya Ryabcev ◽  
Anna Shifrina ◽  
...  
Keyword(s):  
Data Structure ◽  
Error Correction ◽  
Digital Data ◽  
Qr Codes ◽  
Optical Encryption ◽  
High Data ◽  
Use Of Data ◽  
Data Density

The necessity of the correction of errors emerging during the optical encryption process led to the extensive use of data containers such as QR codes. However, due to specifics of optical encryption, QR codes are not very well suited for the task, which results in low error correction capabilities in optical experiments mainly due to easily breakable QR code’s service elements and byte data structure. In this paper, we present optical implementation of information optical encryption system utilizing new multilevel customizable digital data containers with high data density. The results of optical experiments demonstrate efficient error correction capabilities of the new data container.

Effect of Template Complexity on Visual Search and Dual-Task Performance

2005 ◽  
Vol 16 (3) ◽  
pp. 208-213 ◽  
Author(s):  
Patrick A. Bourke ◽  
John Duncan
Keyword(s):  
Visual Search ◽  
Reaction Time ◽  
Task Performance ◽  
Dual Task ◽  
Search Time ◽  
Concurrent Task ◽  
Task Demands ◽  
Biased Competition ◽  
Task Control ◽  
Dual Task Performance

Even dissimilar tasks interfere with one another when done together. We used visual search to examine the underlying cause of such interference. In many models, visual search is a process of biased competition controlled by a template describing the target to be sought. When the display is processed, matching against this template guides attention to the target. We show that increasing template complexity increased interference with a dissimilar concurrent task, story memory. This result was independent of reaction time: Increases in template complexity were associated with no increase in search time in Experiment 1 and with a decrease in search time in Experiment 2. The results show that the dual-task demands of visual search reflect the complexity of the template used in task control, and that this factor can be isolated from other sources of difficulty.

scholarly journals CIDOC2VEC: Extracting Information from Atomized CIDOC-CRM Humanities Knowledge Graphs

Information ◽  
2021 ◽  
Vol 12 (12) ◽  
pp. 503
Author(s):  
Hassan El-Hajj ◽  
Matteo Valleriani
Keyword(s):  
Data Structure ◽  
Digital Humanities ◽  
Text Processing ◽  
Relevant Information ◽  
Knowledge Graph ◽  
Graph Structure ◽  
Ontology Model ◽  
Cidoc Crm ◽  
Knowledge Graphs ◽  
Use Of Knowledge

The development of the field of digital humanities in recent years has led to the increased use of knowledge graphs within the community. Many digital humanities projects tend to model their data based on CIDOC-CRM ontology, which offers a wide array of classes appropriate for storing humanities and cultural heritage data. The CIDOC-CRM ontology model leads to a knowledge graph structure in which many entities are often linked to each other through chains of relations, which means that relevant information often lies many hops away from their entities. In this paper, we present a method based on graph walks and text processing to extract entity information and provide semantically relevant embeddings. In the process, we were able to generate similarity recommendations as well as explore their underlying data structure. This approach was then demonstrated on the Sphaera Dataset which was modeled according to the CIDOC-CRM data structure.

Measurement of data structure complexity

1993 ◽  
Vol 20 (3) ◽  
pp. 217-225 ◽  
Author(s):  
John C. Munson ◽  
Taghi M. Kohshgoftaar
Keyword(s):  
Data Structure ◽  
Structure Complexity

Markov Chain Models for Menu Item Prediction

2013 ◽  
Vol 9 (4) ◽  
pp. 75-94
Author(s):  
Tao Lin ◽  
Tian-Tian Xie ◽  
Yi Mou ◽  
Ning-Jiu Tang
Keyword(s):  
Genetic Algorithm ◽  
Markov Chain ◽  
Task Performance ◽  
Prediction Models ◽  
Menu Item ◽  
Mental Load ◽  
Probability Summation ◽  
Interaction Field ◽  
Markov Chain Models ◽  
Structure Complexity

With the increase in the number of menu items and the menu structure complexity, users have to spend more time in locating menu items when using menu-based interfaces, which tends to result in the decrease of task performance and the increase of mental load. How to reduce the navigation time has been a great challenge in the HCI (human-computer interaction) field. Recently, adaptive menu techniques have been explored in response to the challenge, and menu item prediction plays a crucial role in the techniques. Unfortunately, there still lacks effective prediction models for menu items. This paper explores the potential of three prediction models (i.e., Absolute Distribution Markov Chain, Probability Summation Markov Chain and Weighted Markov Chain based on Genetic Algorithm) in predicting the most possible N (Top-N) menu items based on the users’ historical menu item clicks. And the results show that Weighted Markov Chain based on Genetic Algorithm can obtain the highest prediction accuracy and significantly decrease navigation time by 22.6% when N equals 4 as compared to the static counterpart.

scholarly journals The Dynamics of Specialization and Generalization within Biological Populations

1998 ◽  
Vol 01 (01) ◽  
pp. 115-127 ◽  
Author(s):  
Andrew J. Spencer ◽  
Iain D. Couzin ◽  
Nigel R. Franks
Keyword(s):  
Task Performance ◽  
Biological Systems ◽  
Search Time ◽  
Abstract Model ◽  
Trade Off ◽  
Wide Range ◽  
Simple Rules ◽  
Per Se

We develop an abstract model to explore specialization and generalization in task performance by individuals within biological populations. Individuals follow simple rules of increasing and decreasing task propensities that could, for example, be based on learning and forgetting. The model does not explore efficiency per se, but makes the prediction that where behavioural specialization occurs in nature, organisms, are likely to be reaping sufficient benefits from improved handling efficiency to offset the costs of increased search time. A second prediction is that among specialists, there will be a trade-off between stability and responsiveness. The model reveals potential similarities between a wide range of complex biological systems.

scholarly journals The Polygraph: A Data Structure for Genome Alignment and Variation Detection

10.29007/txxd ◽  
2019 ◽  
Author(s):  
Masaki Fujimoto ◽  
Cole Lyman ◽  
Mark Clement
Keyword(s):  
Data Structure ◽  
Structural Variation ◽  
Genomic Structure ◽  
Genome Alignment ◽  
Graph Structure ◽  
Structural Variants ◽  
De Bruijn Graphs ◽  
Genomic Structural Variation ◽  
Whole Genomes ◽  
Whole Genome Alignment

Comparing whole genomes and finding variation is an important and difficult bioinformatic task. We present the Polygraph, a data structure for reference-free, multiple whole genome alignment that can be used to identify genomic structural variation. This data structure is built from assembled genomes and preserves the genomic structure from the assembly. It avoids the “hairball” graph structure that can occur in other graph methods such as de Bruijn graphs. The Polygraph can easily be visualized and be used for identification of structural variants. We apply the Polygraph to Escherichia coli and Saccharomyces cerevisiae for finding Structural Variants.

Effects of Concurrent Manual Task Performance on Connected Speech Acoustics in Individuals With Parkinson Disease

2019 ◽  
Vol 62 (7) ◽  
pp. 2099-2117 ◽  
Author(s):  
Jason A. Whitfield ◽  
Zoe Kriegel ◽  
Adam M. Fullenkamp ◽  
Daryush D. Mehta
Keyword(s):  
Task Performance ◽  
Speech Production ◽  
Dual Task ◽  
Motor Task ◽  
Task Condition ◽  
Connected Speech ◽  
Speech Acoustics ◽  
Single Task ◽  
Manual Task ◽  
Task Conditions

Purpose Prior investigations suggest that simultaneous performance of more than 1 motor-oriented task may exacerbate speech motor deficits in individuals with Parkinson disease (PD). The purpose of the current investigation was to examine the extent to which performing a low-demand manual task affected the connected speech in individuals with and without PD. Method Individuals with PD and neurologically healthy controls performed speech tasks (reading and extemporaneous speech tasks) and an oscillatory manual task (a counterclockwise circle-drawing task) in isolation (single-task condition) and concurrently (dual-task condition). Results Relative to speech task performance, no changes in speech acoustics were observed for either group when the low-demand motor task was performed with the concurrent reading tasks. Speakers with PD exhibited a significant decrease in pause duration between the single-task (speech only) and dual-task conditions for the extemporaneous speech task, whereas control participants did not exhibit changes in any speech production variable between the single- and dual-task conditions. Conclusions Overall, there were little to no changes in speech production when a low-demand oscillatory motor task was performed with concurrent reading. For the extemporaneous task, however, individuals with PD exhibited significant changes when the speech and manual tasks were performed concurrently, a pattern that was not observed for control speakers. Supplemental Material https://doi.org/10.23641/asha.8637008

Sign in / Sign up

Export Citation Format

Share Document