Programming Languages

Instrumentation is a technique frequently used in software engineering for several different purposes, e.g. program and/or specification execution trace, testing criteria coverage analy- sis, and reverse engineering. Instrumenting a software product can be divided into two main tasks: (i) deriving the software product structure and (ii) inserting statements for collecting runtime/simulation information. Most instrumentation approaches are specific to a given domain or language. Thus, it is very difficult to reuse the effort expended in developing an instrumenter, even if the target languages are quite similar. To tackle this problem, in this paper, we propose an instrumentation-oriented meta-language, named IDeL, designed to support the description of both main tasks of instru- mentation process, namely: (i) the product structure derivation and (ii) the insertion of the instrumentation statements. In order to apply IDeL to a specific language L, it should be in- stantiated with a co...

A half-adder (HA) and a full-adder (FA) using hybrid circuits combining three-gate single-electron transistors (TG-SETs) with metal-oxide-semiconductor field-effect-transistors (MOSFETs) are proposed. The proposed HA consists of three TG-SETs, two enhanced-mode NMOSFETs, and two depletion-mode NMOSFETs, and the proposed FA consists of eight TG-SETs, two enhanced-mode NMOSFETs, and two depletion-mode NMOSFETs. The complexities in the HA and the FA are 7 and 12, respectively, and the worst-case delays in the HA and the FA are 1.48 ns and 2.25 ns, respectively. Compared with the conventional CMOS FA with 0.35 μm technology, the proposed FA can be constructed with 0.43 of devices, and can operate with 3.5 of worst-case delay, 1/534 of average power consumption, and 1/152 of power-delay-product (PDP). The proposed HA and FA can be operated as a half-subtractor (HS) and a full-subtractor (FS) in the case when the levels of the control gates in the HA and the FA are fitly determined. The b...

 Transformation of land-use cause forest area decrease that will affect microclimate (weather tends heat), thus hotspot may possible to scattered in that area and raise the transformation of surface temperature. The objective of this research is to determine the indication of surface temperature in the East Kutai District. The advantage of this research is to give information about hotspot area distribution based on land use and relate between hotspots with surface temperature increase so it is supposed to be one of the consider to transform land use in East Kutai District. This research was held from April until May 2019 at the Laboratory of Carthography and Geographic Information System, Faculty of Agriculture, Mulawarman University. This research using calculation of Land Surface Temperature (LST) value to determine the transformation of surface temperature in East Kutai District by data analysis from Landsat-8 OLI/TIRS satellite. Hotspot area distribution adapted to map of land-...

The increasing need for mobile computer systems has engendered a new priority that has been neglected so far: awareness of the system’s energy consumption. Not only smartphones, tablets or laptops should run as long as possible, but also perpetual systems using environmental energy, which should be designed with energy-awareness in mind. Common programming languages do not provide possibilities for the programmer to adapt her code with records to energy. This document presents runtime environments and software frameworks designed to support the programmer at writing energy-aware code: Eon [11], a programming language and runtime system for perpetual systems and EnerJ [10], a Java extension introducing approximate data types.

Background: Identifying reliable oligonucleotide sequences for use in microarray experiments is a complex process. Two key issues are the accuracy of the input sequences and the specificity of the oligonucleotide sequences. We provide a suite of Perl scripts that facilitates the search for gene-specific oligonucleotides for microarray experiments. Genes of interest are first identified in the form of UniGene clusters. The sequences of these clusters were extracted and assembled into contigs to increase their accuracy. The 3' untranslated region (3'UTR) of the contig was parsed. Then, multiple 50mer oligonucleotide sequences with similar melting temperature were obtained from each 3'UTR. These sequences were analyzed for gene specificity. Five Cy3-labeled cDNAs were used to empirically verify the specificity of a set of 1814 50mers.

We have two main purposes in this paper. First, we clarify and extend known results about computation of recursive programs~ emphasizing the difference between the theoretical and practical approaches. Secondly, we present and examine various known methods for proving properties of recursive programs. We discuss in detail two powerful inductive methods, computational induction and structural induction~ illustrating their applications by various examples. We also briefly discuss some other related methods. Our aim in this work is to introduce inductive methods to as wide a class of readers as possible and to demonstrate their power as practical techniques. We ask the forgiveness of our more theoretical-minded colleagues for our occasional choice of clarity over precision.

There are two main purposes in this paper: first, clarification and extension of known results about computation of recursive programs, with emphasis on the difference between the theoretical and practical approaches; second, presentation and examination of various known methods for proving properties of recursive programs. Discussed in detail are two powerful inductive methods, computational induction and structural induction, including examples of their applications.

