Creating high challenge/high support academic environments through constructive alignment: student outcomes

Higher education needs to provide challenging yet supportive learning environments catering for students with diverse academic needs. There is also an emphasis on using student-driven outcome measures to determine teaching effectiveness. How can these measures be used to reflect upon and evaluate teaching initiatives? Using an undergraduate occupational therapy programme as the site for exploration, this article reports on an application of constructive alignment principles and describes how available empirical data were used to explore student outcomes. A comparison was made between student evaluations and academic grades prior to, and after the implementation of the initiative. Results provide evidence of improvement in student satisfaction and academic grades as a result of implementing constructive alignment. Whilst it is acknowledged that changes in academic grades and student evaluations can be attributed to a number of factors, findings of this study support a view that constructive alignment facilitates students' learning and experiences.

Constructive alignment in the built environment: enhancing teaching in line with graduate outcomes

The paper examines the manner in which to review an undergraduate degree in construction management using a top-down approach known as “Constructive Alignment”. The research addresses not only the perceived teaching problems, but it also discusses the methods used to rejuvenate the course in a manner that aligns with the graduate outcomes. However, it was also clear that teaching staff were not especially aware of the need to address the course learning outcomes. This highlighted the need for teaching staff to be involved in a process of constructive alignment to embed the course learning outcomes within their subjects, while also addressing the teaching issues involved with assessment. This process provided an opportunity to determine the incremental skill and knowledge development, both within the subjects, as well as between subjects across the course. The paper concludes with the production of a conceptual framework, which can be used to assist with the alignment of professional standards, course outcomes and graduate attributes into a discipline-specific degree program.

Constructive activism in the dark web: cryptomarkets and illicit drugs in the digital ‘demimonde’

This paper explores activism enacted through Silk Road, a nowdefunct cryptomarket where illicit drugs were sold in the darkweb. Drawing on a digital ethnography of Silk Road, we developthe notion of constructive activism to extend the lexicon ofconcepts available to discuss forms of online activism. Monitoringof the cryptomarket took place between June 2011 and its closurein October 2013. Just before and after the closure of themarketplace we conducted anonymous online interviews with 17people who reported buying drugs on Silk Road (1.0). Theseinterviews were conducted synchronously and interactivelythrough encrypted instant messaging. Participants discussedharnessing and developing the technological tools needed toaccess Silk Road and engage within the Silk Road community. Forparticipants Silk Road was not just a market for trading drugs: itfacilitated a shared experience of personal freedom within alibertarian philosophical framework, where open discussionsabout stigmatized behaviours were encouraged and supported.Tensions between public activism against drug prohibition andthe need to hide one’s identity as a drug user from public scrutinywere partially resolved through community actions thatinternalized these politics, rather than engaging in forms of onlineactivism that are intended to have real-world political effects.Most aptly described through van de Sande’s (2015) concept ofprefigurative politics, they sought to transform their values intobuilt environments that were designed to socially engineer amore permissive digital reality, which we refer to as constructiveactivism.

Study of the timber constructive systems that are more commercialized in Brazil

The Brazilian houses in wood are executed with several techniques and species, in function of the areas they are located, therefore, it is treated of regional traditional houses, built practically without modem technological resources. These houses are the ones of the tropical areas, where there is abundance of this material, or the ones of the south region, prevailing the European immigrant's constructive techniques. Nowadays, in the urbanized centers of the country it is observed that this type of house can be found sheltering the most lacking populations, in the slums; or in highly sophisticated residential units which are conceived and executed by specialist professionals for a social class of high purchasing power; or still, those that are marketed by companies of small load, that offer standardized residences, usually acquired by the middle class as second residence, in the field or in the coast. The work has for objective to study the houses of these companies that are consolidated at the market, identifying the constructive system, the product; as well as, its production process, trying to verify which technologies are incorporated to these processes. The analysis that was made allows a larger understanding of the product, wood house, that exists in the market and identification of the technological degree in the productive process of those constructive systems.

A Constructive Heuristic Algorithm for Distribution System Planning

A constructive heuristic algorithm (CHA) to solve distribution system planning (DSP) problem is presented. The DSP is a very complex mixed binary nonlinear programming problem. A CHA is aimed at obtaining an excellent quality solution for the DSP problem. However, a local improvement phase and a branching technique were implemented in the CHA to improve its solution. In each step of the CHA, a sensitivity index is used to add a circuit or a substation to the distribution system. This sensitivity index is obtained by solving the DSP problem considering the numbers of circuits and substations to be added as continuous variables (relaxed problem). The relaxed problem is a large and complex nonlinear programming and was solved through an efficient nonlinear optimization solver. Results of two tests systems and one real distribution system are presented in this paper in order to show the ability of the proposed algorithm.

Constructive heuristic algorithm for the DC model in network transmission expansion planning

A novel constructive heuristic algorithm to the network expansion planning problem is presented the basic idea comes from Garver's work applied to the transportation model, nevertheless the proposed algorithm is for the DC model. Tests results with most known systems in the literature are carried out to show the efficiency of the method.

Constructive heuristic algorithm in branch-and-bound structure applied to transmission network expansion planning

A constructive heuristic algorithm to solve the transmission system expansion planning problem is proposed with the aim of circumventing some critical problems of classical heuristic algorithms that employ relaxed mathematical models to calculate a sensitivity index that guides the circuit additions. The proposed heuristic algorithm is in a branch-and-bound algorithm structure, which can be used with any planning model, such as Transportation model, DC model, AC model or Hybrid models. Tests of the proposed algorithm are presented on real Brazilian systems.

