scholarly journals An Analysis on the Teaching Reform of Data Structure Course in China

2020 ◽  
Vol 4 (10) ◽  
Author(s):  
Chenjie Wang ◽  
Xianglian Meng ◽  
Xia Meng ◽  
Li Sui
Keyword(s):  
Data Structure ◽  
Data Structures ◽  
Teaching Methods ◽  
Online Course ◽  
Existing Problems ◽  
Teaching Reform

For the course of "Data Structures", this paper introduces the importance and existing problems of the data structure course. Through the literature and the current teaching in major universities, the existing teaching methods and their disadvantages are analyzed. The authors put forward teaching reform suggestions and designed an online course platform.

Multimedia Teaching Problems and Countermeasures Research on PE Major in Chinese Colleges

2011 ◽  
Vol 474-476 ◽  
pp. 985-988
Author(s):  
Meng Long Li ◽  
Wei Ping Ma ◽  
Yi Xiang Li ◽  
Ze Liang Tan
Keyword(s):  
Teaching Methods ◽  
Teaching Quality ◽  
Existing Problems ◽  
Teaching Reform ◽  
Multimedia Teaching ◽  
Countermeasures Research

Through the research on the existing problems of Chinese colleges PE major in the process of developing multimedia teaching, the paper finds out the problems in following aspects.The insufficient leading officials’ concern, the insufficient hardware facilities and equipments, lack of matching software and lower teachers’ operation ability. Moreover, it also puts forward the relevant countermeasures to promote the application and popularization of multimedia teaching methods in PE teaching. This research will further promote modern teaching reform of PE major, optimize the PE teaching class, improve PE teaching quality and plays a certain role.

scholarly journals Discussion on the Teaching Reform of Hydraulic Structure

2020 ◽  
Vol 4 (3) ◽  
Author(s):  
Yang Zhou ◽  
Yingsheng Dang ◽  
Aiqin Wang ◽  
Haibo Jiang
Keyword(s):  
Teaching Methods ◽  
Hydraulic Structure ◽  
Hydraulic Structures ◽  
Theoretical Knowledge ◽  
Agricultural Water ◽  
Existing Problems ◽  
Teaching Reform ◽  
Content Selection ◽  
Teaching Content ◽  
Water Conservancy

In order to improve the teaching effect of the " hydraulic structure " course, this paper takes Shihezi University’s " hydraulic structure " course as an example, which is the western agricultural water conservancy engineering corps university. The paper analyzes the current situation of the curriculum teaching system of the hydraulic structures, aiming at the analysis of existing problems in the curriculum system, and puts forward the teaching reform of " hydraulic structure " suggestions, including teachers according to professional and regional characteristics of teaching content selection. The paper uses a variety of teaching methods and induces students' study enthusiasm. At the same time, teachers should constantly strengthen their own professional theoretical knowledge and practical ability. It provides references for the later teaching reform of hydraulic structure.

Based on the Management of Japanese Teaching Methods to Explore

2014 ◽  
Vol 1044-1045 ◽  
pp. 1581-1583
Author(s):  
Hong Mei Xu
Keyword(s):  
Teaching Methods ◽  
Present Situation ◽  
Teaching Quality ◽  
Higher Learning ◽  
Hotel Management ◽  
Teaching Mode ◽  
Existing Problems ◽  
Teaching Reform ◽  
Institutions Of Higher Learning ◽  
Higher Vocational College

Japanese professional hotel management and traditional Japanese professional have certain differences between institutions of higher learning, its focus on training students' level of Japanese and combined with actual business hotel. This paper analyzes the hotel management in higher vocational college Japanese teaching present situation and existing problems, the construction of the hotel management of Japanese teaching reform scheme is put forward, and explore the feasible teaching mode, in order to effectively promote domestic Japanese teaching reform and the improvement of teaching quality.

scholarly journals A Comparative Study about Data Structures Used for Efficient Management of Voxelised Full-Waveform Airborne LiDAR Data during 3D Polygonal Model Creation

2021 ◽  
Vol 13 (4) ◽  
pp. 559
Author(s):  
Milto Miltiadou ◽  
Neill D. F. Campbell ◽  
Darren Cosker ◽  
Michael G. Grant
Keyword(s):  
Data Structure ◽  
Data Structures ◽  
Airborne Lidar ◽  
Memory Allocation ◽  
Lidar Data ◽  
Full Waveform ◽  
Waveform Lidar ◽  
Airborne Lidar Data ◽  
Full Waveform Lidar ◽  
Polygonal Model

