Sociological and philosophical aspects of human interaction with technology: advancing concepts

It is not possible to imagine our lives today without technology. From the moment we get up in the morning until the time that we go to bed at night, technology is present in almost every moment, even if we are not aware of it. Some of the most basic activities we need to perform regularly could not be carried out without technology. Sociological and Philosophical Aspects of Human Interaction with Technology: Advancing Concepts presents a careful blend of conceptual, theoretical and applied research in regards to the relationship between technology and humans. This book explores the importance of these interactions, aspects related with trust, communication, data protection, usability concerning organizational change, and e-learning. The advancement of these theories and practices will benefit from this publication as it provides a voice for the users.

Mathematical aspects of the Heisenberg uncertainty principle within local fractional Fourier analysis

In this paper, we discuss the mathematical aspects of the Heisenberg uncertainty principle within local fractional Fourier analysis. The Schrödinger equation and Heisenberg uncertainty principles are structured within local fractional operators.

Practical aspects of slot-based task- splitting dispatching in its schedulability analysis

Consider the problem of scheduling a set of sporadic tasks on a multiprocessor system to meet deadlines using a tasksplitting scheduling algorithm. Task-splitting (also called semipartitioning) scheduling algorithms assign most tasks to just one processor but a few tasks are assigned to two or more processors, and they are dispatched in a way that ensures that a task never executes on two or more processors simultaneously. A certain type of task-splitting algorithms, called slot-based task-splitting, is of particular interest because of its ability to schedule tasks at high processor utilizations. We present a new schedulability analysis for slot-based task-splitting scheduling algorithms that takes the overhead into account and also a new task assignment algorithm.