Resource Type

Journal Article 854

Conference Information 45

Conference Videos 35

Year

2024 2

2023 76

2022 78

2021 83

2020 90

2019 70

2018 49

2017 61

2016 32

2015 12

2014 14

2013 19

2012 37

2011 22

2010 16

2009 23

2008 20

2007 33

2006 25

2005 28

open ︾

Keywords

DX pile 7

Deep learning 7

Artificial intelligence 6

development strategy 6

open complex giant system 6

Computer vision 5

computer simulation 5

finite element method 5

computer 4

finite element analysis 4

3D printing 3

ANSYS 3

Additive manufacturing 3

COVID-19 3

Adsorption 2

Blockchain 2

Complex systems 2

Delphi method 2

Encryption 2

open ︾

Search scope:

排序: Display mode:

Efficient construction of a substitution box based on a Mordell elliptic curve over a finite field Research Article

Naveed Ahmed Azam, Umar Hayat, Ikram Ullah,azam@amp.i.kyoto-u.ac.jp,umar.hayat@qau.edu.pk

Frontiers of Information Technology & Electronic Engineering 2019, Volume 20, Issue 10,   Pages 1378-1389 doi: 10.1631/FITEE.1800434

Abstract: We study the balance problem caused by forward leaning of the wearer’s upper body during rehabilitation training with a lower limb rehabilitation exoskeleton. The instantaneous capture point is obtained by modeling the human-exoskeleton system and using the capture point theory. By comparing the stability region with instantaneous capture points of different gait phases, the balancing characteristics of different gait phases and changes to the equilibrium state in the gait process are analyzed. Based on a model of the human-exoskeleton system and the condition of balance of different phases, a trajectory correction strategy is proposed for the instability of the human-exoskeleton system caused by forward leaning of the wearer’s upper body. Finally, the reliability of the trajectory correction strategy is verified by carrying out experiments on the Zhejiang University Lower Extremity Exoskeleton. The proposed trajectory correction strategy can respond to forward leaning of the upper body in a timely manner. Additionally, in the process of the center of gravity transferred from a double-support phase to a single-support phase, the ratio of gait cycle to zero moment point transfer is reduced correspondingly, and the gait stability is improved.

Keywords: 密码置换盒;有限域;莫德尔椭圆曲线;总阶数;计算复杂度    

Design of Block Cipher Substitution Network on Chaos

Sun Feng,Qin Honglei,Xu Yiaoqun,Hao Yianling

Strategic Study of CAE 2000, Volume 2, Issue 9,   Pages 47-49

Abstract:

In this paper, a design of block cipher substitution network is presented by use of the ergodic theory of chaos. The ergodic theory of chaos and the time complexity of substitution network is analyzed. The computer simulation result shows that the block cipher substitution network of chaos is highly complex and strong in anti-decipher .

Keywords: chaos sequence     permutation network     ergodic theory     time complexity    

Low-computation certificateless hybrid signcryption scheme Article

Hui-fang YU, Bo YANG

Frontiers of Information Technology & Electronic Engineering 2017, Volume 18, Issue 7,   Pages 928-940 doi: 10.1631/FITEE.1601054

Abstract: Hybrid signcryption is an important technique signcrypting bulk data using symmetric encryption. In this paper, we apply the technique of certificateless hybrid signcryption to an elliptic-curve cryptosystem, and construct a low-computation certificateless hybrid signcryption scheme. In the random oracle model, this scheme is proven to have indistinguishability against adaptive chosen-ciphertext attacks (IND-CCA2) under the elliptic-curve computation Diffie-Hellman assumption. Also, it has a strong existential unforgeability against adaptive chosen-message attacks (sUF-CMA) under the elliptic-curve discrete logarithm assumption. Analysis shows that the cryptographic algorithm does not rely on pairing operations and is much more efficient than other algorithms. In addition, it suits well to applications in environments where resources are constrained, such as wireless sensor networks and ad hoc networks.

Keywords: Hybrid signcryption     Scalar multiplication     Certificateless cryptosystem     Provable security    

Low complexity robust adaptive beamforming for general-rank signal model with positive semidefinite constraint Article

