Search

Abstract: The paper describes a system for executable papers for publishers enabling them to reuse content and to generate further advances of science and engineering. The executable algorithmic descriptions within a paper are presented in natural language sentences and basic code, thereby making long term compatibility absolute. Authors are required to use publicly numerical libraries on the Internet or references to publications with executable papers. As used by authors the system automatically creates a web of algorithmic knowledge on the Internet. Novelty of new algorithms in publications can be evaluated by automated tools available to authors, reviewers and readers of scientific papers published. [Copyright &y& Elsevier]

Abstract: Adessowiki is a collaborative platform for scientific programming and document writing. It is a wiki environment that carries simultaneously documentation, programming code and results of its execution without any software con- figuration such as compilers, libraries and special tools at the client side. This combination of a collaborative wiki environment, central server and execution of code at rendering time enables the use of Adessowiki as an executable paper platform, since it fulfills the need to disseminate, validate, and archive research data. [Copyright &y& Elsevier]

In computer programming, a pure function is a function that has no side-effects. Pure actions, which are assimilated to pure functions, play an important role within the SARL agent-programming language. Indeed, several constructs of the language, e.g. the guard conditions of the event handlers, cannot contain calls to unpure actions. In many existing languages, the purity of the action is declared by the developer, who could put a marker on the action in some languages, or simply implicit. The contribution of this paper is an algorithm to automatically determine if an action is pure in order to allow the SARL compiler to mark the actions as pure for the developer. The proposed algorithm is successfully implemented in the SARL compiler. [ABSTRACT FROM AUTHOR]

In all engineering discipline in universities, introductory programming is an essential part of the curriculum. However, many students find great difficulty with the learning of programming without instructor assistance and it becomes a barrier to their further studies of computer science and other disciplines. Intelligent Programming Tutors (IPTs) assist students to overcome difficulties in solving programming exercises, when they don't know how to proceed or they unable to find an error in their current state. Such a student may benefit from hints, guiding her toward a more complete and/or more correct version and allowing her to continue working on her own (Aleven et al., 2016). However, traditional IPTs take much time to create the expert knowledge because in computer programming tasks, the space of possible solutions is too large (Piech et al., 2015b). New development methods have emerged in recent years, which provide hints without an expert model. These techniques are based on data-driven approaches and/or program repair techniques and provide hints in the form of edits (such as inserting or deleting a piece of code). Students can apply these hints in their current state to change it into a more correct and/or more complete state. This paper aims to provide a best understanding of these new techniques and presents a comparative study between different approaches of automatic hint generation by presenting the forces and weaknesses of each approach. [ABSTRACT FROM AUTHOR]

To solve multi-attribute decision making problem of limited schemes, multiple attribute indexes is generally synthesized to a single evaluation index. So it is necessary to determine the weighting coefficient of each attribute index. In this paper we propose a method of multi-attribute decision making based on basic point and weighting coefficients range. Weighting coefficient of each index may be calculated with the method in this paper, provided weighting range of each index, basic point and its comprehensive evaluation value are given. The method not only involves the subjective estimating of the people, but also avoids the comparison and evaluation between various attributes. If comprehensive evaluation value of basic point is difficult to determine, one can give a probing value, modify the value gradually until satisfying consequence is obtained. [ABSTRACT FROM AUTHOR]

Virtual reality (VR) gains increasing attention as a method of implementing training systems in different domains, in particular, when real training is potentially dangerous for the trainees or the environment, or requires expensive equipment. The essential element of professional training is domain-specific knowledge, which can be represented using the semantic web approach. It enables reasoning as well as complex queries against the representation of training scenarios, which can be valuable for teaching purposes. However, the available methods and tools for creating VR training systems do not use semantic knowledge representation. Currently, the creation, modification, and management of training scenarios require skills in programming and computer graphics. Hence, they are unavailable to domain experts without expertise in IT. In this paper, we propose an ontology-based representation and a method of modeling VR training scenarios. In our approach, trainees' activities, potential mistakes as well as equipment and its possible errors are represented using domain knowledge understandable to domain experts. We illustrate the approach by modeling VR training scenarios for electrical operators of high-voltage installations. [ABSTRACT FROM AUTHOR]

The paper discusses the constructive framework for writing hypervisor on the top of the VM. Hypervisor plays a vital role in monitoring VM in cloud. Hypervisors are system programs that virtualizes the running of the architecture. These are critical, safe, small and hard program to write and debug or evaluate . Hypervisors are system software programs that virtualize the architecture they run on. They are typically small, safety-critical, and hard to debug, which makes them a feasible and interesting target for formal verification. Previous functional verifications of system software were all based on interactive theorem proving, requiring substantial human effort complemented by expert proven knowledge. In this paper we present the frame work of a hypervisor and basic implementation module of hypervisor and simulator module of hypervisor. The virtual environment is controlled and managed by software known as the hypervisor . The hypervisor executes at a higher privilege level than the “guest” operating systems; the hypervisor can access any memory assigned to any guest operating system. Furthermore, a guest operating system cannot access resources in the system unless permitted to do so by the hypervisor. [ABSTRACT FROM AUTHOR]

