Debt enforcement and relational contracting

We examine how third-party debt enforcement affects the emergence and performance ofrelational contracts in credit markets. We implement an experiment with finitely repeatedcredit relationships in which borrowers can default. In the weak enforcement treatmentdefaulting borrowers can keep their funds invested. In the strong enforcement treatmentdefaulting borrowers have to liquidate their investment. Under weak enforcement fewerrelationships emerge in which loans are extended and repaid. When such relationships doemerge they exhibit a lower credit volume than under strong enforcement. These findingssuggest that relational contracting in credit markets requires a minimum standard of thirdpartydebt enforcement.

Disseny d'itineraris d'educació ambiental en ambients de fons de vall

L’anàlisi de l’estat actual dels equipaments i activitats d’educació ambiental (EA) en l’àmbit del Parc Natural de l’Alt Pirineu (PNAP) ha detectat un grau de desenvolupament molt baix d’aquesta disciplina. Per aquest motiu, s’elabora una nova eina, amb l’objectiu d’establir unes pautes per a l’elaboració d’una activitat d’EA concreta: els itineraris d’EA; i així ampliar l’escassa oferta actual. El protocol per al disseny d’itineraris d’EA, dóna unes directrius per a estandarditzar la descripció i l’anàlisi de la zona proposada. La finalitat del qual és facilitar i agilitar la implantació d’itineraris que presentin unes condicions mínimes establertes. La eficiència d’aquesta eina, queda verificada amb els resultats obtinguts en la realització de dues proves pilot en dues zones amb possibilitats de desenvolupar-hi itineraris d’EA. Una de les zones ha quedat descartada, per l’incompliment d’un dels criteris que s’ha definit en el protocol com a imprescindibles pel bon desenvolupament de l’activitat que es planteja. Mentre que en l’altre zona, el compliment de totes aquestes condicions o criteris, fan viable la implantació de l’itinerari d’EA, duent a terme així el seu posterior disseny. Malgrat l’estudi es centri en un espai natural protegit concret, és una eina que pretén ser extrapolable en d’altres espais d’aquesta categoria.

Memòria de recerca: paral·lelització dels diccionaris de la Standard Template Library de C++

Estudi elaborat a partir d’una estada a la Universität Karlsruhe entre gener i maig del 2007. Les biblioteques d’estructures de dades defineixen interfícies i implementen algorismes i estructures de dades fonamentals. Un exemple n’és la Satandard Template Library (STL ), que forma part del llenguatge de programació C++. En el marc d’una tesi, s’està treballant per obtenir implementacions més eficients i/o versàtils d’alguns components de la STL. Per a fer-ho s’utilitzen tècniques de la enginyeria d’algorismes. En particular, s’integra el coneixement de la comunitat algorítmica i es té en consideració la tecnologia existent. L’acció durant l’estada s’ha emmarcat en el desenvolupament la Multi Core STL (MCSTL ). La MCSTL és una implementació paral•lela de la STL per a màquines multi-core. Les màquines multi-core són actualment l’únic tipus de màquina disponible al mercat. Per tant, tot i que el paral•lelisme obtingut no sigui òptim, és preferible a tenir els processadors esperant, ja que , la tendència és que el nombre de processadors per computador augmenti.

Pathology and immune response of the blue mussel (Mytilus edulis L.) after an exposure to the harmful dinoflagellate Prorocentrum minimum

The harmful dinoflagellate Prorocentrum minimum has different effects upon various species of grazing bivalves, and these effects also vary with life-history stage. Possible effects of this dinoflagellate upon mussels have not been reported; therefore, experiments exposing adult blue mussels, Mytilus edulis, to P. minimum were conducted. Mussels were exposed to cultures of toxic P. minimum or benign Rhodomonas sp. in glass aquaria. After a short period of acclimation, samples were collected on day 0 (before the exposure) and after 3, 6, and 9 days of continuous-exposure experiment. Hemolymph was extracted for flow-cytometric analyses of hemocyte, immune-response functions, and soft tissues were excised for histopathology. Mussels responded to P. minimum exposure with diapedesis of hemocytes into the intestine, presumably to isolate P. minimum cells within the gut, thereby minimizing damage to other tissues. This immune response appeared to have been sustained throughout the 9-day exposure period, as circulating hemocytes retained hematological and functional properties. Bacteria proliferated in the intestines of the P. minimum-exposed mussels. Hemocytes within the intestine appeared to be either overwhelmed by the large number of bacteria or fully occupied in the encapsulating response to P. minimum cells; when hemocytes reached the intestine lumina, they underwent apoptosis and bacterial degradation. This experiment demonstrated that M. edulis is affected by ingestion of toxic P. minimum; however, the specific responses observed in the blue mussel differed from those reported for other bivalve species. This finding highlights the need to study effects of HABs on different bivalve species, rather than inferring that results from one species reflect the exposure responses of all bivalves.

Desconnexió de la xarxa

