Support Programming Languages Research Articles

Penerapan User-Centered Design Method Guna Pembaruan Substansi Terhadap Informasi dan Data-Data pada Website

The research carried out aims to carry out a substantive update of information and data on the website of the Mathematics Education Study Program, FKIP, UNPATTI. The research carried out applies the User-Centered Design (UCD) method, which is a method in a design that focuses on user needs. Broadly speaking, in using the UCD method, the research conducted was divided into three main stages, namely analysis, design, and evaluation with the process of implementing the UCD method using ISO 9241-210: 2019. Furthermore, the research conducted involved 44 respondents who were used as target users and categorized into two groups, namely the academic community (lecturers and students) and non-academic members (prospective students and alumni). Based on the results of the research conducted, 9 formulations of user requirements were obtained, followed by making a website interface design in the form of a prototype (wireframe). Furthermore, the resulting prototype is then evaluated by providing a series of task scenarios to guide users in using the website. The evaluation was carried out using a qualitative survey method, namely interview activities aimed at obtaining feedback regarding user experience on the appearance of the website design interface as well as obtaining recommendations and suggestions for further development. Based on the evaluation carried out, the result was that the resulting website design met user needs. This is because the design is produced as a solution to user needs, by a series of requirements submitted by users. In addition, the design of the website interface also provides a satisfying user experience. Therefore, the research carried out does not occur repetition (iteration), so it can proceed to the implementation stage. Furthermore, at the prototype implementation stage, the results of the website design are then converted into an interface display using the Content Management System (CMS) Framework and supporting programming languages ​​such as HTML, CSS, PHP, and Javascript. The website of the Mathematics Education Study Program which has been successfully updated for the substance of both the information and data contained therein can then be accessed via the official link of the Mathematics Education Study Program, FKIP, UNPATTI..

Comparison of using Apache OpenWhisk and Google Cloud Functions for development of serverless applications on Google Cloud Platform

A comparison of using proprietary cloud platform Google Cloud Functions and open source platform Apache OpenWhisk for writing serverless applications based on the Google Cloud Platform was made. The following criteria were chosen for comparison: supported programming languages, convenience and speed of development and deployment of functions, possible ways to pass parameters to functions, options for monitoring the status of functions, speed of the cold start. As a result, main advantages and disadvantages of each platform were identified. Recommendations for use cases are given based on the features of the platforms. The results of the study can be used for further studies in the field of FaaS technologies, as there are a lot of solutions in this area that also need to be compared.

Code Smells Detection and Visualization: A Systematic Literature Review

Context: Code smells (CS) tend to compromise software quality and also demand more effort by developers to maintain and evolve the application throughout its life-cycle. They have long been catalogued with corresponding mitigating solutions called refactoring operations. Objective: This SLR has a twofold goal: the first is to identify the main code smells detection techniques and tools discussed in the literature, and the second is to analyze to which extent visual techniques have been applied to support the former. Method: Over 83 primary studies indexed in major scientific repositories were identified by our search string in this SLR. Then, following existing best practices for secondary studies, we applied inclusion/exclusion criteria to select the most relevant works, extract their features and classify them. Results: We found that the most commonly used approaches to code smells detection are search-based (30.1%), and metric-based (24.1%). Most of the studies (83.1%) use open-source software, with the Java language occupying the first position (77.1%). In terms of code smells, God Class (51.8%), Feature Envy (33.7%), and Long Method (26.5%) are the most covered ones. Machine learning techniques are used in 35% of the studies. Around 80% of the studies only detect code smells, without providing visualization techniques. In visualization-based approaches several methods are used, such as: city metaphors, 3D visualization techniques. Conclusions: We confirm that the detection of CS is a non trivial task, and there is still a lot of work to be done in terms of: reducing the subjectivity associated with the definition and detection of CS; increasing the diversity of detected CS and of supported programming languages; constructing and sharing oracles and datasets to facilitate the replication of CS detection and visualization techniques validation experiments.

ParaMonte: A high-performance serial/parallel Monte Carlo simulation library for C, C++, Fortran

