A compiler writing system based on affix grammars

We present an algorithm for testing the suitability of an affix grammar for deterministic, one-pass, bottom-up parsing which is an improvement over the one suggested by Pohlmann [1]. The space requirements of the new algorithm are considerably less than that of Pohlmann's. We also describe an implementation of Pohlmann's algorithm and methods for improving its space requirements.

Direct Writing of Copper Film Patterns by Laser-Induced Decomposition of Copper Acetate

Direct writing of patterns is being widely attempted in the field of microelectronic circuit/device manufacture. Use of this technique eliminates the need for employing photolithographic process. Laser induced direct writing can be achieved by (i) Photochemical reaction [i] , (ii) Evaporation from target material [2], and (iii) decomposition.Micron size features of palladium and copper through decomposition of palladium acetate and copper formate respectively on quartz and silicon using Argon ion laser have been reported [3,4] .In this commuication we report a technique for both single line and large area depositon of copper through decomposition of copper acetate,(CH3COO)2Cu, on alumina substrates.Nd:YAG laser known for its reliability and low maintenance cost as compared to excimer and other gas lasers is used. This technique offers an attractive and economical alternative for manufacture of thin film microcircuits.

High contrast laser writing in insitu textured germanium films via a novel chemical oxide formation

A high contrast laser writing technique based on laser induced efficient chemical oxidation in insitu textured Ge films is demonstrated. Free running Nd-YAG laser pulses are used for irradiating the films. The irradiation effects have been characterised using optical microscopy, electron spectroscopy and microdensitometry. The mechanism for the observed contrast has been identified as due to formation of GeO2 phase upon laser irradiation using X-ray initiated Auger spectroscopy (XAES) and X-ray photoelectron spectroscopy (XPS). The contrast in the present films is found to be nearly five times more than that known due to GeO phase formation in similar films.

“Aivan sama vaikkei ne olis edes pelannut” – Jalkapallo elämyskulutuksen kohteena

Tutkielmassa tarkastellaan jalkapallon seuraamista elämyskuluttamisen näkökulmasta. Elämyskulutuksella tarkoitetaan tässä yhteydessä tapahtumia ja hetkiä, jolloin ihminen kokee tavallisuudesta poikkeavan ja mieleenpainuvan tunnetilan. Elämyksiä tarjoavat palvelut ovat lisänneet jatkuvasti suosiotaan, kun arjessa rationaalisuus ylikorostuu ja sille halutaan vastapainoa. Aihetta taustoitetaan elämysyhteiskunnan, yhteisöllisyyden ja kuluttajaheimojen käsitteiden avulla. Erityishuomion saavat kulttuuritapahtumat elämystuotteina, penkkiurheilu yhteiskunnallisena ilmiönä sekä erilaiset jalkapalloon liittyvät kulutustavat. Tutkielma on luonteeltaan fenomenologis-etnografinen kuvaileva tutkimus. Tutkimusmenetelminä on käytetty osallistuvaa havainnointia ja haastatteluita. Tutkimusperinteen mukaisesti ilmiön ymmärtäminen, kuvaaminen ja kirjoittaminen ovat tärkeässä osassa. Havainnointiaineisto on kerätty kolmessa eri tapahtumassa seuraamalla katsojien käyttäytymistä ja tunnelman syntymiseen vaikuttavia tekijöitä. Haastateltavat on valittu harkinnanvaraisesti jalkapalloa aktiivisesti seuraavista henkilöistä ja menetelmänä on käytetty avoimia teemahaastatteluita. Urheilun vetovoima ajanvietteenä perustuu vahvojen tunteiden herättämiseen, joten penkkiurheilu on elämyskulutusta puhtaimmillaan. Urheilu elämystuotteena on oivallinen, sillä sen lukuisten kulutustapojen lisäksi tapahtumat muodostavat päättymättömän jatkumon. Myös oman aineistoni perusteella osoittautui, että menneiden tapahtumien avulla ankkuroidutaan yhteisöön ja tulevien tapahtumien avulla pidetään innostusta yllä. Pettymysten hetkelläkään koukusta ei haluta irti, sillä jokainen kokemus lisää tunteita omaa urheilulajia ja yhteisöä kohtaan. Urheilutapahtumissa katsojan elämys syntyy subjektiivisen kokemuksen kautta, mutta yhteisö luo elämyksen toteutumisen välttämättömät edellytykset. Jalkapalloyleisöön kuuluvissa henkilöissä yhdistyvät halu kuulua ryhmään ja olla samaan aikaan sen ulkopuolella. Peliä voidaan tarkkailla itsekseen ja keskittyneesti suuren joukon keskellä tai hurrata muiden mukana. Aineistoni perusteella jalkapallofanin innostus pulppuaa kahdesta lähteestä: yhteisöllisyydestä ja kiinnostuksesta lajiin. Yhteisöllisyyden tunne syntyy kuulumisesta globaaliin jalkapalloyhteisöön, oman suosikkijoukkueen kannattajiin ja samaa lajia seuraavien kaverien muodostamaan lähipiiriin. Urheilullinen puoli innostuksesta syntyy kiinnostuksesta jalkapalloa kohtaan lajina, aktiivisesti seuratuista säännöllisistä tapahtumista ja oman joukkueen kannattamisesta. Jalkapallon seuraajiin teoria jatkuvasti muuttuvista uusyhteisöistä pätee melko huonosti, sillä lajille ja seuralle ollaan hyvin uskollisia. Faneille on tärkeää sitoutua pieneen lähiyhteisöön, jonka kanssa heillä on yhteinen historia ja mahdollisuus jakaa kokemuksia keskustelemalla ja muistelemalla.

