Search

At the present time "chaotic nonlinear dynamical systems" is the most popular branch of the mathematical modeling. Many of real life phenomena are nonlinear. In the present paper we investigate the simulations of fractal figures by computer programming. Fractals are strictly dependence with the nonlinear phenomena. There was scientific view that every real phenomenon is regular or stable at the time of Isaac Newton. Later Poincare [2] observed many of the real phenomena are not regular i.e. they are "chaotic". At first time fractal figures observed on the computer by Benoit Mandelbrot with several programmers of at the company IBM in 1980. Later appears the set of Mandelbrot [4] which is fractal, the most important tool of the sets of Julia [1] and strictly depends on the irregular phenomenon. In this paper we learn the developing computer program to obtain fractal figures which applicable to many areas of natural phenomena. [ABSTRACT FROM AUTHOR]

Neutronic parameter calculation of the reactor core is one of the bases for calculating the safety of a nuclear reactor operation. Neutronic calculations using reliable computer codes are needed to provide valid and accurate results. This paper aims to compare the neutronic calculation results of the two Monte Carlo computer codes, namely KENO-VI and MCNP6. The TRIGA 2000 research reactor becomes the object of study in this paper. The calculated neutronic parameters include excess reactivity, shutdown margin, and control rod worths. The calculation results show that the difference in reactivity values calculated by KENO-VI and MCNP6 increases when the number of control rods entering the core increases. The maximum reactivity difference was found to be 0.443 %dk/k for the shutdown margin parameter. The difference in cross-section library data is a factor causing the difference in the calculation results of the two computer codes. The calculation results also show that the KENO results tend to be lower than the MCNP results. Finally, it can be concluded that the differences between the KENO results and the MCNP results observed in this paper are aligned with the literature data. The difference between KENO-VI and MCNP6 calculation results become an important thing when the analyzed shutdown margin value is close to the commonly used shutdown margin limit value, which is −0.5 %dk/k. [ABSTRACT FROM AUTHOR]

In this paper, we aim to provide a comparative study of various chatbots that is created till date. Agent or chatbot technology is a text-based interaction system, often referred to as conversational dialogue. It is being used to combat these issues by mental health experts. A chatbot is a computer programme that uses Natural Language Processing to mimic human-to-human communication over the Internet. A chatbot can forecast users' moods in addition to understanding their emotions. Various works have been thoroughly studied and from there we have performed the comparison of the chatbot. We have compared and analyzed the papers based of various performance metrics and got a detailed analysis of the technology used and accuracy achieved. [ABSTRACT FROM AUTHOR]

Cyclic code is one of the important type of linear codes. This type of codes has interesting algebraic sturctures and important applications. One of the generalization of cyclic codes is quasi cyclic codes which also could be generalized further to be Generalized Quasi-Cyclic (GQC) code. The latter codes use arbitrary permutation instead of cyclic shift as in cyclic codes. The GQC code has been an interesting topic to study until now and has an important application in Post-Quantum Cryptography. For instance, it has been used as keys in McEliece cryptosystem. In this paper, we give a construction of q-ary GQC code using Gray Map from GQC code over the ring B1. The main result in this paper is if we have a GQC code over B1, then the image of such code under certain Gray map is a q-ary GQC code. Also, some examples of optimal codes produced by computer search based on the main result. [ABSTRACT FROM AUTHOR]

