Heartbreakers (2001) Sigourney Weaver, Jennifer Love Hewitt, Ray Liotta, Jason Lee, Anne Bancroft, Jeffrey Jones, Gene Hackman, Nora Dunn, Julio Oscar Mechoso, Ricky Jay, Sarah Silverman, Zach Galifianakis, Michael Hitchcock. Screenplay by Robert Dunn, Paul Guay, Stephen Mazur. Directed by David Mirkin. 123 minutes. Rated PG-13, 1 star (out of five stars)
Review by Ed Johnson-Ott, NUVO Newsweekly www.nuvo.com Archive reviews at http://reviews.imdb.com/ReviewsBy?Edward+Johnson-Ott To receive reviews by e-mail at no charge, send subscription requests to<EMAIL_ADDRESS>or e-mail<EMAIL_ADDRESS>with the word "subscribe" in the subject line.
The swirling sick feeling hit me just a few minutes into "Heartbreakers." Ray Liotta's character was making out with his secretary when his new wife knocked on the door of his office. While scrambling to collect himself, he frantically shouted to her, "Just wait a sex – er, I mean sec!"
I was struck by a wave of revulsion, thinking, "Geez, didn't lines like that die when 'Three's Company' was canceled?" Over the next few minutes, as the barely double entendres and lingering cleavage shots grew more numerous, I realized that the mindset behind "Heartbreakers" predated "Three's Company." Suddenly, I had an out-of-body experience as my internal Way-Back machine swept me to the mid-1960s. All across America, the counter-culture was growing like wildfire, but there was scant evidence of it on TV. While young people were challenging traditional values on the streets, frustrated teenagers like me were stuck at home, sulking while our parents enjoyed the latest Bob Hope special. Women in skimpy bathing suits would prance onscreen while Hope made growling noises and leered at their breasts. On another channel, Dean Martin made wisecracks about "booze and broads" and Peter Lawford, decked out in love beads and a Nehru jacket, purred suggestive one-liners as he ogled the go-go dancers.
The adults laughed and laughed.
"Heartbreakers" reeks of that stagnant mentality, from its lingering shots of Jennifer Love Hewitt's vah-vah-voom breasts to its leaden screenplay, which paints women as haughty schemers and men as drooling buffoons too sex-obsessed to realize they are being manipulated. In addition to Liotta and Hewitt, the cast includes Sigourney Weaver, Gene Hackman, Jason Lee, Nora Dunn and Anne Bancroft. I can't imagine what drew performers of their caliber to this project. Perhaps they thought it was a parody of the sniggering sex comedies of the '60s. If so, they were sadly mistaken.
The story revolves around a mother-daughter con-team. It opens with the marriage of Max (Weaver) to Dean (Liotta), a New Jersey chop shop operator. Having withheld sex until the honeymoon, Max pretends to pass out on their wedding night. The next morning, she feigns illness, sending a very horny Dean off to the office, where he ends up in the arms of his new secretary. Just as the two are about to get overtly physical, Max bursts into the room and catches them. The "horrified" bride dissolves the union, garnering a healthy cash settlement along the way. Of course, the secretary was really her daughter Page (Hewitt) and the whole thing was a set-up.
The women move on, but an IRS agent (Bancroft) catches up with them and demands a huge amount of money to cover unpaid taxes. In desperate need of funds, Max and Page head for Palm Beach to replay the scam. Their mark this time is William B. Tensy (Hackman, in hideous make-up), a decrepit tobacco tycoon obsessed with the joys of smoking. Max starts to put the game into action, but Page is so repelled by the old man (and angry with her mom) that she slips off to enact her own score, targeting Jack, a laid back young beach bar owner who is worth a fortune.
Complications arise when Page realizes that good-natured Jack is stirring actual emotions in her steely little heart. As if that wasn't enough, Dean reappears on the scene with revenge on his mind.
The attempt to weld a romance onto a caper comedy served only to remind me of the infinitely superior "A Fish Called Wanda." I won't bother to compare the two. Suffice to say that everything done right in "Wanda" is done wrong here. "Heartbreakers" is soulless, inept and, at 123 minutes, at least a half-hour too long. Sigourney Weaver and Jennifer Love Hewitt throw themselves into their parts, but have nowhere to go with the metallic characters.  Poor Jason Lee is stuck in the ingenue role and the normally charismatic actor comes off as merely bland. Ray Liotta manages to squeeze a tiny bit of humanity and humor into his walking cliché, but only a bit.
  If you remember Bob Hope specials with fondness, this might be your cup of tea. As for me, I'm going to watch "A Fish Called Wanda" now and try to forget I ever saw "Heartbreakers."
© 2001 Ed Johnson-Ott
========== X-RAMR-ID: 28707 X-RT-AuthorID: 1099 X-RT-TitleID: 1105990 X-RT-RatingText: 1/5
The review above was posted to the
rec.arts.movies.reviews newsgroup (de.rec.film.kritiken for German reviews).
The Internet Movie Database accepts no responsibility for the contents of the
review and has no editorial control. Unless stated otherwise, the copyright
belongs to the author.
Please direct comments/criticisms of the review to relevant newsgroups.
Broken URLs inthe reviews are the responsibility of the author.
The formatting of the review is likely to differ from the original due
to ASCII to HTML conversion.
Related links: index of all rec.arts.movies.reviews reviews


| Status | No key-value pair written yet |
| Enter Key | |
| Enter Value | |
localStorage.setItem('someKey', someValue); localStorage.getItem('someKey'); // value // Can also access as a property. localStorage.someKey = someValue;
| Status | No key-value pair written yet |
| Enter Key | |
| Enter Value | |
Device APIs WG: www.w3.org/2009/dap/
navigator.onLine
/ navigator.connection
( network connectivity ) <audio width="320" height="240" controls="controls">
<source src="audio/movie.mp4" type="audio/mp4"/>
<source src="audio/movie.ogg" type="audio/ogg" />
Your browser does not support the audio tag.
</audio>
<video width="320" height="240" controls="controls">
<source src="video/movie.mp4" type="video/mp4"/>
<source src="video/movie.ogg" type="video/ogg" />
Your browser does not support the video tag.
</video>
Feel free to contact me!


|
pyfrechet
1.0
|
This program is a derrvied work of "Frechet distance decision problem 1.0" and "Weak Frechet distance decision problem 1.0." Defines functions used to compute frechet metric, distance and diagrams for two polynomial curves. More...
#include <stdlib.h>
#include <stdio.h>
#include <string.h>
#include <math.h>
#include <stdbool.h>
#include <errno.h>
#include "distance.h"
Functions | |
| int | createcurves (char *curve1filename, char *curve2filename, bool reversecurve2) |
| Reads data from the two input files and stores it to curve point arrays. More... | |
| void | calculatefreespace (double x1, double y1, double x2, double y2, double xa, double ya, double *start, double *end, double epsilon) |
| void | setfreespace (double epsilon) |
| Calculates the the bounderies of free space diagram. More... | |
| freespace | getfreespace () |
| point * | getcurve1 () |
| point * | getcurve2 () |
| int | getcurve1lenght () |
| int | getcurve2lenght () |
Variables | |
| point * | curve1 |
| Array of coordinates for first curve. More... | |
| point * | curve2 |
| Array of coordinates for second curve. | |
| point * | curvetmp |
| Array of coordinates temorarily used if second curve must be reversed. | |
| int | no1 |
| Number of vertices for first curve. | |
| int | no2 |
| Number of vertices for second curve. | |
| double ** | vFSs |
| Vertical free space diagram start. | |
| double ** | vFSe |
| Vertical free space diagram end. | |
| double ** | hFSs |
| Horizontal free space diagram start. | |
| double ** | hFSe |
| Horizontal free space diagram end. | |
| double ** | vRTs |
| Vertical reachability table start. | |
| double ** | vRTe |
| Vertical reachability table end. | |
| double ** | hRTs |
| Horizontal reachability table start. | |
| double ** | hRTe |
| Horizontal reachability table end. | |
This program is a derrvied work of "Frechet distance decision problem 1.0" and "Weak Frechet distance decision problem 1.0." Defines functions used to compute frechet metric, distance and diagrams for two polynomial curves.
Author: Carola Wenk cwenk @tul ane.e duhttp://www.cs.tulane.edu/~carola/research/code.html
Contributer: Will Rodman wrodm an@t ulane .edu
Licensed under the Apache License, Version 2.0 (the "License") you may not use this file except in compliance with the License. You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software distributed under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the License for the specific language governing permissions and limitations under the License.
| int createcurves | ( | char * | curve1filename, |
| char * | curve2filename, | ||
| bool | reversecurve2 | ||
| ) |
Reads data from the two input files and stores it to curve point arrays.
| curve1filename | Filename of first curve. |
| curve2filename | Filename of second curve. |
| reversecurve2 | true agurment if second curve must be reversed. |
| void setfreespace | ( | double | epsilon | ) |
Calculates the the bounderies of free space diagram.
| epsilon | Maximum distance between both curves. Represented by bounderies inside free space diagram (this arument will be only be used as an arugment to calculate free space) |
| point * curve1 |
Array of coordinates for first curve.
stdlib.h> stdio.h> string.h> math.h> stdbool.h> errno.h>


Frequently Asked Questions
Galleries
PySchool.net
Brython
glowscript
Videos
Basic Tour of PySchool.net


