检索结果-内蒙古大学图书馆

47th SEFI Annual Conference 2019 - Varietas Delectat: Complexity is the New Normality

作者： Alves, L. Gajić, D. Rangel Henriques, P. Ivančević, V. Lalić, M. Luković, I. Varanda Pereira, M.J. Popov, S. Correia Tavares, P. Instituto Politécnico de Bragança Escola Superior de Tecnologia e Gestão Departamento de Informática e Comunicações Bragança Portugal University of Novi Sad Faculty of Technical Sciences Department of Computing and Control Engineering Novi Sad Serbia Universidade do Minho Escola de Engenharia Departamento de Informática Braga Portugal Instituto Superior de Engenharia do Porto Departamento de Engenharia Informática Porto Portugal

ISBN: (纸本)9782873520182

Programming is a skill needed across various disciplines and it is becoming more valuable for many job positions. However, students still appear to struggle in introductory programming courses. Academic achievement in programming may be influenced by numerous factors and may vary across countries, as observed in a previous study focused on Portugal and Serbia. In the present study, factors generally related to achievement and attrition, namely student entrance knowledge, expectations, and motivation, were examined as possible reasons behind achievement issues in introductory programming. An anonymous questionnaire that comprised closed-ended items was given to students enrolled in introductory programming courses at technically oriented higher education institutions in Portugal and Serbia. After data cleansing, response data from 678 students were quantitatively analysed to identify overall characteristics of the investigated groups, as well as differences between the groups from the two countries. The students generally had numerous expectations and motives regarding introductory programming, but their reported entrance knowledge of programming was generally at low levels. on average, the groups from the two countries were similar. The main differences include higher entrance knowledge for students from Serbia and slightly higher expectations for students from Portugal. These findings form a basis for further inquiry into causes of previously observed student performance variations between Portugal and Serbia. As there are many commonalities between the students from these countries, we may work on novel instruction methods and tools that would be useful for programming teachers and enrolled students in both countries. © 2020 SEFI 47th Annual Conference: Varietas Delectat... Complexity is the New Normality, Proceedings. All rights reserved.

关键词： Students

来源：评论

学校读者我要写书评

暂无评论

Customized quantum annealing schedules

arXiv

引用

arXiv 2021年

作者： Khezri, Mostafa Dai, Xi Yang, Rui Albash, Tameem Lupascu, Adrian Lidar, Daniel A. Department of Electrical Engineering University of Southern California Los AngelesCA90089 United States Center for Quantum Information Science & Technology University of Southern California Los AngelesCA90089 United States Department of Physics and Astronomy University of Waterloo WaterlooON Canada Institute for Quantum Computing University of Waterloo WaterlooON Canada Department of Electrical and Computer Engineering University of New Mexico AlbuquerqueNM87131 United States Center for Quantum Information and Control CQuIC University of New Mexico AlbuquerqueNM87131 United States Department of Chemistry University of Southern California Los AngelesCA90089 United States Department of Physics University of Southern California Los AngelesCA90089 United States

In a typical quantum annealing protocol, the system starts with a transverse field Hamiltonian which is gradually turned off and replaced by a longitudinal Ising Hamiltonian. The ground state of the Ising Hamiltonian encodes the solution to the computational problem of interest, and the state overlap with this ground state gives the success probability of the annealing protocol. The form of the annealing schedule can have a significant impact on the ground state overlap at the end of the anneal, so precise control over these annealing schedules can be a powerful tool for increasing success probabilities of annealing protocols. Here we show how superconducting circuits, in particular capacitively shunted flux qubits (CSFQs), can be used to construct quantum annealing systems by providing tools for mapping circuit flux biases to Pauli coefficients. We use this mapping to find customized annealing schedules: appropriate circuit control biases that yield a desired annealing schedule, while accounting for the physical limitations of the circuitry. We then provide examples and proposals that utilize this capability to improve quantum annealing performance. Copyright © 2021, The Authors. All rights reserved.

关键词： Annealing

来源：评论

学校读者我要写书评

暂无评论

Prediction of Mastitis in Dairy Cows Based on Milk Yield, Rumination Time, and Milk Electrical Conductivity Using Machine Learning Algorithms

SSRN

引用

SSRN 2022年