GA-based regression test prioritization have ordered test cases by computing fitness value based on the number of affected faults in the coverage information, but most of the researchers use the same severity of faults even if a fault was executed by the previous test case. There have been very little evaluations of the GA-based regression test prioritization, even though there are several studies on GA-based regression test prioritization of object-oriented program (OOP). Most of the evaluations of the previous studies do not consider fault detection efficiency in terms of mutation scores and execution efficiency in terms of execution effort but consider only Average Percentage of the rate of Fault Detection (APFD) metric. The objective of this paper is to integrate the idea of GA with object-oriented programs to aid automated regression test case prioritization of the selected test cases, by proposing a regression test case prioritization strategy for selected test cases of object-oriented programs based on genetic algorithm for efficient OOP regression test case prioritization. This paper proposed an automatic test case prioritization strategy, called HoceDanMafara, and its tool support for Object-Oriented programs. Moreover, a comprehensive empirical study of ten object-oriented programs by the use of mutation analysis was conducted to compare HoceDanMafara and one existing software regression tests prioritization together with non-prioritize and random strategies for regression testing of OOP in term of efficiency of fault detection. The evidence of the efficiency of the proposed strategy are shown in the results of the experiment and statistical tests (p<0.05). The study indicated that the resulting evolutionary tests prioritization produces 27.75% in terms of test effort efficiency compare with randPrior that produces 20.93%, nonPrior produces 14.35% and pSherry produces 20.89%. Therefore, the proposed strategy could be commendable of use as an efficient OOP automatic tests prioritization strategy. [ABSTRACT FROM AUTHOR]

The quality evaluation of software, e.g., defect measurement, gains significance with higher use of software applications. Metric measurements are considered as the primary indicator of imperfection prediction and software maintenance in various empirical studies of software products. However, there is no agreement on which metrics are compelling quality indicators for novel development approaches such as Aspect Oriented Programming (AOP). AOP intends to enhance programming quality, by providing new and novel constructs for the development of systems, for example, point cuts, advice and inter-type relationships. Hence, it is not evident if quality pointers for AOP can be derived from direct expansions of traditional OO measurements. Then again, investigations of AOP do regularly depend on established coupling measurements. Notwithstanding the late reception of AOP in empirical studies, coupling measurements have been adopted as useful markers of flaw inclination in this context. In this paper we will investigate the state of the art metrics for measurement of Aspect Oriented systems development. [ABSTRACT FROM AUTHOR]

The Mini Labyrinth experiment is a simple neutron and gamma shielding experiment developed at Slovak University of Technology (STU), inspired by the ALARM-CF-AIR-LAB-001 ICSBEP benchmark. Compared to the original Labyrinth, which was made from concrete blocks and had dimension of several meters, the STU Mini Labyrinth is approximately ten times smaller and consists of NEUTRONSTOP shielding blocks. So far, several versions and modifications of the Mini Labyrinth have been investigated, currently the V2-25-L version is used for code evaluation. This version uses a PuBe neutron source loaded in the entrance of the Mini Labyrinth, a plastic tank filled with light water moderator and the NuDET plastic scintillation neutron detector, which can be placed around the experimental workplace. This detector has a significant role in the experiment since it is a calibration apparatus and provides real time data on the rates of ambient dose equivalents of neutron radiation. On the other hand, as it is a certified commercial product, the response function of this detector is unknow, which makes a significant challenge of verifying the measured data with computer codes. This paper presents a result of a series of measurements with the NuDET detector performed at STU and discusses the options, how to verify the experimental results by the SCALE6 system in the most effective way. [ABSTRACT FROM AUTHOR]

Data is the integration of various AI (AI) algorithms for important features, the online details are scattered everywhere and controlled separately who do not believe in each other, and the use of information in complex Cyberspace. Too fast and hard to authorize or verify. Because of this, it is very difficult to enable data sharing on cyberspace of big data important, and as a matter-of-fact powerful AI. In this paper, we propose Secretary Network, I construction that will keep data safe, computer programming, and sharing within the Internet environment, aimed at a real cyber safe real estate data and thus improve AI with multiple data sources, with to combine three key elements: Block proprietary data sharing guarantee, which allows for reliable data sharing within a large area to make real big data; Creating a reliable cyberspace, based on AI a secure computer platform is used for mass production smart safety rules. A reliable way to exchange the purchase price Security, they provide the way participants can see economic rewards when releasing their data or service, which encourages the sharing of information and thus achieves better AI performance. Moreover, we talk standard usage of Sec Net and its another possible method, as well as analysis its effectiveness from the aspect of network security and economic revenue. [ABSTRACT FROM AUTHOR]

