Program Statements Research Articles

Performance Analysis between Quantum Computers and Silicon Computers: A Preliminary Investigation

The purpose of this study was to perform a preliminary investigation on the performance between a high-performance silicon computer and a quantum computer in terms of programming control statements. The study hypothesizes that the quantum computer would outperform the silicon computer in terms of processing performance. There were three types of experimental performance analysis scenarios conducted under the context of basic programming statements which are the ‘for loop’, ‘while’, and, ‘if else’ control statements. To obtain the average of the completion times, the experiments were repeated five times. The obtained results suggest that the silicon computers outperformed the quantum processing capabilities.

Similarities and Differences Between Physician Assistant Program and Medical School Mission Statement Themes.

The purpose of this study was to examine the concordance of US physician assistant (PA) program mission statements with those of US public- and private-sponsored medical schools. With the exception of a broader medical school focus on research, the authors hypothesized that little difference in mission statement congruence would be found in a comparison of medical schools and PA programs. Mission statements of 209 of the 210 accredited US PA programs as of May 2016 were obtained and analyzed. Keywords and phrases were identified, coded, and analyzed using NVivo. Themes that previously reported medical school mission statement analyses (including education, research, service, primary care, diversity, prevention, provider distribution, and cost control) were examined. Additional themes of evidence-based medicine (EBM), interprofessional care, patient safety, and quality improvement were included in the analyses. Analyses revealed similar emphasis in both PA programs and medical schools on themes of education, prevention, and cost control, with dissimilar emphases on themes of research, service, primary care, diversity, and provider distribution. Physician assistant programs were more likely to emphasize interprofessional care than EBM, patient safety, or quality improvement. In the comparison of mission statements of medical schools and PA programs, much less congruence was found than had been hypothesized. Although this study examined the similarities and differences between the mission statements of US medical schools and PA programs, it did not examine the extent to which programs succeeded in meeting the stated missions. Additional research is necessary to understand the factors that determine whether mission statements are actualized in measurable deliverables.

ПРИОРИТЕТЫ ГОСУДАРСТВЕННОЙ ПОЛИТИКИ РОССИЙСКОЙ ФЕДЕРАЦИИ В ОБЛАСТИ СФЕР ИСПОЛЬЗОВАНИЯ РУССКОГО ЯЗЫКА

With the aim to evaluate the condition and functioning of the Russian language in Russian Federation, authors realized the content-analysis of official documents of the Russian Federation in the fields of use of Russian language. A general accent was made on the conceptualization of priorities and detections of the state language policy of contemporary Russia. To illustrate the process, a special attention is paid to the analysis of messages from the President, his program statements on the given theme, and basic political-doctrinal document of the country. Authors considered strategic priories, reflected in doctrinal documents of the state, such as Russian Schools Abroad Concept Document and the Concept of state support policy and promotion of the Russian language abroad as bases for humanitarian cooperation. Analysis of basic documents of the country demonstrated the complicity and multidimensionality of the phenomenon of the State language policy, it covers the multiple spheres of public life and directions of activity of the State, it has complex and comprehensive influence in contemporary conditions.&nbsp

Парламентська опозиція та уряд в Словаччині в 2010–2014 рр.

It was examined the nature and character of the interaction between the government and parliamentary opposition in Slovakia in the period from 2010 till 2014 in the context of the flow of social and political processes. A change in the political behavior of the parliamentary opposition before and after the early parliamentary elections of 2012 was traced.The arrival in 2010 to power of the opposition showed that in the party system of Slovakia there was a real inter-party political competition and contested action. At the same time, the parties began to more clearly express their attitude to power, and their actions became more predictable. The new government coalition, as a rule, was formed by parties between which during the elections there were convergence of positions and similarity of program statements on the government policy. It also included new opposition political parties with which ties were established prior to the election, which, at the same time, had similar critical positions towards the socioeconomic policies of the previous government and the quality of democracy.Gradually, a new inter-party model of interaction between the parliamentary and extra-parliamentary opposition appeared in the country, which starting from the electoral period was transferred to the interelectoral one. This kind of interaction between the representatives of the political opposition made them more stable and allowed to more clearly outline the discontinuation between the political forces in the context of “pro-government – opposition”. Agreed actions during the elections made behavior between political partners more predictable in the status of pro-governmental. Belonging to the opposition camp in the past made impossible any coalition agreements between them with Smer-SD.With the advent of parties of entrepreneurial type, competition between the pro-government and opposition parties went into the technological stage, introducing corrections into the traditional line of division of “left – right”.

