简易动平衡校验机的设计

通过理论分析，给出了简易动平衡校验机的设计及应用方法，可经济、方便、准确地解决油脂轧辊的动平衡工艺问题。

扭力校验机的改进设计

文章叙述了扭力校验机的设计过程,包括新旧设备的比较与改进,介绍了扭力校验机的组成、各部件结构及工作原理,并对关键部件选取进行了计算与校核。该设备通过几年的使用情况反馈,验证其良好的安全性和可靠性,得到了用户的认可。

简易动平衡校验机的设计

通过理论分析，给出了简易动平衡校验机的设计及应用方法，可经济、方便、准确地解决油脂轧辊的动平衡工艺问题，满足轧坯机的工作需要，也可校验电厂碎煤机辊等其它设备的回转体的动平衡。

电动汽车充电桩/机校验仪国内技术现状及溯源研究

电动汽车交流充电桩校验仪、电动汽车直流充电机校验仪是电动汽车充电桩/机的计量标准器,其准确可靠可为强检计量器具电动汽车充电桩/机的量值提供保证。通过对国内电动汽车充电桩/机校验仪的长期全面测试和理论研究,较全面掌握了电动汽车充电桩/机校验仪的生产水平和质量状态,在大量实际数据的支撑下,对最小电流、温度系数、失真度、纹波等进行了溯源研究,掌握了关键参数值和检测方法,为相关国家规程的编写打下坚实基础。

一种改进的远程用户身份认证方法

本文针对Yoon-Yoo远程用户身份认证方法隐藏的伪装用户攻击、伪装服务器攻击和窃取校验机攻击的安全缺陷,利用随机数多次哈希运算提出一种改进的远程用户身份认证方法。本算法能够解决Yoon-Yoo方法的安全缺陷,同时又能保持其优点。因此,该方法具有更稳定的安全性,为电子商务等领域提供了远程用户身份认证的有效解决方案。

JJG 1192-2023《电动汽车非车载充电机校验仪检定规程》解读

文章对JJG 1192-2023《电动汽车非车载充电机校验仪检定规程》进行解读,介绍了规程中部分技术指标的确定过程和依据,对规程中技术指标和检定方法进行了解释和说明,对校验仪检定过程中需注意的问题进行了阐明,便于计量检定人员加深对该规程的理解,正确执行规程。

A CLASS OF LDPC CODE'S CONSTRUCTION BASED ON AN ITERATIVE RANDOM METHOD

This letter gives a random construction for Low Density Parity Check (LDPC) codes, which uses an iterative algorithm to avoid short cycles in the Tanner graph. The construction method has great flexible choice in LDPC code's parameters including codelength, code rate, the least girth of the graph, the weight of column and row in the parity check matrix. The method can be applied to the irregular LDPC codes and strict regular LDPC codes. Systemic codes have many applications in digital communication, so this letter proposes a construction of the generator matrix of systemic LDPC codes from the parity check matrix. Simulations show that the method performs well with iterative decoding.

Construction of Quasi-Cyclic Low-Density Parity-Check Codes for Simplifying Shuffle Networks in Layered Decoder

Offset Shuffle Networks(OSNs) interleave a-posterior probability messages in the Block Row-Layered Decoder(BRLD) of QuasiCyclic Low-Density Parity-Check(QC-LDPC)codes.However,OSNs usually consume a significant amount of computational resources and limit the clock frequency,particularly when the size of the Circulant Permutation Matrix(CPM)is large.To simplify the architecture of the OSN,we propose a Simplified Offset Shuffle Network Block Progressive Edge-Growth(SOSNBPEG) algorithm to construct a class of QCLDPC codes.The SOSN-BPEG algorithm constrains the shift values of CPMs and the difference of the shift values in the same column by progressively appending check nodes.Simulation results indicate that the error performance of the SOSN-BPEG codes is the same as that of the codes in WiMAX and DVB-S2.The SOSNBPEG codes can reduce the complexity of the OSNs by up to 54.3%,and can improve the maximum frequency by up to 21.7%for various code lengths and rates.

Practical Polar Code Construction For Degraded Multiple-Relay Networks

In this paper, based on the characteristics of polar codes, a new decode-and-forward strategy called generalized partial information relaying protocol is proposed for degraded multiple-relay networks with orthogonal receiver components(MRNORCs). In such a protocol, with the help of partial information from previous nodes, each relay node tries to recover the received source message and re-encodes part of the decoded message for transmission to satisfy the decoding requirements for the following relay node or the destination node. In order to construct practical polar codes, the nested structures are developed based on this protocol and the information sets corresponding to the partial messages forwarded are also calculated. The proposed scheme is proved to be capable of achieving the theoretical capacity of the degraded MRN-ORCs while still retains the low-complexity feature of polar codes. We perform simulations to testify the practicability of the proposed scheme and compare polar codes by using successive-cancellation list decoder(SCLD) with traditional low-density parity-check(LDPC) codes. The results show that the obtained polar codes provide significant gain.

前向纠错系统设计与应用