A constructive heuristic algorithm to Short Term Transmission Network Expansion Planning

In this paper a method for solving the Short Term Transmission Network Expansion Planning (STTNEP) problem is presented. The STTNEP is a very complex mixed integer nonlinear programming problem that presents a combinatorial explosion in the search space. In this work we present a constructive heuristic algorithm to find a solution of the STTNEP of excellent quality. In each step of the algorithm a sensitivity index is used to add a circuit (transmission line or transformer) to the system. This sensitivity index is obtained solving the STTNEP problem considering as a continuous variable the number of circuits to be added (relaxed problem). The relaxed problem is a large and complex nonlinear programming and was solved through an interior points method that uses a combination of the multiple predictor corrector and multiple centrality corrections methods, both belonging to the family of higher order interior points method (HOIPM). Tests were carried out using a modified Carver system and the results presented show the good performance of both the constructive heuristic algorithm to solve the STTNEP problem and the HOIPM used in each step.

Distribution network planning using a constructive heuristic algorithm

An optimization technique to solve distribution network planning (DNP) problem is presented. This is a very complex mixed binary nonlinear programming problem. A constructive heuristic algorithm (CHA) aimed at obtaining an excellent quality solution for this problem is presented. In each step of the CHA, a sensitivity index is used to add a circuit or a substation to the distribution network. This sensitivity index is obtained solving the DNP problem considering the numbers of circuits and substations to be added as continuous variables (relaxed problem). The relaxed problem is a large and complex nonlinear programming and was solved through an efficient nonlinear optimization solver. A local improvement phase and a branching technique were implemented in the CHA. Results of two tests using a distribution network are presented in the paper in order to show the ability of the proposed algorithm. ©2009 IEEE.

Distribution system restoration in a DG environment using a heuristic constructive multi-start algorithm

This paper proposes a heuristic constructive multi-start algorithm (HCMA) to distribution system restoration in real time considering distributed generators installed in the system. The problem is modeled as nonlinear mixed integer and considers the two main goals of the restoration of distribution networks: minimizing the number of consumers without power and the number of switching. The proposed algorithm is implemented in C++ programming language and tested using a large real-life distribution system. The results show that the proposed algorithm is able to provide a set of feasible and good quality solutions in a suitable time for the problem. © 2011 IEEE.

An application of a modified constructive heuristic algorithm to transmission expansion planning

Transmission expansion planning (TEP) is a non-convex optimization problem that can be solved via different heuristic algorithms. A variety of classical as well as heuristic algorithms in literature are addressed to solve TEP problem. In this paper a modified constructive heuristic algorithm (CHA) is proposed for solving such a crucial problem. Most of research papers handle TEP problem by linearization of the non-linear mathematical model while in this research TEP problem is solved via CHA using non-linear model. The proposed methodology is based upon Garver's algorithm capable of applying to a DC model. Simulation studies and tests results on the well known transmission network such as: Garver and IEEE 24-bus systems are carried out to show the significant performance as well as the effectiveness of the proposed algorithm. © 2011 IEEE.

Transmission Expansion Planning Via a Constructive Heuristic Algorithm in Restructured Electricity Industry

The transmission expansion planning problem in modern power systems is a large-scale, mixed-integer, nonlinear and non-convex problem. this paper presents a new mathematical model and a constructive heuristic algorithm (CHA) for solving transmission expansion planning problem under new environment of electricity restructuring. CHA finds an acceptable solution in an iterative process, where in each step a circuit is chosen using a sensitivity index and added to the system. The proposed model consider multiple generation scenarios therefore the methodology finds high quality solution in which it allows the power system operate adequacy in an environment with multiple generators scenarios. Case studies and simulation results using test systems show possibility of using Constructive heuristic algorithm in an open access system.

Student Leader LMX Relationships as Moderated by Constructive-Developmental Theory

This study examined how the quality of Leader-Member Exchange (LMX) relationships was moderated by the Constructive-Developmental stage or Order of Consciousness of both leader and follower. Using student organization presidents and officers on a small, private, liberal arts college campus in the Midwest, the researcher used a sample of 37 students to study the impact developmental stage had on the leadership relationship. Using the Leader Member Exchange-Multi-Dimensional Measure (LMX-MDM), four dimensions of LMX were examined. The four dimensions were Affect, Contribution, Loyalty and Professional Respect. There was no significant relationship between Order of Consciousness and quality of LMX relationship. While there was no significant difference in LMX relationship based on gender of participants, there was a significant difference between how male presidents and officers perceived their relationship in the Loyalty dimension. Directions for further research and implications for practice were discussed.

A review and evaluation on constructive heuristics to optimise product mix based on the Theory of Constraints

In this paper, we address the problem of defining the product mix in order to maximise a system's throughput. This problem is well known for being NP-Complete and therefore, most contributions to the topic focus on developing heuristics that are able to obtain good solutions for the problem in a short CPU time. In particular, constructive heuristics are available for the problem such as that by Fredendall and Lea, and by Aryanezhad and Komijan. We propose a new constructive heuristic based on the Theory of Constraints and the Knapsack Problem. The computational results indicate that the proposed heuristic yields better results than the existing heuristic.