O melhor entendimento sobre os aspectos metabólicos, nutricionais e produtivos das gramíneas forrageiras quanto ao uso do nitrogênio é necessário para aumentar a eficiência de uso do nutriente e para a sustentabilidade da produção pecuária. Com isso, objetivou-se analisar alguns cultivares de gramíneas forrageiras utilizados em pastagens no Brasil, quanto a: I) modificações morfológicas e produtivas da parte aérea e das raízes; II) formas de partição do nitrogênio absorvido para melhorar a eficiência de uso do nitrogênio e III) forma de assimilação do nitrogênio absorvido, sendo avaliados pelas variáveis: produção de massa seca, números de folhas e perfilhos, área foliar, concentração e conteúdos de nitrogênio total, nitrato e amônio, eficiência de uso do nitrogênio, atividades das enzimas nitrato redutase e glutamina sintetase e concentração de aminoácidos livres totais na parte aérea e nas raízes dessas gramíneas, quando submetidas a alta e baixa dose de nitrogênio. Na baixa dose de nitrogênio os cultivares Marandu, Xaraés, Piatã, Basilisk e Mombaça mantiveram o número de perfilhos constante e diminuíram o número de folhas e a área foliar, enquanto o cultivar Tanzânia manteve o número de perfilhos e área foliar constantes e reduziu o número de folhas e os cultivares Aruana e Massai aumentaram o número de perfilhos e de folhas e reduziram a área foliar. A baixa dose de nitrogênio resultou em proporções da massa seca da parte aérea e das raízes distintas entre os cultivares quando comparada à alta dose de nitrogênio, favorecendo o crescimento das raízes. Os cultivares estudados modificaram a partição de nitrogênio, nitrato e amônio da parte aérea e raízes, quando em alto e baixo suprimento de nitrogênio. Essas diferenças refletiram na mais alta eficiência de uso do nitrogênio pelos cultivares Mombaça e Tanzânia. A assimilação do nitrato ocorreu principalmente na parte aérea desses capins. Os cultivares Mombaça e Aruana apresentaram elevadas atividades da enzima nitrato redutase nas folhas diagnósticas. A atividade da enzima glutamina sintetase nas folhas diagnósticas foi mais elevada nos cultivares de Panicum. A concentração de amônio nas raízes foi mais alta nos cultivares Piatã e Xaraés, na baixa dose de nitrogênio, e nos capins Aruana e Mombaça, na dose alta de nitrogênio. A concentração de aminoácidos totais nas folhas diagnósticas foi mais elevada nos cultivares de Panicum, quando submetidos à alta dose de nitrogênio, enquanto nas raízes foi maior nos cultivares de Brachiaria, nas duas doses de nitrogênio. / A better understanding of the metabolic, nutritional and production aspects of nitrogen use by grasses are needed to increase nutrient use efficiency and livestock production sustainability. Thus, this study aimed to analyze some forage grasses cultivars used in Brazilian pastures, for: i) morphological and production changes in shoots and roots; II) absorbed nitrogen partition to improve nitrogen use efficiency and III) nitrogen assimilation, evaluated by the variables: dry matter production, number of leaves and tillers, leaf area, concentration and content of total nitrogen, nitrate and ammonium, nitrogen use efficiency, nitrate reductase and glutamine synthetase activities and free amino acids concentration in shoots and roots of these grasses, when supplied with high and low nitrogen rates. At low nitrogen rate, Marandu, Xaraés, Piatã, Basilisk and Mombaça cultivars kept the number of tillers constant and decreased the number of leaves and leaf area, while Tanzânia cultivar kept the number of tillers and leaf area constant and reduced the number of leaves, and Aruana and Massai cultivars increased the number of tillers and leaves and reduced leaf area. The low nitrogen rate resulted in different shoots to roots proportions among cultivars when compared to the higher nitrogen rate, which favored roots growth. The cultivars changed the partition of nitrogen, nitrate and ammonium between roots and shoots, in both nitrogen rates. These differences reflect the higher nitrogen use efficiency by Mombaça and Tanzânia cultivars. The nitrate assimilation occurred mainly in the shoots of these grasses. Mombaça and Aruana cultivars showed high nitrate reductase activity in diagnostic leaves. The glutamine synthetase activity in diagnostic leaves was higher in Panicum cultivars. Ammonium concentration in the roots was high in Piatã and Xaraés, at low nitrogen rate, and Aruana and Mombaça grasses, at high nitrogen rate. The total amino acids concentration in diagnostic leaves was higher in Panicum cultivars than in Brachiaria cultivars, when high nitrogen rate was supplied, whereas Brachiaria cultivars had this concentration high in the roots, at the two nitrogen rates.

