1 Introduction Traditional covert communication[1]usually relies on centralized channels,which are efficient in transmission but susceptible to eavesdropping and attacks,leading to information ***,distributed methods ...
详细信息
1 Introduction Traditional covert communication[1]usually relies on centralized channels,which are efficient in transmission but susceptible to eavesdropping and attacks,leading to information ***,distributed methods also exist,such as peer-to-peer networks and distributed hash *** technology,which is decentralized,anonymous,non-tamperable and anti-attack,can be applied to covert communication to solve the problems of traditional methods and improve the quality of communication.
If computerscience programs face a challenge of convincing students that programming is fun and achievable, they have nothing on mathematics departments who face societal beliefs that math is hard and scary. Several ...
详细信息
ISBN:
(纸本)9781450394314
If computerscience programs face a challenge of convincing students that programming is fun and achievable, they have nothing on mathematics departments who face societal beliefs that math is hard and scary. Several movements in computerscience education have focused on broadening participation within computerscience and across disciplines. The "CS + X" efforts have focused on helping computerscience integrate into other disciplines. The "CS For All" movement has highlighted the importance of providing high quality computing education for all students. Simultaneously, there is increasing attention to the need to provide general education alternatives to college algebra. This paper describes a course designed to combine these goals: a course that uses programming to introduce students to functions, patterns, and spatial and computational thinking in order to meet quantitative reasoning goals set by the university. The course initially used Bricklayer as the programming environment, then transitioned to Processing. Students were successful in writing programs that created art, demonstrated mastery of quantitative literacy, and had improved attitudes following the course. This project suggests that in addition to the creation of introductory computerscience classes, courses which embed computerscience into disciplinary requirements can be a successful pathway to expand opportunities for students to learn computing.
Scratch is an innovative and the most popular block-based Visual programming Language designed for beginners to learn programming effectively. However, it lacks the capacity to allow users to learn and solve larger re...
详细信息
Functional programming (FP) lets users focus on the business logic of their applications by providing them with high-level and composable abstractions. However, both automatic memory management schemes traditionally u...
详细信息
ISBN:
(纸本)9789819722990;9789819723003
Functional programming (FP) lets users focus on the business logic of their applications by providing them with high-level and composable abstractions. However, both automatic memory management schemes traditionally used for FP, namely tracing garbage collection and reference counting, may introduce latencies in places that can be hard to predict, which limits the applicability of the FP paradigm. We reevaluate the use of lazy reference counting in single-threaded functional programming with guaranteed constant-time memory management, meaning that allocation and deallocation take only a bounded and predictable amount of time. This approach does not leak memory as long as we use uniform allocation sizes. Uniform allocation sizes were previously considered impractical in the context of imperative programming, but we find it to be surprisingly suitable for FP. Preliminary benchmark results suggest that our approach is practical, as its performance is on par with Koka's existing state-of-the-art implementation of reference counting for FP, sometimes even outperforming it. We also evaluate the effect of different allocation sizes on application performance and suggest ways of allowing large allocation in non-mission-critical parts of the program via Koka's effect system. We believe this potentially opens the door to many new industrial applications of FP, such as its use in real-time embedded software. In fact, the development of a high-level domain-specific language for describing latency-critical quantum physics experiments was one of the original use cases that prompted us to initiate this work.
The interest in applying Artificial Intelligence algorithms within security contexts is rapidly growing, particularly for the tasks related to malware detection and classification. Over the last decade, numerous Machi...
详细信息
ISBN:
(纸本)9783031652226;9783031652233
The interest in applying Artificial Intelligence algorithms within security contexts is rapidly growing, particularly for the tasks related to malware detection and classification. Over the last decade, numerous Machine Learning (ML) and Deep Learning (DL)-based techniques have been proposed to address the growth of malicious applications, focusing on utilizing features derived from dynamic malware analysis. However, these approaches are often considered black boxes due to their limited ability to explain the results they produce. On the contrary, this study seeks to develop a new model for identifying malware families in an interpretable manner. The methodology employs Genetic programming to construct a multi-class classifier characterized by a mathematical formula expressing the relationship between dynamic features and the considered malware families. Experimental results, based on Android applications from Unisa Malware Dataset (UMD), showcase the effectiveness of our approach in achieving comparable average scores to the most famous Machine Learning techniques.
This dissertation examines students' experiences during their introductory computing course at a university, focusing on exploring practice sessions aimed to improve their programming skills. The research question...
详细信息
This dissertation examines students' experiences during their introductory computing course at a university, focusing on exploring practice sessions aimed to improve their programming skills. The research questions are formulated to uncover opportunities, challenges, and students' practices in setting learning goals, and the strategies enacted by students to monitor, regulate and control their cognition, motivation, and behavior during deliberate practice. Qualitative and quantitative data informed this study. Data was gathered through in-depth semi-structured individual interviews (17 undergraduate students majoring in computerscience), three focus groups, review of relevant documents, and over 50 hours of video (recordings of the computer screen while participants were working in the programming task during lab sessions), all gathered during the focal students' CS1 course. From the data emerged themes related to the role that previous programming experience played on the participants' emotions during deliberate practice, participants' difficulties during the CS1 course, and participants' perceptions regarding the learning activities and the available learning resources. The findings revealed that previous programming experience shaped participants' involvement during lab sessions. It had a substantial effect on their sense of confidence (Bandura, 1977, 1982), and had implications on their motivation and learning. Furthermore, it influenced participants' decisions on how they engaged with the programming task. It involved the effort and time participants put into the task and how long participants persisted when experiencing difficulties (van Dinther et al., 2011). Students' SRL learning strategies used during deliberate practice were explored quantitatively and qualitatively. The statistical analysis of participants' propensities to use SRL strategies and the patterns of use of SRL strategies yield no statistically significant differences between the actions enac
Due to the diversity of products and small batch sizes, production lines are often faced with reconfiguration or even line changes. Applying digital twin technology to production lines is one of the most promising app...
详细信息
Due to the diversity of products and small batch sizes, production lines are often faced with reconfiguration or even line changes. Applying digital twin technology to production lines is one of the most promising approaches. However, factory personnel are not all aware and familiar with digital twin technology, and they have difficulty adapting or implementing digital twin scenarios. To more easily construct or reconfigure production line digital twin scenarios, this paper proposes a graphics-based, modular, and user-oriented digital twin software framework for production lines. The framework divides the digital twin implementation process into five functional modules: twin model construction, model operation, connection and interaction, control logic, visualization assistance and interaction, which are graphically encapsulated. The modular format helps standardize the construction and operation of the digital twin production line, and improves the flexibility and versatility of the framework. Meanwhile, multiple functional libraries are encapsulated to simplify the construction steps and processes based on graphical user interface. Combining visual programming to implement control logic in a low-code visual programming manner, reducing the difficulty of getting started. And various UI elements are used to enhance human-computer interaction. A digital twin platform was developed based on the proposed framework, and experiments were conducted with a hardware production line as an example. The experimental results show that it is feasible to construct digital twin production lines conveniently and reduce the complexity of the constructing process based on this platform, thus the feasibility of the framework is verified.
We give a simple, direct, and reusable logical relations technique for languages with term and type recursion and partially defined differentiable functions. We demonstrate it by working out the case of automatic diff...
详细信息
We give a simple, direct, and reusable logical relations technique for languages with term and type recursion and partially defined differentiable functions. We demonstrate it by working out the case of automatic differentiation (AD) correctness: namely, we present a correctness proof of a dual numbers style AD code transformation for realistic functional languages in the ML-family. We also show how this code transformation provides us with correct forward- and reverse-mode *** starting point is to interpret a functional programming language as a suitable freely generated categorical structure. In this setting, by the universal property of the syntactic categorical structure, the dual numbers AD code transformation and the basic $\boldsymbol{\omega } \mathbf{Cpo}$ -semantics arise as structure preserving functors. The proof follows, then, by a novel logical relations *** key to much of our contribution is a powerful monadic logical relations technique for term recursion and recursive types. It provides us with a semantic correctness proof based on a simple approach for denotational semantics, making use only of the very basic concrete model of $\omega$ -cpos.
We propose a novel approach to measure student originality in computerprogramming. We collected two sets of programming problems in Java and Python, and their solutions submitted by multiple students. We parsed the s...
详细信息
暂无评论