In this paper, we investigate the performance of six data structures for managing voxelised full-waveform airborne LiDAR data during 3D polygonal model creation. While full-waveform LiDAR data has been available for over a decade, extraction of peak points is the most widely used approach of interpreting them. The increased information stored within the waveform data makes interpretation and handling difficult. It is, therefore, important to research which data structures are more appropriate for storing and interpreting the data. In this paper, we investigate the performance of six data structures while voxelising and interpreting full-waveform LiDAR data for 3D polygonal model creation. The data structures are tested in terms of time efficiency and memory consumption during run-time and are the following: (1) 1D-Array that guarantees coherent memory allocation, (2) Voxel Hashing, which uses a hash table for storing the intensity values (3) Octree (4) Integral Volumes that allows finding the sum of any cuboid area in constant time, (5) Octree Max/Min, which is an upgraded octree and (6) Integral Octree, which is proposed here and it is an attempt to combine the benefits of octrees and Integral Volumes. In this paper, it is shown that Integral Volumes is the more time efficient data structure but it requires the most memory allocation. Furthermore, 1D-Array and Integral Volumes require the allocation of coherent space in memory including the empty voxels, while Voxel Hashing and the octree related data structures do not require to allocate memory for empty voxels. These data structures, therefore, and as shown in the test conducted, allocate less memory. To sum up, there is a need to investigate how the LiDAR data are stored in memory. Each tested data structure has different benefits and downsides; therefore, each application should be examined individually.

scholarly journals Shape Neutral Analysis of Graph-based Data-structures

2018 ◽  
Vol 18 (3-4) ◽  
pp. 470-483 ◽  
Author(s):  
GREGORY J. DUCK ◽  
JOXAN JAFFAR ◽  
ROLAND H. C. YAP
Keyword(s):  
Data Structure ◽  
Data Structures ◽  
Program Analysis ◽  
Constraint Handling ◽  
C Programs ◽  
Wide Range ◽  
Target Program ◽  
Target Data ◽  
Structure Graph ◽  
Structure Properties

AbstractMalformed data-structures can lead to runtime errors such as arbitrary memory access or corruption. Despite this, reasoning over data-structure properties for low-level heap manipulating programs remains challenging. In this paper we present a constraint-based program analysis that checks data-structure integrity, w.r.t. given target data-structure properties, as the heap is manipulated by the program. Our approach is to automatically generate a solver for properties using the type definitions from the target program. The generated solver is implemented using a Constraint Handling Rules (CHR) extension of built-in heap, integer and equality solvers. A key property of our program analysis is that the target data-structure properties are shape neutral, i.e., the analysis does not check for properties relating to a given data-structure graph shape, such as doubly-linked-lists versus trees. Nevertheless, the analysis can detect errors in a wide range of data-structure manipulating programs, including those that use lists, trees, DAGs, graphs, etc. We present an implementation that uses the Satisfiability Modulo Constraint Handling Rules (SMCHR) system. Experimental results show that our approach works well for real-world C programs.

Integrating Image Computation in Undergraduate Level Data-Structure Education

1998 ◽  
Vol 12 (08) ◽  
pp. 1071-1080 ◽  
Author(s):  
Sudeep Sarkar ◽  
Dmitry Goldgof
Keyword(s):  
Image Processing ◽  
Image Analysis ◽  
Data Structure ◽  
Data Structures ◽  
Science Curriculum ◽  
Early Stage ◽  
Real Life ◽  
South Florida ◽  
The University ◽  
Structure Education

There is a growing need for expertise both in image analysis and in software engineering. To date, these two areas have been taught separately in an undergraduate computer and information science curriculum. However, we have found that introduction to image analysis can be easily integrated in data-structure courses without detracting from the original goal of teaching data structures. Some of the image processing tasks offer a natural way to introduce basic data structures such as arrays, queues, stacks, trees and hash tables. Not only does this integrated strategy expose the students to image related manipulations at an early stage of the curriculum but it also imparts cohesiveness to the data-structure assignments and brings them closer to real life. In this paper we present a set of programming assignments that integrates undergraduate data-structure education with image processing tasks. These assignments can be incorporated in existing data-structure courses with low time and software overheads. We have used these assignment sets thrice: once in a 10-week duration data-structure course at the University of California, Santa Barbara and the other two times in 15-week duration courses at the University of South Florida, Tampa.

