Weekly Presentation Fabricio Teles Dutra Goncalves 05/29/2015.

Slides:



Advertisements
Similar presentations
More Recursion: Permutations and Towers of Hanoi
Advertisements

Digital Image Processing Exercise 1.
An Introduction to Channel Routing
Lucene Part3‏. Lucene High Level Infrastructure When you look at building your search solution, you often find that the process is split into two main.
CITS2401 Computer Analysis & Visualisation
Scripts and Flow Control. Scripts So far we have been entering commands directly into the command line But there is a better way Script files (and functions)
MLP Lyrical Analysis ● % of Unique Words ● # of Unique Words ● Average Word Length ● # of Lyrics ● # of Characters Input Feature Vectors:
1 Modularity In “C”. 2 What is Modularity?  Modularity, is the heart of the high level, structured languages.  Means breaking down a big problem into.
Retrieval Evaluation: Precision and Recall. Introduction Evaluation of implementations in computer science often is in terms of time and space complexity.
Adapted from slides by Marie desJardins
Bret Juliano. Introduction What Documentation is Required? – To use a program – To believe a program – To modify a program The Flow-Chart Curse Self-Documenting.
Transfer Learning From Multiple Source Domains via Consensus Regularization Ping Luo, Fuzhen Zhuang, Hui Xiong, Yuhong Xiong, Qing He.
A Comparative Study of Search Result Diversification Methods Wei Zheng and Hui Fang University of Delaware, Newark DE 19716, USA
International Atomic Energy Agency Reference Input Parameter Library (RIPL)-Levels Marco Verpelli and Roberto Capote Noy IAEA - Nuclear Data Section NSDD.
Chapter 2: Beginning the Problem-Solving Process
SRM 2.2: status of the implementations and GSSD 6 th March 2007 Flavia Donno, Maarten Litmaath INFN and IT/GD, CERN.
Object-Oriented Programming (OOP). Implementing an OOD in Java Each class is stored in a separate file. All files must be stored in the same package.
1 Background A new class of continuous factor (C-Factor) models have been proposed as a parsimonious alternative to HB for conjoint and choice modeling.
UCF Computer Vision REU 2012 Week 1 Presentation Paul Finkel 5/21/12.
Jamshed Rahimov Paperless System in Universities.
Programming in Java Unit 4. Learning outcome:  LO2: Be able to design Java solutions  LO3: Be able to implement Java solutions Assessment criteria:
Practice and Evaluation. Practice Develop a java class called: SumCalculator.java which computes a sum of all integer from 1 to 100 and displays the result.
A hybrid SOFM-SVR with a filter-based feature selection for stock market forecasting Huang, C. L. & Tsai, C. Y. Expert Systems with Applications 2008.
TUH EEG Corpus Data Analysis 38,437 files from the Corpus were analyzed. 3,738 of these EEGs do not contain the proper channel assignments specified in.
How to Parse.out File Prepared by Tim Jan 28, 2010.
Silberschatz, Galvin and Gagne  2002 Modified for CSCI 399, Royden, Operating System Concepts Operating Systems Lecture 18 Midterm Review.
Weekly Presentation Fabricio Teles Dutra Goncalves 05/22/2015.
Boundary Detection in Tokenizing Network Application Payload for Anomaly Detection Rachna Vargiya and Philip Chan Department of Computer Sciences Florida.
Introduction to Video Game Programming (VGP) Mr. Shultz.
RICE UNIVERSITY DSPs for future wireless systems Sridhar Rajagopal.
WHAT IS THE VALUE OF X? x = 0 for value in [3, 41, 12, 9, 74, 15] : if value < 10 : x = x + value print x.
Finalizing the AMSR-E Rainfall Algorithm GPROF2010 AMSR-E Science Team Meeting Oxnard, CA 4-5 September, 2013 Dave Randel Colorado State University.
Organizing & Reporting Data: An Intro Statistical analysis works with data sets  A collection of data values on some variables recorded on a number cases.
CS 106 Introduction to Computer Science I 03 / 02 / 2007 Instructor: Michael Eckmann.
1 Adaptive Subjective Triggers for Opinionated Document Retrieval (WSDM 09’) Kazuhiro Seki, Kuniaki Uehara Date: 11/02/09 Speaker: Hsu, Yu-Wen Advisor:
Weekly Presentation Anderson G Moura 07/13/2015. Goals Wavelets – Set up an experiment to add a new feature to the htk files generated by the exp0022.
Professor A G Constantinides 1 Discrete Fourier Transforms Consider finite duration signal Its z-tranform is Evaluate at points on z-plane as We can evaluate.
SUMMER RESEARCH: WEEKLY MEETING Francisco Parente, July 6 th 2015.
Dynamic Programming & Memoization. When to use? Problem has a recursive formulation Solutions are “ordered” –Earlier vs. later recursions.
Weekly Report Cotta, Lucas Computer Scientist. Previous Plans · Kaldi/EEG - Once running, analyze some EEG examples with Kaldi · Demo - Implement Spectrogram.
Creating FunctionstMyn1 Creating Functions Function can be divided into two groups: –Internal (built in) functions –User-defined functions.
Weekly Report By Gabriella Suarez 06/08/2015. Goals Normal/Abnormal- The normal/abnormal team needed to meet to discuss the implementation of this project.
Weekly Report By Gabriella Suarez 07/06/2015. Goals Normal/Abnormal: I needed to talk to Silvia and Dave about the next steps. Interpolation: I needed.
Lives and Scoring Games Programming in Scratch. Games Programming in Scratch L2 Lives and Scoring Learning Objectives Define a variable Understand the.
An Introduction to Programming with C++1 Beginning the Problem- Solving Process Tutorial 2.
Education is undergoing major change. We have many demands on our time.
Lecture # 12 JavaScript Functions and Debugging. Today Questions: Quiz 1? Review for Quiz 2. 1.Introduce: How can you make an On-line Grocery List? 2.Explain:
Chapter 6 Persistence-Saving and Retrieving Data
Week 3-4 Control flow (review) Function definition Program Structures
Incorporating W3C’s DQV and PROV in CISER’s Data Quality Review and
Introduction to MiniSAT
Computing Square Roots
ECET 370 Slingshot Academy / ecet370.com
Microsoft Visual Basic 2005: Reloaded Second Edition
Lecture 5 – Improved Monte Carlo methods in finance: lab
Raw Materials and Resources
Progress report 2014/11/21.
זכויות סוציאליות.
Degree-aware Hybrid Graph Traversal on FPGA-HMC Platform
© T Madas.
Faculty of Computer Science & Information System
Label Name Label Name Label Name Label Name Label Name Label Name
Enhancing the Enlargement of Images
Review for Test1.
See requirements for practice program on next slide.
Class 4: Repetition Pretest Posttest Counting Flowchart these!
Classes CSC 265 (Blum).
EXP file structure.
JavaScript 101 Lesson 8: Loops.
Little Man Computer Lesson 3 The times table
Presentation transcript:

Weekly Presentation Fabricio Teles Dutra Goncalves 05/29/2015

Goals Define an approach to implement the interpolation utility in dsp code. Write code to deal with the channel processing regarding Interpolation project. 1)Create a new channel by averaging the first 3 channels of an.edf file; 2)Retrieve a channel by label; 3)Create a method to loop over all adjacent channels and compute interpolation; 4)Approach to add the new channel into the original set of channels; 5)Create new.edf file; Replicate baseline experiment exp_0014.

Accomplishments Agreement to build Interpolation utility on top of gen_feats. Existing functions are being modified in order to implement Interpolation algorithm. Channel created by averaging the first 3 channels of an.edf file. Edf::select method used to retrieve discrete points of a channel by label. Baseline experiment exp_0014 replicated into t_000_002 directory.

Next Week Implement approach to add the new channel. Propose another parameter file New variable indicating the right order of the channels (including the missing channels) by label. Work on creating a new.edf file with the new set of channels. Attach the parsing and channel processing functionality into the dsp code. Make experiments evaluating functionality.