A non-cooperative game-theoretic approach to channel assignment in multi-channel multi-radio wireless networks

Channel assignment in multi-channel multi-radio wireless networks poses a significant challenge due to scarcity of number of channels available in the wireless spectrum. Further, additional care has to be taken to consider the interference characteristics of the nodes in the network especially when nodes are in different collision domains. This work views the problem of channel assignment in multi-channel multi-radio networks with multiple collision domains as a non-cooperative game where the objective of the players is to maximize their individual utility by minimizing its interference. Necessary and sufficient conditions are derived for the channel assignment to be a Nash Equilibrium (NE) and efficiency of the NE is analyzed by deriving the lower bound of the price of anarchy of this game. A new fairness measure in multiple collision domain context is proposed and necessary and sufficient conditions for NE outcomes to be fair are derived. The equilibrium conditions are then applied to solve the channel assignment problem by proposing three algorithms, based on perfect/imperfect information, which rely on explicit communication between the players for arriving at an NE. A no-regret learning algorithm known as Freund and Schapire Informed algorithm, which has an additional advantage of low overhead in terms of information exchange, is proposed and its convergence to the stabilizing outcomes is studied. New performance metrics are proposed and extensive simulations are done using Matlab to obtain a thorough understanding of the performance of these algorithms on various topologies with respect to these metrics. It was observed that the algorithms proposed were able to achieve good convergence to NE resulting in efficient channel assignment strategies.

A game theoretical multiple resource interaction approach to resource allocation in an air campaign

In this paper we propose a multiple resource interaction model in a game-theoretical framework to solve resource allocation problems in theater level military campaigns. An air raid campaign using SEAD aircraft and bombers against an enemy target defended by air defense units is considered as the basic platform. Conditions for the existence of saddle point in pure strategies is proved and explicit feedback strategies are obtained for a simplified model with linear attrition function limited by resource availability. An illustrative example demonstrates the key features.

A Coalitional Game Framework for Cooperative Secondary Spectrum Access

