Kolozsvár-Szeged : egy egyetemtörténeti vita törésvonalai

How old is the University of Szeged? This question has been frequently asked inside and outside the institution since the change of the political system in Hungary. Until which date can the history of the university be traced back? Is it the time when an institution was established in Kolozsvár by Báthory in 1581? Or is it the year of 1872, when the Ferenc József University was opened in Kolozsvár? Or is it 1921, when higher education has begun in Szeged? The University of Szeged launched a debate on this issue in 2007. The debate was going on in different meetings and in the newspaper of the university. At least the Senate of the university has accepted the following: the University of Szeged is the spiritual-cultural heir of the Báthory-institution established in 1581, thus this date is the founding of the University of Szeged. In our paper we analyze the most important aspects of the debate, using the archives of the university newspaper

Bridging Natural Language Processing AI technique and Corporate Communications

Today’s communication channels and media platforms generate a huge amount of data, which - through advanced AI- (Machine Learning) based techniques - can be leveraged to significantly enhance business networking, improve the efficiency of public relations, management, and extend the possible application areas of communication components. As a sub-discipline of AI, Natural Language Processing (NLP) is frequently utilized in the field of corporate communications (CC) to boost target- group satisfaction through information retrieval and automated dialogue services. This paper gives an overview of the use of NLP in different disciplines of CC, discusses general corporational/organizational practices, and identifies promising research topics for the future while pointing out the ethical aspects of user-data handling and customer engagement. The findings of this synthesizing study are based on primer qualitative research building on the methodology of deep interviews and focus group research involving experts practicing in the fields of CC and NLP. Based on the feedbacks of the participants, a refined CC model was developed, as well as a model mapping conventional NLP techniques onto CC disciplines and tasks they are utilized for

Effektív, kvantitatív és számítógépes vizsgálatok a diofantikus számelméletben = Effective, quantitative and computational investigations in diophntine number theory

Számos jelentős effektív, kvantitatív és explicit eredmény született egy sor alapvető fontosságú diofantikus problémával kapcsolatban. Az eredmények elsősorban S-egységegyenletekre, szuperelliptikus és binom Thue egyenletekre, általánosított Fermat-típusú egyenletekre, valamint rekurzív sorozatokra, adott diszkriminánsú, illetve adott rezultánsú polinomokra és binér formákra, általánosított számrendszerekre, CNS polinomokra, többszörösen monogén rendekre és alkalmazásaikra vonatkoznak. A legkiemelkedőbb eredmények a következők. Effektív és egyben kvantitatív bizonyítást adtak Lang (1960) általánosított egységegyenletekre vonatkozó régi, híres ineffektív végességi tételére. Ez számos fontos alkalmazás előtt nyitotta meg az utat. Közös általánosítását adták az ismeretlen fokszámú binom Thue egyenletekre és az S-egységegyenletekre vonatkozó korábbi nevezetes effektív végességi tételeknek. Jelentős áttörést hajtottak végre egy több évszázados problémakörben, megmutatván, hogy legfeljebb 34 tagú számtani sorozat tagjainak a szorzata (bizonyos triviális kivételektől eletekintve) nem lehet teljes hatvány. Új módszereket, hatékony eljárásokat dolgozatk ki ismeretlen fokszámú binom Thue egyenletek, egységegyenletek, szuperelliptikus egyenletek, általánosított Fermat-féle egyenletek, valamint index forma egyenletek konkrét esetekben való megoldására. Mindezeknek számos fontos alkalmazását adták a diofantikus számelméletben és az algebari számelméletben. | Several effective, quantitative and explicit results have been established on various diophantine problems of fundamental importance. These results concern mostly S-unit equations, superelliptic equations, binomial Thue equations, generalized Fermat-type equations, linear recurrences, binary forms of given discriminant resp. of given resultant, generalized number systems, CNS polynomials, multiply monogenic orders and their applications. The most important scientific achievements of the project are as follows. An effective and quantitative proof has been given for an old and famous ineffective finiteness result of Lang (1960) concerning generalized unit equations. This will yield many important applications. A common generalization has been obtained of the earlier effective finiteness theorems concerning S-unit equations resp. binomial Thue equations with unknown exponent. A considerable breakthrough has been made in connection with a problem going back to Fermat and Euler: it has been proved that (apart from some trivial exceptions) a product of at most 34 consecutive terms in an arithmetic progression can never be a perfect power. New methods and efficient algorithms have been elaborated for solving, in concrete cases, binomial Thue equations with unknown exponent, S-unit equations, superelliptic equations, generalized Fermat-type equations and index form equations. These led to many important applications in diophantine and algebraic number theory

Simultaneous detection of BRCA mutations and large genomic rearrangements in germline DNA and FFPE tumor samples

The development of breast and ovarian cancer is strongly connected to the inactivation of the BRCA1 and BRCA2 genes by different germline and somatic alterations, and their diagnosis has great significance in targeted tumor therapy, since recently approved PARP inhibitors show high efficiency in the treatment of BRCA-deficient tumors. This raises the need for new diagnostic methods that are capable of performing an integrative mutation analysis of the BRCA genes not only from germline DNA but also from formalin-fixed and paraffin-embedded (FFPE) tumor samples. Here we describe the development of such a methodology based on next-generation sequencing and a new bioinformatics software for data analysis. The diagnostic method was initially developed on an Illumina MiSeq NGS platform using germline-mutated stem cell lines and then adapted for the Ion Torrent PGM NGS platform as well. We also investigated the usability of NGS coverage data for the detection of copy number variations and exon deletions as a replacement of the conventional MLPA technique. Finally, we tested the developed workflow on FFPE samples from breast and ovarian cancer patients. Our method meets the sensitivity and specificity requirements for the genetic diagnosis of breast and ovarian cancers both from germline and FFPE samples