Study about Interpersonal Communication for Development | Chapter 7 | Research Developments in Arts and Social Studies Vol.1

 This paper aims to laud the overwhelming synergy between interpersonal communication and growth, as well as to prove that interpersonal communication is a requirement for meaningful and long-term development. For a better understanding of the discourse, basic concepts were defined, explained, and appropriate examples were supplied. The study goes on to address different types of interpersonal communication, interpersonal communication in relationships, interpersonal communication aspects, and noise in communication as a major hindrance to communication. The paper used a content analysis method to examine scientific papers from books, journals, and the internet. The authors suggest for a channel mix in which interpersonal communication is combined with mass media and social media to promote more effective long-term growth. Finally, certain findings and inferences were drawn.

Author(s) Details:
Gloria Nneka Ono,
 Department of Mass Communication, Nnamdi Azikiwe University, Awka, Anambra State, Nigeria

Chinwe Mirian Odionye,
 Department of Mass Communication, Edwin Clark University, Delta State, Nigeria.

Please see the link here: https://stm.bookpi.org/RDASS-V1/article/view/5725

The Out-of-Kilter Algorithm and Its Network Flow Implementations | Chapter 7 | Theory and Practice of Mathematics and Computer Science Vol. 10

 D.R. Fulkerson [1] published the out-of-kilter algorithm, which computes the solution to the minimum-cost flow issue in a flow network. The Out-of-Kilter technique can be used to solve problems like the transportation problem, which can be described as a maximum flow and minimal cost – maximum flow problem. To begin, the algorithm creates an initial flow along the arcs and assigns a number to each of the network's nodes. See, for example, Bazaraa, which employs Complementary Slackness Optimality Conditions (CSOC). The method developed by Jarvis and Sherali [2] looks for out-of-kilter arcs (those that do not satisfy CSOC conditions). If there aren't any, the algorithm is finished. The flow must be increased or decreased to bring arcs that do not satisfy the CSOC theorem into alignment. According to the demand, the algorithm will hunt for a path that either enhances or decreases the flow. This is repeated until all of the arcs are aligned, at which time the procedure is finished. There is no conceivable flow if no paths to improve the system are found. The Out-of-Kilter algorithm is used to determine the best solution to any network flow problem. This comprises transit, assignment, and shortest path problems, among others. Computer solutions are presented using a Pascal programme and Matlab.

Author(s) Details

W. H. Moolman
Department of Mathematical Sciences and Computing, Walter Sisulu University, Mthatha, South Africa.

View Book :- https://stm.bookpi.org/TPMCS-V10/article/view/1077

Computing and Applications: The Maximum Flow and Minimum Cost – Maximum Flow Problems | Chapter 6 | Theory and Practice of Mathematics and Computer Science Vol. 10

 Both the maximum flow and minimum cost-maximum flow challenges are concerned with determining flows between a source and a destination across a network. The term "maximum flow" refers to any problem in which the goal is to transport as many products, objects, or people as possible between two sites via intermediate places. Maximum flow-lowest cost refers to flow problems including both capacities and expenses. Computing enables one to come at a solution to a problem when provided knowledge about a network (network flow diagram, capacities, and expenses). When the solution is ready, it must be tested on a real-world problem. The usage of R (many packages and functions), specially designed Pascal programmes, and Excel SOLVER in the solution of these problems will be discussed. The following problems' minimum cost-maximum flow solutions will also be discussed: Transportation problem, assignment problem, shortest path problem, caterer problem, maximum flow, minimum cost-maximum flow.

Author(s) Details

W. H. Moolman
Department of Mathematical Sciences and Computing, Walter Sisulu University, Mthatha, South Africa.

View Book :- https://stm.bookpi.org/TPMCS-V10/article/view/1076