Cette étude est consacrée à la détermination théorique de la composition et des propriétés thermodynamiques des plasmas thermiques à l'équilibre et hors d'équilibre thermodynamique. <br /><br /> Dans le cas des plasmas à l'équilibre thermodynamique, la méthode de la minimisation de l'enthalpie libre est employée. Pour cela, une banque de données thermodynamiques, nécessitant le calcul des fonctions de partition de chaque espèce prise en compte, est constituée. Le formalisme numérique utilisant la méthode de minimisation « steepest descent » de White et al, est rappelé.<br /><br /> Dans le cas des plasmas hors d'équilibre thermique, l'enthalpie libre totale est établie en associant une température à chaque degré de liberté. Les fonctions de partition des espèces diatomiques doivent alors être modifiées. La méthode numérique « steepest descent » de White et al est alors adaptée. Cette méthode de calcul permet plusieurs hypothèses sur les températures internes : rotation, vibration et excitation électronique.<br /><br /> Les méthodes de calculs basées sur la minimisation de l'enthalpie libre, sur les lois d'action de masse, sur une approche cinétique dans le cas des plasmas hors d'équilibre thermique sont comparées. Les deux premières méthodes donnent des résultats identiques mais diffèrent de la troisième. Le calcul des constantes d'équilibre chimique est alors modifié ce qui permet de déterminer la composition des plasmas hors d'équilibre thermique et chimique. <br /><br /> Les calculs sont appliqués à de nombreux plasmas ayant un rapport direct avec les applications industrielles, ou générés à partir de mélanges de gaz étudiés expérimentalement au laboratoire : <br />• disjoncteurs : plasmas de vapeurs d'isolants (PE, POM, PETP, PMMA, PA6-6)<br />• détection des composés polluants émis lors de la combustion du charbon (HAP)<br />• mélange Ar-CO2, O2, N2, H2.<br />De nombreux développements peuvent être envisagés, par exemple : <br />• système polyphasique (solide, liquide) <br />• calcul du déséquilibre thermique en fonction du champ électrique

Dans la présente thèse de doctorat je présente des résultats concernant des modèles désordonnés et frustrés venant de la physique statistique et de l'optimisation combinatoire. Comme application de la théorie des verres de spins, j'étudie le modèle de Blume, Emery et Griffiths désordonné et frustré. Ce modèle est traité dans l'approximation de champ moyen dans le cadre de la méthode des répliques A l'aide de l'Ansatz symétrique dans les répliques je présente une solution numérique complète puis je discute des effets de brisure de cette symétrie La stabilité de la solution symétrique a été Rudik et les régions instables identifiées Le diagramme de phase exhibe des transitions de premier et de second ordre. Le point tricritique persiste dans le modèle frustré, Ce qui est en accord avec des travaux antérieurs une version du modèle BEG avec un potentiel chimique désordonné a également été étudiée. les calculs confirment que le point tricritique apparaît à plus basse température quand il y a du désordre. Ensuite je considère le problème de la bipartition d'un graphe. Ce problème correspond du point de vue de la physique statistique h un verre de spins soumis h une contrainte d'aimantation totale nulle. je considère les propriétés statistiques des solutions de faible énergie engendrées par des algorithmes heuristiques. de tels algorithme sont en général conçus pour résoudre des problèmes d'optimisation combinatoire qui sont NP- difficiles. Plusieurs heuristiques ont 60 implémentées pour le problème de la bipartition de graphe. des lois d'échelle ont été obtenues : en particulier la moyenne et la variance du coût obéissent A une loi linéaire en N. Par conséquent le coût obtenu par des heuristiques est une quantité auto-moyennante. je suggère que cette propriété est générale valable aussi pour les solutions aléatoires pour les solutions quasi-optimales et pour les solutions optimales. En outre je propose une procédure pour comparer des algorithmes heuristiques. Cette procédure tient compte de la qualité de la solution aussi bien que du temps de calcul utilisé. Dans la troisième partie de ma thèse j'ai étudié en détail les propriétés h température nulle des verres de spins sur des graphes aléatoires lacunaires avec une coordination fixe. les verres de spins sur de tels graphes peuvent être considérés comme une approximation aux vrais verres de spins qui est plus réaliste que le modèle de Sherrington et Kirkpatrick. J'ai conçu un nouvel algorithme pour trouver les états fondamentaux. Aussi je teste numériquement une conjecture de Banavar, Sherrington et Sourlas qui donne la densité d'énergie du fondamental dans la limite de grande taille en fonction de la coordination. La distribution du paramètre d'ordre se révèle être non triviale et les données présentent une forte indication de la présence d'ultramétricité pour toutes les valeur de la coordination. Ces résultats confirment que les propriétés particulières des verres de spin, déduites an niveau de l'approximation de champ moyen dans le cadre du modèle de Sherrington et Kirkpatrick, sont aussi présentes pour des modèles plus réalistes comme les verres de spins sur des graphes aléatoires lacunaires avec une coordination fixe.