前向纠错(Forward ErrorCorrection,FEC)系统在现代追求高速度、高效能的通讯系统芯片设计竞赛中扮演了一个非常重要的角色,经由适当的纠错系统设计,可以在天线输出功率、系统比特错误率与系统设计复杂度之中取得一个极佳化的平衡。前向纠错中包含非常多的种类,如区块码(Block code)、回旋码(convolutional code)、涡轮码(Turbo code)、低集成度机偶校验证编码(LDPC Code)等等。本文将对简介这些编码,由系统集成设计的角度及芯片实践的角度分别予以探讨,并以作者的实践经验提出解决的方案。

A Self-Position Estimation Algorithm for Multiple Mobile Robots Using Two Omnidirectional Cameras and an Accelerometer

This paper proposes a self-position estimate algorithm for the multiple mobile robots; each robot uses two omnidirectional cameras and an accelerometer. In recent years, the Great East Japan Earthquake and large-scale disasters have occurred frequently in Japan. From this, development of the searching robot which supports the rescue team to perform a relief activity at a large-scale disaster is indispensable. Then, this research has developed the searching robot group system with two or more mobile robots. In this research, the searching robot equips with two omnidirectional cameras and an accelerometer. In order to perform distance measurement using two omnidirectional cameras, each parameter of an omnidirectional camera and the position and posture between two omnidirectional cameras have to be calibrated in advance. If there are few mobile robots, the calibration time of each omnidirectional camera does not pose a problem. However, if the calibration is separately performed when using two or more robots in a disaster site, etc., it will take huge calibration time. Then, this paper proposed the algorithm which estimates a mobile robot＇s position and the parameter of the position and posture between two omnidirectional cameras simultaneously. The algorithm proposed in this paper extended Nonlinear Transformation （NLT） Method. This paper conducted the simulation experiment to check the validity of the proposed algorithm. In some simulation experiments, one mobile robot moves and observes the circumference of another mobile robot which has stopped at a certain place. This paper verified whether the mobile robot can estimate position using the measurement value when the number of observation times becomes 10 times in n/18 of observation intervals. The result of the simulation shows the effectiveness of the algorithm.

Shadow obstacle model for realistic corner-turning behavior in crowd simulation

This paper describes a novel model known as the shadow obstacle model to generate a realistic comer-tuming behavior in crowd simulation. The motivation for this model comes from the observation that people tend to choose a safer route rather than a shorter one when turning a comer. To calculate a safer route, an optimization method is proposed to generate the corner-turning rule that maximizes the viewing range for the agents. By combining psychological and physical forces together, a full crowd simulation framework is established to provide a more realistic crowd simulation. We demonstrate that our model produces a more realistic comer-turning behavior by comparison with real data obtained from the experiments. Finally, we per- form parameter analysis to show the believability of our model through a series of experiments.

A survey of photon mapping state-of-the-art research and future challenges

Global illumination is the core part of photo-realistic rendering. The photon mapping algorithm is an effective method for computing global illumination with its obvious advantage of caustic and color bleeding rendering. It is an active research field that has been developed over the past two decades. The deficiency of precise details and efficient rendering are still the main challenges of photon mapping. This report reviews recent work and classifies it into a set of categories including radiance estimation, photon relaxation, photon tracing, progressive photon mapping, and parallel methods. The goals of our report are giving readers an overall introduction to photon mapping and motivating further research to address the limitations of existing methods.

Fast implementation of kernel simplex volume analysis based on modified Cholesky factorization for endmember extraction

Endmember extraction is a key step in the hyperspectral image analysis process. The kernel new simplex growing algorithm （KNSGA）, recently developed as a nonlinear alternative to the simplex growing algorithm （SGA）, has proven a promising endmember extraction technique. However, KNSGA still suffers from two issues limiting its application. First, its random initialization leads to inconsistency in final results; second, excessive computation is caused by the iterations of a simplex volume calculation. To solve the first issue, the spatial pixel purity index （SPPI） method is used in this study to extract the first endrnember, eliminating the initialization dependence. A novel approach tackles the second issue by initially using a modified Cholesky fac- torization to decompose the volume matrix into triangular matrices, in order to avoid directly computing the determinant tauto- logically in the simplex volume formula. Theoretical analysis and experiments on both simulated and real spectral data demonstrate that the proposed algorithm significantly reduces computational complexity, and runs faster than the original algorithm.

Associated Production of a Photon with Dark Matter Pair at the ILC within the Littlest Higgs Model with T-parity

Within the context of the Littlest Higgs model with T-parity, the heavy photon （AH） is supposed to be an ideM dark matter （DM） candidate. One direct proof of validity of the model is to produce the heavy photon at collider. In this paper, we investigate the associated production of a photon with heavy photon pair at the planned international e＋ e- linear collider （ILC）, i.e., e＋e- → AHAHγ and show the distributions of the transverse momenta of the photon. The numerical results indicate that the heavy photon production rate could reach severaL fb at the low mass parameter space and the characteristic signal is a single high energetic photon and missing energy, carried by the heavy photons. All in a/l, it can be a good chance to observe the heavy photon via this process with the high yearly luminosity of the ILC.