As machine codes evolved from programming into autocodes and assemblers and then to high-level languages, programmers' productivity rose dramatically. Modern programming languages focus on high productivity and an ergonomic interface. Yet, there are no successful programming languages that would have an intuitive interface and an ergonomic syntax. This paper presents a cognitive ergonomic approach to the syntax design of programming languages, which helps improve computer programming in terms of such criteria as language simplicity and clarity of constructs. The goal hereof is to design the structure of a novel programming language on the basis of the cognitive ergonomic approach. The result is an ergonomically structured syntax for a programming language that has all the features of state-of-the-art high-level languages. Programmers and experts in programming language interface ergonomics and human-computer interaction may find the results interesting. [ABSTRACT FROM AUTHOR]

Numerical computation packages are widely used both in teaching and research. These packages consist of license (proprietary) and open source software (non-proprietary). One of the reasons to use the package is a complexity of mathematics function (i.e., linear problems). Also, number of variables in a linear or non-linear function has been increased. The aim of this paper was to reflect on key aspects related to the method, didactics and creative praxis in the teaching of linear equations in higher education. If implemented, it could be contribute to a better learning in mathematics area (i.e., solving simultaneous linear equations) that essential for future engineers. The focus of this study was to introduce an additional numerical computation package of Scilab as an alternative low-cost computing programming. In this paper, Scilab software was proposed some activities that related to the mathematical models. In this experiment, four numerical methods such as Gaussian Elimination, Gauss-Jordan, Inverse Matrix, and Lower-Upper Decomposition (LU) have been implemented. The results of this study showed that a routine or procedure in numerical methods have been created and explored by using Scilab procedures. Then, the routine of numerical method that could be as a teaching material course has exploited. [ABSTRACT FROM AUTHOR]

For many years, advanced OOFEM software [3] has been developed at CTU's Civil Engineering Faculty. Within this computer code, the multiscale model of hydration of concrete is also implemented. The model is continuously validated using in situ measurements on real constructions. This is extremely important in engineering applications [2]. In this paper, validation is presented using measurements on the protective reinforced concrete structure of the linear accelerator of the oncology clinic in Liberec. [ABSTRACT FROM AUTHOR]

Nowadays, one of the most important challenges in the programming is the efficient usage of multicore processors. Many new programming languages and libraries support multicore programming. C++0x, the proposal of the next standard of C++ also supports multithreading at low level. In this paper we argue for some extensions of C++ Standard Template Library based on the features of C++0x. These extensions enhance the standard library to be more powerful in the multicore realm. In this paper we deal with the functors and lambda expressions that are a major extension in the language. We present a technique to write effective pipelines. Speculative functors aim at the effective evaluation of composite functors. Algorithms are overloaded on the associativity of lambda expressions as well. [ABSTRACT FROM AUTHOR]

This paper determines a set of optimal design parameters of a Y-Star robot whose workspace is as close as possible of being equal to a prescribed cylindrical dexterous workspace (PCDW). Two requirements should be satisfied: (i) the local or global performance index; (ii) a regular shape. The kinematic problem is analysed in brief to determine the design parameters and their relation. The optimal design problem is discussed and then translated into two linear problems. Then, an optimal design procedure which adopts the generalized pattern search algorithm in the genetic algorithm and direct search toolbox of Matlab is adopted to solve these problems. As applying example, the results of four cases PCDW to the robot are presented. And the design result is compared with a concept of the distance between the best state of the robot and the requirement of the operation task. The method and result of this paper are very useful for the design and comparison of the Y-Star robot. [ABSTRACT FROM AUTHOR]

