One Degree Many Choices

An early crossroad in life is choosing a field of study at the university. This lays the foundation for the rest of our lives. This book records the career choices of the first batch of 557 engineering graduates from the Nanyang Technological Institute (NTI) as NTU was known in 1985. Engineering was then the only discipline offered. The passage of 25 years yielded deep insights as these pioneers reflected on the impact of their engineering education on their careers. Demonstrating the reach and significance of engineering will arouse the curiousity and imagination of the young, especially those good at maths and science. These life stories showcase the options open to an engineering graduate. If this book inspires some to take up an engineering education in general and at NTU in particular, it will have achieved its purpose.

Microscopic Dynamics of Plasmas and Chaos discusses the resonant wave-particle interaction in plasmas, provides the tools for chaotic Hamiltonian dynamics, and describes a turbulent macroscopic system through the chaotic classical mechanics of the corresponding N-body problem. The book begins with the fundamentals of N-body dynamics, followed by a

This thesis presents a study of several combinatorial problems related to social choice and social networks. The main concern is their computational complexity, with an emphasis on their parameterized complexity. The goal is to devise efficient algorithms for each of the problems studied here, or to prove that, under widely-accepted assumptions, such algorithms cannot exist. The problems discussed in Chapter 3 and in Chapter 4 are about manipulating a given election, where some relationships between the entities of the election are assumed. This can be seen as if the election occurs on top of an underlying social network, connecting the voters participating in the election or the candidates which the voters vote on. The problem discussed in Chapter 3, Combinatorial Candidate Control, is about manipulating an election by changing the set of candidates which the voters vote on. That is, there is an external agent who can add new candidates or delete existing candidates. A combinatorial structure over the candidates is assumed, such that whenever the external agent adds or removes a candidate, a predefined set of candidates (related to the chosen candidate) are added or removed from the election. The problem discussed in Chapter 4, Combinatorial Shift Bribery, is also about manipulating an election. Here, however, the external agent can change the way some voters vote. Specifically, a combinatorial structure over the voters is assumed, such that the external agent can change the position of its preferred candidate in sets of voters, following some predefined patterns. The problem discussed in Chapter 5, Election Anonymization, is also about elections. The main concern here, however, is preserving the privacy of the voters, when the votes are published, along with some additional (private) information. The task is to transform a given election such that each vote would appear at least k times. By doing so, even an adversary which knows how some voters vote, cannot identify individual voters. The problems discussed in Chapter 6 and in Chapter 7 are also about privacy. Specifically, a social network (modeled as a graph) is to become publicly available. The task is to anonymize the graph; that is, to transform the graph such that, for every vertex, there will be at least $k - 1$ other vertices with the same degree. By doing so, even an adversary which knows the degrees of some vertices cannot identify individual vertices. In the problem discussed in Chapter 6, Degree Anonymization by Vertex Addition, the way to achieve anonymity is by introducing new vertices. In the problem discussed in Chapter 7, Degree Anonymization By Graph Contractions, the way to achieve anonymity is by contracting as few edges as possible. The main aim of this thesis, considering the problems mentioned above, is to explore some boundaries between tractability and intractability. Specifically, as most of these problems are computationally intractable (that is, NP-hard or even hard to approximate), some restricted cases and parameterizations for these problems are considered. The goal is to devise efficient algorithms for them, running in polynomial-time when some parameters are assumed to be constant, or, even better, to show that the problems are fixed-parameter tractable for the parameters considered. If such algorithms cannot be devised, then the goal is to prove that these problems are indeed not fixed-parameter tractable with respect to some parameters, or, even better, to show that the problems are NP-hard even when some parameters are assumed to be constant. Diese Dissertation stellt eine Untersuchung von verschiedenen kombinatorischen Problemen im Umfeld von Wahlen und sozialen Netzwerken dar. Das Hauptziel ist die Analyse der Berechnungskomplexität mit dem Schwerpunkt auf der parametrisierten Komplexität. Dabei werden für jedes der untersuchten Probleme effiziente Algorithmen entworfen oder aber gezeigt, dass unter weit akzeptierten Annahmen solche Algorithmen nicht existieren können. Die Probleme, welche im Kapitel 3 und im Kapitel 4 diskutiert werden, modellieren das Manipulieren einer gegebenen Wahl, bei welcher gewisse Beziehungen zwischen den Beteiligten angenommen werden. Dies kann so interpretiert werden, dass die Wahl innerhalb eines Sozialen Netzwerks stattfindet, in dem die Wähler oder die Kandidaten miteinander in Verbindung stehen. Das Problem Combinatorial Candidate Control ONTROL, welches in Kapitel 3 untersucht wird, handelt von der Manipulation einer Wahl durch die änderung der Kandidatenmenge über welche die Wähler abstimmen. Genauer gesagt, gibt es einen externen Agenten, welcher neue Kandidaten hinzufügen oder existierende Kandidaten entfernen kann. Es wird eine kombinatorische Struktur über der Kandidatenmenge angenommen, so dass immer wenn der externe Agent einen Kandidaten hinzufügt oder entfernt, eine vordefinierte Kandidatenmenge (welche mit den ausgewählten Kandidaten in Beziehung steht) ebenfalls hinzugefügt bzw. entfernt wird. Das Problem Combinatorial Shift Bribery, welches in Kapitel 4 untersucht wird, thematisiert ebenfalls die Manipulation einer Wahl. Hier allerdings kann der externe Agent Änderungen des Abstimmungsverhaltens einiger Wähler herbeiführen. Dabei wird eine kombinatorische Struktur über den Wählern angenommen, so dass der externe Agent die Position des von ihm präferierten Kandidaten bei mehreren Wählern entsprechend vordefinierter Muster gleichzeitig ändern kann. Das Problem Election Anonymization, welches in Kapitel 5 untersucht wird, befasst sich ebenso mit Wahlen. Das Hauptanliegen hier ist es jedoch, die Privatsphäre der Wähler bei der Veröffentlichung der Stimmenabgaben zusammen mit einigen zusätzlichen (privaten) Informationen aufrecht zu erhalten. Die Aufgabe ist es eine gegebene Wahl so zu verändern, dass jede Stimmenabgabe mindestens k-fach vorkommt. Dadurch kann noch nicht einmal ein Gegenspieler einzelne Wähler identifizieren, wenn er die Stimmenabgaben einiger Wähler bereits kennt. Die in Kapitel 6 und 7 untersuchten Probleme behandeln gleichermaßen Privatsphärenaspekte. Präziser gesagt, geht es darum, dass ein soziales Netzwerk (modelliert als Graph) veröffentlicht werden soll. Die Aufgabe ist es den Graphen zu anonymisieren; dies bedeutet man verändert den Graphen, so dass es für jeden Knoten mindestens k − 1 weitere Knoten mit dem selben Grad gibt. Dadurch wird erreicht, dass selbst ein Gegenspieler, welcher die Knotengrade einiger Knoten kennt, nicht in der Lage ist einzelne Knoten zu identifizieren. Bei dem Problem Degree Anonymization by Vertex Addition, welches in Kapitel 6 untersucht wird, wird Anonymität durch Einführung neuer Knoten erreicht. Bei dem Problem Degree Anonymization by Graph Contractions, welches in Kapitel 7 untersucht wird, wird Anonymität durch die Kontraktion von möglichst wenigen Kanten erreicht. Das Hauptanliegen dieser Dissertation in Bezug auf die obig genannten Probleme ist es die Grenzen der effizienten Lösbarkeit auszuloten. Insbesondere da die meisten dieser Probleme berechnungsschwer (genauer NP-schwer bzw. sogar schwer zu approximieren) sind, werden einige eingeschränkte Fälle und Parametrisierungen der Probleme betrachtet. Das Ziel ist es effiziente Algorithmen für sie zu entwickeln, welche in Polynomzeit laufen, wenn einige Parameter konstante Werte aufweisen, oder besser noch zu zeigen, dass die Probleme “fixed-parameter tractable” für die betrachteten Parameter sind. Wenn solche Algorithmen nicht gefunden werden können, dann ist es das Ziel zu beweisen, dass diese Probleme tatsächlich nicht “fixed-parameter tractable” bezüglich der entsprechenden Parameter sind, oder noch besser zu zeigen, dass die Probleme NP-schwer sind, sogar wenn die entsprechenden Parameter konstante Werte aufweisen.

