教学课程资源库 更多>>

关键词： Data modelling   Legislative solutions   Civil registers   Commercial registers  

摘要： The process of data modelling can be empowering, as the resulting information system can intentionally or accidentally reshape the real world. Examples from civil and commercial registers from German and European Law illustrate that neither legal nor computer science are sufficiently aware of the risks and opportunities involved. We demonstrate that the power inherent in data modelling is rarely properly accounted for. Awareness seems to be - by and large - universally lacking. Since civil and commercial registers have evolved from paper based systems, we cast an outlook on registers designed de novo, such as the Transparenz-and Gesellschaftsregister.

关键词： Security System   Science And Technology   Information Technology   Computer Science   Masters Degree   Internet Of Things   Computer Technology   Electrical Engineering   Wireless Sensor   Efficient Design   Electronic Technology   Department Of Technology   Wireless Power Transfer   Wireless Sensor Networks   Postdoctoral Research   Side Channel   Science Degree   Technology Of China   Ph D Degree   KU Leuven  

摘要： Gang Qu received the BS degree in mathematics from the University of Science and Technology of China (USTC), China, and the PhD degree in computer science from the University of California, Los Angeles (UCLA), USA. He is currently a professor with the Department of Electrical and Computer Engineering, University of Maryland, College Park, MD, USA, where he leads the Maryland Embedded Systems and Hardware Security Lab (MeshSec Lab) and the Wireless Sensor Laboratory. His research interests include hardware security and trust, artificial intelligence, security in vehicular systems, and the Internet of Things. He is also known for his work on wireless sensor networks, low power and energy efficient embedded system design.

关键词： Reaction Rate   Computer Science   Open Research   Evolutionary Computation   Guest Editors   Editor In Chief  

摘要： We have a special issue on the logistical histories of computing, which its guest editors, Matthew Hockenberry and Miriam Posner will introduce. My introduction will thus be brief, though with an important announcement.

关键词： computer science   algorithm   computer vision   computational geometry   shape features  

摘要： A new algorithm is presented for detecting the local weak reflection symmetries in raster images. It uses contours extracted from the segmented image. A convex hull is constructed on the contours, and so-called anchor points are placed on it. The bundles of symmetry line candidates are placed in these points. Each line splits the plane into two open half-planes and arranges the contours into three sets: the first contains the contours pierced by the considered line, while the second and the third include the contours located in one or the other half-plane. The contours are then checked for the reflection symmetry. This means looking for self-symmetries in the first set, and symmetric pairs with one contour in the second set and one contour in the third set. The line which is evaluated as the best symmetry line is selected. After that, the symmetric contours are removed from sets two and three. The remaining contours are then checked again for symmetry. A multi-branch tree representing the hierarchy of the detected local symmetries is the result of the algorithm.

关键词： Education   Academic learning   Questioning   Computer science   Artificial intelligence   Machine learning  

摘要： "Why don't students learn?" is a common question that educators try to address. To encourage students to become more engaged in the learning process, we believe in fostering their natural curiosity by encouraging them to ask high-level questions. To support this approach, we have compiled a dataset of questions that we hope will aid in the training of artificial intelligence (AI) models and ultimately improve the learning experience for students. To develop our dataset, we collected anonymous student questioning data in the Summer 2023 semester, utilizing our online application named "Palta Question", resulting in a dataset of 8,811 unique questions. The dataset consists of students' inquiries which underwent basic question validation using a sophisticated keyword-based approach, manual categorization by topic and course content, as well as complexity assessment using Bloom's taxonomy keywords which have also been included in the dataset. To ensure question uniqueness, we implemented the Levenshtein distance algorithm to exclude questions with a high similarity rate. This dataset provides targeted insights into student inquiry patterns and knowledge gaps within the domain of 'Introduction to Computers and Research' and 'Data Structure' courses, originating from the students at Independent University, Bangladesh (IUB). While its scope is confined to a specific student group and academic context, limiting broader applicability, it remains valuable for detailed studies in these subjects and serves as a useful foundation for AI -based educational research tools. To demonstrate the effectiveness of the dataset, we also tested it to train the AI to perform basic tasks like sorting questions according to their courses and topics. However, we envision researchers utilizing it to enhance education and aid in students' learning. (c) 2024 The Author(s). Published by Elsevier Inc. This is an open access article under the CC BY license ( http://***/licenses/by/4.

关键词： Blockchains   Hash functions   Computer science   Behavioral sciences   Authorization   Nickel   Maintenance engineering   Data management   trapdoor management   accountability   redactable blockchain   stability  