Cordial labeling is one of a technique that can be applied in error detection and correction in computer coding. Usually graph vertices and edges are labeled with numbers. But a group cordial labeling is the one that labels vertices and edges using elements in a group. A group is a non-empty collection of elements paired with a binary operation satisfying closure, associative, identity and inverse axioms. Order of an element a is the smallest positive integer n such that an =e, where e is the identity element of the group. An assignment of the elements from the Group{1, − 1, i, −i} to the vertices of a graph in such a way that an edge uv is to have label 1 if labels of the end vertices u, v are relatively prime to each other and label 0 otherwise with an additional condition that number of vertices having with two different labels vary by at most one and total number of edges with labels 0 and 1 vary by at most 1 is alluded as Group {1, − 1, i, −i} cordial labeling. In this paper, we apply the same labeling in the classes of triangular ladder, alternate triangular snake, alternate quadrilateral snake and double triangular snake graphs. [ABSTRACT FROM AUTHOR]

Currently, software development organizations (SDOs) attempt to deliver their software products quickly, within the prescribed period, and with the highest quality and lowest cost, yet this is proven a big challenge for them. Agile Kanban method recently is gaining increasing attention and popularity, due to its numerous advantages that make it performs better than other methods in terms of managing software projects. Beside of that, it has a board that used to visualize the workflow and monitor the project progress. However, various studies have shown that this method has significant challenges that negatively impact the scheduling of the development process. Consequently, late delivery of software projects may occur, thus the rate of projects' failures will be increased. This paper aims to identify the challenges and criteria that affect the progress monitoring task of Agile Kanban method using a narrative review method, whereby this review method is adopted to identify and summarize what has been previously published, avoid duplications, and seek new study areas which are not yet addressed. Finally, the findings of this study would be used to develop an improved software project monitoring task model of Agile Kanban method. That model would be capable to keep projects progress as it is planned, and thus leading to successful delivering for software projects according to its specifications, time, and budget. [ABSTRACT FROM AUTHOR]

Multi-thread programming using OpenMP on the shared-memory architecture with hyperthreading technology allows the resource to be accessed by multiple processors simultaneously. Each processor can execute more than one thread for a certain period of time. However, its speedup depends on the ability of the processor to execute threads in limited quantities, especially the sequential algorithm which contains a nested loop. The number of the outer loop iterations is greater than the maximum number of threads that can be executed by a processor. The thread distribution technique that had been found previously only be applied by the high-level programmer. This paper generates a parallelization procedure for low-level programmer in dealing with 2-level nested loop problems with the maximum number of threads that can be executed by a processor is smaller than the number of the outer loop iterations. Data preprocessing which is related to the number of the outer loop and the inner loop iterations, the computational time required to execute each iteration and the maximum number of threads that can be executed by a processor are used as a strategy to determine which parallel region that will produce optimal speedup. [ABSTRACT FROM AUTHOR]

Under the guidance of the Talmud allocation scheme's theory, the paper analyzes the algorithm implemented process via the perspective of graphic point-segment way, and designs the point-segment way's Talmud property allocation algorithm. Then it uses Java language to implement the core of allocation algorithm, by using Android programming to build a visual interface. [ABSTRACT FROM AUTHOR]

The arrival of hardware accelerators has created a new gold rush to be the first to deliver their promise of high performance for numerical applications. Despite the recent advances in programmability, it is still hard to develop tuned programs that extract all the potential performance promised by the manufacturers. In this paper we remind the community that while this development effort is a noble endeavor, there is a lot of low hanging fruit that can be harvested easily. Picking this low hanging fruit benefits the scientific computing community immediately and prototypes the approach that further optimizations may follow. We demonstrate this by focusing on a widely used set of operations, the level-3 BLAS, targeting the NVIDIA GPUs. [ABSTRACT FROM AUTHOR]