L'objet de ce mémoire est de présenter le travail effectué au cours de cette thèse qui était de caractériser électriquement et de modéliser le transport électrique de trois architectures de transistors MOS pour des filières 50nm et en deçà : CMOS Si à oxyde ultrafin, nMOS Si:C et pMOS SiGe. Afin d'étudier les effets de canaux courts sur ces dispositifs nous avons proposé et/ou optimisé plusieurs procédures d'extraction de paramètres ainsi que plusieurs modèles physiques analytiques décrivant le comportement des principaux paramètres électriques de ce type de transistors aux longueurs de grille décananométriques. Ainsi, une méthode expérimentale complète et un modèle pour la partition du courant de grille ont été validés pour les transistors à oxyde ultrafin. Une optimisation de la méthode Split C-V pour les canaux courts a été validée donnant de précieux renseignements sur la mobilité des transistors MOS ultracourts. Un modèle a été validé pour le bruit 1/f des transistors à canal enterré SiGe sub-0,1μm. Toutes ces méthodes nous ont permis de montrer que les transistors à oxyde ultrafins gardaient de très bonne propriétés de transport électrique jusqu'à 30nm de longueur de grille, que les nMOS Si:C était une alternative fiable au fort dopage canal pour contrôler les effets de canaux courts des nMOS sub-0,1μm et que les pMOS SiGe avaient un niveau de bruit 1/f plus faible en forte inversion même aux longueurs de grille décanamométriques

