The problem of managing an effective relationship between course staff and students in large programming courses admits no trivial solution. Students often complain of lack of feedback, slow assignment grading times, ...
详细信息
The problem of managing an effective relationship between course staff and students in large programming courses admits no trivial solution. Students often complain of lack of feedback, slow assignment grading times, and a gap in communication between them and the course staff responsible for evaluating their work. In addition, course staff feels powerless to help because of the complexity and sheer numbers of students involved in such courses. In this paper, we describe our Web-based distributed application, FrontDesk that attempts to bridge the feedback and communication gap that these courses suffer from. FrontDesk provides tools for students to submit their work through the Web and to receive rich, informative feedback. It provides course staff with the ability to give effective subjective feedback for large courses and to automate objective programming assignment correctness testing in a flexible, distributed, and efficient manner.
TiViPE is a component based visual programming environment (VPE) that enables users to build programs by construction of a network of components interactively. A single module (component), represented by a graphical i...
详细信息
TiViPE is a component based visual programming environment (VPE) that enables users to build programs by construction of a network of components interactively. A single module (component), represented by a graphical icon, is a computational unit. Multiple icons can be connected to each other to yield a directed graph (a network) that represent a program. TiViPE is, in appearance similar to programs such as AVS, Vee, OpenDX, Khoros, LabVIEW, NeatVision, and ViPEr, but presents some fundamental differences. TiViPE integrates documentation with an existing routine call (that has been programmed in C++, C, Fortran, or Java), and automatically generates C++ code that is compiled to stand-alone program. This program is able to execute the specified routine, provide a graphical icon, or give HTML-formatted documentation about the routine. Hence, within TiViPE there is no textual programming for the user TiViPE strongly re-uses code, which is inherent to visual programming, and automatic code regeneration by compounding a network of modules to a single module, which leads to faster programming. TiViPE supports networking and parallel processing in a natural way, and allows the user to modify an activated network. TiViPE also aims at rapid prototyping which demands user friendliness, programming by existing modules for basic users, and focuses on the documentation of a module. TiViPE has been used in the field of computer vision, robotics, and computational neuroscience
A novel hybrid algorithm EPLSE is proposed to design fuzzy rule bases automatically, which is based on the combination of EP (evolutionary programming) and LSE (least squares estimate). By utilizing the consequent par...
详细信息
ISBN:
(纸本)0780383532
A novel hybrid algorithm EPLSE is proposed to design fuzzy rule bases automatically, which is based on the combination of EP (evolutionary programming) and LSE (least squares estimate). By utilizing the consequent parameters of the super 1/sup st/-order Sugeno model, the training error is decreased greatly. Compared with the original work, the proposed algorithm has remarkably improved the fuzzy model's precision and simplified its structure. In the simulation, EPLSE is employed to predict a chaotic time series. Comparisons with some typical fuzzy modeling methods and artificial neural networks are presented and discussed. Other promising applications of the proposed EPLSE are also suggested.
The design of pseudorandom number generators by means of evolutionary computation is a classical problem. Today, it has been mostly and better accomplished by means of cellular automata and not many proposals, inside ...
详细信息
The design of pseudorandom number generators by means of evolutionary computation is a classical problem. Today, it has been mostly and better accomplished by means of cellular automata and not many proposals, inside or outside this paradigm could claim to be both robust (passing all the statistical tests, including the most demanding ones) and fast, as is the case of the proposal we present here. Furthermore, for obtaining these generators, we use a radical approach, where our fitness function is not at all based in any measure of randomness, as is frequently the case in the literature, but of nonlinearity. Efficiency is assured by using only very efficient operators (both in hardware and software) and by limiting the number of terminals in the genetic programming implementation.
In this paper, we address the problem of specifying a home automation system and behaviour programming. We propose a Web-based approach that offers a generic solution and is independent of the automation technology us...
详细信息
In this paper, we address the problem of specifying a home automation system and behaviour programming. We propose a Web-based approach that offers a generic solution and is independent of the automation technology used. To achieve this degree of independence, our implementation describes an abstract model of the home automation device. We also present a simple model for describing the physical structure of a home. In this way, our approach can describe any system for any house. We also present a model for defining the required behavior for a system. This model is based on IF...THEN clauses, which are simple to understand and apply for common users. Finally, we describe our implementation.
Feature oriented programming (FOP) is an emerging paradigm for application synthesis, analysis, and optimization. A target application is specified declaratively as a set of features, like many consumer products (e.g....
详细信息
ISBN:
(纸本)9780769521633
Feature oriented programming (FOP) is an emerging paradigm for application synthesis, analysis, and optimization. A target application is specified declaratively as a set of features, like many consumer products (e.g., personal computers, automobiles). FOP technology translates such declarative specifications into efficient programs.
Genetic network programming (GNP) has directed graph structures as genes, which is extended from other evolutionary computations such as genetic algorithm (GA) and genetic programming (GP). Generally, macroinstruction...
详细信息
Genetic network programming (GNP) has directed graph structures as genes, which is extended from other evolutionary computations such as genetic algorithm (GA) and genetic programming (GP). Generally, macroinstructions are introduced as sub-routines, function localization and so on. Previously, we have introduced the structure of macroinstructions in GNP named automatically generated macro nodes (AGMs) for reducing the time of evolution efficiently, and showed that macroinstructions are useful to acquire good performances. But the AGMs have fixed number of nodes, and it is found that the effectiveness of evolution of macroinstructions depends on the main program calling them and initialized parameters. Accordingly in this paper, new AGMs are introduced to improve their performances further more by the mechanism of varying the size of AGMs, which are named variable size AGMs. This is the mechanism to add and delete nodes according to necessity. In the simulations, comparisons between GNP program only, GNP with conventional AGMs and GNP with variable size AGMs are carried out using the tile world. Simulation results show that the proposed method is better compared with conventional GNP and GNP with conventional GMs. And also it is clarified that the node transition rules obtained by new AGMs show the generalized rules able to deal with unknown environments.
The use of a model to describe and test the expected behavior of a program is a well-proved software testing technique. Statistical structural testing aims at building a model from which an input probability distribut...
详细信息
The use of a model to describe and test the expected behavior of a program is a well-proved software testing technique. Statistical structural testing aims at building a model from which an input probability distribution can be derived that maximizes the coverage of some structural criteria by a random test data generator. Our approach consists in converting statistical structural testing into a probabilistic concurrent constraint programming (PCCP) problem in order 1) to exploit the high declarativity of the probabilistic choice operators of this paradigm and 2) to benefit from its automated constraint solving capacity. This paper reports on an ongoing work to implement PCCP and exploit it to solve instances of statistical structural testing problems. Application to testing Java Card applets is discussed.
To reuse an electronic educational material, a teacher has to understand its availability and methodology. This paper proposed the technique of integrating electronic class text, such as HTML/XML, into automated recor...
详细信息
To reuse an electronic educational material, a teacher has to understand its availability and methodology. This paper proposed the technique of integrating electronic class text, such as HTML/XML, into automated records of activities in a class. Our hypothesis is that an activity has influence on both the automated records and the class text. Currently, we have held evaluation experiment. We designed structured record expression and event rules. Our system integrates a class text into automated records by forward deductive inference.
In this paper, a Generic Automated Marking Environment (GAME) is proposed for assessing student programming projects and exercises with an aim to facilitate student-centred learning. GAME has been designed to automati...
详细信息
In this paper, a Generic Automated Marking Environment (GAME) is proposed for assessing student programming projects and exercises with an aim to facilitate student-centred learning. GAME has been designed to automatically assess programming assignments written in a variety of languages. The system has been implemented in Java and contains marker modules that are tailored to each specific language. A framework has been set in place to enable easy addition of new marker modules to extend the system's functionality. Currently, the system is able to mark programs written in Java and the C language. To use the system, instructors are required to provide a simple "marking schema" for any given assessment item, which includes pertinent information such as the location of files and the model solution. GAME has been tested on a number of student programming exercises and assignments providing encouraging results.
暂无评论