This paper reports the results of a study on the implementation of a sustainable teaching model based on the OBE (Outcome-Based Education) concept and the TSEM (Teach, Study, Evaluate, and Manage) framework in computer science and technology at NingboTech University, China. In the context of digital education, the OBE concept and the TSEM framework are integrated to explore sustainable teaching and learning models based on “artificial intelligence and education”. Based on the core concept of engineering professional education accreditation, the course is designed by using the PCCM (Professional Competency Correlation Matrix) method to build a model based on big data analysis, deepen the classroom teaching reform of “artificial intelligence and education”, and explore the integrated digital sustainable teaching mode of “teaching, learning, evaluation, and management”. The aim of this study is to explore the effectiveness of the teaching model based on OBE and the TSEM framework on students’ sustainable development. The results show that students deepen their learning in computer science while enhancing their own learning initiative, teamwork skills, innovation skills, and awareness of sustainable development. Research shows that our teaching model plays an important role in the development of student sustainable education, enhancing student engineering practice and innovation capabilities and cultivating applied innovative talents. The efficacy of the teaching model based on the OBE concept and the TSEM framework for improving students’ competence in sustainable education warrants further investigation.

Ultracompact channel add-drop filter consisting of a single nanobeam photonic crystal cavity is proposed, designed and demonstrated. Transversely anti-symmetric multimode nanobeam photonic crystal cavity is employed in the design to implement degenerate resonant modes that are indispensable for achieving complete channel dropping function. The experimental results on the silicon-on-insulator show that the insertion losses of drop port, the crosstalk of add port of the filter are -1 dB and -14 dB, respectively. Typical modal volume and footprint of the involved nanobeam photonic crystal cavity are small as 1.2(/n)³ and 20 m² respectively, indicating huge potentials in developing low-power consumption tunable devices for future VLSI on-chip photonic applications.

High-radix Montgomery Modular Multiplication (MMM) is flexible and consumes fewer cycles, but turns inefficient especially when it comes to low-bit calculation. In this brief, we propose a high-radix MMM algorithm, called Separated Iterative Digit-Digit Modular Multiplication (S-IDDMM), which accelerates the MMM by taking full advantage of multipliers and adders. The relationship among clock cycles, pipeline of multiplications and number of multipliers for the proposed algorithm is derived and utilized to optimize the overall efficiency jointly. Xilinx Virtex-7 FPGA implementations of S-IDDMM in 256 bits and 512 bits are constructed with radix-32 and radix-64, respectively. Compared with IDDMM design reported elsewhere IDDMM, our calculation time is reduced by more than 2 times with a similar area cost, due to deep use of multipliers and higher frequency.

With the continuous and rapid development of Cloud Computing, Big Data and Internet of Things, it is extremely critical to protect data with homomorphism, privacy and integrity. For this, Rezaeibagha et al. proposed a new cryptographic primitive, called homomorphic signcryption. However, the current homomorphic signcryption schemes either only support linear computation or are built on non-standard assumption. Therefore, it is interesting to design a leveled fully homomorphic signcryption (FHSC) scheme from the standard assumption. In this work, we present a leveled FHSC scheme from lattices. For this, we exert classical sign-then-encrypt method and surmount the difficulty of homomorphic multiplicative evaluation in the way of encrypting every elements. Moreover, we prove its indistinguishability against chosen plaintext attacks (IND-CPA) and strong unforgeability (SUF) under hard problems of standard lattices.