scholarly journals A Novel Approach for Determination of Reliability of Covering a Node from K Nodes

Symmetry ◽  
2020 ◽  
Vol 12 (9) ◽  
pp. 1461
Author(s):  
Biljana Panić ◽  
Nataša Kontrec ◽  
Mirko Vujošević ◽  
Stefan Panić
Keyword(s):  
Dijkstra’S Algorithm ◽  
Center Problem ◽  
Stochastic Problem ◽  
Dijkstra's Algorithm ◽  
Novel Approach ◽  
Demand Node

In this paper, a stochastic problem of multicenter location on a graph was formulated through the modification of the existing p-center problem to determine the location of a given number of facilities, to maximize the reliability of supplying the system. The system is represented by a graph whose nodes are the locations of demand and the potential facilities, while the weights of the arcs represent the reliability, i.e., the probability that an appropriate branch is available. First, k locations of facilities are randomly determined. Using a modified Dijkstra’s algorithm, the elementary path of maximal reliability for every demand node is determined. Then, a graph of all of elementary paths for demand node is formed. Finally, a new algorithm for calculating the reliability of covering a node from k nodes (k—covering reliability) was formulated.

scholarly journals APLIKASI ALGORITMA DIJKSTRA UNTUK MENENTUKAN RUTE TERPENDEK DARI KAMPUS A KE B UIN RADEN FATAH

2021 ◽  
Vol 10 (3) ◽  
pp. 173
Author(s):  
RENDI SAPUTRAMA ◽  
HARTATIANA HARTATIANA
Keyword(s):  
Graph Theory ◽  
Directed Graph ◽  
Applied Research ◽  
Dijkstra’S Algorithm ◽  
The Road ◽  
Dijkstra's Algorithm ◽  
Shortest Route ◽  
Starting Point ◽  
Route Option

Finding the shortest direction is one of the options that have been considered while traveling. One of the problems that occur for lecturers, staff, and students of UIN Raden Fatah is determining the shortest direction from Campus A to B. The application of graph theory by using Dijkstra's Algorithm becomes a solution for this problem. This algorithm has the advantage to minimize the expense of the costs by finding the shortest route from starting point to the destination. This study is applied research. The study will discuss the determination of the origin and destination end-point, traverse route, the calculation of the weight distance, analyzes the Dijkstra's iteration to determine the shortest route, and conclusion. As the result, the land route becomes the shortest route option from UIN Raden Fatah Campus A to B. The directed graph of the route represents the location as point, the road as the side, and distance as weight. The result shows that the route distance is 6.94 km using Dijkstra's Algorithm.

The Use of TMAH to Etch Silicon and Expose Metal Bridging Failures

2000 ◽  
Author(s):  
Mark Morris ◽  
James Mohr ◽  
Esteban Ortiz ◽  
Steven Englebretson
Keyword(s):  
Failure Mechanism ◽  
Schottky Diodes ◽  
Tetramethylammonium Hydroxide ◽  
Novel Approach ◽  
Failure Location ◽  
Metal Etching ◽  
Plastic Mold

Abstract Determination of metal bridging failures on plastic encapsulated devices is difficult due to the metal etching effects that occur while removing many of the plastic mold compounds. Typically, the acids used to remove the encapsulation are corrosive to the metals that are found within the device. Thus, decapsulation can result in removal of the failure mechanism. Mechanical techniques are often not successful due to damage that results in destruction of the die and failure mechanism. This paper discusses a novel approach to these types of failures using a silicon etch and a backside evaluation. The desirable characteristics of the technique would be to remove the silicon and leave typical device metals unaffected. It would also be preferable that the device passivation and oxides not be etched so that the failure location is not disturbed. The use of Tetramethylammonium Hydroxide (TMAH), was found to fit these prerequisites. The technique was tested on clip attached Schottky diodes that exhibited resistive shorting. The use of the TMAH technique was successful at exposing thin solder bridges that extruded over the edge of the die resulting in failure.

scholarly journals Railway timetabling: a maximum bottleneck path algorithm for finding an additional train path

2020 ◽  
Author(s):  
Fredrik Ljunggren ◽  
Kristian Persson ◽  
Anders Peterson ◽  
Christiane Schmidt
Keyword(s):  
Experimental Evaluation ◽  
Temporal Distance ◽  
Dijkstra’S Algorithm ◽  
Passenger Traffic ◽  
Dijkstra's Algorithm ◽  
Railway Timetabling

Abstract We present an algorithm to insert a train path in an existing railway timetable close to operation, when we want to affect the existing (passenger) traffic as little as possible. Thus, we consider all other trains as fixed, and aim for a resulting train path that maximizes the bottleneck robustness, that is, a train path that maximizes the temporal distance to neighboring trains in the timetable. Our algorithm is based on a graph formulation of the problem and uses a variant of Dijkstra’s algorithm. We present an extensive experimental evaluation of our algorithm for the Swedish railway stretch from Malmö to Hallsberg. Moreover, we analyze the size of our constructed graph.

Preservation for diverse users: digital preservation and the “Designated Community” at the Ontario Jewish Archives

2021 ◽  
Vol ahead-of-print (ahead-of-print) ◽  
Author(s):  
Nathan Moles
Keyword(s):  
Digital Preservation ◽  
Reference Points ◽  
Digital Information ◽  
User Group ◽  
Content Type ◽  
Open Archival Information System ◽  
Novel Approach ◽  
Core Components ◽  
Unique Approach

PurposeConventional approaches to digital preservation posit that archives should define a Designated Community, or future user group, for whom they preserve digital information. Archivists can then use their knowledge of these users as a reference to help them deliver digital information that is intelligible and usable. However, this approach is challenging for archives with mandates to serve wide and diverse audiences; these archives risk undermining their efforts by focusing on the interests of a narrow user group.Design/methodology/approachA unique approach to this challenge was developed in the context of a project to build a digital preservation program at the Ontario Jewish Archives (OJA). It draws from previous research on this topic and is based on a combination of practical and theoretical considerations.FindingsThe approach described here replaces the reference of a Designated Community with three core components: a re-articulation of the Open Archival Information System (OAIS) mandatory responsibilities; the identification of three distinct tiers of access for digital records; and the implementation of an access portal that allows digital records to be accessed and rendered online. Together with supplemental shifts in reference points, they provide an alternative to the concept of a Designated Community in the determination of preservation requirements, the identification of significant properties, the creation of Representation Information and in the evaluation of success.Originality/valueThis article contributes a novel approach to the ongoing conversation about the Designated Community in digital preservation, its application and its limitations in an archival context.

Sign in / Sign up

Export Citation Format

Share Document