arXiv subjects

Shunsuke Shimizu

Publications and source records attributed to Shunsuke Shimizu.

3 recordsLinked to original sources

arXiv2024

Device-free Indoor WLAN Localization with Distributed Antenna Placement Optimization and Spatially Localized Regression

Wireless sensing is a promising technology for future wireless communication networks to realize various application services. Wireless local area network (WLAN)-based localization approaches using channel state information (CSI) have been investigated intensively. Further improvements in detection performance will depend on selecting appropriate feature information and determining the placements of distributed antenna elements. This paper presents a proposal of an enhanced device-free WLAN-based localization scheme with beam-tracing based antenna placement optimization and spatially localized regression, where beam-forming weights (BFWs) are used as feature information for training machine-learning (ML)-based models localized to partitioned areas. By this scheme, the antenna placement at the access point (AP) is determined by solving a combinational optimization problem with beam-tracing between AP and station (STA) without knowing the CSI. Additionally, we propose the use of localized regression to improve localization accuracy with low complexity, where classification and regression based ML models are used for coarse and precise estimations of the target position. We evaluate the proposed scheme effects on localization performance in an indoor environment. Experiment results demonstrate that the proposed antenna placement and localized regression scheme improve the localization accuracy while reducing the required complexity for both off-line training and on-line localization relative to other reference schemes.

eess.SP↗

arXiv2016

Coalgebraic Trace Semantics for Buechi and Parity Automata

Despite its success in producing numerous general results on state-based dynamics, the theory of coalgebra has struggled to accommodate the Buechi acceptance condition---a basic notion in the theory of automata for infinite words or trees. In this paper we present a clean answer to the question that builds on the "maximality" characterization of infinite traces (by Jacobs and Cirstea): the accepted language of a Buechi automaton is characterized by two commuting diagrams, one for a least homomorphism and the other for a greatest, much like in a system of (least and greatest) fixed-point equations. This characterization works uniformly for the nondeterministic branching and the probabilistic one; and for words and trees alike. We present our results in terms of the parity acceptance condition that generalizes Buechi's.

cs.LO↗

arXiv2016

Lattice-Theoretic Progress Measures and Coalgebraic Model Checking (with Appendices)

In the context of formal verification in general and model checking in particular, parity games serve as a mighty vehicle: many problems are encoded as parity games, which are then solved by the seminal algorithm by Jurdzinski. In this paper we identify the essence of this workflow to be the notion of progress measure, and formalize it in general, possibly infinitary, lattice-theoretic terms. Our view on progress measures is that they are to nested/alternating fixed points what invariants are to safety/greatest fixed points, and what ranking functions are to liveness/least fixed points. That is, progress measures are combination of the latter two notions (invariant and ranking function) that have been extensively studied in the context of (program) verification. We then apply our theory of progress measures to a general model-checking framework, where systems are categorically presented as coalgebras. The framework's theoretical robustness is witnessed by a smooth transfer from the branching-time setting to the linear-time one. Although the framework can be used to derive some decision procedures for finite settings, we also expect the proposed framework to form a basis for sound proof methods for some undecidable/infinitary problems.

cs.LO↗