In this paper, Ethernet bridging on Field Programmable Gate Arrays (FPGA) is being discussed. Ethernet has been used widely in the embedded design industry nowadays. The transferring data between FPGAs are essential with the advancement of embedded system technologies. Ethernet bridging between FPGAs has been chosen because its reliability on transferring data. There are a lot of companies producing FPGA boards, one of it is ALTERA. ALTERA has manufactured different kinds of boards to suite the requirement of engineers nowadays. One of the examples of it is the DE2-115 FPGA board. This board has a soft-core processor in it which is called Nios II. Network bridging on DE2-115 FPGA requires the programming of the Nios II. In this paper, the network bridge system on FPGA is set up and an input which is the data is send through the network. The result expected from the experiment is the input is properly displayed and it is send successfully in through the network. [ABSTRACT FROM AUTHOR]

In software testing through reverse engineering, the programming semiotics are to be transformed to Unified Modeling Language (UML) semiotics. This process needs the abstraction of UML syntactics, semantics from the programming system. As a preamble, this paper attempts to develop an automated methodology to abstract object oriented technology (OOT) components required for the class diagram from the programming system to be tested for its correctness & completeness. The methodology comprises of initial classing & slicing the programming system on the referenced attributes of the entry with no defined attributes and then using the sole referenced entry and sole defined entry on these sliced programming units the candidate key/s are identified which are used to find individual object structure of the class in our classing technique. The programming system is sliced based on individual class structure and then these slices are used to obtain the object methods through whose nature of the parameters we identify the interrelationship between the classes and their types. The intermediate clairvoyant study of parameter indicates the visibility of the object methods. This paper contains the detailed procedure for each method of our automated methodology. Therefore, their correctness and completeness is self evident. The proposed procedures are based on sound logical positivism and implicitly incorporate good database design and good software engineering principles. This paper reengineers the programming system into various appropriate UML design diagrams so as to reduce the enormity of the syntactics and semantics of programming language into limited syntactics and semantics. This enables to develop the correct and complete software testing methodology. [ABSTRACT FROM AUTHOR]

This paper describes the CIRANO platform, a cloud Integrated Development Environments (IDE) that substantially supports Model Driven Development (MDD) and team collaboration, in order to facilitate the development of cloud–based applications. The paper presents the state of the art in the field and discusses the technical details of CIRANO architecture and its modular implementation. The main features of the proposed platform are presented as a case study application concerning the update and porting of an existing collaboration system, called Comidor. The paper discusses the findings in comparison with existing tools and proposes extensions of the platform as future work. [ABSTRACT FROM AUTHOR]

All traditional cryptographic algorithms used in the network communication environments, relied on mathematical models and computational assumptions, are actually unsafe and apt by many attackers (quantum and man-in-the-middle attacks). Therefore, nowadays Quantum Key Distribution (QKD) promises a secure key agreement by using quantum mechanical systems. QKD becomes a significant trend of new cryptographic revolution. This paper explains how cryptography exploits the quantum mechanics in order to achieve an encryption/decryption process. Additionally, this paper provides a standard simulation for QKD-BB84 protocol and describes improvement key generation and key distribution mechanisms. Then, validation, results and efficiency of BB84 protocol are presented using different security configurations. Finally, our results indicated that the QKD is susceptible to corporate with different security applications and achieve the key availability for such applications. However, it suffers from the higher rate of authentication cost. [ABSTRACT FROM AUTHOR]

In software testing through reverse engineering, the programming semiotics are to be transformed to Unified Modeling Language (UML) semiotics. This process needs the abstraction of UML syntactics, semantics from the programming system. As a preamble, this paper attempts to develop an automated methodology to abstract object oriented technology (OOT) components required for the class diagram from the programming system to be tested for its correctness & completeness. The methodology comprises of initial classing & slicing the programming system on the referenced attributes of the entry with no defined attributes and then using the sole referenced entry and sole defined entry on these sliced programming units the candidate key/s are identified which are used to find individual object structure of the class in our classing technique. The programming system is sliced based on individual class structure and then these slices are used to obtain the object methods through whose nature of the parameters we identify the interrelationship between the classes and their types. The intermediate clairvoyant study of parameter indicates the visibility of the object methods. This paper contains the detailed procedure for each method of our automated methodology. Therefore, their correctness and completeness is self evident. The proposed procedures are based on sound logical positivism and implicitly incorporate good database design and good software engineering principles. This paper reengineers the programming system into various appropriate UML design diagrams so as to reduce the enormity of the syntactics and semantics of programming language into limited syntactics and semantics. This enables to develop the correct and complete software testing methodology. [ABSTRACT FROM AUTHOR]

