Relevant bibliographies by topics / Mapping Algorithm / Journal articles

Journal articles on the topic 'Mapping Algorithm'

To see the other types of publications on this topic, follow the link: Mapping Algorithm.
Author: Grafiati
Published: 4 June 2021
Last updated: 4 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 journal articles for your research on the topic 'Mapping Algorithm.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.

1

CHUNG, I.-HSIN, CHE-RUNG LEE, JIAZHENG ZHOU, and YEH-CHING CHUNG. "HIERARCHICAL MAPPING FOR HPC APPLICATIONS." Parallel Processing Letters 21, no. 03 (September 2011): 279–99. http://dx.doi.org/10.1142/s0129626411000229.

Full text
Abstract:
As the high performance computing systems scale up, mapping the tasks of a parallel application onto physical processors to allow efficient communication becomes one of the critical performance issues. Existing algorithms were usually designed to map applications with regular communication patterns. Their mapping criterion usually overlooks the size of communicated messages, which is the primary factor of communication time. In addition, most of their time complexities are too high to process large scale problems. In this paper, we present a hierarchical mapping algorithm (HMA), which is capable of mapping applications with irregular communication patterns. It first partitions tasks according to their run-time communication information. The tasks that communicate with each other more frequently are regarded as strongly connected. Based on their connectivity strength, the tasks are partitioned into supernodes based on the algorithms in spectral graph theory. The hierarchical partitioning reduces the mapping algorithm complexity to achieve scalability. Finally, the run-time communication information will be used again in fine tuning to explore better mappings. With the experiments, we show how the mapping algorithm helps to reduce the point-to-point communication time for the PDGEMM, a ScaLAPACK matrix multiplication computation kernel, up to 20% and the AMG2006, a tier 1 application of the Sequoia benchmark, up to 7%.
APA, Harvard, Vancouver, ISO, and other styles
2

Villaseñor, Carlos, Nancy Arana-Daniel, Alma Alanis, Carlos Lopez-Franco, and Javier Gomez-Avila. "Multiellipsoidal Mapping Algorithm." Applied Sciences 8, no. 8 (July 27, 2018): 1239. http://dx.doi.org/10.3390/app8081239.

Full text
Abstract:
The robotic mapping problem, which consists in providing a spatial model of the environment to a robot, is a research topic with a wide range of applications. One important challenge of this problem is to obtain a map that is information-rich (i.e., a map that preserves main structures of the environment and object shapes) yet still has a low memory cost. Point clouds offer a highly descriptive and information-rich environmental representation; accordingly, many algorithms have been developed to approximate point clouds and lower the memory cost. In recent years, approaches using basic and “simple” (i.e., using only planes or spheres) geometric entities for approximating point clouds have been shown to provide accurate representations at low memory cost. However, a better approximation can be implemented if more complex geometric entities are used. In the present paper, a new object-mapping algorithm is introduced for approximating point clouds with multiple ellipsoids and other quadratic surfaces. We show that this algorithm creates maps that are rich in information yet low in memory cost and have features suitable for other robotics problems such as navigation and pose estimation.
APA, Harvard, Vancouver, ISO, and other styles
3

Komatsu, Yuki, and Pierre Jais. "Practical Mapping Algorithm." Cardiac Electrophysiology Clinics 5, no. 2 (June 2013): 161–68. http://dx.doi.org/10.1016/j.ccep.2013.01.008.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Aleomraninejad, Seyed, Kanokwan Sitthithakerngkiet, and Poom Kumam. "Hybrid subgradient algorithm for equilibrium and fixed point problems by approximation of nonexpansive mapping." Filomat 34, no. 5 (2020): 1721–29. http://dx.doi.org/10.2298/fil2005721a.

Full text
Abstract:
In this paper anew algorithm considered on a real Hilbert space for finding acommonpoint in the solution set of a class of pseudomonotone equilibrium problem and the set of fixed points of nonexpansive mappings. We produce this algorithm by mappings Tk that are approximations of non-expansive mapping T. The strong convergence theorem of the proposed algorithms is investigated. Our results generalize some recent results in the literature.
APA, Harvard, Vancouver, ISO, and other styles
5

Vargas-Vera, Maria, and Miklos Nagy. "Architecture of DSSim." International Journal of Knowledge Society Research 6, no. 2 (April 2015): 65–82. http://dx.doi.org/10.4018/ijksr.2015040104.

Full text
Abstract:
This paper presents the architecture of DSSim (DSSim stands for Similarity based on Dempster-Shafer) our multi-agent ontology mapping system. It describes several types of agents and their roles in the DSSim architecture. These agents are mapping agents which are able to perform either semantic or syntactic similarity. The authors' architecture is generic as no mappings need to be learned in advance and it could be easily extended by adding new mapping agents in the framework. These new mapping agents could run different similarity algorithms either semantic or syntactic. In this way, DSSim could assess which algorithm has a better performance. Additionally, this paper presents the main algorithms used in DSSim and discusses DSSim advantages and drawbacks.
APA, Harvard, Vancouver, ISO, and other styles
6

Vargas-Vera, Maria. "The Implementation of DSSim." International Journal of Knowledge Society Research 8, no. 3 (July 2017): 34–53. http://dx.doi.org/10.4018/ijksr.2017070103.

Full text
Abstract:
This paper presents the decisions taken during the implementation of DSSim (DSSim stands for Similarity based on Dempster-Shafer) our multi-agent ontology mapping system. It describes several types of agents and their roles in the DSSim architecture. These agents are mapping agents which are able to perform either semantic or syntactic similarity. Our architecture is generic as no mappings need to be learned in advance and it could be easily extended by adding new mapping agents in the framework. The new added mapping agents could run different similarity algorithms (either semantic or syntactic). In this way, DSSim could assess which algorithm has a better performance. Additionally, this paper presents the algorithms used in our ontology alignment system DSSim.
APA, Harvard, Vancouver, ISO, and other styles
7

Zhang, Jingling, Yongfu Su, and Qingqing Cheng. "Hybrid Algorithm of Fixed Point for Weak Relatively Nonexpansive Multivalued Mappings and Applications." Abstract and Applied Analysis 2012 (2012): 1–13. http://dx.doi.org/10.1155/2012/479438.