Hosting one of the largest GIS Day events in the world on one of the largest campuses in the State of Texas, generates a great opportunity to come an greet like-minded people and industry professionals.
Every year we are granted the opportunity to host speakers from varying disciplines and industries to share their knowledge, experience, love, and passion for GIS. Join us this year and hear what they have to say.
Enjoy hands-on interactive sessions and demonstrations granting technical experience in GIS real-world applications; from resume writing and help, to coding sessions from professionals.
GIS Day sponsors are increasingly becoming the backbone of the event and with a growing attendance rate, their contributions help drive the gears that make TxGIS Day possible. As a bonus, their contributions are translated to direct communication and exposure with attendees.
TxGIS Day 2021 would not be possible without the expertise, support, and personnel from the following participating organizations.


Converters are an integral part of DWR and are responsible for marshaling data between the client and the server. You must specify a converter for:
A number of converters deserve sections of their own:
The converters for primitives, strings and simple objects like BigDecimal are all there waiting for you. You don't need a <convert ...>
element in the <allow>
section in dwr.xml to use them - They are enabled by default.
The types enabled by default include: boolean, byte, short, int, long, float, double, char, java.lang.Boolean, java.lang.Byte, java.lang.Short, java.lang.Integer, java.lang.Long, java.lang.Float, java.lang.Double, java.lang.Character, java.math.BigInteger, java.math.BigDecimal and java.lang.String
The Date converter marshalls between a Javascript Date and a java.util.Date
, java.sql.Date
, java.sql.Times
or java.sql.Timestamp
. As with the basic converters above, the DateConverter is enabled by default.
If you have a string (e.g. "01 Jan 2010") in Javascript, that you wish to turn into a Java Date then you have 2 options: Parse it in Javascript using Date.parse()
and then pass it to the server using DWR's DateConverter, or pass it as a String and then parse it in Java using a SimpleDateFormat (or something similar).
On the other hand, if you have a date in Java which you wish to display in a usable form in HTML, then you can either transfer it as a string after using a DateFormatter on it, or transfer as a Date and then use Javascript to format it. The first option is probably easier although it does mean messing around with your converted objects, and it's doing something that it strictly view logic further from the browser. The latter option is better really and there are utilities to help you. For example:
It is fairly simple to create your own converter. The Javadoc for the Converter interface contains instructions. It quite rare however for this to be needed. Please make sure you understand the BeanConverter before starting to write your own Converter. Having implemented a custom converter, you need to register it with DWR. If you are using dwr.xml, there is an <init> section before the <allow> that lets you register new components. See the DTD documentation for more information.


| DOSE: |
25 mg |
oral |
2C-I |
(gel tab) |
I had tried 2ci before this but the set and setting of this journey allowed for a different, more relaxed experience.
One sunny saturday afternoon,I arrived at the house of a friend J, who's the girlfriend of my best friend in this world, M, who is also present. Beatiful, large house, with pianos and gardens and nice places. Also, a place I have always felt good and relaxed in, so it was a perfect setting.
I brought along the 2ci previously measured and safely store inside a gelcap and my friends were having AMT, their first experience with this compound and they were curious and somewhat aprehensive about it. I wasn't in the mood for a long AMT trip but felt my presence there would tranquilize them a bit and the 2ci certainly did help calm myself...
We downed our gelcaps at about 2pm and sat outside in the beatiful garden to wait. The 2CI is very, very gentle coming up while the AMT is slightly more boisterous so J and M were starting to take off
earlier than I did but I felt relaxed and happy, listening to some Jethro Tull playing in the background.
T+1:00 J is feeling a very strong buzz from AMT, M is still coming up and I begin to notice the first signs of 2ci working its way into my mind...On the physical side, a slight muscle tension, particularly in the left leg but real minor, and on the mental side colours begin to gain brightness and smoothness.
T+2:00 J is tripping very hard, very energized and rolling around, M is still coming up but feeling good and 2ci is full on. Beatiful waves of colorful patterns, some strange yet gorgeuos figures, resembling childern's toys, all very funny and producing a very warm and nice effect...Strong synesthesia and now we pop up some good old Hendrix in the cd player.
I know this sounds old fart stuff, but if you have never done this, do yourselves a favor and trip while listening to Are you Expericed, by Jimi Hendrix...I sat right in front, both speakers at an equal distance and loud, but not blaring. Just loud enough...the senses are enveloped by the spectral music, a very hard to describe feeling of being part of the notes and musical structure as if every sound was twitching and twisting every single cell, all very happy to conduct this chemical-musical orchestral feast...
T+4:00 Still riding high on the 2ci, we decide that Hendrix is definitely the way to go and watch the Live at Woodstock DVD on a 60' tv...What an effect!!!!the music and images intertwine, blending seamlessly into our eyes and ears and skin...I turn to look at my friends who are tripping very hard on AMT and I have many visual distortions, most notably one where I see them blending in with the couch, the walls, the floor, just like if they were an extension of those and their souls were commanding the whole house structure...Very weird but nice.
Now, dont get me wrong, I never felt 'too high' or like I'd lost it. 2CI seems very clean and smooth and it never disables you from doing ordinary stuff. But it makes you appreciate all the little details built in every single thing.
T+7:00 Noticeably down a notch, I pack my stuff to go and leave the AMT-explorers free to explore some carnal delights...I feel great, enjoying every scent, every sight, wondering why normal reality cannot be like this...alas...Another hour (T+8:00) and I am completely back to baseline, with real effects having lasted like 5-6 hours, plus 1or 2 hours of coming up and down.
I have grown very fond of this compound and feel this deserves a try by any serious psychonaut out there. It has avery gentle,soft and slow come up and come down but it is really worth the wait. It never screws your thoughts like high-dose LSD nor it gives you the rich visuals of acid. But it is a marvelous trip, with a nice body buzz and warmth, and easy rolling. By the way 2CI and LSD make a great combo, to which I will refer to at a later date.
My final comments on this report: This is a wonderful compound, one to be carefully and safely researched by anyone who wants to enjoy a great physical AND mental stimulation, made all the more special by the incredible interaction with music. Have great music around, sit back and roll into it....
Experience Reports are the writings and opinions of the individual authors who submit them.
Some of the activities described are dangerous and/or illegal and none are recommended by Erowid.


Experience
Software developer with previous experience in finance for education and video production as a comunnity building strategy. Cycling, photography, meditation. The best routine is constant change.
Most relevant projects that help me build my current self #
| Project | Description | Date |
|---|---|---|
| Tempo | Web application | Feb-Mar 2021 |
| AirBnB clone | Web application | Jul - Nov 2020 |
| Video tutorial Icetex | Script to production | Nov 2016 |
| Careador.com | Wordpress CMS website | 2015 -2016 |
| Yo Candelaria | Colaborative Documentary | Feb - Jun 2014 |
I have also learnt from other jobs such as: Event photographer, video editor, barista, removalist, biligual call center agent, bilingual bicycle tour guide, both Spanisg-English.
There's no articles to list here yet.


The best-of-breed integration stack by the Apache Community
Apache ServiceMix is a flexible, open-source integration container that unifies the features and functionality of Apache ActiveMQ, Apache Camel, Apache CXF, and Apache Karaf into a powerful runtime platform you can use to build your own integrations solutions.
It provides a complete, enterprise ready ESB exclusively powered by OSGi.


Perform dynamic model averaging with grid search as in Dangl and Halling (2012) <doi:10.1016/j.jfineco.2012.04.003> using parallel computing.
| Version: | 1.5-3 |
| Depends: | zoo, xts, methods, parallel |
| Imports: | Rcpp (≥ 0.12.5) |
| LinkingTo: | Rcpp, RcppArmadillo |
| Published: | 2018-08-27 |
| Author: | Leopoldo Catania [aut,cre], Nima Nonejad [aut] |
| Maintainer: | Leopoldo Catania <leopoldo.catania at econ.au.dk> |
| License: | GPL-2 | GPL-3 [expanded from: GPL (≥ 2)] |
| NeedsCompilation: | yes |
| SystemRequirements: | Requires the OpenMP library for parallel computing. If the OpenMP library is not available, the code is executed sequentially and a warning is printed. |
| Citation: | eDMA citation info |
| Materials: | README ChangeLog |
| CRAN checks: | eDMA results |
| Reference manual: | eDMA.pdf |
| Package source: | eDMA_1.5-3.tar.gz |
| Windows binaries: | r-devel: eDMA_1.5-3.zip, r-release: eDMA_1.5-3.zip, r-oldrel: eDMA_1.5-3.zip |
| OS X binaries: | r-release: eDMA_1.5-3.tgz, r-oldrel: eDMA_1.5-3.tgz |
| Old sources: | eDMA archive |
Please use the canonical form https://CRAN.R-project.org/package=eDMA to link to this page.


|
|
+ Web Templates
Each web template includes page layout, graphics,
CSS and Meta tag.
-HTML file
-Images GIF or JPG files
-Blank image GIF or JPG for logo and buttons. |
|
|
|
We offers web templates and flash templates
as low as $1.5.
"Web templates" and "Flash templates" are royalty
free no link back required. You are free to use
templates for yourself or your client website.
Our web templates cannot be resold or
re-distributed in any form individually
or as a collection.
Join Now! and start downloading immediately.
Web templates and Flash templates
as low as $1.5 each. Instant download
after the payment.
|
+ Web Interfaces (PSD)
Providing the layered PhotoShop, customizing the
interfaces is easy. (780*450 pixels)
- New templates weekly
- Link back Required
- Support Dreamweaver, FrontPages
and GoLive Users. |
|
|
|


