Explore our comprehensive data analysis project presentation on predicting product ad campaign performance. Learn how data-driven insights can optimize your marketing strategies and enhance campaign effectiveness. Perfect for professionals and students looking to understand the power of data analysis in advertising. for more details visit: https://bostoninstituteofanalytics.org/data-science-and-artificial-intelligence/
Techniques to optimize the pagerank algorithm usually fall in two categories. One is to try reducing the work per iteration, and the other is to try reducing the number of iterations. These goals are often at odds with one another. Skipping computation on vertices which have already converged has the potential to save iteration time. Skipping in-identical vertices, with the same in-links, helps reduce duplicate computations and thus could help reduce iteration time. Road networks often have chains which can be short-circuited before pagerank computation to improve performance. Final ranks of chain nodes can be easily calculated. This could reduce both the iteration time, and the number of iterations. If a graph has no dangling nodes, pagerank of each strongly connected component can be computed in topological order. This could help reduce the iteration time, no. of iterations, and also enable multi-iteration concurrency in pagerank computation. The combination of all of the above methods is the STICD algorithm. [sticd] For dynamic graphs, unchanged components whose ranks are unaffected can be skipped altogether.
Adjusting primitives for graph : SHORT REPORT / NOTESSubhajit Sahu
Graph algorithms, like PageRank Compressed Sparse Row (CSR) is an adjacency-list based graph representation that is
Multiply with different modes (map)
1. Performance of sequential execution based vs OpenMP based vector multiply.
2. Comparing various launch configs for CUDA based vector multiply.
Sum with different storage types (reduce)
1. Performance of vector element sum using float vs bfloat16 as the storage type.
Sum with different modes (reduce)
1. Performance of sequential execution based vs OpenMP based vector element sum.
2. Performance of memcpy vs in-place based CUDA based vector element sum.
3. Comparing various launch configs for CUDA based vector element sum (memcpy).
4. Comparing various launch configs for CUDA based vector element sum (in-place).
Sum with in-place strategies of CUDA mode (reduce)
1. Comparing various launch configs for CUDA based vector element sum (in-place).
The affect of service quality and online reviews on customer loyalty in the E...
Matias_Hazel_Resume.pdf
1. Project Management
Customer Service
Technical Support
Retention
Sales Support
Real Time Management
Call Center Scheduling
Administrative work
Basic knowledge in SQL, Site
Administration, Genesys, IEX
Microsoft Excel, PowerPoint, Word
BUSINESS ANALYST
HAZEL MATIAS
I'm a Business Analyst which works with
Business Routing projects, doing
administrative tasks, and day to day
meetings with clients and developers
BS IN BUSINESS ADMINISTRATION
Major in Accounting
Holy Angel University | June 2004- April 2008
hazel.matias@yahoo.com
+63 927 877 5865
32 Looban Street Malolos
Bulacan
SKILLS
CONTACT
RELEVANT EXPERIENCE
EDUCATION BACKGROUND
• Business Analyst (Telco)
Company: Optum Global Solutions
UP Ayala Technohub, Building N
Diliman Quezon City
February 1, 2019 – Present
• Workforce Scheduler
Company: Optum Global Solutions
UP Ayala Technohub, Building N
Diliman Quezon City
January, 2017 – February 1 2019
• Workforce Real-Time Analyst
Company: Optum Global Solutions
UP Ayala Technohub, Building N
Diliman Quezon City
September 23, 2013 – January 2017
• Customer Service Representative/
Technical Support
Company: Teletech Philippines
SM Pampanga, Mexico Pampanga
April 2008- September 1, 2013
