From caging to rouse dynamics in polymer melts with intramolecular barriers: a critical test of the mode coupling theory

By means of computer simulations and solution of the equations of the mode coupling theory (MCT),we investigate the role of the intramolecular barriers on several dynamic aspects of nonentangled polymers. The investigated dynamic range extends from the caging regime characteristic of glass-formers to the relaxation of the chain Rouse modes. We review our recent work on this question,provide new results, and critically discuss the limitations of the theory. Solutions of the MCT for the structural relaxation reproduce qualitative trends of simulations for weak and moderate barriers. However, a progressive discrepancy is revealed as the limit of stiff chains is approached. This dis-agreement does not seem related with dynamic heterogeneities, which indeed are not enhanced by increasing barrier strength. It is not connected either with the breakdown of the convolution approximation for three-point static correlations, which retains its validity for stiff chains. These findings suggest the need of an improvement of the MCT equations for polymer melts. Concerning the relaxation of the chain degrees of freedom, MCT provides a microscopic basis for time scales from chain reorientation down to the caging regime. It rationalizes, from first principles, the observed deviations from the Rouse model on increasing the barrier strength. These include anomalous scaling of relaxation times, long-time plateaux, and nonmonotonous wavelength dependence of the mode correlators.

Early Iron Age Pottery: A Quantitative Approach. Proceedings of the International Round Table organized by the Swiss School of Archaeology in Greece (Athens, Novembre 28-30, 2008).

Quantitative approaches in ceramology are gaining ground in excavation reports, archaeological publications and thematic studies. Hence, a wide variety of methods are being used depending on the researchers' theoretical premise, the type of material which is examined, the context of discovery and the questions that are addressed. The round table that took place in Athens on November 2008 was intended to offer the participants the opportunity to present a selection of case studies on the basis of which methodological approaches were discussed. The aim was to define a set of guidelines for quantification that would prove to be of use to all researchers. Contents: 1) Introduction (Samuel Verdan); 2) Isthmia and beyond. How can quantification help the analysis of EIA sanctuary deposits? (Catherine Morgan); 3) Approaching aspects of cult practice and ethnicity in Early Iron Age Ephesos using quantitative analysis of a Protogeometric deposit from the Artemision (Michael Kerschner); 4) Development of a ceramic cultic assemblage: Analyzing pottery from Late Helladic IIIC through Late Geometric Kalapodi (Ivonne Kaiser, Laura-Concetta Rizzotto, Sara Strack); 5) 'Erfahrungsbericht' of application of different quantitative methods at Kalapodi (Sara Strack); 6) The Early Iron Age sanctuary at Olympia: counting sherds from the Pelopion excavations (1987-1996) (Birgitta Eder); 7) L'aire du pilier des Rhodiens à Delphes: Essai de quantification du mobilier (Jean-Marc Luce); 8) A new approach in ceramic statistical analyses: Pit 13 on Xeropolis at Lefkandi (David A. Mitchell, Irene S. Lemos); 9) Households and workshops at Early Iron Age Oropos: A quantitative approach of the fine, wheel-made pottery (Vicky Vlachou); 10) Counting sherds at Sindos: Pottery consumption and construction of identities in the Iron Age (Stefanos Gimatzidis); 11) Analyse quantitative du mobilier céramique des fouilles de Xombourgo à Ténos et le cas des supports de caisson (Jean-Sébastien Gros); 12) Defining a typology of pottery from Gortyn: The material from a pottery workshop pit, (Emanuela Santaniello); 13) Quantification of ceramics from Early Iron Age tombs (Antonis Kotsonas); 14) Quantitative analysis of the pottery from the Early Iron Age necropolis of Tsikalario on Naxos (Xenia Charalambidou); 15) Finding the Early Iron Age in field survey: Two case studies from Boeotia and Magnesia (Vladimir Stissi); 16) Pottery quantification: Some guidelines (Samuel Verdan).

