Fusion of smartphone sensor data for classification of daily user activities

Multimedia Tools and Applications - New mobile applications need to estimate user activities by using sensor data provided by smart wearable devices and deliver context-aware solutions to users...     

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...     

Gait Generation and Stabilization for Nearly Passive Dynamic Walking Using Auto‐distributed Impulses

We propose a state feedback control design via linearization for flexible walking on flat ground. First, we generate nearly passive limit cycles, being stable or not, using impulsive toe‐off actuations. The term ‘nearly passive’ means that the dynamics is completely passive almost everywhere except at the toe‐off moment. A feature of our gait generation method is that walking gaits are characterized only by amounts of supplied energy, and we observe that other variables, including input torques, are auto‐balanced via our method. After gait generation, we design a feedback controller considering robustness and input saturation. As a result, each limit cycle can be matched with its respective controller classified only by energy levels. We have verified that walking speeds monotonically increase by adding more energy, and the ankle joint plays a significant role in compass‐gait walking. Finally, instead of applying impulsive torques, we discuss a practical issue regarding realistic control inputs that ensure stable gait transitions as energy levels are elevated.     

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.     

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 α.     

Tensor Clustering for Rendering Many‐Light Animations

Rendering animations of scenes with deformable objects, camera motion, and complex illumination, including indirect lighting and arbitrary shading, is a long‐standing challenge. Prior work has shown that complex lighting can be accurately approximated by a large collection of point lights. In this formulation, rendering of animation sequences becomes the problem of efficiently shading many surface samples from many lights across several frames. This paper presents a tensor formulation of the animated many‐light problem, where each element of the tensor expresses the contribution of one light to one pixel in one frame. We sparsely sample rows and columns of the tensor, and introduce a clustering algorithm to select a small number of representative lights to efficiently approximate the animation. Our algorithm achieves efficiency by reusing representatives across frames, while minimizing temporal flicker. We demonstrate our algorithm in a variety of scenes that include deformable objects, complex illumination and arbitrary shading and show that a surprisingly small number of representative lights is sufficient for high quality rendering. We believe out algorithm will find practical use in applications that require fast previews of complex animation.