Embedded Platform Development for LoRaWAN End Node Device

2021 ◽  
Vol 19 (10) ◽  
pp. 37-43
Author(s):  
Sung-Mun Park ◽  
Joon-Young Choi
2017 ◽  
Vol 6 (1) ◽  
pp. 10
Author(s):  
SHREEKANTH T. ◽  
SOWRABHU D ◽  
◽  

2019 ◽  
Vol 53 (5) ◽  
pp. 1763-1773
Author(s):  
Meziane Aider ◽  
Lamia Aoudia ◽  
Mourad Baïou ◽  
A. Ridha Mahjoub ◽  
Viet Hung Nguyen

Let G = (V, E) be an undirected graph where the edges in E have non-negative weights. A star in G is either a single node of G or a subgraph of G where all the edges share one common end-node. A star forest is a collection of vertex-disjoint stars in G. The weight of a star forest is the sum of the weights of its edges. This paper deals with the problem of finding a Maximum Weight Spanning Star Forest (MWSFP) in G. This problem is NP-hard but can be solved in polynomial time when G is a cactus [Nguyen, Discrete Math. Algorithms App. 7 (2015) 1550018]. In this paper, we present a polyhedral investigation of the MWSFP. More precisely, we study the facial structure of the star forest polytope, denoted by SFP(G), which is the convex hull of the incidence vectors of the star forests of G. First, we prove several basic properties of SFP(G) and propose an integer programming formulation for MWSFP. Then, we give a class of facet-defining inequalities, called M-tree inequalities, for SFP(G). We show that for the case when G is a tree, the M-tree and the nonnegativity inequalities give a complete characterization of SFP(G). Finally, based on the description of the dominating set polytope on cycles given by Bouchakour et al. [Eur. J. Combin. 29 (2008) 652–661], we give a complete linear description of SFP(G) when G is a cycle.


Sensors ◽  
2021 ◽  
Vol 21 (12) ◽  
pp. 3961
Author(s):  
Daniela De Venuto ◽  
Giovanni Mezzina

In this paper, we propose a breakthrough single-trial P300 detector that maximizes the information translate rate (ITR) of the brain–computer interface (BCI), keeping high recognition accuracy performance. The architecture, designed to improve the portability of the algorithm, demonstrated full implementability on a dedicated embedded platform. The proposed P300 detector is based on the combination of a novel pre-processing stage based on the EEG signals symbolization and an autoencoded convolutional neural network (CNN). The proposed system acquires data from only six EEG channels; thus, it treats them with a low-complexity preprocessing stage including baseline correction, windsorizing and symbolization. The symbolized EEG signals are then sent to an autoencoder model to emphasize those temporal features that can be meaningful for the following CNN stage. This latter consists of a seven-layer CNN, including a 1D convolutional layer and three dense ones. Two datasets have been analyzed to assess the algorithm performance: one from a P300 speller application in BCI competition III data and one from self-collected data during a fluid prototype car driving experiment. Experimental results on the P300 speller dataset showed that the proposed method achieves an average ITR (on two subjects) of 16.83 bits/min, outperforming by +5.75 bits/min the state-of-the-art for this parameter. Jointly with the speed increase, the recognition performance returned disruptive results in terms of the harmonic mean of precision and recall (F1-Score), which achieve 51.78 ± 6.24%. The same method used in the prototype car driving led to an ITR of ~33 bit/min with an F1-Score of 70.00% in a single-trial P300 detection context, allowing fluid usage of the BCI for driving purposes. The realized network has been validated on an STM32L4 microcontroller target, for complexity and implementation assessment. The implementation showed an overall resource occupation of 5.57% of the total available ROM, ~3% of the available RAM, requiring less than 3.5 ms to provide the classification outcome.


Author(s):  
Christoph Rieger ◽  
Daniel Lucrédio ◽  
Renata Pontin M. Fortes ◽  
Herbert Kuchen ◽  
Felipe Dias ◽  
...  

Author(s):  
Marvin Drewel ◽  
Leon Özcan ◽  
Jürgen Gausemeier ◽  
Roman Dumitrescu

AbstractHardly any other area has as much disruptive potential as digital platforms in the course of digitalization. After serious changes have already taken place in the B2C sector with platforms such as Amazon and Airbnb, the B2B sector is on the threshold to the so-called platform economy. In mechanical engineering, pioneers like GE (PREDIX) and Claas (365FarmNet) are trying to get their hands on the act. This is hardly a promising option for small and medium-sized companies, as only a few large companies will survive. Small and medium-sized enterprises (SMEs) are already facing the threat of losing direct consumer contact and becoming exchangeable executers. In order to prevent this, it is important to anticipate at an early stage which strategic options exist for the future platform economy and which adjustments to the product program should already be initiated today. Basically, medium-sized companies in particular lack a strategy for an advantageous entry into the future platform economy.The paper presents different approaches to master the challenges of participating in the platform economy by using platform patterns. Platform patterns represent proven principles of already existing platforms. We show how we derived a catalogue with 37 identified platform patterns. The catalogue has a generic design and can be customized for a specific use case. The versatility of the catalogue is underlined by three possible applications: (1) platform ideation, (2) platform development, and (3) platform characterization.


Sign in / Sign up

Export Citation Format

Share Document