Treball de recerca realitzat per un alumne d'ensenyament secundari i guardonat amb un Premi CIRIT per fomentar l'esperit cientí­fic del Jovent l'any 2009. Aquest treball es planteja com un repte la necessitat de connexió a una xarxa de subministrament elèctric i d'aigua. L'objectiu del treball ha estat comprovar si, tan tècnicament com econòmica, es pot aconseguir l'autosuficiència d'una casa de muntanya del Vallès Oriental tot aprofitant els recursos que ens ofereix el medi, però sense haver de renunciar al nivell de vida al qual ens hem acostumat durant els darrers anys. Després d'una recollida de dades i valoració del consum energètic mínim que volem imposar, hem dissenyat una instal·lació capaç d'aprofitar les energies renovables de l'entorn i de satisfer les nostres necessitats. La instal·lació inclou plaques fotovoltaiques, col·lectors solars, cisternes per a la recollida d'aigua, bombes, etc. Finalment, s'inclou un pressupost d'aquesta instal·lació, que indica que els diners que caldria invertir són massa. Es demostra, doncs, que l'autosuficiència d'aquesta casa és tècnicament viable, però econòmicament inviable (o gens rendible).

Application of standard and refined heat balance integral methods to one-dimensional Stefan problems

The work in this paper concerns the study of conventional and refined heat balance integral methods for a number of phase change problems. These include standard test problems, both with one and two phase changes, which have exact solutions to enable us to test the accuracy of the approximate solutions. We also consider situations where no analytical solution is available and compare these to numerical solutions. It is popular to use a quadratic profile as an approximation of the temperature, but we show that a cubic profile, seldom considered in the literature, is far more accurate in most circumstances. In addition, the refined integral method can give greater improvement still and we develop a variation on this method which turns out to be optimal in some cases. We assess which integral method is better for various problems, showing that it is largely dependent on the specified boundary conditions.

How to use the standard model with own data?

In this work discuss the use of the standard model for the calculation of the solvency capital requirement (SCR) when the company aims to use the specific parameters of the model on the basis of the experience of its portfolio. In particular, this analysis focuses on the formula presented in the latest quantitative impact study (2010 CEIOPS) for non-life underwriting premium and reserve risk. One of the keys of the standard model for premium and reserves risk is the correlation matrix between lines of business. In this work we present how the correlation matrix between lines of business could be estimated from a quantitative perspective, as well as the possibility of using a credibility model for the estimation of the matrix of correlation between lines of business that merge qualitative and quantitative perspective.

A Proportional Approach to Bankruptcy Problems with a guaranteed minimum

In a distribution problem, and specfii cally in bankruptcy issues, the Proportional (P) and the Egalitarian (EA) divisions are two of the most popular ways to resolve the conflict. The Constrained Equal Awards rule (CEA) is introduced in bankruptcy literature to ensure that no agent receives more than her claim, a problem that can arise when using the egalitarian division. We propose an alternative modi cation, by using a convex combination of P and EA. The recursive application of this new rule finishes at the CEA rule. Our solution concept ensures a minimum amount to each agent, and distributes the remaining estate in a proportional way. Keywords: Bankruptcy problems, Proportional rule, Equal Awards, Convex combination of rules, Lorenz dominance. JEL classi fication: C71, D63, D71.

Enhancing fault management performance of two-step QoS routing algorithms in GMPLS networks

In this paper a novel methodology aimed at minimizing the probability of network failure and the failure impact (in terms of QoS degradation) while optimizing the resource consumption is introduced. A detailed study of MPLS recovery techniques and their GMPLS extensions are also presented. In this scenario, some features for reducing the failure impact and offering minimum failure probabilities at the same time are also analyzed. Novel two-step routing algorithms using this methodology are proposed. Results show that these methods offer high protection levels with optimal resource consumption

Minimum interference routing with fast protection

One of the most effective techniques offering QoS routing is minimum interference routing. However, it is complex in terms of computation time and is not oriented toward improving the network protection level. In order to include better levels of protection, new minimum interference routing algorithms are necessary. Minimizing the failure recovery time is also a complex process involving different failure recovery phases. Some of these phases depend completely on correct routing selection, such as minimizing the failure notification time. The level of protection also involves other aspects, such as the amount of resources used. In this case shared backup techniques should be considered. Therefore, minimum interference techniques should also be modified in order to include sharing resources for protection in their objectives. These aspects are reviewed and analyzed in this article, and a new proposal combining minimum interference with fast protection using shared segment backups is introduced. Results show that our proposed method improves both minimization of the request rejection ratio and the percentage of bandwidth allocated to backup paths in networks with low and medium protection requirements

Admission Control for TCP Flows Using Packet Classes and Edge-to-edge Measurements of Aggregates

TCP flows from applications such as the web or ftp are well supported by a Guaranteed Minimum Throughput Service (GMTS), which provides a minimum network throughput to the flow and, if possible, an extra throughput. We propose a scheme for a GMTS using Admission Control (AC) that is able to provide different minimum throughput to different users and that is suitable for "standard" TCP flows. Moreover, we consider a multidomain scenario where the scheme is used in one of the domains, and we propose some mechanisms for the interconnection with neighbor domains. The whole scheme uses a small set of packet classes in a core-stateless network where each class has a different discarding priority in queues assigned to it. The AC method involves only edge nodes and uses a special probing packet flow (marked as the highest discarding priority class) that is sent continuously from ingress to egress through a path. The available throughput in the path is obtained at the egress using measurements of flow aggregates, and then it is sent back to the ingress. At the ingress each flow is detected using an implicit way and then it is admission controlled. If it is accepted, it receives the GMTS and its packets are marked as the lowest discarding priority classes; otherwise, it receives a best-effort service. The scheme is evaluated through simulation in a simple "bottleneck" topology using different traffic loads consisting of "standard" TCP flows that carry files of varying sizes

