A Preflow Approach to Maximum Flows in Parametric Networks Applied to Assessing the Legal Information

Livia Sangeorzan, Mircea Parpalea, Mihaela Marinela Parpalea, Angela Repanovici, Roxana Matefi, Ioana Nicolae

Abstract


The 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.

Keywords


Parametric preflow algorithm, partitioning technique, generative linguistics, legal information

Full Text:

PDF

References


Ahuja, R., Magnanti, T. and Orlin, J.(1993);

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.
http://dx.doi.org/10.1080/02331938508842988

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.




DOI: https://doi.org/10.15837/ijccc.2016.1.1440



Copyright (c) 2017 Livia Sangeorzan, Mircea Parpalea, Mihaela Marinela Parpalea, Angela Repanovici, Roxana Matefi, Ioana Nicolae

Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.

CC-BY-NC  License for Website User

Articles published in IJCCC user license are protected by copyright.

Users can access, download, copy, translate the IJCCC articles for non-commercial purposes provided that users, but cannot redistribute, display or adapt:

  • Cite the article using an appropriate bibliographic citation: author(s), article title, journal, volume, issue, page numbers, year of publication, DOI, and the link to the definitive published version on IJCCC website;
  • Maintain the integrity of the IJCCC article;
  • Retain the copyright notices and links to these terms and conditions so it is clear to other users what can and what cannot be done with the  article;
  • Ensure that, for any content in the IJCCC article that is identified as belonging to a third party, any re-use complies with the copyright policies of that third party;
  • Any translations must prominently display the statement: "This is an unofficial translation of an article that appeared in IJCCC. Agora University  has not endorsed this translation."

This is a non commercial license where the use of published articles for commercial purposes is forbiden. 

Commercial purposes include: 

  • Copying or downloading IJCCC articles, or linking to such postings, for further redistribution, sale or licensing, for a fee;
  • Copying, downloading or posting by a site or service that incorporates advertising with such content;
  • The inclusion or incorporation of article content in other works or services (other than normal quotations with an appropriate citation) that is then available for sale or licensing, for a fee;
  • Use of IJCCC articles or article content (other than normal quotations with appropriate citation) by for-profit organizations for promotional purposes, whether for a fee or otherwise;
  • Use for the purposes of monetary reward by means of sale, resale, license, loan, transfer or other form of commercial exploitation;

    The licensor cannot revoke these freedoms as long as you follow the license terms.

[End of CC-BY-NC  License for Website User]


INTERNATIONAL JOURNAL OF COMPUTERS COMMUNICATIONS & CONTROL (IJCCC), With Emphasis on the Integration of Three Technologies (C & C & C),  ISSN 1841-9836.

IJCCC was founded in 2006,  at Agora University, by  Ioan DZITAC (Editor-in-Chief),  Florin Gheorghe FILIP (Editor-in-Chief), and  Misu-Jan MANOLESCU (Managing Editor).

Ethics: This journal is a member of, and subscribes to the principles of, the Committee on Publication Ethics (COPE).

Ioan  DZITAC (Editor-in-Chief) at COPE European Seminar, Bruxelles, 2015:

IJCCC is covered/indexed/abstracted in Science Citation Index Expanded (since vol.1(S),  2006); JCR2018: IF=1.585..

IJCCC is indexed in Scopus from 2008 (CiteScore2018 = 1.56):

Nomination by Elsevier for Journal Excellence Award Romania 2015 (SNIP2014 = 1.029): Elsevier/ Scopus

IJCCC was nominated by Elsevier for Journal Excellence Award - "Scopus Awards Romania 2015" (SNIP2014 = 1.029).

IJCCC is in Top 3 of 157 Romanian journals indexed by Scopus (in all fields) and No.1 in Computer Science field by Elsevier/ Scopus.

 

 Impact Factor in JCR2018 (Clarivate Analytics/SCI Expanded/ISI Web of Science): IF=1.585 (Q3). Scopus: CiteScore2018=1.56 (Q2); Editors-in-Chief: Ioan DZITAC & Florin Gheorghe FILIP.