A Perspective Of Automated Programming Error Feedback Approaches In Problem Solving Exercises

Programming tools are meant for student to practice programming. Automated programming error feedback will be provided for students to self-construct the knowledge through their own experience. This paper has clustered current approaches in providing automated error programming feedback to the students during problem solving exercises. These include additional syntax error messages, solution template mismatches, test data comparison, assisted agent report and collaborative comment feedback. The study is conducted based on published papers for last two decades. The trends are analyzed to get the overview of latest research contributions towards eliminating programming difficulties among students. The result shows that future direction of automated programming error feedback approaches may combine agent and collaborative feedback approaches towards more interactive, dynamic, end-user oriented and specific goal oriented. Such future direction may help other researchers fill in the gap on new ways of assisting learners to better understand feedback messages provided by automated assessment tool

A two-base encoded DNA sequence alignment problem in computational biology

The recent introduction of instruments capable of producing millions of DNA sequence reads in a single run is rapidly changing the landscape of genetics. The primary objective of the "sequence alignment" problem is to search for a new algorithm that facilitates the use of two-base encoded data for large-scale re-sequencing projects. This algorithm should be able to perform local sequence alignment as well as error detection and correction in a reliable and systematic manner, enabling the direct comparison of encoded DNA sequence reads to a candidate reference DNA sequence. We will first briefly review two well-known sequence alignment approaches and provide a rudimentary improvement for implementation on parallel systems. Then, we carefully examin a unique sequencing technique known as the SOLiDTM System that can be implemented, and follow by the results from the global and local sequence alignment. In this report, the team presents an explanation of the algorithms for color space sequence data from the high-throughput re-sequencing technology and a theoretical parallel approach to the dynamic programming method for global and local alignment. The combination of the di-base approach and dynamic programming provides a possible viewpoint for large-scale re-sequencing projects. We anticipate the use of distributed computing to be the next-generation engine for large-scale problems like such

Hybrid Lateral Transshipments in a Multi-Location Inventory System

In managing networks of stock holding locations, two approaches to the pooling of inventory have been proposed. Reactive transshipm nts respond to stockouts at a location by moving inventory from elsewhere within the network, while proactive redistribution of stock seeks to minimise the chance of future shocks. This paper is the first to propose a hybrid approach in which transshipments are viewed as an opportunity for stock redistribution. We adopt a quasi-myopic approach to the development of a strongly performing hybrid transshipment policy. Numerical studies which utilise dynamic programming and simulation testify to the benefits of using transshipments proactively. In comparison to a purely reactive approach to transshipment, service levels are improved while a reduction in safety stock levels is achieved. The aggregate costs incurred in managing the system are significantly reduced, especially so for large networks facing high levels of demand.

Interoperability between Cooperative Design Modeller and a CAD System: Software Integration versus Data Exchange

The data exchange between Computer-Aided Design (CAD) systems is a crucial issue in concurrent engineering and collaborative design. The paper presents research works and techniques dealing with the interoperability of a Cooperative Design Modeller (CoDeMo), aiming at the integration of product lifecycle knowledge, and a commercial CAD system (CATIA V5). Two kinds of approaches are implemented in the considered case of CAD interoperability for exchanging geometric data, respectively: one is based on a traditional static interface, in which STEP AP203 standard is used; the other is based on a dynamic interface, in which Application Programming Interfaces (API) of the targeted CAD system is adopted. Both approaches should enhance the communication, exchange and sharing of product data between CAD systems for improving concurrent engineering. A comparison between these two approaches is made to show their particular advantages and disadvantages. The development of a translator between the both CAD systems based on each approach has been carried out and evaluated on an assembly case

Interoperability between Cooperative Design Modeller and a CAD System: Software Integration versus Data Exchange

International audienceThe data exchange between Computer-Aided Design (CAD) systems is a crucial issue in concurrent engineering and collaborative design. The paper presents research works and techniques dealing with the interoperability of a Cooperative Design Modeller (CoDeMo), aiming at the integration of product lifecycle knowledge, and a commercial CAD system (CATIA V5). Two kinds of approaches are implemented in the considered case of CAD interoperability for exchanging geometric data, respectively: one is based on a traditional static interface, in which STEP AP203 standard is used; the other is based on a dynamic interface, in which Application Programming Interfaces (API) of the targeted CAD system is adopted. Both approaches should enhance the communication, exchange and sharing of product data between CAD systems for improving concurrent engineering. A comparison between these two approaches is made to show their particular advantages and disadvantages. The development of a translator between the both CAD systems based on each approach has been carried out and evaluated on an assembly case