摘要： Blockchain provides trustworthy properties such as decentralization, traceability, and transparency, and has been applied in various fields. Given the complexity of guaranteeing the accuracy of the input data, erroneous data may be stored on the blockchain, making it hard to modify. As an effective solution, redactable blockchain allows on-chain data to be modified by introducing a chameleon hash function with a trapdoor, which enables on-chain erroneous data to be corrected. However, existing redactable blockchain solutions often require trusted third parties, have huge overhead, or lack effective accountability mechanisms to meet data security needs. Therefore, this paper proposes a secure, efficient and accountable data management scheme based on redactable blockchain. To cope with the possible frequent editing needs, we design an efficient and accountable distributed trapdoor recovery mechanism that reliably maintains data security while avoiding the security risks associated with centralized management. Various information during the trapdoor management process is also recorded on the chain as the basis for implementing accountability mechanisms. In addition, the one-time trapdoor technology allows the blockchain system to reduce the maintenance complexity of the system by eliminating the need to frequently update the system parameters when partial trapdoor information needs to be published. Theoretical and experimental results show that our scheme can achieve an efficient accountability mechanism while modifying the data on the chain at low cost.

关键词： Containers   Concurrent computing   Serverless computing   Multiplexing   Monopoly   Costs   Computer science   Cloud computing   serverless computing   batching request   resource management  

摘要： With high scalability and flexibility, serverless computing is becoming the most promising computing model. Existing serverless computing platforms initiate a container for each function invocation, which leads to a huge waste of computing resources. Our examinations reveal that (i) executing invocations concurrently within a single container can provide comparable performance to that provided by multiple containers (i.e., traditional approaches);(ii) redundant resources generated within a container result in memory resource waste, which prolongs the execution time of function invocations. Motivated by these insightful observations, we propose FaaSBatch - a serverless framework that reduces invocation latency and saves scarce computing resources. In particular, FaaSBatch first classifies concurrent function requests into different function groups according to the invocation information. Next, FaaSBatch batches the invocations of each group, aiming to minimize resource utilization. Then, FaaSBatch utilizes an inline parallel policy to map each group of batched invocations into a single container. Finally, FaaSBatch expands and executes invocations of containers in parallel. To further reduce invocation latency and resource utilization, within each container, FaaSBatch reuses redundant resources created during function execution. We conduct extensive experiments based on Azure traces to evaluate the effectiveness and performance of FaaSBatch. We compare FaaSBatch with three state-of-the-art schedulers Vanilla, SFS, and Kraken. Our experimental results show that FaaSBatch effectively and remarkably slashes invocation latency and resource overhead. For instance, when executing I/O functions, FaaSBatch cuts back the invocation latency of Vanilla, SFS, and Kraken by up to 72.58%, 74.10%, and 72.62%, respectively;FaaSBatch also slashes the resource overhead of Vanilla, SFS, and Kraken by 70.2% to 98.40%, 67.74% to 98.12%, and 43.01% to 78.90%, respectively.

关键词： Hyperprolific authors   Coauthorship networks   Network backbone  

摘要： Scientific authors' collaborations are influenced by various factors, such as their field, geographic region, and institutional role. Here we focus on a group of authors whose patterns of publications greatly deviate from the average, previously referred as hyperprolific authors. Prior studies have investigated the emergence of hyperprolific authors and their productivity. In this article, we focus on the role of coauthorships in the hyperprolific authors' publication profiles. Based on a network model that represents researchers as nodes and weighted edges as the number of collaborations between a pair of researchers, we argue that not all network edges have the same importance to characterize the existence of hyperprolific authors. As such, we filter out "sporadic" coauthorships, revealing an underlying structure composed only of edges representing consistent and repetitive collaborations, named as the network backbone. Our network-oriented methodology was applied to a dataset of Computer Science publications extracted from DBLP, covering an 11-year period from 2010 to 2020. Our experiments reveal significant topological differences between the full coauthorship networks and backbones, concerning only authors with very off-the-pattern profiles. We also show that hyperprolific authors are consistently more likely to exhibit off-the-pattern coauthorships and that an author's probability of being present in the backbone substantially increases with her topological proximity to a hyperprolific author. Finally, we investigate how authors' hyperprolific profiles correlate to their presence in the backbone.

关键词： Codes   Symbols   Synchronization   Upper bound   Lead   Indexes   Computer science   Non-overlapping codes   weakly mutually uncorrelated codes   cross-bifix-free codes  

摘要： Non-overlapping codes have been studied for almost 60 years. In such a code, no proper, non-empty prefix of any codeword is a suffix of any codeword. In this paper, we study codes in which overlaps of certain specified sizes are forbidden. We prove some general bounds and we give several constructions in the case of binary codes. Our techniques also allow us to provide an alternative, elementary proof of a lower bound on non-overlapping codes due to Levenshtein (1964).