Integer Factorization is a vital number theoretic problem frequently finding application in public-key cryptography like RSA encryption systems, and other areas like Fourier transform algorithm. The problem is computationally intractable because it is a one-way mathematical function. Due to its computational infeasibility, it is extremely hard to find the prime factors of a semi prime number generated from two randomly chosen similar sized prime numbers. There has been a recently growing interest in the community with regards to evolutionary computation and other alternative approaches to solving this problem as an optimization task. However, the results still seem to be very rudimentary in nature and there's much work to be done. This paper emphasizes on such approaches and presents a critic study in details. The paper puts forth criticism and ideas in this aspect. [ABSTRACT FROM AUTHOR]

Due to the increasing amount of data, knowledge aggregation, representation and reasoning are highly important for companies. In this paper, knowledge aggregation is presented as the first step. In the sequel, successful knowledge representation, for instance through graphs, enables knowledge-based reasoning. There exist various forms of knowledge representation through graphs; some of which allow to handle uncertainty and imprecision by invoking the technology of fuzzy sets. The paper provides an overview of different types of graphs stressing their relationships and their essential features. An example is included for didactical reasons. [ABSTRACT FROM AUTHOR]

Mastering the programming is no easy job because proper science of software does not yet exist. Solid and fundamental theories that apply universally are needed. Universalities ease mastering any kind of job. To ease mastering the programming, software science must answer what are the universal main concepts in programming, and the categories of token. This paper proposes punctuator and qualifier as two supplementary concepts of programming. Together with value, operation, type, and object; punctuator and universal serve as six main concepts of programming. This paper shows the six main concepts of programming serves as universal categories of tokens. The new theory for code-translation takes into account the universal categories for tokens. [ABSTRACT FROM AUTHOR]

Constraints that express relationships among objects are used to model and solve various problems arising from fields such as artificial intelligence, software, and computer graphics. Soft constraints are often important for applications that involve complex relationships among objects. This paper proposes a new method for solving soft constraints. The method treats soft nonlinear con- straints with hierarchical preferences, and computes solutions that satisfy as many constraints with strong preferences as possible. It adopts the method of Lagrange multipliers to enable the accurate computation of local solutions. The paper also presents the result of a preliminary experiment using a simple geometric example. [ABSTRACT FROM AUTHOR]

The Business Process (BP) requirements is specified in the form of software requirements specification (SRS). This SRS serves as a base for software development. The software needs to be developed in a syllogized software development life cycle (SDLC) stages. The SRS which denote the requirements of BP is used as input to the analysis stage from which the paradigm dependent components are to be abstracted. Hither to the components are abstracted manually with the exception of hiatuses of semi-automated methods for few of the components. The SRS is construed with reference to the specific paradigm through which the design is to be developed. Unfortunately, no complete automated methodology exists for the abstraction of all paradigm dependent components. The automated methodology eliminates the possible human errors which would have ripple effect to damage the entire software. This paper develops an innovative, unique methodology to resurrect the SRS statements as modular statements. Further develops an automated methodology for abstraction of control and data flow graphs. Further it develops an automated methodology for abstraction of useful components required for the class diagram. The class diagram emphasizes both structural and behavioral aspects. This facility is effectively used to abstract object class attributes, object methods, visibility, signature, return type etc. Information systems are developed through software projects which use the specific software requirements specification (SRS) provided for them as the base. The SRS contains details of the information system through which appropriate software can be developed. The information systems are also viewed perceptively with different pragmatics like work, work process or usecase. The usecase is one of the prime perspective views whose sum forms the information system. In this paper, an attempt is made to abstract object class, object class attributes, object methods, interrelationships between object classes and starting with/ending with actor from unformatted, unstructured SRS text. This is achieved through our own developed classing and slicing techniques to identify respectively the class structure & object methods. Then usecase is developed through the interrelationships between object methods of different classes and start with or end with the actor. The stages involve moulding the SRS, designing control flow graph for the SRS & data flow table for the SRS statements, developing appropriate classing and slicing criteria, creating actor & actors’ interface attributes table, create slicing criteria for each usecase and then slice relevant statements for each usecase. Here, we have attempted to use Weiser modified algorithm 1 to abstract exact usecase. The slicing criterion is obtained through the intersection of actor's interface attributes and the referenced/defined attributes present between two consecutive actors. Attempts have been made to resolve synonyms & heteronyms present in the SRS. The correctness & completeness of the proposed methodology depends on the realization of actor & actors’ interface attributes. [ABSTRACT FROM AUTHOR]

The primary cause for the slowness of the Border Gateway Protocol (BGP) convergence delay is the Minimum Route Advertisement Interval (MRAI). The MRAI is a timer with a default value of 30 seconds, which forces the BGP routers to wait for at least that amount of time before sending an advertisement for the same prefix. This process can delay important BGP advertisements. To date, there has been no specific value used by all the networks around the Internet. This paper aims to find the optimum value for the MRAI timer that maximally reduces the convergence time without increasing the number of advertisement messages. The optimal MRAI value founded by this paper reduced the convergence time by minimum 45%. [ABSTRACT FROM AUTHOR]

