Reviewerly/exHarmony huggingface dataset:
Literature Metrology and Visualized Analysis Based on Face Recognition in Education Field

The application of face recognition in classroom teaching has a milestone significance, which opens a new model of teaching process monitoring, provides a new idea for education and teaching reform, and opens a new pattern of the integration of artificial intelligence and education. This paper studies the development trend and research hotspot of face recognition in the field of education through literature metrology and visualized analysis.
マルチスレッド高速アクティブカメラを用いたマルチユーザ共有型望遠鏡

This study proposes a new approach for multiple users to view the same area simultaneously using a dual-camera system that combines an ultra-high-speed active camera and a wide-angle camera. A tablet with an inclinometer installed is used to control each user’s line of sight. This allows users to manipulate the tablet in order to view the magnified area they wish to see while controlling an ultra-high-speed active camera with multi-threaded gaze control at hundreds of frames per second. This system is considered to be an unprecedented system because it allows multiple users to share information while looking at their own desired viewing points when watching something remotely, such as a surveillance system, factory inspection, or sports game. In the realtime experiment, we confirmed the accuracy of tablet operation when there were two users by comparing it with automatic control, and then confirmed the movement with five users.
上腕関連筋への振動刺激による前方リーチング動作錯覚の生成

In this study, we proposed a method to generate the illusion of arbitrary hand motions in daily life by generating vibration frequency patterns proportional to the angular velocity and angular acceleration of the shoulder and elbow joints associated with the target hand motion. To verify the effectiveness of the proposed method, the verification experiment to generate motion illusions of reaching forward and returning to the initial posture at a constant speed by integrating motion illusions of the shoulder and elbow joints was conducted. And the oscillation frequency pattern proportional to the angular acceleration is effective in generating the illusion of arbitrary hand motion was concluded.
Image Presentation Area for Improving Convenience in Remote Control Using VR

The purpose of this study is to improve the convenience of teleoperation of a small 4-wheeled robot. To this end, we employ a teleoperation technique using a handle-type controller and aim to confirm which angle improves the convenience of teleoperation when presenting a new image to the operator. After creating a virtual space and displaying images from an omnidirectional camera on a Virtual Reality Head Mounted Display, the small 4-wheeled robot is teleoperated using a handle-type controller. In the experiment, a virtual mirror was placed at five different angles on the virtual space calculated from the human viewing angle and the range of motion of the eyes, and compared the results.
吸着機構を備えた空気圧駆動の人型ロボットによるバドミントンの踏み出し動作の実現

In this research, we developed a humanoid robot with suction mechanisms to realize footwork in badminton. First, the investigation of the suction force of suckers showed that the stability of the robot had improved. By improving the stability, the robot was able to perform a large and quick-stepping motion that was not possible with existing robots. The width of the step was about 0.9m, and the horizontal velocity of the hip of the robot was about 1.1m/s. Compared to the human stepping motion, the speed of the robot’s stepping motion was inferior, but the width of the step was no inferior. In addition, the estimated ZMP during the stepping motion showed the effectiveness of suction mechanisms in the realization of badminton footwork.
表面筋電位を用いた動作分類

Elderly people account for nearly 70% of all electric wheelchair users, and this number is expected to increase in the future. In addition, the cognitive response speed of the elderly tends to be slower than that of younger people. We believe that increasing cognitive reaction time is a stepping stone to solving this problem. One of the methods is to predict the distance of paw movement before the start of a movement using electromyograms, which are one of the biological signals emitted before the start of a movement. In this paper, we demonstrate the possibility of using machine learning to identify the distance traveled by a fingertip using features based on myopotentials.
実践的な腹腔鏡手術訓練技量解析のための計測データ補正処理の検討と特徴量算出

This paper describes the details of the data correction method and feature extraction for skill evaluation of practical laparoscopic surgical training. To analyze the surgical dexterity in practical laparoscopic surgical training, the motion capture (MoCap) based measurement system have been developed, and measurement experiment in cadaver surgical tranining were conducted. However, the measured data contains noise and missing values, skill analysis is not possible without data correction. For this background, outlier removal method using Kalman filter and other threshold-based method were applied. Linear interpolation and Savitzky-Golay filter were also applied to the data. After the data correction, feature extraction was performed and some kinematic indices of the surgical instruments were successfully calculated.
段差乗り越え可能な車輪の開発および性能評価

At present, demand for wheelchair is increasing due to the aging population and the growing number of people with disabilities. However, conventional wheelchairs are unable to climb stairs because of the small size of their front wheels. In this study, we focused on the front wheel of the wheelchair and developed a mechanism where the wheel radius increases only when climbing stairs. The purpose of this mechanism is to maintain mobility and safety on flat surface, while reducing the impact on users when climbing stairs and achieving stable running.
Thrown under the bus : (or how memory-mapping CAU has compromised its side-channel security)