Practical algorithms for a family of waterfilling solutions

Many engineering problems that can be formulatedas constrained optimization problems result in solutionsgiven by a waterfilling structure; the classical example is thecapacity-achieving solution for a frequency-selective channel.For simple waterfilling solutions with a single waterlevel and asingle constraint (typically, a power constraint), some algorithmshave been proposed in the literature to compute the solutionsnumerically. However, some other optimization problems result insignificantly more complicated waterfilling solutions that includemultiple waterlevels and multiple constraints. For such cases, itmay still be possible to obtain practical algorithms to evaluate thesolutions numerically but only after a painstaking inspection ofthe specific waterfilling structure. In addition, a unified view ofthe different types of waterfilling solutions and the correspondingpractical algorithms is missing.The purpose of this paper is twofold. On the one hand, itoverviews the waterfilling results existing in the literature from aunified viewpoint. On the other hand, it bridges the gap betweena wide family of waterfilling solutions and their efficient implementationin practice; to be more precise, it provides a practicalalgorithm to evaluate numerically a general waterfilling solution,which includes the currently existing waterfilling solutions andothers that may possibly appear in future problems.

Extreme-value distributions and renormalization group

In the classical theorems of extreme value theory the limits of suitably rescaled maxima of sequences of independent, identically distributed random variables are studied. The vast majority of the literature on the subject deals with affine normalization. We argue that more general normalizations are natural from a mathematical and physical point of view and work them out. The problem is approached using the language of renormalization-group transformations in the space of probability densities. The limit distributions are fixed points of the transformation and the study of its differential around them allows a local analysis of the domains of attraction and the computation of finite-size corrections.

Assignment markets with the same core

[spa] En el contexto de los juegos de asignación bilaterales, estudiamos el conjunto de matrices asociadas a mercados de asignación con el mismo nucleo. Se proporcionan condiciones sobre las entradas de la matriz que aseguran que los juegos de asignación asociados tienen el mismo núcleo. Se prueba que este conjunto de matrices que dan lugar al mismo núcleo forman un semirretículo con un número finito de elementos minimales y un único máximo. Se da una caracterización de estos elementos minimales. También se proporciona una condición suficiente para obtener un retículo.

Multi-sided Böhm-Bawerk assignment markets: the core

[cat] En aquest treball introduïm la classe de "multi-sided Böhm-Bawerk assignment games", que generalitza la coneguda classe de jocs d’assignació de Böhm-Bawerk bilaterals a situacions amb un nombre arbitrari de sectors. Trobem els extrems del core de qualsevol multi-sided Böhm-Bawerk assignment game a partir d’un joc convex definit en el conjunt de sectors enlloc del conjunt de venedors i compradors. Addicionalment estudiem quan el core d’aquests jocs d’assignació és estable en el sentit de von Neumann-Morgenstern.

Consistency and the core of multi-sided assignment markets

[cat] En aquest treball es demostra que en el domini dels jocs d’assignació equilibrats multisectorials (Quint, 1991), el core és l’única solució no buida que satisfà derived consistency i projection consistency. També es caracteritza el core en tota la classe dels jocs d’assignació multisectorials amb els axiomes de singleness best, individual antimonotonicity i derived consistency. Com a casos particulars, s’obtenen dues noves axiomàtiques del core per als jocs d’assignació bilaterals (Shapley and Shubik, 1972).

From caging to rouse dynamics in polymer melts with intramolecular barriers: a critical test of the mode coupling theory