Enterprise Information Systems maintain data with respect to various business processes. These processes consist of business operations restricted by business rules expressed as preconditions and post-conditions. Each rule must be considered and enforced throughout the system, from user interface to persistence storage. Such rule evaluation in multiple contexts results in both significant rule restatement and high maintenance complexity, as there is no single focal point for capturing and reusing these rules. In this paper, we apply the Aspect-Oriented Design Approach to the persistence layer to simplify business rules management, enforce business rules throughout the system and consequently decrease development and maintenance efforts. Our preliminary results show that it is possible to define business rules in a single place and then apply them automatically in a persistence layer. We retrieve data sets restricted by given operation post-conditions with respect to current execution context without any manual rule restatement. This paper provides a small case study emphasizing the benefits and future challenges. [ABSTRACT FROM AUTHOR]

In computer science, robustness is the ability of a computer system to cope with errors during execution. Robust codes are new nonlinear systematic error detecting codes that provide uniform protection against all errors, whereas classical linear error detection code detects only a certain class of errors. Therefore, defence by the linear codes can be ineffective in many channels and environments, when error distribution is unknown. The probability of error masking can increase depending on codeword distribution. However, mapping the most probable codewords to a predefined set can reduce the maximum of the error masking distribution. The algorithm proposed in this paper is based on the second-order wavelet decomposition of B-splines under non-uniform nets. In this paper, we propose a general approach to the algorithm construction of spline-wavelet decompositions of linear space over an arbitrary field. This approach is based on the generalization of calibration relations and functional systems, which are biorthogonal to basic systems of relevant space. The obtained results permit the construction of second-order spline-wavelet robust code. [ABSTRACT FROM AUTHOR]

The Flower Pollination Algorithm (FPA) is a novel bio-inspired optimization algorithm that mimics the real life processes of the flower pollination. In this paper, we review the applications of the Single Flower Pollination Algorithm (SFPA), Multi-objective Flower Pollination Algorithm an extension of the SFPA and the Hybrid of FPA with other bio-inspired algorithms. The review has shown that there is still a room for the extension of the FPA to Binary FPA. The review presented in this paper can inspire researchers in the bio-inspired algorithms research community to further improve the effectiveness of the PFA as well as to apply the algorithm in other domains for solving real life, complex and nonlinear optimization problems in engineering and industry. Further research and open questions were highlighted in the paper. [ABSTRACT FROM AUTHOR]

In this paper we have presented validation of proposed usability driven web based software process model (UdWbM) through simulation. We have used Software Engineering gaming tool SimSE for making simulation of a system (taken as case study) by following the steps proposed by the model. Simulation was also developed for some existing models using the same constraints. UdWbM is then compared with some existing models to show the results. Paper also shows comparative study of existing models with UdWbM through literature. [ABSTRACT FROM AUTHOR]

Big data is an ocean of data sets. The revolution of big data can transform the world and business overnight. The data and information can be outsourced to an untrusted cloud while maintaining the velocity and veracity of big data. Big data helps in decision making. It also laid foundation for advancement in science, medicine and Business. Mapreduce and Hadoop frameworks are used to improve the processing speed of data. Can big data really revolutionize our world? This research paper explores how the explosion of information will impact on our lives? This paper illustrates the power of big data. Big data may lead to more accurate analyses. The combination of cloud and Big data is a beginning of a beautiful friendship. E-commerce companies take advantage of the wide variation in sales tax and local taxes by operating from low geographical regions like Flipkart. Big data analytics can improve efficiency and effectiveness across the broad range of government responsibilities, by improving existing processes and operations and enabling completely new ones. Moreover it is used in the areas of medicine, crime, education and business. It increases the storage capacity, processing power and also risk of security. So big data is not only a volume, it refers as technology. [ABSTRACT FROM AUTHOR]

Due to the self configuring and infra-structure less nature of MANET(Mobile Ad-hoc Network) optimization crunches, QOS(Quality of Service) contention and security breaches tend to occur. So, to rivet security of the mobile ad-hoc networks the proposed algorithm sifted in this paper cogitate biometric perception as the most innovative solution which incorporates exclusive iris features elicited by iris image procurement and perception system. QOS based issues of MANET are elucidated by genetic algorithm in this approach which results in optimized performance of the network. Significance of the approach conferred in the paper is stated through improved and better results compared with conventional secured approach of MANET. [ABSTRACT FROM AUTHOR]

In software industry, automation plays a major role for improving the test efficiency of software test organisation. For ensuring test coverage satisfaction and thereby reducing risk, projects use more people for manual testing or use automation tools or techniques to improve the level of test automation. The choice of selection depends on reduction in project cycle time or reduction in time for test. This paper discusses about software automation steps and explains an algorithm for addressing the issues faced in system management automation of various services like DHCP, DNS, Firewall etc. Paper is written based on author's experience using various automation frame works. [ABSTRACT FROM AUTHOR]

Abstract: Schedule slips and cost overruns are warning signs that the test program will be impacted. To minimize the risk and ensure that reliability is not compromised, this paper outlines a system engineering approach to analyze the risk and develop a mitigation strategy to reduce the cost overruns without impacting operational or functional reliability. This paper will describe space instrument system that was deployed, and provide a hypothesis on how the strategy could have minimized the schedule slips within the bounds of cost and quality. [Copyright &y& Elsevier]