Yu-tang ZHU,Yong-bo ZHAO,Jun LIU,Peng-lang SHUI

Frontiers of Information Technology & Electronic Engineering 2016, Volume 17, Issue 11,   Pages 1245-1252 doi: 10.1631/FITEE.1601112

Abstract: We propose a low complexity robust beamforming method for the general-rank signal model, to combat against mismatches of the desired signal array response and the received signal covariance matrix. The proposed beamformer not only considers the norm bounded uncertainties in the desired and received signal covariance matrices, but also includes an additional positive semidefinite constraint on the desired signal covariance matrix. Based on the worst-case performance optimization criterion, a computationally simple closed-form weight vector is obtained. Simulation results verify the validity and robustness of the proposed beamforming method.

Keywords: Beamforming     General-rank     Low complexity     Positive semidefinite (PSD) constraint     Model mismatches    

Detecting interaction/complexitywithin crowd movements using braid entropy Research Papers

Murat AKPULAT, Murat EKİNCİ

Frontiers of Information Technology & Electronic Engineering 2019, Volume 20, Issue 6,   Pages 849-861 doi: 10.1631/FITEE.1800313

Abstract:

The segmentation of moving and non-moving regions in an image within the field of crowd analysis is a crucial process in terms of understanding crowd behavior. In many studies, similar movements were segmented according to the location, adjacency to each other, direction, and average speed. However, these segments may not in turn indicate the same types of behavior in each region. The purpose of this study is to better understand crowd behavior by locally measuring the degree of interaction/complexity within the segment. For this purpose, the flow of motion in the image is primarily represented as a series of trajectories. The image is divided into hexagonal cells and the finite time braid entropy (FTBE) values are calculated according to the different projection angles of each cell. These values depend on the complexity of the spiral structure that the trajectories generated throughout the movement and show the degree of interaction among pedestrians. In this study, behaviors of different complexities determined in segments are pictured as similar movements on the whole. This study has been tested on 49 different video sequences from the UCF and CUHK databases.

Keywords: Crowd behavior     Motion segmentation     Motion entropy     Crowd scene analysis     Complexity detection     Braid entropy    

Research & application of IFN in cypher science

Ye Qiusun

Strategic Study of CAE 2008, Volume 10, Issue 5,   Pages 51-57

Abstract:

To overcome 3 shortcomings of the traditional PNCT (pure numerals ciphering technology) of that, properties of the divulging a secret, the allotted time and the dead secrets. This paper gives a novel ciphering technique based on specific properties of intelligent VCN (variable carrying numbers). All allowed cipher numbers are FCN (fixed carrying numbers), in the traditional PNCT, and their changing rules of FCN are both very simple, mechanism and too difficult to be remembered, so that they make the mentioned shortcomings of being sure secrecy in the course of nature. The VCN are extension of the FCN, which are also a new concept of numbers in a broad sense, but their complex,intelligence and flexibility in changing rules are just to overcome the 3 shortcomings of PNCT in FCN.

Keywords: variable carrying numbers (VCN)     cypher science (CS)     fixed carrying numbers (FCN)     artificial intelligence(AI)     AI-Fuzzy VCN (IFN)    

Differential evolution based computation intelligence solver for elliptic partial differential equations Research Article

Muhammad Faisal Fateh, Aneela Zameer, Sikander M. Mirza, Nasir M. Mirza, Muhammad Saeed Aslam, Muhammad Asif Zahoor Raja,muhammad.aslam@adelaide.edu.au

Frontiers of Information Technology & Electronic Engineering 2019, Volume 20, Issue 10,   Pages 1445-1456 doi: 10.1631/FITEE.1900221

Abstract: A based methodology is introduced for the solution of elliptic s (PDEs) with Dirichlet and/or Neumann boundary conditions. The solutions evolve over bounded domains throughout the interior nodes by minimization of nodal deviations among the population. The elliptic PDEs are replaced by the corresponding system of finite difference approximation, yielding an expression for nodal residues. The global residue is declared as the root-mean-square value of the nodal residues and taken as the cost function. The standard is then used for the solution of elliptic PDEs by conversion to a minimization problem of the global residue. A set of benchmark problems consisting of both linear and nonlinear elliptic PDEs has been considered for validation, proving the effectiveness of the proposed algorithm. To demonstrate its robustness, sensitivity analysis has been carried out for various operators and parameters. Comparison of the based computed nodal values with the corresponding data obtained using the exact analytical expressions shows the accuracy and convergence of the proposed methodology.

