查看更多>>摘要：In the midst of the viral outbreak of the COVID-19 pandemic, the foremost important thing for every person is to have information about the health care facilities in their nearby locations. Along with it is also important to know the accurate route information to reach the health care unit. Especially in a country like India, with a high population rate, the transport network becomes complicated and massive. As the Indian government has started the process of unlocking in most parts of India, which is likely to increase the complication of finding the proper route to visit unfamiliar parts of the metropolis. In the pandemic situation, it becomes even important for the person to locate the specialized hospital and obtain its shortest path to reach in a minimum time period. This paper addresses the problem by evaluating the shortest path facility for finding the nearest emergency location from a defined user's location. The study uses a GIS-based map and Dijkstra's algorithm to identify the shortest route.
查看更多>>摘要：This paper involves techniques for improving the quality indices of big data process engineering with respect to high-performance coded design, transmission speed, and reliability under manifold coordinate systems. The system formed with limited number of basis vectors. The set of modular sums of the vectors including themselves form t-dimensional toroidal coordinate grid over the toroid, and the basis is sub-set of general number of grid coordinate set. These design techniques make it possible to configure high performance information technology for big data coding design and vector signal processing. The underlying mathematical principles relate to the optimal placement of structural elements in spatially or temporally distributed systems by the appropriate algebraic constructions based on cyclic groups in extensions of Galois fields, and development of the scientific basis for optimal solutions for wide classes of technological problems in big data process engineering and computer science.
查看更多>>摘要：Increased competitiveness of the market enforces companies to respond quickly and appropriately to sudden changes in the market in order to adapt to continuously updated conditions of business environment and keep their survivals. Agility concept rises at this level due to necessity of coping with unpredictable changes and uncertainty. Agility enables the firms responsiveness in a quick and an effective way to the set of interdependent changes required in design, production, marketing and organization of the companies. This study addresses agile supplier selection problem. Hierarchical fuzzy technique for order preference by similarity to ideal solution approach (TOPSIS) is proposed for agile supplier selection problem in an airline company.
查看更多>>摘要：In order to improve the safety of train traffic, we propose to introduce into practice a new type of rail circuits, fiber-optic rail circuits. Fiber optic cable is very sensitive to external shocks, vibration and deformation, which can play a crucial role in the detection of mechanical damage of rails and wheel sets and also to improve the positioning of the rolling stock. The branches of the fiber optic cable not only serve as a conductor of information, but also serve as a sensor, as they can perceive vibration. An OTDR (Optical Time Domain Reflectometer) analyzes the backscattered light signal to determine the shape of the physical impact that caused the bending. From the time between the emission of the light signal and the receipt of the backscattered signal, the fault location is calculated. The authors offer the model of the system, which will check the security problems of the trains and the rail circuits. The software of the corresponding system is presented, using the simulation techniques. The authors present the pseudo code of the software. They also offer the testing environment for the software.
Preetham GaneshBharat S. RawalAlexander PeterAndi Giri...
7页
查看更多>>摘要：The interaction between human beings has always faced different kinds of difficulties. One of those difficulties is the language barrier. It would be a tedious task for someone to learn all the syllables in a new language in a short period and converse with a native speaker without grammatical errors. Moreover, having a language translator at all times would be intrusive and expensive. We propose a novel approach to Neural Machine Translation (NMT) system using inter-language word similarity-based model training and Part-Of-Speech (POS) Tagging based model testing. We compare these approaches using two classical architectures: Luong Attention-based Sequence-to-Sequence architecture and Transformer based model. The sentences for the Luong Attention-based Sequence-to-Sequence were tokenized using SentencePiece tokenizer. The sentences for the Transformer model were tokenized using Subword Text Encoder. Three European languages were selected for modeling, namely, Spanish, French, and German. The datasets were downloaded from multiple sources such as Europarl Corpus, Paracrawl Corpus, and Tatoeba Project Corpus. Sparse Categorical CrossEntropy was the evaluation metric during the training stage, and during the testing stage, the Bilingual Evaluation Understudy (BLEU) Score, Precision Score, and Metric for Evaluation of Translation with Explicit Ordering (METEOR) score were the evaluation metrics.
MERVE NUR CAKIRMEHWISH SALEEMIKARL-HEINZ ZIMMERMANN
5页
查看更多>>摘要：Semiautomata are abstractions of electronic devices that are deterministic finite-state machines having inputs but no outputs. Generalized semiautomata are obtained from stochastic semiautomata by dropping the restrictions imposed by probability. It is well-known that each stochastic semiautomaton can be decomposed into a sequential product of a dependent source and deterministic semiautomaton making partly use of the celebrated theorem of Birkhoff-von Neumann. It will be shown that each generalized semiautomaton can be partitioned into a sequential product of a generalized dependent source and a deterministic semiautomaton.
查看更多>>摘要：This paper presents a novel work on localization of transmitters using triangulation with sensors at fixed positions. This is achieved when three or more sensors cover the whole area, a factor which enables the system to perform localization via triangulation. The network needs to keep a high detection rate which, in most cases, is achieved by adequate sensor coverage. Various tests using various grids of sensors have been carried out to investigate the way the system operates in different cases using a lot of transmitters. Detection complexity is tackled by finding the optimal detecting sensor radius in order the network to continue operate normally. The coverage quality changes in the area of interest and the network is able to detect new transmitters that might enter it's area. It is also shown that as the number of transmitters increases the network keeps its high performance by using additional groups of sensors in a sub-region area of that of interest. This way, even when the network is saturated by many transmitters in one region, new transmitters can still be detected.
查看更多>>摘要：Various switching networks have been investigated because of their practical importance and theoretical interests. Among these networks, this study focuses on the Clos network. A Clos network is constructed by placing switches in three stages. In the first and third stages, r (r > 1) switches are aligned, whereas m (m > 1) switches are aligned in the second stage. There are n inputs and m outputs in the first stage. Symmetrically, the third stage switch has m inputs and n outputs. For this configuration, if n ≤ m ≤ 2n-2, the network is rearrangeable. Though existing connections in a rearrangeable network may block a newly requested connection, the blocking is always removed by rerouting existing connections. An interesting problem arose during this process is how many existing connections must be rearranged: the number of rearrangements. Although the problem has been studied for a long time, the number of rearrangements is not completely clarified for arbitrary combinations of parameters m, n, and r. This study presents a new upper bound on the number of rearrangements for 2 < n ≤ m < 2n-2. This bound is derived from the extended connection chain concept proposed in a previous study. Using this concept, the paper first derives from the case where a parameter, s, represents the load on a second-stage switch. Then, the paper presents another new upper bound, which is independent of parameters. The study shows that the presented upper bound is smaller than the previously known bounds for a certain range of m.
查看更多>>摘要：Some results for the traveling salesman problem (TSP) are known for a prime number of cities. In this paper we extend these results to an odd number of cities. F or an odd integer n, we show that there is an algorithm that generates n - 1 cyclic permutations, called tours for the traveling salesman problem, which cover the distance matrix. The algorithm allows construction of a two-dimensional array of all tours for the TSP on an odd number of cities. The array has the following properties: (i) A tour on a vertical line in the array moves the salesman uniquely compared to all other tours on the vertical line. (ii) The sum of the lengths of all tours on a vertical line is equal to the sum of all non-diagonal elements in the distance matrix for the TSP.
查看更多>>摘要：Petri net structures can benefit from being modelled using graph drawing approaches. This work presents some advanced graph drawing approaches that can be used for visualising Petri net models. These are i) topological shape metrics, ii) visibility drawing, iii) orthogonalization, iv) hierarchical and v) bi-graph partitioning. The models show that this can be successfully done and the Petri nets that are generated in this work are suitable for visualisation. Graph visualisation is an important topic and the results show that there is a large potential to apply this approach to drawing Petri Nets in novel ways.
NSTL