教学课程资源库 更多>>

关键词： Sorting   Memory management   Estimation   Computer science   Upper bound   Merging   Heuristic algorithms   Multiple longest common subsequences(MLCS)   dominant point-based approach   useless match point detection   branch elimination   smaller DAG  

摘要： It is a key issue to find out all longest common subsequences of multiple sequences over a set of finite alphabets, namely MLCS problem, in computational biology, pattern recognition and information retrieval, to name a few. However, it is very challenging to tackle the large-scale MLCS problem effectively and efficiently due to the high complexity of time and space. To this end, this paper will therefore propose a Branch Elimination-based Space and Time efficient algorithm called BEST-MLCS, which includes the following four key strategies: 1) Estimation scheme for the lower bound of the length of MLCS. 2) Estimation scheme for the upper bound of the length of the paths through the current match point. 3) Branch elimination strategy by finding all useless match points and removing the branches not on the longest paths. 4) A new Directed Acyclic Graph (DAG) construction method for constructing the smallest DAG among the existing ones. As a result, the proposed algorithm BEST-MLCS can save a lot of space and time and can handle much larger scale MLCS problems than the existing algorithms. Extensive experiments conducted on biological DNA sequences show that the performance of the proposed algorithm BEST-MLCS outperforms three state-of-the-art algorithms in terms of run-time and memory consumption.

关键词： Computer science   software engineering   requirement engineering   software quality   defect detection  

摘要： In the early stage of software development,a software requirements specification(SRS)is essential,and whether the requirements are clear and explicit is the ***,due to various reasons,there may be a large number of *** generate high-quality software requirements specifications,numerous researchers have developed a variety of ways to improve the quality of *** this paper,we propose a questions extraction method based on SRS elements decomposition,which evaluates the quality of SRS in the form of numerical *** proposed method not only evaluates the quality of SRSs but also helps in the detection of defects,especially the description problem and omission defects in *** verify the effectiveness of the proposed method,we conducted a controlled experiment to compare the ability of checklist-based review(CBR)and the proposed method in the SRS *** CBR is a classicmethod of reviewing SRS *** a lot of practice and improvement for a long time,CBR has excellent review ability in improving the quality of software requirements *** experimental results with 40 graduate studentsmajoring in software engineering confirmed the effectiveness and advantages of the proposed ***,the shortcomings and deficiencies of the proposed method are also observed through the ***,the proposed method has been tried out by engineers with practical work experience in software development industry and received good feedback.

关键词： Mirrors   Visualization   Feature extraction   Computer science   Object detection   Task analysis   Image edge detection   Mirror detection   visual chirality   intrinsic mirror property   salient object detection  

摘要： Mirror detection is challenging because the visual appearances of mirrors change depending on those of their surroundings. As existing mirror detection methods are mainly based on extracting contextual contrast and relational similarity between mirror and non-mirror regions, they may fail to identify a mirror region if these assumptions are violated. Inspired by a recent study of applying a CNN to help distinguish whether an image is flipped or not based on the visual chirality property, in this paper, we rethink this image-level visual chirality property and reformulate it as a learnable pixel level cue for mirror detection. Specifically, we first propose a novel flipping-convolution-flipping (FCF) transformation to model visual chirality as learnable commutative residual. We then propose a novel visual chirality embedding (VCE) module to exploit this commutative residual in multi-scale feature maps, to embed the visual chirality features into our mirror detection model. Besides, we also propose a visual chirality-guided edge detection (CED) module to integrate the visual chirality features with contextual features for detection refinement. Extensive experiments show that the proposed method outperforms state-of-the-art methods on three benchmark datasets.

关键词： Periodic structures   Task analysis   Computer science   Network topology   Data models   Topology   Prediction algorithms   Network representation learning   network embedding   attributed network   hierarchical attributed network   granulation  