Software networks are directed graphs of dependencies among entities (packages, classes, methods, etc.) found in a software system. These structures are used to study organizational software complexity and evolution. In this paper the prototype of software networks extractor - SNEIPL is described. SNEIPL uses enriched concrete syntax tree (eCST) representation of a source code. The benefit of such representation is that it enables independency of programming language. First experiences using SNEIPL showed that it correctly extracted isomorphic software networks from the source code of two structurally and semantically equivalent programs written in different programming languages. [ABSTRACT FROM AUTHOR]

This research paper presents a new concept of using a single tool to associate syntax of various programming languages, algorithms and basic coding techniques. A simple framework has been programmed in Python that helps students learn skills to develop algorithms, and implement them in various programming languages. The tool provides an innovative and a unified graphical user interface for development of multimedia objects, educational games and applications. It also aids collaborative learning amongst students and teachers through an integrated mechanism based on Remote Procedure Calls. The paper also elucidates an innovative method for code generation to enable students to learn the basics of programming languages using drag-n-drop methods for image objects. [ABSTRACT FROM AUTHOR]

This paper presents a path following method for solving linear complementarity problems over symmetric cones. The starting point has to be strictly feasible with respect to the inequality constraints, but may be infeasible with respect to the equality constraints. Therefore, the algorithm falls into the broad class of infeasible interior point methods. The algorithm is a corrector-predictor type method and it generalizes several corrector-predictor methods presented in the literature. It has polynomial complexity under general assumption and superlinear convergence under some mild additional assumptions. [ABSTRACT FROM AUTHOR]

In this paper, the creation of a hybrid computer code based on the joint use of CUDA and MPI technology for silicon Si and silicon carbide SiC is considered in the framework of the molecular dynamics method. The efficiency of the created code is compared both with a program that uses only the MPI interface, and with a CUDA program designed to work only with one GPU. [ABSTRACT FROM AUTHOR]

In this paper we explore the application of an agent based model to designing ambient intelligence for use by the elderly in their own homes. The agent model used is based on abductive logic programming. It utilises personalised knowledge, interacts with the user and other agents and devices, and, while autonomous, incorporates user preferences when deciding whether or not to act, and what action to take. [ABSTRACT FROM AUTHOR]

This paper is aimed to discuss modeling, construction and development of navigation algorithm of a two wheeled self balancing mobile robot in an enclosure. In this paper, we have discussed the design of two of the main controller algorithms, namely PID algorithms, on the robot model. Simulation is performed in the SIMULINK environment. The controller is developed primarily for self-balancing of the robot and also it's positioning. As for the navigation in an enclosure, template matching algorithm is proposed for precise measurement of the robot position. The navigation system needs to be calibrated before navigation process starts. Almost all of the earlier template matching algorithms that can be found in the open literature can only trace the robot. But the proposed algorithm here can also locate the position of other objects in an enclosure, like furniture, tables etc. This will enable the robot to know the exact location of every stationary object in the enclosure. Moreover, some additional features, such as Speech Recognition and Object Detection, are added. For Object Detection, the single board Computer Raspberry Pi is used. The system is programmed to analyze images captured via the camera, which are then processed through background subtraction, followed by active noise reduction. [ABSTRACT FROM AUTHOR]

Bachelor studies in Computer Science at our department in the last decades cover several successive core courses in programming: Introduction to Programming, Data Structures and Algorithms 1 and 2, Operating Systems and Compiler Construction. For a long time our intention was not to insist on the realization of subjects in a specific programming language, but to put emphasis on abstract reasoning and appropriate data structures and algorithms. Also, to avoid teaching different languages and programming environments, we decided to use one good educational language - Modula-2. In the last several years we were under different kinds of pressure to change the language. Starting from the last school-year we decided to adopt Java within the introductory programming course, using the imperative approach first. Some comparisons of students' advancements and success between Modula-2 and Java generations are presented in the paper. The results of the analytical evaluation indicate that the choice of the first programming language does not have a deep influence to students' success at the course. [ABSTRACT FROM AUTHOR]