We present and solve a path optimization problem on programs. Given a set of program nodes, called critical nodes, we find a shortest path through the program's control flow graph that touches the maximum number of these nodes. Control flow graphs over-approximate real program behavior; by adding dataflow analysis to the control flow graph, we narrow down on the program's actual behavior and discard paths deemed infeasible by the dataflow analysis. We derive an efficient algorithm for path optimization based on weighted pushdown systems. We present an application for path optimization by integrating it with the Cooperative Bug Isolation Project (CBI), a dynamic debugging system. CBI mines instrumentation feedback data to find suspect program behaviors, called bug predictors, that are strongly associated with program failure. Instantiating critical nodes as the nodes containing bug predictors, we solve for a shortest program path that touches these predictors. This path can be used by a programmer to debug his software. We present some early experience on using this hybrid static/dynamic system for debugging.

is still very popular as a framework for configuring and building open-source software. Since it is a collection of smaller tools, such as autoconf, automake, libtool, and m4, debugging code that it generates can be difficult. When I wrote my first POSIX shell debugger for bash, one of my initial goals was to be able to debug autotools configure scripts, and I was rather pleased when it worked. It required, however, writing a custom bash module to read the 20,000 lines of shell script into an array much faster than bash was able to. (This module has since been incorporated into bash as built-in function readarray.) It was only after completing this task that I realized a POSIX shell debugger was just one part of the bigger problem of debugging autotools script. Here, I describe the next step in that endeavor, adding debugging to GNU Make[Fou10b, Ber11]. We will see how to use remake and a POSIX shell debugger (the one for bash) together. Makefiles have been around for quite a while, and over time, largely through the success of automake, they have gotten more complex. Make can be somewhat opaque, but after writing the debugger component of remake, I can usually solve make problems very quickly and easily. In many programming languages, such as POSIX shell, Perl, Python, Ruby, and Lisp, type expressions or statements have interactive shells to see what happens when they run. Although GNU Make is every bit as dynamic as these other languages, currently there is no such interactive shell. But the debugger briefly described here can serve as a handy substitute. The programming language Ruby has a really interesting make equivalent called rake. (If you are writing something from scratch, please consider using both Ruby and rake.) But systems administrators often find themselves using tools and code written by others, and much open-source software uses make, via automake. Make is so pervasive that the reference implementations of Ruby use make to build themselves. In keeping with my philosophy of trying to use the smallest hammer that will do the job, this paper shows some of the smallest changes of my forked version of GNU Make. When used in conjunction with one of my POSIX shell debuggers, you can dynamically debug commands issued by GNU Make into the POSIX shell.

Pekerjaan petani adalah profesi yang memiliki risiko terpapar dengan berbagai macam bahaya. Salah satu cara yang bisa dilakukan oleh petani untuk melindungi dirinya dari potensi bahaya tersebut adalah dengan memakai Alat Pelindung Diri (APD). Tujuan pengabdian masyarakat ini adalah memaksimalkan pemahaman petani terkait urgensi penggunaan APD saat bekerja. Metode pelaksanaan pengabdian kepada masyarakat yaitu penyuluhan dengan cara ceramah dan diskusi yang dilakukan pada petani. Penyuluhan ini dilakukan pada bulan Juni 2021 dengan melibatkan 20 orang petani. Hasil evaluasi menunjukan bahwa tingkat pengetahuan petani tentang penggunaan APD saat bekerja masih rendah dengan persentase 15%, dengan adanya kegiatan pengabdian ini diharapkan bisa meningkatkan pengetahuan dan kesadaran petani terkait urgensi pemakaian APD pada saat melakukan kegiatan petanian guna terhindar terjadinya penyakit akibat kerja dan kecelakaan kerja.

Ontologies have seen quite an enormous development and application in many domains within the last years, especially in the context of the next web generation, the Semantic Web. Besides the work of countless researchers across the world, industry starts developing ontologies to support their daily operative business. Currently, most ontologies exist in pure form without any additional information, e.g. missing domain specific or application related information, such as provided by Dublin Core for text documents, denoting the difficulty for academia and industry to identify, find and apply -basically meaning to reuse -ontologies effectively and efficiently. Our contribution consists of a proposal for a metadata standard, so called Ontology Metadata Vocabulary (OMV) which is based on discussions and agreement in the EU IST thematic network of excellence Knowledge Web 1 . OMV is available for download at . The current version 0.7 has been validated as OWL Lite by the WonderWeb OWL Ontology Validator (see ).

We show that two A-calculus terms can be observationally congruent (i.e., agree in all contexts) but their continuation-passing transforms may not be. We also show that two terms may be congruent in all untyped contexts but fail to be congruent in a language with call/cc operators, and that two terms may have the same meaning in a direct semantics but not in a continuation semantics. Hence, familiar reasoning about terms may be unsound in a setting with continuations, demonstrating the need for a theory of continuations.