Nature inspired algorithm using particle swarm approach with variations in inertia weights for automatic test data generation based on dominance concepts

In software testing, testing of all program statements is a very crucial issue as it consumes a lot of time, effort and cost. The time, effort and cost can be reduced by using an efficient technique to reduce the test case and a good optimization algorithm to generate efficient, reliable and unique test cases. In this paper, the concept of dominance tree is used which covers all edges/statement by using minimum test case. Nature inspired algorithm - PSO (Particle Swarm Optimization) by applying different inertia weights is used to generate unique, reliable and efficient test cases to cover the leaf nodes of dominance tree. Inertia weights like fixed inertia weight (FIW), global-local best (GLbestIW), Time-Dependent weight (TDW), and proposed GLbestRandIW weights are used with PSO to investigate the effect of inertia weights on the execution of PSO with respect to number of generation required, percentage coverage , total test cases generated to test the software under consideration.

Ten Years of “Object First”

Abstract Teaching programming to newbies is still an ongoing challenge. Strongly worded, either students can program when they enter the university or they never learn it. The challenge is to address as many students as possible in such a way that they get an understanding of programming and become able to complete the course successfully. In contrary to traditional structured programming the Objects-First approach starts with classes and objects and introduces data types and programming statements whenever they are necessary to define the structure or behaviour of objects. The author has used the Objects-First approach for more than ten years. Almost the same content has been used all over the years but the way of teaching has changed. For the last two years the author has used elements of just-in-time teaching. The paper reviews the different teaching approaches based on the exams results. The author argues that teaching style has a minor influence. The social atmosphere among the students is a more crucial factor.

Precise slicing of interprocedural concurrent programs

Program slicing is an effective technique for analyzing concurrent programs. However, when a conventional closure-based slicing algorithmfor sequential programs is applied to a concurrent interprocedural program, the slice is usually imprecise owing to the intransitivity of interference dependence. Interference dependence arises when a statement uses a variable defined in another statement executed concurrently. In this study, we propose a global dependence analysis approach based on a program reachability graph, and construct a novel dependence graph calledmarking-statement dependence graph (MSDG), in which each vertex is a 2-tuple of program state and statement. In contrast to the conventional program dependence graph where the vertex is a statement, the dependence relation in MSDG is transitive. When traversing MSDG, a precise slice will be obtained. To enhance the slicing efficiency without loss of precision, our slicing algorithm adopts a hybrid strategy. The procedures containing interaction statements between threads are inlined and sliced by the slicing algorithm based on program reachability graphs while allowing other procedures to be sliced as sequential programs. We have implemented our algorithm and three other representative slicing algorithms, and conducted an empirical study on concurrent Java programs. The experimental results show that our algorithm computes more precise slices than the other algorithms. Using partial-order reduction techniques, which are effective for reducing the size of a program reachability graph without loss of precision, our algorithm is optimized, thereby improving its performance to some extent.

FPA-FL: Incorporating static fault-proneness analysis into statistical fault localization

Despite the proven applicability of the statistical methods in automatic fault localization, these approaches are biased by data collected from different executions of the program. This biasness could result in unstable statistical models which may vary dependent on test data provided for trial executions of the program. To resolve the difficulty, in this article a new fault-proneness-aware statistical approach based on Elastic-Net regression, namely FPA-FL is proposed. The main idea behind FPA-FL is to consider the static structure and the fault-proneness of the program statements in addition to their dynamic correlations with the program termination state. The grouping effect of FPA-FL is helpful for finding multiple faults and supporting scalability. To provide the context of failure, cause-effect chains of program faults are discovered. FPA-FL is evaluated from different viewpoints on well-known test suites. The results reveal high fault localization performance of our approach, compared with similar techniques in the literature.

The Model of Value-Based Curriculum for Medicine and Surgery Education in Iran