--- layout: page title: LetsFiddle tagline: Explore the web description: " Now associate yourself with the latest miracles on going all over in this baffling and fascinating world of web.  You will not only feel curious rather hooked up with the whole new exposure we will be providing. " --- {% include JB/setup %}


The Black Alpha Series is back with the Ultimax gaming chair that fits your need for a cool style
Price inludes shipping and taxes.

This winter...Create a bold impression on other gamers with the Stewart Bold series


Provides the URL generation routines.
JSPWiki generates URLs using the URLConstructor classes in this interface. It's possible to create your own URLs simply by installing your own URLConstructor.


About Us
days around the world, we'll find a pot of gold just sitting where the rainbow's ending. Time - we'll fight against the time, and we'll fly on the white wings of the wind. 80 days around the world, no we won't say a word before the ship is really back. Round, round, all around the world. Round, all around the world. Round, all around the world. Round, all around the world.
This is my boss, Jonathan Hart, a self-made millionaire, he's quite a guy. This is Mrs H., she's gorgeous, she's one lady who knows how to take care of herself. By the way, my name is Max. I take care of both of them, which ain't easy, 'cause when they met it was MURDER!
Top Cat! The most effectual Top Cat! Who's intellectual close friends get to call him T.C., providing it's with dignity. Top Cat! The indisputable leader of the gang. He's the boss, he's a pip, he's the championship. He's the most tip top, Top Cat.
- Thabo Titus


Seeking to impress that certain someone? They do say the surest way to a persons heart is through the belly. SO MUCH PRESSURE! Sure you can rely on the tried and true Dinner places, but where's the fun in that. Love & Dinner are supposed to be exciting. FOODIE PASS has got you covered.
It's time to book that Dinner engagement for an Important Party! Maybe its a Work Meeting, A Celebration of some kind (Grandma is turning 80 and wants a classy Sazerac!), or Old Friends have come to town and you're going out. Foodie Pass can please everyone.
Finally! Works Done. Time to decompress. Just one more question. What do I feel like? Something Spicy? Eclectic? What's the Vibe? Low-key? or something out of my comfort zone. Fetch your friendly FOODIE PASS and it'll ease your burden.


Deferrer just provides a wrapper on native Promise object with type support. Deferrer provides/converts asynchronous operation to Promises which results developers to write clean and neat awaitable operation using async-await pattern.
Deferrer just provides a wrapper on native Promise object with type support. Deferrer provides/converts asynchronous operation to Promises which results developers to write clean and neat awaitable operation using async-await pattern.


Thing.js
Thing.js is meant to be an extremely light weight IoT-framework. Loosely inspired by W3C web of things framework, a thing is an object that has:
- Metadata
- Properties
- Actions
- Events
Thing.js exports a single class 'Thing,' which is an extension of the Node.js EventEmitter Class, and contains useful methods for:
- Updating properties
- Calling actions
- Emiting events
- Setting up event listeners
- Scheduling actions and events
Full documentation available here.
For example of how this can be used in an IoT stack, checkout Grow.js and Grow-IoT.
Install
npm install Thing.js
Example
var Thing = require('Thing.js');
var Light = new Thing({
name: 'Light',
desription: 'An LED light with a basic on/off api.',
username: 'jakehart',
properties: {
state: 'off',
lightconditions: function () {
// Properties can be updated by the API.
// Note: property functions should return a value.
return null;
}
},
actions: {
turn_light_on: {
name: 'On', // Display name for the action
description: 'Turns the light on.', // Optional description
schedule: 'at 9:00am', // Optional scheduling using later.js
function: function () {
// The implementation of the action.
console.log('light on');
Light.setProperty('state', 'on');
}
},
turn_light_off: {
name: 'off',
schedule: 'at 8:30pm',
function: function () {
console.log('light off');
Light.set('state', 'off');
}
},
light_data: {
name: 'Log light data',
type: 'light',
template: 'sensor',
schedule: 'every 1 second',
function: function () {
console.log("Log light data.")
}
}
},
events: {
check_light_data: {
name: 'Check light data',
on: 'turn_light_on', // Adds Listener for action event.
function: function () {
console.log('this event listener is called when the light is turned on.');
}
}
}
},
function start () {
// Optional callback function.
return;
});
console.log(Light.get(state));
// logs 'off'
Light.callAction('turn_light_on');
// logs 'Light on.'
// logs 'this event listener is called when the light is turned on.'
console.log(Light.get(state));
// logs 'on'
Please open issues or PRs with thoughts || suggestions || proposals.
Developing
Code is written in ES6, and compiled using rollup. Full documentation is available here.
npm run build
builds the library.
npm run test
builds the library, and runs tests in the test folder.
The documentation is written in jsdoc, built using Mr-Doc, and kept on the gh-pages branch of this repo.


In these Terms of Use, “you” or “your” includes the individual using or accessing the Cannabis Licensing Application Portal
(the “Site”) on their own behalf, as well as any applicant (“Applicant”) for a cannabis retail store licencse (“Retailer
Licence”) that you represent.
These Terms of Use are an agreement between you and Her Majesty the Queen in Right of the Province of British Columbia,
represented by the Attorney General (the “Province”) and they govern your use of the Site and, where applicable, any
associated service (“Associated Service” and, together with the Site, the “Services”). By clicking the box to indicate
that you accept these Terms of Use, and in consideration of your use of the Services, you agree, on your own behalf
and on behalf of the Applicant you represent, to the terms and conditions set out below.
Your failure to abide by these Terms of Use may result in the suspension or cancellation of your use of or access
to the Services and/or your Retailer Licencse. In addition, the Province and the provider of any Associated Service
reserve the right to pursue any remedy available at law or in equity.
Please print a copy of these Terms of Use for your records.


