linear network
Recently Published Documents


TOTAL DOCUMENTS

694
(FIVE YEARS 118)

H-INDEX

32
(FIVE YEARS 3)

Sensors ◽  
2022 ◽  
Vol 22 (2) ◽  
pp. 656
Author(s):  
Jingyi Liu ◽  
Shuni Song ◽  
Jiayi Wang ◽  
Maimutimin Balaiti ◽  
Nina Song ◽  
...  

With the improvement of industrial requirements for the quality of cold rolled strips, flatness has become one of the most important indicators for measuring the quality of cold rolled strips. In this paper, the strip production data of a 1250 mm tandem cold mill in a steel plant is modeled by an improved deep neural network (the improved DNN) to improve the accuracy of strip shape prediction. Firstly, the type of activation function is analyzed, and the monotonicity of the activation function is deemed independent of the convexity of the loss function in the deep network. Regardless of whether the activation function is monotonic, the loss function is not strictly convex. Secondly, the non-convex optimization of the loss functionextended from the deep linear network to the deep nonlinear network, is discussed, and the critical point of the deep nonlinear network is identified as the global minimum point. Finally, an improved Swish activation function based on batch normalization is proposed, and its performance is evaluated on the MNIST dataset. The experimental results show that the loss of an improved Swish function is lower than that of other activation functions. The prediction accuracy of a deep neural network (DNN) with an improved Swish function is 0.38% more than that of a deep neural network (DNN) with a regular Swish function. For the DNN with the improved Swish function, the mean square error of the prediction for the flatness of cold rolled strip is reduced to 65% of the regular DNN. The accuracy of the improved DNN is up to and higher than the industrial requirements. The shape prediction of the improved DNN will assist and guide the industrial production process, reducing the scrap yield and industrial cost.


2022 ◽  
Vol 0 (0) ◽  
pp. 0
Author(s):  
Sascha Kurz

<p style='text-indent:20px;'>A basic problem for constant dimension codes is to determine the maximum possible size <inline-formula><tex-math id="M1">\begin{document}$ A_q(n,d;k) $\end{document}</tex-math></inline-formula> of a set of <inline-formula><tex-math id="M2">\begin{document}$ k $\end{document}</tex-math></inline-formula>-dimensional subspaces in <inline-formula><tex-math id="M3">\begin{document}$ \mathbb{F}_q^n $\end{document}</tex-math></inline-formula>, called codewords, such that the subspace distance satisfies <inline-formula><tex-math id="M4">\begin{document}$ d_S(U,W): = 2k-2\dim(U\cap W)\ge d $\end{document}</tex-math></inline-formula> for all pairs of different codewords <inline-formula><tex-math id="M5">\begin{document}$ U $\end{document}</tex-math></inline-formula>, <inline-formula><tex-math id="M6">\begin{document}$ W $\end{document}</tex-math></inline-formula>. Constant dimension codes have applications in e.g. random linear network coding, cryptography, and distributed storage. Bounds for <inline-formula><tex-math id="M7">\begin{document}$ A_q(n,d;k) $\end{document}</tex-math></inline-formula> are the topic of many recent research papers. Providing a general framework we survey many of the latest constructions and show the potential for further improvements. As examples we give improved constructions for the cases <inline-formula><tex-math id="M8">\begin{document}$ A_q(10,4;5) $\end{document}</tex-math></inline-formula>, <inline-formula><tex-math id="M9">\begin{document}$ A_q(11,4;4) $\end{document}</tex-math></inline-formula>, <inline-formula><tex-math id="M10">\begin{document}$ A_q(12,6;6) $\end{document}</tex-math></inline-formula>, and <inline-formula><tex-math id="M11">\begin{document}$ A_q(15,4;4) $\end{document}</tex-math></inline-formula>. We also derive general upper bounds for subcodes arising in those constructions.</p>


2021 ◽  
Vol 12 ◽  
Author(s):  
Carter Allen ◽  
Brittany N. Kuhn ◽  
Nazzareno Cannella ◽  
Ayteria D. Crow ◽  
Analyse T. Roberts ◽  
...  