Adaptive Streaming in P2P Live Video Systems: A Distributed Rate Control Approach

Dynamic Adaptive Streaming over HTTP (DASH) is a recently proposed standard that offers different versions of the same media content to adapt the delivery process over the Internet to dynamic bandwidth fluctuations and different user device capabilities. The peer-to-peer (P2P) paradigm for video streaming allows to leverage the cooperation among peers, guaranteeing to serve every video request with increased scalability and reduced cost. We propose to combine these two approaches in a P2P-DASH architecture, exploiting the potentiality of both. The new platform is made of several swarms, and a different DASH representation is streamed within each of them; unlike client-server DASH architectures, where each client autonomously selects which version to download according to current network conditions and to its device resources, we put forth a new rate control strategy implemented at peer site to maintain a good viewing quality to the local user and to simultaneously guarantee the successful operation of the P2P swarms. The effectiveness of the solution is demonstrated through simulation and it indicates that the P2P-DASH platform is able to warrant its users a very good performance, much more satisfying than in a conventional P2P environment where DASH is not employed. Through a comparison with a reference DASH system modeled via the Integer Linear Programming (ILP) approach, the new system is shown to outperform such reference architecture. To further validate the proposal, both in terms of robustness and scalability, system behavior is investigated in the critical condition of a flash crowd, showing that the strong upsurge of new users can be successfully revealed and gradually accommodated.Comment: 12 pages, 17 figures, this work has been submitted to the IEEE journal on selected Area in Communication

Hybrid Lateral Transshipments in a Multi-Location Inventory System

In managing networks of stock holding locations, two approaches to the pooling of inventory have been proposed. Reactive transshipm nts respond to stockouts at a location by moving inventory from elsewhere within the network, while proactive redistribution of stock seeks to minimise the chance of future shocks. This paper is the first to propose a hybrid approach in which transshipments are viewed as an opportunity for stock redistribution. We adopt a quasi-myopic approach to the development of a strongly performing hybrid transshipment policy. Numerical studies which utilise dynamic programming and simulation testify to the benefits of using transshipments proactively. In comparison to a purely reactive approach to transshipment, service levels are improved while a reduction in safety stock levels is achieved. The aggregate costs incurred in managing the system are significantly reduced, especially so for large networks facing high levels of demand.

Minimum-risk temporal alignment of videos

© 2017, Springer Science+Business Media, LLC. Temporal alignment of videos is an important requirement of tasks such as video comparison, analysis and classification. Most of the approaches proposed to date for video alignment leverage dynamic programming algorithms whose parameters are manually tuned. Conversely, this paper proposes a model that can learn its parameters automatically by minimizing a meaningful loss function over a given training set of videos and alignments. For learning, we exploit the effective framework of structural SVM and we extend it with an original scoring function that suitably scores the alignment of two given videos, and a loss function that quantifies the accuracy of a predicted alignment. The experimental results from four video action datasets show that the proposed model has been able to outperform a baseline and a state-of-the-art algorithm by a large margin in terms of alignment accuracy

Efficient and Reasonable Object-Oriented Concurrency

Making threaded programs safe and easy to reason about is one of the chief difficulties in modern programming. This work provides an efficient execution model for SCOOP, a concurrency approach that provides not only data race freedom but also pre/postcondition reasoning guarantees between threads. The extensions we propose influence both the underlying semantics to increase the amount of concurrent execution that is possible, exclude certain classes of deadlocks, and enable greater performance. These extensions are used as the basis an efficient runtime and optimization pass that improve performance 15x over a baseline implementation. This new implementation of SCOOP is also 2x faster than other well-known safe concurrent languages. The measurements are based on both coordination-intensive and data-manipulation-intensive benchmarks designed to offer a mixture of workloads.Comment: Proceedings of the 10th Joint Meeting of the European Software Engineering Conference and the ACM SIGSOFT Symposium on the Foundations of Software Engineering (ESEC/FSE '15). ACM, 201