Underwater explosion in centrifuge partⅠ:Validation and calibration of scaling laws

Centrifuge is a promising tool for underwater explosion(UNDEX) research as both Mach and Froude similitudes could be satisfied with hyper-gravity in models, which would result in similarities in both shock wave and bubble oscillation. Scaling laws for UNDEX in centrifuge have been proposed based on dimensional analysis. Two dimensionless numbers, i.e.,π_3 and π_4, are used to characterize shock wave and bubble oscillation, respectively. To validate scaling laws, 17 UNDEX tests are designed by varying accelerations or explosive weights and positions in centrifuge. The tests are classified into different groups to validate scaling laws as well as calibrate coefficients in empirical formulae for both shock wave and bubble oscillation. The results show that changes of gravity acceleration or hydrodynamic pressure almost has no influence on shock wave peak pressure and time constant as long as π3 is constant. The dimensionless bubble period and maximum radius agreed with each other when π4 is constant. Based on the research, an example is exhibited to suggest method for the computation of initial loading conditions for a submerged obstacle subjected to UNDEX.

Quantum-dot cellular automata based reversible low power parity generator and parity checker design for nanocommunication

Quantum-dot cellular automata （QCA） is an emerging area of research in reversible computing. It can be used to design nanoscale circuits. In nanocommunication, the detection and correction of errors in a received message is a major factor. Besides, device density and power dissipation are the key issues in the nanocommunication architecture. For the first time, QCA-based designs of the reversible low-power odd parity generator and odd parity checker using the Feynman gate have been achieved in this study. Using the proposed parity generator and parity checker circuit, a nanocommunication architecture is pro- posed. The detection of errors in the received message during transmission is also explored. The proposed QCA Feynman gate outshines the existing ones in terms of area, cell count, and delay. The quantum costs of the proposed conventional reversible circuits and their QCA layouts are calculated and compared, which establishes that the proposed QCA circuits have very low quantum cost compared to conventional designs. The energy dissipation by the layouts is estimated, which ensures the possibility ofQCA nano-device serving as an alternative platform for the implementation of reversible circuits. The stability of the proposed circuits under thermal randomness is analyzed, showing the operational efficiency of the circuits. The simulation results of the proposed design are tested with theoretical values, showing the accuracy of the circuits. The proposed circuits can be used to design more complex low-power nanoscale lossless cation architecture such as nano-transmitters and nano-receivers

Local uncorrelated local discriminant embedding for face recognition

The feature extraction algorithm plays an important role in face recognition. However, the extracted features also have overlapping discriminant information. A property of the statistical uncorrelated criterion is that it eliminates the redundancy among the extracted discriminant features, while many algorithms generally ignore this property. In this paper, we introduce a novel feature extraction method called local uncorrelated local discriminant embedding(LULDE). The proposed approach can be seen as an extension of a local discriminant embedding(LDE)framework in three ways. First, a new local statistical uncorrelated criterion is proposed, which effectively captures the local information of interclass and intraclass. Second, we reconstruct the affinity matrices of an intrinsic graph and a penalty graph, which are mentioned in LDE to enhance the discriminant property. Finally, it overcomes the small-sample-size problem without using principal component analysis to preprocess the original data, which avoids losing some discriminant information. Experimental results on Yale, ORL, Extended Yale B, and FERET databases demonstrate that LULDE outperforms LDE and other representative uncorrelated feature extraction methods.

Design and simulation of a standing wave oscillator based PLL

A standing wave oscillator(SWO) is a perfect clock source which can be used to produce a high frequency clock signal with a low skew and high reliability. However, it is difficult to tune the SWO in a wide range of frequencies. We introduce a frequency tunable SWO which uses an inversion mode metal-oxide-semiconductor(IMOS) field-effect transistor as a varactor, and give the simulation results of the frequency tuning range and power dissipation. Based on the frequency tunable SWO, a new phase locked loop(PLL) architecture is presented. This PLL can be used not only as a clock source, but also as a clock distribution network to provide high quality clock signals. The PLL achieves an approximately 50% frequency tuning range when designed in Global Foundry 65 nm 1P9 M complementary metal-oxide-semiconductor(CMOS) technology, and can be used directly in a high performance multi-core microprocessor.

A consensus model for group decision making under interval type-2 fuzzy environment

We propose a new consensus model for group decision making(GDM) problems, using an interval type-2 fuzzy environment. In our model, experts are asked to express their preferences using linguistic terms characterized by interval type-2 fuzzy sets(IT2 FSs), because these can provide decision makers with greater freedom to express the vagueness in real-life situations. Consensus and proximity measures based on the arithmetic operations of IT2 FSs are used simultaneously to guide the decision-making process. The majority of previous studies have taken into account only the importance of the experts in the aggregation process, which may give unreasonable results. Thus, we propose a new feedback mechanism that generates different advice strategies for experts according to their levels of importance. In general, experts with a lower level of importance require a larger number of suggestions to change their initial preferences. Finally, we investigate a numerical example and execute comparable models and ours, to demonstrate the performance of our proposed model. The results indicate that the proposed model provides greater insight into the GDM process.