ParaMonte (standing for Parallel Monte Carlo) is a serial and MPI/Coarray-parallelized library of Monte Carlo routines for sampling mathematical objective functions of arbitrary-dimensions, in particular, the posterior distributions of Bayesian models in data science, Machine Learning, and scientific inference. The ParaMonte library has been developed with the design goal of unifying the **automation**, **accessibility**, **high-performance**, **scalability**, and **reproducibility** of Monte Carlo simulations. The current implementation of the library includes **ParaDRAM**, a **Para**llel **D**elyaed-**R**ejection **A**daptive **M**etropolis Markov Chain Monte Carlo sampler, accessible from a wide range of programming languages including C, C++, Fortran, with a unified Application Programming Interface and simulation environment across all supported programming languages. The ParaMonte library is MIT-licensed and is permanently located and maintained at [this https URL](this https URL).

A practical tutorial on bagging and boosting based ensembles for machine learning: Algorithms, software tools, performance study, practical perspectives and opportunities

Ensembles, especially ensembles of decision trees, are one of the most popular and successful techniques in machine learning. Recently, the number of ensemble-based proposals has grown steadily. Therefore, it is necessary to identify which are the appropriate algorithms for a certain problem. In this paper, we aim to help practitioners to choose the best ensemble technique according to their problem characteristics and their workflow. To do so, we revise the most renowned bagging and boosting algorithms and their software tools. These ensembles are described in detail within their variants and improvements available in the literature. Their online-available software tools are reviewed attending to the implemented versions and features. They are categorized according to their supported programming languages and computing paradigms. The performance of 14 different bagging and boosting based ensembles, including XGBoost, LightGBM and Random Forest, is empirically analyzed in terms of predictive capability and efficiency. This comparison is done under the same software environment with 76 different classification tasks. Their predictive capabilities are evaluated with a wide variety of scenarios, such as standard multi-class problems, scenarios with categorical features and big size data. The efficiency of these methods is analyzed with considerably large data-sets. Several practical perspectives and opportunities are also exposed for ensemble learning.

Review and comparative analysis of machine learning libraries for machine learning

The article is an overview. We carry out the comparison of actual machine learning libraries that can be used the neural networks development. The first part of the article gives a brief description of TensorFlow, PyTorch, Theano, Keras, SciKit Learn libraries, SciPy library stack. An overview of the scope of these libraries and the main technical characteristics, such as performance, supported programming languages, the current state of development is given. In the second part of the article, a comparison of five libraries is carried out on the example of a multilayer perceptron, which is applied to the problem of handwritten digits recognizing. This problem is well known and well suited for testing different types of neural networks. The study time is compared depending on the number of epochs and the accuracy of the classifier. The results of the comparison are presented in the form of graphs of training time and accuracy depending on the number of epochs and in tabular form.

E- TRACER STUDY BASED ON EXPERT SYSTEMS (A CASE STUDY AT AMIK INDONESIA)

Tracer Study is one method used by several universities, especially in Indonesia to get feedback from alumni. The feedback obtained from these alumni is needed by the university in their efforts to improve and develop the quality and education system. The aim of this study was to develop an e-tracer study that made it easier for AMIK Indonesia's campuses to monitor their graduates and develop intelligent system-based e-tracer studies. Broadly speaking, this study uses data collection methods through literature studies, interviews and observations. While research design uses experiments because it produces products that are decision support systems. The method used to support this research is the FMADM method using the SAW method calculation and the design method used is the waterfall method, which is a systematic and partial software development approach that starts at the level and progress of the system in all analyzes, designs, codes, tests, and maintenance. From the results of the study, it can be concluded that the tracker study was built with the Codeigniter and NODE framework. JS uses supporting programming languages such as HTML, CSS, Jquery, JavaScript, JSON, AJAX, Bootstrap as media in interface design. Whereas PHP as server-side and MySQL as database. while the method used for testing the application is White Box Testing and the Black Box method.

A Study on the SIL Codes based Java Compiler for Supporting the Java Contents in the Smart Cross Platform

The Smart Cross Platform is a virtual machine based solution that supports various programming languages and platforms, and its aims are to support programming languages like C++, Java and Objective-C and smart phone platforms such as Android and iOS. Various contents that developed by supported language on the Smart Cross Platform can be execute on Android and iOS platforms at no additional cost, because it has the platform independent characteristic by using SIL(Smart Intermediate Language) as an intermediate language. In this paper, we will introduce a Java compiler for the Smart Cross Platform to support Java contents. Proposed compiler translates given Java programs into stack based intermediate SIL codes to execute on the SVM(Smart Virtual Machine). Thus, existing JVM’s contents can be easily ported and executed on the Android or iOS with SVM.

Open Code Coverage Framework: A Framework for Consistent, Flexible and Complete Measurement of Test Coverage Supporting Multiple Programming Languages

