Timo Hämäläinen

Bio: Timo Hämäläinen is an academic researcher from University of Jyväskylä. The author has contributed to research in topics: Quality of service & Encoder. The author has an hindex of 38, co-authored 560 publications receiving 7648 citations. Previous affiliations of Timo Hämäläinen include Dalian Medical University & Nokia.

Exploring Oscillatory Dysconnectivity Networks in Major Depression During Resting State Using Coupled Tensor Decomposition

Abstract: Dysconnectivity of large-scale brain networks has been linked to major depression disorder (MDD) during resting state. Recent researches show that the temporal evolution of brain networks regulated by oscillations reveals novel mechanisms and neural characteristics of MDD. Our study applied a novel coupled tensor decomposition model to investigate the dysconnectivity networks characterized by spatio-temporal-spectral modes of covariation in MDD using resting electroencephalography. The phase lag index is used to calculate the functional connectivity within each time window at each frequency bin. Then, two adjacency tensors with the dimension of time × frequency × connectivity × subject are constructed for the healthy group and the major depression group. We assume that the two groups share the same features for group similarity and retain individual characteristics for group differences. Considering that the constructed tensors are nonnegative and the components in spectral and adjacency modes are partially consistent among the two groups, we formulate a double-coupled nonnegative tensor decomposition model. To reduce computational complexity, we introduce the low-rank approximation. Then, the fast hierarchical alternative least squares algorithm is applied for model optimization. After clustering analysis, we summarize four oscillatory networks characterizing the healthy group and four oscillatory networks characterizing the major depression group, respectively. The proposed model may reveal novel mechanisms of pathoconnectomics in MDD during rest, and it can be easily extended to other psychiatric disorders.

Method for adapting a bus and a bus

Abstract: A method for adapting a bus to data traffic in a system comprising several functional units ( 311, 312, . . . , 31 n ) and a bus structure. The functional units are divided into at least two sets so that units, which mainly transfer data with each other belong to a same set and are interfaced with the same separate sub-bus ( 321; 322 ). The sub-buses can be united by switches (SW) into a more extensive bus, which is only used when data must be transferred between different sets. Supply voltage of each sub-bus is adjustable and is set the lower the less traffic there is on the bus. The parallel transfer operation makes it possible to increase the transfer capacity of the bus structure without increasing it's clock frequency. Furthermore energy consumption can be reduced by dropping the supply voltage of the bus circuits so that the bus retains the transfer capacity needed.

Positioning in resource-constrained ultra low-power Wireless Sensor Networks

Abstract: Wireless Sensor Networks (WSNs) consist of densely deployed, independent, and collaborating low cost sensor nodes. The nodes are highly resource-constrained in terms of energy, processing, and data storage capacity. Thus, the protocols used in WSNs must be highly energy-efficient. WSN communication protocols achieving the lowest power consumption minimize radio usage by accurately synchronizing transmissions and receptions with their neighbors. In this paper, we show how network signaling frames of state-of-the-art synchronized communication protocols for low-power WSNs supporting mobile nodes can be used for positioning. We derive mathematical models for node power consumption analysis. The models provide a tool for estimating what kind of network lifetimes can be expected when average positioned node speed, the amount of anchor nodes required by the location estimation algorithm, and the location refresh rate required by the application are known. The presented analysis results are based on two kinds of node hardware: real node hardware prototypes having no Received Signal Strength Indicator (RSSI) support and typical values of an integrated chip using an IEEE 802.15.4 compliant radio with RSSI.

Efficiency of temporal sensor data compression methods to reduce LoRa-based sensor node energy consumption