Background: The need for internalization of values for professional development in medicine and surgery, and sense of duty linked to the practice of the medical professionalism were recognized in Iran. With regard to the shortcomings currently existed in the curriculum of the medical education, in 2013, the design of an operational model for the curriculum based on values was placed on the agenda through the PhD thesis. Objectives: The aim of this study is to develop the operational model of the value-based curriculum for medicine and surgery education with respect to indigenous values in Shahid Beheshti University of Medical Sciences, Tehran, Iran. Methods: Our value-based curriculum model was developed through qualitative ontology foundations of Hugh McKenna concept analysis. Finally we developed our operational model by comparing our domestic extracted attributes with what is existed and experienced in other countries through systematized searching, determined the process of value curriculum, the sequence of process steps, menu and taxonomy for operationalization of each step, and recommended practices for each step for integration of values in medicine and surgery education in Iran. Results: Ten steps of curriculum model for integration of values in medicine and surgery education include: general need assessment of values, designing hierarchy system of values, need assessment of targeted learners’ values, developing value programme statement, determination of value outcomes and objectives, production of value rich content, value based teaching and learning methods, value based settings, value themes management, determination of values evaluation and assessment methods. Conclusions: This Indigenous operational model of value based curriculum proposes the process with exact sequence for the concrete implementation of values education in medicine and surgery, accordance with our country offers. The operational value based curriculum model was prepared in order to develop a practical guideline for value based experiments in medicine and surgery, helps to move from the information level and expressing factual knowledge, to the conceptual and judgment level, understanding the connections and interactions between facts and analysis them.

A unified approach of program verification

Abstract The subject of this paper is a program verification method that takes into account abortion caused by partial functions in program statements. In particular, boolean expressions of various statements will be investigated that are not well-defined. For example, a loop aborts if its execution begins in a state for which the loop condition is undefined. This work considers the program constructs of nondeterministic sequential programs and also deals with the synchronization statement of parallel programs introduced by Owicki and Gries [7]. The syntax of program constructs will be reviewed and their semantics will be formally defined in such a way that they suit the relational model of programming developed at Eőtvős Loránd University [3, 4]. This relational model defines the program as a set of its possible executions and also provides definition for other important programming notions like problem and solution. The proof rules of total correctness [2, 5, 8, 9, 7] will be extended by treating abortion caused by partial functions. The use of these rules will be demonstrated by means of a verification case study.

Homophily in higher education: Historicizing the AERA member-to-fellow pipeline using theories of social reproduction and social networks

This study examines select demographics of the American Educational Research Association (AERA) Fellows ( n = 644), and whether or not the cohorts of AERA Fellows are becoming more diverse in racial and gender terms in relation to the inaugural year of Fellows in 2008. This study tests the mission statement of this exclusive program to ‘… recognize excellence in research and be inclusive of the scholarship that constitutes and enriches education research as an interdisciplinary field’. Our findings suggest that homophily – a sociological phenomenon that describes the ways in which individuals and institutions prefer sameness – is a real problem in higher education, and programs such as the AERA Fellowship are not accomplishing their mission to recognize the research of faculty of color, women faculty, and faculty in interdisciplinary fields. In contrast to the AERA Fellows mission statement, we find that the Fellowship program relies on homophilous social networks in selecting AERA Fellows and, in turn, reinforces social reproduction in higher education.

Computing Dynamic Slices of Feature--Oriented Programs Using Execution Trace File

Feature-Oriented Programming (FOP) is a general paradigm for synthesizing programs in software product lines. A family of software systems constitutes a software product line (SPL). The unique characteristics of feature-oriented programs such as mixin layers, refinements of classes, refinements of constructors, constants, refinements, etc. pose special difficulties in the slicing of these programs. This paper proposes a dynamic slicing algorithm for feature-oriented programs. The algorithm is named Execution Trace File Based Feature-Oriented Dynamic Slicing (ETBFODS) algorithm. The ETBFODS algorithm uses a dependence based representation called Dynamic Feature Composition Dependence Graph (DFCDG) and an execution trace file to store execution history of the program for a given input. The dynamic slice is computed by traversing the DFCDG in breadth--first or depth-first wise and then mapping the resultant traversed vertices to the program statements.

MSVL: a typed language for temporal logic programming

The development of types is an important but challenging issue in temporal logic programming. In this paper, we investigate how to formalize and implement types in the temporal logic programming language MSVL, which is an executable subset of projection temporal logic (PTL). Specifically, we extendMSVL with a few groups of types including basic data types, pointer types and struct types. On each type, we specify the domain of values and define some standard operations in terms of logic functions and predicates. Then, it is feasible to formalize statements of type declaration of program variables and statements of struct definitions as logic formulas. As the implementation of the theory, we extend theMSV toolkit with the support of modeling, simulation and verification of typedMSVL programs. Applications to the construction of AVL tree and ordered list show the practicality of the language.

Computer literacy through dance: the dancing computer project

