Monday 12 July 2010

Wseas Transactions

New Subscription to Wseas Transactions

The following information was submitted:

Transactions: NUMERICAL SCHEMES AND METHODS IN SCIENCE AND ENGINEERING
Transactions ID Number: 10-185
Full Name: Livia Sangeorzan
Position: Associate Professor
Age: ON
Sex: Female
Address: B-dul 15 Noiembrie 72, Brasov, Romania
Country: ROMANIA
Tel: 004 0268 418465
Tel prefix: 004
Fax: 0040 268 414016
E-mail address: livia.sangeorzan@gmail.com
Other E-mails: sangeorzan@unitbv.ro
Title of the Paper: highest label preflow algorithm for the parametric minimum flow problem - a linguistic rule-based network partitioning approach
Authors as they appear in the Paper: Livia Sangeorzan,Mircea Noru Parpalea,Mihaela Marinela Parpalea
Email addresses of all the authors: sangeorzan@unitbv.ro,parpalea@gmail.com,parpalea@yahoo.com
Number of paper pages: 10
Abstract: The article presents a preflow algorithm for the parametric minimum flow problem working in a parametric residual network with linear lower bound functions of a single parameter. On each of the iterations, the highest label preflow partitioning-pull (HLPPP) algorithm pulls flow from an active node with the highest distance label over a conditionally admissible arc. After each pull of flow, either the parametric residual capacity of the arc or the parametric deficit of the node becomes zero for at least a subinterval of the parameter values. If the two situations take place for different subintervals, the algorithm is continued in two different parametric residual networks generated by this partitioning pull. 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 mul-tiple section vector with one segment for each of the used part of speech categories.
Keywords: Parametric minimum flow,Preflow algorithm,Fractal partitioning,Generative linguistics
EXTENSION of the file: .doc
Special (Invited) Session: Highest Label Preflow Algorithm for the Parametric Minimum Flow Problem - a Linguistic Rule Based Network Partitioning Approach
Organizer of the Session: 632-158
How Did you learn about congress:
IP ADDRESS: 193.254.231.41