Full text
Abstract:
The purpose of this paper is to present the notion of weak relatively nonexpansive multi-valued mapping and to prove the strong convergence theorems of fixed point for weak relatively nonexpansive multivalued mappings in Banach spaces. The weak relatively nonexpansive multivalued mappings are more generalized than relatively nonexpansive multivalued mappings. In this paper, an example will be given which is a weak relatively nonexpansive multivalued mapping but not a relatively nonexpansive multivalued mapping. In order to get the strong convergence theorems for weak relatively nonexpansive multivalued mappings, a new monotone hybrid iteration algorithm with generalized (metric) projection is presented and is used to approximate the fixed point of weak relatively nonexpansive multivalued mappings. In this paper, the notion of multivalued resolvent of maximal monotone operator has been also presented which is a weak relatively nonexpansive multivalued mapping and can be used to find the zero point of maximal monotone operator.
APA, Harvard, Vancouver, ISO, and other styles
8

Turney, P. D. "The Latent Relation Mapping Engine: Algorithm and Experiments." Journal of Artificial Intelligence Research 33 (December 22, 2008): 615–55. http://dx.doi.org/10.1613/jair.2693.

Full text
Abstract:
Many AI researchers and cognitive scientists have argued that analogy is the core of cognition. The most influential work on computational modeling of analogy-making is Structure Mapping Theory (SMT) and its implementation in the Structure Mapping Engine (SME). A limitation of SME is the requirement for complex hand-coded representations. We introduce the Latent Relation Mapping Engine (LRME), which combines ideas from SME and Latent Relational Analysis (LRA) in order to remove the requirement for hand-coded representations. LRME builds analogical mappings between lists of words, using a large corpus of raw text to automatically discover the semantic relations among the words. We evaluate LRME on a set of twenty analogical mapping problems, ten based on scientific analogies and ten based on common metaphors. LRME achieves human-level performance on the twenty problems. We compare LRME with a variety of alternative approaches and find that they are not able to reach the same level of performance.
APA, Harvard, Vancouver, ISO, and other styles
9

Gavhane, Bhagyashree Ashok, and Prashant Vitthalrao Kathole. "Alternative RAM Mapping Algorithm for Embedded Memory Blocks in FPGA." International Journal of Trend in Scientific Research and Development Volume-2, Issue-3 (April 30, 2018): 2542–49. http://dx.doi.org/10.31142/ijtsrd7172.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

SHEN, C. W., R. C. T. LEE, and Y. H. CHIN. "A PARALLEL NONLINEAR MAPPING ALGORITHM." International Journal of Pattern Recognition and Artificial Intelligence 01, no. 01 (April 1987): 53–69. http://dx.doi.org/10.1142/s0218001487000059.

Full text
Abstract:
In this paper, we shall present a parallel algorithm to perform nonlinear mapping which is useful for clustering analysis and pattern recognition. This parallel nonlinear mapping algorithm is slightly different from the original nonlinear mapping algorithm. Experimental results show that our parallel nonlinear mapping algorithm works quite well.
APA, Harvard, Vancouver, ISO, and other styles
11

Xia, Xun, and Ling Chen. "Elastic Optical Network Service-Oriented Architecture (SOA) Used for Cloud Computing and Its Resource Mapping Optimization Scheme." Journal of Nanoelectronics and Optoelectronics 15, no. 4 (April 1, 2020): 442–49. http://dx.doi.org/10.1166/jno.2020.2783.

Full text
Abstract:
In this study, starting from the elastic optical network, the layered and function isolated service-oriented architecture (SOA) is introduced, so as to propose an elastic optical network SOA for cloud computing, and further study the resource mapping of optical network. Linear mapping model, random routing mapping algorithm, load balancing mapping algorithm and link separation mapping algorithm are introduced respectively, and the resource utilization effect of different mapping algorithms for the proposed optical network is compared. During the experiment, firstly, the elastic optical network is tested. It is found that the node utilization and spectrum utilization of the underlying optical fiber level network are significantly improved. Within the average service time of 0.312 s∼0.416 s, the corresponding node utilization and spectrum utilization are 90% and 80% respectively. In the resource mapping experiment, load balancing algorithm and link separation algorithm can effectively improve the mapping success rate of services. Among them, the link separation mapping algorithm can improve the spectrum resource utilization of optical network by 15.6%. The elastic optical network SOA proposed in this study is helpful to improve the use of network resources.
APA, Harvard, Vancouver, ISO, and other styles
12

HABA, Kazumoto, Wataru HOTTA, Akihito HATA, Kazuaki WATANABE, and Muneo HORI. "SPECTRAL STOCHASTIC RETURN MAPPING ALGORITHM." Journal of Japan Society of Civil Engineers, Ser. A2 (Applied Mechanics (AM)) 73, no. 1 (2017): 34–45. http://dx.doi.org/10.2208/jscejam.73.34.

Full text
APA, Harvard, Vancouver, ISO, and other styles
13

Chen, Song, and Mary M. Eshaghian. "A fast recursive mapping algorithm." Concurrency: Practice and Experience 7, no. 5 (August 1995): 391–409. http://dx.doi.org/10.1002/cpe.4330070505.

Full text
APA, Harvard, Vancouver, ISO, and other styles
14

Heirich, A. "A Scalable Diffusion Algorithm for Dynamic Mapping and Load Balancing on Networks of Arbitrary Topology." International Journal of Foundations of Computer Science 08, no. 03 (September 1997): 329–46. http://dx.doi.org/10.1142/s0129054197000215.

Full text
Abstract:
The problems of mapping and load balancing applications on arbitrary networks are considered. A novel diffusion algorithm is presented to solve the mapping problem. It complements the well known diffusion algorithms for load balancing which have enjoyed success on massively parallel computers (MPPs). Mapping is more difficult on interconnection networks than on MPPs because of the variations which occur in network topology. Popular mapping algorithms for MPPs which depend on recursive topologies are not applicable to irregular networks. The most celebrated of these MPP algorithms use information from the Laplacian matrix of a graph of communicating processes. The diffusion algorithm presented in this paper is also derived from this Laplacian matrix. The diffusion algorithm works on arbitrary network topologies and is dramatically faster than the celebrated MPP algorithms. It is delay and fault tolerant. Time to convergence depends on initial conditions and is insensitive to problem scale. This excellent scalability, among other features, makes the diffusion algorithm a viable candidate for dynamically mapping and load balancing not only existing MPP systems but also large distributed systems like the Internet, small cluster computers, and networks of workstations.
APA, Harvard, Vancouver, ISO, and other styles
15