Abstract: To develop competitive vehicles with ever increasing complexity, automotive designers need to improve their ability to explore a broad range of system architectures efficiently and effectively. Whereas traditional vehicle systems are based on internal combustion (IC) engines, today''s environmentally conscious vehicle manufacturers must consider alternatives to the IC engine- only systems such as hybrid or electric systems. To design a good vehicle, it is necessary to analyze each of these system architectures from a variety of perspectives including performance, fuel economy, or even thermal behavior. Creating all the necessary analysis models for all possible system architectures manually is very time-consuming, expensive, and error-prone. To overcome such challenges, a novel approach has been developed for partly automatically generating subsystem model templates to support the integration of analysis models in a consistent and convenient fashion. The approach starts from a Vehicle Reference Architecture (VRA) model defined in the Systems Modeling Language (OMG SysMLTM). After specialization of this VRA into a specific vehicle program model, this SysML model is automatically transformed into Modelica and Simulink templates for the corresponding analysis models. These templates embody interfaces that fit into a system-level integrated model so that individual subsystem experts can focus on modeling the physical or controls behavior of their particular subsystem without having to worry about subsequent integration issues. The subsystem template models guarantee consistency in the integration phase. The entire approach introduced in this paper is called the Vehicle Architecture Modeling Framework (VAMF), which includes the SysML VRA model, the corresponding analysis templates, and the transformation tools developed to support the approach. Throughout this paper, a specific (realistic but sanitized) vehicle program and a full pedal acceleration analysis test scenario are used as demonstration examples. [Copyright &y& Elsevier]

Computer programming is a complex domain both to teach and learn. This incited endeavors to find methods that could mitigate at least some of the existing barriers. In the last years, automatic assessment has been playing an important role in reducing the burden of teachers in the assessment of students' attempts to solve programming exercises and fostering the autonomy of students by allowing them to practice in any place and at any time with timely feedback. Even more recent development is the use of gamification in computer programming education in order to raise the enjoyment and engagement of students. Despite its rising spread, until now, there is not a programming exercise specification format addressing the needs of gamification, such as the definition of challenges, the underlying storyline, including the links to other exercises, or the rewards for solving challenges in form of points, badges or virtual items. Such a data format would allow the exchange of ready-to-use programming exercises along with the gamification-related data among different educational institutions and courses, providing instructors a possibility to make use of gamification in their courses without having to invest their own time in defining gamification rules themselves. In this paper, we analyze a set of concepts related to programming gamification developed in our previous work to identify the requirements for the specification of a gamified exercise format. [ABSTRACT FROM AUTHOR]

Sorting a set of unsorted items is a task that happens in computer programming while a computer program has to follow a sequence of precise directions to accomplish that task. In order to find things quickly by making extreme values easy to see, sorting algorithm refers to specifying a technique to arrange the data in a particular order or format where maximum of communal orders is in arithmetic or lexicographical order. A lot of sorting algorithms has already been developed and these algorithms have enhanced the performance in the factors including time and space complexity, stability, correctness, definiteness, finiteness, effectiveness, etc. A new approach has been proposed in this paper in sorting algorithm called MinFinder to overcome some of the downsides and performs better compared to some conventional algorithms in terms of stability, computational time, complexity analysis. [ABSTRACT FROM AUTHOR]

Abstract: This paper proposes APTCC, Auto Parallelizing Translator from C to CUDA, a translator from C code to CUDA C without any directives. CUDA C is a programming language for general purpose GPU (GPGPU). CUDA C requires us a special programming manner differently from C. Although there are several pieces of research to reduce this diffculty, the result of those researches still compels us to beware of GPU architecture. It is better however that we are able to concentrate on the algorithm. Hence we propose translation of C code into CUDA C optimized to the target GPU architecture without directives, where the complexity of the GPU hardware is transparent to the programmer. In translating a C code to a CUDA C code, two questions have to be answered. The first question is how to select the code fragments which should be translated into CUDA C, and the second question is how to translate the selected code fragments into CUDA C. To the first question, this paper proposes a heuristic selection scheme based on the loop structure of the source code. The current implementation of APTCC selects nested loops for the target of translation. To the second question, APTCC translate all the statements in the body of outermost loop into CUDA C. This paper explains the detailed implementation of APTCC and compares the results of performance comparison of a few experimental input source codes. [Copyright &y& Elsevier]