Test coverage is an important indicator of whether software has been sufficiently tested. However, there are several problems with the existing measurement tools for test coverage, such as their cost of development and maintenance, inconsistency, and inflexibility in measurement. We propose a consistent and flexible measurement framework for test coverage that we call the Open Code Coverage Framework (OCCF). It supports multiple programming languages by extracting the commonalities from multiple programming languages using an abstract syntax tree to help in the development of the measurement tools for the test coverage of new programming languages. OCCF allows users to add programming language support independently of the test-coverage-criteria and also to add test-coverage-criteria support independently of programming languages in order to take consistent measurements in each programming language. Moreover, OCCF provides two methods for changin the measurement range and elements using XPath and adding user code in order to make more flexible measurements. We implemented a sample tool for C, Java, and Python using OCCF. OCCF can measure four test-coverage-criteria. We also confirmed that OCCF can support C#, Ruby, JavaScript, and Lua. Moreover, we reduced the lines of code (LOCs) required to implement measurement tools for test coverage by approximately 90% and the time to implement a new test-coverage-criterion by over 80% in an experiment that compared OCCF with the conventional non-framework-based tools.

Constructive Dynamic Program Slicing Research

Program slicing is a promising technique for providing automated support for various important software engineering activities. There exists hundreds of scientific studies on the theory of slicing. However, slicing is still not widely applied in software industry. Therefore, there is a need to survey and characterize the conducted research and to analyze what problems hinder progress. This paper answers to that need by providing a survey of constructive dynamic program slicing research focusing on publication series with high visibility. The survey identified 12 dynamic slicers related to which 12 aspects were studied. The analysis revealed many issues which can be seen both as concerns and possibilities for improvements. These included the following: 1) Scarcity of high-visibility journal articles. 2) General lack of focus of the conducted research. 3) Limitations regarding the supported programming languages. 4) Mainly unutilized potential synergy with established research regarding various aspects; including visualization and navigation features. 5) Limitations of the conducted empirical studies. Paying attention to these issues is important for being able to make faster scientific progress in the area and to have bigger practical impact on software industry in the future.

An overview of the sparse basic linear algebra subprograms

We discuss the interface design for the Sparse Basic Linear Algebra Subprograms (BLAS), the kernels in the recent standard from the BLAS Technical Forum that are concerned with unstructured sparse matrices. The motivation for such a standard is to encourage portable programming while allowing for library-specific optimizations. In particular, we show how this interface can shield one from concern over the specific storage scheme for the sparse matrix. This design makes it easy to add further functionality to the sparse BLAS in the future.We illustrate the use of the Sparse BLAS with examples in the three supported programming languages, Fortran 95, Fortran 77, and C.

Exploring Quasi-Concurrency in Introductory Computer Science

Most programming courses taught today are focused on managing batch-oriented problems. It is primarily because parallel computers are not commonly available, therefore problems with concurrent nature could not be explored. This consequence, at the same time, causes student's under preparation to meet the challenge of modern multi-process computation technologies. This article demonstrates an easy solution for implementing concurrent programming projects in computer labs. This solution does not require special hardware support or special programming languages. The goal is to facilitate a means to deal with the concept and usefulness of multi-process software systems in the early stage of computer science curriculum. We also include detailed descriptions on a few creative and interesting concurrent examples to illustrate this idea.

Handling floating-point exceptions in numeric programs

There are a number of schemes for handling arithmetic exceptions that can be used to improve the speed (or alternatively the reliability) of numeric code. Overflow and underflow are the most troublesome exceptions, and depending on the context in which the exception can occur, they may be addressed either: (1) through a “brute force” reevaluation with extended range, (2) by reevaluating using a technique known as scaling , (3) by substituting an infinity or zero, or (4) in the case of underflow, with gradual underflow. In the first two of these cases, the offending computation is simply reevaluated using a safer but slower method. The latter two cases are cheaper, more automated schemes that ideally are built in as options within the computer system. Other arithmetic exceptions can be handled with similar methods. These and some other techniques are examined with an eye toward determining the support programming languages and computer systems ought to provide for floating-point exception handling. It is argued that the cheapest short-term solution would be to give full support to most of the required (as opposed to recommended) special features of the IEC/IEEE Standard for Binary Floating-Point Arithmetic. An essential part of this support would include standardized access from high-level languages to the exception flags defined by the standard. Some possibilities outside the IEEE Standard are also considered, and a few thought on possible better-structured support within programming languages are discussed.