On optimal computation of MPLS label binding for multipoint-to-point connections

Most network operators have considered reducing Label Switched Routers (LSR) label spaces (i.e. the number of labels that can be used) as a means of simplifying management of underlaying Virtual Private Networks (VPNs) and, hence, reducing operational expenditure (OPEX). This letter discusses the problem of reducing the label spaces in Multiprotocol Label Switched (MPLS) networks using label merging - better known as MultiPoint-to-Point (MP2P) connections. Because of its origins in IP, MP2P connections have been considered to have tree- shapes with Label Switched Paths (LSP) as branches. Due to this fact, previous works by many authors affirm that the problem of minimizing the label space using MP2P in MPLS - the Merging Problem - cannot be solved optimally with a polynomial algorithm (NP-complete), since it involves a hard- decision problem. However, in this letter, the Merging Problem is analyzed, from the perspective of MPLS, and it is deduced that tree-shapes in MP2P connections are irrelevant. By overriding this tree-shape consideration, it is possible to perform label merging in polynomial time. Based on how MPLS signaling works, this letter proposes an algorithm to compute the minimum number of labels using label merging: the Full Label Merging algorithm. As conclusion, we reclassify the Merging Problem as Polynomial-solvable, instead of NP-complete. In addition, simulation experiments confirm that without the tree-branch selection problem, more labels can be reduced

All-Optical Label Stacking: Easing the Trade-offs Between Routing and Architecture Cost in All-Optical Packet Switching

All-optical label swapping (AOLS) forms a key technology towards the implementation of all-optical packet switching nodes (AOPS) for the future optical Internet. The capital expenditures of the deployment of AOLS increases with the size of the label spaces (i.e. the number of used labels), since a special optical device is needed for each recognized label on every node. Label space sizes are affected by the way in which demands are routed. For instance, while shortest-path routing leads to the usage of fewer labels but high link utilization, minimum interference routing leads to the opposite. This paper studies all-optical label stacking (AOLStack), which is an extension of the AOLS architecture. AOLStack aims at reducing label spaces while easing the compromise with link utilization. In this paper, an integer lineal program is proposed with the objective of analyzing the softening of the aforementioned trade-off due to AOLStack. Furthermore, a heuristic aiming at finding good solutions in polynomial-time is proposed as well. Simulation results show that AOLStack either a) reduces the label spaces with a low increase in the link utilization or, similarly, b) uses better the residual bandwidth to decrease the number of labels even more

Enhanced multi-layer protection in multi-service GMPLS networks

This paper focuses on QoS routing with protection in an MPLS network over an optical layer. In this multi-layer scenario each layer deploys its own fault management methods. A partially protected optical layer is proposed and the rest of the network is protected at the MPLS layer. New protection schemes that avoid protection duplications are proposed. Moreover, this paper also introduces a new traffic classification based on the level of reliability. The failure impact is evaluated in terms of recovery time depending on the traffic class. The proposed schemes also include a novel variation of minimum interference routing and shared segment backup computation. A complete set of experiments proves that the proposed schemes are more efficient as compared to the previous ones, in terms of resources used to protect the network, failure impact and the request rejection ratio

CODAPACK3D. A new version of Compositional Data Package

The statistical analysis of compositional data should be treated using logratios of parts,which are difficult to use correctly in standard statistical packages. For this reason afreeware package, named CoDaPack was created. This software implements most of thebasic statistical methods suitable for compositional data.In this paper we describe the new version of the package that now is calledCoDaPack3D. It is developed in Visual Basic for applications (associated with Excel©),Visual Basic and Open GL, and it is oriented towards users with a minimum knowledgeof computers with the aim at being simple and easy to use.This new version includes new graphical output in 2D and 3D. These outputs could bezoomed and, in 3D, rotated. Also a customization menu is included and outputs couldbe saved in jpeg format. Also this new version includes an interactive help and alldialog windows have been improved in order to facilitate its use.To use CoDaPack one has to access Excel© and introduce the data in a standardspreadsheet. These should be organized as a matrix where Excel© rows correspond tothe observations and columns to the parts. The user executes macros that returnnumerical or graphical results. There are two kinds of numerical results: new variablesand descriptive statistics, and both appear on the same sheet. Graphical output appearsin independent windows. In the present version there are 8 menus, with a total of 38submenus which, after some dialogue, directly call the corresponding macro. Thedialogues ask the user to input variables and further parameters needed, as well aswhere to put these results. The web site http://ima.udg.es/CoDaPack contains thisfreeware package and only Microsoft Excel© under Microsoft Windows© is required torun the software.Kew words: Compositional data Analysis, Software