By means of computer simulations and solution of the equations of the mode coupling theory (MCT),we investigate the role of the intramolecular barriers on several dynamic aspects of nonentangled polymers. The investigated dynamic range extends from the caging regime characteristic of glass-formers to the relaxation of the chain Rouse modes. We review our recent work on this question,provide new results, and critically discuss the limitations of the theory. Solutions of the MCT for the structural relaxation reproduce qualitative trends of simulations for weak and moderate barriers. However, a progressive discrepancy is revealed as the limit of stiff chains is approached. This dis-agreement does not seem related with dynamic heterogeneities, which indeed are not enhanced by increasing barrier strength. It is not connected either with the breakdown of the convolution approximation for three-point static correlations, which retains its validity for stiff chains. These findings suggest the need of an improvement of the MCT equations for polymer melts. Concerning the relaxation of the chain degrees of freedom, MCT provides a microscopic basis for time scales from chain reorientation down to the caging regime. It rationalizes, from first principles, the observed deviations from the Rouse model on increasing the barrier strength. These include anomalous scaling of relaxation times, long-time plateaux, and nonmonotonous wavelength dependence of the mode correlators.

Assignment markets with the same core

[spa] En el contexto de los juegos de asignación bilaterales, estudiamos el conjunto de matrices asociadas a mercados de asignación con el mismo nucleo. Se proporcionan condiciones sobre las entradas de la matriz que aseguran que los juegos de asignación asociados tienen el mismo núcleo. Se prueba que este conjunto de matrices que dan lugar al mismo núcleo forman un semirretículo con un número finito de elementos minimales y un único máximo. Se da una caracterización de estos elementos minimales. También se proporciona una condición suficiente para obtener un retículo.

Multi-sided Böhm-Bawerk assignment markets: the core

[cat] En aquest treball introduïm la classe de "multi-sided Böhm-Bawerk assignment games", que generalitza la coneguda classe de jocs d’assignació de Böhm-Bawerk bilaterals a situacions amb un nombre arbitrari de sectors. Trobem els extrems del core de qualsevol multi-sided Böhm-Bawerk assignment game a partir d’un joc convex definit en el conjunt de sectors enlloc del conjunt de venedors i compradors. Addicionalment estudiem quan el core d’aquests jocs d’assignació és estable en el sentit de von Neumann-Morgenstern.

Consistency and the core of multi-sided assignment markets

[cat] En aquest treball es demostra que en el domini dels jocs d’assignació equilibrats multisectorials (Quint, 1991), el core és l’única solució no buida que satisfà derived consistency i projection consistency. També es caracteritza el core en tota la classe dels jocs d’assignació multisectorials amb els axiomes de singleness best, individual antimonotonicity i derived consistency. Com a casos particulars, s’obtenen dues noves axiomàtiques del core per als jocs d’assignació bilaterals (Shapley and Shubik, 1972).

The proportional distribution in a cooperative model with external opportunities

[cat] En aquest article es considera un problema de cooperació entre agents on cada agent realitza una contribució (diners, capital, treball, esforç) per tal d'obtenir un benefici comú a repartir. El repartiment proporcional respecte a les contribucions és una distribució que pertany al nucli del joc cooperatiu associat. A partir d'aquest model bàsic s'introdueix un agent extern que pot realitzar una determinada aportació que serveix per avaluar el potencial benefici de cada subcoalició d'agents si aquest nou agent finalment entrés. Aquesta anàlisi pot produir que el poder relatiu dels agents hagi variat. en concret s'avalua si la distribució proporcional és encara robusta des del punt de vista de la seva pertinença al conjunt de negociació. Amb aquest objectiu, analitzem el problema utilitzant el model de joc cooperatius amb estructura de coalició. Donat que, en general, la distribució proporcional, no pertany al conjunt de negociació, s'estudia una condició suficient per a que així sigui. També enunciem una condició necessària, i finalment es proposa una condició suficient que garanteix que el repartiment proporcional és la única distribució existent dins del conjunt de negociació.

The proportional distribution in a cooperative model with external opportunities