This paper looks into how unprotected bus transfers have created a power analysis side-channel in NXP Kinetis K82 Security microcontroller. Specifically, we look into their mmCAU coprocessor and its application of both AES encryption and decryption. We demonstrate that a design oversight in both hardware and the associated cryptographic library (firmware) have created a side channel that is exploitable with low-cost solutions such as ChipWhisperer.
Recognizing A Complex Human Behaviour with Zero Video Training Sample Base on Human Montion Data Encoding

Complex human behaviour (CHB) recognition is more meaningful, but also more challenging than human action recognition (HAR). Understanding the semantic information included in CHB video is helpful to develop advanced human-machine interaction applications. However, utilizing the existing action recognition models can hardly gain satisfactory accuracy because of the CHBs’ long duration and unenumerable characteristics. In this paper, we break through this bottleneck from the semantic perspective via motion data encoding and semantic similarity judgment. The contributions of our method are mainly reflected in three aspects. First, a CHB is innovatively defined as the combination of the human basic actions which are composed in time order. Thus, the unenumerable CHBs can be represented by limited human actions. Second, to automatically construct the action combination of a CHB, a skeleton-based multi-scale CNN model and an efficient one-stage temporal action localization model are put forward to exactly extract action and its duration from a CHB video. Third, the word-vector in the nature language processing field is creatively imported into our method. Therefore, the action words can be encoded by a set of float-point numbers. Moreover, the word-vector is helpful to judge the similarities of different action combinations. The proposed method is evaluated on a self-collected dataset. Through extensive experiments, the results prove the method’s feasibility and universality. Moreover, its use of only human skeleton motion data provides privacy assurances to users.
Mitigating Bit-Flip and Phase-Flip Noise in Quantum Teleportation by Adding Ancillary Particles

Quantum teleportation is a useful communication protocol in quantum communication, which enables the transmission of quantum states over long distances. However, quantum noise inevitably affects quantum communication, resulting in the teleported state not being the ideal target state. In order to minimize the impact of quantum noise, we propose a new method to mitigate bit-flip and phase-flip noise of quantum channel in this paper. This method shares additional ancillary particles between the two parties of communication, which can effectively reduce the influence of bit-flip and phase-flip noise on the entangled channel, thereby improving the efficiency of quantum teleportation in noisy environments. We analyze the performance of the proposed method in detail through mathematical calculations. The results show that proposed scheme can resist the bit-flip and phase-flip noise with noise factor less than 0.5. When the noise factor is small, adding a small amount of auxiliary particles can greatly improve the fidelity of the output state: when the number of auxiliary particles increases to 5, the scheme can resist quantum noise with a noise factor less than or equal to 0.3, making fidelity of the output state is close to 1. When the noise factor is large, it is necessary to add more auxiliary particles to offset the influence of noise.
An Efficient Linearly Homomorphic Signature Scheme with a Designated Combiner

With the widespread adoption of digital signature technology, when a signer needs to perform numerous signature activities but has limited computing power, the efficiency of the general signature scheme can be severely restricted. To address this challenge, the linearly homomorphic signature scheme with a designated combiner (LHSDC) allows the signer to transfer the primary computing task to a cloud server, thereby reducing the computational burden on the signer. The signature algorithm of LHSDC comprises two parts: the homomorphic compression function and the binding function. However, due to the high computational requirements of these two parts, existing schemes still suffer from low efficiency for signers. In this paper, an efficient linearly homomorphic signature scheme with a designated combiner (ELHSDC) is presented, which is tailored for secure proxy signature scenarios. Firstly, we enhance the homomorphic compression function in the signature algorithm by reducing the number of exponential operations required from n to 1. Secondly, we simplify the binding function of the signature algorithm by enabling the signer to directly generate a secret parameter that is shared with the designated combiner, thus eliminating the need for public and private keys for the designated combiner. As a result of the above improvements, our scheme significantly reduces the signer’s amount of calculation during a complete signature process by reducing (n-1) exponential operations, 1 pairing operation, and 2 hash operations, at the expense of only 1 multiplication operation. Finally, the scheme is proved secure against existential forgery on adaptively chosen message attacks under the random oracle model.
Public Auditing and Secure Deduplication of Dynamic Data Based on Blockchain