作者： Zhou, XiaoJing Wang, Hao Xu, Chuang Zhao, Zixuan Xu, Wei Deng, Zhaoju Department of Information and Computing Science Heilongjiang Bayi Agricultural University No. 5 Xinyang Road Heilongjiang Province Daqing163319 China Heilongjiang Provincial Key Laboratory of Prevention and Control of Bovine Diseases College of Animal Science and Veterinary Medicine Heilongjiang Bayi Agricultural University No. 5 Xinyang Road Heilongjiang Province Daqing163319 China Animal Husbandry and Veterinary Branch of Heilongjiang Academy of Agricultural Science Heilongjiang Province Qiqihar161005 China Department of Biosystems Division of Animal and Human Health Engineering KU Leuven Oude Markt 13 3000 Belgium College of Veterinary Medicine China Agricultural University Haidian District Tsinghua East road No.17 Beijing10010 China

In commercial dairy farms, mastitis is associated with potentially increased use of antimicrobials and associated resistance, thereby, affecting the welfare of dairy cows and increasing the rate of culling and/or death. Therefore, accurate and efficient mastitis prediction is valuable for timely intervention. Machine learning algorithms have been successfully used to solve many biological problems such as predicting or detecting subclinical mastitis using high-dimensional and noisy data obtained from sensors used on the farm. Therefore, this study aimed to develop sensor-based prediction models for bovine mastitis using variables related to daily activity and rumination time generated from collars, coupled with daily composite milk yield, and milk electrical conductivity from rotary milking systems from five commercial farms in Northeast China. We employed nine machine learning algorithms to analyze original data of 447 diseased and 2146 healthy cows obtained over 2.5 years and the corresponding Z-standardized dataset of four specific stages of lactation to train and test the prediction models for recognizing and predicting naturally occurring mastitis in these dairy cows. The sensitivity, specificity, accuracy, precision, AUC, and Matthews’s correlation coefficient of these models were calculated to evaluate the model performance. For Z-standardized data of cows in the 0-28 DIM and 29-100 DIM subgroups, the multi-layer artificial neural net (MNET) algorithm showed the best performance, with the sensitivity, specificity and accuracy of 91.89%, 93.69%, 93.24% for data of cows in 0-28 DIM, and 91.84%, 96.73, 95.44% for that in 29-100 DIM, respectively. For data of the subgroups 101–200 DIM and 201–305 DIM, random forest performed best on both the non-standardized and the Z-standardized datasets. Results of the Z-standardized dataset for all four subgroups were better than those of the non-standardized data. We also calculated the peak milk yield (PMY) and days in milk

关键词： Forecasting

来源：评论

学校读者我要写书评

暂无评论

A data-driven approach for discovering stochastic dynamical systems with non-Gaussian Lévy noise

arXiv

引用

arXiv 2020年

作者： Li, Yang Duan, Jinqiao State Key Laboratory of Mechanics and Control of Mechanical Structures College of Aerospace Engineering Nanjing University of Aeronautics and Astronautics 29 Yudao Street Nanjing210016 China Department of Applied Mathematics College of Computing Illinois Institute of Technology ChicagoIL60616 United States

With the rapid increase of valuable observational, experimental and simulating data for complex systems, great efforts are being devoted to discovering governing laws underlying the evolution of these systems. However, the existing techniques are limited to extract governing laws from data as either deterministic differential equations or stochastic differential equations with Gaussian noise. In the present work, we develop a new data-driven approach to extract stochastic dynamical systems with non-Gaussian symmetric Lévy noise, as well as Gaussian noise. First, we establish a feasible theoretical framework, by expressing the drift coefficient, diffusion coefficient and jump measure (i.e., anomalous diffusion) for the underlying stochastic dynamical system in terms of sample paths data. We then design a numerical algorithm to compute the drift, diffusion coefficient and jump measure, and thus extract a governing stochastic differential equation with Gaussian and non-Gaussian noise. Finally, we demonstrate the efficacy and accuracy of our approach by applying to several prototypical one-, two- and three-dimensional systems. This new approach will become a tool in discovering governing dynamical laws from noisy data sets, from observing or simulating complex phenomena, such as rare events triggered by random fluctuations with heavy as well as light tail statistical features. Copyright © 2020, The Authors. All rights reserved.

关键词： Gaussian noise (electronic)

来源：评论

学校读者我要写书评

暂无评论

HAWK: Rapid Android malware detection through heterogeneous graph attention networks

arXiv

引用

arXiv 2021年

作者： Hei, Yiming Yang, Renyu Peng, Hao Wang, Lihong Xu, Xiaolin Liu, Jianwei Liu, Hong Xu, Jie Sun, Lichao The School of Cyber Science and Technology Beihang University Beijing100083 China The School of Computing University of Leeds LeedsLS2 9JT United Kingdom The National Computer Network Emergency Response Technical Team Coordination Center of China Beijing100029 China The School of Computer Science and Software Engineering East China Normal University Shanghai Trusted Industrial Control Platform Co. Ltd. Shanghai200062 China The Department of Computer Science and Engineering Lehigh University Bethlehem United States

