The Electronic Journal of Information Technology in Construction (ITcon): An Open Access Journal Using an Un-paid, Volunteer-Based Organization

Introduction This case study is based on the experiences with the Electronic Journal of Information Technology in Construction (ITcon), founded in 1995. Development This journal is an example of a particular category of open access journals, which use neither author charges nor subscriptions to finance their operations, but rely largely on unpaid voluntary work in the spirit of the open source movement. The journal has, after some initial struggle, survived its first decade and is now established as one of half-a-dozen peer reviewed journals in its field. Operations The journal publishes articles as they become ready, but creates virtual issues through alerting messages to “subscribers”. It has also started to publish special issues, since this helps in attracting submissions, and also helps in sharing the work-load of review management. From the start the journal adopted a rather traditional layout of the articles. After the first few years the HTML version was dropped and papers are only published in PDF format. Performance The journal has recently been benchmarked against the competing journals in its field. Its acceptance rate of 53% is slightly higher and its average turnaround time of seven months almost a year faster compared to those journals in the sample for which data could be obtained. The server log files for the past three years have also been studied. Conclusions Our overall experience demonstrates that it is possible to publish this type of OA journal, with a yearly publishing volume equal to a quarterly journal and involving the processing of some fifty submissions a year, using a networked volunteer-based organization.

Control of transient thermal response during sequential open-die forging: A trajectory optimization approach

A trajectory optimization approach is applied to the design of a sequence of open-die forging operations in order to control the transient thermal response of a large titanium alloy billet. The amount of time tire billet is soaked in furnace prior to each successive forging operation is optimized to minimize the total process time while simultaneously satisfying constraints on the maximum and minimum values of the billet's temperature distribution to avoid microstructural defects during forging. The results indicate that a "differential" heating profile is the most effective at meeting these design goals.

Multi-port network modeling of stub loaded Microstrip ring antenna for dual-band operations

A square ring microstrip antenna can be modified for dual-band operations by appropriately attaching an open ended stub. The input impedance of this antenna is analyzed here using multi-port network modeling (MNM) approach. The coupled feed is included by defining additional terms in the model. A prototype antenna is fabricated and tested to validate these computations.

Orthodontic and orthopaedic treatment for anterior open bite in children

BackgroundAnterior open bite occurs when there is a lack of vertical overlap of the upper and lower incisors. the aetiology is multifactorial including: oral habits, unfavourable growth patterns, enlarged lymphatic tissue with mouth breathing. Several treatments have been proposed to correct this malocclusion, but interventions are not supported by strong scientific evidence.ObjectivesThe aim of this systematic review was to evaluate orthodontic and orthopaedic treatments to correct anterior open bite in children.Search methodsThe following databases were searched: the Cochrane Oral Health Group's Trials Register (to 14 February 2014); the Cochrane Central Register of Controlled Trials (CENTRAL)(The Cochrane Library 2014, Issue 1); MEDLINE via OVID (1946 to 14 February 2014); EMBASE via OVID (1980 to 14 February 2014); LILACS via BIREME Virtual Health Library (1982 to 14 February 2014); BBO via BIREME Virtual Health Library (1980 to 14 February 2014); and SciELO (1997 to 14 February 2014). We searched for ongoing trials via ClinicalTrials.gov (to 14 February 2014). Chinese journals were handsearched and the bibliographies of papers were retrieved.Selection criteriaAll randomised or quasi-randomised controlled trials of orthodontic or orthopaedic treatments or both to correct anterior open bite in children.Data collection and analysisTwo review authors independently assessed the eligibility of all reports identified.Risk ratios (RRs) and corresponding 95% confidence intervals (CIs) were calculated for dichotomous data. the continuous data were expressed as described by the author.Main resultsThree randomised controlled trials were included comparing: effects of Frankel's function regulator-4 (FR-4) with lip-seal training versus no treatment; repelling-magnet splints versus bite-blocks; and palatal crib associated with high-pull chincup versus no treatment.The study comparing repelling-magnet splints versus bite-blocks could not be analysed because the authors interrupted the treatment earlier than planned due to side effects in four of ten patients.FR-4 associated with lip-seal training (RR = 0.02 (95% CI 0.00 to 0.38)) and removable palatal crib associated with high-pull chincup (RR = 0.23 (95% CI 0.11 to 0.48)) were able to correct anterior open bite.No study described: randomisation process, sample size calculation, there was not blinding in the cephalometric analysis and the two studies evaluated two interventions at the same time. These results should be therefore viewed with caution.Authors' conclusionsThere is weak evidence that the interventions FR-4 with lip-seal training and palatal crib associated with high-pull chincup are able to correct anterior open bite. Given that the trials included have potential bias, these results must be viewed with caution. Recommendations for clinical practice cannot be made based only on the results of these trials. More randomised controlled trials are needed to elucidate the interventions for treating anterior open bite.

A greedy open shop heuristic with job priorities

The paper presents an improved version of the greedy open shop approximation algorithm with pre-ordering of jobs. It is shown that the algorithm compares favorably with the greedy algorithm with no pre-ordering by reducing either its absolute or relative error. In the case of three machines, the new algorithm creates a schedule with the makespan that is at most 3/2 times the optimal value.

A polynomial algorithm for the three-machine open shop with a bottleneck machine

