大学物理课程全题型数字化在线考试的建设与实践

高校开展数字化在线考试是高等教育数字化转型的一个重要环节,国内多所高校也有相关尝试.目前主要存在不同科目多样题型的在线输入问题.本文介绍了山东大学与科大讯飞联合开发的一套在线考试系统,借助高拍仪辅助输入,解决了所有题型的输入问题.进一步以近年山东大学大学物理I课程为例,详细介绍了数字化在线考试的组织与实施,并对考试结果做简单分析,预测该模式具有很大的推广和应用价值.

人工智能大模型技术在教育考试全题型阅卷中的应用

随着数字技术的不断发展,教育考试阅卷工作正迈向智能化时代,AI大模型技术在阅卷中的应用探索已成为研究热点和发展重点。汇隽可之将其在认知智能生成式大语言模型领域研发的AI核心技术应用于考试阅卷工作,经过3年的实践与完善,该系统在AI评卷速度、辅助定标成效、AI评分质量等方面均得到有效验证。目前,AI大模型技术在教育考试全题型阅卷工作中已成功实现辅助评分功能,未来有望在各类考试中逐步替代人工,最终实现AI全自动评分。

Security Model for Analyzing Data Privacy in Multipath Transport

In order to investigate the enhancement of data privacy by distributing data packets via multiple paths, this paper fommlates a security model and analyzes the privacy problem in mul- tipath scenarios leveraging inforrmtion theoretic concept. Based on proposed model, a privacy function related to the path number is discussed. We heuristically recommend the optin^al path num- ber and analyze the tradeoff among the perform- ance, resource consumption and privacy. For re- ducing the inforlmtion leakage, the data schedule algorithms are also proposed. The analytical model can provide guidelines for the multipath protocol design.

A Decision Model Based on Grey Rough Sets Integration with Incomplete Information

In this paper, for multiple attribute decision-making problem in which attribute values are interval grey numbers and some of them are null values, a decision model based on grey rough sets integration with incomplete information is proposed. We put forward incidence degree coefficient formula for grey interval, by information entropy theory and analysis technique, the method and principle is presented to fill up null values. We also establish the method of grey interval incidence cluster. Because grey system theory and Rough set theory are complementary each other, decision table with preference information is obtained by the result of grey incidence cluster. An algorithm for inducing decision rules based on rough set theory and the dominance relationship is presented. In some extent, this algorithm can deal with decision-making problem in which the attribute values are interval grey numbers and some of them are null values. Contrasted with classical model of cluster decision-making, the algorithm has an advantage of flexibility and compatibility to new information.

Safety Analysis for Older Drivers at SignalizedIntersections

The proportions of older drivers continue to increase since baby boom generation is becoming old. The level of mobility of older drivers is also increasing. Older drivers begin to noticeably be over-involved in fatal crashes. Intersections appear to be hazardous to older drivers, particularly left turn due to one or more of. sensory, perceptual, cognitive, physical and general driving knowledge deficiencies. The safety concern of older drivers is also becoming significant. Ten years of crash data has been extracted from Kansas accident report system. It has been analyzed using SAS （statistical analysis system） software. Five different age groups have been considered. Comparison has been made between different age groups of the same gender, and the same age group for different gender. Effects of light condition, weather condition, surface type, surface condition, road character and construction/maintenance zone on older drivers＇ safety have also been considered in this study. It has been found out that proportion of older drivers in through movement involved in accident decreases as age increases whereas the proportion of left turn accidents increases with age, left turn is harder for females in all age groups, and proportion of right turn accidents has no specific trend. Most of the accidents have taken place during daylight when there are no adverse weather conditions on dry surface, straight and level road, and blacktop surface type.

Ill-conditioned problems of dam safety monitoring models and their processing methods

The focus of this paper is the ill-conditioned problems in the dam safety monitoring model. The reasons to give rise to the ill-conditioned problems in statistical models,deterministic models and hybrid models are analyzed in detail,and the criterions for ill-conditioned models are investigated. It is shown that safety monitoring models are not easy to be ill-conditioned if the number of influence factors is less than seven. Moreover,the models have a high accuracy and can meet the engineering requirements. Another frequently encountered problem in establishing a safety monitoring model is the existence of inflection points,which are often present in the mathematical model for the hydraulic components in deterministic models and hybrid models. The conditions for inflection points are studied and their treatments are suggested. Numerical example indicates that the treatments proposed in this paper are effective in removing the ill-conditioned problems.

Solving the maximal matching problem with DNA molecules in Adleman-Lipton model

The maximal matching problem （MMP） is to find maximal edge subsets in a given undirected graph, that no pair of edges are adjacent in the subsets. It is a vitally important NP-complete problem in graph theory and applied mathematics, having numerous real life applications in optimal combination and linear programming fields. It can be difficultly solved by the electronic computer in exponential level time. Meanwhile in previous studies deoxyribonucleic acid （DNA） molecular operations usually were used to solve NP-complete continuous path search problems, e.g. HPP, traveling salesman problem, rarely for NP-hard problems with discrete vertices or edges solutions, such as the minimum vertex cover problem, graph coloring problem and so on. In this paper, we present a DNA algorithm for solving the MMP with DNA molecular operations. For an undirected graph with n vertices and m edges, we reasonably design fixed length DNA strands representing vertices and edges of the graph, take appropriate steps and get the solutions of the MMP in proper length range using O（n^3） time. We extend the application of DNA molecular operations and simultaneously simplify the complexity of the computation.