Search

This paper proposes an Internet Of Things (IoT) implementation for recognition of objects using videos to store data about specific objects on internet. This IoT implementation is based on a recognition algorithm for objects using the OpenCV library for Python and a Raspberry PI 3 to store the data on a web application. This set of software and hardware act as a module. The module sends requests every time an object is detected to the web application. This module requires an active connection to the Internet to allow the HTTP communication. This web application is in charge of controlling and storing the data of the objects. For the purpose of this paper, the stored data on the web application is the ID of the module, a message and a timestamps. The data is collected by the modules of the objects that belong to a pool. Also, the information of the modules and the object is listed on the web application using different views of the stored data. © 2018 IEEE. Faculty of Engineering of the Catholic University of Colombia

One of the integral components in the architectural design and development of Internet of Things (IoT) is Microservice. Microservices are basically an architectural and organizational approach in the process of software development where the software is composed of small but independent services that would communicate over well-defined APIs (Application Programming Interfaces). It is quite challenging to ensure data integrity and data availability in the architecture design of microservices. As Blockchain technology has emerged as a panacea to many of the other domains, the distributed microservice architecture can also utilize it. We know that the consensus algorithms are used in the Blockchain technology to validate the transactions alongside providing extra level of security. Taking the advantage of consensus algorithms in blockchain-based architecture models, in this paper, we propose TCA (Trustworthy Consensus Algorithm), which is designed to solve the data integrity and availability challenges in microservice architectures. We have evaluated the proposed algorithm against the known alternatives and it shows good level of efficiency. © 2023 Elsevier Ltd

This paper forms part of a broader work examining the application of Object Oriented (OO) principles to the design and development of e-Learning material and its use within Learning Content Management Systems (LCMS). The preceding qualitative research has demonstrated the benefits of creating an OO methodology for the analysis, design and development of Learning Objects (LOs). Such benefits mainly include the high reusability, adaptability, standardization and time and cost effectiveness of LO development and use. This paper focuses on defining a model for Object Oriented Learning Object (OOLO) analysis and design, as a first step towards a more extensive OO e-Learning methodology that will extend to OOLO implementation and use. The Unified Modeling Language (UML) notations are used to represent the relevant OO concepts, such as class structure, inheritance, aggregation, polymorphism, etc. The notations may be extended to reflect the specific needs of LOs. The main idea concentrates on developing a predefined hierarchy of OOLOs, which will be something similar to the Application Programming Interface (API) of OO languages such as Java. The existing OOLOs can be used as they are or they can be extended, through inheritance mechanisms, to create new ones. The OOLOs can then be combined using aggregation or other relationships to design, on the fly, larger learning units such as courses. Planned further work includes the definition of an appropriate language (probably a hybrid OO and markup language) for implementing the OOLOs and the relationships between them, as well as relevant tools to enable the design and development of e-Learning content incorporating the proposed methodology. This work is expected to enable e-Learning course developers and instructors to easily design and create standardized, highly reusable and adaptable e-Learning material, by extending and assembling existing LOs that encapsulate content, metadata, standards and operations, minimizing in this way the need to get involved with time-consuming and repetitive activities such as application of standards and metadata entry. 107 118 Sponsors: Conference code: 103306 Cited By :4

Network operators are facing a critical issue on their optical transport networks to deploy 5G$+$+ and Internet of Things services. They need to address the capacity increase by a factor of 10, while keeping a similar cost per user. Over the past years, network operators have been working on the optical disaggregated approach with great interest for achieving the required efficiency and cost reduction. In particular, partially disaggregated optical networks make it possible to decouple the transponders from the transport system (known as an open line system) that are provided by different vendors. On the other hand, space division multiplexing (SDM) has been proposed as the key technology to overcome the capacity crunch that the optical standard single-mode fibers are facing to support the forecasted $10 \times$10× growth. Spatial core switching is gaining interest because it makes it possible to deploy SDM networks to bypass the overloaded wavelength division multiplexing (WDM) networks, by provisioning spatial media channels between WDM nodes. This paper presents, to the best of our knowledge, the first experimental demonstration of transport-application-programming-interface-enabled software defined networking control architecture for partially disaggregated multi-domain and multi-layer (WDM over SDM) optical networks. © 2009-2012 OSA.