Alvis is a formal language that combines graphical modelling of interconnections between system entities (called agents) and a high level programming language to describe behaviour of any individual agent. An Alvis model can be verified formally with model checking techniques applied to the model LTS graph that represents the model state space. This paper presents transformation of an Alvis model into executable Java code. Thus, the approach provides a method of automatic generation of a Java application from formally verified Alvis model. [ABSTRACT FROM AUTHOR]

Mathematics can be used to introduce and explain events and occurrences that have a firmly rooted foundation of logic. This article is created to explain a simple mathematical trick related to cryptanalysis that has existed and allows us to improve upon it by modifying it with logic derived from computer coding and communications. Using error correction based on Hamming code, it is possible to obtain a value between 0-15 by answering yes or no questions about the provided cards. This paper will also explain how to add more cards to discover even a lie immediately and without error. [ABSTRACT FROM AUTHOR]

Power wiring is the cornerstone of urban expansion and social progress. In recent decades, the traditional route routing method takes the first place, that is, to minimize the construction pressure without considering the cost first. However, this method is often restricted by many unexpected factors, and it often takes a long time to choose an appropriate path, which seriously affects the construction progress. Combined with the intelligent algorithm and the understanding of the real situation, we designed the power wiring system (PW system) and cabling optimization system (CO system). Through computer programming, the actual problems are digitized, and the actual problems are transformed into virtual points. The swarm intelligence algorithm is used to generate the optimal path through the computer. At the same time, the use of the computer can compare and choose the problems and factors that are difficult to be considered at the same time in the traditional wiring. Moreover, the flexibility and convenient manipulation of the computer also create convenient conditions for the later maintenance, which can effectively improve the efficiency of power wiring and reduce the wiring cost. Through the research on intelligent cabling, it aims to provide more effective methods for power cabling and help solve the problem of power demand arising from the rapid development of society. [ABSTRACT FROM AUTHOR]

When students begin to learn how to program computers, the greatest difficulty does not consist in learning a programming language, even considering the various programming paradigms to which it may belong, but rather in the way of conceiving a solution algorithm for a given problem. In this paper methods for learning how to build better programs with iterative and recursive techniques are proposed. Instead of using the traditional and sequential method, following theoretical exposition and creation of algorithms, practical demonstration in a specific framework to write a program in a programming language, program execution and tests, a new approach is introduced where a set of tools, such as Python programming language, Runestone Interactive documents and Online Python tutor, is used to allow the production of enriched documents with text, images, videos, code implementation and execution windows, with the option of step by step running, showing the used data structures and their values evolution, all together in an - Interactive Electronic Document (IED). Students have the opportunity to learn and experience programming concepts in a single document, interactively, increasing learning achievement and level of satisfaction. [ABSTRACT FROM AUTHOR]

Universities around the world have implemented competitive programming as an approach to teach computer science courses. They have empirically validated this approach as a successful pedagogical tool. However, there are no conclusive results that describe the degree in which competitive programming affects the learning process of the students. In this paper, we report on the learning curves obtained from analyzing ten years of TopCoder algorithm competitions. We discuss on how these learning curves apply to university courses and can help us explain the influence of competitive programming in a class. [ABSTRACT FROM AUTHOR]

This paper describe the relationship between C++ templates and partial evaluation. In C++, templates were designed to support generic programming, but not deliberately provided the ability to perform compile-time computations and code generation. These features are completely deliberate, and as a result their syntax is ill at ease. After a review, these features in terms of partial evaluation, a much simpler syntax can be achieved. In C++, it may be regarded as a two-level language in which types are first-class values. Template instantiation resembles an offline partial assessor. In this paper, we explain groundwork in the direction of a single mechanism based on Partial Evaluation which unifies generic programming, compile-time computation and code generation. The language Catat is introduced to demonstrate these ideas. [ABSTRACT FROM AUTHOR]