EXERCISES
Advanced Search Exercises
4.1: Local Search Algorithms and Optimization Problems (4 exercises, 1 labelled)
1.
Give the name of the algorithm that results from each of the following special cases:
a. Local beam search with k = 1.
b. Local beam search with one initial state and no limit on the number of states retained.
c. Simulated annealing with T = 0 at all times (and omitting the termination test).
d. Simulated annealing with T = ∞ at all times.
e. Genetic algorithm with population size N = 1.
(id=4.0 section=4.1)
2.
Exercise 3.16( will insert a link later ) considers the problem of building railway tracks under the assumption that pieces fit exactly with no slack. Now consider the real problem, in which pieces don’t fit exactly but allow for up to 10 degrees of rotation to either side of the “proper” alignment. Explain how to formulate the problem so it could be solved by simulated annealing.
(id=4.1 section=4.1.2)
3.
In this exercise, we explore the use of local search methods to solve TSPs of the type defined in Exercise 3.30 ( will insert link later ).
a. Implement and test a hill-climbing method to solve TSPs. Compare the results with optimal solutions obtained from the A* algorithm with the MST heuristic (Exercise 3.30).
b. Repeat part (a) using a genetic algorithm instead of hill climbing. You may want to
consult Larran ̃aga et al. (1999) for some suggestions for representations.
(id=4.10 section=4.1)
4.
[hill-climbing-exercise]%:
Generate a large number of 8-puzzle and 8-queens instances and solve them (where possible) by hill climbing (steepest-ascent and first-choice variants), hill climbing with random restart, and simulated annealing. Measure the search cost and percentage of solved problems and graph these against the optimal solution cost. Comment on your results
(id=4.11 section=4.1)
4.3: Searching with Nondeterministic Actions (2 exercises, 2 labelled)
5.
[cond-plan-repeated-exercise]:
The AND-OR-GRAPH-SEARCH algorithm in :
checks for repeated states only on the path from the root to the current state. Suppose that, in addition, the algorithm were to store every visited state and check against that list. (See BREADTH-FIRST-SEARCH in Figure 3.11 from book for an example.) Determine the information that should be stored and how the algorithm should use that information when a repeated state is found. (Hint: You will need to distinguish at least between states for which a successful subplan was constructed previously and states for which no subplan could be found.) Explain how to use labels, as defined in Section 4.3.3, to avoid having multiple copies of subplans.
(id=4.2 section=4.3.2)
6.
[cond-loop-exercise]:
Explain precisely how to modify the AND-OR-GRAPH-SEARCH algorithm to generate a cyclic plan if no acyclic plan exists. You will need to deal with three issues: labeling the plan steps so that a cyclic plan can point back to an earlier part of the plan, modifying OR-SEARCH so that it continues to look for acyclic plans after finding a cyclic plan, and augmenting the plan representation to indicate whether a plan is cyclic. Show how your algorithm works on (a) the slippery vacuum world, and (b) the slippery, erratic vacuum world. You might wish to use a computer implementation to check your results
(id=4.3 section=4.3.3)
4.4: Searching with Partial Observations (5 exercises, 4 labelled)
7.
In Section 4.4.1 we introduced belief states to solve sensorless search problems. A sequence of actions solves a sensorless problem if it maps every physical state in the initial belief state
b to a goal state. Suppose the agent knows h*(s), the true optimal cost of solving the physical state
s in the fully observable problem, for every state
s in
b. Find an admissible heuristic
h(b) for the sensorless problem in terms of these costs, and prove its admissibilty. Comment on the accuracy of this heuristic on the sensorless vacuum problem of :
How well does : A∗ perform?
id=4.4 section=4.4.1)
8.
[belief-state-superset-exercise] :
This exercise explores subset–superset relations between belief states in sensorless or partially observable environments.
a. Prove that if an action sequence is a solution for a belief state b, it is also a solution for any subset of b. Can anything be said about supersets of b?
b. Explain in detail how to modify graph search for sensorless problems to take advantage of your answers in (a).
c. Explain in detail how to modify AND–OR search for partially observable problems, beyond the modifications you describe in (b).
( id=4.5 section=4.4)
9.
[multivalued-sensorless-exercise] :
On page 139 it was assumed that a given action would have the same cost when ex- ecuted in any physical state within a given belief state. (This leads to a belief-state search problem with well-defined step costs.) Now consider what happens when the assumption does not hold. Does the notion of optimality still make sense in this context, or does it require modification? Consider also various possible definitions of the “cost” of executing an action in a belief state; for example, we could use the
minimum of the physical costs; or the
maximum; or a cost
interval with the lower bound being the minimum cost and the upper bound being the maximum; or just keep the set of all possible costs for that action. For each of these, explore whether A* (with modifications if necessary) can return optimal solutions
(id=4.6 section=4.4)
10.
[vacuum-solvable-exercise] :
Consider the sensorless version of the erratic vacuum world. Draw the belief-state space reachable from the initial belief state {1, 2, 3, 4, 5, 6, 7, 8}, and explain why the problem is unsolvable.
(id=4.7 section=4.4)
11.
[vacuum-solvable-exercise] :
Consider the sensorless version of the erratic vacuum world .
Draw the belief-state space reachable from the initial belief state
N{1,3,5,7} , and explain why the problem is unsolvable.
( id=4.7 section=4.4 )
4.5: Online Search Agents and Unknown Environments (4 exercises, 2 labelled)
12.
[online-offline-exercise] :
Suppose that an agent is in a 3×3 maze environment like the one shown in Figure :
The agent knows that its initial location is (1,1), that the goal is at (3,3), and that the actions
Up, Down, Left, Right have their usual effects unless blocked by a wall. The agent does not know where the internal walls are. In any given state, the agent perceives the set of legal actions; it can also tell whether the state is one it has visited before.
a. Explain how this online search problem can be viewed as an offline search in belief-state space, where the initial belief state includes all possible environment configurations. How large is the initial belief state? How large is the space of belief states?
b. How many distinct percepts are possible in the initial state?
c. Describe the first few branches of a contingency plan for this problem.
Notice that this contingency plan is a solution for
every possible environment fitting the given description. Therefore, interleaving of search and execution is not strictly necessary even in unknown environments.
(id=4.8 section=4.5.1)
13.
[path-planning-agent-exercise] :
We can turn the navigation problem in Exercise 3.7 into an environment as follows:
The percept will be a list of the positions, relative to the agent, of the visible vertices. The percept does not include the position of the robot! The robot must learn its own po- sition from the map; for now, you can assume that each location has a different “view.”
Each action will be a vector describing a straight-line path to follow. If the path is unobstructed, the action succeeds; otherwise, the robot stops at the point where its path first intersects an obstacle. If the agent returns a zero motion vector and is at the goal (which is fixed and known), then the environment teleports the agent to a random location (not inside an obstacle).
The performance measure charges the agent 1 point for each unit of distance traversed and awards 1000 points each time the goal is reached.
a) Implement this environment and a problem-solving agent for it. After each teleportation, the agent will need to formulate a new problem, which will involve discovering its current location.
b) Document your agent’s performance (by having the agent generate suitable commentary as it moves around) and report its performance over 100 episodes.
c) Modify the environment so that 30% of the time the agent ends up at an unintended destination (chosen randomly from the other visible vertices if any; otherwise, no move at all). This is a crude model of the motion errors of a real robot. Modify the agent so that when such an error is detected, it finds out where it is and then constructs a plan to get back to where it was and resume the old plan. Remember that sometimes getting back to where it was might also fail! Show an example of the agent successfully overcoming two successive motion errors and still reaching the goal.
d) Now try two different recovery schemes after an error: (a) head for the closest vertex on the original route; and (b) replan a route to the goal from the new location. Compare the performance of the three recovery schemes. Would the inclusion of search costs affect the comparison?
e) Now suppose that there are locations from which the view is identical. (For example, suppose the world is a grid with square obstacles.) What kind of problem does the agent now face? What do solutions look like?
( id=4.9 section=4.4)
14
[path-planning-hc-exercise] :
In this exercise, we examine hill climbing in the context of robot navigation, using the environment in figure :
as an example.
a. Repeat above Exercise using hill climbing. Does your agent ever get stuck in a local minimum? Is it
possible for it to get stuck with convex obstacles?
b. Construct a nonconvex polygonal environment in which the agent gets stuck.
c. Modify the hill-climbing algorithm so that, instead of doing a depth-1 search to decide where to go next, it does a depth-
k search. It should find the best
k-step path and do one step along it, and then repeat the process.
d. Is there some k for which the new algorithm is guaranteed to escape from local minima?
e. Explain how LRTA∗ enables the agent to escape from local minima in this case.
(id=4.12 section=4.5)
15.
Like DFS, online DFS is incomplete for reversible state spaces with infinite paths. For example, suppose that states are points on the infinite two-dimensional grid and actions are unit vectors (1, 0), (0, 1), (−1, 0), (0, −1), tried in that order. Show that online DFS starting at (0, 0) will not reach (1, −1). Suppose the agent can observe, in addition to its current state, all successor states and the actions that would lead to them. Write an algorithm that is complete even for bidirected state spaces with infinite paths. What states does it visit in reaching (1, −1)?
(id=4.13 section=4.5)
16.
Relate the time complexity of LRTA* to its space complexity.
(id=4.14 section=4.5)
17.
{safe-ratio-exercise}
Extend the state spaces in
to make them safely explorable, and prove that no bounded competitive ratio can be guaranteed in safely explorable environments.


|
My Project
|
The partmap<> template mapping a linear space to value objects. More...
#include <map>
Go to the source code of this file.
Classes | |
| class | partmap< _linetype, _valuetype > |
| A map from a linear space to value objects. More... | |
The partmap<> template mapping a linear space to value objects.


A look through the eyes of someone who can't come into school.
See moreA couple weeks ago, Artfol hit the appstore. But what makes it so great?
See moreThe future of cars are changing, soon there may be no more gasoline powered cars on the road, but what type of car will take the lead in this market?
See moreEarios Podcast Network, run entirely by women, is revolutionizing the podcasting scene. With lower barriers of entry, a focus on creating, and some very funny guests, they're tackling the podcast bias against women head on.
See moreWhere does the easter bunny come from?
See more


Continous benchmarking of single-cell tools using RENKU
1 Department of Molecular Life Sciences, University of Zurich, Switzerland
2 SIB Swiss Institute of Bioinformatics, Switzerland
3 Swiss Data Science Center, ETH Zurich and EPFL, Switzerland
4 Friedrich Miescher Institute, Basel, Switzerland
5 D-HEST Institute for Neurosciences, ETH Zürich, Switzerland
6 Center for Thrombosis and Hemostasis (CTH), Johannes Gutenberg University Mainz, Germany
Benchmarking is critical for the development of performant computational methods and provides important insights for their application. In particular, methods research in single-cell RNA-seq (scRNA-seq) provides a perfect use case, where more than 900 tools have been developed in only a few years [1]. Benchmarking efforts are often not coordinated
, not extensible
and not reproducible
.
Current benchmarking approaches have many limitations:
– they represent only a snapshot
of the available methods at a certain time point.
– they become quickly outdated
, even at the time of a publication.
– they suffer low comparability
: different procedures, different datasets, different evaluation criteria.
– they lack standardization
; each benchmarker decides the importance of performance criteria.
– all of the above can lead to different conclusions
among benchmarks made at different time points or at different groups.
\(\checkmark\) We propose a new modular
and extensible
framework based on a free open-source analytic platform, RENKU
, to offer a continuous and open community benchmarking system
.
\(\checkmark\) The framework consists of data
, method
and metric
repositories (or “modules”) that are connected via a knowledge graph
.
\(\checkmark\) Performance results can be coupled with an interactive dashboard
to be explored flexibly by any analyst looking for tool recommendations.
\(\checkmark\) New datasets, methods or metrics can be added by the community
.
Key features of the developed benchmarking framework:
FAIR
principles via Docker images, integration with Gitlab and full provenance
.independent (docker) environments
and flexibly connects and shares modules within and between benchmarks.various programming languages
used in bioinformatics: R, Python, Bash, Julia, etc.We are currently building a prototype (Figure 1) for community-based benchmarking of single-cell batch correction methods.
Our prototype consists of:
RENKU is an open and collaborative platform that provides a knowledge infrastructure for the entire research life cycle (Figure 3). The platform and its tools are built on top of a stack of open-source components and aims to make data science reproducible.
On RENKU:
Since RENKU is based on cloud computing, fully interactive sessions can be accessed via a the browser, with no local installation needed.
Versioning and containers ensure precise and reproducible computational environments.
Datasets and workflows are automatically tracked in a knowledge graph
, which can be queried from within a project, a group of projects or even across deployments.
Workflows can be re-run or updated automatically when inputs such as datasets or scripts change.
CI/CD can be leveraged to automate cumbersome tasks, such as fetching results of a piece of analysis to integrate into a dashboard.
1. Zappia L, Phipson B, Oshlack A. Exploring the single-cell RNA-seq analysis landscape with the scRNA-tools database. PLOS Computational Biology. 2018;14:e1006245. doi:10.1371/journal.pcbi.1006245.
2. Su S, Tian L, Dong X, Hickey PF, Freytag S, Ritchie ME. CellBench: R/Bioconductor software for comparing single-cell RNA-seq analysis methods. Bioinformatics. 2020;36:2288–90. doi:10.1093/bioinformatics/btz889.
3. Lütge A, Zyprych-Walczak J, Kunzmann UB, Crowell HL, Calini D, Malhotra D, et al. CellMixS: Quantifying and visualizing batch effects in single-cell RNA-seq data. Life Science Alliance. 2021;4. doi:10.26508/lsa.202001004.
4. Haghverdi L, Lun ATL, Morgan MD, Marioni JC. Batch effects in single-cell RNA-sequencing data are corrected by matching mutual nearest neighbors. Nature Biotechnology. 2018;36:421–7. doi:10.1038/nbt.4091.
5. Korsunsky I, Millard N, Fan J, Slowikowski K, Zhang F, Wei K, et al. Fast, sensitive and accurate integration of single-cell data with Harmony. Nature Methods. 2019;16:1289–96. doi:10.1038/s41592-019-0619-0.
6. Marini F, Soneson C. Bettr: A better way to explore what is best. 2021. https://github.com/federicomarini/bettr. Accessed 19 Jul 2021.
Continous benchmarking of single-cell tools using RENKU