Keywords: 差分进化;边界值问题;偏微分方程;有限差分法;数值计算    

Fractional-order global optimal backpropagation machine trained by an improved fractional-order steepest descent method Research Articles

Yi-fei Pu, Jian Wang,puyifei@scu.edu.cn,wangjiannl@upc.edu.cn

Frontiers of Information Technology & Electronic Engineering 2020, Volume 21, Issue 6,   Pages 809-962 doi: 10.1631/FITEE.1900593

Abstract: We introduce the fractional-order global optimal backpropagation machine, which is trained by an improved (FSDM). This is a fractional-order backpropagation neural network (FBPNN), a state-of-the-art fractional-order branch of the family of backpropagation neural networks (BPNNs), different from the majority of the previous classic first-order BPNNs which are trained by the traditional first-order steepest descent method. The reverse incremental search of the proposed FBPNN is in the negative directions of the approximate fractional-order partial derivatives of the square error. First, the theoretical concept of an FBPNN trained by an improved FSDM is described mathematically. Then, the mathematical proof of fractional-order global optimal convergence, an assumption of the structure, and of the FBPNN are analyzed in detail. Finally, we perform three (types of) experiments to compare the performances of an FBPNN and a classic first-order BPNN, i.e., example function approximation, , and comparison of global search and error fitting abilities with real data. The higher optimal search ability of an FBPNN to determine the global optimal solution is the major advantage that makes the FBPNN superior to a classic first-order BPNN.

Keywords: 分数阶微积分;分数阶反向传播算法;分数阶最速下降法;均方误差;分数阶多尺度全局优化    

Filtering and tracking with trinion-valued adaptive algorithms Article

Xiao-ming GOU,Zhi-wen LIU,Wei LIU,You-gen XU

Frontiers of Information Technology & Electronic Engineering 2016, Volume 17, Issue 8,   Pages 834-840 doi: 10.1631/FITEE.1601164

Abstract: A new model for three-dimensional processes based on the trinion algebra is introduced for the first time. Compared to the pure quaternion model, the trinion model is more compact and computationally more efficient, while having similar or comparable performance in terms of adaptive linear filtering. Moreover, the trinion model can effectively represent the general relationship of state evolution in Kalman filtering, where the pure quaternion model fails. Simulations on real-world wind recordings and synthetic data sets are provided to demonstrate the potential of this new modeling method.

Keywords: Three-dimensional processes     Trinion     Least mean squares     Kalman filter    

Aneffective approach for low-complexity maximumlikelihood based automatic modulation classification of STBC-MIMOsystems Article

Maqsood H. SHAH, Xiao-yu DANG

Frontiers of Information Technology & Electronic Engineering 2020, Volume 21, Issue 3,   Pages 465-475 doi: 10.1631/FITEE.1800306

Abstract: A low-complexity likelihood methodology is proposed for automatic modulation classification of orthogonal space-time block code (STBC) based multiple-input multiple-output (MIMO) systems. We exploit the zero-forcing equalization technique to modify the typical average likelihood ratio test (ALRT) function. The proposed ALRT function has a low computational complexity compared to existing ALRT functions for MIMO systems classification. The proposed approach is analyzed for blind channel scenarios when the receiver has imperfect channel state information (CSI). Performance analysis is carried out for scenarios with different numbers of antennas. Alamouti-STBC systems with 2 ×2 and 2 ×1 and space-time transmit diversity with a 4 ×4 transmit and receive antenna configuration are considered to verify the proposed approach. Some popular modulation schemes are used as the modulation test pool. Monte-Carlo simulations are performed to evaluate the proposed methodology, using the probability of correct classification as the criterion. Simulation results show that the proposed approach has high classification accuracy at low signal-to-noise ratios and exhibits robust behavior against high CSI estimation error variance.