With the prevalence of distributed network storage services, the security and dynamicity of cloud storage data have become essential focuses of attention. Meanwhile, research on secure deduplication, integrity audit, and dynamic operations has been extensively conducted. However, in existing research, many data deduplication schemes supporting auditing focus on static file storage. This paper proposes a blockchain-based dynamic data deduplication scheme that supports public auditing, enabling data’s dynamic operations. In addition, the existing proof of ownership is designed only to meet the needs of the server. Therefore, we adopt BLS short signature to design a secure and efficient bidirectional proof of ownership mechanism, supporting the server and client to prove they have the same data. Based on this, we design a multi-server storage mechanism under the supervision of blockchain, which achieves public auditing without a trusted third party and supports block-level deduplication within a server and file-level deduplication across servers. Finally, we demonstrate the feasibility and performance of the proposed scheme through experimental analysis.
Oblivious Polynomial Evaluation from Elliptic Code-based Symmetric Homomorphic Encryption

Oblivious Polynomial Evaluation (OPE) is an essential component of various two-party computation protocols, such as private set intersection, data mining, and oblivious keyword search. Therefore, constructing an OPE protocol that can be efficiently implemented is of utmost importance. Leveraging the homomorphic properties of encryption algorithms is an effective approach to constructing an OPE protocol. In this paper, we propose an elliptic code-based symmetric homomorphic encryption scheme utilizing the ideas of Armknecht et al., and provide parameter selections for different security levels. The encryption scheme allows for arbitrary additions and a finite number of multiplications. Building upon our encryption scheme, we further introduce two simple and practical OPE protocols, which are consistent with our encryption scheme. Our protocols achieve a high level of security and can be executed efficiently, requiring only two message transmissions for the entire OPE process. Importantly, our protocols have the capability to simultaneously compute multiple function values with minor modifications.
A decentralized data integrity auditing scheme for cloud storage

Cloud storage service providers offer remote data storage services, and users verify the integrity of the outsourced data through a fixed third-party auditor. However, a single third-party auditor may collaborate with other entities, which raises security problems. In this paper, we propose a decentralized integrity auditing scheme with multiple auditors participating, which solves the single point of failure problem caused by a single third-party auditor. However, using multiple auditors for auditing increases the communication overhead between cloud service providers and verifiers. To solve this problem, we introduce the concept of non-interactive public provable data ownership to reduce the interaction between them. We also design a new reward and punishment mechanism to motivate entities to participate honestly in auditing. The theoretical analysis and experimental evaluation show that our scheme is feasible and effective.
Pseudo-Random Number Generation by Staggered Sampling of LFSR

Linear Feedback Shift Register (LFSR) is widely used as a simple Pseudo-Random Number Generator (PRNG). In 2009, Gu and Zhang proposed a Leap-ahead LFSR, which applies the feedback polynomial multiple times to achieve a larger generation rate. Though a Leap-ahead LFSR applies the feedback polynomial a fixed number of times, the quality of randomness could be potentially improved by applying the feedback polynomial variable times. This study introduces a Staggered LFSR, where a subordinate LFSR determines the number of feedback polynomial applications for the main LFSR. Our evaluation results demonstrate that a Staggered LFSR exhibits better randomness quality compared to a Leap-ahead LFSR of the same length. Though the subordinate LFSR requires an additional cost, the overhead is minimal. The Staggered LFSR, designed with appropriate parameters, successfully passed both the Diehard test and the NIST SP 800-22 test.
A Cryptanalysis against the Cheating Detectable Secret Sharing from NISS 2019

A cheating detectable secret sharing (CDSS for short) scheme is a variant of secret sharing scheme with the extra functionality to detect forgery of shares when some of shares are submitted maliciously. In NISS 2019, Becerra and Vega proposed a CDSS which employs addition over $\mathbb{Z}_{2^{m}}$ as the verification function whereas the secret is distributed and reconstructed with computation over $\mathbb{F}_{2^{m}}$. They proved that the scheme is secure and the bit length of the share meets the lower bound with equality. In this paper, we show that the scheme is insecure by showing that only a single cheater can forge the resulting secret without being detected by the reconstruction algorithm. We present two types of attack. The probability of successful cheating attack of the first attack is 1 but the pattern of forgery is limited. In the second attack, the successful cheating probability is less than the first one but the pattern of forgery is more flexible. The successful cheating probabilities of the proposed attacks are evaluated with the careful analysis about structures of additions over $\mathbb{Z}_{2^{m}}$ and $\mathbb{F}_{2^{m}}$, which will be of independent interest.
Quantum Computer Architecture for Quantum Error Correction with Distributing Process to Multiple Temperature Layers