Ryan Gurney is currently a student at the University of California, San Diego, and is pursuing a B.S. in computer science. He is an all-around totally awesome guy.


PLAN YOUR JOURNEY
Home
(current)
Helpline number
Bus type
ordinary
fast passenger
low floor A/C
Team
Search
Previous
Next
FROM:
TO:
book your seats now


Show navigation
Hide navigation
Home
ISLMUN 2018
Press and Video
Sample Documents
Director's Address
Secretary General's Address
Executive Team
ISLMUN Procedures
ICJ Procedures
Core Values
❮
❯
Event Calendar
-
23rd Nov. 2017
8th Dec. 2017
12th Dec. 2017
Payment Deadline
Student Officer Training Day
Research Report Publishing
12th Jan. 2018
13th Jan. 2018
Conference Day 1
Conference Day 2
+


---
layout: archive
title: Lean Prover Zulip Chat Archive
permalink: 113489newmembers/90615Splittingmultipleconjunctionsinonego.html
---
The archive URL format has changed. Please find this page at:
https://leanprover-community.github.io/archive/stream/113489-new-members/topic/Splitting.20multiple.20conjunctions.20in.20one.20go.html


🌧
Blocks
Powered by Raincloud
{{#section blocks multiple=true}}
{{description label="Block description" type=html editor=wysiwyg}}
{{/section}}


{{project.graphs.length}} graphs, {{project.components.length}} components
Access only to public GitHub repositories.
Private repository
Public repository
{{runtime.address}}. Seen {{runtime.seenHoursAgo}}h ago
{{example.address}}


Enter a number and select 'see the result'. Selcect the 'play again' button to play as many times as you would like.


Password Generator
Generate your own random password
Select A Password Length Between 8 & 128.
Lower-Case Characters
Upper-Case Characters
Numerical Characters
Special Characters
Your new password is
Back To portfolio


OslcError
public enum OslcError : Error
OslcError enumeration
- attachmentAlreadyLoaded: Attachment is already loaded.
- resourceAlreadyLoaded: Resource is already loaded.
- invalidAttachment: Invalid attachment.
- invalidResource: Invalid resource.
- invalidRelation: Invalid relation.
- invalidURL: Invalid URL.
- invalidRequest: Invalid request.
- invalidResponse: Invalid response.
- loginFailure: Login failure.
- serverError: Server error.
- connectionAlreadyEstablished: The connection is already estabilished.
- invalidConnectorInstance: Invalid connector instance.
- noAttachmentFound: No attachment found.
- noResourceFound: No resource found.
- noRelationFound: No relation found.
- noURLFound: No URL found.
-
Undocumented
Declaration
Swift
case attachmentAlreadyLoaded
-
Undocumented
Declaration
Swift
case resourceAlreadyLoaded
-
Undocumented
Declaration
Swift
case invalidAttachment
-
Undocumented
Declaration
Swift
case invalidResource
-
Undocumented
Declaration
Swift
case invalidRelation
-
Undocumented
Declaration
Swift
case invalidURL
-
Undocumented
Declaration
Swift
case invalidRequest
-
Undocumented
Declaration
Swift
case invalidResponse
-
Undocumented
Declaration
Swift
case loginFailure(message: String)
-
Undocumented
Declaration
Swift
case serverError(code: Int, message: String)
-
Undocumented
Declaration
Swift
case connectionAlreadyEstablished
-
Undocumented
Declaration
Swift
case invalidConnectorInstance
-
Undocumented
Declaration
Swift
case noAttachmentFound
-
Undocumented
Declaration
Swift
case noResourceFound
-
Undocumented
Declaration
Swift
case noRelationFound
-
Undocumented
Declaration
Swift
case noURLFound


This is a random quote machine click the button below and see the quote appear in the box below! The daily quote changes depending on the day this page is viewed, see it by downloading this page and changing the time on your PC. This contains some of interesting quotes. For more quotes like this go here.
Tweet This!
© Coded by Ng Kok Wah


|
SnuPL Compiler
0.1
|
SnuPL/0 parser. More...
#include <parser.h>
Public Member Functions | |
| CParser (CScanner *scanner) | |
| constructor More... | |
| CAstNode * | Parse (void) |
| parse a module More... | |
Private Member Functions | |
| void | SetError (CToken t, const string message) |
| sets the token causing a parse error along with a message More... | |
| bool | Consume (EToken type, CToken *token=NULL) |
| consume a token given type and optionally store the token More... | |
| void | InitSymbolTable (CSymtab *s) |
| initialize symbol table More... | |
methods for recursive-descent parsing | |
| CAstModule * | module (void) |
| takes entire module and make AST node More... | |
| CSymtab * | varDeclaration (CSymtab *symbols, ESymbolType s_type, bool openArray) |
| takes a set of variable declaration and add them into the given symbol table More... | |
| CSymtab * | varDecl (CSymtab *symbols, ESymbolType s_type, vector< CSymParam * > *params, bool openArray) |
| takes an one type of the variable declaration and add them into the given symbol table More... | |
| CAstProcedure * | subroutineDecl (CAstScope *s) |
| takes a declaration part of subroutine and add it into global symbol table More... | |
| const CAstType * | ReadType (bool openArray, bool beArray) |
| takes a type definition More... | |
| CAstStatement * | statSequence (CAstScope *s) |
| takes a sequence of statements to make a linked list of them More... | |
| CAstStatement * | statement (CAstScope *s) |
| takes each statement More... | |
| CAstStatAssign * | assignment (CAstScope *s) |
| takes an assignment statement More... | |
| CAstStatCall * | subroutineCall (CAstScope *s) |
| takes a subroutine call statement More... | |
| CAstStatIf * | ifStatement (CAstScope *s) |
| takes an if statement More... | |
| CAstStatWhile * | whileStatement (CAstScope *s) |
| takes a while loop statement More... | |
| CAstStatReturn * | returnStatement (CAstScope *s) |
| takes a return statement More... | |
| CAstExpression * | factor (CAstScope *s) |
| takes a factor like constants, qualident, parenthesized expression, negated factor More... | |
| CAstDesignator * | qualident (CAstScope *s) |
| takes a qualident as ident { "[" [ number ] "]" } More... | |
| CAstFunctionCall * | expSubroutineCall (CAstScope *s) |
| takes a subroutine call expression More... | |
| CAstExpression * | term (CAstScope *s) |
| takes a term as "factor { termOp factor }" More... | |
| CAstExpression * | simpleexpr (CAstScope *s) |
| takes a simpleexpr as "[ + | - ] term { termOp term }" More... | |
| CAstExpression * | expression (CAstScope *s) |
| takes an expression as "simpleexpr [ relOp simpleexpr ]" More... | |
| CAstConstant * | number (void) |
| takes a number constant and check w.o.n it exceeds a boundary More... | |
| CAstConstant * | boolean (void) |
| takes "true" or "false" More... | |
| CAstConstant * | character (void) |
| takes a character constant and unescape it More... | |
| CAstStringConstant * | stringConst (CAstScope *s) |
| takes a string constant More... | |
Private Attributes | |
| CScanner * | _scanner |
| CScanner instance. More... | |
| CAstModule * | _module |
| root node of the program More... | |
| CToken | _token |
| current token More... | |
error handling | |
| CToken | _error_token |
| error token More... | |
| string | _message |
| error message More... | |
| bool | _abort |
| error flag More... | |
| bool | HasError (void) const |
| indicates whether there was an error while parsing the source More... | |
| const CToken * | GetErrorToken (void) const |
| returns the token that caused the error More... | |
| string | GetErrorMessage (void) const |
| returns a human-readable error message More... | |
SnuPL/0 parser.
2012/09/14 Bernhard Egger created 2013/03/07 Bernhard Egger adapted to SnuPL/0 2016/03/09 Bernhard Egger adapted to SnuPL/! 2016/04/08 Bernhard Egger assignment 2: parser for SnuPL/-1
Copyright (c) 2012-2016, Bernhard Egger All rights reserved.
Redistribution and use in source and binary forms, with or without modifi- cation, are permitted provided that the following conditions are met:
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSE- QUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. parser
parses a module
| CParser::CParser | ( | CScanner * | scanner | ) |
constructor
| scanner | CScanner from which the input stream is read |
Definition at line 52 of file parser.cpp.
|
private |
takes an assignment statement
| s | parent scope |
| CAstStatAssign* | node with lhs and rhs |
Definition at line 626 of file parser.cpp.
|
private |
takes "true" or "false"
| CAstConstant* | node with boolean type and 1 if true, 0 if false |
Definition at line 1115 of file parser.cpp.
|
private |
takes a character constant and unescape it
| CAstConstant* | node with character type and its value |
Definition at line 1134 of file parser.cpp.
consume a token given type and optionally store the token
| type | expected token type |
| token | If not null, the consumed token is stored in 'token' |
| true | if a token has been consumed |
| false | otherwise |
Definition at line 99 of file parser.cpp.
|
private |
takes an expression as "simpleexpr [ relOp simpleexpr ]"
| s | parent scope |
| CAstExpression* | node with an expression |
Definition at line 1041 of file parser.cpp.
|
private |
takes a subroutine call expression
| s | parent scope |
| CAstFunctionCall* | node with a procedure symbol |
Definition at line 907 of file parser.cpp.
|
private |
takes a factor like constants, qualident, parenthesized expression, negated factor
| s |
| CAstExpression* | node with a factor |
Definition at line 779 of file parser.cpp.
| string CParser::GetErrorMessage | ( | void | ) | const |
returns a human-readable error message
| error | message |
Definition at line 85 of file parser.cpp.
| const CToken * CParser::GetErrorToken | ( | void | ) | const |
returns the token that caused the error
| CToken | containing the error token |
Definition at line 79 of file parser.cpp.
|
inline |
|
private |
takes an if statement
| s | parent scope |
| CAstStatIf* | node with ifcondition, ifstat and elsestat |
Definition at line 697 of file parser.cpp.
|
private |
initialize symbol table
| s | with predefined procedures and global variables |
Definition at line 115 of file parser.cpp.
|
private |
takes entire module and make AST node
| CAstModule* | node |
Definition at line 156 of file parser.cpp.
|
private |
takes a number constant and check w.o.n it exceeds a boundary
| CAstConstant* | node with integer type and value |
Definition at line 1077 of file parser.cpp.
| CAstNode * CParser::Parse | ( | void | ) |
|
private |
takes a qualident as ident { "[" [ number ] "]" }
| s | parent scope |
| CAstDesignator* | node with the qualident's symbol |
Definition at line 862 of file parser.cpp.
|
private |
takes a type definition
| openArray | checks it allows opened array or not |
| beArray | true if it is return type of function to make type error |
| CAstType* | node with its type |
Definition at line 461 of file parser.cpp.
|
private |
takes a return statement
| s | parent scope |
| CAstStateReturn* | node with a return statement |
Definition at line 753 of file parser.cpp.
|
private |
sets the token causing a parse error along with a message
| t | token causing the error |
| message | human-readable error message |
Definition at line 91 of file parser.cpp.
|
private |
takes a simpleexpr as "[ + | - ] term { termOp term }"
| s | parent scope |
| CAstExpression* | node with a simpleexpr |
Definition at line 991 of file parser.cpp.
|
private |
takes each statement
| s | parent scope |
| CAstStatement* | node if exists |
| NULL | otherwise |
Definition at line 582 of file parser.cpp.
|
private |
takes a sequence of statements to make a linked list of them
| s | parent scope |
| head | of linked list of statements if it is non-empty |
| NULL | otherwise |
Definition at line 540 of file parser.cpp.
|
private |
takes a string constant
| s | parent scope |
| CAstStringConstant* | node with its value and parent scope |
Definition at line 1151 of file parser.cpp.
|
private |
takes a subroutine call statement
| s | parent scope |
| CAstStatCall* | node with an CAstFunctionCall* node fc |
Definition at line 642 of file parser.cpp.
|
private |
takes a declaration part of subroutine and add it into global symbol table
| s | parent scope |
| CAstProcedure | node with its name, procedure symbol and its parent scope |
Definition at line 322 of file parser.cpp.
|
private |
takes a term as "factor { termOp factor }"
| s | parent scope |
| CAstExpression* | node with a term |
Definition at line 955 of file parser.cpp.
|
private |
takes an one type of the variable declaration and add them into the given symbol table
| symbols | a given symbol table |
| s_type | a symbol type depend on the location of variable declaration |
| <em>params | a pointer to vector<CSymParam> which contains formal parameters of the subroutine, NULL otherwise |
| CSymtab* | symbols which saves newly declared symbols |
| vector<CSymParam*>* | as a parameter |
Definition at line 241 of file parser.cpp.
|
private |
takes a set of variable declaration and add them into the given symbol table
| symbols | a given symbol table |
| s_type | a symbol type depend on the location of variable declaration |
| CSymtab* | symbols which saves newly declared symbols |
Definition at line 212 of file parser.cpp.
|
private |
takes a while loop statement
| s | parent scope |
| CAstStatWhile* | node with whilecondition, whilebody |
Definition at line 730 of file parser.cpp.
|
private |


Ask questions about the core tech here, but not questions about prices or personal questions or GUI and please don't DM JL777.
https://dexstats.info/richlistlookup.php?address=RLVzC4tr9cNKvuw2z4m8KuMfZURwCehx55
https://medium.com/@jameslee777
100 messages
Before 05-Dec-19 12:00 AM
jl777c26-Dec-18 04:10 PM
happy holidays everyone
10
@stefjazar after spending some time experimenting with beam (mimblewimble) found out it is an interactive protocol and not noninteractive. basically it is like barterdex where both sender and receiver need to be online at the same time, for every transaction. seems not very practical. maybe grin is noninteractive, not sure
1
FabØ26-Dec-18 05:12 PM
Hi @jl777c , Hope you doing great. We would like your insight as we are working on promoting real life use case for KSB (stable coin), we would like to find or encourage the use of KSB as a transactional medium (medium of exchange & unit of account) and wonder if you would be aware of projects related to the Komodo Platform, type decentralize market place, merchant or service providers that could use a stable coin feature. @SHossain said that you would probably be the best person to answer this question. Cheers
jl777c26-Dec-18 05:28 PM
maybe in conjunction with oracles CC so markets can be created for data, denominated in USD
FabØ26-Dec-18 05:59 PM
terrific, thank you. In your mind, who would be the best point of contact to work on this?
(I will also explore the dedicated channel to catch up)
jl777c26-Dec-18 06:02 PM
a generalized oracle data market, that is primarily a gui task
FabØ26-Dec-18 06:03 PM
I see. GUI are like lanthanides and actinides very hard to find
Do you know famous inventions whose authors have always remained completely anonymous and never reveled their identities ? Other than Bitcoin.PS: In any field, not only technology, and any time in history.
jl777c26-Dec-18 07:20 PM
ok
jspook1626-Dec-18 07:38 PM
I made a comment. I hope it gets a bit of exposure.
jl777c26-Dec-18 07:55 PM
the beam devs seem to be saying mimblewimble is an interactive protocol and as such it seems unlikely to gain mass acceptance
Bug description Sending to self works and the transaction is confirmed Sending to an address not in the local node seems to require that the receiving node is online. To Reproduce send transaction ...
so it seems this widely anticipated protocol has some significant downside that few other crypto coins have.
jspook1626-Dec-18 08:23 PM
so is the assumption that nodes are always up?
jl777c26-Dec-18 08:37 PM
i am working with them to hopefully improve things
but the MW protocol requires sender and receiver to both be involved. initial implementation uses a direct connection, but I hope the tx can be split into two halfs to gain noninteractiveness
no idea about grin implementation, just been fiddling with beam as it is in C++
you can cancel a tx that didnt complete, so it isnt any loss of funds issues, just works in a way very different than other crypto so some additional work is needed. for v1 release i think just a working implementation is a great achievement
ComputerGenie 👴👴👴27-Dec-18 02:13 PM
@jl777c is there something wildly different about build requirements of FSM branch than say 2 weeks ago?
getting
g++: internal compiler error: Killed (program cc1plus)
on Ubuntu 16.04.3 LTS
jl777c27-Dec-18 02:17 PM
shouldnt be
ComputerGenie 👴👴👴27-Dec-18 02:35 PM
seems the answer is in the relation of -j to RAM, it's a litlle higher than 2:1, so if $(nproc) = 24 then 8G isn't nearly enough
jl777c27-Dec-18 02:36 PM
that makes sense. each j thread would use the same amount of RAM
Master Den28-Dec-18 07:13 PM
Hello @jl777c
We integrated BIP65 into our codebase in order to comply with Komodo requirements. Would you be able to assist us if our code meeting the requirements ? ( i am one of the global coordinator of Electra )
it is much easier to keep all the eggs separate to begin with than to make an omelet and then to try to separate the different eggs after they are all mixed together
1
jl777c31-Dec-18 09:35 AM
I was able to convert 200,000 WAVES into 800000 KMD for SuperNET, which is now the #1 on the richlist for KMD
12
1
polycryptoblog31-Dec-18 09:42 AM
good move
Will be able to have our own waves in kmd ecosystem soon enough
Happy New Year James Lee (jl777)!!
Thank you for everything!

#HappyNewYear2019
@KomodoPlatform @Jl777News
#LivingLegends
5
dimxy01-Jan-19 09:23 AM
Dave12302-Jan-19 01:16 AM
Where can I find info about the superset asset holdings?
When will there be a payout to supernet holders again? Is there a way to see how much income Supernet has created since the last payout?
jl777c02-Jan-19 08:37 AM
the bear market reduced revenues by a lot, so far only about $250k in CRYPTO revenues
until bull market is back, i wouldnt expect another revshare
Thanks for your answer. I was an Ico investor in Supernet and I know the original vision change over the years. Is there plan for Supernet going forward?
In the sense of acquiring additional revenues by investing in project like you did in the past or how is Supernet benefiting from the developments in Komodo?
jl777c02-Jan-19 11:47 AM
i do try to increase the long term NAV with strategic trading, but as largest KMD holder, what is good for KMD is good for SuperNET. Over next year or so, I hope that 100% of the initial capital raised would have been revshared out. that would make any remaining value pure profits. The problem is that there isnt really anybody else that helps me with SuperNET side of things and only so much I can do
wow, Komodo has really Big Rewards for this Jobs, i'm not a Creators so i don't meet requirements for this Jobs... but will be happy to spread about this on my social media account...
jl777c02-Jan-19 12:16 PM
that bounty is not from me, so i dont know any more details
SHossain02-Jan-19 12:18 PM
@owerache please contact @ca333 for that bounty details.
owerache02-Jan-19 12:22 PM
Thank you I found more information about reddit it's not quite what I thought it was... but it remains an interesting topic... I was already investigating the generation of the 2FA sequence..
Dave12302-Jan-19 12:26 PM
The asset holdings where there as a reserve for development cost and for investing and acquiring new rev streams. Supernet had a big vision in the beginning but it seems there is noone actively working on it anymore or even a future plan. So what is the point in keeping the Supernet asset holdings and not distribute it to the Supernet holders?
I as an investor am trapped in an iliquid asset.
owerache02-Jan-19 12:30 PM
I was planning to develop a hardware + screen that would show me my 2FA keys in relation to different private keys
jl777c02-Jan-19 12:35 PM
@Dave123 if in 2019 we cant get more forward movement with SuperNET, it will be something to be considered.
jl777c02-Jan-19 12:44 PM
the downside is by doing this, it would prevent any future developments for the various other assetchains and it is a step that cant be undone
crumb02-Jan-19 01:18 PM
please correct me if i'm wrong here jl777, but my understanding of supernet asset is that all the different elements of the ecosystem like CRYPTO, DEX, JUMBLR, PANGEA etc will start to produce revenues with ever increasing volumes.
is is just way too early to expect to see this. yes, the lack of liquidity can be/ is an issue for some people, but the intrinsic value of SUPERNET does not increase with more back-and-forth trading of the SUPERNET asset, but with the adoption of the underlying projects that SUPERNET own.
this reminds me of a saying of Warren Buffett: "I try to invest in such companies that even when the markets will be turned off for 10 years, i will still be confident that my investments are doing just fine" more liquidity is always good, but there is just too much emphasis on short term speculation.
SUPERNET is not an instrument for short term speculation, but a long term view on whole blockchain ecosystem. i suggest NOT to dismantle it. people just have to understand what they invest in.
jl777c02-Jan-19 01:20 PM
thanks. i guess if there are more people that feel this way and can help with developing the other assetchains, then it wont all be up to me
SHossain02-Jan-19 01:21 PM
i would also agree that SUPERNET is not for short-term. hodl is the way since the SuperNET ico
Dave12302-Jan-19 01:26 PM
You could distribute 90% of the asset holdings and keep 10% for future opportunities in KMD. I bet noone would be opposed to this.
No offense but the asset holdings of Supernet also lack accountability.
You are the one with the private kees and noone is able to verify if these coins are really in your possession or not and if something happens to you these holding are gone.
@crumb I am by no means a short term investor but I see little progress being made on Supernets original vision. There seem to be also very little further development cost so why not distribute these funds? I am not suggesting to dismantle Supernet at all.
jl777c02-Jan-19 01:33 PM
realistically without 90% of the funds, there is no way any meaningful development can be done with any of the assetchains
even with 100% of the funds in bear market conditions there isnt enough
so if there will be a distribution it will be to shutdown the SuperNET
this process will take quite of bit of my time to do, so the path of least resistance is for things to proceed as they are. for people that want to cashout, maybe we can start an OTC trading?
or agree to price here and close trade on the exchanges it trades on
Dave12302-Jan-19 01:44 PM
Hi so what develpment of assetchains are you referring to? I was curious about future plans for revenue streams but it seems all pretty vague.(edited)
jl777c02-Jan-19 01:44 PM
first step is to get a project manager for each
Dave12302-Jan-19 01:46 PM
each?(edited)
jl777c02-Jan-19 01:47 PM
or just one
crumb02-Jan-19 01:47 PM
most active assetchain now is probably DEX with marketmaker2.0 in development @Dave123
Dave12302-Jan-19 01:48 PM
you are talking about CRYPTO, DEX, JUMBLR, PANGEA or what are you referring to?
jl777c02-Jan-19 01:48 PM
PANGEA and BET are also in progress via CHIPS
crumb02-Jan-19 01:48 PM
yes, them too
jl777c02-Jan-19 01:48 PM
CRYPTO is basically complete as it is notarization fees
JUMBLR has been done, but few people use it so it is not such a direct revenue source
Dave12302-Jan-19 01:50 PM
Ok maybe I just lost track along the way and things are still evolving.
jl777c02-Jan-19 01:50 PM
so really most of the tech aspects are complete or near complete
I just dont have the bandwidth do to more than help on the tech side
and the strategic investing
Dave12302-Jan-19 01:50 PM
Why is it that there is still very little volume on baterdex?
crumb02-Jan-19 01:51 PM
Dave, all the info is out there, but not neatly packaged. one has to make an effort to keep on top of things
makertmaker1.0 has some shortcomings
jl777c02-Jan-19 01:51 PM
its not mm1 but the GUI for mm1 that have the shortcomings
crumb02-Jan-19 01:51 PM
this is why MM2.0 is being done
jl777c02-Jan-19 01:52 PM
mm2 will allow simple GUI to be more effective
crumb02-Jan-19 01:52 PM
it's the combo between gui and mm
jl777c02-Jan-19 01:52 PM
but still people like to use CEX more than DEX
crumb02-Jan-19 01:52 PM
classic chicken-and-egg stuff
not enough volume -> so people don't come
people don't come because not enough volume
jl777c02-Jan-19 01:54 PM
if people want faster progress, some will need to step up. otherwise it is to wait as i make slow progress
crumb02-Jan-19 01:55 PM
HyperDEX is a very good example of stepping up
jl777c02-Jan-19 01:55 PM
or we can just shut it down to appease the need for liquidity
crumb02-Jan-19 01:56 PM
why on earth should things be shut down, because some people feel impatient?
Dave12302-Jan-19 01:56 PM
@jl777c Ok maybe you can make an short update for Supernet holders on how things are progressing if you find some time. Its really hard to not loose track after all that time.
jl777c02-Jan-19 01:56 PM
I have been answering questions as they come up
NAV has dropped to around 25 KMD
Dave12302-Jan-19 01:58 PM
An update reaches more people and you have to answer less questions
jl777c02-Jan-19 01:58 PM
where do i update?
Gordon Komodo02-Jan-19 01:58 PM
maybe make a feed-supernet channel(edited)
crumb02-Jan-19 01:59 PM
we are in high-risk early stages of crypto development cycle. everyone has to be responsible for their own actions and investment decisions. the constant need for hand-holding is beyond me.
don't mean to offend anyone btw.
Dave12302-Jan-19 01:59 PM
There is just a lot of people like me that cannot read the conversation in discord all the time
crumb02-Jan-19 02:00 PM
if you have invested it's your responsibility to keep up
jl777c02-Jan-19 02:00 PM
so every dPoW development goes to the supernet channel?
every CHIPS development?
etc?
crumb02-Jan-19 02:00 PM
i'd rather see jl777 coding than doing marketing updates


{% extends "vdh/base.html" %} {% block content%}
Use your KVB reg number prefixed with "kvb" as your username. For example "kvb0848237"


Amber Gill is too busy to date and is ‘glad’ Greg O’Shea ended things with her
"I was hoping the relationship would go somewhere."
by Sarah MaglioccoAmber Gill has revealed that she is far too busy to date right now.
The Love Island winner is currently taking on every opportunity that her TV exposure has given her – between million pound deals with clothing companies and talks to do other shows.
“I haven’t got time for it. And I don’t want to take the shine off what I’m doing because it really is an amazing opportunity,” she said.
In a chat with Weekend mag, Amber also explained that despite her lack of dates, she is still being connected romantically to Ovie Soko.
However, she confirmed that there is nothing more than a sibling-like friendship between them.
Ovie was there for Amber when she was allegedly dumped by Irish rugby pro and fellow Love Island winner Greg O’Shea.
However, Amber now feels that she is “glad” Greg ended things before she got even more invested in their relationship.
“It was really hard. We tried, but we were both just so busy doing really interesting things we didn’t get an opportunity to build anything properly,” she told the mag.
“I was hoping the relationship would go somewhere.”
“I think it was just about us being in different countries. If it had all happened in private, it wouldn’t have been so upsetting. But if he wanted to end things, I’m glad he did it sooner rather than later.”


#include <GrCoplanarPolygonGroup.h>
Public Member Functions | |
| GrCoplanarPolygonGroup (const MPlane &plane) | |
| Purpose: To represent a group of coplanar polygons. | |
| ~GrCoplanarPolygonGroup () | |
| const MPlane & | GetPlane () const |
| returns the plane that all of the geometry lies on. | |
| void | AddPolygonIdx (unsigned int index) |
| adds the polygon to the group. The polygon must be coplanar. | |
| unsigned int | GetPolygonCount () const |
| polygon management. | |
| unsigned int | GetPolygonIdx (unsigned int idx) const |
File: GrCoplanarPolygonGroup.h Author: Kevin Bray Created: 09-13-06 Copyright © 2004 Bootstrap Studios. All rights reserved. project includes. class GrCoplanarPolygonGroup
Definition at line 20 of file GrCoplanarPolygonGroup.h.
| GrCoplanarPolygonGroup::GrCoplanarPolygonGroup | ( | const MPlane & | plane | ) |
Purpose: To represent a group of coplanar polygons.
File: GrCoplanarPolygonGroup.h Author: Kevin Bray Created: 09-13-06 Copyright © 2004 Bootstrap Studios. All rights reserved. class header. class GrCoplanarPolygonGroup ctor & dtor
Definition at line 24 of file GrCoplanarPolygonGroup.cpp.
| GrCoplanarPolygonGroup::~GrCoplanarPolygonGroup | ( | ) |
Definition at line 31 of file GrCoplanarPolygonGroup.cpp.
| void GrCoplanarPolygonGroup::AddPolygonIdx | ( | unsigned int | index | ) |
adds the polygon to the group. The polygon must be coplanar.
public methods.
add to the total surface area and then add the polygon.
Definition at line 43 of file GrCoplanarPolygonGroup.cpp.
| const MPlane& GrCoplanarPolygonGroup::GetPlane | ( | ) | const [inline] |
returns the plane that all of the geometry lies on.
Definition at line 27 of file GrCoplanarPolygonGroup.h.
| unsigned int GrCoplanarPolygonGroup::GetPolygonCount | ( | ) | const [inline] |
| unsigned int GrCoplanarPolygonGroup::GetPolygonIdx | ( | unsigned int | idx | ) | const |
Definition at line 51 of file GrCoplanarPolygonGroup.cpp.


I have traveled the length and breadth of this country and talked with the best people, and I can assure you that data processing is a fad that won't last out the year. -- Editor in charge of business books for Prentice Hall, 1957[source]


--- layout: post-index --- Our Games {% for post in site.categories.projects %} {% include project-article-indexing.html post=post %} {% endfor %}
Our Games


---
layout: post
title: Aperture 3 - Importing Existing Folder Organization
tags:
- Aperture 3
- Apple Aperture
- Articles
- Import
- work-flow
- Workflow
status: publish
type: post
published: true
meta:
aktt_notify_twitter: "yes"
_edit_last: "2"
_edit_lock: "1314035315"
_thumbnail_id: "3349"
ghostpool_post_template: Default
ghostpool_link: Full Size Image/Video
aktt_tweeted: "1"
_wp_old_slug: ""
ghostpool_post_image: http://photo.rwboyer.com/wp-content/uploads/2011/08/proj-album2-ico.jpg
ghostpool_post_faded_image: http://photo.rwboyer.com/wp-content/uploads/2011/08/proj-album2-ico.jpg
ghostpool_circle_image: http://photo.rwboyer.com/wp-content/uploads/2011/08/proj-album2-ico.jpg
dsq_thread_id: "393156084"
---
I didn't know whether to call this Apertre 3 and film part 0.5 or something else. I choose something else because it's applicable no matter if you shoot film or not. Just a tidbit on importing master image files into Aperture 3 using under-utilized import functionality not available in the normal import window that you see when pressing that down arrow icon or popping up automatically when you connect a memory card.
If you look under Aperture 3's file menu you will see a sub-menu under import called "Folders as projects...". There is a lot of functionality rolled up into the dialog invoked with this menu option.
[image title="dialog2" size="full" id="3347" align="none" linkto="viewer" ]
The first option drop down in the above dialog "Import folders as: Projects and albums" will produce a project named the same thing as the folder that is actually selected and then albums within that project for each sub-folder like this..
[image title="proj-album1" size="full" id="3348" align="none" linkto="viewer" ]
One thing that is not completely obvious here is that the folder that turns into an Aperture poject is whatever folder happens to be selected or highlighted in this dialog. It does not have to be only one folder. You can select multiple folders using the usual tools of shift-clicking for ranges or command-clicking for multiple, discontiguous folders. Each and every folder that is selected/highlighted in the finder part of the import dialog will become projects. Any subfolders within those selected folders will become albums. The bottom line is that the behavior is depended on what is actually selected in the finder part of the dialog.
Here is what happens when multiple folders are selected in the dialog to give you a clear picture of what happens to the various subfolders within each top level folder. Remember that the projects are the folders actually highlighted/selected in the dialog. The rest of the stuff under those projects are sub-folders.
[image title="proj-album2" size="full" id="3350" align="none" linkto="viewer" ]
Now to the film part. I described my fairly draconian but conventional way of physically storing and indexing my film once it is processed. I typically create a folder that corresponds to a roll number for my scans to be loaded into. Just to keep image scans on the same roll in some sort of logical connectedness. I usually will shoot a couple of rolls for a project so I have a project folder that is appropriately named along with sub-folders that are named the same thing as my roll numbers in my physical film files. This method of importing is farily convenient to create a project with albums for each roll of images. Not required but just something I like to have.
I hope you can see how this may also help people that maintain their own file system organization and want to reflect that in various ways inside Aperture 3 as well as those that just want to translate an old folder/file organization into Aperture 3 when migrating to Aperture.
Next time we'll cover some of the other options of this very usefule Aperture 3 import dialog. All of this kind of stuff that relates to physical file location, importing, etc. can be found in my Aperture 3 File Management eBook if you want the full story in one giant connected dose or just as a comprehensive reference.
RB


--- layout: post title: Becoming a good debugger date: 2011-07-07 20:05:47.000000000 +02:00 type: post published: true status: publish categories: - Coding tags: - cs - debug - mit - story - tricks - web development meta: _edit_last: '1' _thumbnail_id: '987' dsq_thread_id: '352395882' socialize_text: If you enjoyed this post, please consider leaving a comment below or subscribing to the RSS feed to have future articles delivered to your feed reader. socialize: '1,24' author: login: bbWebdesign email<EMAIL_ADDRESS>display_name: Bob first_name: Bob last_name: Belderbos ---
Coincidence is a fascinating concept: I just finished lecture 11 "testing and debugging" of MIT's interesting CS course yesterday and had an amazing example in practice today.The coincidence was a bug that was identified in an app I wrote. It did not make any sense at first: some data was written that had nothing to do with the expected data. I could not guess where it had come from. I started to look at the function responsible for writing that piece of output. As the mentioned course states: "reading" your code is very important, but you can easily get into the habit of just take things for granted.
Trying to understand the function I quickly saw the specific output got written to a temporary file first. You see, as code grows and apps age, you often forget the inner working of each and every function.
The thing to remember when debugging is that you need to be SYSTEMATIC. In the course a great example is shown of the binary search approach (the "Silly" program): start in the middle to rule out half of the code. Of the half left, start again in the middle, etc.
I started to look for a pattern to see when this bug might had slipped in. Having complete statistics (thankful now), and starting somewhere in the middle of last weeks uses, I was quickly able to pinpoint the exact time and date when the issue started.
Then I asked: "what changed around that date?". I started to think and talk to people involved: there was a permission change of the temporary file that got written to! A quick test script confirmed I could not overwrite the temp file anymore! Bingo!
... be patient, analyzing a bug can take hours, sometimes even days if you (wisely) walk out from time to time. However I found the process much satisfying, intriguing even. I mean applying a systematic approach to narrow down an issue step by step, I think it is in the programmer's nature to just love that :)
Did you like this post? Tell your friends via the social media buttons on this site...
You can also join my Facebook group or get a weekly Mailchimp newsletter to keep up with my new blog posts. You can subscribe in the sidebar of this site ...
Ah.. and I am also at twitter: @bbelderbos


Software Developer —Bank of Montreal (Toronto, ON) 2017 – 2018
Directly working with EWP(Enterprise Wire Payment) as DevOps team to help them build continuous integration development environment. Using Ansible and Ansible Tower as the auto-deployment tool.
Developed new testing method with Selenium Python page object to replace current unreliable QTP script.
Coordination quarterly Vulnerability patching to keep highly sensitive business services reliable and secure.
Worked as part of development organization on data protection software. The software is supported across
multiple operating systems and enables protection to a variety of protection targets.
Created a feature to measure deduplication on a Data Domain using a RESTful API. By using curl.
Improved existing product by resolving defects.
Software Engineer — Reflektion (San Mateo, CA) Nov 2013 – Mar 2014
Designed and developed e-commerce web widgets featuring shopping cart facilities using
Pyramid,CSS(Sass),JavaScript; widget was presented directly to customers by sales representatives
Developed a dynamic pop-up generator with fully customizable styling using Pyramid, JavaScript, CSS(Sass)
and MongoDB with another engineer; it was a user-facing product
Developed an internal metadata tool with UI in Pyramid and backend in MongoDB that tracked setting changes
of web-page widgets for analysis and debugging in cases of website display failures.