Conceptualization,measurement, and application of semantic transparency in visual notations

Numerous visual notations are present in technical and business domains. Notations have to be cognitively effective to ease the planning, documentation, and communication of the domains’ concepts. Semantic transparency (ST) is one of the elementary principles that influence notations’ cognitive effectiveness. However, the principle is criticized for not being well defined and challenges arise in the evaluations and applications of ST. Accordingly, this research’s objectives were to answer how the ST principle is defined, operationalized, and evaluated in present notations as well as applied in the design of new notations in ICT and related areas. To meet these objectives, a systematic literature review was conducted with 94 studies passing the selection process criteria. The results reject one of the three aspects, which define semantic transparency, namely “ST is achieved with the use of icons.” Besides, taxonomies of related concepts and research methods, evaluation metrics, and other findings from this study can help to conduct verifiable ST-related experiments and applications, consequently improving the visual vocabularies of notations and effectiveness of the resulting diagrams.

     

A hybrid tactile sensor-based obstacle overcoming method for hexapod walking robots

Intelligent Service Robotics - Walking robots are considered as a promising solution for locomotion across irregular or rough terrain. While wheeled or tracked robots require flat surface like...     

Design of Lu2O3-reinforced Cf/SiC-ZrB2-ZrC ultra-high temperature ceramic matrix composites: Wetting and interfacial reactivity by ZrSi2 based alloys

The wettability and infiltration of molten ZrSi₂ and ZrSi₂-Lu₂O₃ alloys into C_f/SiC and B₄C-infiltrated C_f/SiC composites were investigated to understand the interfacial interactions that occur during the development of C_f/SiC-ZrC and C_f/SiC-ZrB₂-ZrC-Lu₂O₃ materials. A significant evaporation of Si from the liquid affected the wetting behaviour of the alloy when tested in a vacuum at 1670 °C. The better wetting and spreading of the alloy over the surface was observed for the composites with lower overall porosity (12 %). On the other hand, the formation of an outer dense layer, followed up by the uniform infiltrated region up to ～ 1 mm was observed for the C_f/SiC with higher porosity (21 %). The infiltrated alloy reacted with SiC matrix to form ZrC or with B₄C-infiltrated SiC matrix to form ZrB₂-ZrC-SiC. The Lu₂O₃ particles were not wetted by the melt, and were pushed away of the reaction zone by the solidification front.     

Using static suffix array in dynamic application: Case of text compression by longest first substitution

Over the last decade, enhanced suffix arrays (ESA) have replaced suffix trees in many applications. Algorithms based on ESAs require less space, while allowing the same time efficiency as those based on suffix trees. However, this is only true when a suffix structure is used as a static index. Suffix trees can be updated faster than suffix arrays, which is a clear advantage in applications that require dynamic indexing. We show that for some dynamic applications a suffix array and the derived LCP-interval tree can be used in such a way that the actual index updates are not necessary. We demonstrate this in the case of grammar text compression with longest first substitution and provide the source code. The proposed algorithm has O(N²)$O(N^2)$ worst case time complexity but runs in O(N)$O(N)$ time in practice.     

Online recognition of sketched arrow-connected diagrams

We introduce a new, online, stroke-based recognition system for hand-drawn diagrams which belong to a group of documents with an explicit structure obvious to humans but only loosely defined from the machine point of view. We propose a model for recognition by selection of symbol candidates, based on evaluation of relations between candidates using a set of predicates. It is suitable for simpler structures where the relations are explicitly given by symbols, arrows in the case of diagrams. Knowledge of a specific diagram domain is used—the two domains are flowcharts and finite automata. Although the individual pipeline steps are tailored for these, the system can readily be adapted for other domains. Our entire diagram recognition pipeline is outlined. Its core parts are text/non-text separation, symbol segmentation, their classification and structural analysis. Individual parts have been published by the authors previously and so are described briefly and referenced. Thorough evaluation on benchmark databases shows the accuracy of the system reaches the state of the art and is ready for practical use. The paper brings several contributions: (a) the entire system and its state-of-the-art performance; (b) the methodology exploring document structure when it is loosely defined; (c) the thorough experimental evaluation; (d) the new annotated database for online sketched flowcharts and finite automata diagrams.     

Business Intelligence Acceptance: The Prominence of Organizational Factors

The specifics of business intelligence systems compared to operational IS motivate the necessity to research the business intelligence systems acceptance determinants separately. The authors followed an exploratory approach in order to conceptualize a business intelligence acceptance model. Their findings show that in the Business Intelligence Systems context, there is a significant emphasis on organizational factors, such as result demonstrability, social influence, and facilitating conditions with sufficient resources that help build an adequate information culture all substantially influencing the effective acceptance of business intelligence systems.     

Small‐signal and noise modeling of class of HEMTs using knowledge‐based artificial neural networks

In this article, the neural network approach is exploited for development of bias‐dependent small‐signal and noise models of a class of microwave field effect transistor (FETs) made in the same technology but differing in the gate width. The prior knowledge neural approach is applied. Introducing gate width at the input of proposed neural networks, as well as the S/noise parameters of a device that belongs to the same class as the modeled device representing the prior knowledge, leads to very accurate scattering and noise parameters' modeling, as exemplified by modeling of class of pseudomorphic high electron mobility transistor (pHEMT) devices. © 2012 Wiley Periodicals, Inc. Int J RF and Microwave CAE, 2013.     

Limitations of a Mapping Algorithm with Fragmentation Mimics (MAFM) when modeling statistical data sources based on measured packet network traffic

Knowing the estimation of a statistical process’s parameters for measured network traffic is very important as it can then be further used for the statistical analyses and modeling of network traffic in simulation tools. It is for this reason that different estimation methods are proposed that allow estimations of the statistical processes of network traffic. One of them is our own histograms comparison (EMHC) based method that can be used to estimate statistical data-length process parameters from measured packet traffic. The main part of EMHC method is Mapping Algorithm with Fragmentation Mimics (MAFM).     

HFPaC: GPU friendly height field parallel compression

In this paper, we present a novel method for fast lossy or lossless compression and decompression of regular height fields. The method is suitable for SIMD parallel implementation and thus inherently suitable for modern GPU architectures. Lossy compression is achieved by approximating the height field with a set of quadratic Bezier surfaces. In addition, lossless compression is achieved by superimposing the residuals over the lossy approximation. We validated the method’s efficiency through a CUDA implementation of compression and decompression algorithms. The method allows independent decompression of individual data points, as well as progressive decompression. Even in the case of lossy decompression, the decompressed surface is inherently seamless. In comparison with the GPU-oriented state-of-the-art method, the proposed method, combined with a widely available lossless compression method (such as DEFLATE), achieves comparable compression ratios. The method’s efficiency slightly outperforms the state-of-the-art method for very high workloads and considerably for lower workloads.