Pub Date : 2024-11-11DOI: 10.23919/cje.2022.00.259
Xueqing Yan;Yongming Li;Sanjiang Li
The tile-based multiplayer game Mahjong is widely played in Asia and has also become increasingly popular worldwide. Face-to-face or online, each player begins with a hand of 13 tiles and players draw and discard tiles in turn until they complete a winning hand. An important notion in Mahjong is the deficiency number (a.k.a. shanten number in Japanese Mahjong) of a hand, which estimates how many tile changes are necessary to complete the hand into a winning hand. The deficiency number plays an essential role in major decision-making tasks such as selecting a tile to discard. This paper proposes a fast algorithm for computing the deficiency number of a Mahjong hand. Compared with the baseline algorithm, the new algorithm is usually 100 times faster and, more importantly, respects the agent's knowledge about available tiles. The algorithm can be used as a basic procedure in all Mahjong variants by both rule-based and machine learning-based Mahjong AI.
{"title":"A Fast Algorithm for Computing the Deficiency Number of a Mahjong Hand","authors":"Xueqing Yan;Yongming Li;Sanjiang Li","doi":"10.23919/cje.2022.00.259","DOIUrl":"https://doi.org/10.23919/cje.2022.00.259","url":null,"abstract":"The tile-based multiplayer game Mahjong is widely played in Asia and has also become increasingly popular worldwide. Face-to-face or online, each player begins with a hand of 13 tiles and players draw and discard tiles in turn until they complete a winning hand. An important notion in Mahjong is the deficiency number (a.k.a. shanten number in Japanese Mahjong) of a hand, which estimates how many tile changes are necessary to complete the hand into a winning hand. The deficiency number plays an essential role in major decision-making tasks such as selecting a tile to discard. This paper proposes a fast algorithm for computing the deficiency number of a Mahjong hand. Compared with the baseline algorithm, the new algorithm is usually 100 times faster and, more importantly, respects the agent's knowledge about available tiles. The algorithm can be used as a basic procedure in all Mahjong variants by both rule-based and machine learning-based Mahjong AI.","PeriodicalId":50701,"journal":{"name":"Chinese Journal of Electronics","volume":"33 6","pages":"1383-1398"},"PeriodicalIF":1.6,"publicationDate":"2024-11-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10748380","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142600143","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-11-11DOI: 10.23919/cje.2023.00.029
Jiwei Lian;Chun Geng;Xue Lu;Dazhi Ding
A wideband circularly polarized (CP) aperture-coupled metasurface antenna operating at millimeter-wave frequency spectrum in substrate-integrated waveguide (SIW) technology is proposed. The proposed metasurface antenna is composed of two substrates. The first substrate contains an end-shorted SIW section with a slot etched. The introduced metasurface is printed on the top of the second substrate. The metasurface is comprised of $3 times 3$ unit cells, each of which contains two interconnected patches and two parasitic patches. The working mechanism of the proposed metasurface antenna is illustrated in details. The proposed metasurface antenna has wide impedance bandwidth and axial ratio (AR) bandwidth, which are 66.7% and 40%, respectively. Using the proposed metasurface antenna, a $4 times 4$ CP metasurface antenna array with an impedance bandwidth of 24%, an AR bandwidth of 30%, and a peak gain of 18.7 dBic in simulation is developed in this paper for millimeter-wave applications.
{"title":"Wideband Circularly Polarized Substrate-Integrated Waveguide Aperture-Coupled Metasurface Antenna Array for Millimeter-Wave Applications","authors":"Jiwei Lian;Chun Geng;Xue Lu;Dazhi Ding","doi":"10.23919/cje.2023.00.029","DOIUrl":"https://doi.org/10.23919/cje.2023.00.029","url":null,"abstract":"A wideband circularly polarized (CP) aperture-coupled metasurface antenna operating at millimeter-wave frequency spectrum in substrate-integrated waveguide (SIW) technology is proposed. The proposed metasurface antenna is composed of two substrates. The first substrate contains an end-shorted SIW section with a slot etched. The introduced metasurface is printed on the top of the second substrate. The metasurface is comprised of \u0000<tex>$3 times 3$</tex>\u0000 unit cells, each of which contains two interconnected patches and two parasitic patches. The working mechanism of the proposed metasurface antenna is illustrated in details. The proposed metasurface antenna has wide impedance bandwidth and axial ratio (AR) bandwidth, which are 66.7% and 40%, respectively. Using the proposed metasurface antenna, a \u0000<tex>$4 times 4$</tex>\u0000 CP metasurface antenna array with an impedance bandwidth of 24%, an AR bandwidth of 30%, and a peak gain of 18.7 dBic in simulation is developed in this paper for millimeter-wave applications.","PeriodicalId":50701,"journal":{"name":"Chinese Journal of Electronics","volume":"33 6","pages":"1468-1477"},"PeriodicalIF":1.6,"publicationDate":"2024-11-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10748535","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142600177","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-11-11DOI: 10.23919/cje.2022.00.253
Guodong Qin;Xiangxi Meng;Tao Wen;Baigen Cai
With the rapid development of railway transportation, virtual coupling (VC) has become a popular research topic. VC can greatly reduce tracking distance and increase the line capacity. Under VC control, the train formation control not only considers the behavior and speed adjustment strategy of the leader train but also the communication delays between trains. The quality of data communication between trains is an important aspect of train tracking control. We consider a virtually coupled train set (VCTS) as a multi-agent system. The Luenberger observer is introduced to estimate the real-time state of the train, based on the estimation, the train control consistency protocol is designed to account for communication delays. The stability of the error system is proven by constructing a Lyapunov function. The consistency of the coordinated train control is verified through simulation.
{"title":"Virtual Coupling Trains Based on Multi-Agent System Under Communication Delay","authors":"Guodong Qin;Xiangxi Meng;Tao Wen;Baigen Cai","doi":"10.23919/cje.2022.00.253","DOIUrl":"https://doi.org/10.23919/cje.2022.00.253","url":null,"abstract":"With the rapid development of railway transportation, virtual coupling (VC) has become a popular research topic. VC can greatly reduce tracking distance and increase the line capacity. Under VC control, the train formation control not only considers the behavior and speed adjustment strategy of the leader train but also the communication delays between trains. The quality of data communication between trains is an important aspect of train tracking control. We consider a virtually coupled train set (VCTS) as a multi-agent system. The Luenberger observer is introduced to estimate the real-time state of the train, based on the estimation, the train control consistency protocol is designed to account for communication delays. The stability of the error system is proven by constructing a Lyapunov function. The consistency of the coordinated train control is verified through simulation.","PeriodicalId":50701,"journal":{"name":"Chinese Journal of Electronics","volume":"33 6","pages":"1545-1554"},"PeriodicalIF":1.6,"publicationDate":"2024-11-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10748546","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142600138","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Offline reinforcement learning (RL) has gathered increasing attention in recent years, which seeks to learn policies from static datasets without active online exploration. However, the existing offline RL approaches often require a large amount of pre-collected data and hence are hardly implemented by a single agent in practice. Inspired by the advancement of federated learning (FL), this paper studies federated offline reinforcement learning (FORL), whereby multiple agents collaboratively carry out offline policy learning with no need to share their raw trajectories. Clearly, a straightforward solution is to simply retrofit the off-the-shelf offline RL methods for FL, whereas such an approach easily overfits individual datasets during local updating, leading to instability and subpar performance. To overcome this challenge, we propose a new FORL algorithm, named model-free (MF)-FORL, that exploits novel “proximal local policy evaluation” to judiciously push up action values beyond local data support, enabling agents to capture the individual information without forgetting the aggregated knowledge. Further, we introduce a model-based variant, MB-FORL, capable of improving the generalization ability and computational efficiency via utilizing a learned dynamics model. We evaluate the proposed algorithms on a suite of complex and high-dimensional offline RL benchmarks, and the results demonstrate significant performance gains over the baselines.
{"title":"Federated Offline Reinforcement Learning with Proximal Policy Evaluation","authors":"Sheng Yue;Yongheng Deng;Guanbo Wang;Ju Ren;Yaoxue Zhang","doi":"10.23919/cje.2023.00.288","DOIUrl":"https://doi.org/10.23919/cje.2023.00.288","url":null,"abstract":"Offline reinforcement learning (RL) has gathered increasing attention in recent years, which seeks to learn policies from static datasets without active online exploration. However, the existing offline RL approaches often require a large amount of pre-collected data and hence are hardly implemented by a single agent in practice. Inspired by the advancement of federated learning (FL), this paper studies federated offline reinforcement learning (FORL), whereby multiple agents collaboratively carry out offline policy learning with no need to share their raw trajectories. Clearly, a straightforward solution is to simply retrofit the off-the-shelf offline RL methods for FL, whereas such an approach easily overfits individual datasets during local updating, leading to instability and subpar performance. To overcome this challenge, we propose a new FORL algorithm, named model-free (MF)-FORL, that exploits novel “proximal local policy evaluation” to judiciously push up action values beyond local data support, enabling agents to capture the individual information without forgetting the aggregated knowledge. Further, we introduce a model-based variant, MB-FORL, capable of improving the generalization ability and computational efficiency via utilizing a learned dynamics model. We evaluate the proposed algorithms on a suite of complex and high-dimensional offline RL benchmarks, and the results demonstrate significant performance gains over the baselines.","PeriodicalId":50701,"journal":{"name":"Chinese Journal of Electronics","volume":"33 6","pages":"1360-1372"},"PeriodicalIF":1.6,"publicationDate":"2024-11-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10748547","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142600180","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-11-11DOI: 10.23919/cje.2021.00.333
Wuniu Liu;Junmei Wang;Qing He;Yongming Li
Model checking computation tree logic based on multi-valued possibility measures has been studied by Li et al. on Information Sciences in 2019. However, the previous work did not consider the nondeterministic choices inherent in systems represented by multi-valued Kripke structures (MvKSs). This nondeterminism is crucial for accurate system modeling, decision making, and control capabilities. To address this limitation, we draw inspiration from the generalization of Markov chains to Markov decision processes in probabilistic systems. By integrating nondeterminism into MvKS, we introduce multi-valued decision processes (MvDPs) as a framework for modeling MvKSs with nondeterministic choices. We investigate the problems of model checking over MvDPs. Verifying properties are expressed by using multi-valued computation tree logic based on schedulers. Our primary objective is to leverage fixpoint techniques to determine the maximum and minimum possibilities of the system satisfying temporal properties. This allows us to identify the optimal or worst-case schedulers for decision making or control purposes. We aim to develop reduction techniques that enhance the efficiency of model checking, thereby reducing the associated time complexity. We mathematically demonstrate three reduction techniques that improve model checking performance in most scenarios.
{"title":"Model Checking Computation Tree Logic Over Multi-Valued Decision Processes and Its Reduction Techniques","authors":"Wuniu Liu;Junmei Wang;Qing He;Yongming Li","doi":"10.23919/cje.2021.00.333","DOIUrl":"https://doi.org/10.23919/cje.2021.00.333","url":null,"abstract":"Model checking computation tree logic based on multi-valued possibility measures has been studied by Li et al. on Information Sciences in 2019. However, the previous work did not consider the nondeterministic choices inherent in systems represented by multi-valued Kripke structures (MvKSs). This nondeterminism is crucial for accurate system modeling, decision making, and control capabilities. To address this limitation, we draw inspiration from the generalization of Markov chains to Markov decision processes in probabilistic systems. By integrating nondeterminism into MvKS, we introduce multi-valued decision processes (MvDPs) as a framework for modeling MvKSs with nondeterministic choices. We investigate the problems of model checking over MvDPs. Verifying properties are expressed by using multi-valued computation tree logic based on schedulers. Our primary objective is to leverage fixpoint techniques to determine the maximum and minimum possibilities of the system satisfying temporal properties. This allows us to identify the optimal or worst-case schedulers for decision making or control purposes. We aim to develop reduction techniques that enhance the efficiency of model checking, thereby reducing the associated time complexity. We mathematically demonstrate three reduction techniques that improve model checking performance in most scenarios.","PeriodicalId":50701,"journal":{"name":"Chinese Journal of Electronics","volume":"33 6","pages":"1399-1411"},"PeriodicalIF":1.6,"publicationDate":"2024-11-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10748381","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142600139","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
A novel design approach to wideband, dual-mode resonant monopole antenna with stable, enhanced backfire gain is advanced. The sectorial monopole evolves from a linear, 0.75-wavelength electric prototype monopole under wideband dual-mode resonant operation. As theoretically predicted by the two resonant modes $text{TE}_{3/5,1}$ and $text{TE}_{9/5,1}$ within a 150° radiator, the operation principle is revealed at first. As have been numerically demonstrated and experimentally validated at 2.4-GHz band, the designed antenna exhibits a wide impedance bandwidth over 90.1% (i.e., 2.06–5.44 GHz), in which the stable gain bandwidth in the backfire, $-x-text{direction}(theta=90^{circ}, varphi=180^{circ})$ with peak value of 3.2 dBi and fluctuation less than 3 dB is up to 45.3% (i.e., 3.74–5.44 GHz). It is concluded that the stable wideband backfire gain frequency response should be owing to the high-order resonant mode in the unique sectorial monopole antennas.
{"title":"Dual-Mode Resonant Sectorial Monopole Antenna with Stable Backfire Gain","authors":"Feiyan Ji;Heng Zhang;Xiuqiong Xing;Wenjun Lu;Lei Zhu","doi":"10.23919/cje.2023.00.032","DOIUrl":"https://doi.org/10.23919/cje.2023.00.032","url":null,"abstract":"A novel design approach to wideband, dual-mode resonant monopole antenna with stable, enhanced backfire gain is advanced. The sectorial monopole evolves from a linear, 0.75-wavelength electric prototype monopole under wideband dual-mode resonant operation. As theoretically predicted by the two resonant modes \u0000<tex>$text{TE}_{3/5,1}$</tex>\u0000 and \u0000<tex>$text{TE}_{9/5,1}$</tex>\u0000 within a 150° radiator, the operation principle is revealed at first. As have been numerically demonstrated and experimentally validated at 2.4-GHz band, the designed antenna exhibits a wide impedance bandwidth over 90.1% (i.e., 2.06–5.44 GHz), in which the stable gain bandwidth in the backfire, \u0000<tex>$-x-text{direction}(theta=90^{circ}, varphi=180^{circ})$</tex>\u0000 with peak value of 3.2 dBi and fluctuation less than 3 dB is up to 45.3% (i.e., 3.74–5.44 GHz). It is concluded that the stable wideband backfire gain frequency response should be owing to the high-order resonant mode in the unique sectorial monopole antennas.","PeriodicalId":50701,"journal":{"name":"Chinese Journal of Electronics","volume":"33 6","pages":"1478-1486"},"PeriodicalIF":1.6,"publicationDate":"2024-11-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10748539","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142600193","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-11-11DOI: 10.23919/cje.2021.00.369
Xiangbin Yu;Mingfeng Xie;Ning Li;Cuimin Pan
In this paper, by introducing the spatial modulation (SM) scheme into the unmanned aerial vehicle (UAV) relaying system, an SM-aided UAV (SM-UAV) cooperative relay network is presented. The performance of the SM-UAV relay network is investigated over $text{Nakagami}-m$ fading channels, where the UAV remains stationary over a given area. According to the performance analysis, using the amplify-and-forward (AF) protocol, the effective signal-to-noise ratio (SNR) and the corresponding probability density function and moment generating function are, respectively, derived. With these results, the average bit error rate (BER) is further deduced, and resultant approximate closed-form expression is achieved. Based on the approximate BER, we derive the asymptotic BER to characterize the error performance of the system at high SNR. With this asymptotic BER, the diversity gain of the system is derived, and the resulting diversity order is attained. Simulation results illustrate the effectiveness of the performance analysis. Namely, approximate BER has the value close to the simulated one, and asymptotic BER can match the corresponding simulation well at high SNR. Thus, the BER performance of the system can be effectively assessed in theory, and conventional simulation will be avoided. Besides, the impacts of the antenna number, modulation order, fading parameter, and UAV position on the system performance are also analyzed. The results indicate that the BER performance is increased with the increases of Nakagami parameter $m$ and/or receive antenna and/or the decrease of modulation order.
本文通过将空间调制（SM）方案引入无人机（UAV）中继系统，提出了一种 SM 辅助无人机（SM-UAV）合作中继网络。研究了在$text{Nakagami}-m$衰落信道上 SM-UAV 中继网络的性能，其中无人机在给定区域内保持静止。根据性能分析，利用放大-前向（AF）协议，分别得出了有效信噪比（SNR）以及相应的概率密度函数和矩生函数。根据这些结果，进一步推导出平均误码率 (BER)，并得到近似闭式表达式。在近似误码率的基础上，我们推导出了渐近误码率，以描述系统在高信噪比下的误码性能。有了这个渐近误码率，就可以推导出系统的分集增益，并由此得到分集阶。仿真结果表明了性能分析的有效性。也就是说，近似误码率的值接近于模拟值，而渐近误码率在高信噪比时能很好地与相应的模拟值匹配。因此，可以从理论上有效评估系统的误码率性能，避免了传统的模拟。此外，还分析了天线数量、调制阶数、衰减参数和无人机位置对系统性能的影响。结果表明，误码率随中上参数 $m$ 和/或接收天线的增加和/或调制阶数的减少而增加。
{"title":"Performance Analysis of Spatial Modulation Aided UAV Communication Systems in Cooperative Relay Networks","authors":"Xiangbin Yu;Mingfeng Xie;Ning Li;Cuimin Pan","doi":"10.23919/cje.2021.00.369","DOIUrl":"https://doi.org/10.23919/cje.2021.00.369","url":null,"abstract":"In this paper, by introducing the spatial modulation (SM) scheme into the unmanned aerial vehicle (UAV) relaying system, an SM-aided UAV (SM-UAV) cooperative relay network is presented. The performance of the SM-UAV relay network is investigated over \u0000<tex>$text{Nakagami}-m$</tex>\u0000 fading channels, where the UAV remains stationary over a given area. According to the performance analysis, using the amplify-and-forward (AF) protocol, the effective signal-to-noise ratio (SNR) and the corresponding probability density function and moment generating function are, respectively, derived. With these results, the average bit error rate (BER) is further deduced, and resultant approximate closed-form expression is achieved. Based on the approximate BER, we derive the asymptotic BER to characterize the error performance of the system at high SNR. With this asymptotic BER, the diversity gain of the system is derived, and the resulting diversity order is attained. Simulation results illustrate the effectiveness of the performance analysis. Namely, approximate BER has the value close to the simulated one, and asymptotic BER can match the corresponding simulation well at high SNR. Thus, the BER performance of the system can be effectively assessed in theory, and conventional simulation will be avoided. Besides, the impacts of the antenna number, modulation order, fading parameter, and UAV position on the system performance are also analyzed. The results indicate that the BER performance is increased with the increases of Nakagami parameter \u0000<tex>$m$</tex>\u0000 and/or receive antenna and/or the decrease of modulation order.","PeriodicalId":50701,"journal":{"name":"Chinese Journal of Electronics","volume":"33 6","pages":"1492-1503"},"PeriodicalIF":1.6,"publicationDate":"2024-11-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10748544","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142600380","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-11-11DOI: 10.23919/cje.2022.00.385
Zhiqiang Fu;Yao Zhao;Dongxia Chang;Yiming Wang
The subspace clustering has been addressed by learning the block-diagonal self-expressive matrix. This block-diagonal structure heavily affects the accuracy of clustering but is rather challenging to obtain. A novel and effective subspace clustering model, i.e., subspace clustering via block-diagonal decomposition (SCBD), is proposed, which can simultaneously capture the block-diagonal structure and gain the clustering result. In our model, a strict block-diagonal decomposition is introduced to directly pursue the $k$ block-diagonal structure corresponding to $k$ clusters. In this novel decomposition, the self-expressive matrix is decomposed into the block indicator matrix to demonstrate the cluster each sample belongs to. Based on the strict block-diagonal decomposition, the block-diagonal shift is proposed to capture the local intra-cluster structure, which shifts the samples in the same cluster to get smaller distances and results in more discriminative features for clustering. Extensive experimental results on synthetic and real databases demonstrate the superiority of SCBD over other state-of-the-art methods.
{"title":"Subspace Clustering via Block-Diagonal Decomposition","authors":"Zhiqiang Fu;Yao Zhao;Dongxia Chang;Yiming Wang","doi":"10.23919/cje.2022.00.385","DOIUrl":"https://doi.org/10.23919/cje.2022.00.385","url":null,"abstract":"The subspace clustering has been addressed by learning the block-diagonal self-expressive matrix. This block-diagonal structure heavily affects the accuracy of clustering but is rather challenging to obtain. A novel and effective subspace clustering model, i.e., subspace clustering via block-diagonal decomposition (SCBD), is proposed, which can simultaneously capture the block-diagonal structure and gain the clustering result. In our model, a strict block-diagonal decomposition is introduced to directly pursue the \u0000<tex>$k$</tex>\u0000 block-diagonal structure corresponding to \u0000<tex>$k$</tex>\u0000 clusters. In this novel decomposition, the self-expressive matrix is decomposed into the block indicator matrix to demonstrate the cluster each sample belongs to. Based on the strict block-diagonal decomposition, the block-diagonal shift is proposed to capture the local intra-cluster structure, which shifts the samples in the same cluster to get smaller distances and results in more discriminative features for clustering. Extensive experimental results on synthetic and real databases demonstrate the superiority of SCBD over other state-of-the-art methods.","PeriodicalId":50701,"journal":{"name":"Chinese Journal of Electronics","volume":"33 6","pages":"1373-1382"},"PeriodicalIF":1.6,"publicationDate":"2024-11-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10748550","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142600141","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-11-11DOI: 10.23919/cje.2022.00.257
Zhiwei Wang;Qiuchi Zhu;Zhenqi Zhang
The WiFi fingerprint-based localization method is considered one of the most popular techniques for indoor localization. In INFOCOM'14, Li et al. proposed a wireless fidelity (WiFi) fingerprint localization system based on Paillier encryption, which is claimed to protect both client $C{{}^{prime}mathrm{s}}$ location privacy and service provider $S{{}^{prime}mathrm{s}}$ database privacy. However, Yang et al. presented a practical data privacy attack in INFOCOM'18, which allows a polynomial time attacker to obtain $S{{}^{prime}mathrm{s}}$ database. We propose a novel WiFi fingerprint localization system based on Castagnos-Laguillaumie (CL) encryption, which has a trustless setup and is efficient due to the excellent properties of CL encryption. To prevent Yang et al.'s attack, the system requires that $S$ selects only the locations from its database that can receive the nonzero signals from all the available access points in $C{{}^{prime}mathrm{s}}$ nonzero fingerprint in order to determine $C{{}^{prime}mathrm{s}}$ location. Security analysis shows that our scheme is secure under Li et al.'s threat model. Furthermore, to enhance the security level of privacy-preserving WiFi fingerprint localization scheme based on CL encryption, we propose a secure and efficient zero-knowledge proof protocol for the discrete logarithm relations in $C{{}^{prime}mathrm{s}}$ encrypted localization queries.
基于 WiFi 指纹的定位方法被认为是最流行的室内定位技术之一。在INFOCOM'14中，Li等人提出了一种基于Paillier加密的无线保真（WiFi）指纹定位系统，声称该系统既能保护客户端的$C{{}^{prime}mathrm{s}}$位置隐私，又能保护服务提供商的$S{{}^{prime}mathrm{s}}$数据库隐私。然而，Yang 等人在 INFOCOM'18 中提出了一种实用的数据隐私攻击，它允许多项式时间攻击者获取 $S{{}^{prime}mathrm{s}}$ 数据库。我们提出了一种基于Castagnos-Laguillaumie（CL）加密技术的新型WiFi指纹定位系统，由于CL加密技术的优异特性，该系统具有无信任设置和高效的特点。为了防止Yang等人的攻击，系统要求$S$只从数据库中选择能接收到$C{{}^{prime}mathrm{s}}$非零指纹中所有可用接入点非零信号的位置，以确定$C{{}^{prime}mathrm{s}}$位置。安全分析表明，我们的方案在 Li 等人的威胁模型下是安全的。此外，为了提高基于CL加密的隐私保护WiFi指纹定位方案的安全等级，我们针对$C{{}^{prime}mathrm{s}}$加密定位查询中的离散对数关系提出了一种安全高效的零知识证明协议。
{"title":"Enhanced Privacy-Preserving WiFi Fingerprint Localization from CL Encryption","authors":"Zhiwei Wang;Qiuchi Zhu;Zhenqi Zhang","doi":"10.23919/cje.2022.00.257","DOIUrl":"https://doi.org/10.23919/cje.2022.00.257","url":null,"abstract":"The WiFi fingerprint-based localization method is considered one of the most popular techniques for indoor localization. In INFOCOM'14, Li et al. proposed a wireless fidelity (WiFi) fingerprint localization system based on Paillier encryption, which is claimed to protect both client \u0000<tex>$C{{}^{prime}mathrm{s}}$</tex>\u0000 location privacy and service provider \u0000<tex>$S{{}^{prime}mathrm{s}}$</tex>\u0000 database privacy. However, Yang et al. presented a practical data privacy attack in INFOCOM'18, which allows a polynomial time attacker to obtain \u0000<tex>$S{{}^{prime}mathrm{s}}$</tex>\u0000 database. We propose a novel WiFi fingerprint localization system based on Castagnos-Laguillaumie (CL) encryption, which has a trustless setup and is efficient due to the excellent properties of CL encryption. To prevent Yang et al.'s attack, the system requires that \u0000<tex>$S$</tex>\u0000 selects only the locations from its database that can receive the nonzero signals from all the available access points in \u0000<tex>$C{{}^{prime}mathrm{s}}$</tex>\u0000 nonzero fingerprint in order to determine \u0000<tex>$C{{}^{prime}mathrm{s}}$</tex>\u0000 location. Security analysis shows that our scheme is secure under Li et al.'s threat model. Furthermore, to enhance the security level of privacy-preserving WiFi fingerprint localization scheme based on CL encryption, we propose a secure and efficient zero-knowledge proof protocol for the discrete logarithm relations in \u0000<tex>$C{{}^{prime}mathrm{s}}$</tex>\u0000 encrypted localization queries.","PeriodicalId":50701,"journal":{"name":"Chinese Journal of Electronics","volume":"33 6","pages":"1435-1446"},"PeriodicalIF":1.6,"publicationDate":"2024-11-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10748541","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142600175","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-11-11DOI: 10.23919/cje.2022.00.042
Fang Wang;Xinjian Zhang;Xin Chen;Shuying Lyu;Congzhou Chen;Xiaolong Shi
The slow development of traditional computing has prompted the search for new materials to replace silicon-based computers. Bio-computers, which use molecules as the basis of computation, are highly parallel and information capable, attracting a lot of attention. In this study, we designed a NAND logic gate based on the DNA strand displacement mechanism. We assembled a molecular calculation model, a 4-wire-2-wire priority encoder logic circuit, by cascading the proposed NAND gates. Different concentrations of input DNA chains were added into the system, resulting in corresponding output, through DNA hybridization and strand displacement. Therefore, it achieved the function of a priority encoder. Simulation results verify the effectiveness and accuracy of the molecular NAND logic gate and the priority coding system presented in this study. The unique point of this proposed circuit is that we cascaded only one kind of logic gate, which provides a beneficial exploration for the subsequent development of complex DNA cascade circuits and the realization of the logical coding function of information.
传统计算机发展缓慢，促使人们寻找新材料来替代硅基计算机。以分子为计算基础的生物计算机具有高度的并行性和信息能力，备受关注。在这项研究中，我们设计了一种基于 DNA 链位移机制的 NAND 逻辑门。通过级联所提出的 NAND 逻辑门，我们组装了一个分子计算模型--4 线-2 线优先编码器逻辑电路。将不同浓度的输入 DNA 链加入系统中，通过 DNA 杂交和链位移产生相应的输出。因此，它实现了优先编码器的功能。仿真结果验证了本研究提出的分子 NAND 逻辑门和优先编码系统的有效性和准确性。该电路的独特之处在于只级联了一种逻辑门，这为后续开发复杂的 DNA 级联电路、实现信息的逻辑编码功能提供了有益的探索。
{"title":"Priority Encoder Based on DNA Strand Displacement","authors":"Fang Wang;Xinjian Zhang;Xin Chen;Shuying Lyu;Congzhou Chen;Xiaolong Shi","doi":"10.23919/cje.2022.00.042","DOIUrl":"https://doi.org/10.23919/cje.2022.00.042","url":null,"abstract":"The slow development of traditional computing has prompted the search for new materials to replace silicon-based computers. Bio-computers, which use molecules as the basis of computation, are highly parallel and information capable, attracting a lot of attention. In this study, we designed a NAND logic gate based on the DNA strand displacement mechanism. We assembled a molecular calculation model, a 4-wire-2-wire priority encoder logic circuit, by cascading the proposed NAND gates. Different concentrations of input DNA chains were added into the system, resulting in corresponding output, through DNA hybridization and strand displacement. Therefore, it achieved the function of a priority encoder. Simulation results verify the effectiveness and accuracy of the molecular NAND logic gate and the priority coding system presented in this study. The unique point of this proposed circuit is that we cascaded only one kind of logic gate, which provides a beneficial exploration for the subsequent development of complex DNA cascade circuits and the realization of the logical coding function of information.","PeriodicalId":50701,"journal":{"name":"Chinese Journal of Electronics","volume":"33 6","pages":"1538-1544"},"PeriodicalIF":1.6,"publicationDate":"2024-11-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10748548","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142600351","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：