Professional Documents
Culture Documents
Teme Licenta Stancu 2019 - 2020
Teme Licenta Stancu 2019 - 2020
7) Soluție pentru organizarea datelor din domeniul .... (ex: bancar, medical, etc)
Bibliografie
[1] Tim Martyn, " Reconsidering Multi-Dimensional Schemas", SIGMOD Record, Vol.
33, No. 1, March 2004
[2] Golfarelli, M., and Rizzi, S., "A Methodological Framework for Data Warehouse
Design," DOLAP, 1998
[3] Eder J., Koncilia C., 2001 Changes of dimension in Temporal Data, 3rd
International Conference on Data Warehousing and Knowledge Discovery - Munich,
Sept 3-7
[4] Han J., Stefanovic N., and Koperski K., 1998 Selective Materialization: An
Efficient Method for Spatial Data Cube Construction, Proc. Pacific-Asia Conf. on
Knowledge Discovery and Data Mining Melbourne, Australia, pp. 144-158
12) Big Data - interogarea, stocarea si procesarea distribuita folosind Apache Handoop
Bibliografie
[1] V. Borkar, M.J. Carey, C. Li, "Inside “Big Data Management”, Ogres, Onions, or
Parfaits?", EDBT/ICDT 2012 Joint Conference Berlin Germany, 2012
[2] L. Neumeyer, B. Robbins, A. Nair, and A. Kesari. S4: Distributed Stream
Computing Platform. In ICDM Workshops, pages 170–177, 2010
[3] Y. Low, J. Gonzalez, A. Kyrola, D. Bickson, C. Guestrin, J. M. Hellerstein –
“Graphlab: A new parallel framework for machine learning”, In Conference on
Uncertainty in Artificial Intelligence (UAI), Catalina Island, California, July 2010
[4] A. Bifet, G. Holmes, R. Kirkby, and B. Pfahringer. MOA: Massive Online Analysis
http://moa.cms.waikato.ac.nz/. Journal of Machine Learning Research (JMLR), 2010
[5] Jens Dittrich, Jorge-Arnulfo Quian ́e-Ruiz, " Efficient Big Data Processing in
Hadoop MapReduce", Information Systems GroupSaarland University
http://infosys.cs.uni-saarland.de
[6] . N. Afrati and J. D. Ullman. Optimizing Joins in a Map-ReduceEnvironment.
InEDBT, pages 99–110, 2010
14) Analiza, proiectarea şi implementarea unei aplicatii pentru departamentul de ... (ex:
contabilitate, etc)
Bibliografie
[1] Juanying Xie, Shuai Jiang 2010 - “A simple and fast algorithm for global K-means
clustering”, 2010 Second International Workshop on Education Technology and
Computer Science, 978-0-7695-3987-4/10 $26.00 © 2010 IEEE DOI
10.1109/ETCS.2010.347
[2] Pakhira, Malay K.: “A Modified k-means Algorithm to Avoid Empty Clusters”.
International Journal of Recent Trends in Engineering, Vol.1, No. 1, May 2009
[3] Wu, F. X.: “Genetic weighted k-means algorithm for clustering large-scale gene
expression data”. BMC Bioinformatics, vol. 9, 2008
[4] Kohei Arai, Ali Ridho Barakbah, Hierarchical K-means: an algorithm for centroids
initialization for K-Means, Reports of the Faculty of Science and Engineering, Saga
University, Vol. 36, No.1, 2007, 36-1,2007
15) Aplicatii ale algoritmilor de FFT (Fast Fourier Transform) in limbajul .....
Bibliografie
[1] Paul Heckbert, " Fourier Transforms and the Fast Fourier Transform (FFT)
Algorithm", Notes 3, Computer Graphics 2, 15-463, 1998
[2] Vladimir Stojanović, " Fast Fourier Transform: Theory and Algorithms",
Communication System Design – Spring 2006Massachusetts Institute of Technology
24) Aplicaţie privind modelarea unei RNA (retea neuronala artificiala) de tip feed-
forward
Bibliografie
[1] Tao Wang, Zhenyin Guo, Zhuo Wang, Yuxiang Li, ”Applied Research of Fire
Monitoring for the Internet of Things Based on BP Neural Network”, IACSE, The 2013
International Conference on CYBER SCIENCE and ENGINEERING, pp 76-84,
CyberSE, 2013
[2] Marcel van Gerven, Sander Bohte, "Artificial Neural Networks as Models of Neural
Information Processing", 2018
[3] Zhihua Zhang, " Artificial Neural Network", Multivariate Time Series Analysis in
Climate and Environmental Research pp 1-35
[4] Daniel Cohen, John Foley, Hamed Zamani, James Allan, W. Bruce Croft,
"Universal Approximation Functions for Fast Learning to Rank: Replacing Expensive
Regression Forests with Simple Feed-Forward Networks", SIGIR '18 The 41st
International ACM SIGIR Conference on Research & Development in Information
Retrieval, Pages 1017-1020