This paper describes the design and implementation of the VHDL-93 Hardware Description Browser, which is a tool for the intelligent retrieval of information from VHDL designs. The Browser consists of two UNIX processes: a TCL/TK Graphical User Interface and a Prolog search engine. The GUI elicits queries from the user and submits them to the Prolog search engine via a two-way communication pipe. The search engine satisfies queries by traversing a forest of parse trees corresponding to the associated VHDL designs. The results are then sent to the GUI for posting. Two public-domain tools were used to implement the Browser: SWI-Prolog, chosen for its pattern-matching capabilities and its use as an executable specification language, and TCL/TK for its high-level windowing operations and text-substitution capabilities to allow meta-programming.

Copy elimination is an important optimization for implementing functional languages. Though it is related to the problem of copy propagation that has been considered in many compilers and also to storage compaction, the term is used in a more general context where structured values can be updated and the computation tree can be reordered. Because of these two additional possibilities, copy elimination is a hard problem, being undecidable in general. We propose an optimization approach based on abstract interpretation which uses fixpoint iteration for computing addre8a expressiono. These address expressions supply the final target for a computation, eliminating the need to copy values through intermediate results. Our work is in the context or a single

This paper presents the formal definition of TOMAL (Task-Oriented Microprocessor Applications Language), a programming language intended for real-time systems running on small processors. The formal definition addresses all aspects of the language. Because some modes of semantic definition seem particularly well-suited to certain aspects of a language, and not as suitable for others, the formal definition employs several, complementary modes of definition. The primary definition is axiomatic in the notation of Hoare; it is employed to define most of the transformations of data and control states affected by statements of the language. Simple, denotational (but not lattice-theoretic) semantics complement the axiomatic semantics to define type-related features, such as the binding of names to types, data type coercions, and the evaluation of expressions. Together, the axiomatic and denotational semantics define all the features of the sequential language. An operational definition, not included in this paper, is used to define real-time execution, and to extend the axiomatic definition to account for all aspects of concurrent execution. Semantic constraints, sufficient to guarantee conformity of a program with the axiomatic definition, can be checked by analysis of a TOMAL program at compilation.

RÉSUMÉ Dans cet article, la prolifération de data est examinée dans le cadre du processus d'artificialisation du monde et comme effet d'une sémiotique générale pour assurer la permanence et la transformation de la fabrique de nous-mêmes et de notre milieu associé. Cette prolifération de data est réglée sur les mouvements, intensités, des régimes de désirs et sur les processus de subjectivation qui lui sont immanents. Mais elle active en même temps de nouveaux états du Virtuel qui les enveloppent. On prend comme exemples l'urbanisation et le marketing en insistant sur certains aspects de la transformation des intelligences collectives. Ce faisant est esquissée une perspective sur le « trans et post humaniste », expression et exprimé de ces désirs.

This paper deals with the issue of institutional collaboration as an ingredient for good governance, efficient and effective service delivery to the citizenry in a democracy as well as the role of the tripodic super-bureaucracies and their Practit ioners in the processes involved. It takes off with a discussion of the relevant concepts that give both theoretical and practical exp ressions to the Offices of the SSG; HOS and; CSC vis-à-v is their coordinate relational partnerships. In the process, the deep-seated history; functions as well as the problems and challenges of these offices were concretely highlighted. While the benefits of co llaboration among them were identified and critically examined, the need for the super-bureaucracies and bureaucrats in the state to create conducive atmospheres for the continuous sustenance of collaboration was stressed as the only avenue for the civ il service to regain its lost glory and attain relevance in today's global village in line with the ethos of public ad ministration of the 21 st century.

Mass spectrometry imaging (MSI) is of high and growing interest in life science research, but the investment for necessary equipment is often prohibitive for small research groups. Therefore, we developed a basic MSI system from low cost 'Plug and Play' components, which are connected to the Universal Serial Bus (USB) of a standard computer. Our open source software OpenMZxy () enables automatic and manual sampling, as well as the recording of position data. For ionization we used a low-temperature plasma probe (LTP), coupled to a quadrupole mass analyzer. The current set-up has a practical resolution of 1 mm, and a sampling area of 100 × 100 mm, resulting in up to 10,000 sampling points. Our prototype is easy and economical to adopt for different types of mass analyzers. We prove the usability of the LTP-MSI system for macroscopic samples by imaging the distribution of metabolites in the longitudinal cross-cut of a chili (Capsicum annuum, 'Jalapeño pepper') fruit. The localization of capsaicin in the placenta could be confirmed. But additionally, yet unknown low molecular weight compounds were detected in defined areas, which underline the potential of LTP-MSI for the imaging of volatile and semi-volatile metabolites and for the discovery of new natural products. Knowledge about the spatial distribution of metabolites, proteins, or lipids in a given tissue often leads to novel findings in medicine and biology. Therefore, mass spectrometry based imaging (MSI) is becoming increasingly popular in life science research. However, the investment for necessary equipment is often prohibitive for small research groups. We built a prototype with an ambient ionization source, which is easy and economical to adopt for different types of mass analyzers. Therefore, we hope that our system contributes to a broader use of mass spectrometry imaging for answering biological questions.