Sun, Jin, and Yi Zhang. "A Communication Probability-Based Mapping Algorithm for Mesh-Based Network-on-Chip Systems." Journal of Circuits, Systems and Computers 27, no. 14 (August 23, 2018): 1850226. http://dx.doi.org/10.1142/s0218126618502262.

Full text
Abstract:
Network-on-chip (NoC) mapping algorithms significantly affect NoC system performance in terms of communication cost and energy consumption. For a specific application represented by a task graph, this paper proposes an energy-efficient mapping algorithm that searches for the mapping decision with best communication locality and therefore lowest energy consumption. To this end, we formulate the concerned mapping problem as an optimization model, and propose an effective meta-heuristic algorithm to solve the formulated optimization model. During the mapping procedure, we employ a simulation-free, communication probability-based energy model to evaluate the quality of each candidate mapping. By iteratively updating the best explored mapping decision using a meta-heuristic search strategy, the mapping procedure can eventually identify an mapping decision with optimal energy efficiency in the search space. The proposed mapping algorithm has been verified on NoC systems of different sizes using a variety of benchmark applications. Simulation results demonstrate that the mapping decision produced by this algorithm achieves an up to 23% energy reduction compared with the traditional round-robin strategy.
APA, Harvard, Vancouver, ISO, and other styles
16

Ai, Sumei, and Yongfu Su. "Hybrid Algorithm for Common Fixed Points of Uniformly Closed Countable Families of Hemirelatively Nonexpansive Mappings and Applications." Journal of Applied Mathematics 2012 (2012): 1–20. http://dx.doi.org/10.1155/2012/401960.

Full text
Abstract:
The authors have obtained the following results: (1) the definition of uniformly closed countable family of nonlinear mappings, (2) strong convergence theorem by the monotone hybrid algorithm for two countable families of hemirelatively nonexpansive mappings in a Banach space with new method of proof, (3) two examples of uniformly closed countable families of nonlinear mappings and applications, (4) an example which is hemirelatively nonexpansive mapping but not weak relatively nonexpansive mapping, and (5) an example which is weak relatively nonexpansive mapping but not relatively nonexpansive mapping. Therefore, the results of this paper improve and extend the results of Plubtieng and Ungchittrakool (2010) and many others.
APA, Harvard, Vancouver, ISO, and other styles
17

Song, De Rui, Ke Cao, and Yu Hao. "The Implement of Parcel Sea Map Automatic Mapping Algorithm." Advanced Materials Research 989-994 (July 2014): 1891–94. http://dx.doi.org/10.4028/www.scientific.net/amr.989-994.1891.

Full text
Abstract:
Parcel Sea Map mapping is currently implemented by manual, which causes the task tedious and error prone. To overcome this problem, this paper proposes an automatic mapping method for Parcel Sea Map. The boundary point data are basic mapping elements, which are obtained from sea cadastral survey. The mapping result can be demonstrated by two aspects: convex polygon and concave polygon. For convex polygon, well known left-turn and convex hull algorithms are adopted. For concave polygon, two algorithms are proposed. One is enumeration and the other is cutting algorithm. The above two mapping results can finally be determined by the inspector from sea cadastral survey. Experiments show that Parcel Sea Map automatic mapping can efficiently reduce the manual burden of present mapping.
APA, Harvard, Vancouver, ISO, and other styles
18

Et. al., Siva Sankara Phani T. ,. "CGRA MODULO SCHEDULING FOR ACHIEVING BETTER PERFORMANCE AND INCREASED EFFICIENCY." Turkish Journal of Computer and Mathematics Education (TURCOMAT) 12, no. 4 (April 10, 2021): 1400–1413. http://dx.doi.org/10.17762/turcomat.v12i4.1225.

Full text
Abstract:
Coarse-Grained Reconfigurable Architectures (CGRA) is an effective solution for speeding up computer-intensive activities due to its high energy efficiency and flexibility sacrifices. The timely implementation of CGRA loops was one of the hardest problems in the analysis. Modulo scheduling (MS) was productive in order to implement loops on CGRAs. The problem remains with current MS algorithms, namely to map large and irregular circuits to CGRAs over a fair period of compilation with restricted computational and high-performance routing tools. This is mainly due to an absence of awareness of major mapping limits and a time consuming approach to solving temporary and space-related mapping using CGRA buffer tools. It aims to boost the performance and robust compilation of the CGRA modulo planning algorithm. The problem with the CGRA MS is divided into time and space and the mechanisms between the two problems have to be reorganized. We have a detailed, systematic mapping fluid that addresses the algorithms of the time mapping problem with a powerful buffer algorithm and efficient connection and calculation limitations. We create a fast-stable algorithm for spatial mapping with a retransmission and rearrangement mechanism. With higher performance and quicker build-up time, our MS algorithm can map loops to CBGRA. The results show that, given the same compilation budget, our mapping algorithm results in a better rate for compilation. The performance of this method will be increased from 5% to 14%, better than the standard CGRA mapping algorithms available.
APA, Harvard, Vancouver, ISO, and other styles
19

Ryma, Guefrouchi, and Kholladi Mohamed-Khireddine. "Genetic Algorithm With Hill Climbing for Correspondences Discovery in Ontology Mapping." Journal of Information Technology Research 12, no. 4 (October 2019): 153–70. http://dx.doi.org/10.4018/jitr.2019100108.

Full text
Abstract:
Meta-heuristics are used as a tool for ontology mapping process in order to improve their performance in mapping quality and computational time. In this article, ontology mapping is resolved as an optimization problem. It aims at optimizing correspondences discovery between similar concepts of source and target ontologies. For better guiding and accelerating the concepts correspondences discovery, the article proposes a meta-heuristic hybridization which incorporates the Hill Climbing method within the mutation operator in the genetic algorithm. For test concerns, syntactic and lexical similarities are used to validate correspondences in candidate mappings. The obtained results show the effectiveness of the proposition for improving mapping performances in quality and computational time even for large OAEI ontologies.
APA, Harvard, Vancouver, ISO, and other styles
20