Quantum computers are capable of performing large-scale calculations in a shorter time than conventional classical computers. Because quantum computers are realized in microscopic physical systems, unintended change in the quantum state is unavoidable due to interaction between environment, and it would lead to error in computation. Therefore, quantum error correction is needed to detect and correct errors that have occurred.In this paper, we propose quantum computer architecture for quantum error correction by taking account that the components of a quantum computer with quantum dots in silicon are divided into multiple temperature layers inside and outside the dilution refrigerator. Analog signals to control the qubits are precisely generated on a 4 K stage inside the dilution refrigerator, while real-time digital processing is performed outside the dilution refrigerator. We then experimentally demonstrate the digital control sequence for quantum error correction combined with a simulator which simulates quantum states during quantum computation. The real time processing including determination of feed-forward operation and transmission of feed-forward operation command is carried out by an FPGA outside the dilution refrigerator within 0.01 ms for bit-flip error correction. This is a sufficiently short time compared to the assumed relaxation time, which is the approximate time that the quantum state can be preserved, meaning that our proposed architecture is applicable to quantum error correction.
Obstacle avoidance path planning for intelligent vehicles based on improved RRT algorithm

Aiming at the problem of time inefficiency caused by blind search of traditional rapid exploring random tree (RRT) algorithm for obstacle avoidance path planning of intelligent vehicles, an improved RRT algorithm is proposed. Firstly, the search area of the RRT algorithm is restricted according to the equations of motion and steering constraints of the vehicle. Then, an artificial potential field (APF) method is introduced to guide the RRT expansion nodes, which accelerates the convergence speed of the algorithm. Finally, the generated path is pruned to make the path planning smoother and shorter. The comparison of the proposed algorithm with the traditional RRT algorithm in the MATLAB platform shows that the proposed algorithm in this paper has superior performance in terms of search nodes, the time required for path planning, and path security performance.
Prediction of Regional PV Power Generation Based on LSTM-CNN

The increasing installed capacity of PV plants across a country has transformed the power grid into a decentralized system, resulting in heightened grid complexity. Predicting regional PV power is essential to ensure grid stability and effective planning. In this work, we propose an LSTM-CNN model to predict regional PV power by utilizing actual weather data from the investigated region and considering PV installed capacity in the investigated region over time. Experimental results indicate that the proposed model can achieve lower RMSE and MAE scores, approximately 13.12 MW and 6.29 MW, respectively, with R2 coefficients around 0.94. Despite its good performance, this model requires a longer learning process duration.
Application and Promotion Mode and Key Technologies of Virtual Power Plant Architecture Under the Goal of Energy Transformation

As an important breakthrough in the field of energy, virtual power plant technology provides a new direction and revolutionary change for the realization of efficient energy integration, optimal scheduling and sustainable development, and the construction of virtual power plant. Firstly, the physical architecture of “cloud-edge-end” 3-layer virtual power plant application is introduced. Then, based on the three dimensions of power selling company, distributed energy users and auxiliary service providers, the application and promotion mode of virtual power plant is deeply analyzed. Secondly, the key technologies of virtual power plant application from the aspects of flexible resource modeling, optimal allocation, aggregation strategy, potential evaluation, collaborative regulation, information communication, flexible interaction, business model, market mechanism, and platform construction are analyzed. Finally, the overall technical challenges, development trend and technical level of the virtual power plant are discussed and summarized.
I<sup>2</sup>F: An Adaptive Iterative and Inheritance Framework for Optimization-Based Trajectory Planning

This paper proposes a trajectory planner for autonomous vehicles on curvy roads. At present, the more prevailing and emerging methods are to convert the trajectory planning task into an optimal control problem (OCP) which requires satisfying two key constraints: (1) Vehicle kinematic constraints; (2) Collision avoidance constraint. Nevertheless, the dimensionality of the nominal OCP tends to be high, primarily due to the intricately formulated collision-avoidance constraints. An idea to address this issue is to first plan a coarse trajectory which guide a homotopic route, and then construct the within-corridor constraints along the coarse trajectory instead of the redundant collision-avoidance constraints. But the new challenge is how to attenuate the negative influence of the change of collision-avoidance constraints form on optimality and feasibility of the OCP. To address this issue, an iterative and inheritance framework is proposed, termed I <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2</sup> F. First, an intermediate OCP is formulated once per iteration, which only contains the within-corridor constraints. Second, the construction process of the within-corridor is accelerated by adopting the inheritance strategy. Through this framework, the convergence rate can be improved while reducing the cost, and weakening sensitivity of OCP to the initial guess. Finally, the efficiency and robustness of the proposed planner, along with several widely-used optimization-based planners, are thoroughly evaluated through 100 simulation cases, considering various metrics such as cost, success rate, and computational time.