This paper explores several existing gaming platforms for training and testing artificial intelligence, their application programming interfaces analyzed in order to discover potential complications of porting intellectual systems between them. We present an approach to unification of programming interfaces in order to overcome these complications. Advantages and potential side effects of this approach are described. © 2019 IEEE.

[Abstract] In recent years, vast amounts of data of different kinds, from pictures and videos from our cameras to software logs from sensor networks and Internet routers operating day and night, are being generated. This has led to new big data problems, which require new algorithms to handle these large volumes of data and as a result are very computationally demanding because of the volumes to process. In this paper, we parallelize one of these new algorithms, namely, the HyperLogLog algorithm, which estimates the number of different items in a large data set with minimal memory usage, as it lowers the typical memory usage of this type of calculation from 𝑂(𝑛) to 𝑂(1). We have implemented parallelizations based on OpenMP and OpenCL and evaluated them in a standard multicore system, an Intel Xeon Phi, and two GPUs from different vendors. The results obtained in our experiments, in which we reach a speedup of 88.6 with respect to an optimized sequential implementation, are very positive, particularly taking into account the need to run this kind of algorithm on large amounts of data. This research was supported by the Ministry of Economy and Competitiveness of Spain and FEDER funds (80%) of the EU (Projects TIN2013-42148-P and TIN2016-75845-P) as well as by the Xunta de Galicia (Centro Singular de Investigación de Galicia accreditation 2016–2019) and the European Union (European Regional Development Fund, ERDF) under Grant Ref. ED431G/01 Xunta de Galicia; ED431G/01

Conference of International Conference on Computational Science ICCS 2017 ; Conference Date: 12 June 2017 Through 14 June 2017; Conference Code:136818; International audience; 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.

This paper presents an optimization process using Harmony Search Algorithm for minimum weight of steel space frames under earthquake effects according to Turkish Earthquake Code (2007) specifications. The optimum designs are carried out by selecting suitable sections from a specified list including W profiles taken from American Institute of Steel Construction (AISC). The stress constraints obeying AISC- Load and Resistance Factor Design (LRFD) specifications, lateral displacement constraints and geometric constraints are considered in the optimum designs. A computer program is coded in MATLAB for the purpose to incorporate with SAP2000 OAPI (Open Application Programming Interface) to perform structural analysis of the frames under earthquake loads. Three different steel space frames are carried out for four different seismic earthquake zones defined in Turkish Earthquake Code (2007). Results obtained from the examples show the applicability and robustness of the method. Copyright © 2016 Techno-Press, Ltd.

The current systems supporting navigation on board of ships are built on the classic concept for equipment: The system is developed, tested, type approved, installed and from that time on used with no or little modifications. Looking at other industries a regime of software and system maintenance has been established which allows more rapid updates. The development in the IT arena moves more towards modular approached, encapsulating individual components for easier implementation and delivery with limited system wide impact. This key concept is lately often referred to as the “app concept”. The e-Navigation development asks for exactly that: a way to improve innovation while ensuring system stability for the navigational components used by the navigator on the bridge. A key aspect of the success of new systems will be the ability to convert data into as information as needed in any given situation, creating knowledge for intelligent decisions increasing the competence of a navigator. The paper will focus on the following topics: – The classic “monolithic” Equipment paradigm – Modern System Architecture using components and “apps”-concept – Advantages of an approach using situational driven tool enhancements – The “app”-concept supporting the situational centric information presentation

