scholarly journals Digital Information System and Waifinding

2019 ◽  
Vol 7 (1) ◽  
pp. 90-101
Author(s):  
Lisna Sukmawati ◽  
Jaswandi . ◽  
Adidin Aidin Maulana ◽  
Abdul Rahman
Keyword(s):  
Complex Space ◽  
Search Algorithm ◽  
Digital Information ◽  
New Students ◽  
Path Search ◽  
Touch Screen Monitor ◽  
Security Information ◽  
Campus Activities ◽  
Index Value ◽  
Made In

Generally new students and new visitors in a building often experience difficulties when searching for a space, especially a building that has a lot of space. As well as having a complex space, both classrooms and staff workspaces. Usually visitors who have just entered the building's environment ask the security information parties or other visitors to provide information on classrooms or staff workspace sought. Another way for visitors to find information on conventional building space is available, but the alternative method requires a lot of time. For this reason, this study was made in the campus building, using NetBeans IDE software applying the closest path search algorithm based on the pixel index value on the map image. The system will display the closest landing map and information on the lecturer room staff room and lecture classrooms and search for lecturer data information. Likewise the search for staff and lecturers by writing their names in the search panel on the touch screen monitor. then pressing the "take me there" button, the system will show the direction to the workspace and provide staff information. To view announcement information, users simply select the announcement menu, then choose the announcement category. With this system, visitors are expected to have no difficulties in finding space and staff and campus information. The purpose of this study is to be able to provide a map of the direction of the building on campus from the position of the system to the classroom and the staff room and lecturer room. Besides that, it can also provide information about campus activities, announcements and even events to students and visitors, designed with an attractive interface that is easy to use. Keywords: Building Map, Waifinding, Digital Information, LCD screen, NetBeans IDE

Circles on the Complex Plane

2021 ◽  
pp. 3-12
Author(s):  
A. Girsh
Keyword(s):  
Euclidean Space ◽  
Complex Plane ◽  
Euclidean Plane ◽  
Complex Space ◽  
Radical Center ◽  
Special Cases ◽  
Different Types ◽  
Different Dimensions ◽  
The Given ◽  
Made In

The Euclidean plane and Euclidean space themselves do not contain imaginary elements by definition, but are inextricably linked with them through special cases, and this leads to the need to propagate geometry into the area of imaginary values. Such propagation, that is adding a plane or space, a field of imaginary coordinates to the field of real coordinates leads to various variants of spaces of different dimensions, depending on the given axiomatics. Earlier, in a number of papers, were shown examples for solving some urgent problems of geometry using imaginary geometric images [2, 9, 11, 13, 15]. In this paper are considered constructions of orthogonal and diametrical positions of circles on a complex plane. A generalization has been made of the proposition about a circle on the complex plane orthogonally intersecting three given spheres on the proposition about a sphere in the complex space orthogonally intersecting four given spheres. Studies have shown that the diametrical position of circles on the Euclidean E-plane is an attribute of the orthogonal position of the circles’ imaginary components on the pseudo-Euclidean M-plane. Real, imaginary and degenerated to a point circles have been involved in structures and considered, have been demonstrated these circles’ forms, properties and attributes of their orthogonal position. Has been presented the construction of radical axes and a radical center for circles of the same and different types. A propagation of 2D mutual orthogonal position of circles on 3D spheres has been made. In figures, dashed lines indicate imaginary elements.

Golden Path Search Algorithm for the KSA Scheme

2021 ◽  
pp. 1-13
Author(s):  
Ching-Kang Ing ◽  
Chin-Yi Lin ◽  
Po-Hsiang Peng ◽  
Yu-Ming Hsieh ◽  
Fan-Tien Cheng
Keyword(s):  
Search Algorithm ◽  
Path Search ◽  
Golden Path

Citizens, the Internet, and Terrorism Information

2010 ◽  
pp. 152-165
Author(s):  
Christopher G. Reddick
Keyword(s):  
Public Opinion ◽  
Homeland Security ◽  
Terrorist Attack ◽  
Internet Access ◽  
The Internet ◽  
Successful Development ◽  
Security Information ◽  
Government Websites ◽  
Use Of The Internet ◽  
Made In

This chapter examines the role that citizens play when using the internet for gathering information. It is vital to understand the use of the Internet by citizens to address the issue of access to homeland security information. This chapter also provides information on how terrorism information is presented online and citizens’ use of this information is discussed. Jones, Hackney, and Irani (2007) believe that the key to the successful development of e-government is its citizens. There needs to be efforts to engage citizens in the adoption of e-government. These authors believe that this engagement will truly create a transformation of e-government that was envisioned by earlier writers in the field. This chapter discusses this level of engagement and shows that citizens are the least likely to use Internet for homeland security information if a terrorist attack occurs. Existing research on the adoption of e-government tends to focus on the supply of e-government in terms of the breadth and sophistication of government Websites. However, Streib and Navarro (2006) have examined the role the internet plays in public organizations using public opinion data, examining the demand for e-government. There is a need for more research on the demand for e-government and that is the focus of this chapter. The argument made in this chapter is that you need to understand citizens, and why they go online, to more effectively cater homeland security information to their needs. This chapter first discusses the important issue of the digital divide, the disparity between those that have Internet access and those that do not. This is followed by a discussion of citizen trust and satisfaction with e-government Websites. Followed this, there is a discussion of the citizen-initiated contacts literature as a framework that helps us understand why citizens contact government for information and services.