Android is undergoing unprecedented malicious threats daily, but the existing methods for malware detection often fail to cope with evolving camouflage in malware. To address this issue, we present HAWK, a new malware detection framework for evolutionary Android applications. We model Android entities and behavioural relationships as a heterogeneous information network (HIN), exploiting its rich semantic meta-structures for specifying implicit higher-order relationships. An incremental learning model is created to handle the applications that manifest dynamically, without the need for re-constructing the whole HIN and the subsequent embedding model. The model can pinpoint rapidly the proximity between a new application and existing in-sample applications and aggregate their numerical embeddings under various semantics. Our experiments examine more than 80,860 malicious and 100,375 benign applications developed over a period of seven years, showing that HAWK achieves the highest detection accuracy against baselines and takes only 3.5ms on average to detect an out-of-sample application, with the accelerated training time of 50x faster than the existing approach. Copyright © 2021, The Authors. All rights reserved.

关键词： Android (operating system)

来源：评论

学校读者我要写书评

暂无评论

Study of Asymptotic Free Scalar Field Theories from Adaptive Perturbation Method

arXiv

引用

arXiv 2023年

作者： Ma, Chen-Te Zhang, Hui Department of Physics and Astronomy Iowa State University AmesIA50010 United States Asia Pacific Center for Theoretical Physics Pohang University of Science and Technology Gyeongsangbuk-do Pohang37673 Korea Republic of Guangdong Provincial Key Laboratory of Nuclear Science Institute of Quantum Matter South China Normal University Guangdong Guangzhou510006 China School of Physics and Telecommunication Engineering South China Normal University Guangdong Guangzhou510006 China Guangdong-Hong Kong Joint Laboratory of Quantum Matter Southern Nuclear Science Computing Center South China Normal University Guangdong Guangzhou510006 China The Laboratory for Quantum Gravity and Strings Department of Mathematics and Applied Mathematics University of Cape Town Private Bag Rondebosch7700 South Africa Key Laboratory of Atomic and Subatomic Structure and Quantum Control Institute of Quantum Matter South China Normal University Guangdong Guangzhou510006 China Physics Department Center for Exploration of Energy and Matter Indiana University BloomingtonIN47408 United States

We focus on the behavior of (2+1)d λ4 and (5+1)d λ3 or λ||3 theories in different regimes and compare the results obtained from the adaptive perturbation method with those obtained from lattice simulation. These theories are simple models that exhibit asymptotic freedom, which is a property that is also observed in more complex theories such as QCD, which describes the strong interaction between quarks and gluons. Asymptotic freedom is an important feature of these theories because it allows for a perturbative treatment of interactions at high energies. However, the standard perturbation scheme breaks down in the presence of strong interactions, and the adaptive perturbation method, which involves resuming the Feynman diagrams, is more suitable for studying these interactions. Our research involves comparing the perturbation result to lattice simulation. In the case of the 3 theory, there is no stable vacuum, so we explore evidence from the ||3 theory instead. Our results appear to show that resummation improves the strong coupling result for both the λ4 and λ||3 theories. Additionally, we improve the resummation method for the three-point coupling vertex and study the RG flow to analyze the resummation contribution and theoretical properties. Copyright © 2023, The Authors. All rights reserved.

关键词： Lattice theory

来源：评论

学校读者我要写书评

暂无评论

Integrate and Fire Neuron Implementation using CMOS Predictive Technology Model for 32nm

Integrate and Fire Neuron Implementation using CMOS Predicti...

引用

Microelectronics Technology and Devices (SBMicro)

作者： Gabriel Maranhão Janaina G. Guimarães Department of Electrical Engineering Universidade de Brasília Brasília Brazil Department of Control Automation and Computing Engineering Universidade Federal de Santa Catarina Blumenau Brazil

The propose of this work is to evolve the studies on neuromorphic circuits by simulating transistors models that look the most with the ones used in commercial process. Since most of data about company models contain a restricted access, some universities provide predictions models to reproduce the real ones. In this paper we present a silicon analog integrate and fire neuron (I&F), proposed by G. Indiveri as a part of a neuromorphic device. Using 32nm CMOS technology simulated in LTspice with BSIM4v4 and applying predictive parameters provides by Predictive Technology Model (PTM), we were able to reduce the source power, to 0.9V, and chip size of the latest design which was implemented using a 180nm CMOS process at 1.8 power supply.

关键词： Neurons Predictive models Logic gates Semiconductor device modeling Transistors Mathematical model Computational modeling