This thesis deals with enumerative combinatorics applied to three different objects related to partition shapes, namely tableaux, restricted words, and Bruhat intervals. The main scientific contributions are the following. Paper I: Let the sign of a standard Young tableau be the sign of the permutation you get by reading it row by row from left to right, like a book. A conjecture by Richard Stanley says that the sum of the signs of all SYTs with n squares is 2^[n/2]. We prove a generalisation of this conjecture using the Robinson-Schensted correspondence and a new concept called chess tableaux. The proof is built on a remarkably simple relation between the sign of a permutation pi and the signs of its RS-corresponding tableaux P and Q, namely sgn(pi) = (−1)^v sgn(P)sgn(Q), where v is the number of disjoint vertical dominoes that fit in the partition shape of P and Q. The sign-imbalance of a partition shape is defined as the sum of the signs of all standard Young tableaux of that shape. As a further application of the sign-transferring formula above, we also prove a sharpening of another conjecture by Stanley concerning weighted sums of squares of sign-imbalances. Paper II: We generalise some of the results in paper I to skew tableaux. More precisely, we examine how the sign property is transferred by the skew Robinson-Schensted correspondence invented by Sagan and Stanley. The result is a surprisingly simple generalisation of the ordinary non-skew formula above. As an application, we find vanishing weighted sums of squares of sign-imbalances, thereby generalising a variant of Stanley’s second conjecture. Paper III: The following special case of a conjecture by Loehr and Warrington was proved by Ekhad, Vatter, and Zeilberger: There are 10^n zero-sum words of length 5n in the alphabet {+3,−2} such that no consecutive subword begins with +3, ends with −2, and sums to −2. We give a simple bijective proof of the conjecture in its original and more general setting where 3 and 2 are replaced by any relatively prime positive integers a and b, 10^n is replaced by ((a+b) choose a)^n, and 5n is replaced by (a+b)n. To do this we reformulate the problem in terms of cylindrical lattice walks which can be interpreted as the south-east border of certain partition shapes. Paper IV: We characterise the permutations pi such that the elements in the closed lower Bruhat interval [id,pi] of the symmetric group correspond to non-capturing rook configurations on a skew Ferrers board. These intervals turn out to be exactly those whose flag manifolds are defined by inclusions, as defined by Gasharov and Reiner. The characterisation connects Poincaré polynomials (rank-generating functions) of Bruhat intervals with q-rook polynomials, and we are able to compute the Poincaré polynomial of some particularly interesting intervals in the finite Weyl groups A_n and B_n. The expressions involve q-Stirling numbers of the second kind, and for the group A_n putting q = 1 yields the poly-Bernoulli numbers defined by Kaneko. / Ämnet för denna avhandling är enumerativ kombinatorik tillämpad på tre olika objekt med anknytning till partitionsformer, nämligen tablåer, begränsade ord och bruhatintervall. Dom viktigaste vetenskapliga bidragen är följande. Artikel I: Låt tecknet av en standardtablå vara tecknet hos permutationen man får om man läser tablån rad för rad från vänster till höger, som en bok. En förmodan av Richard Stanley säjer att teckensumman av alla standardtablåer med n rutor är 2^[n/2]. Vi visar en generalisering av denna förmodan med hjälp av Robinson-Schensted-korrespondensen och ett nytt begrepp som vi kallar schacktablåer. Beviset bygger på ett anmärkningsvärt enkelt samband mellan tecknet hos en permutation pi och tecknen hos dess RS-motsvarande tablåer P och Q, nämligen sgn(pi)=(-1)^v sgn(P)sgn(Q), där v är antalet disjunkta vertikala dominobrickor som får plats i partitionsformen hos P och Q. Teckenobalansen hos en partitionsform definieras som teckensumman av alla standardtablåer av den formen. Som en ytterligare tillämpning av formeln för teckenöverföring ovan bevisar vi också en starkare variant av en annan förmodan av Stanley som handlar om viktade summor av kvadrerade teckenobalanser. Artikel II: Vi generaliserar några av resultaten i artikel I till skeva tablåer. Närmare bestämt undersöker vi hur teckenegenskapen överförs av Sagan och Stanleys skeva Robinson-Schensted-korrespondens. Resultatet är en förvånansvärt enkel generalisering av den vanliga ickeskeva formeln ovan. Som en tillämpning visar vi att vissa viktade summor av kvadrerade teckenobalanser blir noll, vilket leder till en generalisering av en variant av Stanleys andra förmodan. Artikel III: Följande specialfall av en förmodan av Loehr och Warrington bevisades av Ekhad, Vatter och Zeilberger: Det finns 10^n ord med summan noll av längd 5n i alfabetet {+3,-2} sådana att inget sammanhängande delord börjar med +3, slutar med -2 och har summan -2. Vi ger ett enkelt bevis för denna förmodan i dess ursprungliga allmännare utförande där 3 och 2 byts ut mot vilka som helst relativt prima positiva heltal a och b, 10^n byts ut mot ((a+b) över a)^n och 5n mot (a+b)n. För att göra detta formulerar vi problemet i termer av cylindriska latticestigar som kan tolkas som den sydöstra gränslinjen för vissa partitionsformer. Artikel IV: Vi karakteriserar dom permutationer pi sådana att elementen i det slutna bruhatintervallet [id,pi] i symmetriska gruppen motsvarar ickeslående tornplaceringar på ett skevt ferrersbräde. Dessa intervall visar sej vara precis dom vars flaggmångfalder är definierade av inklusioner, ett begrepp introducerat av Gasharov och Reiner. Karakteriseringen skapar en länk mellan poincarépolynom (ranggenererande funktioner) för bruhatintervall och q-tornpolynom, och vi kan beräkna poincarépolynomet för några särskilt intressanta intervall i dom ändliga weylgrupperna A_n och B_n. Uttrycken innehåller q-stirlingtal av andra sorten, och sätter man q=1 för grupp A_n så får man Kanekos poly-bernoullital. / QC 20100818