Abstract: The Message Passing Interface (MPI) standard continues to dominate the landscape of parallel computing as the de facto API for writing large-scale scientific applications. But the critics argue that it is a low-level API and harder to practice than shared memory approaches. This paper addresses the issue of programming productivity by proposing a high-level, easy-to-use, and effcient programming API that hides and segregates complex low-level message passing code from the application specific code. Our proposed API is inspired by communication patterns found in Gadget-2, which is an MPI-based parallel production code for cosmological N-body and hydrodynamic simulations. In this paper—we analyze Gadget-2 with a view to understanding what high-level Single Program Multiple Data (SPMD) communication abstractions might be developed to replace the intricate use of MPI in such an irregular application—and do so without compromising the effciency. Our analysis revealed that the use of low-level MPI primitives—bundled with the computation code—makes Gadget-2 diffcult to understand and probably hard to maintain. In addition, we found out that the original Gadget-2 code contains a small handful of—complex and recurring—patterns of message passing. We also noted that these complex patterns can be reorganized into a higherlevel communication library with some modifications to the Gadget-2 code. We present the implementation and evaluation of one such message passing pattern (or schedule) that we term Collective Asynchronous Remote Invocation (CARI). As the name suggests, CARI is a collective variant of Remote Method Invocation (RMI), which is an attractive, high-level, and established paradigm in distributed systems programming. The CARI API might be implemented in several ways—we develop and evaluate two versions of this API on a compute cluster. The performance evaluation reveals that CARI versions of the Gadget-2 code perform as well as the original Gadget-2 code but the level of abstraction is raised considerably. [Copyright &y& Elsevier]

Abstract: Recently announcement of a physical realization of a fundamental circuit element called memristor by researchers at Hewlett Packard (HP) attracted so much interests and opened a new field in configurable or programmable electronic systems because it has properties of the perfect switch. Combination of this newly found circuit element with nanowire crossbar interconnect technology, creates a powerful platform which is called memristor crossbar. It has been demonstrated that this structure can offer the potential of creating configurable electronic devices which can have applications in signal processing and artificial intelligence. In this paper, we will highlight the rule that Genetic Algorithm (GA) can play in programming these kinds of structures. Without loss of generality, crossbar-based arbitrary waveform generating circuit proposed by Mouttet is considered for demonstrating the capabilities of GA. Simulation results presented in this paper illustrate the effectiveness of GA in programming of memristor crossbars. [Copyright &y& Elsevier]

Abstract The paper describes a new programming technology - ISC, developed on the basis of the principles and approaches of the planning languages for the behavior of intelligent agents. At the same time, functions were refined and new added: reasoning, building a world model, identifying causes and effects, associating, self-research of their capabilities and the possibilities of surrounding objects. In the function of the ISC, the methods of programming perception, reaction and adaptation to new connected means of interaction between an intellectual object and the outside world, new modalities are also included. [ABSTRACT FROM AUTHOR]

Internet of Things (IoT) has enabled physical devices and virtual objects to be connected to share data, coordinate, and automatically make smart decisions to server people. Recently, many IoT resource slicing studies that allow managing devices, IoT platforms, network functions, and clouds under a single unified programming interface have been proposed. Although they helped IoT developers to create IoT services more easily, the efforts still have not dealt with the monitoring problem for the slice components. This could cause an issue: thing states could not be tracked continuously, and hence the effectiveness of controlling the IoT components would be decreased significantly because of updated information lack. In this paper, we introduce an information-centric approach for multiple sources monitoring issue in IoT. The proposed model thus is designed to provide generic and extensible data format for diverse IoT objects. Through this model, IoT developers can build smart services smoothly without worrying about the diversity as well as heterogeneity of collected data. We also propose an overall monitoring architecture for the information-centric model to deploy in IoT environment and its monitoring API prototype. This document also presents our experiments and evaluations to prove feasibility of the proposals in practice. [ABSTRACT FROM AUTHOR]

To learn different art forms, such as painting, calligraphy, or music, students usually learn by watching and evaluating several works of art to hone and improve their skills. Similarly, when learning programming, previous studies in education have suggested that referring to programs written by other programmers was an effective method to improve programming skills. However, beginners or novices in programming with low skill levels cannot evaluate or comprehend advanced programs written by expert programmers because of their inability to read them. Therefore, in this paper, we propose a novel code-review method using check sheets to help improve the skills of beginner level programmers. In particular, in order to create a check sheet that enables effective learning, we choose from various question items and to create an optimal check sheet that is applicable for programming lessons. The proposed method applies Item response theory (IRT), which is widely used for estimating the difficulty level and discrimination ability of the questions in an examination. In this study, IRT was applied to the items on the check sheet to eliminate ineffective. [ABSTRACT FROM AUTHOR]

Abstract: The common approach enabling a resource constrained device to get connected to the Internet is through programming instructions and transferring it to an embedded device. This procedure involves various tools and cross-compiling of the code depending on the platform architecture. In practical IoT applications, where a huge number of nodes exist, this process becomes almost impossible due to the heterogeneous platforms and protocols involved and the deployment conditions. This paper introduces a flexible and scalable approach that enhances modifiability and programmability through client-server-server-client architecture. It allows changing the behavior of the system after deployment through a lightweight script written with a domain specific language, DoS-IL, and stored in a gateway at the fog layer. An embedded resource browser is used to request and execute the script. The results of analysis for this model and the tools developed along the way are discussed. [ABSTRACT FROM AUTHOR]