scholarly journals DenseZDD: A Compact and Fast Index for Families of Sets

Algorithms ◽  
2018 ◽  
Vol 11 (8) ◽  
pp. 128 ◽  
Author(s):  
Shuhei Denzumi ◽  
Jun Kawahara ◽  
Koji Tsuda ◽  
Hiroki Arimura ◽  
Shin-ichi Minato ◽  
...  
Keyword(s):  
Data Structure ◽  
Data Structures ◽  
Information Integration ◽  
Decision Diagrams ◽  
Web Information Retrieval ◽  
Binary Decision ◽  
Web Information ◽  
Set Operations ◽  
Succinct Data Structure ◽  
The Family

In this article, we propose a succinct data structure of zero-suppressed binary decision diagrams (ZDDs). A ZDD represents sets of combinations efficiently and we can perform various set operations on the ZDD without explicitly extracting combinations. Thanks to these features, ZDDs have been applied to web information retrieval, information integration, and data mining. However, to support rich manipulation of sets of combinations and update ZDDs in the future, ZDDs need too much space, which means that there is still room to be compressed. The paper introduces a new succinct data structure, called DenseZDD, for further compressing a ZDD when we do not need to conduct set operations on the ZDD but want to examine whether a given set is included in the family represented by the ZDD, and count the number of elements in the family. We also propose a hybrid method, which combines DenseZDDs with ordinary ZDDs. By numerical experiments, we show that the sizes of our data structures are three times smaller than those of ordinary ZDDs, and membership operations and random sampling on DenseZDDs are about ten times and three times faster than those on ordinary ZDDs for some datasets, respectively.

scholarly journals Spaced Seed Data Structures forDe NovoAssembly

2015 ◽  
Vol 2015 ◽  
pp. 1-8 ◽  
Author(s):  
Inanç Birol ◽  
Justin Chu ◽  
Hamid Mohamadi ◽  
Shaun D. Jackman ◽  
Karthika Raghavan ◽  
...  
Keyword(s):  
Data Structure ◽  
Data Structures ◽  
De Novo ◽  
Bloom Filters ◽  
De Bruijn Graph ◽  
Sequence Specificity ◽  
Sequencing Errors ◽  
Spaced Seeds ◽  
Read Error Correction ◽  
Seed Data

De novoassembly of the genome of a species is essential in the absence of a reference genome sequence. Many scalable assembly algorithms use the de Bruijn graph (DBG) paradigm to reconstruct genomes, where a table of subsequences of a certain length is derived from the reads, and their overlaps are analyzed to assemble sequences. Despite longer subsequences unlocking longer genomic features for assembly, associated increase in compute resources limits the practicability of DBG over other assembly archetypes already designed for longer reads. Here, we revisit the DBG paradigm to adapt it to the changing sequencing technology landscape and introduce three data structure designs for spaced seeds in the form of paired subsequences. These data structures address memory and run time constraints imposed by longer reads. We observe that when a fixed distance separates seed pairs, it provides increased sequence specificity with increased gap length. Further, we note that Bloom filters would be suitable to implicitly store spaced seeds and be tolerant to sequencing errors. Building on this concept, we describe a data structure for tracking the frequencies of observed spaced seeds. These data structure designs will have applications in genome, transcriptome and metagenome assemblies, and read error correction.

scholarly journals Analysis of Teaching Reform of Tourism Management Major in Colleges and Universities under "Internet+"

2021 ◽  
Vol 4 (10) ◽  
pp. 210
Author(s):  
Ying Zhang
Keyword(s):  
Information Technology ◽  
Teaching Methods ◽  
Rapid Development ◽  
Teaching Quality ◽  
Colleges And Universities ◽  
Good Teaching ◽  
Teaching Reform ◽  
Tourism Management ◽  
Analysis Of Teaching

With the rapid development of information technology, information education has been realized in all stages of education and teaching in our country, and it has very good teaching effects. This article discusses and analyzes the current situation of the teaching of tourism management in colleges and universities under the environment of “Internet +” from multiple angles, and proposes some reform measures for teaching methods in response to the problems reflected, aiming to better improve the teaching quality of tourism management in colleges and universities .

Sign in / Sign up

Export Citation Format

Share Document