We consider a framework in which several service providers offer downlink wireless data access service in a certain area. Each provider serves its end-users through opportunistic secondary spectrum access of licensed spectrum, and needs to pay primary license holders of the spectrum usage based and membership based charges for such secondary spectrum access. In these circumstances, if providers pool their resources and allow end-users to be served by any of the cooperating providers, the total user satisfaction as well as the aggregate revenue earned by providers may increase. We use coalitional game theory to investigate such cooperation among providers, and show that the optimal cooperation schemes can be obtained as solutions of convex optimizations. We next show that under usage based charging scheme, if all providers cooperate, there always exists an operating point that maximizes the aggregate revenue of providers, while presenting each provider a share of the revenue such that no subset of providers has an incentive to leave the coalition. Furthermore, such an operating point can be computed in polynomial time. Finally, we show that when the charging scheme involves membership based charges, the above result holds in important special cases.

A Coalition game model for spectrum pooling in wireless data access networks

We consider a setting in which several operators offer downlink wireless data access services in a certain geographical region. Each operator deploys several base stations or access points, and registers some subscribers. In such a situation, if operators pool their infrastructure, and permit the possibility of subscribers being served by any of the cooperating operators, then there can be overall better user satisfaction, and increased operator revenue. We use coalitional game theory to investigate such resource pooling and cooperation between operators.We use utility functions to model user satisfaction, and show that the resulting coalitional game has the property that if all operators cooperate (i.e., form a grand coalition) then there is an operating point that maximizes the sum utility over the operators while providing the operators revenues such that no subset of operators has an incentive to break away from the coalition. We investigate whether such operating points can result in utility unfairness between users of the various operators. We also study other revenue sharing concepts, namely, the nucleolus and the Shapely value. Such investigations throw light on criteria for operators to accept or reject subscribers, based on the service level agreements proposed by them. We also investigate the situation in which only certain subsets of operators may be willing to cooperate.

A resource based game theoretical model for military conflicts

A resource interaction based game theoretical model for military conflicts is presented in this paper. The model includes both the spatial decision capability of adversaries (decision regarding movement and subsequent distribution of resources) as well as their temporal decision capability (decision regarding level of allocation of resources for conflict with adversary’s resources). Attrition is decided at present by simple deterministic models. An additional feature of this model is the inclusion of the possibility of a given resource interacting with several resources of the adversary.The decisions of the adversaries is determined by solving for the equilibrium Nash strategies given that the objectives of the adversaries may not be in direct conflict. Examples are given to show the applicability of these models and solution concepts.

A game theoretic approach for feature clustering and its application to feature selection

In this paper, we develop a game theoretic approach for clustering features in a learning problem. Feature clustering can serve as an important preprocessing step in many problems such as feature selection, dimensionality reduction, etc. In this approach, we view features as rational players of a coalitional game where they form coalitions (or clusters) among themselves in order to maximize their individual payoffs. We show how Nash Stable Partition (NSP), a well known concept in the coalitional game theory, provides a natural way of clustering features. Through this approach, one can obtain some desirable properties of the clusters by choosing appropriate payoff functions. For a small number of features, the NSP based clustering can be found by solving an integer linear program (ILP). However, for large number of features, the ILP based approach does not scale well and hence we propose a hierarchical approach. Interestingly, a key result that we prove on the equivalence between a k-size NSP of a coalitional game and minimum k-cut of an appropriately constructed graph comes in handy for large scale problems. In this paper, we use feature selection problem (in a classification setting) as a running example to illustrate our approach. We conduct experiments to illustrate the efficacy of our approach.

Pattern clustering using cooperative game theory

In this paper, we approach the classical problem of clustering using solution concepts from cooperative game theory such as Nucleolus and Shapley value. We formulate the problem of clustering as a characteristic form game and develop a novel algorithm DRAC (Density-Restricted Agglomerative Clustering) for clustering. With extensive experimentation on standard data sets, we compare the performance of DRAC with that of well known algorithms. We show an interesting result that four prominent solution concepts, Nucleolus, Shapley value, Gately point and \tau-value coincide for the defined characteristic form game. This vindicates the choice of the characteristic function of the clustering game and also provides strong intuitive foundation for our approach.