PurposeThe purpose of this paper is to present the design and evolution of the Dancing Computer project. Dancing Computer is an ongoing research project at the Michigan State University, which is developing a system that aims to increase computer literacy in elementary-aged children by teaching them first to read code before they write it. The main objective is to educate children on basic concepts of computer science.Design/methodology/approachChildren are given tablet computers that present a simple program line-by-line that they execute as they pretend to be a computer. The programs are acted out on a portable dance floor consisting of colored tiles, and the program statements instruct the child to move, turn and act out dance poses and terminology.FindingsThe Dancing Computer prototype was tested in six different locations in 2016, reaching approximately 250 students. Learning was demonstrated by significant improvements in both task duration and error performance as students performed the activities. The most common errors were movement errors, where participants failed to move the correct number of squares.Social implicationsThis project has the potential to increase the level of computer literacy for thousands of children. This project’s goal is to increase understanding of what a computer does, what a program does and the step-by-step nature of computer programs.Originality/valueThis is a unique and a different approach – the norm being to start students off writing code in some language. In Dancing Computer stages children as readers of programs, allowing them to pretend to be a computer in a fun and engaging activity while also learning how computers execute real programs.

Improving spectral‐based fault localization using static analysis

SummaryDebugging is crucial for producing reliable software. One of the effective bug localization techniques is spectral‐based fault localization (SBFL). It helps to locate a buggy statement by applying an evaluation metric to program spectra and ranking program components on the basis of the score it computes. SBFL is an example of a dynamic analysis – an analysis of computer program that is performed by executing it with sufficient number of test cases. Static analysis, on the other hand, is performed in a non‐runtime environment. We introduce a weighting technique by combining these two kinds of program analysis. Static analysis is performed to categorize program statements into different classes and giving them weights based on the likelihood of being buggy statement. Statements are finally ranked on the basis of the weights computed by statements' categorization (static analysis) and scores computed by SBFL metrics (dynamic analysis). We evaluate the performance of our technique on Siemens test suite and Flex (having seeded bugs seeded by expert developers), Sed (having mixture of real and seeded bugs), and Space (having real bugs). In our evaluation, proposed weighting technique improves the performance of a wide variety of fault localization metrics up to 20% on single bug datasets and up to 42% on multi‐bug datasets. Copyright © 2017 John Wiley & Sons, Ltd.

A teaching media of using the busy bit and SDCC in displaying character string on LCD in MCU 8051 IDE

The author developed an instructional media of active learning teaching of microcontroller 8051 by using busy bit routine before displaying a string of characters on Liquid Crystal Display (LCD). Initially this simulator simulated how to configure the pins of both LCD pins and Microcontroller Pins by using C programming statements to enable them to configure and communicate properly, and then it will be followed by how to use the busy bit to develop a routine as substitute for using wait loop to wait for the LCD to be ready before giving the next commands to be done by the LCD controller. It can be seen obviously from the simulator that using busy bit routine effectively dodges one from calculating the exact time of the waiting time of the loop before giving the controller the next job or work to be executed. Finally, it showed how to display the string of character stored in a specific memory location of the Microcontroller on the LCD screen. This program of simulator was developed in Micro Controller Unit (MCU) 8051 Integrated Development Environment (IDE) widely known as MCU 8051 IDE and by using C language of Small Devices C Compiler (SDCC).

Abstract Program Slicing

In the present article, we formally define the notion of abstract program slicing , a general form of program slicing where properties of data are considered instead of their exact value. This approach is applied to a language with numeric and reference values and relies on the notion of abstract dependencies between program statements. The different forms of (backward) abstract slicing are added to an existing formal framework where traditional, nonabstract forms of slicing could be compared. The extended framework allows us to appreciate that abstract slicing is a generalization of traditional slicing, since each form of traditional slicing (dealing with syntactic dependencies) is generalized by a semantic (nonabstract) form of slicing, which is actually equivalent to an abstract form where the identity abstraction is performed on data. Sound algorithms for computing abstract dependencies and a systematic characterization of program slices are provided, which rely on the notion of agreement between program states.

EVALUATION OF THE INTERNATIONAL SYSTEM IN RUSSIAN OFFICIAL DISCOURSE AND ACADEMIC ANALYSIS