PENG, BO, and HONG-KUN XU. "A cyclic coordinate-update fixed point algorithm." Carpathian Journal of Mathematics 35, no. 3 (2019): 365–70. http://dx.doi.org/10.37193/cjm.2019.03.10.

Full text
Abstract:
We prove that a cyclic coordinate fixed point algorithm for nonexpansive mappings when the underlying Hilbert space is decomposed into a Cartesian product of finitely many block spaces is weakly convergent to a fixed point of the mapping under investigation. Our result relaxes a condition imposed on the stepsizes of Theorem 3.4 of Chow, et al [Chow, Y. T., Wu, T. and Yin, W., Cyclic coordinate-update algorithms for fixed-point problems: analysis and applcations, SIAM J. Sci. Comput., 39 (2017), No. 4, A1280–A1300].
APA, Harvard, Vancouver, ISO, and other styles
21

Cheng, Shi, Quande Qin, Junfeng Chen, Yuhui Shi, and Qingyu Zhang. "Analytics on Fireworks Algorithm Solving Problems with Shifts in the Decision Space and Objective Space." International Journal of Swarm Intelligence Research 6, no. 2 (April 2015): 52–86. http://dx.doi.org/10.4018/ijsir.2015040103.

Full text
Abstract:
Fireworks algorithms for solving problems with the optima shift in decision space and/or objective space are analyzed in this paper. The standard benchmark problems have several weaknesses in the research of swarm intelligence algorithms for solving single objective problems. The optimum is in the center of search range, and is the same at each dimension of the search space. The optimum shift in decision space and/or objective space could increase the difficulty of problem solving. A mapping strategy, modular arithmetic mapping, is utilized in the original fireworks algorithm to handle solutions out of search range. The solutions are implicitly guided to the center of search range for problems with symmetrical search range via this strategy. The optimization performance of fireworks algorithm on shift functions may be affected by this strategy. Four kinds of mapping strategies, which include mapping by modular arithmetic, mapping to the boundary, mapping to stochastic region, and mapping to limited stochastic region, are compared on problems with different dimensions and different optimum shift range. From experimental results, the fireworks algorithms with mapping to the boundary, or mapping to limited stochastic region obtain good performance on problems with the optimum shift. This is probably because the search tendency is kept in these two strategies. The definition of population diversity measurement is also proposed in this paper, from observation on population diversity changes, the useful information of fireworks algorithm solving different kinds of problems could be obtained.
APA, Harvard, Vancouver, ISO, and other styles
22

Drezner, Zvi, and George A. Marcoulides. "Mapping the convergence of genetic algorithms." Journal of Applied Mathematics and Decision Sciences 2006 (September 3, 2006): 1–16. http://dx.doi.org/10.1155/jamds/2006/70240.

Full text
Abstract:
This paper examines the convergence of genetic algorithms using a cluster-analytic-type procedure. The procedure is illustrated with a hybrid genetic algorithm applied to the quadratic assignment problem. Results provide valuable insight into how population members are selected as the number of generations increases and how genetic algorithms approach stagnation after many generations.
APA, Harvard, Vancouver, ISO, and other styles
23

Alakoya, Timilehin Opeyemi, Lateef Olakunle Jolaoso, and Oluwatosin Temitope Mewomo. "Two modifications of the inertial Tseng extragradient method with self-adaptive step size for solving monotone variational inequality problems." Demonstratio Mathematica 53, no. 1 (September 15, 2020): 208–24. http://dx.doi.org/10.1515/dema-2020-0013.

Full text
Abstract:
AbstractIn this work, we introduce two new inertial-type algorithms for solving variational inequality problems (VIPs) with monotone and Lipschitz continuous mappings in real Hilbert spaces. The first algorithm requires the computation of only one projection onto the feasible set per iteration while the second algorithm needs the computation of only one projection onto a half-space, and prior knowledge of the Lipschitz constant of the monotone mapping is not required in proving the strong convergence theorems for the two algorithms. Under some mild assumptions, we prove strong convergence results for the proposed algorithms to a solution of a VIP. Finally, we provide some numerical experiments to illustrate the efficiency and advantages of the proposed algorithms.
APA, Harvard, Vancouver, ISO, and other styles
24

Li, Yuanzhen, and Yingyu Zhang. "EPVNE: An Efficient Parallelizable Virtual Network Embedding Algorithm." Wireless Communications and Mobile Computing 2019 (November 22, 2019): 1–10. http://dx.doi.org/10.1155/2019/8416592.

Full text
Abstract:
Virtual network embedding (VNE) problem is a key issue in network virtualization technology, and much attention has been paid to the virtual network embedding. However, very little research work focuses on parallelized virtual network embedding problems which assumes that the substrate infrastructure supports parallel computing and allows one virtual node to be mapped to multiple substrate nodes. Based on the work of Liang and Zhang, we extend the well-known VNE to parallelizable virtual network embedding (PVNE) in this paper. Furthermore, to the best of our knowledge, we give the first formulation of the PVNE problem. A new heuristic algorithm named efficient parallelizable virtual network embedding (EPVNE) is proposed to reduce the cost of embedding the VN request and increase the VN request acceptance ratio. EPVNE is a two-stage mapping algorithm, which first performs node mapping and then performs link mapping. In the node mapping phase, we present a simple and efficient virtual node and physical node sorting formula and perform the virtual node mapping in order. When mapping virtual nodes, we map virtual nodes to physical nodes that just meet the CPU requirements. Substrate nodes with more CPU resources will be retained for subsequent virtual network mapping requests. In the link mapping phase, Dijkstra’s algorithm is used to find a substrate path for each virtual link. Finally, simulations are carried out and simulation results show that our algorithm performs better than the existing heuristic algorithms.
APA, Harvard, Vancouver, ISO, and other styles
25

Ravankar, Ankit A., Yohei Hoshino, Takanori Emaru, and Yukinori Kobayashi. "1P1-I07 A New Algorithm to Detect Lines in Noisy Environment for Indoor Robot Mapping(Localization and Mapping (2))." Proceedings of JSME annual Conference on Robotics and Mechatronics (Robomec) 2013 (2013): _1P1—I07_1—_1P1—I07_4. http://dx.doi.org/10.1299/jsmermd.2013._1p1-i07_1.