Many types of fuzzy numbers were studied in the literature and applied in many mathematical fields. Three of these types, the triangular, the trapezoidal and the hexagonal fuzzy number are used widely, especially in mathematical programming. A piecewise linear fuzzy number (PLFN), which generalizes these three types, is introduced in this paper. Based on the definition of the ranking function with total integral value, a ranking function for this piecewise linear fuzzy number is proposed. Arithmetic operations with their properties are introduced on the trapezoidal fuzzy number as a special case, then a generalization of these operations on the PLFN is given. It is also shown that the proposed operations on the PLFN are accepted generalizations of the conventional arithmetic operations on real numbers. [ABSTRACT FROM AUTHOR]

The paper discusses the concept of a system that encapsulates the transition from geometry building to strength tests. The solution we propose views the engineer as a programmer who is capable of coding the procedure for working with the modeli.e., to outline the necessary transformations and create cases for boundary conditions. We propose a prototype of such system. In our work, we used: Python programming language to create the program; Jupyter framework to create a single workspace visualization; pythonOCC library to implement CAD; FeniCS library to implement FEM; GMSH and VTK utilities. The prototype is launched on a platform which is a dynamically expandable multi-tenant cloud service providing users with all computing resources on demand. However, the system may be deployed locally for prototyping or work that does not involve resource-intensive computing. To make it possible, we used containerization, isolating the system in a Docker container. [ABSTRACT FROM AUTHOR]

Programming antipatterns are commonly used patterns that make the code unnecessary complex and unmaintainable. However, beginner programmers such as students, often use them. Usage of antipatterns should be eliminated from source code. Many antipatterns can be detected at compilation-time with an appropriate parser tool. In this paper we argue for a new lint-like tool that does detect typical programming antipatterns, and it is extensible to task-specific verifications. This tool mainly developed to evaluate students' programs, however it can be used in industrial projects as well. Our approach based on pattern matching on abstract syntax tree provided by Clang parser. We present our description language that specifies the antipatterns. [ABSTRACT FROM AUTHOR]

Programmability is an important capability that provides flexible computing devices, but is incurs significant performance and power penalties. Performance problems cannot be solved by simply increasing operating frequency while relying on technology improvements for low power. Instead, DSP architectures need to be adapted specifically for low power operation. This paper proposed an architecture that relies on dynamic reconfiguration of hardware resources to implement low-power and programmable processors for DSP applications. This technique has shown to yield at least an order of magnitude of power reduction compared to traditional instruction-based engines for problems in the area of wireless communication. [ABSTRACT FROM AUTHOR]

In this paper, are presented some possibilities concerning the implementation of an algebraic method for XML hierarchical data processing which makes faster the XML search mechanism. Here is offered a different point of view for creation of advanced algebraic processor (with all necessary software tools and programming modules respectively). Therefore, this nontraditional approach for fast XML navigation with the presented algebraic processor may help to build an easier user-friendly interface provided XML transformations, which can avoid the difficulties in the complicated language constructions of XSL, XSLT and XPath. This approach allows comparatively simple search of XML hierarchical data by means of the following types of functions: specification functions and so named build-in functions. The choice of programming language Java may appear strange at first, but it isn't when you consider that the applications can run on different kinds of computers. The specific search mechanism based on the linear algebra theory is faster in comparison with MSXML parsers (on the basis of the developed examples with about 30%). Actually, there exists the possibility for creating new software tools based on the linear algebra theory, which cover the whole navigation and search techniques characterizing XSLT/XPath. The proposed method is able to replace more complicated operations in other SOA components. [ABSTRACT FROM AUTHOR]

Multi-Dimensional fluid- and structural dynamics problems are solved by computational methods based on Arbitrary Lagrange Euler (ALE) formulation of the continuum mechanical conservation equations. The paper presents a new modification of the radial basis function (RBF) based mesh motion scheme, which combines the RBF interpolation with the breadth-first search (BFS) algorithm. In this emerging domain, it is still unknown which algorithmic approach is the most suitable. Therefore, we realized our C++ implementation on a high abstraction level enabling broad customization and easy extension for further algorithmic research without sacrificing performance. [ABSTRACT FROM AUTHOR]