Opioid use disorder is a psychological condition that affects over 200,000 people per year in the U.S., causing the Centers for Disease Control and Prevention to label the crisis as a rapidly spreading public health epidemic. The behavioral relationship between opioid exposure and development of opioid use disorder (OUD) varies greatly between individuals, implying existence of sup-populations with varying degrees of opioid vulnerability. However, effective pre-clinical identification of these sub-populations remains challenging due to the complex multivariate measurements employed in animal models of OUD. In this study, we propose a novel non-linear network-based data analysis workflow that employs seven behavioral traits to identify opioid use sub-populations and assesses contributions of behavioral variables to opioid vulnerability and resiliency. Through this analysis workflow we determined how behavioral variables across heroin taking, refraining and seeking interact with one another to identify potentially heroin resilient and vulnerable behavioral sub-populations. Data were collected from over 400 heterogeneous stock rats in two geographically distinct locations. Rats underwent heroin self-administration training, followed by a progressive ratio and heroin-primed reinstatement test. Next, rats underwent extinction training and a cue-induced reinstatement test. To enter the analysis workflow, we integrated data from different cohorts of rats and removed possible batch effects. We then constructed a rat-rat similarity network based on their behavioral patterns and implemented community detection on this similarity network using a Bayesian degree-corrected stochastic block model to uncover sub-populations of rats with differing levels of opioid vulnerability. We identified three statistically distinct clusters corresponding to distinct behavioral sub-populations, vulnerable, resilient and intermediate for heroin use, refraining and seeking. We implement this analysis workflow as an open source R package, named mlsbm.


2021 ◽  
Vol 2069 (1) ◽  
pp. 012197
Author(s):  
M Rahiminejad ◽  
D Khovalyg

Abstract The presence of a ventilated air cavity between the external cladding and the wall core of a wall assembly can have a varying contribution to the thermal performance of the building envelope. In particular, the thermal resistance of a ventilated air-space is a dynamic parameter that is influenced by various thermo-physical parameters. In this study, a theoretical definition of the thermal resistance of a ventilated air-space behind an external cladding is introduced, employing a non-linear network of thermal resistances in the air-space. A numerical code is developed for the steady-state condition and verified with data from hot box tests available in the literature. Thereafter, a parametric analysis is performed based on the air change rate in the cavity (0 to 1000 1/h), type of the external cladding (brick and vinyl siding), seasonal variation (summer and winter conditions), and presence of the reflective insulation. The results are compared with a closed cavity to see the efficiency of the ventilation in the air-space. The results confirm that the theoretical thermal resistance of the ventilated air-space is a function of multiple factors, and its magnitude varies under different conditions.


2021 ◽  
Vol ahead-of-print (ahead-of-print) ◽  
Author(s):  
Sai Prasanthi Kasimsetti ◽  
Asdaque Hussain

Purpose The research work is attained by Spurious Transmission–based Enhanced Packet Reordering Method (ST-EPRM). The packet reordering necessity is evaded by presenting random linear network coding process on wireless network physical layer which function on basis of sequence numbers. The spurious retransmission happening over wireless network is obtained by presenting monitoring concept for reducing number of spurious retransmissions because it might need more than three DUPACKs for triggering fast retransmit. This monitoring node performs as centralized node as well variation amid buffer length and number of packets being sent can be predicted. This information helps in differentiating spurious retransmission from the packet loss. Design/methodology/approach Based on transmission detection, action is accomplished whether to retransmit or evade transmission. Monitoring node selection is achieved by presenting improved cuckoo search algorithm. The modified support vector machine algorithm is greatly used for variation-based spurious transmission. Findings The research work which is attained by ST-EPRM. The packet reordering necessity is evaded by presenting random linear network coding process on wireless network physical layer which function on basis of sequence numbers. The spurious retransmission happening over wireless network is obtained by presenting monitoring concept for reducing number of spurious retransmissions because it might need more than three DUPACKs for triggering fast retransmit. This monitoring node performs as centralized node as well variation amid buffer length and number of packets being sent can be predicted. This information helps in differentiating spurious retransmission from the packet loss. Originality/value Based on transmission detection, action is accomplished whether to retransmit or evade transmission. Monitoring node selection is achieved by presenting improved cuckoo search algorithm. The modified support vector machine algorithm is greatly used for variation-based spurious transmission.


Author(s):  
M. I. Borrajo ◽  
C. Comas ◽  
S. Costafreda-Aumedes ◽  
J. Mateu

AbstractWildlife-vehicle collisions on road networks represent a natural problem between human populations and the environment, that affects wildlife management and raise a risk to the life and safety of car drivers. We propose a statistically principled method for kernel smoothing of point pattern data on a linear network when the first-order intensity depends on covariates. In particular, we present a consistent kernel estimator for the first-order intensity function that uses a convenient relationship between the intensity and the density of events location over the network, which also exploits the theoretical relationship between the original point process on the network and its transformed process through the covariate. We derive the asymptotic bias and variance of the estimator, and adapt some data-driven bandwidth selectors to estimate the optimal bandwidth. The performance of the estimator is analysed through a simulation study under inhomogeneous scenarios. We present a real data analysis on wildlife-vehicle collisions in a region of North-East of Spain.


Sign in / Sign up

Export Citation Format

Share Document