Full text
APA, Harvard, Vancouver, ISO, and other styles
26

Hamedani, Parisa Khadem, Natalie Enright Jerger, Shaahin Hessabi, and Hamid Sarbazi-Azad. "Exploration of Temperature Constraints for Thermal-Aware Mapping of 3D Networks-on-Chip." International Journal of Adaptive, Resilient and Autonomic Systems 4, no. 3 (July 2013): 42–60. http://dx.doi.org/10.4018/jaras.2013070103.

Full text
Abstract:
This paper proposes three ILP-based static thermal-aware mapping algorithms for 3D Networks-on-Chip (NoC). With these three mapping algorithms, the authors explore the thermal constraints and their effects on temperature and performance. Through complexity analysis, the authors show that the first algorithm, an optimal one, is not suitable for 3D NoCs. Therefore, the authors develop two approximation algorithms and analyze their algorithmic complexities to show their proficiency. According to simulation results, mapping algorithms that employ direct thermal calculation to minimize the temperature reduce the peak temperature by up to 24% and 22%, for the benchmarks that have the highest communication rate and largest number of tasks, respectively. This peak temperature reduction comes at the price of a higher power-delay product. The authors’ exploration shows that considering power balancing early in the mapping algorithm does not affect chip temperature. Moreover, the authors show that considering explicit performance constraints in the thermal mapping has no major effect on performance.
APA, Harvard, Vancouver, ISO, and other styles
27

Li, Wen, Chun-ming Wu, Jian Chen, and Ling-di Ping. "Virtual Network Mapping Algorithm with Repeatable Mapping over Substrate Nodes." Journal of Electronics & Information Technology 33, no. 4 (April 18, 2011): 908–14. http://dx.doi.org/10.3724/sp.j.1146.2010.00735.

Full text
APA, Harvard, Vancouver, ISO, and other styles
28

Rao, Yang, Yiying Pu, Shen-Sian Syu, and Ming-Jong Jou. "5.1: A Gamut Mapping Algorithm Based on Partition Mapping Method." SID Symposium Digest of Technical Papers 49 (April 2018): 39–41. http://dx.doi.org/10.1002/sdtp.12632.

Full text
APA, Harvard, Vancouver, ISO, and other styles
29

Gao, Xianming, Baosheng Wang, and Xiaozhe Zhang. "VR-Cluster: Dynamic Migration for Resource Fragmentation Problem in Virtual Router Platform." Scientific Programming 2016 (2016): 1–14. http://dx.doi.org/10.1155/2016/3976965.

Full text
Abstract:
Network virtualization technology is regarded as one of gradual schemes to network architecture evolution. With the development of network functions virtualization, operators make lots of effort to achieve router virtualization by using general servers. In order to ensure high performance, virtual router platform usually adopts a cluster of general servers, which can be also regarded as a special cloud computing environment. However, due to frequent creation and deletion of router instances, it may generate lots of resource fragmentation to prevent platform from establishing new router instances. In order to solve “resource fragmentation problem,” we firstly propose VR-Cluster, which introduces two extra function planes including switching plane and resource management plane. Switching plane is mainly used to support seamless migration of router instances without packet loss; resource management plane can dynamically move router instances from one server to another server by using VR-mapping algorithms. Besides, three VR-mapping algorithms including first-fit mapping algorithm, best-fit mapping algorithm, and worst-fit mapping algorithm are proposed based on VR-Cluster. At last, we establish VR-Cluster protosystem by using general X86 servers, evaluate its migration time, and further analyze advantages and disadvantages of our proposed VR-mapping algorithms to solve resource fragmentation problem.
APA, Harvard, Vancouver, ISO, and other styles
30

Liu, Chunyuan, and Qun Ding. "A Color Image Encryption Scheme Based on a Novel 3D Chaotic Mapping." Complexity 2020 (December 23, 2020): 1–20. http://dx.doi.org/10.1155/2020/3837209.

Full text
Abstract:
Low-dimensional chaotic mappings are simple functions that have low computation cost and are easy to realize, but applying them in a cryptographic algorithm will lead to security vulnerabilities. To overcome this shortcoming, this paper proposes the coupled chaotic system, which coupled the piecewise and Henon mapping. Simulation results indicate that the novel mapping has better complexity and initial sensitivity and larger key space compared with the original mapping. Then, a new color image encryption algorithm is proposed based on the new chaotic mapping. The algorithm has two processes: diffusion and confusion. In this scheme, the key is more than 2 216 , and SSIM and PSNR are 0.009675 and 8.6767, respectively. The secret key is applied in the shuffling and diffusion. Security analysis indicates that the proposed scheme can resist cryptanalytic attacks. It has superior performance and has high security.
APA, Harvard, Vancouver, ISO, and other styles
31

Kadry, Seifedine, Gennady Alferov, and Viktor Fedorov. "D-Star Algorithm Modification." International Journal of Online and Biomedical Engineering (iJOE) 16, no. 08 (July 17, 2020): 108. http://dx.doi.org/10.3991/ijoe.v16i08.14243.

Full text
Abstract:
One of the most effective methods for solving a navigation problem is the method of constructing a navigation system based on the simultaneous localization and mapping algorithm and obstacle avoidance algorithms. One of the most effective obstacles avoidance algorithms is the D-star algorithm [1, 2, 3], which, despite its effectiveness, has some drawbacks. This modification allows to eliminate some problems arising during the implementation of the navigation system.
APA, Harvard, Vancouver, ISO, and other styles
32

Serpeloni, Felipe, Regina Moraes, and Rodrigo Bonacin. "Ontology Mapping Validation." International Journal of Web Portals 3, no. 3 (July 2011): 1–11. http://dx.doi.org/10.4018/jwp.2011070101.

Full text
Abstract:
The use of ontologies and ontology mappings is increasing in companies. Often the same context is modeled in different ontologies. Mapping is necessary to integrate these ontologies; however, in many cases these mappings are incorrect, i.e., they incorrectly link semantic concepts with different meanings. Tools that validate these mappings are necessary to ensure reliable communication between heterogeneous systems. This validation cannot be done in a completely automatic way, because the mappings are based on human interpretation. This work describes a semi-automatic tool that supports this activity, based on graphs that generate instances validated in a semi-automatic process that aims to ensure mapping robustness. This algorithm deals with an NP-Complete problem in order to generate all the instances. This paper presents a first prototype of the tool and the methodology used to validate the instances automatically generated by the tool.
APA, Harvard, Vancouver, ISO, and other styles
33

