Nanostructured thin-film WO3 photoanodes for solar water and sea-water splitting

This article charts the development of the use of thin films of nanoparticulate WO3 and how they have been used to overcome problems associated with other photocatalytic materials and bulk WO3. Current technology is described and the authors' views on the outlook for future development is suggested.

The Teaching Space Allocation Problem with splitting

A standard problem within universities is that of teaching space allocation which can be thought of as the assignment of rooms and times to various teaching activities. The focus is usually on courses that are expected to fit into one room. However, it can also happen that the course will need to be broken up, or ‘split’, into multiple sections. A lecture might be too large to fit into any one room. Another common example is that of seminars or tutorials. Although hundreds of students may be enrolled on a course, it is often subdivided into particular types and sizes of events dependent on the pedagogic requirements of that particular course. Typically, decisions as to how to split courses need to be made within the context of limited space requirements. Institutions do not have an unlimited number of teaching rooms, and need to effectively use those that they do have. The efficiency of space usage is usually measured by the overall ‘utilisation’ which is basically the fraction of the available seat-hours that are actually used. A multi-objective optimisation problem naturally arises; with a trade-off between satisfying preferences on splitting, a desire to increase utilisation, and also to satisfy other constraints such as those based on event location and timetabling conflicts. In this paper, we explore such trade-offs. The explorations themselves are based on a local search method that attempts to optimise the space utilisation by means of a ‘dynamic splitting’ strategy. The local moves are designed to improve utilisation and satisfy the other constraints, but are also allowed to split, and un-split, courses so as to simultaneously meet the splitting objectives.

Fabrication of Sub-micron Active Layer SSOI Substrates using Ion Splitting and Wafer Bonding Technologies

This paper reports the fabrication of SSOI (Silicon on Silicide On Insulator) substrates with active silicon regions only 0.5mum thick, incorporating LPCVD low resistivity tungsten silicide (WSix) as the buried layer. The substrates were produced using ion splitting and two stages of wafer bonding. Scanning acoustic microscope imaging confirmed that the bond interfaces are essentially void-free. These SSOI wafers are designed to be employed as substrates for mm-wave reflect-array diodes, and the required selective etch technology is described together with details of a suitable device.

A splitting result for the algebraic K-theory of projective toric schemes

Suppose X is a projective toric scheme defined over a ring R and equipped with an ample line bundle L . We prove that its K-theory has a direct summand of the form K(R)(k+1) where k = 0 is minimal such that L?(-k-1) is not acyclic. Using a combinatorial description of quasi-coherent sheaves we interpret and prove this result for a ring R which is either commutative, or else left noetherian.

Threshold effects in the Teaching Space Allocation Problem with Splitting

Universities aim for good “Space Management” so as to use the teaching space efficiently. Part of this task is to assign rooms and time-slots to teaching activities with limited numbers and capacities of lecture theaters, seminar rooms, etc. It is also common that some teaching activities require splitting into multiple events. For example, lectures can be too large to fit in one room or good teaching practice requires that seminars/tutorials are taught in small groups. Then, space management involves decisions on splitting as well as the assignments to rooms and time-slots. These decisions must be made whilst satisfying the pedagogic requirements of the institution and constraints on space resources. The efficiency of such management can be measured by the “utilisation”: the percentage of available seat-hours actually used. In many institutions, the observed utilisation is unacceptably low, and this provides our underlying motivation: to study the factors that affect teaching space utilisation, with the goal of improving it. We give a brief introduction to our work in this area, and then introduce a specific model for splitting. We present experimental results that show threshold phenomena and associated easy-hard-easy patterns of computational difficulty. We discuss why such behaviour is of importance for space management.

Orange Zinc Germanate with Metallic Ge-Ge Bonds as a Chromophore-Like Center for Visible-Light-Driven Water Splitting

The efficiency of solar-energy-conversion devices depends on the absorption region and intensity of the photon collectors. Organic chromophores, which have been widely stabilized on inorganic semiconductors for light trapping, are limited by the interface between the chromophore and semiconductor. Herein we report a novel orange zinc germanate (Zn-Ge-O) with a chromophore-like structure, by which the absorption region can be dramatically expanded. Structural characterizations and theoretical calculations together reveal that the origin of visible-light response can be attributed to the unusual metallic Ge-Ge bonds which act in a similar way to organic chromophores. Benefiting from the enhanced light harvest, the orange Zn-Ge-O demonstrates superior capacity for solar-driven hydrogen production.

Implementing slot-based task-splitting multiprocessor scheduling

Consider the problem of scheduling a set of sporadic tasks on a multiprocessor system to meet deadlines using a task-splitting scheduling algorithm. Task-splitting (also called semi-partitioning) scheduling algorithms assign most tasks to just one processor but a few tasks are assigned to two or more processors, and they are dispatched in a way that ensures that a task never executes on two or more processors simultaneously. A particular type of task-splitting algorithms, called slot-based task-splitting dispatching, is of particular interest because of its ability to schedule tasks with high processor utilizations. Unfortunately, no slot-based task-splitting algorithm has been implemented in a real operating system so far. In this paper we discuss and propose some modifications to the slot-based task-splitting algorithm driven by implementation concerns, and we report the first implementation of this family of algorithms in a real operating system running Linux kernel version 2.6.34. We have also conducted an extensive range of experiments on a 4-core multicore desktop PC running task-sets with utilizations of up to 88%. The results show that the behavior of our implementation is in line with the theoretical framework behind it.

Practical aspects of slot-based task- splitting dispatching in its schedulability analysis

Consider the problem of scheduling a set of sporadic tasks on a multiprocessor system to meet deadlines using a tasksplitting scheduling algorithm. Task-splitting (also called semipartitioning) scheduling algorithms assign most tasks to just one processor but a few tasks are assigned to two or more processors, and they are dispatched in a way that ensures that a task never executes on two or more processors simultaneously. A certain type of task-splitting algorithms, called slot-based task-splitting, is of particular interest because of its ability to schedule tasks at high processor utilizations. We present a new schedulability analysis for slot-based task-splitting scheduling algorithms that takes the overhead into account and also a new task assignment algorithm.

Unified overhead-aware schedulability analysis for slot-based task-splitting

Hard real- time multiprocessor scheduling has seen, in recent years, the flourishing of semi-partitioned scheduling algorithms. This category of scheduling schemes combines elements of partitioned and global scheduling for the purposes of achieving efficient utilization of the system’s processing resources with strong schedulability guarantees and with low dispatching overheads. The sub-class of slot-based “task-splitting” scheduling algorithms, in particular, offers very good trade-offs between schedulability guarantees (in the form of high utilization bounds) and the number of preemptions/migrations involved. However, so far there did not exist unified scheduling theory for such algorithms; each one was formulated in its own accompanying analysis. This article changes this fragmented landscape by formulating a more unified schedulability theory covering the two state-of-the-art slot-based semi-partitioned algorithms, S-EKG and NPS-F (both fixed job-priority based). This new theory is based on exact schedulability tests, thus also overcoming many sources of pessimism in existing analysis. In turn, since schedulability testing guides the task assignment under the schemes in consideration, we also formulate an improved task assignment procedure. As the other main contribution of this article, and as a response to the fact that many unrealistic assumptions, present in the original theory, tend to undermine the theoretical potential of such scheduling schemes, we identified and modelled into the new analysis all overheads incurred by the algorithms in consideration. The outcome is a new overhead-aware schedulability analysis that permits increased efficiency and reliability. The merits of this new theory are evaluated by an extensive set of experiments.