4,242 research outputs found

    26. Theorietag Automaten und Formale Sprachen 23. Jahrestagung Logik in der Informatik: Tagungsband

    Get PDF
    Der Theorietag ist die Jahrestagung der Fachgruppe Automaten und Formale Sprachen der Gesellschaft für Informatik und fand erstmals 1991 in Magdeburg statt. Seit dem Jahr 1996 wird der Theorietag von einem eintägigen Workshop mit eingeladenen Vorträgen begleitet. Die Jahrestagung der Fachgruppe Logik in der Informatik der Gesellschaft für Informatik fand erstmals 1993 in Leipzig statt. Im Laufe beider Jahrestagungen finden auch die jährliche Fachgruppensitzungen statt. In diesem Jahr wird der Theorietag der Fachgruppe Automaten und Formale Sprachen erstmalig zusammen mit der Jahrestagung der Fachgruppe Logik in der Informatik abgehalten. Organisiert wurde die gemeinsame Veranstaltung von der Arbeitsgruppe Zuverlässige Systeme des Instituts für Informatik an der Christian-Albrechts-Universität Kiel vom 4. bis 7. Oktober im Tagungshotel Tannenfelde bei Neumünster. Während des Tre↵ens wird ein Workshop für alle Interessierten statt finden. In Tannenfelde werden • Christoph Löding (Aachen) • Tomás Masopust (Dresden) • Henning Schnoor (Kiel) • Nicole Schweikardt (Berlin) • Georg Zetzsche (Paris) eingeladene Vorträge zu ihrer aktuellen Arbeit halten. Darüber hinaus werden 26 Vorträge von Teilnehmern und Teilnehmerinnen gehalten, 17 auf dem Theorietag Automaten und formale Sprachen und neun auf der Jahrestagung Logik in der Informatik. Der vorliegende Band enthält Kurzfassungen aller Beiträge. Wir danken der Gesellschaft für Informatik, der Christian-Albrechts-Universität zu Kiel und dem Tagungshotel Tannenfelde für die Unterstützung dieses Theorietags. Ein besonderer Dank geht an das Organisationsteam: Maike Bradler, Philipp Sieweck, Joel Day. Kiel, Oktober 2016 Florin Manea, Dirk Nowotka und Thomas Wilk

    Functionally gradient tissue scaffold design and deposition path planning for bio-additive processes

    Get PDF
    A layer-based tissue scaffold is designed with heterogeneous internal architecture. The proposed layer-based design uses a bi-layer pattern of radial and spiral layer consecutively to generate functionally gradient porosity following the geometry of the scaffold. Medial region is constructed from medial axis and used as an internal geometric feature for each layer. The radial layers are generated with sub-region channels by connecting the boundaries of the medial region and the layer’s outer contour. Proper connections with allowable geometric properties are ensured by applying optimization algorithms. Iso-porosity regions are determined by dividing the sub-regions into pore cells. The combination of consecutive layers generates the pore cells with desired pore sizes. To ensure the fabrication of the designed scaffolds, both contours have been optimized for a continuous, interconnected, and smooth deposition path-planning. The proposed methodologies can generate the structure with gradient (linear or non-linear), variational or constant porosity that can provide localized control of variational porosity along the scaffold architecture. The designed porous structures can be fabricated using bio-additive fabrication processes

    Designing heterogeneous porous tissue scaffolds for additive manufacturing processes

    Get PDF
    A novel tissue scaffold design technique has been proposed with controllable heterogeneous architecture design suitable for additive manufacturing processes. The proposed layer-based design uses a bi-layer pattern of radial and spiral layers consecutively to generate functionally gradient porosity, which follows the geometry of the scaffold. The proposed approach constructs the medial region from the medial axis of each corresponding layer, which represents the geometric internal feature or the spine. The radial layers of the scaffold are then generated by connecting the boundaries of the medial region and the layer's outer contour. To avoid the twisting of the internal channels, reorientation and relaxation techniques are introduced to establish the point matching of ruling lines. An optimization algorithm is developed to construct sub-regions from these ruling lines. Gradient porosity is changed between the medial region and the layer's outer contour. Iso-porosity regions are determined by dividing the subregions peripherally into pore cells and consecutive iso-porosity curves are generated using the isopoints from those pore cells. The combination of consecutive layers generates the pore cells with desired pore sizes. To ensure the fabrication of the designed scaffolds, the generated contours are optimized for a continuous, interconnected, and smooth deposition path-planning. A continuous zig-zag pattern deposition path crossing through the medial region is used for the initial layer and a biarc fitted isoporosity curve is generated for the consecutive layer with C-1 continuity. The proposed methodologies can generate the structure with gradient (linear or non-linear), variational or constant porosity that can provide localized control of variational porosity along the scaffold architecture. The designed porous structures can be fabricated using additive manufacturing processes

    A reference grammar of Puyuma, an Austronesian language of Taiwan

    Get PDF

    CODE SWITCHING AND CODE MIXING ON CHINA RICH GIRLFRIEND NOVEL BY KEVIN KWAN

    Get PDF
    This research aimed to find the classification of code switching and code mixing types, and the identification of the reasons that indicated the characters performing code switching and code mixing in the novel entitled China Rich Girlfriend by Kevin Kwan. The researcher used qualitative and content analysis approach in analyzing and interpreting the data. The data source of this research was China Rich Girlfriend novel and data were generated from the dialogues and utterances by the characters which contained the practice of code switching and code mixing. Through the finding of the analysis, there were 87 practices of code switching which is divided into three types. Those are intra-sentential switching, inter-sentential switching and tag switching. And there were 60 practices of code mixing which is known as insertion, alternation and congruent lexicalization. The reasons of the characters performing code switching and code mixing are talking about particular topic, interjection, quoting somebody else, being emphatic about something and expressing group identity

    A STUDY OF INDONESIAN-ENGLISH CODE MIXING IN GO GIRL MAGAZINE

    Get PDF
    Fenomena campur kode adalah fenomena yang sering terjadi di masyarakat dwibahasa seperti di Indonesia. Kedwibahasaan terjadi dalam masyarakat yang terbuka dengan masyarakat lain. Dalam hal ini, kedwibahasaan seseorang tidak ditunjukan dalam pemahaman yang sama untuk memahami bahasa lain. Namun, pemahaman akan bahasa lain yang terbatas pun dapat membuat seseorang bisa dikatakan sebagai seseorang yang berkedwibahasaan. Campur kode adalah penyisipan suatu elemen bahasa lain kedalam bahasa yang dipakai penutur dalam suatu percakapan. Dalam penelitian ini, penulis meneliti tentang campur kode dalam majalah Go Girl edisi Mei 2013. Tujuan penelitian ini adalah untuk mengetahui jenis campur kode yang terjadi di dalam majalah Go Girl dan faktor sosial yang memotivasi penulis majalah. Penelitian ini adalah penelitian deskriptif kualitatif, bahan penelitian dalam penelitian ini adalah kata-kata dan sumbernya berasal dari majalah Go Girl edisi Mei 2013. Dalam mengumpulkan data, penulis menggunakan teknik simak bebas libat cakap. Untuk mendukung penelitian ini penulis menggunakan teknik padan untuk menganalisis data. Dalam penelitian ini, penulis menemukan jenis campur kode yaitu penyisipan kata dan frasa. Faktor sosial yang terjadi adalah faktor dalam dan luar. Faktor dalam mencakup keterbatasan kata, penggunaan homonim, dan penggunaan sinonim sedangkan untuk faktor luar status social dan keterbatasan kata

    Effect of a specific exercise programme during pregnancy on diastasis recti abdominis: study protocol for a randomised controlled trial

    Get PDF
    Introduction: Diastasis recti abdominis (DRA) is a common condition in pregnant and postpartum women. Evidence for the treatment of DRA is both sparse and weak. As this condition occurs during the last two trimesters of pregnancy and there is a paucity of high-quality studies on a pregnant population, we will conduct a randomised trial on the effect of a specific exercise programme during pregnancy on DRA. Methods and analysis: This is an exploratory, assessor-blinded, randomised parallel group trial carried out in a primary healthcare setting in a Norwegian city. 100 pregnant women, both primigravida and multigravida, in gestation week 24 presenting with DRA of ≥28 mm will be included. Participants will be allocated to either an intervention group or a control group by block randomisation. The intervention group will participate in a 12-week specific exercise programme. The control group will not participate in any exercise intervention. Data collection will take place prior to intervention, postintervention at gestation week 37, and 6 weeks, 6 and 12 months postpartum. The primary outcome measure will be change in the inter-recti distance, measured by two-dimensional ultrasonography. Data will be analysed and presented in accordance with international Consolidated Standards of Reporting Trials guidelines and analysed according to the intention-to-treat principle. Ethics and dissemination: Ethical approval has been obtained by the regional ethical committee (76296), and all procedures will be performed in adherence to the Helsinki declaration. The study has been registered with ClinicalTrials.gov. Results from this study will be presented at scientific conferences and in peer-reviewed scientific journals.publishedVersio

    The Difficulties of Learning Logic Programs with Cut

    Get PDF
    As real logic programmers normally use cut (!), an effective learning procedure for logic programs should be able to deal with it. Because the cut predicate has only a procedural meaning, clauses containing cut cannot be learned using an extensional evaluation method, as is done in most learning systems. On the other hand, searching a space of possible programs (instead of a space of independent clauses) is unfeasible. An alternative solution is to generate first a candidate base program which covers the positive examples, and then make it consistent by inserting cut where appropriate. The problem of learning programs with cut has not been investigated before and this seems to be a natural and reasonable approach. We generalize this scheme and investigate the difficulties that arise. Some of the major shortcomings are actually caused, in general, by the need for intensional evaluation. As a conclusion, the analysis of this paper suggests, on precise and technical grounds, that learning cut is difficult, and current induction techniques should probably be restricted to purely declarative logic languages.Comment: See http://www.jair.org/ for any accompanying file
    • …
    corecore