The paper considers the three‐machine open shop scheduling problem to minimize themakespan. It is assumed that each job consists of at most two operations, one of which is tobe processed on the bottleneck machine, the same for all jobs. A new lower bound on theoptimal makespan is derived, and a linear‐time algorithm for finding an optimalnon‐preemptive schedule is presented.

Group technology approach to the open shop scheduling problem with batch setup times

This paper studies the problem of scheduling jobs in a two-machine open shop to minimize the makespan. Jobs are grouped into batches and are processed without preemption. A batch setup time on each machine is required before the first job is processed, and when a machine switches from processing a job in some batch to a job of another batch. For this NP-hard problem, we propose a linear-time heuristic algorithm that creates a group technology schedule, in which no batch is split into sub-batches. We demonstrate that our heuristic is a -approximation algorithm. Moreover, we show that no group technology algorithm can guarantee a worst-case performance ratio less than 5/4.

An open shop scheduling problem with a non-bottleneck machine

This paper considers the problem of processing n jobs in a two-machine non-preemptive open shop to minimize the makespan, i.e., the maximum completion time. One of the machines is assumed to be non-bottleneck. It is shown that, unlike its flow shop counterpart, the problem is NP-hard in the ordinary sense. On the other hand, the problem is shown to be solvable by a dynamic programming algorithm that requires pseudopolynomial time. The latter algorithm can be converted into a fully polynomial approximation scheme that runs in time. An O(n log n) approximation algorithm is also designed whi finds a schedule with makespan at most 5/4 times the optimal value, and this bound is tight.

Scheduling batches with sequential job processing for two-machine flow and open shops

In this paper, we study a problem of scheduling and batching on two machines in a flow-shop and open-shop environment. Each machine processes operations in batches, and the processing time of a batch is the sum of the processing times of the operations in that batch. A setup time, which depends only on the machine, is required before a batch is processed on a machine, and all jobs in a batch remain at the machine until the entire batch is processed. The aim is to make batching and sequencing decisions, which specify a partition of the jobs into batches on each machine, and a processing order of the batches on each machine, respectively, so that the makespan is minimized. The flow-shop problem is shown to be strongly NP-hard. We demonstrate that there is an optimal solution with the same batches on the two machines; we refer to these as consistent batches. A heuristic is developed that selects the best schedule among several with one, two, or three consistent batches, and is shown to have a worst-case performance ratio of 4/3. For the open-shop, we show that the problem is NP-hard in the ordinary sense. By proving the existence of an optimal solution with one, two or three consistent batches, a close relationship is established with the problem of scheduling two or three identical parallel machines to minimize the makespan. This allows a pseudo-polynomial algorithm to be derived, and various heuristic methods to be suggested.

Two-machine open shop scheduling with an availability constraint

We study a two-machine open shop scheduling problem, in which one machine is not available for processing during a given time interval. The objective is to minimize the makespan. We show that the problem is NP-hard and present an approximation algorithm with a worst-case ratio of 4/3.

Two-stage open shop scheduling with a bottleneck machine

It is known that for the open shop scheduling problem to minimize the makespan there exists no polynomial-time heuristic algorithm that guarantees a worst-case performance ratio better than 5/4, unless P6≠NP. However, this result holds only if the instance of the problem contains jobs consisting of at least three operations. This paper considers the open shop scheduling problem, provided that each job consists of at most two operations, one of which is to be processed on one of the m⩾2 machines, while the other operation must be performed on the bottleneck machine, the same for all jobs. For this NP-hard problem we present a heuristic algorithm and show that its worst-case performance ratio is 5/4.

Non-preemptive two-machine open shop scheduling with non-availability constraints

We study a two-machine open shop scheduling problem, in which the machines are not continuously available for processing. No preemption is allowed in the processing of any operation. The objective is to minimize the makespan. We consider approximability issues of the problem with more than one non-availability intervals and present an approximation algorithm with a worst-case ratio of 4/3 for the problem with a single non-availability interval.

Communicating open systems

Just as conventional institutions are organisational structures for coordinating the activities of multiple interacting individuals, electronic institutions provide a computational analogue for coordinating the activities of multiple interacting software agents. In this paper, we argue that open multi-agent systems can be effectively designed and implemented as electronic institutions, for which we provide a comprehensive computational model. More specifically, the paper provides an operational semantics for electronic institutions, specifying the essential data structures, the state representation and the key operations necessary to implement them. We specify the agent workflow structure that is the core component of such electronic institutions and particular instantiations of knowledge representation languages that support the institutional model. In so doing, we provide the first formal account of the electronic institution concept in a rigorous and unambiguous way.

Improving Performance of Open Access Clinics

Open Access Scheduling has shown great promise in allowing health care practices to provide same-day access, and to match patients with their regular physicians. However, similarly to traditional clinics where appointments are pre-booked, open access clinics are also frustrated with long waits, long idle time and long overtime due to uncertainties such as patient no-shows, variable service time and variable daily demand. These aspects have not been studied previously in an open access setting. This study investigates different management options to improve clinical performance in terms of patient waiting time, doctor idle time and clinic overtime. Other factors studied with a simulation model include client load and placement of pre-booked slots. Results show that a proper panel size is critical to obtain good performance for open access clinics, and that good choices for management options depend on the client load.