摘要： Network representation learning, also called network embedding, aiming to learn low dimensional vectors for nodes while preserving essential properties of the network, benefits plenty of practical applications. However, how to do representation learning on the network quickly and effectively is a meaningful and challenging task, especially for the attributed networks. In this paper, we propose HANE, a Hierarchical Attributed Network Embedding framework, which is a fast and effective method by quickly constructing a hierarchical attributed network of different granularities to learn nodes representations. Specifically, for an attributed network, HANE first builds a hierarchy of successively smaller attributed network from fine to coarse by the fast granulation strategy fusing topological structure and node attributes. After using any unsupervised network embedding method to learn nodes representations of the coarsest network, HANE refines the nodes representations of the hierarchical attributed network from coarse to fine. HANE improves the speed of network representation learning while maintaining its performance and the representation learning method of the coarsest network is flexible. We conduct extensive evaluations for the proposed framework HANE on six datasets and two benchmark applications. Experimental results demonstrate that HANE achieves significant improvements over previous state-of-the-art network embedding methods in efficiency and effectiveness.

关键词： Ciphers   Encryption   Security   Sun   Technological innovation   Iterative methods   Computer science   Feistel structure   Lai-Massey structure   impossible differential   dual structure   zero-correlation linear hull  

摘要： This paper mainly investigates the iterative structures whose decryption is similar to the encryption. Firstly, we unify many well-known structures which share similar procedures between the decryption and the encryption, and give a sufficient and necessary condition for this structure to be bijective, which reveals many new insights into the Feistel structure as well as the Lai-Massey structure. Secondly, we analyze the security of the unified structure against the known cryptanalysis. By extending the dual structure from a Feistel structure to the unified structure, we prove that a differential of the unified structure is impossible if and only if it is a zero-correlation linear hull of its dual structure, which presents a generalized link between the impossible differential and zero-correlation linear cryptanalysis shown in CRYPTO 2015. Significantly, several constraints on the linear components of the cipher and the permutation on the branches of the cipher are specified to make the structure resilient to differential and linear cryptanalysis. Furthermore, in the case that the order of the permutation equals the number of the branches n, we prove that there always exist a (3n-1)-round impossible differential and a (3n-1)-round zero-correlation linear hull of the structure, and also present an algorithm to construct these distinguishers. Finally, we propose some novel structures which might be used in future block cipher designs.

关键词： Industries   Computer science   Conferences   Europe   Computer graphics   History   Standards  

摘要： "The Origins of Computer Graphics in Europe," is being published in two parts: Part 1, in this issue of IEEE Computer Graphics and Applications, is subtitled "The Beginnings in Germany";Part 2, to be published in the May/June issue, is subtitled "The Spreading of Computer Graphics in Europe." I was a participant, contributor, and witness to the events reported here and I relate my personal story along with the broader history. Part 1 describes the origins and successful evolution of computer graphics in Germany, starting in 1965, and includes details of the people and subject matter of the earliest research groups. It describes the efforts undertaken to establish computer graphics as a proper academic discipline, including the founding of EUROGRAPHICS, and creation of institutes for both basic and applied research in computer graphics. Part 2 continues the story with a focus on activities contributing to the growth of the academic and industrial computer graphics communities across Europe and documents the two IFIP workshops at Seillac and the development of the GKS Graphics Standard. Over these years, computer graphics gained respect and importance as a component of the computer science curricula and became an important tool and enabling technology for applications for industry and for the IT market in Europe.

关键词： West Africa   Nigeria   African Diaspora   popular culture   media   archives  

关键词： Dictionaries   Visualization   Logic gates   Physics   Biology   Ontologies   Computer science  

摘要： Effective communication is vital for academic project success, particularly in multidisciplinary teams with diverse backgrounds and disciplines. Misunderstandings can arise from differing interpretations of terms, which may go unnoticed. VisDict aims to bridge this gap by creating a visual dictionary within a science gateway to facilitate clear communication between workflow providers and domain researchers. This innovative approach translates computational science concepts into fields like physics and biology. This article delves into our method for building the visual dictionary, the insights gained from curating initial entries, and future plans for automated expansion and illustration of relevant terms.