A Primer on Nonmarket Valuation is unique in its clear descriptions of the most commonly used nonmarket valuation techniques and their implementation. Individuals working for government agencies, attorneys involved with natural resource damage assessments, graduate students, and others will appreciate the non-technical and practical tone of this book. The first section of the book provides the context and theoretical foundation of nonmarket valuation, along with practical data issues. The middle two sections of the Primer describe the major stated and revealed nonmarket valuation techniques. For each technique, the steps involved in implementation are laid out and described. Both practitioners of nonmarket valuation and those who are new to the field will come away from these methods chapters with a thorough understanding of how to design, implement, and analyze a nonmarket valuation study. The concluding section takes stock of the usefulness of nonmarket valuation, highlighting chapters on benefit transfer, the role of nonmarket valuation in real decisions about natural resources, and where nonmarket valuation is headed in the future. As a companion to A Primer on Nonmarket Valuation, a website has been developed, http://www.fs.fed.us/nonmarketprimerdata/. This website includes downloadable datasets for each of the techniques described in the Primer, as well as links to published journal articles and reports based on the data. The website also provides an opportunity for students to estimate models using the data.

---Not a prolegomena, a foundation.--- More descriptive than a manifesto, and deeply pioneering in its formality, this manual uses a diagrammatic method to express new theories and foundations in thought. In place of circular reasoning, it offers recursive proofs; in place of insolvability, it offers exclusive contexts; in place of linguistic deconstruction, it offers categorical deductions. It includes over three-hundred pages of interrelated methods, arguments, and tools, which promise to assist the philosopher in making logical, ethical, and systematic claims. This first published volume of the dimensional encyclopedia is something more than an encyclopedia. Its a guide to genuine philosophy.

Engineers play a vital role in nation building. Since independence, they have been driving Singapore's efforts in industrialisation. Their vision, creativity and resilience gave Singapore a competitive edge, enabling a meteoric rise from Third World to First in one generation. Going forward, the government wants to make Singapore a "e;Smart Nation"e; - a nation where people live meaningful and fulfilled lives, enabled seamlessly by technology, offering exciting opportunities for all. Engineers are vital in making this happen. This book captures 100 stories of engineering accomplishments in Singapore over a span of 30 years as told by the Nanyang Technological Institute (now known as NTU) Pioneer Engineering Class of 85. They demonstrate the breadth and depth of the engineering landscape in our nation. If this book inspires some to take up an engineering career, it will have achieved its purpose.

A unified development of the subject, presenting the theory of options in each of the different forms and stressing the equivalence between each of the methodologies. * Demystifies some of the more complex topics. * Derives practical, tangible results using the theory, to help practitioners in problem solving. * Applies the results obtained to the analysis and pricing of options in the equity, currency, commodity and interest rate markets. * Gives the reader the analytical tools and technical jargon to understand the current technical literature available. * Provides a user-friendly reference on option theory for practicing investors and traders.