En les últimes dècades, el fenomen de l’enantioselectivitat ha adquirit una importància creixent per a la indústria farmacèutica a l’hora del desenvolupament de nous fàrmacs. Això és degut a la observació d’una diferent resposta per part de l’organisme en funció de l’estereoquímica de la molècula exògena administrada, ocasionada per l’elevada estereoselectivitat dels processos fisiològics. Diferents exemples es poden trobar a la literatura a partir del desastre produït pel fàrmac anomenat talidomida, en què es va responsabilitzar la forma S de l’efecte teratogen mentre s’assignà l’acció sedant a la R. Molts altres fàrmacs quirals presenten una dicotomia d’efecte pels enantiòmers. A mode d’exemple l’anestèsic prolocaïna presenta diferències d’activitat entre enantiòmers. En aquest cas la forma de configuració S posseix majoritàriament l’acció anestèsica, mentre que la R és responsable dels efectes tòxics del fàrmac, que pot produir metahemoglobinèmia. Així, doncs, l’adiministració, i per tant la comercialització de fàrmacs enantiomèricmanet purs, simplifica aspectes farmacològics, farmacocinètics, terapèutics i toxicològics de l’acció dels fàrmacs. Altres avantatges que s’aconsegueixen amb aquest procedir són la disminució de la dosi de fàrmac requerida per a produir l’efecte desitjat i la menor variabilitat interpersonal de l’efecte produït per una determinada dosi. Degut a la importància de l’administració de fàrmacs enantiomèricament purs, en el present treball s’estudia l’aplicació de la cromatografia en contracorrent (CPC/CCC) en la separació de mescles racèmiques. La CCC/CPC és una variant de la cromatografia líquida, en la què la fase mòbil i la fase estacionària estan formades per dos líquids immiscibles entre sí. Així, s’han dissenyat i sintetitzat noves entitats quirals derivades de l’aminoàcid L-prolina. Una vegada caracteritzades, s’ha estudiat la seva aplicació en la separació de racèmics, a la vegada que s’ha estudiat el seu mecanisme d’enantioreconeixment per poder establir unes pautes a l’hora de dissenyar nous selectors quirals (SQ). D’altra banda, la CCC/CPC al tractar-se d’una tècnica que es dona entre dos líquids immiscibles. S’ha estudiat l’aplicació de nous sistemes de dissolvents menys contaminats, com es el cas de l’etoxinonafluorobutà. Així, s’han construït diferents sistemes de dissolvents que contenen el dissolvent fluorat, a l’hora que s’han utilitzat SQs fluorats. / Nowdays, the significance of the enantiomèric purity in the chiral active ingredients used in drug manufacture is well recognized. In addition, the strict regulations established by health authorities on the commercialisation of chiral drugs, has led to the requirement for analytical and preparative methods for enantioseparation. Although diverse procedures exist, chromatographic techniques are amongst the most used to resolve mixtures of enantiomers at a preparative level. In the present doctoral thesis we intend to study the enantioselectivity phenomena of L-proline derivatives as chiral selectors in countercurrent chromatography (CCC) using diferent solvent systems. CCC is an effective separation technique base don the differences in partitioning of solutes in a sample between two non-miscible solvents or solutions that constitute the solvent system. Therefore, the mobile and the stationary phases in the chromatographic process are liquids. The absence of a solid support opens a whole range of possibilities to apply alternative elution modes alternatives to the classic one. The exchange between mobile phase and stationary phase during the separation, that CCC only involves the change of a valve position, allows the dual and mutidual mode. Also, the application of ph-zone refining, a kind of displacement chromatography that involve the addition of a displacement agent in the mobile phase, has been evaluated in order to improve the separation of ionizable racemates. Finally, the evaluation of the enantioselectivite capacity of fluorinated solvents and chiral selectors has been tested in CCC and in liquid membranes.

