Measuring Cognitive Load Using Linguistic Features: Implications for Usability Evaluation and Adaptive Interaction Design

An intelligent adaptable system, aware of a user’s experienced cognitive load, may help improve performance in complex, time-critical situations by dynamically deploying more appropriate output strategies to reduce cognitive load. However, measuring a user’s cognitive load robustly, in real-time is not a trivial task. Many research studies have attempted to assess users’ cognitive load using different measurements, but these are often unsuitable for deployment in real-life applications due to high intrusiveness. Relatively novel linguistic behavioral features as potential indices of user’s cognitive load is proposed. These features may be collected implicitly and nonintrusively supporting real-time assessment of users’ cognitive load and accordingly allowing adaptive usability evaluation and interaction. Results from a laboratory experiment show significantly different linguistic patterns under different task complexities and cognitive load levels. Implications of the research for adaptive interaction are also discussed, that is, how the cognitive load measurement-based approach could be used for user interface evaluation and interaction design improvement.     

Incorporation and distribution of saturated and unsaturated fatty acids into nuclear lipids of hepatic cells

Liver nuclear incorporation of stearic (18∶0), linoleic (18∶2n−6), and arachidonic (20∶4n−6) acids was studied by incubation in vitro of the [1-¹⁴C] fatty acids with nuclei, with or without the cytosol fraction at different times. The [1-¹⁴C] fatty acids were incorporated into the nuclei as free fatty acids in the following order: 18∶0>20∶4n−6≫18∶2n−6, and esterified into nuclear lipids by an acyl-CoA pathway. All [1-¹⁴C] fatty acids were esterified mainly to phospholipids and triacylglycerols and in a minor proportion to diacylglycerols. Only [1-¹⁴C] 18∶2n−6-CoA was incorporated into cholesterol esters. The incorporation was not modified by cytosol addition. The incorporation of 20∶4n−6 into nuclear phosphatidylcholine (PC) pools was also studied by incubation of liver nuclei in vitro with [1-¹⁴C]20∶4n−6-CoA, and nuclear labeled PC molecular species were determined. From the 15 PC nuclear molecular species determined, five were labeled with [1-¹⁴C]20∶4n−6-CoA: 18∶0–20∶4, 16∶0–20∶4, 18∶1–20∶4, 18∶2–20∶4, and 20∶4–20∶4. The highest specific radioactivity was found in 20∶4–20∶4 PC, which is a minor species. In conclusion, liver cell nuclei possess the necessary enzymes to incorporate exogenous saturated and unsaturated fatty acids into lipids by an acyl-CoA pathway, showing specificity for each fatty acid. Liver cell nuclei also utilize exogenous 20∶4n−6-CoA to synthesize the major molecular species of PC with 20∶4n−6 at the sn-2 position. However, the most actively synthesized is 20∶4–20∶4 PC, which is a quantitatively minor component. The labeling pattern of 20∶4–20∶4 PC would indicate that this molecular species is synthesized mainly by the de novo pathway.     

The Effect of Sulfur Segregation on the Adherence of the Thermally-Grown Oxide on NiAl—I: Sulfur Segregation on the Metallic Surface of NiAl(001) Single-Crystals and at NiAl(001)/Al2O3 Interfaces

The aim of this study was to improve the understanding of the deleterious effect of sulfur impurities on the adherence of the thermally-grown oxide on the boundary layer in thermal-barrier-coating systems. In Part I, the sulfur segregation on the free surface of NiAl(001) and at different interfaces between metal and transient alumina scales has been characterized by AES, XPS and LEED. The sulfur diffusion coefficient in the alloy has been determined (D = 0.15 exp(–218,000/RT) cm²/s). It is by three orders of magnitude larger than the nickel and aluminum self-diffusion coefficients. It has also been observed that the sulfur de-segregates upon Al enrichment of the metallic surface. The saturation of the metallic surface with an amorphous alumina layer formed at room temperature blocks the segregation of S. However, in the initial stages of oxidation where the transient -alumina grows by cationic transport and inject vacancies at the interface, S segregates at the interface between the alumina thin films and the metallic substrate.     

Discriminating Conduct: Deploying Systems to Support Awareness in Organizations

Alongside the emergence of the use of fieldwork studies for design there has been a discussion on how best these studies can inform system development. Concerns have been expressed as to whether their most appropriate contribution is a list of requirements or design recommendations. This article explores a recurrent issue that has emerged from fieldwork studies in Computer-Supported Cooperative Work, awareness, and with respect to a particular system development project discusses some of the implications for the development and deployment of one particular kind of technology—image recognition systems—in particular, organizational settings. In the setting in question—surveillance centers or operations rooms—staff utilize a range of practices to maintain awareness. Rather than extending field studies so that they can better assist design, it may be considered how workplace studies can contribute to a respecification of key concepts, like awareness, that are critical to an understanding of how technologies are used and deployed in everyday environments.     