Liyashenko, D. "Algorithm of international relations geoinformation mapping." Bulletin of Taras Shevchenko National University of Kyiv. Geography, no. 65 (2016): 48–52. http://dx.doi.org/10.17721/1728-2721.2016.65.10.

Full text
Abstract:
The objective of the article is to show the algorithm of international relations geoinformation mapping. During the mapping we can mine unknown or hidden knowledge which can be understood from the spatial database and improve the ability of interpreting data. The algorithm of mapping can be divided into five phases described as follows: investigation of potential map user’s demands, spatial data analysis and selection (accuracy, consistency, fullness); scale, map projections and map composition choice (main meridian, map frame, map distortions), spatial data preprocessing (metadata description, data normalization, data generalization, data quality control, error detection, anomalies, duplication and noise detection, correction of errors, data deduplication), data mining (creation of classifications, cluster and factor analysis, decision trees, neural networks, self-organizing maps, association rules, quality assessment), map creation, knowledge representation and evaluation. The article arranges experience of international relations geoinformation mapping. The international relations maps of Ukraine potential users (state and region management, educational, cultural, advocacy, international marketing and advertising, media business), subjects (substance, energy and information flows) and indicators arrays are proposed. Main subjects of maps can be described as follows: military-political, economicpolitical, socio-political and ideological relations; migrations and refugees, international tourism, export and import of goods and services, information flows (flows of culture elements, artifacts and tangible cultural monuments, scientific knowledge, ideas, technologies, traditions, beliefs, ideology, etc.), transport and business infrastructure. The requirements for spatial data sources for international relations geoinformation mapping are defined. The algorithm of international relations static and interactive maps creation and analysis are founded. The flow chart of Ukraine international relations geoinformation mapping algorithm is presented.
APA, Harvard, Vancouver, ISO, and other styles
34

Zhu, Sheng Jie, and Xin Huan Feng. "Mountain Mapping Relaying Communication Positioning Algorithm." Applied Mechanics and Materials 336-338 (July 2013): 1804–8. http://dx.doi.org/10.4028/www.scientific.net/amm.336-338.1804.

Full text
Abstract:
Naturally, for the mountain mapping, the communication system's power is limited, As a matter of fact, the stations should be built as high as possible in order to eliminate the terrain shielding and radiate to the farther areas, however the number of users or other aspects also counts, In this paper, we introduced new methods to locate the modified location for the base stations in the mountain areas, and with this method, we use less stations to cover the most areas in the given situation. For a random mountain terrain. the coverage rate of this model is as high as 95.1%.
APA, Harvard, Vancouver, ISO, and other styles
35

PAN Ding-ping, 潘定平, and 吴学忠 WU Xue-zhong. "Strategy of RGBW display mapping algorithm." Chinese Journal of Liquid Crystals and Displays 34, no. 2 (2019): 194–99. http://dx.doi.org/10.3788/yjyxs20193402.0194.

Full text
APA, Harvard, Vancouver, ISO, and other styles
36

Roman, Chris, and Hanumant Singh. "A Self-Consistent Bathymetric Mapping Algorithm." Journal of Field Robotics 24, no. 1-2 (January 2007): 23–50. http://dx.doi.org/10.1002/rob.20164.

Full text
APA, Harvard, Vancouver, ISO, and other styles
37

HSU, C. S. "GLOBAL ANALYSIS BY CELL MAPPING." International Journal of Bifurcation and Chaos 02, no. 04 (December 1992): 727–71. http://dx.doi.org/10.1142/s0218127492000422.

Full text
Abstract:
This paper deals with cell mapping methodology for global analysis of nonlinear dynamical systems. It serves a mixed set of purposes. It is basically a tutorial paper on cell mapping. But, it also reports on certain new developments in cell mapping and includes a summary of recent publications on the topic. Presented in Sec. 1–3 and 5 are the basic concepts and theory of cell mapping. Two types of cell-to-cell mapping are discussed, namely: simple cell mapping and generalized cell mapping. Once a dynamical system has been cast in the form of a cell mapping, one needs to extract the system behavior from the mapping. In Secs. 4 and 6, computation algorithms for simple cell mapping and generalized cell mapping are discussed in detail. Moreover, a workshop-type example is included to guide the reader if he wishes to gain a working knowledge of the methodology. The new developments presented in the paper include an algorithm for processing simple cell mappings and a theory of subdomain-to-subdomain global transient analysis of generalized cell mapping. These are reported in Secs. 4–6. Listed in the last section are publications on cell mapping, including applications in many rather diversified areas of dynamics. Hopefully, the breadth of the examples of application will indicate the potential of the cell mapping method.
APA, Harvard, Vancouver, ISO, and other styles
38

Zhang, Gong, Yongjian Zhang, and Jingjie Jin. "The Ultrafast and Accurate Mapping Algorithm FANSe3: Mapping a Human Whole-Genome Sequencing Dataset Within 30 Minutes." Phenomics 1, no. 1 (February 2021): 22–30. http://dx.doi.org/10.1007/s43657-020-00008-5.

Full text
Abstract:
AbstractAligning billions of reads generated by the next-generation sequencing (NGS) to reference sequences, termed “mapping”, is the time-consuming and computationally-intensive process in most NGS applications. A Fast, accurate and robust mapping algorithm is highly needed. Therefore, we developed the FANSe3 mapping algorithm, which can map a 30 × human whole-genome sequencing (WGS) dataset within 30 min, a 50 × human whole exome sequencing (WES) dataset within 30 s, and a typical mRNA-seq dataset within seconds in a single-server node without the need for any hardware acceleration feature. Like its predecessor FANSe2, the error rate of FANSe3 can be kept as low as 10–9 in most cases, this is more robust than the Burrows–Wheeler transform-based algorithms. Error allowance hardly affected the identification of a driver somatic mutation in clinically relevant WGS data and provided robust gene expression profiles regardless of the parameter settings and sequencer used. The novel algorithm, designed for high-performance cloud-computing after infrastructures, will break the bottleneck of speed and accuracy in NGS data analysis and promote NGS applications in various fields. The FANSe3 algorithm can be downloaded from the website: http://www.chi-biotech.com/fanse3/.
APA, Harvard, Vancouver, ISO, and other styles
39

