Time Efficient Assessment and Feedback Methods for Large Computer-Aided-Design Cohorts

Timely and individualized feedback on coursework is desirable from a student perspective as it facilitates formative development and encourages reflective learning practice. Faculty however are faced with a significant and potentially time consuming challenge when teaching larger cohorts if they are to provide feedback which is timely, individualized and detailed. Additionally, for subjects which assess non-traditional submissions, such as Computer-Aided-Design (CAD), the methods for assessment and feedback tend not to be so well developed or optimized. Issues can also arise over the consistency of the feedback provided. Evaluations of Computer-Assisted feedback in other disciplines (Denton et al, 2008), (Croft et al, 2001) have shown students prefer this method of feedback to traditional “red pen” marking and also that such methods can be more time efficient for faculty.
Herein, approaches are described which make use of technology and additional software tools to speed up, simplify and automate assessment and the provision of feedback for large cohorts of first and second year engineering students studying modules where CAD files are submitted electronically. A range of automated methods are described and compared with more “manual” approaches. Specifically one method uses an application programming interface (API) to interrogate SolidWorks models and extract information into an Excel spreadsheet, which is then used to automatically send feedback emails. Another method describes the use of audio recordings made during model interrogation which reduces the amount of time while increasing the level of detail provided as feedback.
Limitations found with these methods and problems encountered are discussed along with a quantified assessment of time saving efficiencies made.

Exact and heuristic methods for solving Boolean games

Boolean games are a framework for reasoning about the rational behavior of agents whose goals are formalized using propositional formulas. Compared to normal form games, a well-studied and related game framework, Boolean games allow for an intuitive and more compact representation of the agents’ goals. So far, Boolean games have been mainly studied in the literature from the Knowledge Representation perspective, and less attention has been paid on the algorithmic issues underlying the computation of solution concepts. Although some suggestions for solving specific classes of Boolean games have been made in the literature, there is currently no work available on the practical performance. In this paper, we propose the first technique to solve general Boolean games that does not require an exponential translation to normal-form games. Our method is based on disjunctive answer set programming and computes solutions (equilibria) of arbitrary Boolean games. It can be applied to a wide variety of solution concepts, and can naturally deal with extensions of Boolean games such as constraints and costs. We present detailed experimental results in which we compare the proposed method against a number of existing methods for solving specific classes of Boolean games, as well as adaptations of methods that were initially designed for normal-form games. We found that the heuristic methods that do not require all payoff matrix entries performed well for smaller Boolean games, while our ASP based technique is faster when the problem instances have a higher number of agents or action variables.

Comparative Raman Study of Carbon Nanotubes Prepared by D.C. Arc Discharge and Catalytic Methods

The Raman spectra of carbon nanotubes prepared by catalytic (C-CNT) and d.c. arc discharge (D-CNT) methods are reported. A previously unnoticed third-order Raman peak at ca. 4248 cm-1 was observed in the Raman spectrum of D-CNT. The Raman features of D-CNT and C-CNT are similar to those of highly oriented pyrolytic graphite (HOPG) and active carbon, respectively. The data also suggest that the increase in disorder in D-CNT compared with HOPG is due to structural defects in D-CNT. © 1997 by John Wiley & Sons, Ltd.

Optimised search heuristics: combining metaheuristics and exact methods to solve scheduling problems

Tese dout., Matemática, Investigação Operacional, Universidade do Algarve, 2009

Ancillary services market clearing simulation: a comparison between deterministic and heuristic methods

Electricity market players operating in a liberalized environment requires access to an adequate decision support tool, allowing them to consider all the business opportunities and take strategic decisions. Ancillary services represent a good negotiation opportunity that must be considered by market players. For this, decision support tool must include ancillary market simulation. This paper proposes two different methods (Linear Programming and Genetic Algorithm approaches) for ancillary services dispatch. The methodologies are implemented in MASCEM, a multi-agent based electricity market simulator. A test case based on California Independent System Operator (CAISO) data concerning the dispatch of Regulation Down, Regulation Up, Spinning Reserve and Non-Spinning Reserve services is included in this paper.

Derivative-free optimization and filter methods to solve nonlinear constrained problems

In real optimization problems, usually the analytical expression of the objective function is not known, nor its derivatives, or they are complex. In these cases it becomes essential to use optimization methods where the calculation of the derivatives, or the verification of their existence, is not necessary: the Direct Search Methods or Derivative-free Methods are one solution. When the problem has constraints, penalty functions are often used. Unfortunately the choice of the penalty parameters is, frequently, very difficult, because most strategies for choosing it are heuristics strategies. As an alternative to penalty function appeared the filter methods. A filter algorithm introduces a function that aggregates the constrained violations and constructs a biobjective problem. In this problem the step is accepted if it either reduces the objective function or the constrained violation. This implies that the filter methods are less parameter dependent than a penalty function. In this work, we present a new direct search method, based on simplex methods, for general constrained optimization that combines the features of the simplex method and filter methods. This method does not compute or approximate any derivatives, penalty constants or Lagrange multipliers. The basic idea of simplex filter algorithm is to construct an initial simplex and use the simplex to drive the search. We illustrate the behavior of our algorithm through some examples. The proposed methods were implemented in Java.

