|
Size: 6927
Comment:
|
Size: 2980
Comment:
|
| Deletions are marked like this. | Additions are marked like this. |
| Line 1: | Line 1: |
| '''Publications''' ||[[Publications/2009|2009]]|| |
Previous years (20xx): |
| Line 4: | Line 3: |
| '''Books/Chapter in books''' * Abdennadher N, Petcu D; Advances in Grid and Pervasive Computing; Springer, 2009 * Petcu D, Zaharie D, Neagul M, Panica S, Frincu M, Gorgan D, Stefanut T and Bacu V, Remote Sensed Image Processing on Grids for Training in Earth Observation, Chen Yung-Sheng (ed.), Image Processing, In-Teh, Croatia, December 2009, pp. 115 - 140 * Braescu L, George T.F; "ALE METHOD IN THE EFG GROWTH TECHNIQUE," IN ADVANCES IN NUMERICAL METHODS. PART 1. APPLIED MATHEMATICS, SPRINGER, BERLIN, SERIES: LECTURE NOTES IN ELECTRICAL ENGINEERING 11, 2009 * Braescu L, George T.F, Balint S; MASS TRANSFER ANALYSIS IN THE CASE OF THE EFG METHOD; SPRINGER, BERLIN, SERIES: LECTURE NOTES IN ELECTRICAL ENGINEERING 28, 2009 |
|| [[Publications/2019|19]] || [[Publications/2018|18]] ||[[Publications/2017|17]] || [[Publications/2016|16]] ||[[Publications/2015|15]] || ||[[Publications/2014|14]] ||[[Publications/2013|13]] ||[[Publications/2012|12]] ||[[Publications/2011|11]] ||[[Publications/2010|10]] || ||[[Publications/2009|09]] ||[[Publications/2008|08]] ||[[Publications/2007|07]] ||[[Publications/2006|06]] || || |
| Line 15: | Line 8: |
| '''Journal papers''' | == 2020 == ==== Journal papers ==== 1. Turcu, F., Bonchiș C., Najim M. Vector partitions, multi-dimensional Faà di Bruno formulae and generating algorithms. Discrete Applied Mathematics, vol 272(2020), pp. 90-99, Elsevier. 1. Balogh, J., Bonchiş C., Diniş D., Istrate G., Todinca I. On the heapability of finite partial orders. Discrete Mathematics and Theoretical Computer Science, vol 22, no 1 (2020), paper #17. |
| Line 17: | Line 13: |
| * Balint S.; Balint A.M.; Ionita A. Oscillation susceptibility analysis along the path of the longitudinal flight equilibriums in ADMIRE model Journal of Aerospace Engineering, 22(4), 423-433 * Petcu D; Iordan V Understanding Service-Oriented Architectures in the Classroom: From Web Services to Grid Services Information Systems Development * St.Balint, A.M.Balint and R.Szabo On the creation of a stable drop-like static meniscus, appropriate for the growth of a single crystal ribbon growth, with specified half thickness, using EFG technique Nonlinear Studies 16(4) (2009)403-414. * Kaslik E, Balint S; BIFURCATION ANALYSIS FOR A DISCRETE-TIME HOPFIELD NEURAL NETWORK OF TWO NEURONS WITH TWO DELAYS AND SELF-CONNECTIONS, Chaos, Solitons and Fractals, 39(1), 83-91, 2009 * Kaslik E, Balint S; COMPLEX AND CHAOTIC DYNAMICS IN A DISCRETETIME DELAYED HOPFIELD NEURAL NETWORK WITH RING ARCHITECTURE; Neural Networks, 22, 1411-1418, 2009 * Balint S, Balint A.M; INEQUALITIES FOR SINGLE CRYSTAL TUBE GROWTH BY EDGE-DEFINED FILM-FED GROWTH (E.F.G.) TECHNIQUE; J. Inequalities and Applications, vol. 2009 Article ID: 732106 (2009) 1-28 * Zaharie D; INFLUENCE OF CROSSOVER ON THE BEHAVIOR OF THE DIFFERENTIAL EVOLUTION ALGORITHM; Applied Soft Computing, vol 9, issue 3, pg. 1126-1138, 2009 * Balint S, Balint A.M; ON THE CREATION OF A STABLE AND CONVEX MENISCUS, APPROPRIATE FOR THE GROWTH OF A SINGLE CRYSTAL ROD WITH SPECIFIED CONSTANT RADIUS; J. Optoelectronics and Advanced Materials 11(5) (2009) 610-617 * Balint S, Balint A.M; ON THE CREATION OF A STABLE AND CONVEX STATIC MENISCUS, APPROPRIATE FOR THE GROWTH OF A SINGLE CRYSTAL RIBBON, IN STRICTLY ZERO GRAVITY BY E.F.G. TECHNIQUE, WITH SPECIFIED HALF THICKNESS; J. Optoelectronics and Advanced Materials 611(4) (2009) 450-456 * Balint S, Balint A.M; ON THE CREATION OF A STABLE DROP-LIKE STATIC MENISCUS, APPROPRIATE FOR THE GROWTH OF A SINGLE CRYSTAL TUBE WITH PRIOR SPECIFIED INNER AND OUTER RADIUS, Math.Problems in Eng. vol. (2009) Article ID:348538 (2009) 1-22 * Balint A.M, Balint S, Szabo R; PRESSURE DIFFERENCE ACROSS THE FREE SURFACE OF A STABLE STATIC MENISCUS IN A POSSIBLE GE1-X SIX RIBBON GROWTH BY EDGEDEFINED FILM-FED GROWTH (E.F.G.) TECHNIQUE, Computational Materials Science , 44(4) pp. 1327- 1331 (2009) * Olejnik R, Fortis F, Toursel B; WEB SERVICES ORIENTED DATA MINING IN KNOWLEDGE ARCHITECTURE; Future Generation Comp. Syst. 25 (4): pp. 436-443 '''Conference papers''' * Balint S, Tanasie L; The dependence of the inner and outer pressure difference limits on the inner and outer radius of the shaper; Seventh International Conference on Mathematical Problems in Engineering, Aerospace and Science, Cambridge Scientific Publishers Ltd., Cambridge, 2009, Chapter 20, pp. 218-229. (ISBN 978-1-904-86880-4) * Braescu L, George T.F., Orbulescu C, Leretter M; DYNAMICS OF THROMBIN FORMATION USING A MATHEMATICAL MODEL INCLUDING BOTH INTRINSIC AND EXTRINSIC PATHWAYS OF BLOOD COAGULATION DYNAMICS OF CONTINUOUS, DISCRETE AND IMPULSIVE SYSTEMS (SERIES A), PROCEEDINGS 6TH INTERNATIONAL CONFERENCE ON DIFFERENTIAL EQUATIONS AND DYNAMICAL SYSTEMS, PP. 75-82 * Braescu L; On the static stability of the menisci in the case of semiconductor crystals grown by dewetted Bridgman technique; Proceedings of SPIE - The International Society for Optical Engineering, 7420 * Braescu L; George T.F; ALE method in the EFG crystal growth technique Lecture Notes in Electrical Engineering, Advances in Numerical Methods * Braescu L, George T.F., Balint S; Mass transfer analysis in the case of a Nd:YVO4 cylindrical bar grown from the melt by the edge-defined film-fed growth (EFG) method; Proceedings of the European Computing Conference, Volume II, edited by N. Mastorakis, V. Mladenov and V. Kostargyri (Springer, Norwell, Massachusetts, 2009), pp. 1345-56. * Caprarescu B, Petcu D; A SELF-ORGANIZING FEEDBACK LOOP FOR AUTONOMIC COMPUTING; FUTURE COMPUTING, SERVICE COMPUTATION, COGNITIVE, ADAPTIVE, CONTENT, PATTERNS, 2009, COMPUTATIONWORLD '09., IEEE CS PRESS, 126 - 131 * Craciun C, Nicoara M, Zaharie D; ENHANCING THE SCALABILITY OF METAHEURISTICS BY COOPERATIVE COEVOLUTION; PROC. OF „LARGE SCALE SCIENTIFIC COMPUTING”, SOZOPOL (BULGARIA), LNCS 5910, PG.323-330 * Ionita A; Balint A.M., Balint S; Limit cycle behaviour in aircraft longitudinal terminal phase; Seventh International Conference on Mathematical Problems in Engineering, Aerospace and Sciences, 25-27 June 2008, Genova, Italy, Editor: Seenith Sivasundaram, Cambridge Scientific Publishers Ltd., Cambridge, 2009, Chapter 26, pp.277-287 (ISBN 978-1-904-86880-4) * Iordan M, Iordan V; NUMERICAL ANALYSIS OF THE OSCILLATION SUSCEPTIBILITY ALONG THE PATH OF DECOUPLED LONGITUDINAL FLIGHT EQUILIBRIUMS FOR A MODEL PLANE; Seventh International Conference on on Mathematical Problems in Engineering, Aerospace and Sciences, ISBN 978-1-904-86880-4, 2009, Cambridge Scientific Publishers Ltd, pp.378-387 * Iordan V, Iordan M; NUMERICAL ANALYSIS OF THE OSCILLATION SUSCEPTIBILITY ALONG THE PATH OF SYMMETRIC FLIGHT EQUILIBRIUM FOR A MODEL PLANE; Seventh International Conference on on Mathematical Problems in Engineering, Aerospace and Sciences, ISBN 978-1-904-86880-4, 2009, Cambridge Scientific Publishers Ltd, pp.388-398 * Kaslik E; DYNAMICS OF A DISCRETE-TIME BIDIRECTIONAL RING OF NEURONS WITH DELAY; PROCEEDINGS OF INTERNATIONAL JOINT CONFERENCE ON NEURAL NETWORKS, ATLANTA, GEORGIA, USA, JUNE 14-19, 2009, IEEE COMPUTER SOCIETY PRESS, PP. 1539-1546, 2009 * Kaslik E, Balint S; MULTISTABILITY OF HOPFIELD NEURAL NETWORKS WITH DISTRIBUTED DELAYS; Seventh International Conference on Mathematical Problems in Engineering, Aerospace and Sciences, Cambridge Scientific Publishers Ltd., 2009, ISBN 978-1-904-86880-4 * Neagul M, Panica S, Petcu D, Zaharie D, Gorgan D.;Web and grid services for training in Earth observation; IEEE International Workshop on Intelligent Data Acquisition and Advanced Computing Systems: Technology and Applications 21-23 September 2009, Rende (Cosenza), Italy, CD 978-1-4244-4882-1/09, p.241-246 |
==== Conference papers ==== 1. Istrate G., Bonchiș C., Gatina C. It's not whom you know, it's what you (or your friends) can do: Coalitional Frameworks for Network Centralities. Proceedings of the 19th International Conference on Autonomous Agents and Multiagent Systems, AAMAS'2020, pp. 566-574. IFAAMAS and ACM Press. 1. Besik Dundua, Temur Kutsia, Mircea Marin and Cleopatra Pau. Constraint Solving over Multiple Similarity Relations. In Proceedings of 5-th International Conference on Formal Structures for Computation and Deduction (FSCD 2020). In print. 1. Mircea Marin, Besik Dundua and Temur Kutsia. A Rule-based System for Computation and Deduction in Mathematica. In Proceedings of 13-th International Workshop on Rewriting Logic And Its Applications (WRA 2020). In print. 1. B. Dundua, T. Kutsia, M. Marin, C. Pau. Extending the \rho Log calculus with proximity relations. In Proceedings of the Fourth International Conference on Applications of Mathematics and Informatics in Natural Sciences and Engineering (AMINSE 2019), Springer Proceedings in Mathematics & Statistics. In print. 1. B. Dundua, T. Kutsia, M. Marin, and M. Rukhaia. Specification and Analysis of ABAC Policies in a Rule-Based Framework. In Proceedings of the Fourth International Conference on Applications of Mathematics and Informatics in Natural Sciences and Engineering (AMINSE 2019), Springer Proceedings in Mathematics & Statistics. In print. 1. Karthekeyan Chandrasekaran, Elena Grigorescu, Gabriel Istrate, Shubhang Kulkarni, Young-San Lin, Minshen Zhu. The Maximum Binary Tree Problem. In Proceedings of the 28th European Symposium on Algorithms (ESA'2020), Leibniz Institute Proceedings in Computer Science (LIPICS), vol. 173, paper #30. 1. Karthekeyan Chandrasekaran, Elena Grigorescu, Gabriel Istrate, Shubhang Kulkarni, Young-San Lin, Minshen Zhu. Fixed-Parameter Algorithms for Longest Heapable Subsequence and Maximum Binary Tree. In Proceedings of the 15th International Symposium on Parameterized and Exact Computation (IPEC’2020), Leibniz Institute Proceedings in Computer Science (LIPICS), to appear. |
Previous years (20xx):
2020
Journal papers
- Turcu, F., Bonchiș C., Najim M. Vector partitions, multi-dimensional Faà di Bruno formulae and generating algorithms. Discrete Applied Mathematics, vol 272(2020), pp. 90-99, Elsevier.
- Balogh, J., Bonchiş C., Diniş D., Istrate G., Todinca I. On the heapability of finite partial orders. Discrete Mathematics and Theoretical Computer Science, vol 22, no 1 (2020), paper #17.
Conference papers
- Istrate G., Bonchiș C., Gatina C. It's not whom you know, it's what you (or your friends) can do: Coalitional Frameworks for Network Centralities. Proceedings of the 19th International Conference on Autonomous Agents and Multiagent Systems, AAMAS'2020, pp. 566-574. IFAAMAS and ACM Press.
- Besik Dundua, Temur Kutsia, Mircea Marin and Cleopatra Pau. Constraint Solving over Multiple Similarity Relations. In Proceedings of 5-th International Conference on Formal Structures for Computation and Deduction (FSCD 2020). In print.
- Mircea Marin, Besik Dundua and Temur Kutsia. A Rule-based System for Computation and Deduction in Mathematica. In Proceedings of 13-th International Workshop on Rewriting Logic And Its Applications (WRA 2020). In print.
B. Dundua, T. Kutsia, M. Marin, C. Pau. Extending the \rho Log calculus with proximity relations. In Proceedings of the Fourth International Conference on Applications of Mathematics and Informatics in Natural Sciences and Engineering (AMINSE 2019), Springer Proceedings in Mathematics & Statistics. In print.
B. Dundua, T. Kutsia, M. Marin, and M. Rukhaia. Specification and Analysis of ABAC Policies in a Rule-Based Framework. In Proceedings of the Fourth International Conference on Applications of Mathematics and Informatics in Natural Sciences and Engineering (AMINSE 2019), Springer Proceedings in Mathematics & Statistics. In print.
- Karthekeyan Chandrasekaran, Elena Grigorescu, Gabriel Istrate, Shubhang Kulkarni, Young-San Lin, Minshen Zhu. The Maximum Binary Tree Problem. In Proceedings of the 28th European Symposium on Algorithms (ESA'2020), Leibniz Institute Proceedings in Computer Science (LIPICS), vol. 173, paper #30.
- Karthekeyan Chandrasekaran, Elena Grigorescu, Gabriel Istrate, Shubhang Kulkarni, Young-San Lin, Minshen Zhu. Fixed-Parameter Algorithms for Longest Heapable Subsequence and Maximum Binary Tree. In Proceedings of the 15th International Symposium on Parameterized and Exact Computation (IPEC’2020), Leibniz Institute Proceedings in Computer Science (LIPICS), to appear.