Keywords: Multiple-input multiple-output     Space-time block code     Maximum likelihood     Automatic modulation classification     Zero-forcing    

Fractional-order memristive neural synaptic weighting achieved by pulse-based fracmemristor bridge circuit Research Articles

Yifei Pu, Bo Yu, Qiuyan He, Xiao Yuan,heqiuyan789@163.com,yuanxiao@scu.edu.cn

Frontiers of Information Technology & Electronic Engineering 2021, Volume 22, Issue 6,   Pages 862-876 doi: 10.1631/FITEE.2000085

Abstract: We propose a novel circuit for the fractional-order memristive neural synaptic weighting (FMNSW). The introduced circuit is different from the majority of the previous integer-order approaches and offers important advantages. Since the concept of memristor has been generalized from the classic integer-order memristor to the (), a challenging theoretical problem would be whether the can be employed to implement the or not. In this research, characteristics of the FMNSW, realized by a pulse-based bridge circuit, are investigated. First, the circuit configuration of the FMNSW is explained using a pulse-based bridge circuit. Second, the mathematical proof of the fractional-order learning capability of the FMNSW is analyzed. Finally, experimental work and analyses of the electrical characteristics of the FMNSW are presented. Strong ability of the FMNSW in explaining the cellular mechanisms that underlie learning and memory, which is superior to the traditional integer-order memristive neural synaptic weighting, is considered a major advantage for the proposed circuit.

Keywords: 分数阶微积分;分忆抗;分忆抗值;分数阶忆阻;分数阶记忆性突触    

Mittag-Leffler stability analysis ofmultiple equilibrium points in impulsive fractional-order quaternion-valued neural networks Research Articles

K. UDHAYAKUMAR, R. RAKKIYAPPAN, Jin-de CAO, Xue-gang TAN

Frontiers of Information Technology & Electronic Engineering 2020, Volume 21, Issue 2,   Pages 234-246 doi: 10.1631/FITEE.1900409

Abstract: In this study, we investigate the problem of multiple Mittag-Leffler stability analysis for fractional-order quaternion-valued neural networks (QVNNs) with impulses. Using the geometrical properties of activation functions and the Lipschitz condition, the existence of the equilibrium points is analyzed. In addition, the global Mittag-Leffler stability of multiple equilibrium points for the impulsive fractional-order QVNNs is investigated by employing the Lyapunov direct method. Finally, simulation is performed to illustrate the effectiveness and validity of the main results obtained.

Keywords: Mittag-Leffler stability     Fractional-order     Quaternion-valued neural networks     Impulse    

Finite Element Numerical Model on Break and Collapse Process of Frame Building by Blasting

Zhang Qi,Wu Feng,Wang Xiaolin

Strategic Study of CAE 2005, Volume 7, Issue 10,   Pages 28-32

Abstract:

Demolishing of frame building by blast is complex and difficult. Based on mechanics process of demolishing blast of frame building, the numerical compute model on breaking of the frame building is set up in the paper. By this numerical compute way, the design projects of demolishing blasting of the frame can be simulated and the design parameters can be optimized. Through the simulation, the wastes of boreholes, explosive charges and safety protection material can be avoided. Sometimes the frame building does not collapse in the process of the demolishing blasting because the design project is not correct by experience. The situation of every member of the frame in the demolishing blasting can be computed by the present simulation way and the collapsing of the frame after blasting can be ascerlained. The numerical model offers a new design way for demolishing blast of frame building.

Keywords: engineering blast     frame building     finite element     numerical compute    

On observability of Galois nonlinear feedback shift registers over finite fields Research Article

Zhe GAO, Jun´e FENG, Yongyuan YU, Yanjun CUI

Frontiers of Information Technology & Electronic Engineering 2022, Volume 23, Issue 10,   Pages 1533-1545 doi: 10.1631/FITEE.2200228

Abstract:

ensures that any two distinct initial states can be uniquely determined by their outputs, so the stream ciphers can avoid unobservable to prevent the occurrence of equivalent keys. This paper discusses the of over . are treated as using the . The vector form of the state transition matrix is introduced, by which a necessary and sufficient condition is proposed, as well as an algorithm for determining the of general . Moreover, a new matrix is defined, which can derive a matrix method with lower computation complexity. Furthermore, the of two special types of , a full-length Galois NFSR and a nonsingular Galois NFSR, is investigated. Two methods are proposed to determine the of these two special types of NFSRs, and some numerical examples are provided to support these results.

Keywords: Observability     Nonlinear feedback shift registers (NFSRs)     Galois NFSRs     Semi-tensor product     Finite fields     Logical networks    

Design and Research of Computer Simulation for Complex System

Jin Shiyao,Li Hongliang,Dang gang,Wang Zhaofu,Liu Xiaojian

Strategic Study of CAE 2002, Volume 4, Issue 4,   Pages 52-57

Abstract:

The complex systems and complexity is the kernel scientific problem of the 21st century. Due to the complexity and indetermination of complex systems, it is difficult to study the complex systems with the traditional reductive theory. The agent-based fuzzy computer simulation is approved in the paper, and a distributed simulation platform based on the agents is designed.

Keywords: complex systems     computer simulation     agent     HLA/RTI    

Title Author Date Type Operation

Efficient construction of a substitution box based on a Mordell elliptic curve over a finite field

Naveed Ahmed Azam, Umar Hayat, Ikram Ullah,azam@amp.i.kyoto-u.ac.jp,umar.hayat@qau.edu.pk

Journal Article

Design of Block Cipher Substitution Network on Chaos

Sun Feng,Qin Honglei,Xu Yiaoqun,Hao Yianling

Journal Article

Low-computation certificateless hybrid signcryption scheme

Hui-fang YU, Bo YANG

Journal Article

Low complexity robust adaptive beamforming for general-rank signal model with positive semidefinite constraint

Yu-tang ZHU,Yong-bo ZHAO,Jun LIU,Peng-lang SHUI

Journal Article

Detecting interaction/complexitywithin crowd movements using braid entropy

Murat AKPULAT, Murat EKİNCİ

Journal Article

Research & application of IFN in cypher science

Ye Qiusun

Journal Article

Differential evolution based computation intelligence solver for elliptic partial differential equations

Muhammad Faisal Fateh, Aneela Zameer, Sikander M. Mirza, Nasir M. Mirza, Muhammad Saeed Aslam, Muhammad Asif Zahoor Raja,muhammad.aslam@adelaide.edu.au

Journal Article

Fractional-order global optimal backpropagation machine trained by an improved fractional-order steepest descent method

Yi-fei Pu, Jian Wang,puyifei@scu.edu.cn,wangjiannl@upc.edu.cn

Journal Article

Filtering and tracking with trinion-valued adaptive algorithms

Xiao-ming GOU,Zhi-wen LIU,Wei LIU,You-gen XU

Journal Article

Aneffective approach for low-complexity maximumlikelihood based automatic modulation classification of STBC-MIMOsystems

Maqsood H. SHAH, Xiao-yu DANG

Journal Article

Fractional-order memristive neural synaptic weighting achieved by pulse-based fracmemristor bridge circuit

Yifei Pu, Bo Yu, Qiuyan He, Xiao Yuan,heqiuyan789@163.com,yuanxiao@scu.edu.cn

Journal Article

Mittag-Leffler stability analysis ofmultiple equilibrium points in impulsive fractional-order quaternion-valued neural networks

K. UDHAYAKUMAR, R. RAKKIYAPPAN, Jin-de CAO, Xue-gang TAN

Journal Article

Finite Element Numerical Model on Break and Collapse Process of Frame Building by Blasting

Zhang Qi,Wu Feng,Wang Xiaolin

Journal Article

On observability of Galois nonlinear feedback shift registers over finite fields

Zhe GAO, Jun´e FENG, Yongyuan YU, Yanjun CUI

Journal Article

Design and Research of Computer Simulation for Complex System

Jin Shiyao,Li Hongliang,Dang gang,Wang Zhaofu,Liu Xiaojian

Journal Article