A Preflow Approach to Maximum Flows in Parametric Networks Applied to Assessing the Legal Information
AbstractThe present paper proposes a fractal-like approach to the parametric flow problem, derived from the rules and recursion of generative linguistics. In the same manner in which any sentence can be analysed in terms of "theme" of the sentence (that which is spoken about in the sentence) and "rheme" of the sentence (that which is said about the theme in the sentence), in the proposed parametric preflow-push algorithm, a "partitioning push" (a non-cancelling push of flow in the parametric residual network) might leave the node unbalanced for only a subinterval of the range of parameter values. This will lead to separating the problem for the two disjoints subintervals, which allows the algorithm to continue after the same rules, independently, on each of the partitioned subintervals. The algorithm runs as the template-like structure of a dialogue act which reveals a design where information about the items (part-of-speech) is a two sections vector with one segment for each of the used part of speech categories. The article also proposes a possible application of the algorithm in assessing legal information and in semantic evaluation of legislation.
Network Flows. Theory, algorithms and applications, Prentice Hall, Inc., Englewood Cliffs, New Jersey, 1993.
 Bichot, C-E., Siarry, P. (2011), Graph Partitioning: Optimisation and Applications, ISTE Wiley.
 Hamacher, H.W. and Foulds, L.R. (1989); Algorithms for flows with parametric capacities, ZOR - Methods and Models of Operations Research, 33:21–37.
 Parpalea, M., Ciurea, E.(2013);
Partitioning Algorithm for the Parametric Maximum Flow, Applied Mathematics (Special Issue on Computer Mathematics), 4(10A):3–10.
 Parpalea, M.M. (2009);German Word Order, Bulletin of the Transilvania University of Brasov, Series IV, 2(51): 175–182.
 Parpalea, M. (2010); Min-Max algorithm for the parametric flow problem, Bulletin of the Transilvania University of Brasov, Series III: Mathematics, Informatics, Physics, 3(52):191– 198.
 Parvan, M., Ghionea, F., Flaut, C. (2008); A mathematical model of the relevant request determination in the transport problem, Mathematics and Computer in Business and Economics, Proc.of the 9th WSEAS Intl. Conf. on Mathematics and Computer in Business and Economics (MCBE'08), Bucureşti, 24-26 iunie 2008, 105–111.
 Ruhe, G. (1988); Complexity Results for Multicriterial and Parametric Network Flows Using a Pathological Graph of Zadeh, Zeitschrift fur Oper. Res., 32: 9–27.
 Ruhe, G. (1985); Characterization of all optimal solutions and parametric maximal flows in networks, Optimization, 16(1): 51–61.
 Sângeorzan, L., Parpalea, M., et al. (2010); Partitioning Preflow-pull Algorithm for the Parametric Net-work Flow Problem - a Linguistic Rule-based Constraints Optimisation Approach, Recent Advances in Neural Networks, Fuzzy Systems and Evolutionary Computing, Proc.of the 11th WSEAS International Conference on Neural Networks, Iasi, Romania, 111–116.
 Stumpff, A.M. (2013); The Law is a Fractal: The Attempt to Anticipate Everything, Loyola University Chicago Law Journal, 44.
 Yong, C., Chang-le, Lu (2006);
Using Multi-Thread Technology Realize Most Short-Path Parallel Algorithm, World Academy of Science, Engineering and Technology, 15: 11–13.
 High Court's Decision no 656/2012, given in a public hearing on February 9th, 2012, in the file no 1259/44/2010, http://www.iccj.ro/cautare.php?id=68146, accessed September 11th, 2014, at 13,40.
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
ONLINE OPEN ACCES: Acces to full text of each article and each issue are allowed for free in respect of Attribution-NonCommercial 4.0 International (CC BY-NC 4.0.
You are free to:
-Share: copy and redistribute the material in any medium or format;
-Adapt: remix, transform, and build upon the material.
The licensor cannot revoke these freedoms as long as you follow the license terms.
DISCLAIMER: The author(s) of each article appearing in International Journal of Computers Communications & Control is/are solely responsible for the content thereof; the publication of an article shall not constitute or be deemed to constitute any representation by the Editors or Agora University Press that the data presented therein are original, correct or sufficient to support the conclusions reached or that the experiment design or methodology is adequate.