Recent advances in pervasive computing and peer-to-peer computing have opened up vast opportunities for developing collaborative applications. To benefit from these emerging technologies, there is a need for investigating techniques and tools that will allow development and deployment of these applications on mobile and heterogeneous platforms. To meet these challenging tasks, we need to address the typical characteristics of mobile peer-to-peer systems such as frequent disconnections, frequent network partitions, and peer heterogeneity. This research focuses on developing the necessary models, techniques and algorithms that will enable us to build and deploy collaborative applications in the Internet enabled, mobile peer-to-peer environments. This dissertation proposes a multi-state transaction model and develops a quality aware transaction processing framework to incorporate quality of service with transaction processing. It proposes adaptive ACID properties and develops a quality specification language to associate a quality level with transactions. In addition, this research develops a probabilistic concurrency control mechanism and a group based transaction commit protocol for mobile peer-to-peer systems that greatly reduces blockings in transactions and improves the transaction commit ratio. To the best of our knowledge, this is the first attempt to systematically support disconnection-tolerant and partition-tolerant transaction processing. This dissertation also develops a scalable directory service called PeerDS to support the above framework. It addresses the scalability and dynamism of the directory service from two aspects: peer-to-peer and push-pull hybrid interfaces. It also addresses peer heterogeneity and develops a new technique for load balancing in the peer-to-peer system. This technique comprises an improved routing algorithm for virtualized P2P overlay networks and a generalized Top-K server selection algorithm for load balancing, which could be optimized based on multiple factors such as proximity and cost. The proposed push-pull hybrid interfaces greatly reduce the overhead of directory servers caused by frequent queries from directory clients. In order to further improve the scalability of the push interface, this dissertation also studies and evaluates different filter indexing schemes through which the interests of each update could be calculated very efficiently. This dissertation was developed in conjunction with the middleware called System on Mobile Devices (SyD).

There are many different types of non-alcoholic beverages (NAB) available in the United States today compared to a decade ago. Additionally, the needs of beverage consumers have evolved over the years centering attention on functionality and health dimensions. These trends in volume of consumption are a testament to the growth in the NAB industry. Our study pertains to ten NAB categories. We developed and employed a unique cross-sectional and time-series data set based on Nielsen Homescan data associated with household purchases of NAB from 1998 through 2003. First, we considered demographic and economic profiling of the consumption of NAB in a two-stage model. Race, region, age and presence of children and gender of household head were the most important factors affecting the choice and level of consumption. Second, we used expectation-prediction success tables, calibration, resolution, the Brier score and the Yates partition of the Brier score to measure the accuracy of predictions generated from qualitative choice models used to model the purchase decision of NAB by U.S. households. The Yates partition of the Brier score outperformed all other measures. Third, we modeled demand interrelationships, dynamics and habits of NAB consumption estimating own-price, cross-price and expenditure elasticities. The Quadratic Almost Ideal Demand System, the synthetic Barten model and the State Adjustment Model were used. Soft drinks were substitutes and fruit juices were complements for most of non-alcoholic beverages. Investigation of a proposed tax on sugar-sweetened beverages revealed the importance of centering attention not only to direct effects but also to indirect effects of taxes on beverage consumption. Finally, we investigated factors affecting nutritional contributions derived from consumption of NAB. Also, we ascertained the impact of the USDA year 2000 Dietary Guidelines for Americans associated with the consumption of NAB. Significant factors affecting caloric and nutrient intake from NAB were price, employment status of household head, region, race, presence of children and the gender of household food manager. Furthermore, we found that USDA nutrition intervention program was successful in reducing caloric and caffeine intake from consumption of NAB. The away-from-home intake of beverages and potential impacts of NAB advertising are not captured in our work. In future work, we plan to address these limitations.

