Computerunterstützte Rigiditätsmessung zur Differenzierung psychopathologischer Gruppen [Computer-assisted determination of rigidity in the differentiation of psychopathologic groups]

The measurement of rigidity and perseveration respectively gets increasing importance in clinical psychodiagnostics. Recently we have developed a computer-assisted technique which allows to get information about inadequate persisting in psychic processes and behaviour within shortest time and to differentiate between psychopathological groups. 257 patients of both sexes who came for elucidation of their disorders to the department of clinical psychodiagnostics were investigated. The most significant differences between the groups were found in redundance of second degree (the patient has to press 10 buttons indiscriminately according to the beat of a metronom--standard condition) and in personal speed (the patient has to press 10 buttons as fast as possible--speed condition). Furthermore the psychopathological groups were ranged in the particular variables of rigidity according to their mean values and their average ranges the schizophrenics and effective psychoses were characterized by a high tendency of perseveration while the neurotics, patients with organic brain syndrome and alcohol and drug dependents showed more flexibility.

Wage rigidity and job creation

Recent research in macroeconomics emphasizes the role of wage rigidity in accounting for the volatility of unemployment fluctuations. We use worker-level datafrom the CPS to measure the sensitivity of wages of newly hired workers to changesin aggregate labor market conditions. The wage of new hires, unlike the aggregatewage, is volatile and responds almost one-to-one to changes in labor productivity.We conclude that there is little evidence for wage stickiness in the data. We alsoshow, however, that a little wage rigidity goes a long way in amplifying the responseof job creation to productivity shocks.

Long run relationships and price rigidity

I study a repeated buyer-seller relationship for the exchange of a givengood. Asymmetric information over the buyer's reservation price, which issubject to random shocks, may lead the seller to use a rigid pricing policydespite the possibility of making higher profits through price discriminationacross the different satates of the buyer's reservation price. The existence of a flexible price subgame perfect equilibrium is shown for the buyerssufficiently locked-in. When the seller faces a population of buyers whose degree of involvmentin the relatioship is unknown, the flexible price equilibrium is notnecessarily optimal. Thus tipically the seller will prefer to use therigid price strategy. A learning process allowing the seller to screenthe population of buyers is derived abd the existence of a switching pointbetween the two regimes (i.e. price rigidity and price felxibility) isshown.

Flexibility vs. rigidity: Does Spain have the worst of both worlds?

In this paper we study the structure of labor market flows in Spain and compare them with France and the US. We characterize a number of empirical regularities and stylized facts. One striking result is that the job finding rate is slightly higher than in France, while the jon loss rate is much higher, putting Spain half-way between France and the US. This suggests that while Spain has borne the full cost of its labor market reforms in terms of job precarity, the benefits in terms of job creation have been quite modest. We hypothesize that this has been due to the reform s credibility being imperfect, which leads toexpectation of reversal.

Comparing Random-based and k-Anonymity-Based Algorithms for Graph Anonymization

Recently, several anonymization algorithms have appeared for privacy preservation on graphs. Some of them are based on random-ization techniques and on k-anonymity concepts. We can use both of them to obtain an anonymized graph with a given k-anonymity value. In this paper we compare algorithms based on both techniques in orderto obtain an anonymized graph with a desired k-anonymity value. We want to analyze the complexity of these methods to generate anonymized graphs and the quality of the resulting graphs.

Graph theory reveals dysconnected hubs in 22q11DS and altered nodal efficiency in patients with hallucinations.

