A comparison of approaches for finding minimum identifying codes on graphs

In order to formulate mathematical conjectures likely to be true, a number of base cases must be determined. However, many combinatorial problems are NP-hard and the computational complexity makes this research approach difficult using a standard brute force approach on a typical computer. One sample problem explored is that of finding a minimum identifying code. To work around the computational issues, a variety of methods are explored and consist of a parallel computing approach using MATLAB, an adiabatic quantum optimization approach using a D-Wave quantum annealing processor, and lastly using satisfiability modulo theory (SMT) and corresponding SMT solvers. Each of these methods requires the problem to be formulated in a unique manner. In this paper, we address the challenges of computing solutions to this NP-hard problem with respect to each of these methods.     

Optical receiver front end for optically powered smart dust

The ability to create and direct beams of light means that optical communications potentially offer a large power advantage over RF communications for sensor networks. This paper presents an optically powered receiver front end for wireless optical communications. A complete optical receiver front end including a photodetector, clock and Manchester data recovery circuits has been fabricated using the UMC 180 nm CMOS process. A novel modulation scheme is described that has been devised so that this front end can recover the clock and Manchester data from an optical beam. Experimental results show that the total current consumption of the optical receiver front end is as low as 18.8 nA for a 0.5 V supply when a 1 kbps Manchester data and 8 kHz clock signal are successfully recovered. This means that photodiodes on the same substrate as the front end circuits extract enough power from the communications beam to allow the front end to work at distances of up to 10 m from the transmitter. Copyright © 2013 John Wiley & Sons, Ltd.     

Temburong Bridge,Brunei – Design of two cable stayed bridges

The Temburong Bridge Project is a 30 km long dual two‐lane highway crossing over the Brunei Bay. It will connect the relatively isolated Brunei district of Temburong to the other three Brunei districts. The main objective of the project is to stimulate economic growth in the Temburong region by connecting it to the country's airport and ports. The alignment crosses two navigation channels resulting in the need for two cable stayed bridges – the Brunei Channel Bridge (145 m main span) and the Eastern Channel Bridge (260 m main span). The design of these cable stayed bridges is one of the first applications of the Eurocode to a fully concrete cable stayed bridge. Both cable stayed bridges draw on strong Islamic architectural influences from the region to form a tower shape that is unique and instantly recognisable. Temburong Brücke, Brunei – Entwurf von zwei Schrägkabelbrücken Die Temburong Brücke ist eine 30 km lange Verbindung über die Brunei Bucht mit zwei Richtungsfahrbahnen mit je zwei Fahrstreifen. Sie wird den relativ isolierten Distrikt Temburong mit den anderen drei Distrikten Bruneis verbinden. Hauptanliegen des Projekts ist die Stimulierung von ökonomischem Wachstum in der Temburong Region, indem sie an den Flughafen und Seehafen des Landes angebunden wird. Die Trassierung erfordert die Überquerung zweier Schiffahrtsrouten. Dies wird mit der Anordnung zweier Schrägkabelbrücken ermöglicht, der Brunei Channel Brücke (145 m Hauptspannweite) und der Eastern Channel Brücke (260 m Hauptspannweite). Die Bemessung der beiden Brücken stellt eine der ersten Anwendungen des Eurocode auf Schrägkabelbrücken mit Betonüberbau dar. Optisch sind die beiden Brücken geprägt von der islamischen Architektur der Umgebung, die Pylonform ist ein besonderes Erkennungsmerkmal der Brücken.