YSU's Student ACM

Search
Skip to content
  • About Us
  • Events Calendar
  • Officers
  • Resources

Presentation: Introduction to Higher Order Functions

February 24, 2015 ysu

Braden Walters recently gave a talk at one of our meetings on the use and creation of Higher-Order Functions (HOFs).

He has a blog post available here with more information about what he’s covered: http://braden-walters.info/blog/introduction_higher_order_functions

Slides are available as a PDF here: http://braden-walters.info/files/IntroHOF.pdf

Post navigation

Previous PostBitcoin slideshowNext PostAn Improved Overflow Detection Algorithm in Residue Number Systems

Younstown State University's Student Association for Computing Machinery

Our next meeting is…

November 16, 2016 at 4pm in Meshel Hall Rm. 337.

Join our Facebook group

YSU ACM Facebook Group

Jenna Wise

3 months ago

Jenna Wise

In case anyone is interested! ...

Packet Efficient Implementation of the Omega Failure Detector

March 24, 2017, 3:00pm - March 24, 2017, 3:00pm

In the asynchronous distributed system model, there is no restriction on processor speeds or message propagation delays, and a global clock does not exist. This model is applicable to a wide variety of networks and architectures making it a classical model used to study algorithm design. However, the model is problematic in regards to fault tolerance due to the inherent inability to determine if a process is crashed or merely slow. Thus, if even a single process crash occurs, the problem of consensus, that requires all processes to agree on a proposed bivalent value based on a decision rule, is not solvable. The Omega Failure Detector is a construct that enables a solution, in the asynchronous system model, to the problem of consensus by encapsulating the portion of the problem that is impossible to solve. When queried, Omega eventually returns the same non-crashed (leader) process to all processes. Implementing Omega in the pure asynchronous system model is not possible. Therefore, we strengthen the model with the least restrictive synchrony assumptions that provide timeliness and reliability of message delivery. We assume that a message may be delivered by packets through multiple hops and investigate the feasibility and efficiency of an Omega Failure Detector implementation. We prove the existence and sustainability of a leader is exponentially more probable in a multi-hop than in a single-hop implementation. An implementation is: message efficient if all but finitely many messages are sent by a single process; packet efficient if the number of packets used to transmit a message in all but finitely many messages is linear w.r.t. the number of processes; super packet efficient if the number of channels used by packets to transmit all but finitely many messages is linear. Our results for deterministic algorithms implementing Omega follow. If reliability and timeliness of messages do not correlate, packet efficiency is impossible. We establish necessary and sufficient conditions for the existence of message and packet efficiency and prove correct our deterministic implementation. We prove the eventuality of channels’ timeliness makes super packet efficiency impossible.

Vinayak Sinha

2 years ago

Vinayak Sinha

Hacking all the things ... ...

Photo

Ricky Elrod

7 months ago

Ricky Elrod

Ricky Elrod created an event for YSU Association for Computing Machinery (ACM). ...

Using Recursive Functions to Generate Some Sick Beats, Yo!

November 30, 2016, 4:00pm - November 30, 2016, 6:00pm

Speaker: Chris A. Palmer In search of a way to quickly generate percussion sections of music that are unique and novel without sounding too "random," I wrote a recursive function to probabilistically assign beats to a rhythmic phrase by dividing a standard phrase into strong and weak sections recursively. This method creates unique rhythmic patterns while retaining a strong sense of pulse, or “where the down-beat is.” This talk will cover how various musical elements can be analyzed and synthesized using mathematical models such as trees and graphs, and how I've implemented some of these models. It will also feature some live, never before performed musical excerpts. Speaker Bio: Chris Palmer is a software engineer at IAM Robotics in Pittsburg. He is a YSU CSIS alum. He is currently working on software for autonomous piece picking robots for warehouses and distribution centers. In his spare time, he enjoys creating sick beats

Bonita Sharif

7 months ago

Bonita Sharif

Bonita Sharif created an event for YSU Association for Computing Machinery (ACM). ...

An Improved Overflow Detection Algorithm in Residue # Systems

November 16, 2016, 4:00pm

Title: An Improved Overflow Detection Algorithm in Residue Number Systems Abstract: Residue Number Systems (RNS) provide a highly parallelizable, carry-free method for performing arithmetic with integers that are far larger than a machine's native word size. While addition, subtraction, multiplication and certain divisions are easily performed operations within an RNS, other operations such as general division and comparison are far more time consuming. This talk presents an improved method for performing overflow detection after addition and subtraction, which forms the basis of comparison of values. Presenter: Dr. Bob Kramer

Ricky Elrod

8 months ago

Ricky Elrod

Reminder to all: Dr. Kramer will be giving a very interesting talk about his research in residue number systems today at 4pm in Meshel 337. BE THERE! ...

Follow us on Twitter

My Tweets

Our Friends

  • IXDA Youngstown Interaction Design Association
  • YSU Information Security and Ethical Hacking Association (ISEHA)
  • HackYSU YPH’s yearly 36 hour creation marathon.
  • Youngstown Penguin Hackers (YPH) A student organization dedicated to students empowering each other to create.
  • The North East Ohio ACM Chapter
  • Information Technology Student Association
  • Code Youngstown Connecting software engineers, developers and coders in the Youngstown, OH area
Proudly powered by WordPress