Ad oggi in Italia il 20-25% degli alunni nella scuola primaria viene segnalato per difficoltà nel calcolo, nonostante diversi ricercatori abbiano evidenziato una naturale predisposizione dell'uomo verso la numerosità. Alla luce di questo elevato numero di segnalazioni diviene necessario ripensare il contesto didattico per sostenere al meglio e fin dalla prima infanzia la naturale evoluzione della cognizione numerica e di calcolo. Nel seguente articolo viene presentato il metodo analogico di Camillo Bortolato, un percorso didattico non concettuale attento ai processi semantici, al ruolo del subitizing e del calcolo a mente. Parole chiave: metodo analogico; abilità numeriche e di calcolo; scuola primaria. Abstract Today in Italy 20-25% of students in primary school is reported to have difficulties with mathematical skills, although several researchers have noticed a man's natural predisposition towards numbers. In the light of this high number of reports becomes therefore nece...

Computational mechanics has been advanced in every area of orthopedic biomechanics. The objective of this paper is to provide a general review of the computational models used in the analysis of the mechanical function of the knee joint in different loading and pathological conditions. Major review articles published in related areas are summarized first. The constitutive models for soft tissues of the knee are briefly discussed to facilitate understanding the joint modeling. A detailed review of the tibiofemoral joint models is presented thereafter. The geometry reconstruction procedures as well as some critical issues in finite element modeling are also discussed. Computational modeling can be a reliable and effective method for the study of mechanical behavior of the knee joint, if the model is constructed correctly. Single-phase material models have been used to predict the instantaneous load response for the healthy knees and repaired joints, such as total and partial meniscect...

Session types are a well-established approach to ensuring protocol conformance and the absence of communication errors such as deadlocks in message passing systems. Implicit parameters, introduced by Haskell and popularised in Scala, are a mechanism to improve program readability and conciseness by allowing the programmer to omit function call arguments, and have the compiler insert them in a principled manner at compile-time. Scala recently gave implicit types first-class status (implicit functions), yielding an expressive tool for handling context dependency in a type-safe manner. DOT (Dependent Object Types) is an object calculus with path-dependent types and abstract type members, developed to serve as a theoretical foundation for the Scala programming language. As yet, DOT does not model all of Scala’s features, but a small subset. Among those features of Scala not yet modelled by DOT are implicit functions. We ask: can type-safe implicit functions be generalised from Scala’s s...

A polymorphic analysis is an analysis whose input and output contain parameters which serve as placeholders for information that is unknown before analysis but provided after analysis. In this paper, we present a polymorphic groundness analysis that infers parameterised groundness descriptions of the variables of interest at a program point. The polymorphic groundness analysis is designed by replacing two primitive operators used in a monomorphic groundness analysis and is shown to be as precise as the monomorphic groundness analysis for any possible values for mode parameters. Experimental results of a prototype implementation of the polymorphic groundness analysis are given. To provide an intuitive insight into abstract interpretation, let us consider how an execution of goal g 0 : append(L 1 , L 2 , L 3 ) transforms one program state θ 0 : {L 1 → [s(0)], L 2 → [0]} which satisfies the condition in the above question into another program state ), 0]}. We deviate slightly from Prolog-like logic programming systems. Firstly, substitutions (program states) have been made explicit because the purpose of a program analysis is to infer properties about substitutions. Secondly, when a clause is selected to satisfy a goal with an input substitution, the goal and the input substitution instead of the selected clause are renamed. This is because we want to keep track of values of variables occurring in the program rather than those of their renaming instances. Let Ψ (Z) = Z ′ for any Z ∈ V.

The problem of forward abstract interpretation of normal logic programs has not been formally addressed in the literature although negation as failure is dealt with through the built-in predicate ! in the way it is implemented in Prolog. This paper proposes a solution to this problem by deriving two generic fixed-point abstract semantics F ♭ P and F ⋄ P for forward abstract interpretation of normal logic programs. F ♭ P is intended for inferring data descriptions for edges in the program graph where an edge denotes the possibility that the control of execution transfers from its source program point to its destination program point. F ⋄ P is derived from F ♭ P and is intended for inferring data descriptions for textual program points.

U istraživačkom radu na temu: „Učinkovitost načina izrade web stranica u srednjoj školi” prikazuju se rezultati anketiranja učenika srednje škole. Dobiveni su odgovori na pitanja temeljem ankete pod nazivom: „Programiranje za web i medijsko prezentiranje”: (1) koji smjer pohađaju anketirani učenici srednje škole, (2) koji je način učenicima najučinkovitiji za učenje web programiranja tj. kodiranja, (3) koji pogled na editor je učenicima najpraktičniji tj. u kojem pogledu je učenicima najlakše raditi web stranice i/ili aplikacije, (4) koji je prema mišljenju učenika svrsishodniji način izrade web stranica, (5) koji je prema mišljenju ispitanika način korištenja CSSa najpraktičniji i najlogičniji. U radu su također temeljem analize sadržaja spomenuti: opisni jezici koji se koriste u srednjim školama u smjeru web dizajner za izradu web stranice, te osnovni pojmovi poput web aplikacije, učenja i mogućih pogleda na izgled web stranice. Rezultati istraživanja su dobiveni temeljem uzorka od 29 učenika srednje škole smjerova web dizajner i medijski tehničar.