Recent advances in VLSI technology, and wireless communication have enabled the development of tiny, low-cost sensor nodes that communicate over short distances. These sensor nodes, which consist of sensing, data processing, and wireless communication capabilities, suggest the idea of sensor networks based on collaborative effort of a large number of sensor nodes. Sensor networks hold the promise for numerous applications such as intrusion detection, weather monitoring, security and tactical surveillance, distributed computing, and disaster management. Several new protocols and algorithms have been proposed in the recent past in order to realize these applications. In this thesis, we consider the problem of routing in Wireless Sensor Networks (WSNs). Routing is a challenging problem in WSNs due to the inherent characteristics which distinguish these networks from the others. Several routing algorithms have been proposed for WSNs, each considering a specific network performance objective such as long network lifetime (ChangandTassiulas,2004), end-to-end delay guarantees (T.Heetal,2003), and data fusion (RazvanCristescuetal,2005) etc. In this thesis, we utilize the Potential-based Routing Paradigm to develop routing algorithms for different performance objectives of interest in WSNs. The basic idea behind the proposed approach is to assign a scalar called the potential to every sensor node in the network. Data is then forwarded to the neighbor with highest potential. Potentials cause the data to flow along certain paths. By defining potential fields appropriately, one can cause data to flow along preferred paths, so that the given performance objective is achieved. We have demonstrated the usefulness of this approach by considering three performance objectives, and defining potentials appropriately in each case. The performance objectives that we have considered are (i) maximizing the time to network partition, (ii) maximizing the packet delivery ratio, and (iii) Data fusion. In an operational sensor network, sensor nodes’ energy levels gradually deplete, leading eventually to network partition. A natural objective is to route packets in such a way that the time to network partition is maximized. We have developed a potential function for this objective. We analyzed simple network cases and used the insight to develop a potential function applicable to any network. Simulation results showed that considerable improvements in time to network partition can be obtained compared to popular approaches such as maximum lifetime routing, and shortest hop count routing. In the next step, we designed a potential function that leads to routes with high packet delivery ratios. We proposed a “channel-state aware” potential definition for a simple 2-relay network and performed a Markov-chain based analysis to obtain the packet delivery ratio. Considerable improvement was observed compared to a channel-state-oblivious policy. This motivated us to define a channel-state-dependent potential function for a general network. Simulation results showed that for a relatively slowly changing wireless network, our approach can provide up to 20% better performance than the commonly-used shortest-hop-count routing. Finally, we considered the problem of correlated data gathering in sensor networks. The routing approach followed in literature is to construct a spanning tree rooted at the sink. Every node in the tree aggregates its data with the data from its children in order to reduce the number of transmitted bits. Due to this fact, the total energy cost of the data collection task is a function of the underlying tree structure. Noting that potential based routing schemes also result in a tree structure, we present a potential definition that results in the minimum energy cost tree under some special conditions. Specifically, we consider a scenario in which sensor nodes’ measurements are quantized to K values. The task at the sink is to construct a histogram of measurements of all sensor nodes. Sensor nodes do not directly send their measurements to sink. Instead, they construct a temporary histogram using the data from its children and forward it to its parent node in the tree. We present a potential definition that results in the minimum energy cost tree under some conditions on sensor nodes’ measurements. We include both the transmission energy cost as well as the energy cost associated with the aggregation process.

