Categorical observers for metamerism

A method is proposed to generate categorical colour observer functions (individual colour matching functions) for any field size based on the CIE 2006 system of physiological observer functions. The method combines proposed categorical observer techniques of Sarkar et al with a physiologically-based individual observer model of Asano et al and a clustering technique to produce the optimal set of categorical observers. The number of required categorical observers varies depending on an application with as many as 50 required to predict individual observers' matches when a laser projector is viewed. However, 10 categorical observers are sufficient to represent colour-normal populations for personalized colour imaging. The proposed and recommended categorical observers represent a robust and inclusive technique to examine and quantify observer metamerism in any application of colorimetry.     

Classification of the cardiotocogram data for anticipation of fetal risks using machine learning techniques

The aim of the research is evaluating the classification performances of eight different machine-learning methods on the antepartum cardiotocography (CTG) data. The classification is necessary to predict newborn health, especially for the critical cases. Cardiotocography is used for assisting the obstetricians’ to obtain detailed information during the pregnancy as a technique of measuring fetal well-being, essentially in pregnant women having potential complications. The obstetricians describe CTG shortly as a continuous electronic record of the baby's heart rate took from the mother's abdomen. The acquired information is necessary to visualize unhealthiness of the embryo and gives an opportunity for early intervention prior to happening a permanent impairment to the embryo. The aim of the machine learning methods is by using attributes of data obtained from the uterine contraction (UC) and fetal heart rate (FHR) signals to classify as pathological or normal. The dataset contains 1831 instances with 21 attributes, examined by applying the methods. In the paper, the highest accuracy displayed as 99.2%.     

Exactly satisfying initial conditions neural network models for numerical treatment of first Painlevé equation

In this paper, novel computing approach using three different models of feed-forward artificial neural networks (ANNs) are presented for the solution of initial value problem (IVP) based on first Painlevé equation. These mathematical models of ANNs are developed in an unsupervised manner with capability to satisfy the initial conditions exactly using log-sigmoid, radial basis and tan-sigmoid transfer functions in hidden layers to approximate the solution of the problem. The training of design parameters in each model is performed with sequential quadratic programming technique. The accuracy, convergence and effectiveness of the proposed schemes are evaluated on the basis of the results of statistical analyses through sufficient large number of independent runs with different number of neurons in each model as well. The comparisons of these results of proposed schemes with standard numerical and analytical solutions validate the correctness of the design models.     

On one boundary problem for nonlinear stationary controlled system

The object of study is nonlinear stationary controlled system of ordinary differential equations with constant disturbance in the right part. The problem of constructing the synthesising control function providing the transfer of this system from the initial state to the origin is considered. The sufficiently simple for numerical implementation algorithm of solution of the above-mentioned problem is obtained. It is shown that for local null controllability of the considered system, it is sufficient that the conditions of the Kalman's type were satisfied. In addition, the estimates restricting the choice of initial conditions and external disturbances under which the transfer is guaranteed are obtained. The main idea of the method of construction of the desired control function consists in reducing the original problem to stabilisation of a special kind linear non-stationary system and solving the Cauchy problem for an auxiliary system of ordinary differential equations closed by stabilising control. The simplicity of the realisation of this algorithm is determined by the construction of the auxiliary system and its stabilisation that could be obtained by analytical methods. The effectiveness of the method is illustrated by solving the problem of crane control and its numerical simulation.     

Risk factors associated with online game addiction: A hierarchical model