Version 5 of the Automatic Real-Time Ionogram Scaler with True height (ARTIST), an intelligent system developed at UMLCAR for extraction of ionospheric specification data from Digisonde ionograms, entered its operational phase in May 2007. Version 5 implements the classic ARTIST techniques re-vamped for modern computers and programming environments, as well as new approaches developed to strengthen the ARTIST performance. This paper describes progress in the ionogram autoscaling research at UMLCAR that has culminated into release of the ARTIST 5 software. [ABSTRACT FROM AUTHOR]

The process of finding one or more optimal solutions for answering combinatorial optimization problems bases itself on the use of algorithms instances. Those instances usually have to explore a very large search spaces. Heuristics search focusing on the use of High-Order Hopfield neural networks is a largely deployed technique for very large search space. It can be established a very powerful analogy towards the dynamics evolution of a physics spin-glass system while minimizing its own energy and the energy function of the network. This paper presents a new approach for solving combinatorial optimization problems through parallel simulations, based on a High-Order Hopfield neural network using MPI specification. [ABSTRACT FROM AUTHOR]

PhysarumSoft is a software tool consisting of two modules developed for programming Physarum machines and simulating Physarum games, respectively. The paper briefly discusses what has been added since the last version released in 2015. New elements in both modules are based on rough set theory. Rough sets are used to model behaviour of Physarum machines and to describe strategy games. [ABSTRACT FROM AUTHOR]

This paper presents a hybrid Water Flow-like Algorithm with Tabu Search for solving travelling salesman problem (WFA-TS-TSP).WFA has been proven its outstanding performances in solving TSP meanwhile TS is a conventional algorithm which has been used since decades to solve various combinatorial optimization problem including TSP. Hybridization between WFA with TS provides a better balance of exploration and exploitation criteria which are the key elements in determining the performance of one metaheuristic. TS use two different local search namely, 2opt and 3opt separately. The proposed WFA-TSTSP is tested on 23 sets on the well-known benchmarked symmetric TSP instances. The result shows that the proposed WFA-TSTSP has significant better quality solutions compared to WFA. The result also shows that the WFA-TS-TSP with 3-opt obtained the best quality solution. With the result obtained, it could be concluded that WFA has potential to be further improved by using hybrid technique or using better local search technique. [ABSTRACT FROM AUTHOR]

eCST is an innovative, language-independent intermediate source code representation designed as a basis of approach applied in development of SSQSA framework. This framework provides an infrastructure for consistent static software analysis. Tempura is a formal specification language, while Tempura programs are executable ITL (Interval Temporal Logic) specifications. This paper describes required steps to enable generation of eCST representation of Tempura code which leads to an incorporation of Tempura language in the infrastructure of SSQSA framework. This incorporation serves as a proof of concept that a formal specification language (like Tempura) can be successfully represented with an intermediate language representation (like eCST) that was primarily aimed for representation of "classical" programming languages. [ABSTRACT FROM AUTHOR]

Locally networked or remotely controlled home automation system becomes a popular paradigm because of the numerous advantages and is suitable for academic research. This paper proposes a method for an implementation of Raspberry Pi based home automation system presented with an android phone access interface. The power consumption profile across the connected load is measured accurately through programming. Users can access the graph of total power consumption with respect to time worldwide using their Dropbox account. An android application has been developed to channelize the monitoring and controlling operation of home appliances remotely. This application facilitates controlling of operating pins of Raspberry Pi by pressing the corresponding key for turning "on" and "off" of any desired appliance. Systems can range from the simple room lighting control to smart microcontroller based hybrid systems incorporating several other additional features. Smart home automation systems are being adopted to achieve flexibility, scalability, security in the sense of data protection through the cloud-based data storage protocol, reliability, energy efficiency, etc. [ABSTRACT FROM AUTHOR]