While solid mechanics codes are now conventional tools both in industry and research, the increasingly more exigent requirements of both sectors are fuelling the need for more computational power and more advanced algorithms. For obvious reasons, commercial codes are lagging behind academic codes often dedicated either to the implementation of one new technique, or the upscaling of current conventional codes to tackle massively large scale computational problems. Only in a few cases, both approaches have been followed simultaneously. In this article, a solid mechanics simulation strategy for parallel supercomputers based on a hybrid approach is presented. Hybrid parallelization exploits the thread-level parallelism of multicore architectures, combining MPI tasks with OpenMP threads. This paper describes the proposed strategy, programmed in Alya, a parallel multi-physics code. Hybrid parallelization is specially well suited for the current trend of supercomputers, namely large clusters of multicores. The strategy is assessed through transient non-linear solid mechanics problems, both for explicit and implicit schemes, running on thousands of cores. In order to demonstrate the flexibility of the proposed strategy under advance algorithmic evolution of computational mechanics, a non-local parallel overset meshes method (Chimera-like) is implemented and the conservation of the scalability is demonstrated., D.D.T and A.J acknowledge funding through SIMUCOMP and ERA-NET MATERA+ project financed by the Consejería de Educación y Empleo of the Comunidad de Madrid and by the European Union’s Seventh Framework Programme (FP7/2007-2013). This work was partially supported by the grant SEV-2011-00067, Severo Ochoa Program, awarded by the Spanish Government.

The popularity and huge amount of information published in Online Social Networks (OSN) established them as one of the main data sources for a variety of research community fields. However, the design of a large-scale dataset collection campaign is a major problem for organizations and researchers who aim in addressing their research questions by analyzing this type of data. OSN platforms provide Application Programming Interfaces (API) to third party developers, which enable them to retrieve and use this data for applications deployment. However, due to OSN imposed limitations, the process of retrieving large scale data with the use of these APIs is challenging and time consuming, resulting in datasets which are either incomplete or outdated. It is relatively impossible for an individual scientist or research group to follow an efficient dataset collection procedure and build a large sample in a short amount of time. In this paper we present a framework for efficient crowd crawling of OSN. Our framework is based on the use of multiple OSN accounts, which are engaged in an efficient distributed collection process able to circumvent the imposed limitations without violating the terms of use. We present an evaluation of the proposed solution and demonstrate its performance in terms of dataset completeness and timeliness, for the case study of Twitter, one of the most popular platforms used in research. © 2016 IEEE. 373 380 Sponsors: Drexel University RMIT University of Pittsburgh University Zhejiang University Conference code: 125951