[cat] En aquest article es considera un problema de cooperació entre agents on cada agent realitza una contribució (diners, capital, treball, esforç) per tal d'obtenir un benefici comú a repartir. El repartiment proporcional respecte a les contribucions és una distribució que pertany al nucli del joc cooperatiu associat. A partir d'aquest model bàsic s'introdueix un agent extern que pot realitzar una determinada aportació que serveix per avaluar el potencial benefici de cada subcoalició d'agents si aquest nou agent finalment entrés. Aquesta anàlisi pot produir que el poder relatiu dels agents hagi variat. en concret s'avalua si la distribució proporcional és encara robusta des del punt de vista de la seva pertinença al conjunt de negociació. Amb aquest objectiu, analitzem el problema utilitzant el model de joc cooperatius amb estructura de coalició. Donat que, en general, la distribució proporcional, no pertany al conjunt de negociació, s'estudia una condició suficient per a que així sigui. També enunciem una condició necessària, i finalment es proposa una condició suficient que garanteix que el repartiment proporcional és la única distribució existent dins del conjunt de negociació.

New kernel functions and learning methods for text and data mining

Recent advances in machine learning methods enable increasingly the automatic construction of various types of computer assisted methods that have been difficult or laborious to program by human experts. The tasks for which this kind of tools are needed arise in many areas, here especially in the fields of bioinformatics and natural language processing. The machine learning methods may not work satisfactorily if they are not appropriately tailored to the task in question. However, their learning performance can often be improved by taking advantage of deeper insight of the application domain or the learning problem at hand. This thesis considers developing kernel-based learning algorithms incorporating this kind of prior knowledge of the task in question in an advantageous way. Moreover, computationally efficient algorithms for training the learning machines for specific tasks are presented. In the context of kernel-based learning methods, the incorporation of prior knowledge is often done by designing appropriate kernel functions. Another well-known way is to develop cost functions that fit to the task under consideration. For disambiguation tasks in natural language, we develop kernel functions that take account of the positional information and the mutual similarities of words. It is shown that the use of this information significantly improves the disambiguation performance of the learning machine. Further, we design a new cost function that is better suitable for the task of information retrieval and for more general ranking problems than the cost functions designed for regression and classification. We also consider other applications of the kernel-based learning algorithms such as text categorization, and pattern recognition in differential display. We develop computationally efficient algorithms for training the considered learning machines with the proposed kernel functions. We also design a fast cross-validation algorithm for regularized least-squares type of learning algorithm. Further, an efficient version of the regularized least-squares algorithm that can be used together with the new cost function for preference learning and ranking tasks is proposed. In summary, we demonstrate that the incorporation of prior knowledge is possible and beneficial, and novel advanced kernels and cost functions can be used in algorithms efficiently.

Kuljetuslajin yhteys kannattavuuteen etelä- ja itäsuomalaisissa kuljetusyrityksissä

Tämä Pro-Gradu –tutkielma tarkastelee etelä- ja itäsuomalaisia kuljetusyrityksiä kannattavuuden, vakavaraisuuden ja maksuvalmiuden näkökulmasta kuljetuslajeittain. Tutkielman pyrkimyksenä on valottaa Etelä- ja Itä-Suomen läänien kilpailuympäristöä numeeristen tunnuslukujen ja tilinpäätöserien perusteella. Päätavoitteena on osoittaa, onko kuljetuslajien välillä kannattavuuseroja. Tutkielma koostuu teoriaosasta sekä empiirisestä osasta, jonka aineisto koostuu etelä- ja itäsuomalaisten kuljetusyritysten tilinpäätöstiedoista ja tunnusluvuista. Tutkimuksen empiirinen aineisto on kerätty haulla Amadeus–tietokannasta ja postikyselynä haun tuottamilta yrityksiltä. Aineistoa on analysoitu kvantitatiivisilla menetelmillä SPSS–ohjelmistolla. Tuloksista selviää, että kuljetuslajilla on yhteys kannattavuuteen ROCE–tunnusluvulla mitattuna. Kannattavuuden osa-alueita, kuten tuottoja, kustannuksia ja sidottua pääomaa analysoitiin erikseen, mutta kannattavuuseroille ei silti löydetty selitystä.