Online gaming addiction has been increasingly recognized as a mental disorder. However, the predictive factors that lead to online gaming addiction are not well established. The aim of this study was to identify factors that may influence the development of online gaming addiction. A total of 263 patients with problematic online gaming addiction (255 males (97%) and 8 females (3%), age: mean = 20.4 ± 5.8 years) and153 healthy comparison subjects (118 males (77%) and 35 females (23%), age: 21.2 ± 5.5 years, range) were recruited for participation in the current study. Hierarchical logistic regression analyses among each set of variables were conducted. Individual factors (sex and age), cognitive factors (IQ and perseverative errors), psychopathological conditions (ADHD, depression, anxiety, and impulsivity), and social interaction factors (family environment, social anxiety, and self-esteem) were evaluated in a stepwise fashion. All four factors were associated with online gaming addiction, with psychopathological conditions being the strongest risk factors for the addiction. Individual factors, psychological factors, and social interactions were associated with the development of pure online gaming addiction. As before, psychological factors (attention, mood, anxiety and impulsivity) were the strongest risk factors for online gaming addiction in patients with pure online gaming addiction. Psychopathologies, including ADHD and depression, were the strongest factors associated with the development of online gaming addiction in individuals.     

Design of Feedback Shift Register of Against Power Analysis Attack

Stream ciphers based on linear feedback shift register (LFSR) are suitable for constrained environments, such as satellite communications, radio frequency identification devices tag, sensor networks and Internet of Things, due to its simple hardware structures, high speed encryption and lower power consumption. LFSR, as a cryptographic primitive, has been used to generate a maximum period sequence. Because the switching of the status bits is regular, the power consumption of the LFSR is correlated in a linear way. As a result, the power consumption characteristics of stream cipher based on LFSR are vulnerable to leaking initialization vectors under the power attacks. In this paper, a new design of LFSR against power attacks is proposed. The power consumption characteristics of LFSR can be masked by using an additional LFSR and confused by adding a new filter Boolean function and a flip-flop. The design method has been implemented easily by circuits in this new design in comparison with the others.     

探针馈电圆柱共形微带天线阻抗特性的FDTD法分析

将圆柱坐标系下非分裂式理想匹配层吸收边界条件(UPML)引入到圆柱共形微带天线的全波分析中，并给出了其中的场量迭代方程，明显地减小了计算空间，简化了编程；提出了圆柱坐标系下考虑有限尺寸探针半径的新算法，使得计算结果更加精确；应用GPOF方法预估了时域晚时响应，使计算时间减少了70％～90％。本文给出的模型能够对任意多层圆柱共形结构的微带天线进行计算，因此对此类天线的CAD设计具有实际意义。     

An Exploratory Study of E-Business Success Factors

E-business success factors are Important for traditional enterprises to implement e-business. This topic is attracting more and more researchers to study. This paper makes an exploratory study on the factors influencing e-business success. Firstly, based on the literature review, 52 factors are suggested. Secondly, two rounds of survey with Delphi method are conducted. Qualitative and quantitative analysis are used to identify 57 factors. This is the foundation of empirical study.     

STATIONARY TANGENT: THE DISCRETE AND NON-SMOOTH CASE

Abstract. In Keich (2000 ),we define a stationary tangent process, or a locally optimal stationary approximation, to a real non-stationary smooth Gaussian process. This paper extends the idea by constructing a discrete tangent – a `locally' optimal stationary approximation – for a discrete time, real Gaussian process. Analogously to the smooth case, our construction relies on a generalization of the recursion formula for the orthogonal polynomials of the spectral distribution function. More precisely, we use a generalization of the Schur parameters to identify the stationary tangent. By way of discretizing, we later demonstrate how this tangent can be used to obtain `good' local stationary approximations to non-smooth continuous time, real Gaussian processes. Further, we demonstrate how, analogously to the curvatures in the smooth case, the Schur parameters can be used to determine the order of stationarity of a non-smooth process.     

Boole函数的线性可分性(Ⅰ)——n-维超立方体的基本理论

Boole函数的线性可分性是前向人工神经网络理论中的一个比较困难的问题之一。目前仅对变量数n≤7的某些问题给予讨论。当n≥8时,尚无判别Boole函数线性可分的一般准则,更无线性可分Boole函数的计数公式。基于此,本文详细地研究了与Boole函数线性可分性有关的n-维超立方体的基本理论,包括n-维超立方体的基本性质、超立方体中的平行线、子超立方体的计数等,并给出了构造n-维超立方体图的一种新方法。