MicroPub Date : 2022-11-21DOI: 10.1109/CINTI-MACRo57952.2022.10029665
N. Kubota
{"title":"Multiscopic Topological Twin in Trailer Living Laboratory : Plenary Talk","authors":"N. Kubota","doi":"10.1109/CINTI-MACRo57952.2022.10029665","DOIUrl":"https://doi.org/10.1109/CINTI-MACRo57952.2022.10029665","url":null,"abstract":"Recently Cyber-Physical Systems, Digital Transformation, and Digital Twin have been discussed towards the digitalization of service to people thanks to the integration of information, intelligence, communication, and robot technologies. topological structure is useful to extract features from given or measured big data and to simulate a real-world phenomenon in such a cyber world. Therefore, we proposed the concept of topological twin. The aim of topological twin is to (1) extract topological structures hidden implicitly in the real world, (2) reproduce them explicitly in the cyber world, and (3) simulate and analyze the real world in the cyber world. The topological twin plays the important role in extracting and connecting structures hidden in real world from the mutliscopic point of view. In this talk, we discuss the concept of topological twin for sophisticated service to people in order to bridge the cyber-physical gap from the multiscopic point of view. First, we discuss the role of trailer living laboratory as a new style of smart home in the future society. We can bring the trailer living laboratory to elderly houses, hospitals, and public spaces, and discuss the co-creation towards open innovation using daily life settings with multi-stakeholder approach. Next, we explain various types of topological mapping methods, unsupervised learning methods, and graph-based methods as the methodology of topological intelligence. One of them is Growing Neural Gas (GNG) that can dynamically change the topological structure composed of nodes and edges. We have proposed various types of methods based on multi-scale batch-learning GNG called Fast GNG. Next, we show the comparison result of Fast GNG with other methods. Furthermore, we show several experimental results of multiscopic topological twin in the trailer living laboratory. Finally, we discuss the future direction of researches on the multiscopic topological twin.","PeriodicalId":18535,"journal":{"name":"Micro","volume":"78 1","pages":"000011-000012"},"PeriodicalIF":0.0,"publicationDate":"2022-11-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91032434","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
MicroPub Date : 2022-11-21DOI: 10.1109/CINTI-MACRo57952.2022.10029628
J. Kántor, A. Gergely, R. Farmos, Norbert Hodgyai
{"title":"Poly(styrene-b-isobutylene-b-styrene) Triblock Copolymer Fiber Generation with Centrifugal Spinning, and its Potential Application in Oil Collection","authors":"J. Kántor, A. Gergely, R. Farmos, Norbert Hodgyai","doi":"10.1109/CINTI-MACRo57952.2022.10029628","DOIUrl":"https://doi.org/10.1109/CINTI-MACRo57952.2022.10029628","url":null,"abstract":"In this paper the creation of poly(styrene-b-isobutylene-b-styrene) triblock copolymer (SIBS) fiber creation with centrifugal spinning is discussed. The centrifugal spinning procedure was tested at various concentrations, rotation speeds, and needle inner diameters (ID). At the most stable condition of 25 wt% and ID = 0.55 mm needle, fibers with 4.75.3 $mu$m average diameter were acquired. Electrospinning of SIBS with polyethylene glycol was also carried out for the sake of comparison, which yielded beaded fibers at the given conditions. The productivity of centrifugal spinning was roughly two orders of magnitude higher than that of the electrospinning. The measured water contact angle on these fiber mats was 133-135°, demonstrating a highly hydrophobic property. Contact angle experiments with sunflower oil showed perfect wetting, highlighting the potential for SIBS fiber mats to be used in the separation of oil from water.","PeriodicalId":18535,"journal":{"name":"Micro","volume":"8 1","pages":"000077-000082"},"PeriodicalIF":0.0,"publicationDate":"2022-11-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84524653","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
MicroPub Date : 2022-11-21DOI: 10.1109/CINTI-MACRo57952.2022.10029500
M. Pop, O. Proștean, M. Micea
{"title":"Evaluation of the Use of an Intelligent System in the Calibration of a Refined Car-Following Model","authors":"M. Pop, O. Proștean, M. Micea","doi":"10.1109/CINTI-MACRo57952.2022.10029500","DOIUrl":"https://doi.org/10.1109/CINTI-MACRo57952.2022.10029500","url":null,"abstract":"This paper aims to extract the computational logic of a hybrid method for online calibration of car-following models and apply it to a refined car-following model that incorporates the behavior of vehicles moving on the adjacent traffic lanes. This calibration method combines the concept of Kalman filters with the Takag-Sugeno Fuzzy Inference System (T-S FIS). Furthermore, this paper analyzes the influence of the lane change behavior on the calibration process. The testing of the hybrid calibration method in the case of a refined car-following model uses real traffic data and it is followed by a discussion of the results based on day/night traffic behaviors.","PeriodicalId":18535,"journal":{"name":"Micro","volume":"47 1","pages":"000107-000112"},"PeriodicalIF":0.0,"publicationDate":"2022-11-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88494458","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
MicroPub Date : 2022-11-21DOI: 10.1109/cinti-macro57952.2022.10029437
J. Solymosi
{"title":"Structure and Randomness : Plenary Talk","authors":"J. Solymosi","doi":"10.1109/cinti-macro57952.2022.10029437","DOIUrl":"https://doi.org/10.1109/cinti-macro57952.2022.10029437","url":null,"abstract":"Probabilistic methods are very important and useful tools in many domains, from theoretical mathematics to applied engineering. In this — mostly mathematical — talk I will list several examples where randomness and quasirandomness helps to work with mathematical and physical structures. For example the key of data compression is taking smartly selected random samples from the data. Random variables are very useful, but extracting random bits is an “expensive” process. Purely random systems are relatively easy to work with. For example if a large graph is random, where the edges are selected independently at random with probability 1/2, then we know (almost) exactly the size of the largest complete and empty subgraph. On the other hand, constructing graphs with similarly small complete and empty subgraphs deterministically is a very difficult problem. Most systems we are working with are not random, but not completely deterministic either. To illustrate a general method let us suppose that a function y=f(x) is given. In order to work with it or to understand its behaviour, we would like to write it as f(x)=g(x) + h(x)+ r(x) where g(x) is very simple (like a step function), h(x) is a random function and r(x) is the error term which is hopefully small in the range we are working in. The talk is intended for a general audience, no advanced mathematical background is expected","PeriodicalId":18535,"journal":{"name":"Micro","volume":"77 1","pages":"1-2"},"PeriodicalIF":0.0,"publicationDate":"2022-11-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82255344","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
MicroPub Date : 2022-11-21DOI: 10.1109/CINTI-MACRo57952.2022.10029629
Katalin Ferencz, Erno Rigó
{"title":"Analysis of Network-based Data Collection Mechanisms Applicable in Securing Critical Infrastructures","authors":"Katalin Ferencz, Erno Rigó","doi":"10.1109/CINTI-MACRo57952.2022.10029629","DOIUrl":"https://doi.org/10.1109/CINTI-MACRo57952.2022.10029629","url":null,"abstract":"One of the important directions of the digital trends defining our everyday life is the integration of smart devices into our systems, so that thanks to this we can collect more and more detailed data and control certain units remotely or automatically. As a result, our systems, which until now only operated in an isolated environment, are now connected to external services, or even establish a network connection to the Internet. However, this can have serious and dangerous consequences, pronounced in the case of systems that are considered critical infrastructure, because the wider the network range achieved, the more vulnerabilities and security gap can appear in the systems. In this article, we will present some options for network-based data collection methods, as well as highlight their most important properties and their parameters, which are useful to consider when planning a network system.","PeriodicalId":18535,"journal":{"name":"Micro","volume":"19 1","pages":"000299-000304"},"PeriodicalIF":0.0,"publicationDate":"2022-11-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87253667","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
MicroPub Date : 2022-11-21DOI: 10.1109/CINTI-MACRo57952.2022.10029405
G. Simon
{"title":"Acoustic Moving Source Localization using Sparse Time Difference of Arrival Measurements","authors":"G. Simon","doi":"10.1109/CINTI-MACRo57952.2022.10029405","DOIUrl":"https://doi.org/10.1109/CINTI-MACRo57952.2022.10029405","url":null,"abstract":"Time difference of arrival (TDoA) measurements are common in distributed localization systems, where events are emitted by the tracked source and the detected arrival times at the sensors, deployed at known locations, are used to compute the source location. Since erroneous measurements are common, e.g. due to non-line-of-sight conditions, the sensor fusion must be robust against such outlier measurements. In this paper the consensus-based TDoA fusion, which was proven very successful in various acoustic localization systems, is extended for the case when the source is moving and the event detections at the sensors are not reliable, thus sparse. The derivation of the extended consensus function will be introduced, and the performance is illustrated through simulation examples, showing accuracy around 10cm in realistic scenarios.","PeriodicalId":18535,"journal":{"name":"Micro","volume":"62 1","pages":"000157-000162"},"PeriodicalIF":0.0,"publicationDate":"2022-11-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86794446","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
MicroPub Date : 2022-11-21DOI: 10.1109/CINTI-MACRo57952.2022.10029507
M. Roshanzamir, Mahdi Roshanzamir, Abdolreza Mirzaei, M. Darbandy, A. Shoeibi, R. Alizadehsani, F. Khozeimeh, A. Khosravi
{"title":"Automatic facial expression recognition in an image sequence using conditional random field","authors":"M. Roshanzamir, Mahdi Roshanzamir, Abdolreza Mirzaei, M. Darbandy, A. Shoeibi, R. Alizadehsani, F. Khozeimeh, A. Khosravi","doi":"10.1109/CINTI-MACRo57952.2022.10029507","DOIUrl":"https://doi.org/10.1109/CINTI-MACRo57952.2022.10029507","url":null,"abstract":"Facial expression recognition is one of the fields that nowadays has attracted the attention of many researchers. It is possible to automate facial expression recognition using artificial intelligence methods. This will be of great help to researchers, especially in areas such as psychology. Automatic facial recognition can be derived from a static image of facial expression, but a better and more efficient way to do this is through a sequence of images. In this paper, a new method is proposed to automatically detect facial expressions from a sequence of images. Each sequence of facial images begins with a face neutral state and ends with one of the six main emotions. Motion vectors are extracted from the sequence using optical flow algorithm. These vectors are then used to train the conditional random field and finally to automatically determine the emotion. In this paper, in addition to the basic conditional random field, the hidden dynamic conditional random field is also investigated. Additionally, the effect of changing some parameters of these algorithms such as different optimization methods has been investigated. Given that a facial expression is recognized during a sequence of images, random field-based methods can be used for efficient classification of facial expressions reaching accuracy (more than 90%) competitive with the best existing methods for facial expression recognition.","PeriodicalId":18535,"journal":{"name":"Micro","volume":"91 1","pages":"000271-000278"},"PeriodicalIF":0.0,"publicationDate":"2022-11-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80524977","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
MicroPub Date : 2022-11-21DOI: 10.1109/cinti-macro57952.2022.10029509
L. Kish
{"title":"Noise-based Logic versus Quantum Supremacy","authors":"L. Kish","doi":"10.1109/cinti-macro57952.2022.10029509","DOIUrl":"https://doi.org/10.1109/cinti-macro57952.2022.10029509","url":null,"abstract":"Quantum Supremacy is an expression coined to indicate that there are some hard computational problems that quantum computers can solve exponentially faster than a classical-physical Turing machine (that is, a digital computer). Noise-based Logic (NBL) is a deterministic computation scheme that utilizes a digital computer and a physical true random number generator (TRNG). Recently, several computational problems have been identified where NBL also deterministically offered an exponential speedup compared to a digital computer. In the case of phonebook search, at proper conditions, NBL can even be exponentially faster than Grover's quantum algorithm that offers only a polynomial speedup compared to a digital computer. The newest result is the implementation of the Deutsch-Jozsa problem in NBL. The Deutsch-Jozsa quantum algorithm was historically the first one that was able to offer quantum supremacy. NBL offers the same speedup class. Open philosophical questions emerge about the role of true randomness in the speedup.","PeriodicalId":18535,"journal":{"name":"Micro","volume":"32 1","pages":"000013-000014"},"PeriodicalIF":0.0,"publicationDate":"2022-11-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79523009","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
MicroPub Date : 2022-11-21DOI: 10.1109/CINTI-MACRo57952.2022.10029427
F. Aydemir, F. Basçiftçi
{"title":"Application of HATEOAS Principle in RESTful API Design","authors":"F. Aydemir, F. Basçiftçi","doi":"10.1109/CINTI-MACRo57952.2022.10029427","DOIUrl":"https://doi.org/10.1109/CINTI-MACRo57952.2022.10029427","url":null,"abstract":"Hypermedia as the Engine of Application State (HATEOAS) is a principle that has been built upon the term hypermedia to refer to a constraint on the Representational State Transfer (REST) application architecture. This principle distinguishes REST from other application architectures, such as Simple Object Access Protocol in a way that client applications (e.g., a web app or a mobile app) need no prior knowledge for interacting with a REST-based Application Programming Interface (API) beyond a generic understanding of its hypermedia. Ion is an intuitive JavaScript Object Notation-based hypermedia type for REST, which can help software developers realize the principle of HATEOAS in their API design with ease. The goal of the work that is described in this paper has been to practically demonstrate the use of Ion in practice to have a self-documented REST API. For this purpose, a C# library has been implemented to demonstrate the use of Ion in having a REST API with self-documentation.","PeriodicalId":18535,"journal":{"name":"Micro","volume":"1 1","pages":"000051-000056"},"PeriodicalIF":0.0,"publicationDate":"2022-11-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78508260","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}