Abstract: This paper presents baseline synthesis and microsimulation of life-stage transitions within an agent-based integrated Transport Land Use and Energy (iTLE) modeling system. The baseline synthesis involves generation of synthetic population and vehicle ownership level synthesis. Synthetic population in generated in two stages: (1) generation of synthetic population at the dissemination area (DA) level, controlling for household- and individual-level attributes; and (2) allocation of the synthetic population at the micro-spatial unit of parcel using a logit-link model. Vehicle ownership synthesis involves a multinomial logit model to determine the vehicle ownership level for the base year. The life-stages of the synthetic population are simulated longitudinally at a yearly simulation time-step within the iTLE framework. The simulated life-stages include: aging, birth, death, in-migration, out-migration, and household formation. The iTLE is coded in the C# DotNET programming platform. A 100% synthetic population is generated for Halifax, Canada. The baseline synthesis and life-stage simulation results are satisfactory. For instance, population synthesis results suggest that around 62.81% of the DAs show an error percentage range of -5% to +5%. [ABSTRACT FROM AUTHOR]

Abstract: Stream processing is about processing continuous streams of data by programs in a workflow. Continuous execution is discretized by grouping input stream tuples into batches and using one batch at a time for the execution of programs. The programs may generate stream data which may be input to subsequent programs in the workflow. They may also read as well as write some data in persistent store. Continuous queries are processed in the workflow. A continuous query (CQ) consists of a sequence of one time queries. There is a general agreement that each CQ normally spans over several batches of stream inputs. Apart from this, different notions of CQs exist in the literature, their one time queries ranging from just transactions (that is, single executions of programs) to composite transactions. In this paper, we look at how CQs can be defined generically and propose a correctness criterion for concurrent executions of CQs. [ABSTRACT FROM AUTHOR]

While modern parallel computing systems provide high performance resources, utilizing them to the highest extent requires advanced programming expertise. Programming for parallel computing systems is much more difficult than programming for sequential systems. OpenMP is an extension of C++ programming language that enables to express parallelism using compiler directives. While OpenMP alleviates parallel programming by reducing the lines of code that the programmer needs to write, deciding how and when to use these compiler directives is up to the programmer. Novice programmers may make mistakes that may lead to performance degradation or unexpected program behavior. Cognitive computing has shown impressive results in various domains, such as health or marketing. In this paper, we describe the use of IBM Watson cognitive system for education of novice parallel programmers. Using the dialogue service of the IBM Watson we have developed a solution that assists the programmer in avoiding common OpenMP mistakes. To evaluate our approach we have conducted a survey with a number of novice parallel programmers at the Linnaeus University, and obtained encouraging results with respect to usefulness of our approach. [ABSTRACT FROM AUTHOR]

Bulk synchronous parallelism (BSP) offers a simple model of parallelism yet allows to take realistically into account the communication costs of parallel algorithms. BSPlib and its variants are programming libraries for the C language that support the BSP style. Bulk Synchronous Parallel ML (BSML) is a library for BSP programming with the functional language OCaml. BSML programs can be seen as sequential programs working on a parallel data structure (seq of par) while a BSPlib program is written in the SPMD style and understood as a parallel composition of communicating sequential programs (par of seq). The communication styles of BSML and BSPlib are also quite different. This paper shows that BSPlib-style communications can be implemented on top of BSML, without the need to extend BSML parallel primitives. [ABSTRACT FROM AUTHOR]

The OpenACC programming model simplifies the programming for accelerator devices such as GPUs. Its abstract accelerator model defines a least common denominator for accelerator devices, thus it cannot represent architectural specifics of these devices without losing portability. Therefore, this general-purpose approach delivers good performance on average, but it misses optimization opportunities for code generation and execution of specific classes of applications. In this paper, we propose stencil extensions to enable efficient code generation in OpenACC. Our results show that our stencil extensions may improve the performance of OpenACC in up to 28% and 45% on GPU and CPU, respectively. [ABSTRACT FROM AUTHOR]

The ΣC (pronounced “Sigma-C” ) language is a general purpose data-flow language that was initially targeted for Kalray’s MPPA embedded many-core processor. It is designed as an extension of C, allowing the Cyclo-Static Data-Flow (CSDF) model of computation. Until now, it was only available for the first generation of the MPPA chip. In this paper, we show how we built an OpenMP back-end for the ΣC language, and we used this compiler to evaluate some of the assets of stream programming and some limitations of the current implementation, by evaluating the performance on several benchmark programs. This new back-end could open the way to utilize this language to study embedded stream programming concepts or to program HPC applications [ABSTRACT FROM AUTHOR]

In this paper, we analyze the diversity-multiplexing tradeoff (DMT) performance of opportunistic relaying coded cooperation (ORCC) and distributed space-time coding coded cooperation (DSTCCC) with arbitrary number of relays. Exact DMT curves are derived for two scenarios, i.e., when the source is included in cooperation (denoted by S1) or not (denoted by S2), by formulating the problem as linear optimization problem. The DMT curves of ORCC and DSTCCC are found to be identical for S1 (or S2), and S1 has better DMT performance than S2. Numerical results are provided to illustrate the analysis as well. [ABSTRACT FROM AUTHOR]