Schizophrenia is postulated to be the prototypical dysconnection disorder, in which hallucinations are the core symptom. Due to high heterogeneity in methodology across studies and the clinical phenotype, it remains unclear whether the structural brain dysconnection is global or focal and if clinical symptoms result from this dysconnection. In the present work, we attempt to clarify this issue by studying a population considered as a homogeneous genetic sub-type of schizophrenia, namely the 22q11.2 deletion syndrome (22q11.2DS). Cerebral MRIs were acquired for 46 patients and 48 age and gender matched controls (aged 6-26, respectively mean age = 15.20 ± 4.53 and 15.28 ± 4.35 years old). Using the Connectome mapper pipeline (connectomics.org) that combines structural and diffusion MRI, we created a whole brain network for each individual. Graph theory was used to quantify the global and local properties of the brain network organization for each participant. A global degree loss of 6% was found in patients' networks along with an increased Characteristic Path Length. After identifying and comparing hubs, a significant loss of degree in patients' hubs was found in 58% of the hubs. Based on Allen's brain network model for hallucinations, we explored the association between local efficiency and symptom severity. Negative correlations were found in the Broca's area (p < 0.004), the Wernicke area (p < 0.023) and a positive correlation was found in the dorsolateral prefrontal cortex (DLPFC) (p < 0.014). In line with the dysconnection findings in schizophrenia, our results provide preliminary evidence for a targeted alteration in the brain network hubs' organization in individuals with a genetic risk for schizophrenia. The study of specific disorganization in language, speech and thought regulation networks sharing similar network properties may help to understand their role in the hallucination mechanism.

Comparing Random-based and k-Anonymity-Based Algorithms for Graph Anonymization

Recently, several anonymization algorithms have appeared for privacy preservation on graphs. Some of them are based on random-ization techniques and on k-anonymity concepts. We can use both of them to obtain an anonymized graph with a given k-anonymity value. In this paper we compare algorithms based on both techniques in orderto obtain an anonymized graph with a desired k-anonymity value. We want to analyze the complexity of these methods to generate anonymized graphs and the quality of the resulting graphs.

Scheduling an European basketball competition. An application of graph theory

The object of this project is to schedule a ctitious European basketball competition with many teams situated a long distances. The schedule must be fair, feasible and economical, which means that the total distance trav- eled by every team must be the minimal possible. First, we de ne the sport competition terminology and study di erent competition systems, focusing on the NBA and the Euroleague systems. Then we de ne concepts of graph theory and spherical distance that will be needed. Next we propose a com- petition system, explaining where will be allocated the teams and how will be the scheduling. Then there is a description of the programs that have been implemented, and, nally, the complete schedule is displayed, and some possible improvements are mentioned.

An open source browser-based software tool for graph drawing and visualisation

In this research work we searched for open source libraries which supports graph drawing and visualisation and can run in a browser. Subsequent these libraries were evaluated to find out which one is the best for this task. The result was the d3.js is that library which has the greatest functionality, flexibility and customisability. Afterwards we developed an open source software tool where d3.js was included and which was written in JavaScript so that it can run browser-based.

WebGraphEd, an open source graph drawing editor for the web

WebGraphEd is an open source software for graph visualization and manipulation. It is especially designed to work for the web platform through a web browser. The web application has been written in JavaScript and compacted later, which makes it a very lightweight software. There is no need of additional software, and the only requirement is to have an HTML5 compliant browser. WebGraphEd works with scalable vector graphics (SVG), which it makes possible to create lossless graph drawings.

A note on the periodic orbits and topological entropy of graph maps

This paper deals with the relationship between the periodic orbits of continuous maps on graphs and the topological entropy of the map. We show that the topological entropy of a graph map can be approximated by the entropy of its periodic orbits.

Does Rigidity of Prices Hide Collusion?

Cartel detection is one of the most basic and most complicated tasks of competition authorities. In recent years, however, variance filters have provided a fairly simple tool for rejecting the existence of price-fixing, with the added advantage that the methodology requires only a low volume of data. In this paper we analyze two aspects of variance filters: 1- the relationship established between market structure and price rigidity, and 2- the use of different benchmarks for implementing the filters. This paper addresses these two issues by applying a variance filter to a gasoline retail market characterized by a set of unique features. Our results confirm the positive relationship between monopolies and price rigidity, and the variance filter's ability to detect non-competitive behavior when an appropriate benchmark is used. Our findings should serve to promote the implementation of this methodology among competition authorities, albeit in the awareness that a more exhaustive complementary analysis is required.