Die folgende Arbeit befasst sich mit der Alltagstauglichkeit moderner Massendatenverarbeitung, insbesondere mit dem Problem der Assoziationsregelanalyse. Vorhandene Datenmengen wachsen stark an, aber deren Auswertung ist für ungeübte Anwender schwierig. Daher verzichten Unternehmen auf Informationen, welche prinzipiell vorhanden sind. Assoziationsregeln zeigen in diesen Daten Abhängigkeiten zwischen den Elementen eines Datenbestandes, beispielsweise zwischen verkauften Produkten. Diese Regeln können mit Interessantheitsmaßen versehen werden, welche dem Anwender das Erkennen wichtiger Zusammenhänge ermöglichen. Es werden Ansätze gezeigt, dem Nutzer die Auswertung der Daten zu erleichtern. Das betrifft sowohl die robuste Arbeitsweise der Verfahren als auch die einfache Auswertung der Regeln. Die vorgestellten Algorithmen passen sich dabei an die zu verarbeitenden Daten an, was sie von anderen Verfahren unterscheidet. Assoziationsregelsuchen benötigen die Extraktion häufiger Kombinationen (EHK). Hierfür werden Möglichkeiten gezeigt, Lösungsansätze auf die Eigenschaften moderne System anzupassen. Als Ansatz werden Verfahren zur Berechnung der häufigsten $N$ Kombinationen erläutert, welche anders als bekannte Ansätze leicht konfigurierbar sind. Moderne Systeme rechnen zudem oft verteilt. Diese Rechnerverbünde können große Datenmengen parallel verarbeiten, benötigen jedoch die Vereinigung lokaler Ergebnisse. Für verteilte Top-N-EHK auf realistischen Partitionierungen werden hierfür Ansätze mit verschiedenen Eigenschaften präsentiert. Aus den häufigen Kombinationen werden Assoziationsregeln gebildet, deren Aufbereitung ebenfalls einfach durchführbar sein soll. In der Literatur wurden viele Maße vorgestellt. Je nach den Anforderungen entsprechen sie je einer subjektiven Bewertung, allerdings nicht zwingend der des Anwenders. Hierfür wird untersucht, wie mehrere Interessantheitsmaßen zu einem globalen Maß vereinigt werden können. Dies findet Regeln, welche mehrfach wichtig erschienen. Der Nutzer kann mit den Vorschlägen sein Suchziel eingrenzen. Ein zweiter Ansatz gruppiert Regeln. Dies erfolgt über die Häufigkeiten der Regelelemente, welche die Grundlage von Interessantheitsmaßen bilden. Die Regeln einer solchen Gruppe sind daher bezüglich vieler Interessantheitsmaßen ähnlich und können gemeinsam ausgewertet werden. Dies reduziert den manuellen Aufwand des Nutzers. Diese Arbeit zeigt Möglichkeiten, Assoziationsregelsuchen auf einen breiten Benutzerkreis zu erweitern und neue Anwender zu erreichen. Die Assoziationsregelsuche wird dabei derart vereinfacht, dass sie statt als Spezialanwendung als leicht nutzbares Werkzeug zur Datenanalyse verwendet werden kann. / The importance of data mining is widely acknowledged today. Mining for association rules and frequent patterns is a central activity in data mining. Three main strategies are available for such mining: APRIORI , FP-tree-based approaches like FP-GROWTH, and algorithms based on vertical data structures and depth-first mining strategies like ECLAT and CHARM. Unfortunately, most of these algorithms are only moderately suitable for many “real-world” scenarios because their usability and the special characteristics of the data are two aspects of practical association rule mining that require further work. All mining strategies for frequent patterns use a parameter called minimum support to define a minimum occurrence frequency for searched patterns. This parameter cuts down the number of patterns searched to improve the relevance of the results. In complex business scenarios, it can be difficult and expensive to define a suitable value for the minimum support because it depends strongly on the particular datasets. Users are often unable to set this parameter for unknown datasets, and unsuitable minimum-support values can extract millions of frequent patterns and generate enormous runtimes. For this reason, it is not feasible to permit ad-hoc data mining by unskilled users. Such users do not have the knowledge and time to define suitable parameters by trial-and-error procedures. Discussions with users of SAP software have revealed great interest in the results of association-rule mining techniques, but most of these users are unable or unwilling to set very technical parameters. Given such user constraints, several studies have addressed the problem of replacing the minimum-support parameter with more intuitive top-n strategies. We have developed an adaptive mining algorithm to give untrained SAP users a tool to analyze their data easily without the need for elaborate data preparation and parameter determination. Previously implemented approaches of distributed frequent-pattern mining were expensive and time-consuming tasks for specialists. In contrast, we propose a method to accelerate and simplify the mining process by using top-n strategies and relaxing some requirements on the results, such as completeness. Unlike such data approximation techniques as sampling, our algorithm always returns exact frequency counts. The only drawback is that the result set may fail to include some of the patterns up to a specific frequency threshold. Another aspect of real-world datasets is the fact that they are often partitioned for shared-nothing architectures, following business-specific parameters like location, fiscal year, or branch office. Users may also want to conduct mining operations spanning data from different partners, even if the local data from the respective partners cannot be integrated at a single location for data security reasons or due to their large volume. Almost every data mining solution is constrained by the need to hide complexity. As far as possible, the solution should offer a simple user interface that hides technical aspects like data distribution and data preparation. Given that BW Accelerator users have such simplicity and distribution requirements, we have developed an adaptive mining algorithm to give unskilled users a tool to analyze their data easily, without the need for complex data preparation or consolidation. For example, Business Intelligence scenarios often partition large data volumes by fiscal year to enable efficient optimizations for the data used in actual workloads. For most mining queries, more than one data partition is of interest, and therefore, distribution handling that leaves the data unaffected is necessary. The algorithms presented in this paper have been developed to work with data stored in SAP BW. A salient feature of SAP BW Accelerator is that it is implemented as a distributed landscape that sits on top of a large number of shared-nothing blade servers. Its main task is to execute OLAP queries that require fast aggregation of many millions of rows of data. Therefore, the distribution of data over the dedicated storage is optimized for such workloads. Data mining scenarios use the same data from storage, but reporting takes precedence over data mining, and hence, the data cannot be redistributed without massive costs. Distribution by special data semantics or user-defined selections can produce many partitions and very different partition sizes. The handling of such real-world distributions for frequent-pattern mining is an important task, but it conflicts with the requirement of balanced partition.