Model Driven Software Development (MDSD) is one of the trends for software development that has been widely advertised in the last years proposing automation in the code generation from the system requirements represented in a model form. Several methods involving code generation to some degree of completeness have been proposed, however these methods usually focus on a static aspect of the system being built leaving the dynamics out of the transformation scope. In this paper authors propose an approach to generate simplified LISP code from the two-hemisphere model with the main attention to a dynamic aspect of the system. [ABSTRACT FROM AUTHOR]

This paper proposes a method to improve genetic programming with multiple trees (GP CN ). An individual in GP CN comprises multiple trees, and each tree has a number P that indicates the number of repetitive actions based on the tree. In previous work, a method for updating the number P has been proposed to obtain P suitable to the tree in evolution. However, in the method efficiency becomes worse as the range of P becomes wider. In order to solve the problem, in this study, two methods are proposed: inheriting the number P of a tree from an excellent individual and using mutation for preventing the number P from being into a local optimum. Additionally, a method to eliminate trees consisting of a single terminal node is proposed. [ABSTRACT FROM AUTHOR]

Dependability of control system is one of the most complex problems in space projects. Decision making in case of contingencies is a non-trivial process requiring some “intelligence”. We can implement the “onboard intelligence” in different ways. The most common approach involves its implementation in the source code of the flight control software. The approach presented in the paper uses an onboard real-time decision making system. The decision making rules can be added or updated from Earth by radio channel. Currently, the rules should be specified in a table form, leading to misunderstandings in project team and errors. The improved approach provides the special toolset including, visual constructor of rules and support of rules’ verification. The proposed approach allows the engineers to define visually construct and update the decision making rules without programming background easily. The toolset prototype was positively evaluated at enterprise JSC Information Satellite Systems, Russia. [ABSTRACT FROM AUTHOR]

Copy-move forgery is a specific type of image tampering where a part of the image is copied and pasted on another part generally to conceal unwanted portions of the image. Hence, the goal in detection of copy-move forgeries is to detect image areas that are same or extremely similar. In this paper we propose a new approach which can efficiently identify the copy move forged areas. For achieving the copied image area first segment the image that is the test image is segmented into different independent patches. These patches are evaluated based on their matching and then the copied images are identified. For patch matching a two level of matching is carried out. In the first stage suspicious pairs of matches is obtained and affine transform matrix is roughly estimated. In-order to confirm the existence of copy move forgery a second level of patch matching with respect to Expectation Maximization algorithm is used. Thus the copy move forged areas are identified. [ABSTRACT FROM AUTHOR]

Big Data in layman terms means lots of data. This enormous amount of data is used for analysis and research purposes. This data accounts for trends in various domains. Organizations are using Big Data to predict the future in turn making them smarter and efficient. Applications from Big Data are innumerable, from retail industry where Big Data helps retailers gain insights into the customer to needs and habits, to Banking, HealthCare & Hospitality. Government agencies are increasingly incorporating Big Data analytics to curb crime and maintain law and order through social media traffic analysis and other means. Therefore, to get actionable data and perform analytics requires specialized tools. There are thousands of Big Data tools available in the market. There are open source tools like Hadoop, a term which has become synonymous to Big Data. In this paper, we authors analyzed the health care dataset against different research queries using Pig Latin Script, over the last few decades; quality of health care services in India has been improved tremendously because of the improved health care services, increased number of private and government hospitals and increased number of doctors with recognized medical qualification. In spite of significant growth government has to take strict measures to improve the overall health care facilities in India because considerable amount of gaps do exist between the demands to that of quality supply of healthcare services. [ABSTRACT FROM AUTHOR]

An important challenge of dataflow programming is the problem of partitioning dataflow components onto a target architecture. A common objective function associated to this problem is to find the maximum data processing throughput. This NP-complete problem is very difficult to solve with high quality close-to-optimal solutions for the very large size of the design space and the possibly large variability of input data. This paper introduces four variants of the tabu search metaheuristic expressly developed for partitioning components of a dataflow program. The approach relies on the use of a simulation tool, capable of estimating the performance for any partitioning configuration exploiting a model of the target architecture and the profiling results. The partitioning solutions generated with tabu search are validated for consistency and high accuracy with experimental platform executions. [ABSTRACT FROM AUTHOR]

Web services composition is a recurring idea in the field of smart residential environments (SRE), since it helps to solve complex problems such as energy saving, security control or health care by combining and orchestrating the available basic services. Smart environments are composed of networked devices (sensors and actuators) embedded within web services, which contain well-defined programming interfaces allowing them to share data, capture events and create composed control applications. There is still, however, a lack of domain specific languages (DSL) supporting a high degree of abstraction and transparency and allowing users to define control scenarios in a compact and comprehensible way. To satisfy these needs, the present paper aims to propose a DSL for describing scenarios to control SRE, with considerable gains in transparency, abstraction, expressiveness and simplicity. [ABSTRACT FROM AUTHOR]