Gupta, Sanjeev, Shamshad Husain, and Vishnu Mishra. "Variational inclusion governed by αβ-H((.,.),(.,.))-mixed accretive mapping." Filomat 31, no. 20 (2017): 6529–42. http://dx.doi.org/10.2298/fil1720529g.

Full text
Abstract:
In this paper, we look into a new concept of accretive mappings called ??-H((.,.),(.,.))-mixed accretive mappings in Banach spaces. We extend the concept of proximal-point mappings connected with generalized m-accretive mappings to the ??-H((.,.),(.,.))-mixed accretive mappings and discuss its characteristics like single-valuable and Lipschitz continuity. Some illustration are given in support of ??-H((.,.),(.,.))-mixed accretive mappings. Since proximal point mapping is a powerful tool for solving variational inclusion. Therefore, As an application of introduced mapping, we construct an iterative algorithm to solve variational inclusions and show its convergence with acceptable assumptions.
APA, Harvard, Vancouver, ISO, and other styles
40

Zhang, Xuexi, Jiajun Lai, Dongliang Xu, Huaijun Li, and Minyue Fu. "2D Lidar-Based SLAM and Path Planning for Indoor Rescue Using Mobile Robots." Journal of Advanced Transportation 2020 (November 16, 2020): 1–14. http://dx.doi.org/10.1155/2020/8867937.

Full text
Abstract:
As the basic system of the rescue robot, the SLAM system largely determines whether the rescue robot can complete the rescue mission. Although the current 2D Lidar-based SLAM algorithm, including its application in indoor rescue environment, has achieved much success, the evaluation of SLAM algorithms combined with path planning for indoor rescue has rarely been studied. This paper studies mapping and path planning for mobile robots in an indoor rescue environment. Combined with path planning algorithm, this paper analyzes the applicability of three SLAM algorithms (GMapping algorithm, Hector-SLAM algorithm, and Cartographer algorithm) in indoor rescue environment. Real-time path planning is studied to test the mapping results. To balance path optimality and obstacle avoidance, A ∗ algorithm is used for global path planning, and DWA algorithm is adopted for local path planning. Experimental results validate the SLAM and path planning algorithms in simulated, emulated, and competition rescue environments, respectively. Finally, the results of this paper may facilitate researchers quickly and clearly selecting appropriate algorithms to build SLAM systems according to their own demands.
APA, Harvard, Vancouver, ISO, and other styles
41

Chidume, C. E., K. R. Kazmi, and H. Zegeye. "Iterative approximation of a solution of a general variational-like inclusion in Banach spaces." International Journal of Mathematics and Mathematical Sciences 2004, no. 22 (2004): 1159–68. http://dx.doi.org/10.1155/s0161171204209395.

Full text
Abstract:
We introduce a class ofη-accretive mappings in a real Banach space and show that theη-proximal point mapping forη-m-accretive mapping is Lipschitz continuous. Further, we develop an iterative algorithm for a class of general variational-like inclusions involvingη-accretive mappings in real Banach space, and discuss its convergence criteria. The class ofη-accretive mappings includes several important classes of operators that have been studied by various authors.
APA, Harvard, Vancouver, ISO, and other styles
42

Ye, Xin, Zhi Jing Zhang, and Xiao Feng Zhang. "Force-Pose Nonlinear Mapping Algorithm for Assembling Micro-Mechanical System." Advanced Materials Research 314-316 (August 2011): 1829–35. http://dx.doi.org/10.4028/www.scientific.net/amr.314-316.1829.

Full text
Abstract:
In order to precisely get the assembly statement when two micro-mechanical parts are touching, assembly methods mapping the nonlinear relationship between micro-force/torque and assembling pose are studied. The research platform is 12 degree-of-freedom (DOF) microassembly system with large-motion-range and precise-motion-accuracy. After assembly mechanism of micro- mechanical system is introduced, assembly methods utilizing both three-dimensional (3D) search algorithm and Back Propagation (BP) neural network are brought forward on the basis of micro-force/torque information feedback. In addition, two different neural network algorithms -- gradient descent and Levenberg-Marquardt (L-M) -- are further applied in the assembly process. Comparison among above algorithms was carried out in experiments, and the results indicated that BP neural networks were more reliable than 3D search algorithm in the relationship mapping process while the convergence rate of L-M algorithm was much faster than that of the gradient descent.
APA, Harvard, Vancouver, ISO, and other styles
43

Peng, Weiping, Shuang Cui, and Cheng Song. "One-time-pad cipher algorithm based on confusion mapping and DNA storage technology." PLOS ONE 16, no. 1 (January 20, 2021): e0245506. http://dx.doi.org/10.1371/journal.pone.0245506.

Full text
Abstract:
In order to solve the problems of low computational security in the encoding mapping and difficulty in practical operation of biological experiments in DNA-based one-time-pad cryptography, we proposed a one-time-pad cipher algorithm based on confusion mapping and DNA storage technology. In our constructed algorithm, the confusion mapping methods such as chaos map, encoding mapping, confusion encoding table and simulating biological operation process are used to increase the key space. Among them, the encoding mapping and the confusion encoding table provide the realization conditions for the transition of data and biological information. By selecting security parameters and confounding parameters, the algorithm realizes a more random dynamic encryption and decryption process than similar algorithms. In addition, the use of DNA storage technologies including DNA synthesis and high-throughput sequencing ensures a viable biological encryption process. Theoretical analysis and simulation experiments show that the algorithm provides both mathematical and biological security, which not only has the difficult advantage of cracking DNA biological experiments, but also provides relatively high computational security.
APA, Harvard, Vancouver, ISO, and other styles
44

Bedkowski, Janusz, Timo Röhling, Frank Hoeller, Dirk Shulz, and Frank E. Schneider. "Benchmark of 6D SLAM (6D Simultaneous Localisation and Mapping) Algorithms with Robotic Mobile Mapping Systems." Foundations of Computing and Decision Sciences 42, no. 3 (September 1, 2017): 275–95. http://dx.doi.org/10.1515/fcds-2017-0014.