Seiring dengan meningkatnya klinik dermatologi, persaingan dalam metode dan teknologi untuk menyembuhkan kulit semakin kuat. Namun salah satu perawatan masalah kulit yang paling sering muncul saat ini adalah perawatan wajah berjerawat. Penelitian ini merupakan penelitian mengenai pengembangan aplikasi visi komputer berbasis web untuk melakukan pendeteksian jerawat pada foto wajah megnggunakan algoritma deep learning berbasis convolution neural network (CNN) dengan Tensorflow. Penelitian ini bertujuan untuk menghasilkan aplikasi yang dapat digunakan oleh kinik dermatorlogi sebagai asesmen perawatan kulit berjerawat. Segmentasi kulit wajah dilkakukan dengan algoritma pendeteksian wajah dan pendeteksian landmark wajah. Proses pelatihan model pendeteksian jerawat menggunakan metode transfer learning dari model SSD ResNet50 V1 FPN 640x640. Hasil dari model pelatihan memiliki nilai sensitivity 77,3%, specificity 47,3%, dan accuracy 63,2%. Aplikasi yang dikembangkan sudah dapat mendeteksi dan menandai jerawat yang ada pada foto wajah dengan kecepatan rata-rata 2,77 detik untuk setiap gambar.

The specialization relationship is offered by the i* modeling language through the is-a construct defined over actors (a subactor is-a superactor). Although the overall meaning of this construct is highly intuitive, its semantics when it comes to the fine-grained level of strategic rationale (SR) diagrams is not defined, hampering seriously its appropriate use. In this report we provide a formal definition of the specialization relationship at the level of i* SR diagrams. We root our proposal over existing work in conceptual modeling in general, and object-orientation in particular. Also, we use the results of a survey conducted in the i* community that provides some hints about what i* modelers expect from specialization. As a consequence of this twofold analysis, we identify, define and specify two specialization operations, extension and refinement, that can be applied over SR diagrams. Correctness conditions for them are also clearly stated. The result of our work is a formal proposal of specialization for i* that allows its use in a well-defined manner.

Puji dan syukur penulis panjatkan kepada Tuhan Yang Maha Esa, karena atas berkat dan rahmat-Nya yang diberikan kepada penulis sehingga penulis dapat menyelesaikan tugas mini riset ini dengan baik sesuai arahan dan tepat pada waktunya. Laporan ini dibuat untuk memenuhi tugas mini riset pada mata kuliah Bahasa Pemrograman. Tak lupa penulis ucapkan terimakasih kepada dosen pengampu mata kuliah Bahasa Pemrograman, Bapak Denny Haris, S.Si., M.Pd. yang telah memberikan bimbingan kepada penulis dalam menyelesaikan tugas ini. Penulis menyadari dalam penyusunan laporan ini, masih terdapat banyak kekurangan sehingga hasil yang diperoleh masih jauh dari sempurna. Oleh sebab itu, penulis mengharapkan saran dan kritik yang membangun dari pembaca. Akhir kata penulis ucapkan terima kasih, semoga laporan ini dapat memberikan manfaat dan bisa menambah pengetahuan kepada penulis dan pembaca.

Infinite loops and redundant computations are long recognized open problems in Prolog. Two ways have been explored to resolve these problems: loop checking and tabling. Loop checking can cut infinite loops, but it cannot be both sound and complete even for function-free logic programs. Tabling seems to be an effective way to resolve infinite loops and redundant computations. However, existing tabulated resolutions, such as OLDT-resolution, SLG-resolution, and Tabulated SLS-resolution, are non-linear because they rely on the solution-lookup mode in formulating tabling. The principal disadvantage of non-linear resolutions is that they cannot be implemented using a simple stack-based memory structure like that in Prolog. Moreover, some strictly sequential operators such as cuts may not be handled as easily as in Prolog. In this paper, we propose a hybrid method to resolve infinite loops and redundant computations. We combine the ideas of loop checking and tabling to establish a linear tabulated resolution called TP-resolution. TP-resolution has two distinctive features: (1) It makes linear tabulated derivations in the same way as Prolog except that infinite loops are broken and redundant computations are reduced. It handles cuts as effectively as Prolog. (2) It is sound and complete for positive logic programs with the bounded-term-size property. The underlying algorithm can be implemented by an extension to any existing Prolog abstract machines such as WAM or ATOAM.

