Data Structures and Algorithms

2207 Submissions

[4] viXra:2207.0150 [pdf] replaced on 2024-07-30 06:23:37

Simpler O(1) Query Algorithm for Level Ancestors

Authors: Sanjeev Saxena
Comments: 10 Pages.

This note describes a very simple O(1) query time algorithm for finding level ancestors. This is basically a serial (re)-implementation of the parallel algorithm of Berkman and Vishkin(O.Berkman and U.Vishkin, Finding level-ancestors in trees, JCSS, 48, 214--230, 1994).Although the basic algorithm has preprocessing time of O(n log n), by having additional levels or using table lookup, the preprocessing time can be reduced to almost linear or linear.The table lookup algorithm can be built in O(1) parallel time with n processors and can also be used to simplify the parallel algorithm of Berkman and Vishkin and make it optimal.
Category: Data Structures and Algorithms

[3] viXra:2207.0143 [pdf] submitted on 2022-07-25 00:32:44

Using Artificial Intelligence and Biology to Compensate for the Shortcomings of Ooho and Explore the Possibility of Commercialization

Authors: Injung Kim, Yujin Lee, Seungjun Park
Comments: 6 Pages. In Korean. CC BY.

Ooho is a kind of water bottle that surrounds and stores water with a membrane of calcium alginate, a biodegradable material. ooho was expected to replace plastic water bottles, and it was expected to be commercialized and have a positive impact on the environment. However, it is difficult to say that it has been popularized as it has only been used at some events as some fatal shortcomings have hindered its commercialization.Therefore, in this study, the reason why ooho is difficult to be used as a general water bottle will be specifically and clearly identified through various experiments. In addition, a complementary method will be derived by analyzing the results obtained through the experiment through machine learning techniques. Finally, through the above results, we would like to propose a scientific complementary method that can result in commercialization of ooho.
Category: Data Structures and Algorithms

[2] viXra:2207.0049 [pdf] submitted on 2022-07-06 19:05:22

Itsm and Esm in the Bigger World. Separation of Concerns: a Modern Approach of Itil for the Enterprise

Authors: Stephane H. Maes
Comments: 19 Pages.

As businesses and business trends continue to evolve so do the tools of each line of business within the organization. In this paper, we explore the current evolutions of ITIL practices, ITSM, ITOM, and ESM algorithsm and tools and DevOps, ERP, and other enterprise and industry applications, as well as how these changes are bringing organizations closer to digital transformation. The paper provides architecture and lessons learned and recommendations on how to best combine these algorithms, tools and practices while keeping the “separation of concerns” at the forefront. The paper discusses how digital transformation and ITIL will take organizations on a path of business maturity with omnichannel self-service and automation, as well as how they can help grow the business faster while maintaining employee retention.
Category: Data Structures and Algorithms

[1] viXra:2207.0022 [pdf] submitted on 2022-07-04 22:44:50

Least Common Multiple and Optimization

Authors: Yuly Shipilevsky
Comments: 6 Pages.

We reduce finding of Least Common Multiple of integer numbers to polynomial-time integer optimization problems and to NP-hard integer optimization problems.
Category: Data Structures and Algorithms