×

### Let's log you in.

or

Don't have a StudySoup account? Create one here!

×

or

24

0

9

# 711 Class Note for PHYS 597A with Professor Albert at PSU

Marketplace > Pennsylvania State University > 711 Class Note for PHYS 597A with Professor Albert at PSU

No professor available

These notes were just uploaded, and will be ready to view shortly.

Either way, we'll remind you when they're ready :)

Get a free preview of these Notes, just enter your email below.

×
Unlock Preview

COURSE
PROF.
No professor available
TYPE
Class Notes
PAGES
9
WORDS
KARMA
25 ?

## Popular in Department

This 9 page Class Notes was uploaded by an elite notetaker on Friday February 6, 2015. The Class Notes belongs to a course at Pennsylvania State University taught by a professor in Fall. Since its upload, it has received 24 views.

×

## Reviews for 711 Class Note for PHYS 597A with Professor Albert at PSU

×

×

### What is Karma?

#### You can buy or earn more Karma at anytime and redeem it for class notes, study guides, flashcards, and more!

Date Created: 02/06/15
Boolean logic and algebra Developed by George Boole 1850 Basic Boolean operators NOT AND OR Can be defined based on set intersection and union or inputoutput relations gates truth tables Assume you have a network where each node can have two states Denote these states by ON 1 or OFF 0 Assume that interactions between the nodes makes their state change Then you can use Boolean rules to describe the relation between the states of nodes that act on a node inputs and the new state of the node output Truth tables for Boolean operators NOT AND OR n1 n2 Out n1 n2 Out In Out 0 O O O O O 0 1 O 1 O 0 1 1 1 o 1 O O 1 O 1 1 1 1 1 1 1 Out NOT In Out n1 AND n2 Out n1 OR n2 Alternative notation aANDb gt aob aORb gt ab NOT a gt 1 Evaluating expressions invert first then perform AND then OR Ex Write NOT a AND b AND NOT a OR o in the alternative notation Evaluate it for several values of a b 0 Complete the truth table Random Boolean networks Construct a network where each node is connected randomly to K other nodes Assume that the state of each node can be 0 or 1 o The state of each node is updated each timestep The rule giving the new state of each node is determined by a Boolean function of the states of the nodes it is connected to o The Boolean function is selected randomly from all possible K input Boolean functions The state of the whole network changes in time Ex Construct a network of four nodes each with two edges Associate a Boolean rule to each node Start with an initial state and update the state of the nodes 10 times What is happening to the state of the network Start from a different initial state Will the final behavior be the same How many different states can the network have I I I o 1101 o o o I I I D39I 0 0391 0 o I o o mm o I o I 1 0 0 1 o o I I o I I o suomsueJi 91218 edwexe skexgw Concepts in RBN Attractor a set of states that repeats itself in afixed sequence can be periodic or a fixed point All states lead to or are part of an attractor Basin of attraction all states leading to a given attractor In a network of N nodes the maximum possible length of a periodic attractor is the total number of states 2N In practice the period length of the attractor is much shorter than this maximum Cause many nodes become frozen due partly to canalizing functions an attractor state shown in detail transient tree and sub trees Andy Wuenche wwwddabcom Canalizing forcing functions At least one of the inputs has the property that the output is fixed if this input has one particular value eg a AND b is canalizing because a0 implies a AND b 0 Ex 2 How many twoinput Boolean functions are there How many of them are canalizing

×

×

### BOOM! Enjoy Your Free Notes!

×

Looks like you've already subscribed to StudySoup, you won't need to purchase another subscription to get this material. To access this material simply click 'View Full Document'

## Why people love StudySoup

Steve Martinelli UC Los Angeles

#### "There's no way I would have passed my Organic Chemistry class this semester without the notes and study guides I got from StudySoup."

Allison Fischer University of Alabama

#### "I signed up to be an Elite Notetaker with 2 of my sorority sisters this semester. We just posted our notes weekly and were each making over \$600 per month. I LOVE StudySoup!"

Steve Martinelli UC Los Angeles

Forbes

#### "Their 'Elite Notetakers' are making over \$1,200/month in sales by creating high quality content that helps their classmates in a time of need."

Become an Elite Notetaker and start selling your notes online!
×

### Refund Policy

#### STUDYSOUP CANCELLATION POLICY

All subscriptions to StudySoup are paid in full at the time of subscribing. To change your credit card information or to cancel your subscription, go to "Edit Settings". All credit card information will be available there. If you should decide to cancel your subscription, it will continue to be valid until the next payment period, as all payments for the current period were made in advance. For special circumstances, please email support@studysoup.com

#### STUDYSOUP REFUND POLICY

StudySoup has more than 1 million course-specific study resources to help students study smarter. If you’re having trouble finding what you’re looking for, our customer support team can help you find what you need! Feel free to contact them here: support@studysoup.com

Recurring Subscriptions: If you have canceled your recurring subscription on the day of renewal and have not downloaded any documents, you may request a refund by submitting an email to support@studysoup.com