The article draws a comparison between Russian official and expert foreign policy discourses, focusing on representations of the power balance and relations between major states as the defining features of international system. The author attempts to identify actual and potential contribution of academics in the Russian foreign policy thinking. Conceptual documents and programme statements of national leadership elevate the notion of 'polycentric world' as a value in itself, which guides national actions on international arena. Although, until the late 2000s its rise was perceived as a welcome, but remote prospect, since the U.S. failures in Iraq and Afghanistan as well as global financial crisis expectations regarding it construction increased. They are accompanied, however, by a more critical appraisal of the concept. The mainstream Russian expert community shares normative appreciation of the polycentric global system as an intrinsic good. It also nourishes expectations of its emergence with almost inevitable certainty. Most of the time, it does not take into account concerns incorporated in the Western IR theories, regarding destabilizing effect of competition between multiple centers of power. The article demonstrates that both Russian political leadership and expert community perceive polycentric system as an international 'great power concert', which is just one and relatively rare form of it. It requires not only virtual parity in capabilities of several players, but also the lack of serious disputes among them. Meanwhile, in the Russia academic community there is a place for a critical tradition, which associates current decentralization of the international system with its chaotization and weakening governance. In recent years this approach gains additional prominence. However, the Russian debates on global order lacks more elaborated discussion regarding sources of power in international system as well as explanation of the binding ties, which would facilitate creation of concert rather than competition among emerging powers.

MENGUKUR OBJEKTIVITAS LIPUTAN MEDIA DENGAN RUMUS COEFFICIENT OF IMBALANCE (Studi Kasus Hasil Penelitian Metode Analisis Isi Kuantitatif Pemberitaan Kampanye Pemilu 1999 di Harian Jawa Pos dan Republika Terhadap Partai Golkar dan PDI-P)

Abstract General election which aims at selecting the best national leadership for the next five year office term is peoples democracy party event which requires the nation attention. Mass media plays an important role to have the event successful by covering general election campaign, along with its rule and procedures, the political party program statements, the prospective candidate track record, and general election irregularities in independent, neutral and impartial manner. By doing so, media functions as voter education to enable them to choose the candidate rationally based on unbiased and balanced media coverage. In addition, media have to control and monitor general election procedures violation committed by each general election stakeholders. If it is the case, the general election will run freely and fairly. To achieve this, media should cover objectively by means separating his subjective opinion from the fact being covered. This type of media coverage, among other things, will undoubtedly bring about free and fair general election. The paper attempts to describe the relation between media and politics, as well as the objectivity of East-Java Province based Jawa Pos newspapers sand Muslim-oriented Republika daily during general election 1999 campaign period. Besides, it tries to measure their coverage objectivity employing the Coefficient of Imbalance formulae especially with regard to the parties namely the presumed pro status quo Golkar party and the reformist PDI-P party. The paper puts its emphasis on the discussing the objectivity method for media coverage using quantitative content analysis. The papers concludes by presenting an example of content analysis result using the formulae on the 1999 general election media coverage which found that each newspaper was biased to each the political party with Jawa Pos favored PDI-P and Republika supported Golkar. Keywords: Objectivity, Content Analysis, Coefficient of Imbalance, Inferences, judgment DOI : https://doi.org/10.26905/nomosleca.v2i1.340

IPSETFUL: an iterative process of selecting test cases for effective fault localization by exploring concept lattice of program spectra

Fault localization is an important and challenging task during software testing. Among techniques studied in this field, program spectrum based fault localization is a promising approach. To perform spectrum based fault localization, a set of test oracles should be provided, and the effectiveness of fault localization depends highly on the quality of test oracles. Moreover, their effectiveness is usually affected when multiple simultaneous faults are present. Faced with multiple faults it is difficult for developers to determine when to stop the fault localization process. To address these issues, we propose an iterative fault localization process, i.e., an iterative process of selecting test cases for effective fault localization (IPSETFUL), to identify as many faults as possible in the program until the stopping criterion is satisfied. It is performed based on a concept lattice of program spectrum (CLPS) proposed in our previous work. Based on the labeling approach of CLPS, program statements are categorized as dangerous statements, safe statements, and sensitive statements. To identify the faults, developers need to check the dangerous statements. Meantime, developers need to select a set of test cases covering the dangerous or sensitive statements from the original test suite, and a new CLPS is generated for the next iteration. The same process is proceeded in the same way. This iterative process ends until there are no failing tests in the test suite and all statements on the CLPS become safe statements. We conduct an empirical study on several subject programs, and the results show that IPSETFUL can help identifymost of the faults in the program with the given test suite. Moreover, it can save much effort in inspecting unfaulty program statements compared with the existing spectrum based fault localization techniques and the relevant state of the art technique.