Preface to 1990 edition iii Preface to 2003 edition v CONTENTS datatype SENT = Prop of string | Not of SENT | And of (SENT * SENT) | Or of (SENT * SENT) | Imp of (SENT * SENT) | Eq of (SENT * SENT) | Forall of (TERM * SENT) fun Neg (Not(sent)) = sent | Neg sent = Not(sent); fun alpha(And(s,t)) = true | alpha(Not(Imp(s,t))) =true | alpha(Not(Or(s,t)

Purpose -This work seeks to present the theoretical study considerations and the characteristics of a general design methodology in optimal time for electronic systems using numerical methods and optimal control theory. Through this, the design problem of a system is formulated in terms of optimal control in minimal time. Design/methodology/approach -This general design methodology includes the traditional design strategy (TDS), and the modified traditional design strategy (MTDS), where the model of the system is part of the optimization procedure but an objective function of the optimization process is constructed such as includes the traditional objective function and some penalty functions that feign the model of the system. Many special control functions are introduced artificially to generalize the methodology and produce several design trajectories for the same optimization process -the first and final trajectories correspond to TDS and MTDS, respectively. The combination of these trajectories produce an infinite number of design strategies, some of these are quasi-optimal in time and only one is optimal in time. Findings -Qualitative and numeric results of this iterative process are generated in a personal computer in a Cþþ language elaborated with a visual Cþþ graphic user interface. An algorithm is constructed to form an optimal in time design strategy switching from a MTDS subset to a TDS subset. Results of measured times are analyzed, showing that there is a control input U, such that the objective function is minimized in a minimum time. Originality/value -These ideas are proposed using method of gradient optimization and special acceleration effect.

Kriptografi merupakan teknik untuk pengamanan data dengan cara menyandikan pesan agar maknanya tidak mudah dimengerti. Pengaman file akan mengurasi risiko terhadap penyadapan yang dilakukan oleh pihak yang tidak berkepentingan pada proses pengiriman. Dalam pengiriman data, file PDF (Portable Document Format) banyak gunakan dalam bertukar informasi, sehingga perlu adanya pengamanan terlebih dahulu. Implementasi kriptografi untuk pengamanan file banyak digunakan dalam penelitian dan salah satu contohnya Algoritma TEA (Tiny Encryption Algorithm) . Implementasi algoritma TEA memiliki keamanan yang sangat tinggi dalam pengamanan file . Kata Kunci: Kriptografi, Pengamanan, Implementasi, Algoritma TEA, File PDF

The goal of research was the comparison of legal literacy level of elementary and secondary school teachers. The research design was a descriptive-correlational method. By using stratified sampling method 158 teachers were selected and pariticipated in the study. Research tool was a researcher made questionnaire beasd on the dimentions of legal literacy. The results showed that the teachers of elementary and secondary schools have not appropriate legal literacy. The findings also indicate that there is a significant difference in legal literacy between male and female teachers, and there is no significant difference between the legal literacy of elementary and secondary school teachers.

Listening is a process to construct the meaning between speaker and listener. Unfortunately, in listening students not only have the important things but also difficult things. There are many kinds of song that teacher can use in teaching listening to support their teaching process. One of a song is a nursery rhyme. Hence, the purpose of this study was to find out whether or not there was a significant difference in listening achievement between students who were taught by using nursery rhymes and who were not. In conducting this study, quasiexperimental design was used. In this study, the writer took the sample by using purposive sampling method. The writer used a written test in the form of fill in the blank. The t-test was used to analyze the data. Based on the result of the independent t-test, the t-obtained was 2.022. At the significance level of p<0.05 and the degree of freedom (df) 68. The critical value of ttable was 1.9955. Since the value of t-obtained (2.022) was higher than the value of t-table (1.9955) and p-value (0.047) was lower than ά-value (0.05), the null hypothesis (Ho) was rejected and the alternative hypothesis (Ha) was accepted. In the other words, there was a significant difference in students' listening achievement between students who were taught by using nursery rhyme and that of those who were not.

Penelitian ini menganalisis efektivitas repeat-until dalam validasi input dengan membandingkannya dengan while loop melalui studi kasus program kata sandi. Hasil menunjukkan bahwa repeat-until lebih efektif dalam memastikan input minimal satu kali, sementara while loop lebih efisien jika input awal benar. Dari segi efisiensi kode, repeat-until lebih sederhana, sedangkan while loop lebih fleksibel dalam menghindari eksekusi yang tidak perlu. Untuk meningkatkan keamanan, disarankan penerapan batasan percobaan guna mencegah infinite loop. Pemilihan struktur perulangan yang tepat dapat meningkatkan efisiensi dan efektivitas program.

In an age of rapid technological development, primary schools now teach programming to young students, focusing on developing their computational thinking, problem-solving, and ability to use computers to create solutions. However, fostering computational thinking skills in younger students was a challenging task. The serious game CodeCombat has become a potential resource for instructing young students in primary schools on basic programming principles using Python. This study delved into the role of the serious game CodeCombat in advancing computational thinking competencies among primary school students undertaking Python in Macao. Using a quasiexperimental pretest-posttest approach, we examined 49 grade-one students over a two-week Python programming course facilitated by CodeCombat. The Computational Thinking Scale (CTS), encompassing Creativity, Cooperativity, Algorithmic Thinking, Problem Solving, and Critical Thinking, was employed to measure shifts in computational thinking before and after the teaching experiment. Data analysis through paired-sample t-test highlighted notable progress in computational thinking skills, with marked improvements specifically in Creativity, Critical Thinking, Algorithmic Thinking, and Problem Solving. However, Cooperativity did not exhibit the same upward trend, implying that CodeCombat's impact was more pronounced on solitary cognitive capabilities than collaborative skills. Moreover, the correlation between different dimensions indicated that these computational thinking skills were mutually reinforcing, suggesting that enhancing one might contribute to the development of others. The findings endorsed that game-based learning is effective in programming education and recommended integrating CodeCombat to improve computational thinking in learning Python programming in primary school.

Practice full paper presents an exploratory study investigating the impact of using a Bee-Bot educational robot simulator to enhance learning sequencing concepts and student motivation among Macao primary school students. Sequencing in computational thinking (CT) is understanding and applying the logical order of steps in problem-solving processes. We introduced a Bee-Bot computer simulator for children to learn sequencing. Our study adopted a pretest-posttest method involving 35 grade two students. The Computational Thinking Test for Beginners (BCTt) was used to assess CT abilities, and the Instructional Materials Motivation Survey (IMMS) was utilized to measure learning motivation. We found a significant improvement in sequencing ability and more advanced CT concepts (loops and conditions) and a significant correlation between those concepts. Departing from the existing literature, we delved deeper into how Bee-Bot's influence on sequencing extended to more advanced CT concepts. Moreover, considering the ARCS motivation model, this study examined how Bee-Bot affects learning motivation at the primary education level. After the intervention, the findings revealed that the students showed significantly higher learning motivation, meaning that the different learning activities using the Bee-Bot simulator positively influenced various sub-dimensions of the ARCS model: attention, relevance, confidence, and satisfaction. The correlation between the IMMS scores and the BCTt outcomes further suggested that enhanced motivation positively correlated with better CT abilities.

This is a Very Very Special Manuscript. It captures the gist of Lutalo Joseph Willrich's journey as a leading Software Engineer since his days as a kid, through high school and university, till now. It likewise brings to light his character, vision and plans in relation to his future career interests in the field. Particularly, this is JWL's formal application to join the terrific global team at Canonical, the makers of UBUNTU the popular Linux Operating System.

--------------+--------------

This is my written interview in response to the advertised position at the UK-based technology company, Canonical. It is my original, well-prepared written presentation to highlight my strengths, interests, priorities, experience, ideas and ambition in relation to my profession as an engineer, and it is also aligned with the Request for Clarification (RFC) detail as stipulated in the formal correspondence with and application guidelines shared with me by the hiring lead for the role at Canonical.

Some programmers who do know about con-Can libraries written without explicit support for design by contract benefit from adding contracts? We studied classes from the .NET collections library for implicit contracts and assessed improvements that might result from making them explicit.

A great deal of research into the learning of schemas from XML data has been conducted in recent years to enable the automatic discovery of XML Schemas from XML documents when no schema, or only a low-quality one is available. Unfortunately, and in strong contrast to, for instance, the relational model, the automatic discovery of even the simplest of XML constraints, namely XML keys, has been left largely unexplored in this context. A major obstacle here is the unavailability of a theory on reasoning about XML keys in the presence of XML schemas, which is needed to validate the quality of candidate keys. The present paper embarks on a fundamental study of such a theory and classifies the complexity of several crucial properties concerning XML keys in the presence of an XSD, like, for instance, testing for consistency, boundedness, satisfiability, universality, and equivalence. Of independent interest, novel results are obtained related to cardinality estimation of XPath result sets. A mining algorithm is then developed within the framework of levelwise search. The algorithm leverages known discovery algorithms for functional dependencies in the relational model, but incorporates the above mentioned properties to assess and refine the quality of derived keys. An experimental study on an extensive body of real world XML data evaluating the effectiveness of the proposed algorithm is provided.

Dengue Haemorrhagic Fever (DHF) is a disease caused by the dengue virus transmitted by the Aedes Aegypti mosquito. This disease often spreads in residential areas every year. DHF is a major health problem because it can affect all age groups and cause death, especially in children. Some of the triggers for the spread of DHF are the area geographical conditions, and people’s knowledge and awareness of environmental hygiene. The occurrence of DHF in a certain area is caused by the spread of mosquitoes there, so there is a possibility that other areas will be affected too. Therefore, to determine the factors affecting DHF patients’ recovery rate based on the location where the patients seek treatment, the most fitting model is Spatial Survival with Bayesian MCMC method. This study aims to understand the predicting factors of DHF recovery rate based on the patient’s residence (W ), such as length of hospitalization (Y ), sex (X1), age (X2), patient participation (X3), hematocrit level (...

In challenging economic times, obtaining value for money by ensuring financial integrity and fairer distribution of services are among the top priorities for social and health-care systems globally. However, healthcare billing policies are complex and identifying non-compliance is often narrow-scope, manual and expensive. Maintaining ‘integrity’ is a challenge ensuring that scarce resources get to those in need and are not lost to fraud and waste. Our approach fuses recent advances in dependency parsing with a policy ontology to convert the content of regulatory healthcare policy into human-friendly policy rules, that are amenable to machineexecution, with human oversight. We describe the ontology-guided transformation of textual patterns into a semantically-meaningful knowledge graph of rules, outline our experiments and evaluate results against policy rules obtained from professional investigators. The aim is to make a policy-compliance ‘landscape’ visible to healthcare programs h...

Kilim: A Server Framework with Lightweight Actors, Isolation Types & Zero-copy Messaging Sriram Srinivasan Internet services are implemented as hierarchical aggregates of communicating components: networks of data centers, networks of clusters in a data center, connected servers in a cluster, and multiple virtual machines on a server machine, each containing several operating systems processes. This dissertation argues for extending this structure to the intra-process level, with networks of communicating actors. An actor is a single-threaded state machine with a private heap and a thread of its own. It communicates with other actors using well-defined and explicit messaging protocols. Actors must be light enough to comfortably match the inherent concurrency in the problem space, and to exploit all available parallelism. Our aims are two-fold: (a) treat SMP systems as they really are: distributed systems with eventual consistency, and (b) recognize from the outset that a server is always part of a larger collection of communicating components, thus eliminating the mindset mismatch between concurrent programming and distributed programming. Although the actor paradigm is by no means new, our design points are informed by drawing parallels between the macro and micro levels. As with components in a distributed system, we expect that actors must be isolatable in a number of ways: memory isolation, fault isolation, upgrade isolation, and execution isolation. The application should be able to have a say in actor placement and scheduling, and actors must be easily monitorable. To Alka, my dearest. Life's a wonderful journey, and I have the best travel companion. To Amma and Appa, for the easy laughter, love and encouragement, and the early mornings and late nights they have lavished on me. This dissertation is dedicated to Amma. She would have exclaimed "hai"! To my parents-in-law, for being an additional set of parents. One should be so lucky. To my advisors. Prof. Jean Bacon, for making this excursion possible, for allowing me to gradually discover my interests and strengths without pressure, and for her gentle and selfless guidance to collaborate with other groups. To Prof. Alan Mycroft, for setting distant Bézier control points that so significantly influenced the arc of my learning, for his exhortations and for his unwavering belief that I would get there. To Dr. Ken Moody, for his critical reading of my papers and this document, for his cheerful and enthusiastic cross-pollination of ideas, and tours of beers and wines. To Reto Kramer, for his friendship, guidance, technical knowledge, and a brain the size of a planet. There are a few dissertations lurking in there. To Lauri Pesonen and David Pearce, for the critical reviews, for the long coffee sessions packed with techie talk, and for sharing my enthusiasm for programming languages. To Eiko Yoneki, Pedro Brandão, David Eyers, Dave Evans, Minor Gordon and Niko Matsakis for sharing their impressive knowledge, opinions and good humor, for challenging my biases and assumptions, and for the gentle prodding to get on with it. To Boris Feigin and Kathryn Gray for introducing me to the world of types and semantics, and holding me accountable to rigor.

Summary: Research over the last few years has revealed significant haplotype structure in the human genome. The characterization of these patterns, particularly in the context of medical genetic association studies, is becoming a routine research activity. Haploview is a software package that provides computation of linkage disequilibrium statistics and population haplotype patterns from primary genotype data in a visually appealing and interactive interface. Availability:  http://www.broad.mit.edu/mpg/haploview/ Contact:  jcbarret@broad.mit.edu

Sharing a medical image visually annotated by a region of interest with a remotely located specialist for consultation is a good practice. It may, however, require a special-purpose (and most likely expensive) system to send and view them, which is an unfeasible solution in developing countries such as Vietnam. In this study, we design and implement interoperable methods based on the HL7 Clinical Document Architecture and the eXtensible Markup Language Stylesheet Language for Transformation standards to seamlessly exchange and visually present the shapes of regions of interest using web browsers. We also propose a new integration architecture for a Clinical Document Architecture generator that enables embedding of regions of interest and simultaneous auto-generation of corresponding style sheets. Using the Clinical Document Architecture document and style sheet, a sender can transmit clinical documents and medical images together with coordinate values of regions of interest to reci...