In this paper, we present a revised version of BilKristal 3.0 tool. Raycast screenshot functionality is added to provide improved visual analysis. We added atomic distance analysis functionality to assess crystalline defects. We improved visualization capabilities by adding high level cut function definitions. Discovered bugs are fixed and small performance optimizations are made. New version program summary Program title: BilKristal 4.0 Catalogue identifier: ADYU_v4_0 Program summary URL: http://cpc.cs.qub.ac.uk/summaries/ADYU_v4_0.html Program obtainable from: CPC Program Library, Queen’s University, Belfast, N. Ireland Licensing provisions: Standard CPC licence, http://cpc.cs.qub.ac.uk/licence/licence.html No. of lines in distributed program, including test data, etc.: 370130 No. of bytes in distributed program, including test data, etc.: 8350850 Distribution format: tar.gz Programming language: C, C++, Microsoft .NET Framework 2.0 and OpenGL Libraries. Computer: Personal Computers with Windows operating system. Operating system: Windows XP or higher. RAM: 20–60 Megabytes. Classification: 8. External routines: Microsoft .NET Framework 2.0. For the visualization tool, graphics card driver should also support OpenGL. Catalogue identifier of previous version: ADYU_v3_0 Journal reference of previous version: Comput. Phys. Comm. 187 (2015) 266 Does the new version supersede the previous version?: Yes Nature of problem: Determining the crystal structure parameters of a material is a very important issue in crystallography. Knowing the crystal structure parameters helps the understanding of the physical behavior of material. For complex structures, particularly for materials which also contain local symmetry as well as global symmetry, obtaining crystal parameters can be very hard. Solution method: The tool extracts crystal parameters such as primitive vectors, basis vectors and identifies the space group from atomic coordinates of crystal structures. Reasons for new version: Additional features, Performance optimizations, Minor bug corrections. Summary of revisions: • Raycast screenshot functionality is added to the visualization tool. A raycasting algorithm similar to the one described in [4, 6] is used. The algorithm is multi-core parallelized as described in [5]. • Atomic distance analysis functionality is added. Tool can analyze the crystal structure and give statistical information of atom to atom distances. • In the visualization tool, high level cut function support is added. Users can define cut functions, not just as cut-planes but with more complex functions as well. • Automatic primitive vector and basis vector selection options are added. This way the system selects the simplest primitive and basis vector alternatives and continues without interrupting the user. • In the visualization tool, an unused log file was being created and a redundant configuration file was being used. These issues are corrected. • Dead-codes are removed to improve clarity. Restrictions: Assumptions are explained in [1, 2, 3]. However, none of them can be considered as a restriction to the complexity of the problem. Running time: The tool was able to process input files with more than a million atoms in less than 20 seconds on a PC with an Athlon quad-core CPU at 3.2 GHz using the default parameter values. References: [1] Erhan Okuyan, Ugur Gudukbay, and Oguz Gulseren, Pattern Information Extraction from Crystal Structures, Computer Physics Communications 176 (2007) 486. [2] Erhan Okuyan and Ugur Gudukbay, BilKristal 2.0: A Tool for Pattern Information Extraction from Crystal Structures, Computer Physics Communications 185 (2014) 442. [3] Erhan Okuyan and Erkan Okuyan, A Tool for Pattern Information Extraction and Defect Quantification from Crystal Structures, Computer Physics Communications 187 (2015) 266. [4] Erhan Okuyan, Ugur Gudukbay and Veysi Isler, Dynamic view-dependent visualization of unstructured tetrahedral volumetric meshes, Journal of Visualization 15-2 (2012) 167–178. [5] Erhan Okuyan and Ugur Gudukbay, Direct Volume Rendering of Unstructured Tetrahedral Meshes using CUDA and OpenMP, Journal of Supercomputing 67-2 (2014) 324–344. [6] Erhan Okuyan, Ugur Gudukbay, Ceyhun Bulutay, and Karl-Heinz Heinig, MaterialVis: Material Visualization Tool using Direct Volume and Surface Rendering Techniques, Journal of Molecular Graphics and Modelling 50 (2014) 50–60.

The unprecedented growth in technology has increased the importance of the required information security that is still hard to be reached. Recently, network and web application attacks have occurred frequently, causing confidential data to be stolen by the available vulnerabilities in the systems and the most prominent is in the form of open ports. This causes the CIA (Confidentiality Integrity and Availability) Triad Model to break. Penetration testing is one of the key techniques used in real life to accurately detect the possible threats and potential attacks against the system, and the first step for hackers to conduct attacks is information collection. In this paper, we present a useful schema for the active information-gathering phase that can be used during penetration testing and by system administrators. It will be the first feature of a security engine going to be implemented. The work involves an automated API-based IP and port scanner, service-version enumerator, and vulnerability detection system. This scheme is based on the Network Mapper (Nmap) to collect the information with high accuracy depending on the provided rules in our schema. Besides, the work has been implemented as a RESTful-API server, aiming at easy integration for real-life cases and allowing administrators to scan and secure their networks more quickly and easily. The effectiveness and efficiency of this technique has been proved by the various test cases applied considering different scenarios from the real world. The average time of scanning a server and detecting the vulnerabilities is 2.2 minutes. Regardless of the number of vulnerabilities, the increase in time for each open port is just about 12 seconds. © 2021 ACM.