The Price of Anarchy in Network Creation Games Is (Mostly) Constant

We study the price of anarchy and the structure of equilibria in network creation games. A network creation game is played by n players {1,2,…,n}, each identified with a vertex of a graph (network), where the strategy of player i, i=1,…,n, is to build some edges adjacent to i. The cost of building an edge is α>0, a fixed parameter of the game. The goal of every player is to minimize its creation cost plus its usage cost. The creation cost of player i is α times the number of built edges. In the SumGame variant, the usage cost of player i is the sum of distances from i to every node of the resulting graph. In the MaxGame variant, the usage cost is the eccentricity of i in the resulting graph of the game. In this paper we improve previously known bounds on the price of anarchy of the game (of both variants) for various ranges of α, and give new insights into the structure of equilibria for various values of α. The two main results of the paper show that for α>273?n all equilibria in SumGame are trees and thus the price of anarchy is constant, and that for α>129 all equilibria in MaxGame are trees and the price of anarchy is constant. For SumGame this answers (almost completely) one of the fundamental open problems in the field—is price of anarchy of the network creation game constant for all values of α?—in an affirmative way, up to a tiny range of α.     

Variable Structure Control with Chattering Reduction of a Generalized T‐S Model

In this paper, a fuzzy logic controller (FLC) based variable structure control (VSC) is presented. The main objective is to obtain an improved performance of highly non‐linear unstable systems. New functions for chattering reduction and error convergence without sacrificing invariant properties are proposed. The main feature of the proposed method is that the switching function is added as an additional fuzzy variable and will be introduced in the premise part of the fuzzy rules; together with the state variables. In this work, a tuning of the well known weighting parameters approach is proposed to optimize local and global approximation and modelling capability of the Takagi‐Sugeno (T‐S) fuzzy model to improve the choice of the performance index and minimize it. The main problem encountered is that the T‐S identification method can not be applied when the membership functions are overlapped by pairs. This in turn restricts the application of the T‐S method because this type of membership function has been widely used in control applications. The approach developed here can be considered as a generalized version of the T‐S method. An inverted pendulum mounted on a cart is chosen to evaluate the robustness, effectiveness, accuracy and remarkable performance of the proposed estimation approach in comparison with the original T‐S model. Simulation results indicate the potential, simplicity and generality of the estimation method and the robustness of the chattering reduction algorithm. In this paper, we prove that the proposed estimation algorithm converge the very fast, thereby making it very practical to use. The application of the proposed FLC‐VSC shows that both alleviation of chattering and robust performance are achieved.     

Color image segmentation using adaptive unsupervised clustering approach

This paper presents the Region Splitting and Merging-Fuzzy C-means Hybrid Algorithm (RFHA), an adaptive unsupervised clustering approach for color image segmentation, which is important in image analysis and in understanding pattern recognition and computer vision field. Histogram thresholding technique is applied in the formation of all possible cells, used to split the image into multiple homogeneous regions. The merging technique is applied to merge perceptually close homogeneous regions and obtain better initialization for the Fuzzy C-means clustering approach. Experimental results have demonstrated that the proposed scheme could obtain promising segmentation results, with 12% average improvement in clustering quality and 63% reduction in classification error compared with other existing segmentation approaches.     

Examining the dimensionality of genuine multipartite entanglement

Entanglement in high-dimensional many-body systems plays an increasingly vital role in the foundations and applications of quantum physics. In the present paper, we introduce a theoretical concept which allows to categorize multipartite states by the number of degrees of freedom being entangled. In this regard, we derive computable and experimentally friendly criteria for arbitrary multipartite qudit systems that enable to examine in how many degrees of freedom a mixed state is genuine multipartite entangled.     

The assembly line worker assignment and balancing problem with stochastic worker availability

Assembly lines can be employed successfully in sheltered work centres to better include persons with disabilities in the labour market as well as to improve production efficiency. The optimal assignment of a heterogeneous workforce is known as the assembly line worker assignment and balancing problem (ALWABP). These assembly lines are characterised not only by a heterogeneous workforce, but also by high levels of absenteeism, which makes it more difficult to obtain stable and efficient line balancing solutions. In this paper, an extension of the ALWABP to minimise the expected cycle time under uncertain worker availability is proposed. We model this problem as a two-stage mixed integer program, and propose local search heuristics for solving it. Computational experiments show that stochastic modelling can help to improve the line’s efficiency and that the proposed heuristics produce good results for instances of practical size.