Quantum dialogue protocol based on Grover’s search algorithms

2019 ◽  
Vol 34 (21) ◽  
pp. 1950169
Author(s):  
Aihan Yin ◽  
Kemeng He ◽  
Ping Fan
Keyword(s):  
Heuristic Search ◽  
Search Algorithm ◽  
Search Algorithms ◽  
Quantum Dialogue ◽  
Quantum Search ◽  
Decoy State ◽  
Quantum Search Algorithm ◽  
Heuristic Search Algorithms ◽  
Security Information

Among many classic heuristic search algorithms, the Grover quantum search algorithm (QSA) can play a role of secondary acceleration. Based on the properties of the two-qubit Grover QSA, a quantum dialogue (QD) protocol is proposed. In addition, our protocol also utilizes the unitary operations and single-particle measurements. The transmitted quantum state (except for the decoy state used for detection) can transmit two-bits of security information simultaneously. Theoretical analysis shows that the proposed protocol has high security.

scholarly journals A Method for Obtaining Optimal Path in Angle and Avoiding Collision for Robotic Belt Grinding

2019 ◽  
Vol 2019 ◽  
pp. 1-19
Author(s):  
Tie Zhang ◽  
Xiaohong Liang ◽  
Ye Yu ◽  
Bin Zhang
Keyword(s):  
Coordinate System ◽  
Search Algorithm ◽  
Optimal Path ◽  
Recursive Method ◽  
Coordinate Plane ◽  
Angular Variation ◽  
Belt Grinding ◽  
Robotic Grinding ◽  
Path Search ◽  
Robotic Belt Grinding

The angular variation of the joints may be large, and collision between workpieces and tools may occur in robotic grinding. Therefore, this paper proposes an optimal robotic grinding path search algorithm based on the recursive method. The algorithm is optimized by changing the position of the tool coordinate system on the belt wheel; thus, the pose of the robot during grinding is adjusted. First, the position adjustment formula of the tool coordinate system is proposed, and a coordinate plane is established to describe the grinding path of the robot based on the position adjustment formula. Second, the ordinate value of this coordinate plane is dispersed to obtain the search field of the optimal robotic grinding path search algorithm. Third, an optimal robotic grinding path search algorithm is proposed based on the recursive method and single-step search process. Finally, the algorithm is implemented on the V-REP platform. Robotic grinding paths for V-shaped workpieces and S-shaped workpieces are generated using this algorithm, and a grinding experiment is performed. The experimental results show that the robotic grinding paths generated by this algorithm can smoothly complete grinding operations and feature a smaller angular variation of the joint than other methods and no collision.

scholarly journals Study on Composing Dense Formations in a Dynamic Environment of Multirotor UAVs by Distributed Control

2018 ◽  
Vol 2018 ◽  
pp. 1-8
Author(s):  
Shudao Zhou ◽  
Ao Shen ◽  
Min Wang ◽  
Shuling Peng ◽  
Zhanhua Liu
Keyword(s):  
Unmanned Aerial Vehicles ◽  
Dynamic Model ◽  
Distributed Control ◽  
Distributed Algorithm ◽  
Search Algorithm ◽  
Dynamic Environment ◽  
Step Motion ◽  
Aerial Vehicles ◽  
Path Search ◽  
The Membership Function

In order to make multirotor unmanned aerial vehicles (UAV) compose a desired dense formation and improve the practicality of UAV formation, a distributed algorithm based on fuzzy logic was proposed. The airflow created by multirotor UAVs was analyzed according to the structure of the multirotor UAV and the characteristic equation of the fluid. This paper presented a dynamic model for the process of formation of and path search algorithm based on this model. The membership function in this model combines the factors of position, flow field, and movement. Integrating the dynamic model and its desired position in formations, each UAV evaluates the surrounding points and then selects the direction for step motion. Through simulation, this algorithm was improved by a by-step formation approach, and the effectiveness of this method in dense formation of multirotor UAVs was proved.

Building a Search Tree for a Pilot System of a Rescue Search Robot in a Discretized Random Step Environment

2011 ◽  
Vol 23 (4) ◽  
pp. 567-581 ◽  
Author(s):  
Evgeni Magid ◽  
◽  
Takashi Tsubouchi ◽  
Eiji Koyanagi ◽  
Tomoaki Yoshida ◽  
...  
Keyword(s):  
Search Algorithm ◽  
Search Space ◽  
Search Tree ◽  
Quality Estimation ◽  
Dynamic Path Planning ◽  
Building Process ◽  
Path Search ◽  
Tree Building ◽  
Random Step ◽  
Real State

Rescue robotics applies search and rescue robots to expand rescue capabilities while increasing safety. Mobile robots working at a disaster site are monitored remotely by operators who may not be able to see the site well and select work paths appropriately. Our goal is to provide a “pilot system” that can propose options for traversing 3D debris environments. This requires a special debris path search algorithm and an appropriately defined search tree ensuring smooth exploration. To make a path search feasible in huge real state space we discretize search space and robot movement before a search. In this paper we present path quality estimation and search tree branching functionF, which defines search tree building process online through node opening and branching. Well-defined functionFremoves unsuitable search directions from the search tree and enables dynamic path planning accounting for debris. Exhaustive simulation was used to structure and analyze data. Experiments confirmed the feasibility of our approach.

Sign in / Sign up

Export Citation Format

Share Document