Abstract: Purpose Minimizing the energy consumption in a wireless sensor node is important for lengthening the lifetime of a battery. Radio transmission is the most energy-consuming task in a wireless sensor node, and by compressing the sensor data in the online mode, it is possible to reduce the number of transmission periods. This study aims to demonstrate that temporal compression methods present an effective method for lengthening the lifetime of a battery-powered wireless sensor node. Design/methodology/approach In this study, the energy consumption of LoRa-based sensor node was evaluated and measured. The experiments were conducted with different LoRaWAN data rate parameters, with and without compression algorithms implemented to compress sensor data in the online mode. The effect of temporal compression algorithms on the overall energy consumption was measured. Findings Energy consumption was measured with different LoRaWAN spreading factors. The LoRaWAN transmission energy consumption significantly depends on the spreading factor used. The other significant factors affecting the LoRa-based sensor node energy consumption are the measurement interval and sleep mode current consumption. The results show that temporal compression algorithms are an effective method for reducing the energy consumption of a LoRa sensor node by reducing the number of LoRa transmission periods. Originality/value This paper presents with a practical case that it is possible to reduce the overall energy consumption of a wireless sensor node by compressing sensor data in online mode with simple temporal compression algorithms.

I and i

Abstract: There is, I think, something ethereal about i —the square root of minus one. I remember first hearing about it at school. It seemed an odd beast at that time—an intruder hovering on the edge of reality. Usually familiarity dulls this sense of the bizarre, but in the case of i it was the reverse: over the years the sense of its surreal nature intensified. It seemed that it was impossible to write mathematics that described the real world in …

Machine learning

Abstract: Machine Learning is the study of methods for programming computers to learn. Computers are applied to a wide range of tasks, and for most of these it is relatively easy for programmers to design and implement the necessary software. However, there are many tasks for which this is difficult or impossible. These can be divided into four general categories. First, there are problems for which there exist no human experts. For example, in modern automated manufacturing facilities, there is a need to predict machine failures before they occur by analyzing sensor readings. Because the machines are new, there are no human experts who can be interviewed by a programmer to provide the knowledge necessary to build a computer system. A machine learning system can study recorded data and subsequent machine failures and learn prediction rules. Second, there are problems where human experts exist, but where they are unable to explain their expertise. This is the case in many perceptual tasks, such as speech recognition, hand-writing recognition, and natural language understanding. Virtually all humans exhibit expert-level abilities on these tasks, but none of them can describe the detailed steps that they follow as they perform them. Fortunately, humans can provide machines with examples of the inputs and correct outputs for these tasks, so machine learning algorithms can learn to map the inputs to the outputs. Third, there are problems where phenomena are changing rapidly. In finance, for example, people would like to predict the future behavior of the stock market, of consumer purchases, or of exchange rates. These behaviors change frequently, so that even if a programmer could construct a good predictive computer program, it would need to be rewritten frequently. A learning program can relieve the programmer of this burden by constantly modifying and tuning a set of learned prediction rules. Fourth, there are applications that need to be customized for each computer user separately. Consider, for example, a program to filter unwanted electronic mail messages. Different users will need different filters. It is unreasonable to expect each user to program his or her own rules, and it is infeasible to provide every user with a software engineer to keep the rules up-to-date. A machine learning system can learn which mail messages the user rejects and maintain the filtering rules automatically. Machine learning addresses many of the same research questions as the fields of statistics, data mining, and psychology, but with differences of emphasis. Statistics focuses on understanding the phenomena that have generated the data, often with the goal of testing different hypotheses about those phenomena. Data mining seeks to find patterns in the data that are understandable by people. Psychological studies of human learning aspire to understand the mechanisms underlying the various learning behaviors exhibited by people (concept learning, skill acquisition, strategy change, etc.).

Survey of Wireless Indoor Positioning Techniques and Systems

Abstract: Wireless indoor positioning systems have become very popular in recent years. These systems have been successfully used in many applications such as asset tracking and inventory management. This paper provides an overview of the existing wireless indoor positioning solutions and attempts to classify different techniques and systems. Three typical location estimation schemes of triangulation, scene analysis, and proximity are analyzed. We also discuss location fingerprinting in detail since it is used in most current system or solutions. We then examine a set of properties by which location systems are evaluated, and apply this evaluation method to survey a number of existing systems. Comprehensive performance comparisons including accuracy, precision, complexity, scalability, robustness, and cost are presented.

The Self-Organizing Map

Abstract: An overview of the self-organizing map algorithm, on which the papers in this issue are based, is presented in this article.