来源：评论

学校读者我要写书评

暂无评论

Binary stochastic filtering: A method for Neural network size minimization and supervised feature selection

arXiv

引用

arXiv 2019年

作者： Trelin, A. Procházka, A. Department of Solid State Engineering University of Chemistry and Technology Prague16628 Czech Republic Department of Computing and Control Engineering University of Chemistry and Technology Prague16628 Czech Republic

Binary Stochastic Filtering (BSF), the algorithm for feature selection and neuron pruning is proposed in this work. The method defines filtering layer which penalizes amount of the information involved in the training process. This information could be the input data or output of the previous layer, which directly lead to the feature selection or neuron pruning respectively, producing ad hoc subset of features or selecting optimal number of neurons in each layer. Filtering layer stochastically passes or drops features based on individual weights, which are tuned with standard backpropagation algorithm during the training process. Multifold decrease of neural network size has been achieved in the experiments. Besides, the method was able to select minimal number of features, surpassing literature references by the accuracy/dimensionality ratio. Ready-to-use implementation of the BSF layer is provided. Copyright © 2019, The Authors. All rights reserved.

关键词： Neural networks

来源：评论

学校读者我要写书评

暂无评论

Lagrangian generic second order traffic flow models for node

引用

Journal of Traffic and Transportation engineering(English Edition) 2018年第1期5卷 14-27页

作者： Asma Khelifi Habib Haj-Salem Jean-Patrick Lebacque Lotfi Nabli Engineering of Surface Transportation Networks and Advanced Computing Laboratory IFSTTAR/GRETTIA Department of Electrical Engineering Research Laboratory of Control Signal Processing and Imaging National Engineering School of Monastir

This study sheds light on higher order macroscopic traffic flow modeling on road networks, thanks to the generic second order models （GSOM family） which embeds a myriad of traffic models. It has been demonstrated that such higher order models are easily solved in Lagrangian coordinates which are compatible with both microscopic and macroscopic descriptions. The generalized GSOM model is reformulated in the Lagrangian coordinate system to develop a more efficient numerical method. The difficulty in applying this approach on networks basically resides in dealing with node dynamics. Traffic flow characteristics at node are different from that on homogeneous links. Different geometry features can lead to different critical research issues. For instance, discontinuity in traffic stream can be an important issue for traffic signal operations, while capacity drop may be crucial for lane-merges. The current paper aims to establish and analyze a new adapted node model for macroscopic traffic flow models by applying upstream and downstream boundary conditions on the Lagrangian coordinates in order to perform simulations on networks of roads, and accompanying numerical method. The internal node dynamics between upstream and downstream links are taken into account of the node model. Therefore, a numerical example is provided to underscore the efficiency of this approach. Simulations show that the discretized node model yields accurate results. Additional kinematic waves and contact discontinuities are induced by the variation of the driver attribute.

关键词： Macroscopic Traffic flow modeling GSOM family Lagrangian Node

来源：评论

学校读者我要写书评

暂无评论

A Non-Stop Double Buffering Mechanism for Dataflow Architecture

引用

Journal of Computer Science & Technology 2018年第1期33卷 145-157页

作者： Xu Tan Xiao-Wei Shen Xiao-Chun Ye Da Wang Dong-Rui Fan Lunkai Zhang Wen-Ming Li Zhi-Min Zhang Zhi-Min Tang State Key Laboratory of Computer Architecture Institute of Computing Technology Chinese Academy of Sciences Beijing 100190 China School of Computer and Control Engineering University of Chinese Academy of Sciences Beijing 100049 China State Key Laboratory of Mathematical Engineering and Advanced Computing Wuxi 214125 China Department of Computer Science The University of Chicago Chicago IL 60637 U.S.A.

Double buffering is an effective mechanism to hide the latency of data transfers between on-chip and off-chip memory. However, in dataflow architecture, the swapping of two buffers during the execution of many tiles decreases the performance because of repetitive filling and draining of the dataflow accelerator. In this work, we propose a non-stop double buffering mechanism for dataflow architecture. The proposed non-stop mechanism assigns tiles to the processing element array without stopping the execution of processing elements through optimizing control logic in dataflow architecture. Moreover, we propose a work-flow program to cooperate with the non-stop double buffering mechanism. After optimizations both on control logic and on work-flow program, the filling and draining of the array needs to be done only once across the execution of all tiles belonging to the same dataflow graph. Experimental results show that the proposed double buffering mechanism for dataftow architecture achieves a 16.2% average efficiency improvement over that without the optimization.

关键词： non-stop double buffering dataflow architecture high-performance computing

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：