Full text
Abstract:
AbstractThis work concerns the study of 6DSLAM algorithms with an application of robotic mobile mapping systems. The architecture of the 6DSLAM algorithm is designed for evaluation of different data registration strategies. The algorithm is composed of the iterative registration component, thus ICP (Iterative Closest Point), ICP (point to projection), ICP with semantic discrimination of points, LS3D (Least Square Surface Matching), NDT (Normal Distribution Transform) can be chosen. Loop closing is based on LUM and LS3D. The main research goal was to investigate the semantic discrimination of measured points that improve the accuracy of final map especially in demanding scenarios such as multi-level maps (e.g., climbing stairs). The parallel programming based nearest neighborhood search implementation such as point to point, point to projection, semantic discrimination of points is used. The 6DSLAM framework is based on modified 3DTK and PCL open source libraries and parallel programming techniques using NVIDIA CUDA. The paper shows experiments that are demonstrating advantages of proposed approach in relation to practical applications. The major added value of presented research is the qualitative and quantitative evaluation based on realistic scenarios including ground truth data obtained by geodetic survey. The research novelty looking from mobile robotics is the evaluation of LS3D algorithm well known in geodesy.
APA, Harvard, Vancouver, ISO, and other styles
45

Yong, Dong, Wu Chuansheng, and Guo Haimin. "Particle Swarm Optimization Algorithm with Adaptive Chaos Perturbation." Cybernetics and Information Technologies 15, no. 6 (December 1, 2015): 70–80. http://dx.doi.org/10.1515/cait-2015-0068.

Full text
Abstract:
Abstract Most of the existing chaotic particle swarm optimization algorithms use logistic chaotic mapping. However, the chaotic sequence which is generated by the logistic chaotic mapping is not uniform enough. As a solution to this defect, this paper introduces the Anderson chaotic mapping to the chaotic particle swarm optimization, using it to initialize the position and velocity of the particle swarm. It self-adaptively controls the portion of particles to undergo chaos update through a change of the fitness variance. The numerical simulation results show that the convergence and global searching capability of the modified algorithm have been improved with the introduction of this mapping and it can efficiently avoid premature convergence.
APA, Harvard, Vancouver, ISO, and other styles
46

Su, Lijuan, Yue Xu, Yan Yuan, and Jingyi Yang. "Combining Pixel Swapping and Simulated Annealing for Land Cover Mapping." Sensors 20, no. 5 (March 9, 2020): 1503. http://dx.doi.org/10.3390/s20051503.

Full text
Abstract:
Mixed pixels commonly exist in low-resolution remote sensing images, and they are the key factors hindering the classification of land covers and high-precision mapping. To obtain the spatial information at the subpixel level, subpixel mapping (SPM) technologies, including the pixel-swapping algorithm (PSA), that use the unmixed proportions of various land covers and allocate subpixel land covers have been proposed. However, the PSA often falls into a local optimum solution. In this paper, we propose a SPM method, the PSA_MSA algorithm, that combines the PSA and the modified simulated annealing algorithm to find the global optimum solution. The modified simulated annealing algorithm swaps subpixels within a certain range to escape the local optimum solution. The method also optimizes all the mixed pixels in a randomized sequence to further improve the mapping accuracy. The experimental results demonstrate that the proposed PSA_MSA algorithm outperforms the existing PSA-based algorithms for SPM. The images with different spatial dependences are tested and the results show that the proposed algorithm is more suitable for images with high spatial autocorrelation. In addition, the effect of proportion error is analyzed by adding it in the experiments. The result shows that a higher proportion error rate leads to larger degradation of the subpixel mapping accuracy. Finally, the performance of PSA_MSA algorithm with different ranges of selection on subpixel-swapping is analyzed.
APA, Harvard, Vancouver, ISO, and other styles
47

Zipf, Peter, Gilles Sassatelli, Nurten Utlu, Nicolas Saint-Jean, Pascal Benoit, and Manfred Glesner. "A Decentralised Task Mapping Approach for Homogeneous Multiprocessor Network-On-Chips." International Journal of Reconfigurable Computing 2009 (2009): 1–14. http://dx.doi.org/10.1155/2009/453970.

Full text
Abstract:
We present a heuristic algorithm for the run-time distribution of task sets in a homogeneous Multiprocessor network-on-chip. The algorithm is itself distributed over the processors and thus can be applied to systems of arbitrary size. Also, tasks added at run-time can be handled without any difficulty, allowing for inline optimisation. Based on local information on processor workload, task size, communication requirements, and link contention, iterative decisions on task migrations to other processors are made. The mapping results for several example task sets are first compared with those of an exact (enumeration) algorithm with global information for a processor array. The results show that the mapping quality achieved by our distributed algorithm is within 25% of that of the exact algorithm. For larger array sizes, simulated annealing is used as a reference and the behaviour of our algorithm is investigated. The mapping quality of the algorithm can be shown to be within a reasonable range (below 30% mostly) of the reference. This adaptability and the low computation and communication overhead of the distributed heuristic clearly indicate that decentralised algorithms are a favourable solution for an automatic task distribution.
APA, Harvard, Vancouver, ISO, and other styles
48

TANG, Ye. "Rule matching mapping algorithm for firewall based on rule decomposion mapping." Journal of Computer Applications 29, no. 11 (December 25, 2009): 2969–71. http://dx.doi.org/10.3724/sp.j.1087.2009.02969.

Full text
APA, Harvard, Vancouver, ISO, and other styles
49

ZHANG, Xin, Zhi-Wei CAO, Zhi-Xin LIN, Qing-Kang WANG, and Yi-Xue LI. "EMMA: An Efficient Massive Mapping Algorithm Using Improved Approximate Mapping Filtering." Acta Biochimica et Biophysica Sinica 38, no. 12 (December 2006): 857–64. http://dx.doi.org/10.1111/j.1745-7270.2006.00237.x.

Full text
APA, Harvard, Vancouver, ISO, and other styles
50

Rao, Yang, Yiying Pu, Shen-Sian Syu, and Ming-Jong Jou. "P-28: A Gamut Mapping Algorithm Based on Partition Mapping Method." SID Symposium Digest of Technical Papers 49, no. 1 (May 2018): 1300–1303. http://dx.doi.org/10.1002/sdtp.12151.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the bibliographies on the topic 'Mapping Algorithm' for other source types:
Dissertations / Theses Books
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography