256 research outputs found

    Author Co-Citation Analysis (ACA): a powerful tool for representing implicit knowledge of scholar knowledge workers

    No full text
    In the last decade, knowledge has emerged as one of the most important and valuable organizational assets. Gradually this importance caused to emergence of new discipline entitled ―knowledge management‖. However one of the major challenges of knowledge management is conversion implicit or tacit knowledge to explicit knowledge. Thus Making knowledge visible so that it can be better accessed, discussed, valued or generally managed is a long-standing objective in knowledge management. Accordingly in this paper author co- citation analysis (ACA) will be proposed as an efficient technique of knowledge visualization in academia (Scholar knowledge workers)

    Organic Compounds and Conditioning Films Within Deep Rock Fractures of the aspo Hard Rock Laboratory, Sweden

    No full text
    Palaeoproterozoic grano-dioritic rocks of the island of aspo exhibit several mineralized fracture generations mainly filled by quartz, calcite, fluorite and/or epidote. Manganese-rich calcite fractures of probably Palaeozoic age are related to younger, possibly Pleistocene/Holocene cracks formed during the last ice age and successive crustal uplift, in contact to the host rock, which are sometimes associated with organic matter. Signals of organic molecules could be gained on the corresponding phase boundaries with Raman spectroscopy, likewise HPLC and HPAE-PAD reveal the presence of carbohydrates and amino acids in bulk rock samples. It is supposed that most of the preserved organic matter is related with thin conditioning films. Extracted bacterial and fungal DNA from the grano-dioritic rocks indicates still active microbial activity in fracture micro-niches.German Research Foundation [DFG - FOR 571, 48, Re 665/27-3

    Performing Enlightenment: Johann Burkhard Mencke and Academic Self-Critique

    No full text
    For many Enlightenment philosophers, to do philosophy was not only to think and write, but also to live and act in the world. This performative purpose changed the meaning of philosophical texts as well as which texts could be considered as philosophical. The essay illustrates this point through the example of Johann Burkhard Mencke’s famous lectures, De charlataneria eruditorum −on charlatanry of the learned− first delivered at the University of Leipzig in 1713 and 1715. Mencke not only discussed the significance and problems of performance, but also emphasized his points by his own performance as a lecturer and as an author. He was not only critical of the false authority of others, but also of his own authority as well as that of his Enlightenment colleagues and allies. The lectures, I argue, exemplify a genre of Enlightenment philosophy that placed self-critique at the center.For many Enlightenment philosophers, to do philosophy was not only to think and write, but also to live and act in the world. This performative purpose changed the meaning of philosophical texts as well as which texts could be considered as philosophical. The essay illustrates this point through the example of Johann Burkhard Mencke’s famous lectures, De charlataneria eruditorum −on charlatanry of the learned− first delivered at the University of Leipzig in 1713 and 1715. Mencke not only discussed the significance and problems of performance, but also emphasized his points by his own performance as a lecturer and as an author. He was not only critical of the false authority of others, but also of his own authority as well as that of his Enlightenment colleagues and allies. The lectures, I argue, exemplify a genre of Enlightenment philosophy that placed self-critique at the center

    Implementasi Algoritma Not So Naive dan Algoritma Burkhard-Keller Tree pada Aplikasi Kamus Bahasa Indonesia-Hokkian Berbasis Android

    No full text
    Bahasa Hokkian umumnya dikenal sebagai bahasa ibu komunitas Tionghoa di Medan. Namun belum ada metode yang digunakan untuk mempelajari bahasa tersebut karena masih dilakukan secara manual. Oleh karena itu diperlukan suatu media yang dapat mempermudah seseorang dalam mempelajari bahasa tersebut yaitu aplikasi smartphone yang praktis. Kemudahan dalam mengakses suatu informasi juga sangat penting. Untuk mempermudah seseorang mempelajari bahasa tersebut penulis membuat aplikasi kamus offline berbasis Android dengan menggunakan algoritma Not So Naive sebagai algoritma exact string matching dan algoritma Burkhard-Keller Tree sebagai algoritma approximate string matching dengan menggunakan sistem manajemen database SQLite sebagai media penyimpanan data. Penelitian ini bertujuan untuk membuktikan kelebihan dan kekurangan masing-masing algoritma dalam mengakses suatu informasi serta menampilkan hasil running time kedua algoritma. Dalam hal proses pencarian, kedua algoritma memiliki cara kerja yang berbeda. Algoritma Not So Naive mengidentifikasi terlebih dahulu dua kasus untuk menentukan nilai pergeseran, yang dapat dilakukan sebanyak 2 posisi ke kanan sedangkan algoritma Burkhard-Keller Tree mencari kata berdasarkan batas atas dan batas bawah serta batas toleransi kesalahan yang telah ditetapkan. Hasil penelitian menunjukkan bahwa waktu pencarian algoritma Burkhard-Keller Tree meningkat sebesar 58,26% dan 74% pada algoritma Not So Naive seiring dengan meningkatnya ukuran database. Algoritma Not So Naive memiliki rata-rata running time 25,45ms dan rata-rata running time sebesar 59,95ms pada algoritma Burkhard-Keller Tree.The Hokkien language is generally known as the mother tongue of the Chinese community in Medan. However, there is no method used to learn the language because it is still done manually. Therefore, we need a form of media that can make it easier for someone to learn the language, namely a practical smartphone application. Ease of accessing information is also very important. To make it easier for someone to learn the language, the author creates an Android-based offline dictionary application using the Not So Naive algorithm as an exact string matching algorithm and the Burkhard-Keller Tree algorithm as an approximate string matching algorithm using the SQLite database management system as a data storage medium. This study aims to prove the advantages and disadvantages of each algorithm in accessing information and display the results of the running time of both algorithms. In regards to the search processes, the two algorithms have a different way of working. The Not So Naive algorithm first identifies two cases to decide the value of the shift, which can be done in 2 positions to the right, while the Burkhard-Keller Tree algorithm looks for words based on predetermined upper and lower limits and fault tolerance limits. The results showed that the search time for the Burkhard-Keller Tree algorithm increased by 58,26% and 74% for the Not So Naive algorithm as the database size increased. The Not So Naive algorithm has a mean running time of 24.85 ms and a mean running time of 60.4 ms on the Burkhard-Keller Tree algorithm.96 HalamanSkripsi Sarjan

    Shape Oscillations of Dictyostelium discoideum Cells on Ultramicroelectrodes Monitored by Impedance Analysis

    No full text
    Time-resolved analysis employing electric cell–substrate impedance sensing reveals periodic impedance changes of small ensembles of Dictyostelium discoideum amoebae oscillating synchronously upon deprivation of food. Impedance changes are attributed to periodic alter ations of cell shape and cell–substrate distance. Ultrasmall electrodes allow the detection of single cell traces

    Modellbasiertes Regressionstesten von Varianten und Variantenversionen

    No full text
    The quality assurance of software product lines (SPL) achieved via testing is a crucial and challenging activity of SPL engineering. In general, the application of single-software testing techniques for SPL testing is not practical as it leads to the individual testing of a potentially vast number of variants. Testing each variant in isolation further results in redundant testing processes by means of redundant test-case executions due to the shared commonality. Existing techniques for SPL testing cope with those challenges, e.g., by identifying samples of variants to be tested. However, each variant is still tested separately without taking the explicit knowledge about the shared commonality and variability into account to reduce the overall testing effort. Furthermore, due to the increasing longevity of software systems, their development has to face software evolution. Hence, quality assurance has also to be ensured after SPL evolution by testing respective versions of variants. In this thesis, we tackle the challenges of testing redundancy as well as evolution by proposing a framework for model-based regression testing of evolving SPLs. The framework facilitates efficient incremental testing of variants and versions of variants by exploiting the commonality and reuse potential of test artifacts and test results. Our contribution is divided into three parts. First, we propose a test-modeling formalism capturing the variability and version information of evolving SPLs in an integrated fashion. The formalism builds the basis for automatic derivation of reusable test cases and for the application of change impact analysis to guide retest test selection. Second, we introduce two techniques for incremental change impact analysis to identify (1) changing execution dependencies to be retested between subsequently tested variants and versions of variants, and (2) the impact of an evolution step to the variant set in terms of modified, new and unchanged versions of variants. Third, we define a coverage-driven retest test selection based on a new retest coverage criterion that incorporates the results of the change impact analysis. The retest test selection facilitates the reduction of redundantly executed test cases during incremental testing of variants and versions of variants. The framework is prototypically implemented and evaluated by means of three evolving SPLs showing that it achieves a reduction of the overall effort for testing evolving SPLs.Testen ist ein wichtiger Bestandteil der Entwicklung von Softwareproduktlinien (SPL). Aufgrund der potentiell sehr großen Anzahl an Varianten einer SPL ist deren individueller Test im Allgemeinen nicht praktikabel und resultiert zudem in redundanten Testfallausführungen, die durch die Gemeinsamkeiten zwischen Varianten entstehen. Existierende SPL-Testansätze adressieren diese Herausforderungen z.B. durch die Reduktion der Anzahl an zu testenden Varianten. Jedoch wird weiterhin jede Variante unabhängig getestet, ohne dabei das Wissen über Gemeinsamkeiten und Variabilität auszunutzen, um den Testaufwand zu reduzieren. Des Weiteren muss sich die SPL-Entwicklung mit der Evolution von Software auseinandersetzen. Dies birgt weitere Herausforderungen für das SPL-Testen, da nicht nur für Varianten sondern auch für ihre Versionen die Qualität sichergestellt werden muss. In dieser Arbeit stellen wir ein Framework für das modellbasierte Regressionstesten von evolvierenden SPL vor, das die Herausforderungen des redundanten Testens und der Software-Evolution adressiert. Das Framework vereint Testmodellierung, Änderungsauswirkungsanalyse und automatische Testfallselektion, um einen inkrementellen Testprozess zu definieren, der Varianten und Variantenversionen unter Ausnutzung des Wissens über gemeinsame Funktionalität und dem Wiederverwendungspotential von Testartefakten und -resultaten effizient testet. Für die Testmodellierung entwickeln wir einen Ansatz, der Variabilitäts- sowie Versionsinformation von evolvierenden SPL gleichermaßen für die Modellierung einbezieht. Für die Änderungsauswirkungsanalyse definieren wir zwei Techniken, um zum einen Änderungen in Ausführungsabhängigkeiten zwischen zu testenden Varianten und ihren Versionen zu identifizieren und zum anderen die Auswirkungen eines Evolutionsschrittes auf die Variantenmenge zu bestimmen und zu klassifizieren. Für die Testfallselektion schlagen wir ein Abdeckungskriterium vor, das die Resultate der Auswirkungsanalyse einbezieht, um automatisierte Entscheidungen über einen Wiederholungstest von wiederverwendbaren Testfällen durchzuführen. Die abdeckungsgetriebene Testfallselektion ermöglicht somit die Reduktion der redundanten Testfallausführungen während des inkrementellen Testens von Varianten und Variantenversionen. Das Framework ist prototypisch implementiert und anhand von drei evolvierenden SPL evaluiert. Die Resultate zeigen, dass eine Aufwandsreduktion für das Testen evolvierender SPL erreicht wird
    corecore