Detection of micrometastases in sentinel lymph nodes from melanoma patients: direct comparison of multimarker molecular and immunopathological methods.

The technique of sentinel lymph node (SLN) dissection is a reliable predictor of metastatic disease in the lymphatic basin draining the primary melanoma. Reverse transcription-polymerase chain reaction (RT-PCR) is emerging as a highly sensitive technique to detect micrometastases in SLNs, but its specificity has been questioned. A prospective SLN study in melanoma patients was undertaken to compare in detail immunopathological versus molecular detection methods. Sentinel lymphadenectomy was performed on 57 patients, with a total of 71 SLNs analysed. SLNs were cut in slices, which were alternatively subjected to parallel multimarker analysis by microscopy (haematoxylin and eosin and immunohistochemistry for HMB-45, S100, tyrosinase and Melan-A/MART-1) and RT-PCR (for tyrosinase and Melan-A/MART-1). Metastases were detected by both methods in 23% of the SLNs (28% of the patients). The combined use of Melan-A/MART-1 and tyrosinase amplification increased the sensitivity of PCR detection of microscopically proven micrometastases. Of the 55 immunopathologically negative SLNs, 25 were found to be positive on RT-PCR. Notably, eight of these SLNs contained naevi, all of which were positive for tyrosinase and/or Melan-A/MART-1, as detected at both mRNA and protein level. The remaining 41% of the SLNs were negative on both immunohistochemistry and RT-PCR. Analysis of a series of adjacent non-SLNs by RT-PCR confirmed the concept of orderly progression of metastasis. Clinical follow-up showed disease recurrence in 12% of the RT-PCR-positive immunopathology-negative SLNs, indicating that even an extensive immunohistochemical analysis may underestimate the presence of micrometastases. However, molecular analyses, albeit more sensitive, need to be further improved in order to attain acceptable specificity before they can be applied diagnostically.

Application of Reptation Quantum Monte Carlo and Related Methods to LiH

This work investigates mathematical details and computational aspects of Metropolis-Hastings reptation quantum Monte Carlo and its variants, in addition to the Bounce method and its variants. The issues that concern us include the sensitivity of these algorithms' target densities to the position of the trial electron density along the reptile, time-reversal symmetry of the propagators, and the length of the reptile. We calculate the ground-state energy and one-electron properties of LiH at its equilibrium geometry for all these algorithms. The importance sampling is performed with a single-determinant large Slater-type orbitals (STO) basis set. The computer codes were written to exploit the efficiencies engineered into modern, high-performance computing software. Using the Bounce method in the calculation of non-energy-related properties, those represented by operators that do not commute with the Hamiltonian, is a novel work. We found that the unmodified Bounce gives good ground state energy and very good one-electron properties. We attribute this to its favourable time-reversal symmetry in its target density's Green's functions. Breaking this symmetry gives poorer results. Use of a short reptile in the Bounce method does not alter the quality of the results. This suggests that in future applications one can use a shorter reptile to cut down the computational time dramatically.

Studies all transport and magnetic properties of nano particle doped MgB2 superconductor for technological applications

This thesis Entitled Studies on transport and magnetic properties of nano particle doped mgb2 superconductor for technological applications.The thesis ahead focuses on the establishment of enhanced superconducting properties in bulk MgB2 via nano particle doping and its conversion into mono/multifilamentary wires. Further, an attempt has also been made to develop prototypes of MgB2 coil and conduction cooled current lead for technological applications. The thesis is configured into 6 chapters. The opening chapter gives an idea on the phenomenon of superconductivity, the various types of superconductors and its applications in different fields. The second chapter is an introduction on MgB2 superconductor and its relevance which includes crystal and electronic structure, superconducting mechanism, basic superconducting properties along with its present international status. The third chapter provides details on the preparation and characterization techniques followed through out the study on MgB2. Fourth chapter discusses the effect of processing temperature and chemical doping using nano sized dopants on the superconducting properties of MgB2• Fifth chapter deals with the optimization of processing parameters and novel preparation techniques for wire fabrication. Sixth chapter furnishes the preparation of multifilamentary wires with various filament configurations, their electromechanical properties and it also incorporates the development of an MgB2 coil and a general purpose conduction cooled current lead.