Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- research-articleDecember 2023
Improving Route-Finding Performance of Dijkstra Algorithm and Maintaining Path Visual Cue Using Douglas-Peucker Algorithm
SIET '23: Proceedings of the 8th International Conference on Sustainable Information Engineering and TechnologyPages 401–408https://doi.org/10.1145/3626641.3626941Smartphones and their mobile applications have become an inseparable part of modern daily life. One of them is a public transportation app that helps people commute with public transportation. Many public transportation service providers have mobile ...
- rfcAugust 2023
RFC 9450: Reliable and Available Wireless (RAW) Use Cases
The wireless medium presents significant specific challenges to achieve properties similar to those of wired deterministic networks. At the same time, a number of use cases cannot be solved with wires and justify the extra effort of going wireless. This ...
- research-articleAugust 2023
Path of High Quality Development of Application-oriented Undergraduate Universities in the New Era
ICDEL '23: Proceedings of the 2023 8th International Conference on Distance Education and LearningPages 327–332https://doi.org/10.1145/3606094.3606144Local application-oriented universities serve the development of local economy, and at the same time rely on its development to support themselves. Universities and local governments can coexist and prosper together. In the new era, facing the new ...
- research-articleJanuary 2023
RAD: reinforcement authentication model based on DYMO protocol for MANET
International Journal of Internet Protocol Technology (IJIPT), Volume 16, Issue 1Pages 46–57https://doi.org/10.1504/ijipt.2023.129748This article aimed to develop a new model based on DYMO protocol where a modification was proposed to route discovery and route maintenance processes. In route discovery process we made an authentication process between the nodes by using MD5 hashing ...
- rfcMay 2022
RFC 9198: Advanced Unidirectional Route Assessment (AURA)
This memo introduces an advanced unidirectional route assessment (AURA) metric and associated measurement methodology based on the IP Performance Metrics (IPPM) framework (RFC 2330). This memo updates RFC 2330 in the areas of path-related terminology and ...
-
- research-articleMay 2022
Extensive Study on Integer Factorization With Valuated Binary Tree
ICIIT '22: Proceedings of the 2022 7th International Conference on Intelligent Information TechnologyPages 77–82https://doi.org/10.1145/3524889.3524913The paper makes an extensive study on integer factorization with valuated binary tree with on approach that can easily find a node one of whose ancestors contains computable information to factorize an objective odd integer. It proves that an odd ...
- research-articleJanuary 2021
Non-attracting regions of local minima in deep and wide neural networks
The Journal of Machine Learning Research (JMLR), Volume 22, Issue 1Article No.: 143, Pages 6352–6385Understanding the loss surface of neural networks is essential for the design of models with predictable performance and their success in applications. Experimental results suggest that sufficiently deep and wide neural networks are not negatively ...
- research-articleJanuary 2021
Research on adaptive prediction of multimedia data transmission path based on machine learning
International Journal of Information and Communication Technology (IJICT), Volume 19, Issue 3Pages 310–325https://doi.org/10.1504/ijict.2021.117534Aiming at the problems of high probability of data packet loss and long data receiving delay in current methods, an adaptive prediction method of multimedia data transmission path based on machine learning is proposed. This paper analyses the path length ...
- research-articleJanuary 2021
Atomicity and Well Quasi-Order for Consecutive Orderings on Words and Permutations
SIAM Journal on Discrete Mathematics (SIDMA), Volume 35, Issue 1Pages 495–520https://doi.org/10.1137/20M1338411Algorithmic decidability is established for two order-theoretic properties of downward closed subsets defined by finitely many obstructions in two infinite posets. The properties under consideration are (a) being atomic, i.e., not being decomposable as a ...
- short-paperFebruary 2020
An Efficient Clustering based Data Collection using Mobile Sink in Wireless Sensor Networks
ICDCN '20: Proceedings of the 21st International Conference on Distributed Computing and NetworkingArticle No.: 6, Pages 1–5https://doi.org/10.1145/3369740.3369769Data collection using mobile sink is a popular method that mitigates the sink hole problem in wireless sensor networks. In this regard, rendezvous point based data collection is a well-researched topic as it overcomes the problems of latency in data ...
- research-articleJanuary 2020
On construction of fuzzy chromatic number of cartesian product of path and other fuzzy graphs
Journal of Intelligent & Fuzzy Systems: Applications in Engineering and Technology (JIFS), Volume 39, Issue 1Pages 1073–1080https://doi.org/10.3233/JIFS-191982We use the notion of fuzzy chromatic number (FCN) of fuzzy graphs based on fuzzy independent vertex sets introduced in 2015. Let G ˜ 1 be a path fuzzy graph and G ˜ 2 be any fuzzy graphs where their vertex sets are disjoint. Let G ˜ = G ˜ 1 □ G ˜ 2 be a cartesian product of G ˜ 1 and G ˜ 2 . In ...
- research-articleSeptember 2019
The Degree of Parallelism in Generalized Stochastic Network
Automation and Remote Control (ARCO), Volume 80, Issue 9Pages 1694–1703https://doi.org/10.1134/S0005117919090108AbstractFor the generalized stochastic network the concept of degree of parallelism is entered. The method of determination of this value is offered. It makes the choice of the minimum number of performers of the network at which there is no formation of ...
- research-articleJanuary 2019
On $k$-Neighbor Separated Permutations
SIAM Journal on Discrete Mathematics (SIDMA), Volume 33, Issue 3Pages 1691–1711https://doi.org/10.1137/17M1158744Two permutations $\pi_1,\pi_2$ of $[n]=\{1,2, \ldots, n\}$ are $k$-neighbor separated if there are two elements $a,b \in [n]$ that are neighbors in one of the permutations and that are separated by exactly $k-2$ other elements in the other permutation. (For ...
- research-articleOctober 2017
SVG image comparison using commands of element path
SCAMS '17: Proceedings of the Mediterranean Symposium on Smart City ApplicationArticle No.: 14, Pages 1–4https://doi.org/10.1145/3175628.3175636In this paper1, we propose a new method to compare two SVG images, based on attributes of Path tag each image will be characterized by 19 numeric values, which represent the structure of the path. The Euclidian distance is not suitable to compare ...
- research-articleApril 2017
DuckTracks: Path-based Object Allocation Tracking
ICPE '17: Proceedings of the 8th ACM/SPEC on International Conference on Performance EngineeringPages 327–330https://doi.org/10.1145/3030207.3030235Efficiently tracking an application's object allocations is of interest for areas such as memory leak detection or memory usage optimization. The state-of-the-art approach of instrumenting every allocation site with a counter introduces considerable ...
- research-articleJanuary 2017
The exploration of the path of super-sovereign currency
ICMSS '17: Proceedings of the 2017 International Conference on Management Engineering, Software Engineering and Service SciencesPages 311–315https://doi.org/10.1145/3034950.3035001With the emergence and development of electronic currency, especially bitcoin turning out, it provided a new way of thinking for the realization of the super-sovereign currency. In this situation, what is the evolution of the super-sovereign currency ...
- articleNovember 2016
(a, d)-Distance Antimagic Labeling of Some Types of Graphs
Cybernetics and Systems Analysis (KLU-CASA), Volume 52, Issue 6Pages 950–955https://doi.org/10.1007/s10559-016-9897-zWe analyze the necessary existence conditions for (a, d)-distance antimagic labeling of a graph G = (V, E) of order n. We obtain theorems that expand the family of not (a, d) -distance antimagic graphs. In particular, we prove that the crown Pn ź P1 ...
- invited-talkJuly 2016
Practical analytic 2D signed distance field generation
SIGGRAPH '16: ACM SIGGRAPH 2016 TalksArticle No.: 68, Pages 1–2https://doi.org/10.1145/2897839.2927417In this talk, we present a novel technique to generate Signed Distance Fields (SDF) from vector paths. Unlike existing methods, instead of first rasterizing a path to a bitmap and then deriving the SDF, we can calculate the minimum distance for each ...
- research-articleMarch 2015
Path Bending: Interactive Human-Robot Interfaces With Collision-Free Correction of User-Drawn Paths
IUI '15: Proceedings of the 20th International Conference on Intelligent User InterfacesPages 186–190https://doi.org/10.1145/2678025.2701402Enabling natural and intuitive communication with robots calls for the design of intelligent user interfaces. As robots are introduced into applications with novice users, the information obtained from such users may not always be reliable. This paper ...