 From a technical perspective, blog entries in Pebble are just short pieces of HTML that represent the content that you wish to display. This can be anything from a simple piece of text to an elaborate collection of text, images, tables, etc. In addition to this, Pebble stores other pieces of information alongside your blog entries such as a title, the date/time of publication and author.
Adding a Blog Entry
To add a new blog entry, choose New Blog Entry... from the File menu. In this popup window, just fill in the title and main body of the entry. When you've finished writing the entry, clicking the Preview tab will show you what your new entry will look like. If necessary, you can make further changes and preview them.
When you're happy with the entry, click the OK button.
The body of a blog entry is just a XHTML/HTML fragment, meaning that you can use any XHTML/HTML tags you like for markup and formatting. Common examples include using bold and italics. Also, you can include other elements such as hyperlinks and images.
For convenience when posting code and HTML fragments you can enclose these within <escape> and </escape> tags. In doing so, any < or > characters will be automatically escaped to < and > respectively.
Editing a Blog Entry
Blog entries can be edited at any time after they have been posted. To edit an entry, double-click the appropriate blog entry in the main table. This opens the same window used to add a new entry, and you can again edit, preview and click OK when finished.
Removing a Blog Entry
Existing blog entries can also be removed at any time. To remove an entry, choose Delete from the File menu after highlighting the entry that you would like to delete. This will open a popup window asking you to confirm your action.
|


All locations are open from Sunday to Thursday from 6am - 7pm.
Salmon cookies made with fish, salmon cookies are delish!
Pike Place Market
Pike Place Market
85 Pike St
Seattle, WA 98101
206-555-5555
Sea-Tac Airport
17801 International Blvd
Seattle, WA 98158
206-555-5555
Southcenter Mall
2800 Southcenter Mall
Seattle, WA 98188
206-555-0214
Bellevue Square
575 Bellevue Way NE
Bellevue, WA 98004
425-555-5415
Alki
2620 Alki Ave SW
Seattle, WA 98116
206-041-4554


Komodo
feed-github
Auto feed for all activities in GitHub. New notification as they happen in real-time.
100 messages
Before 05-Dec-19 12:00 AM
GitHub
BOT
21-Nov-19 09:40 AM
jl777
[jl777/komodo] Pull request opened: #1758 Dev
FSM
jl777
[jl777/komodo] Pull request closed: #1758 Dev
jl777
[komodo:beta] 19 new commits
`dddbf82`
komodod github actions CI initial version - tonymorony
`29d2a81`
more flexible CC tests suite - tonymorony
`a6b66f5`
Merge pull request #1750 from tonymorony/cc_tes... - jl777
`9ca0cbb`
chain spinning cc tests fw functionality - tonymorony
`159fb83`
added fw bootstraps support - tonymorony
[komodo] macOS-latest CI failure on dev
[komodo] ubuntu-18.04 CI cancelled on dev
[komodo] macOS-latest CI failure on dev
[komodo] ubuntu-18.04 CI cancelled on dev
GitHub
BOT
21-Nov-19 09:56 AM
[komodo] Win Build success on fix-heirfund
[komodo] GitHub Actions checks failure on fix-heirfund
GitHub
BOT
21-Nov-19 10:31 AM
[komodo] Win Build success on dev
[komodo] GitHub Actions checks failure on dev
[komodo] Win Build success on dev
[komodo] GitHub Actions checks failure on dev
[komodo] macOS-latest CI failure on dev
[komodo] ubuntu-18.04 CI cancelled on dev
GitHub
BOT
21-Nov-19 11:31 AM
[komodo] Win Build success on dev
[komodo] GitHub Actions checks failure on dev
GitHub
BOT
21-Nov-19 02:56 PM
tonymorony
[jl777/komodo] Pull request opened: #1759 Patches for CC tests
minor fixes in fw and tests code, some todos added also :) tests passing now:
https://github.com/tonymorony/komodo/runs/313748121
[komodo] macOS-latest CI success on cc_tests_2.0
jl777
[jl777/komodo] Pull request closed: #1759 Patches for CC tests
jl777
[komodo:FSM] 18 new commits
`003e546`
temporary disable osx CI - tonymorony
`08fd13a`
added tests deps - tonymorony
`6c81a68`
add dep - tonymorony
`b9f1ad4`
try fix - tonymorony
`650824e`
added missing dep - tonymorony
jl777
[jl777/komodo] Pull request opened: #1760 FSM
Patches for CC tests
jl777
[jl777/komodo] Pull request closed: #1760 FSM
jl777
[komodo:dev] 19 new commits
`003e546`
temporary disable osx CI - tonymorony
`08fd13a`
added tests deps - tonymorony
`6c81a68`
add dep - tonymorony
`b9f1ad4`
try fix - tonymorony
`650824e`
added missing dep - tonymorony
[komodo] macOS-latest CI success on FSM
jl777
[jl777/komodo] Pull request opened: #1761 Dev
FSM
jl777
[jl777/komodo] Pull request closed: #1761 Dev
jl777
[komodo:beta] 20 new commits
`003e546`
temporary disable osx CI - tonymorony
`08fd13a`
added tests deps - tonymorony
`6c81a68`
add dep - tonymorony
`b9f1ad4`
try fix - tonymorony
`650824e`
added missing dep - tonymorony
[komodo] macOS-latest CI failure on dev
[komodo] ubuntu-18.04 CI cancelled on dev
GitHub
BOT
21-Nov-19 03:50 PM
[komodo] Win Build success on cc_tests_2.0
[komodo] Win Build success on FSM
[komodo] Win Build success on FSM
[komodo] Win Build success on dev
[komodo] GitHub Actions checks failure on dev
[komodo] Win Build success on dev
GitHub
BOT
21-Nov-19 04:39 PM
[komodo] ubuntu-18.04 CI failure on FSM
[komodo] GitHub Actions checks failure on FSM
GitHub
BOT
21-Nov-19 04:44 PM
gcharang
[developer-docs:gcharang] 1 new commit
`2f0ed32`
removes 'txfee' param from some heir RPC - gcharang
GitHub
BOT
21-Nov-19 04:45 PM
[komodo] ubuntu-18.04 CI failure on dev
[komodo] GitHub Actions checks failure on dev
GitHub
BOT
21-Nov-19 04:55 PM
[komodo] ubuntu-18.04 CI success on cc_tests_2.0
[komodo] GitHub Actions checks success on cc_tests_2.0
GitHub
BOT
21-Nov-19 08:58 PM
[komodo] ubuntu-18.04 CI cancelled on FSM
[komodo] GitHub Actions checks failure on FSM
GitHub
BOT
22-Nov-19 01:03 AM
ca333
[KomodoPlatform/komodo] Pull request opened: #221 sync dev
ca333
[KomodoPlatform/komodo] Pull request closed: #221 sync dev
ca333
[komodo:dev] 1 new commit
`2dfaa69`
sync dev (#221) - ca333
ca333
[KomodoPlatform/komodo] tag deleted: dev-linux-201911201844-5c82fb1
ca333
[KomodoPlatform/komodo] tag deleted: dev-linux-201911140324-8378b23
ca333
[KomodoPlatform/komodo] tag deleted: dev-linux-201911101301-b9f3c7e
ca333
[KomodoPlatform/komodo] tag deleted: master-linux-201911091403-374be87
ca333
[KomodoPlatform/komodo] tag deleted: dev-linux-201911091407-309d26c
GitHub
BOT
22-Nov-19 01:36 AM
ca333
[KomodoPlatform/komodo] New release published: dev-linux-201911220136-2dfaa69
ca333
[KomodoPlatform/komodo] New tag created: dev-linux-201911220136-2dfaa69
GitHub
BOT
22-Nov-19 06:00 AM
cipig
[jl777/coins] Pull request opened: #393 SAI to DAI
DAI is moving to a new contract, old DAIs are now SAIs:
https://blog.makerdao.com/single-collateral-dai-to-multi-collateral-dai-upgrade-timeline-and-actions/
jl777
[jl777/coins] Pull request closed: #393 SAI to DAI
jl777
[coins:master] 2 new commits
`6a2b59b`
SAI to DAI - cipig
`f057b48`
Merge pull request #393 from cipig/master - jl777
GitHub
BOT
22-Nov-19 09:18 AM
gcharang
[Documentation:dev] 2 new commits
`166699b`
adds gtm integration - gcharang
`1617919`
minor edit - gcharang
GitHub
BOT
22-Nov-19 09:20 AM
gcharang
[developer-docs:gcharang-patch-1] 1 new commit
`6363933`
update GA -> GTM - gcharang
gcharang
[KomodoPlatform/developer-docs] New branch created: gcharang-patch-1
gcharang
[KomodoPlatform/developer-docs] Pull request opened: #137 updates GA -> GTM
GitHub
BOT
22-Nov-19 09:53 AM
gcharang
[KomodoPlatform/Documentation] Pull request opened: #31 Dev
gcharang
[KomodoPlatform/Documentation] Pull request closed: #31 Dev
gcharang
[Documentation:master] 3 new commits
`166699b`
adds gtm integration - gcharang
`1617919`
minor edit - gcharang
`32f76ef`
Dev (#31) - gcharang
gcharang
[KomodoPlatform/Documentation] branch deleted: dev
gcharang
[KomodoPlatform/Documentation] New branch created: dev
[Documentation] Travis CI checks action required on dev
[Documentation] Build Errored on dev
The build
errored
. This is a change from the previous build, which
passed
.
[Documentation] Travis CI checks failure on master
[Documentation] Build Failed on master
The build
failed
. This is a change from the previous build, which
passed
.
gcharang
[Documentation:dev] 1 new commit
`5b749e4`
updates packages.json - gcharang
gcharang
[KomodoPlatform/Documentation] Pull request opened: #32 updates packages.json
gcharang
[KomodoPlatform/Documentation] Pull request closed: #32 updates packages.json
gcharang
[Documentation:master] 2 new commits
`5b749e4`
updates packages.json - gcharang
`99b4293`
updates packages.json (#32) - gcharang
gcharang
[KomodoPlatform/Documentation] branch deleted: dev
gcharang
[KomodoPlatform/Documentation] New branch created: dev
[Documentation] Build Errored on dev
The build
errored
. This is a change from the previous build, which
failed
.
[Documentation] Travis CI checks action required on dev
gcharang
[Documentation] Branch gh-pages was force-pushed to
baabc52
Compare changes
[Documentation] Travis CI checks success on master
[Documentation] Build Passed on master
The build
passed
. This is a change from the previous build, which
failed
.


Stephen Prockow
Senior Front-End Developer
<EMAIL_ADDRESS>(404) 492-7597
Github: sprockow
Experience
Avalara | Senior Front-End Developer
July 2013 – Present
Avalara helps thousands of companies manage sales tax compliance. I am part of a small UX team building the next generation portal for Avalara's suite of products.
- Top Github contributor over most of the 2 year project history. Helped drive our team's development pace to meet aggressive milestones and successfully deliver our product.
- Developed some of our app's key UI features: Bulk data import tools that allowed customers to direct upload data from spreadsheets, and integration with ElasticSearch to provide typeahead search.
- Took initiative to architect our front end integration testing, which allowed our team to switch to a behavior test driven methodology, adopt a CI to verify pull requests, and greatly reduce regression bugs.
- Maintained an automated full-stack smoke test suite using Selenium, helping QA team verify that live environments were free of configuration or integration issues.
- Was driving proponent to use SASS as CSS tooling; refactored our stylesheets towards a reusable cross-application theme, ultimately used by several live customer-facing apps.
- Helped write scripting to deploy Express.js on AWS infrastructure, using EC2, ElastiCache. Designed solution to help reduce deploy times from 15+ minutes to < 2 minutes using S3 and Cloudfront.
- Recommended and integrated JavaScript logging tool, which was successfully used to identify and resolve live customer-affecting bugs.
Makapen Inc | Co-founder
Jan 2014 – Present
Makapen is a web agency that helps entrepreneurs with prototypes and MVPs.
- Architected 15+ MVPs and prototypes for e-commerce, productivity, and social startups.
- Actively direct the company's technology toolset and strategy to deliver solutions to clients significantly faster and cheaper than traditional agencies by leveraging SaaS products, including Firebase, Auth0, AWS, Google Cloud, Heroku, Braintree, Mandrill.
- Mentored junior developers on a weekly basis to master Ember.js and AWS technologies. This helped scale our business to double revenue in our second year.
Conductiv | Lead Web Developer (contract position)
Oct 2012 – May 2013
Conductiv is a startup providing mobile POS solutions for small businesses and salespeople.
- Led an offshore team to deliver POS prototype that helped win a six-figure sale from Vans shoes.
- Architected the AngularJS hybrid web app that allowed our web developers to author web templates for a digital product catalog, and publish the app on the iOS and Android app stores.
- Leveraged IndexedDB and the FileSystem API to support offline needs of traveling sales force.
- Developed Node.js build tooling to maintain rapid pace to meet our beta ship date.
The Foundry Agency | Web Developer (contract position)
Aug 2011 – Sep 2012
Part of a 3-person team that enabled this small web agency to deliver on a large technology contract with Chick-fil-a.
- Used Backbone.js to deliver single page calendaring tool for restaurant franchise operators.
- Consulted Chick-fil-a IT department towards their pilot adoption of AWS (EC2, RDS, ElastiCache).
Responsible for maintaining web content and developing new web solutions for the Foundry Agency’s clients.
- Transformed Photoshop design concepts into web content.
- Maintained a custom tailored CMS solution to manage fleet of brands' sites.
ThreeWill | Web Developer (contract position)
May 2011 – Aug 2011
Developed web application within the Jive social business platform to provide integration with SharePoint.
- Application built purely from JavaScript and deployed as an in-page widget, but consumed SharePoint list data via WCF web services, directly via ajax.
- Leveraged JQuery, JQuery UI and other 3rd party UI libraries to rapidly develop complex CRUD table interface with inline edit.
Ciena | Java Developer
Oct 2009 – Aug 2010
Designed and implemented new UI for Telecom monitoring application.
- Designed architecture for, and implemented, new feature for user customizable menu shortcuts.
- Primary developer for new drag and drop functionality for personalization.
Maintenance of 15 year old software product.
- Fixed software bugs within bug tracking and resolution pipeline. Collaborated with offshore QA team.
- Championed and actively pursued refactoring of code base.
Aflac | Intern
May – Aug 2008 & May – Aug 2009
Developed features for the SharePoint platform used by Aflac's corporate offices.
- Involved in project of designing and developing an issue tracking web app for IT Security using SharePoint platform.
- Actively participated in the project's requirements analysis; main author to the SharePoint pilot's requirements document.
Education
Georgia Institute of Technology - Atlanta, GA
Aug 2004 – May 2009
Aug 2010 – May 2012
Awarded Bachelors in Computer Science in 2009 with honors
Master Degree Coursework in Information Visualization
- Specialization in Software Engineering Patterns & Practices
- PURA research award for work in using of dynamic tainting as a tool for detecting security vulnerabilities.
Technologies
- Frameworks & platforms
- 3+ years Ember, Node, Express, Angular, Backbone, SASS, Foundation, Bootstrap, JQuery, .NET mvc/web-api
- Cloud
- 5 years AWS, Google Cloud Platform, Heroku, Auth0, Firebase
- Tooling
- Git, Grunt, Broccoli, Mocha, Qunit, Selenium, Nightwatch
Interests
Seattle React.js Meetup Co-Organizer — http://www.meetup.com/seattle-react-js/
Coach and Organizer for Startup Weekend
- Interests
- Seattle React.js Meetup Co-Organizer, Coach and Organizer for Startup Weekend


Event Location:
Patrick Hays Learning Center
2700 Gateway Oaks Drive, Suite 2600
Sacramento, California
Abstract:
Want to quickly roll out ultra-flexible reports that will wow your end users? Want to learn how to display the data in multiple layouts on the same report? Want to consolidate similar reports while still providing flexibility to your end users? This can all be achieved by leveraging the three controls based on the Tablix template: Table, Matrix, and the List control. In this demo-heavy session, you'll learn how to create a columnar report that grows vertically as well as horizontally. You'll see the magic of having multiple layouts for the same data on the same report. You'll see how to do more useful things with fewer reports, and you’ll come away with a bag full of new tricks to make your reports flexible and scalable works of art.
Speaker(s): Mickey Stuewe,
Abstract:
In this session Prakash will walk through the process he has implemented to alleviate many of the pain points for deploying, managing, and supporting multiple SQL Server deployments from development to production. There are several variables to consider when supporting SQL Servers in the real world, including Cloud/VMware/Physical systems, Different SQL server versions, OS/Memory/Disk related configurations. You will learn…- A process which help configure SQL servers with optimal performance considerations- Consistent SQL support Env's help improve DBA productivity and reduce production issues- Configuration changes to be requested from windows admin/ network admin/ storage admin to be planned in advance- Flexibility to easily add new SQL configurations to support new applications
Speaker(s): Prakash Heda,
Abstract:
Whether you are trying to setup a new data warehouse, keep it updated, audit changes to your databases or quickly load changes to another database Change Data Capture (CDC) is a solution for all of these and can now be setup and supported easily with SQL Server SSIS 2012! Change Data Capture (CDC) has been around since SQL Server 2008, but has been underused because it was difficult to fully implement. SSIS 2012 now provides support for CDC with new components that make consuming the captured data very easy to apply. This session will define what CDC is and with live demos show how it is setup on your databases. Once it has been setup then you need to consume and apply those changes, this will be demonstrated with live demos using SSIS 2012 to create packages that apply the changes.
Speaker(s): Steve Wake,
Abstract:
Have you ever wondered what really happens behind the scenes when you execute a query? In this unique demonstration, Todd will use a video game engine (Unreal Engine 4) and will dramatically show The Life Cycle of a Query in 3D. We will follow a query from beginning to end and "runthrough" the various SQL Server components all queries must use including the Protocol Layer, Relational Engine, Storage Engine, Buffer Pool and then back out to the client. A volunteer at the end will then don an Oculus Rift Virtual Reality Headset for 3D Gaming and then race through the sections in under a minute to win a prize. Participants will leave with a better understanding of the major components and with a conceptual framework to explore the components more in-depth.
Speaker(s): Todd Kleinhans,
Abstract:
Come learn about the new innovations and capabilities in Power BI for Office 365. Using Excel, SQL Server, and the power of the cloud, you will see what the BI landscape in Office 365 looks like and what you can potentially leverage today using the most popular BI tool on the planet. Come learn how to refresh your data with on-premise data sources, create visually compelling experiences on mobile devices, do time-series forecasting, and provide data governance through the Data Catalog and Natural QA. We will discuss what you will need in your Office 365 environment to get going, and some best practices when trying to set this up for your department or enterprise.
Speaker(s): Angel Abundez,
Abstract:
Part 1: Have you inherited an Oracle-based application, and are you not sure what you need to know to keep it running? Here are the basics, explained in terms familiar to Microsoft SQL administrators, including: - making sure you have, and keep, SYSDBA access - locating the ALERT log and checking for non-default PARAMETER - enabling ARCHIVELOG mode, scheduling RMAN backup, and testing restore - management of TABLESPACE and DATAFILE - using DBMS_MONITOR and TKPROF to trace SQL queries - using STATSPACK for performance troubleshooting Part 2: Have you gotten the go-ahead to convert an Oracle database to SQL Server, and are you not sure how? Here is a proven and repeatable (and free) process, which achieves consistent results without requiring the source Oracle database to be read-only during the conversion. Microsoft's SSMA (SQL Server Migration Assistant) is just the beginning!
Speaker(s): Tom Keller,
Abstract:
Have you ever wondered what four guys from Sacramento have to say about SQL Server? Come find out when Mitch Bottel, Dan Hess, Dilip Nayak and Joe Simmons talk about our favorite DBMS, sharing experiences and tips/tricks and well as telling you how to do your job quickly and more efficiently. We'll discuss SQL Server Management Studio (SSMS) in depth, talk about FREE SQL Server tools that every DBA should know about and finish off with a hands on presentation on using certificates to sign stored procedures. Presenters are board members for the Sacramento SQL Server user group: Mitch Bottel - president; Dan Hess - vice president/treasurer; Dilip Nayak - event coordinator; Joe Simmons - public relations;
Speaker(s): Dan Hess,
Abstract:
Database restores are a key function of any database administrator's job. However, it can be an extremely time consuming task to sort through your backups, find the right files, and then get your database up and running. In an emergency this will have a disastrous impact on your Recovery Time Objective(RTO) and lead to the dreaded angry-CTO-in-your-cube effect. By leveraging some easy-to-use Powershell scripts, you can avoid the second disaster and the pain that comes with it. By attending this session, you will understand how you can use the Powershell automation framework for database restores, see scripts that will let you restore faster, and learn techniques to extend these tools for migrating data and testing backups.
Speaker(s): Michael Fal,
Abstract:
Your SQL Server instance has been placed on a VMWare virtualized machine (VM), now what. When a SQL Server instance moved to a virtualized architecture, the DBA typically loses visibility to CPU, Memory, Storage and network metrics. This session will cover basic virtualization concepts specifically related to VMWare, VMWare tools, as well as discuss specific tools to help restore the visibility of server metrics and correlate those metrics directly to SQL Server performance. Monitoring the server metrics along with monitoring overall SQL Server performance provides for an effective solution to manage monitor your SQL Server/VMWare virtualized environment.
Speaker(s): Trent Sherman,
Abstract:
SQL Server implements three different physical operators to perform joins. In this session we will examine how each of these operators work, its advantages and challenges. We will try to understand the logic behind the optimizer's decisions on which operator to use for various joins using (semi) real life examples and we will see how to avoid common join related pitfalls.
Speaker(s): Ami Levin,
Abstract:
As Big Data becomes the norm to deal with data volume, variety and velocity, it becomes increasingly harder for the Data Analyst to understand and work with data sets. To overcome this we introduce Platfora, a Hadoop-backed data analysis framework which nicely complements more traditional data warehousing and BI solutions. We'll go over ingestion of new data and building of data sets and visualizations in a system that requires no more work than interacting with a graphical interface. More specifically, we will do so in the context of peer-to-peer lending, to show how insights on loan applicants and their risk profiles can be quickly revealed with no ETL development or demanding data transformation.
Speaker(s): Andrew Eichenbaum,
Abstract:
Microsoft has brought business intelligence to the cloud. What does this mean and how does this work? In this session, we'll review the BI components available in the cloud BI stack. We'll also compare and contrast functionality of the cloud BI tools with on-premises tools. After attending this session, you'll have a better understanding of what's possible and whether it's time to launch your BI-in-the-cloud solution.
Speaker(s): Stacia Varga,
Abstract:
Have you ever wanted to know how Transparent Database Encryption (TDE) works or how you set it up? This session will go over all the steps and caveats that go with this technology. This is a topic that is an Enterprise Feature, but allows you to have your database encrypted on disk. We will discuss the Encryption Hierarchy in general as well as how it relates to SQL Server TDE.
Speaker(s): Ben Miller,
Abstract:
PowerShell is the Windows IT Pro's new best friend however it has not gotten much love from SQL Server in the past. Still with the newest releases including Preview version 5 we can do some amazing things and there is no reason we can't share the love back to our favorite RDBMS! Lets automate SQL Server together with PowerShell.
Speaker(s): Eric Courville,
Abstract:
We will go over the redesign of the SQL Server Query Optimizer cardinality estimation process. Including how to enable/disable the new behavior in SQL 2014. We will begin by going over the importance of the estimates and how to improve the accuracy of estimates. We will also have a demo where you can see the difference with the new cardinality estimation process.
Speaker(s): Eric Freeman,
Abstract:
This session will provide a deeper dive into the art of dimensional modeling. We will look at the different types of fact tables and dimension tables, how and when to use them. We will also some approaches to creating rich hierarchies that make reporting a snap. This session promises to be very interactive and engaging, bring your toughest Dimensional Modeling quandaries.
Speaker(s): Jason Horner,
Abstract:
NAND flash storage is the new wave of technology hitting datacenters and solutions design. With a new technology comes a new set of pros versus cons, new economics and changes in solutions architecture that highlight what it has to offer. This session will give an overview of how the technology works, what to look out for, how to properly POC/test each vendor’s solution and how to modernize your database architecture with this new technology.
Speaker(s): Matt Henderson,
Abstract:
This session will cover the process of benchmarking the underlying SQL server storage, test its performance and limits by using readily available tools.
Speaker(s): DIlip nayak,
Abstract:
In the past, High Availability and Disaster Recovery (HADR) had many limitations. Clustering and Mirroring are great, but the mirror/secondary database is not very usable since it is not online. Finally, AlwaysOn solves this limitation by merging both multi-node Clustering and mirroring. AlwaysOn also allows the secondary database to remain ONLINE, so we can use it for reporting purposes without resorting to a Snapshot! Come see this lively session with extensive demos of setting up, configuring and testing AlwaysOn. We'll also test automatic fail-over using a real web app to see how well this feature works.
Speaker(s): Jim Murphy,
Abstract:
Have you ever seen or used “WITH (NOLOCK)” in T-SQL? Do you know what it does and its side effects? Is SQL Server optimistic or pessimistic when it comes to locking? Can it be both? In this session we will cover these questions and discuss how and why SQL Server takes locks and how that affects other users. We will go over alternatives for using NOLOCK and discuss when it is appropriate to use. In addition, we will discuss what are the ACID properties and how to monitor locks and blocks.
Speaker(s): Keith Tate,
Abstract:
Do you dread handing your T-SQL over for code review?  Does the DBA always want to tweak your T-SQL? In this demo heavy session, we’ll take a look at various ways to improve your T-SQL. You’ll learn about formatting T-SQL for readability and why top down design is not the best solution for writing T-SQL. You’ll learn why implicit conversions slow queries down and how to leverage simple techniques for minimizing the performance impact of explicit conversions. By changing some of your T-SQL writing habits you can improve performance of queries from the very beginning.
Speaker(s): Mickey Stuewe,
Abstract:
Self-promotion is often times the best promotion you can get. In this session, we will talk about how to promote yourself, your brand and your career without looking like “That Guy”. We will discuss Social Medias, communities, volunteering and other ways to get your name out… What are the first steps? Come find out.
Speaker(s): Mitchell Bottel,
Abstract:
The traditional data warehouse has been around a long time, and it isn’t going away anytime soon. However, with other options such as Hadoop and new analytic and data mining techniques, the warehouse is no longer the center of our business analytics universe. In this session, we will cover these new platforms and our approach for integrating them into your warehouse environment.
Speaker(s): Joseph D'Antoni,
Abstract:
SQL Server 2014's In-Memory OLTP stores your data and indexes in a whole new way. In this session we'll take a look at way SQL Server 2014 In-Memory Database keeps track of your data with two new kinds of indexes, and why your data storage is so much more efficient.
Speaker(s): Kalen Delaney,
Abstract:
In this presentation I'll show you a no SQL code required, all SQL Server 2012 self-service BI solution from the data warehouse all the way up to Report Builder 3. This is a solution I've put in place at Sutter, and it's something simple enough to use at virtually any company.
Speaker(s): Jonathan Amen,
Abstract:
We are going to examine a variety of oopsies MANY developers fall prey to - some obvious, some pretty subtle and some down right sneaky! Lots of code examples with the bad AND good code presented. I GUARANTEE that you will find things here that will either prevent you from getting bad data, throwing unwanted errors or vastly improving your database application's performance. I have given this talk over FIFTY times now and it is always very highly rated!
Speaker(s): Kevin Boles,
Abstract:
Extended Events were introduced in SQL Server 2008. With SQL 2012, we have seen a significant upgrade to this feature. Join me for a little adventure into what extended events are. We will discuss how to use extended events to aid in performance tuning and in day to day administration. We will also explore some background and the architecture of extended events.
Speaker(s): Jason Brimhall,
Abstract:
The SQL Server transaction log is one of the most misunderstood components of the database engine. What makes it grow? How does it get truncated? Should I shrink it? What is a VLF? In this session we will answer these questions and more.
Speaker(s): Randy Knight,
Abstract:
For the first time since SQL 7 there is a compelling reason for EVERY SQL Server user to upgrade to the next version and this time around the reason is Windowing Functions. And these are NOT limited to Enterprise Edition, like so many other really useful and important features! The range of data processing needs that can be very efficiently and cleanly solved with these tools is stunning. In this demo-packed session we will cover as many features as we can pack into an hour's time, and you can take the demo code back home with you to review at your leisure!
Speaker(s): Kevin Boles,
Abstract:
Andy has over 15 years experience in the DBA field. Starting with SQL 6.5 to 2014, he is always retooling himself to be on the cutting edge of technology. He currently works for USC Keck Medical center as the Senior DBA and is using the techniques in this session in production.
Speaker(s): Andrew Nakamura,
Abstract:
Policy Based Management (PBM) and Central Management Server (CMS) are tools you already have if you have at least one SQL 2008 instance. These powerful but often overlooked tools are simple to use, and together they give you a central point from which to manage all your SQL instances. You can even manage your SQL 2000 and 2005 servers as well. This live demo session will show you how easy it is to use these 'hidden gems' that have been lying about in your SSMS toolbox. Real world solutions for real world problems in just minutes.
Speaker(s): Mike Tutor,
This is a list of speakers from the XML Guidebook records. The details and URLs were valid at the time of the event.
LinkedIn: http://www.linkedin.com/in/levinami/
Contact: http://www.amilevin.com
Ami is a data nerd that has been designing, consulting, training, writing, and speaking about SQL, relational modeling, and data platform architecture for more than 20 years. Currently works as a freelance consultant, senior SQL instructor at O'Reilly Media, as an author for PluralSight and LinkedIn Learning.
LinkedIn: http://www.linkedin.com/in/b5lurker
Contact: http://blog.wakebi.com
Steve Wake is currently the Principal BI Developer at Brown and Caldwell and has experience in consulting, advertising, media, manufacturing, retail, charities, telecommunications and financial services organizations using the full on-premises Microsoft BI stack. Recent experience with the Azure services: Analysis Services, Logic Apps, Data Factory, Databricks, Snowflake and Power BI. Steve is also very involved in the SQL community, speaking at events around the world.
LinkedIn: https://www.linkedin.com/in/dan-hess-a789764
Contact: http://www.expressnetsolutions.com/sqldch
Dan has been in IT for the last 18 years, graduating from California State University, Chico with a computer science degree. He#39;s been focused on SQL Server since 2007 when he was given the quot;accidental DBAquot; title. After learning to swim in the deep end and moving jobs to Sacramento, he saw the need to help others who were in a similar position and helped to form the Sacramento SQL Server user group. Database administration is his primary focus.
Jonathan Amen is a SQL Server Business Intelligence and DBA professional with 11 years experience. Jon had been solving complex business questions for 8 years as a business analyst before transitioning to business intelligence. Currently Jon is working at Sutter Health in Sacramento where his duties include both development and administration of data warehouses, ETL processes, data cubes, and various reporting front ends.
LinkedIn: https://www.linkedin.com/profile/view?id=17936460
DBA and architect for over 15 years focusing on high performance SQL Server applications and large scale data warehouses. Matt has been working with SQL on all-flash databases for several years and heads the program at Violin Memory for high performance database tuning for flash devices.
LinkedIn: http://www.linkedin.com/pub/prakash-heda/8/a60/b77
Contact: http://www.sqlfeatures.com/
Prakash Heda works as Manager (Data-IT) at SSC Advent. His expertise encompasses the work of automation, performance tuning/troubleshooting, high availability, san configuration and windows administration. Heda has 13+ years of experience managing enterprise-wide data needs in both high volume transactional and data warehouse environments. Heda holds certifications for MCDBA and MCITP. His background includes administration development using VB/ASP/SSIS with SQL server 2000 to 2017. He is an active member of PASS, SQLSaturday, and as well a frequent presenter at user groups, SQLSaturdays, and other community events. He is also an avid tweeter, blogger and runner.
LinkedIn: http://www.linkedin.com/in/jasonhorner
Contact: http://blog.jasonhorner.com
Hi, my name is Jason I'm a practice lead at Redapt. I spend most of my day helping clients solve business problems mostly in the Data and Advanced Analytics spaces. Sometimes this involves various and sundry cloud technologies including Azure Data Factory, Azure SQL Data Warehouse, Azure Data Lake Store, Azure Databricks, HDInsight and Azure SQL Database. I'm fluent in several languages including: SQL, C#, Python, and PowerShell. I'm a Microsoft Certified Master of SQL Server (MCM) and have been recognized for my technical excellence and evangelism efforts by Microsoft by being awarded the Most Valuable Professional (MVP) for the last 5+ years. In my off hours I like to snowboard, karaoke, ride roller coasters, and play arcade games
LinkedIn: http://www.linkedin.com/pub/todd-kleinhans/0/920/981
Contact: https://toddkleinhans.wordpress.com/
Todd Kleinhans has been using SQL Server since the last millennium. He has served in different roles across many industries but he's mainly been a DBA. When not in virtual reality, he likes to speak at PASS sponsored events and volunteers in various groups like PASS, DSSUG, Colorado Virtual Reality and is the President of Denver/Boulder Unreal Engine group. He is on Twitter: @toddkleinhans and blogs at https://toddkleinhans.wordpress.com/
LinkedIn: https://www.linkedin.com/in/ericlfreeman
Contact: http://sqlelf.blogspot.com/
Eric Freeman works as a Lead Business Intelligence Architect at John Burns Real Estate Consulting. He has 15+ years of experience working with Microsoft SQL Server and holds an MCTS in Business Intelligence with a strong emphasis on Performance Tuning, ETL and Data Warehousing. Former President of the Sacramento SQL Server User Group, and actively speaks at SQL Server events.
LinkedIn: https://www.linkedin.com/pub/keith-tate/34/a40/a46
Contact: http://thesqlchef.com
Keith Tate is a Senior Database Administrator with over 17 years of experience as a data professional. During Keith#39;s professional career he has been a developer, DBA and data architect. Keith is also active in the SQL Server community and is currently the chapter leader of the Albuquerque SQL Server User Group.
LinkedIn: http://www.linkedin.com/in/tomkellerconsulting
Contact: http://tomkellerconsulting.com
Tom Keller is an independent SQL and .Net consultant in the Sacramento area. He has worked with Microsoft SQL Server as an administrator, integrator and developer since 1995. He is a member of the PASS Sacramento Chapter (Sacramento SQL Server User Group), and holds a Bachelor of Electrical Engineering.
LinkedIn: http://www.linkedin.com/in/mickeystuewe/
Contact: http://www.MickeyStuewe.com
Mickey Stuewe has been working with SQL Server since 6.5. That gives her over 20 years of experience. She has not only been a database developer, but also an application developer, even before Visual Studio existed. She is now thankful to be focusing on database design, t-SQL development, and query optimization. She also has a habit of enjoying SSIS and data warehouse design. She blogs regularly on her website mickeystuewe.com and contributes to sites such as SQL Server Central and SQL Server Pro. She enjoys presenting at PASS Summit, SQLSaturdays, User Groups and other events. When she is not immersed in SQL related activities, she enjoys action movies, art, reading, and laughing. She laughs loudly and often...just ask her children.
LinkedIn: http://linkedIn.com/in/angelstreamline
Contact: http://angelstreamline.com
Angel leads the Solutions Architecture team at DesignMind, helping design and build world class data-related systems. His expertise includes Microsoft SQL Server BI tools, Power BI, Azure-based database services, and Tableau. His team develops Proofs of Concept, Pilots, and highly scalable production systems. Angel co-leads the Bay Area Microsoft Business Intelligence User Group and the San Francisco Power BI User Group. He speaks at Data Analytics events throughout the U.S. and writes for SQL Server Central. He is a graduate of Cal Poly SLO with a BS in Mechanical Engineering.
LinkedIn: http://www.linkedin.com/profile/view?id=3997984amp;trk=hb_tab_pro_top
Contact: http://joeydantoni.com
Joseph D'Antoni is a Senior Consultant and Microsoft Data Platform MVP with over 20 years of experience working in both Fortune 500 and smaller firms. He is a Principal Consultant for Denny Cherry Associates and lives in Malvern, PA. He is a frequent speaker at major tech events like Microsoft Ignite, PASS Summit, and Enterprise Data World. He blogs about all topics technology at joeydantoni.com. He believes that no single platform is the answer to all technology problems. Joseph holds a BS in Computer Information Systems from Louisiana Tech University and an MBA from North Carolina State University, and is the co-author of the Microsoft book "Introducing SQL Server 2016”.
LinkedIn: http://www.linkedin.com/in/thesqlguru
Kevin Boles is a SQL Server expert, working exclusively with the product since v6.5. With over 25 years of database experience and over 45,000 man hours of SQL Server engine experience, he holds many related certifications, is an MCT and was a SQL Server MVP from 2007 to 2012. Kevin has been a very successful independent consultant for over 20 years. His passion is the relational engine, especially designing, building, analyzing and tuning high-performance database applications.
LinkedIn: http://www.linkedin.com/in/mickeystuewe/
Contact: http://www.MickeyStuewe.com
Mickey Stuewe has been working with SQL Server since 6.5. That gives her over 20 years of experience. She has not only been a database developer, but also an application developer, even before Visual Studio existed. She is now thankful to be focusing on database design, t-SQL development, and query optimization. She also has a habit of enjoying SSIS and data warehouse design. She blogs regularly on her website mickeystuewe.com and contributes to sites such as SQL Server Central and SQL Server Pro. She enjoys presenting at PASS Summit, SQLSaturdays, User Groups and other events. When she is not immersed in SQL related activities, she enjoys action movies, art, reading, and laughing. She laughs loudly and often...just ask her children.
Dilip works as a Senior DBA at a financial services company. His specialization is in SQL performance tuning, high availability, and database administration. He has over 18 years of IT experience starting as a VB/.NET developer and has been working with SQL for the past 9 years.
Kalen Delaney is a Data Platform MVP who has worked with SQL Server for more than 32 years. She has provided performance consulting services and taught advanced courses on SQL Server to thousands of people and organizations. In addition to her courseware development, Kalen has been writing about SQL Server for decades. She is the primary author of SQL Server Internals and the Inside SQL Server series. Kalen is also one of the primary editors for the Red Gate SQL Server Stairways tutorials.
LinkedIn: https://www.linkedin.com/in/michaelfal/
Contact: http://mikefal.net
Mike is a specialist in data management technologies. As a community advocate, public speaker, and blogger, Mike is a practicing thought leader for data and automation. He is passionate about DevOps and data, building platforms to optimize, protect, and use data efficiently. Since 1999, Mike has been working in the database field, focusing primarily on SQL Server and specializes in automating data solutions to improve the reliability and efficiency of his environments. He has been caught playing trombone in public on more than one occasion.
Contact: http://www.mitchespitch.com
Mitchell Bottel is a senior database administrator with Sutter Physician Services, owner of Innovative IT Consulting and President of the Sacramento SQL Sevrer User Group. He has 14 years of IT experience, focusing on SQL Server for the last ten years with an emphasis on database administration and high availability solutions. He has authored blog posts on the SQLServerPerformance website and written White Papers on using Dynamic Management Views.
LinkedIn: http://www.linkedin.com/in/dbaduck/
Contact: https://dbaduck.com
Ben has been a member of the SQL Server Community since 2000. He loves a challenge and has fixed many SQL Servers and helped hundreds of people get more out of their DBA jobs. He is a Data Platform MVP a SQL Server Certified Master (MCM). He has worked at various companies throughout the USA, as well as at Microsoft for 7 years. He is passionate about SQL Server Infrastructure, High Availability, Automation and Integration using SMO and PowerShell. He teaches DBAs how to use PowerShell to do their job and teaches SQL Server Internals. He is @DBAduck all around the web (Twitter, LinkedIn, Facebook, Blog) so let's catch up.
LinkedIn: http://www.linkedin.com/in/sqlwatchmen
Contact: http://sqlwatchmen.com/blogs/jim/
Jim Murphy has been using Microsoft SQL Server since version 6.0 back in the 90#39;s. He is the CEO of SQLWatchmen, LLC., a managed DBA service provider. He runs the Austin SQL Server User Group: CACTUSS Central. He has been a professional DBA and developer for over 25 years and has run a consulting company full time since 2001.
Contact: http://www.sqlsolutionsgroup.com/
Mike Tutor has been in the IT industry for over 30 years. He has worn many hats, including developer, systems admin, and project manager, but he has worked almost exclusively as a SQL Server DBA since the late 90s. He has worked as a development DBA in the medical research industry for many years, but is currently working as a Sr. consultant at SQL Solutions Group in Lehi UT.
LinkedIn: http://www.linkedin.com/in/randyknight
Contact: http://www.sqlsolutionsgroup.com/blog
Randy Knight is a data professional who has worked with Microsoft technology for over 25 years, focusing on SQL Server since 1997. He has worked in a variety of settings, including 6 years as a database architect for match.com. In 2010, he founded SQL Server Solutions Group LLC, a boutique SQL Server consultancy. A Microsoft Certified Master (MCM) in SQL Server, he speaks often at events all over the country including the PASS Summit, SQLIntersections, and numerous SQLSaturday and User Groups.
LinkedIn: http://www.linkedin.com/in/staciavarga
Contact: http://blog.datainspirations.com
Stacia Varga is a Microsoft Data Platform MVP and SSAS Maestro with a Bachelor’s Degree in Social Sciences. A consultant, educator, author, and principal of Data Inspirations, her career spans more than 30 years, with a focus on improving business practices through technology. Since 2000, Stacia has provided consulting and education services for Microsoft's Business Intelligence technologies. As Stacia Misner, she also authored several books covering the Microsoft BI stack.
LinkedIn: http://www.linkedin.com/in/thesqlguru
Kevin Boles is a SQL Server expert, working exclusively with the product since v6.5. With over 25 years of database experience and over 45,000 man hours of SQL Server engine experience, he holds many related certifications, is an MCT and was a SQL Server MVP from 2007 to 2012. Kevin has been a very successful independent consultant for over 20 years. His passion is the relational engine, especially designing, building, analyzing and tuning high-performance database applications.
Trent Sherman has over 25 years of overall IT experience and over 20 years of DBA experience primarily in the telecommunications amp; software industries using Oracle amp; SQL Server. He is currently an Engineer/DBA with Confio Corporation, recently acquired by Solarwinds. Prior to Solarwinds, Trent worked as a Senior Infrastructure Architect, Technical Manager, DBA, Developer and Design architect in several OLTP amp; VLDB/Data Warehouse database environments.
Contact: http://www.designmind.com
Andrew is a former physicist who realized that data mining and the understanding of systems is his real passion. That lead him from his PhD in Physics to the realm of web analytics where he has worked on problems in: search, personalization, NLP, reporting, product design/road-map, and basic RD. With over 10 years of industry experience, he has managed multiple projects and teams across a wide range of topics ranging from advanced analytics to BI and marketing.
Contact: http://www.organicit.org
Eric Courville has been with Verizon for 15 years supporting and implementing Large Enterprise Resource Planning Applications from vendors such as Oracle, Microsoft and SAP. Specializing in application monitoring, and integrating SSO with third party applications. Eric is Also the founder of the Northern California PowerShell User Group with locations in San Francisco and the Sacramento area.
LinkedIn: http://www.linkedin.com/pub/andy-nakamura/18/12/709/en
Contact: http://andynakamura.com
Andrew Nakamura is a SQL DBA at Keck Medicine of USC. His experience spans enterprise wide level of support using Powershell, DBATools and other custom scripts to maintain 115 servers with over 1600 databases. He has expertise in both Financial and Healthcare worlds and knows the challenges they face. He has presented in all Southern California SQLSaturdays and will continue to push bleeding edge solutions. He enjoys the command line syntax and wish like to play with Core Editions of Windows and SQL 2017. He's added to his current passions of Azure, Automation, High Availability, Family and Faith, Toastmasters, and now, SQL on Linux. Long live the command shell!
LinkedIn: https://www.linkedin.com/in/dbajbrimhall/
Contact: http://jasonbrimhall.info
Jason Brimhall has more than 20 years of experience and has worked with SQL Server 6.5 through SQL Server 2019. He has experience in performance tuning, high transaction environments, and large environments. He is currently a consultant specializing in performance tuning, server analysis, and problem resolution. Jason is a Microsoft Certified Master (MCM) and a Data Platform MVP.
The following is a list of sponsors that helped fund the event.


|
BitShares-Core
6.1.0
BitShares blockchain implementation and command-line interface software
|
a placeholder for the result of an asynchronous operation. More...
#include <future.hpp>
Public Member Functions | |
| future (const typename promise< T >::ptr &p) | |
| future (typename promise< T >::ptr &&p) | |
| future (const future< T > &f) | |
| future () | |
| future & | operator= (future< T > &&f) |
| operator const T & () const | |
| const T & | wait (const microseconds &timeout=microseconds::maximum()) const |
| const T & | wait_until (const time_point &tp) const |
| bool | valid () const |
| bool | ready () const |
| bool | error () const |
| void | cancel (const char *reason FC_CANCELATION_REASON_DEFAULT_ARG) const |
| bool | canceled () const |
| void | cancel_and_wait (const char *reason FC_CANCELATION_REASON_DEFAULT_ARG) |
| template<typename CompletionHandler > | |
| void | on_complete (CompletionHandler &&c) |
Friends | |
| class | thread |
a placeholder for the result of an asynchronous operation.
By calling future<T>::wait() you will block the current fiber until the asynchronous operation completes.
If you would like to use an asynchronous interface instead of the synchronous 'wait' method you could specify a CompletionHandler which is a method that takes two parameters, a const reference to the value and an exception_ptr. If the exception_ptr is set, the value reference is invalid and accessing it is 'undefined'.
Promises have pointer semantics, futures have reference semantics that contain a shared pointer to a promise.
Definition at line 211 of file future.hpp.
|
inline |
Definition at line 213 of file future.hpp.
|
inline |
Definition at line 214 of file future.hpp.
|
inline |
Definition at line 215 of file future.hpp.
|
inline |
Definition at line 216 of file future.hpp.
|
inline |
Definition at line 248 of file future.hpp.
|
inline |
Definition at line 251 of file future.hpp.
|
inline |
Definition at line 249 of file future.hpp.
|
inline |
Definition at line 246 of file future.hpp.
|
inline |
The given completion handler will be called from some arbitrary thread and should not 'block'. Generally it should post an event or start a new async operation.
Definition at line 274 of file future.hpp.
|
inline |
Definition at line 223 of file future.hpp.
|
inline |
Definition at line 218 of file future.hpp.
|
inline |
Definition at line 243 of file future.hpp.
|
inline |
Definition at line 240 of file future.hpp.
|
inline |
| timeout |
Definition at line 228 of file future.hpp.
|
inline |
| timeout |
Definition at line 235 of file future.hpp.
|
friend |
Definition at line 278 of file future.hpp.


This is where you can find the lyrics of all Lord Ketu mantras or devotional hymns in English and Devanagari script. You will also find the meaning of Ketu mantras and devotional hymns in English. Ketu mantras are read to please Lord Ketu.
| Ketu Kavach |
| Ketu Gayatri Mantra |
| Ketu Ashtotara Shatanamavali |
| Ketu Ashtotara Shatanam Stotram |
| Ketu Stotra |


| Total net profit | -33.67 | Gross profit | 5.65 | Gross loss | -39.32 |
| Profit factor | 0.14 | Expected payoff | -1.98 | ||
| Absolute drawdown | -33.67 | Maximal drawdown (%) | 33.4 (-12370.37%) | ||
| Total trades | 17 | Profit trades (% of total) | 6 (35.29%) | Loss trades (% of total) | 11 (64.71%) |
| Long positions (won %) | 8 (37.5%) | Short positions (won %) | 9 (33.33%) | ||
| Largest | profit trade | 2.63 | loss trade | -4.92 | |
| Average | profit trade | 0.94 | loss trade | -3.57 | |
| Minimum | profit trade | 0.03 | loss trade | -0.7 | |
| Maximum | take profit in pips | 21.3 | stop loss in pips | -32.0 | |
| Average | take profit in pips | 4.8 | stop loss in pips | -27.8 | |
| Minimum | take profit in pips | -5.8 | stop loss in pips | -18.1 | |
| Maximum | Reward-Risk | 0.7 | Duration in minutes | 5238 | |
| Average | Reward-Risk | 0.2 | Duration in minutes | 1463.8 | |
| Minimum | Reward-Risk | 0.0 | Duration in minutes | 60 | |
| Maximum | consecutive wins (profit in money) | 3.0 (3.81) | consecutive losses (loss in money) | 4.0 (-14.35) | |
| Average | consecutive wins | 1.0 | consecutive losses | 2.0 |
| Total net profit | -12.63 | Gross profit | 0.52 | Gross loss | -13.15 |
| Profit factor | 0.04 | Expected payoff | -1.58 | ||
| Absolute drawdown | -12.63 | Maximal drawdown (%) | 12.36 (-4577.78%) | ||
| Total trades | 8 | Profit trades (% of total) | 3 (37.5%) | Loss trades (% of total) | 5 (62.5%) |
| Largest | profit trade | 0.43 | loss trade | -4.73 | |
| Average | profit trade | 0.17 | loss trade | -2.63 | |
| Minimum | profit trade | 0.03 | loss trade | -0.7 | |
| Maximum | take profit in pips | 2.6 | stop loss in pips | -31.6 | |
| Average | take profit in pips | -2.4 | stop loss in pips | -24.4 | |
| Minimum | take profit in pips | -5.8 | stop loss in pips | -18.1 | |
| Maximum | Reward-Risk | 0.1 | Duration in minutes | 4052.0 | |
| Average | Reward-Risk | 0.0 | Duration in minutes | 832.0 | |
| Minimum | Reward-Risk | 0.0 | Duration in minutes | 60.0 | |
| Maximum | consecutive wins (profit in money) | 1.0 (0.43) | consecutive losses (loss in money) | 2.0 (-4.64) | |
| Average | consecutive wins | 1.0 | consecutive losses | 1.0 |
| Total net profit | -21.04 | Gross profit | 5.13 | Gross loss | -26.17 |
| Profit factor | 0.2 | Expected payoff | -2.34 | ||
| Absolute drawdown | -21.04 | Maximal drawdown (%) | 19.33 (-1130.41%) | ||
| Total trades | 9 | Profit trades (% of total) | 3 (33.33%) | Loss trades (% of total) | 6 (66.67%) |
| Largest | profit trade | 2.63 | loss trade | -4.92 | |
| Average | profit trade | 1.71 | loss trade | -4.36 | |
| Minimum | profit trade | 1.12 | loss trade | -3.09 | |
| Maximum | take profit in pips | 21.3 | stop loss in pips | -32.0 | |
| Average | take profit in pips | 11.3 | stop loss in pips | -30.8 | |
| Minimum | take profit in pips | 2.5 | stop loss in pips | -21.3 | |
| Maximum | Reward-Risk | 0.7 | Duration in minutes | 5238.0 | |
| Average | Reward-Risk | 0.4 | Duration in minutes | 2025.3 | |
| Minimum | Reward-Risk | Duration in minutes | 288.0 | ||
| Maximum | consecutive wins (profit in money) | 2.0 (3.75) | consecutive losses (loss in money) | 3.0 (-13.37) | |
| Average | consecutive wins | 1.0 | consecutive losses | 1.0 |


Hi, name's Mitch, I like to create things; all kinds of things: painting, electronics, apps, programs, music, camp-fires, etc. I live in the Minnesota and I dream of becoming a developer. In the summer you can find me on the lake and in the winter you can find me on slopes or on an ice-rink. I'm not normal because I take cold-showers in the morning then stand on my head for minute; I should probably be commited. This is my web-site and it's dedicated to telling the world about my experience at Dev Bootcamp.


(76 customer reviews)
Eres' daring 'Grigri Fortune' swimsuit has the fit and coverage of a bikini in a one-piece silhouette. This fuchsia style is crafted from the label's sculpting peau douce fabric and has flattering cutouts through the torso and back. Wear yours with mirrored sunglasses on vacation.
Meet Wingman, a robust suite of styled pages and components, powered by Bootstrap 4. The ideal starting point for product landing pages, stylish web-apps and complete company websites.
Contact us


This is a grocery list web app that I made to allow my wife and I to see what we have left in the fridge at home, and what has gone bad without having to be home.
This project was one that involved a lot of taste test. This resturant is seriously delicous! This project was built using Angular and Bootstrap
Good old fasion rock paper scissors. Can you beet the computer and get to the top of the leaderboard?
A wiki app bulit to let user post new topics and comment on other topic. This project was built usinf Ruby on Rails using the Devise gem.


In the origin stories of the five founding members of the Gatewatch, you can learn the secrets of their past and the events which haunt them to this day.


Getting this error a lot:
Unhandled rejection SyntaxError: Unexpected token W in JSON at position 0
at JSON.parse (<anonymous>)
at _bitcoinRPC.then (/home/siddhartha/Apps/Agama-linux-x64/resources/app/routes/shepherd/dashboardUpdate.js:168:37)
at tryCatcher (/home/siddhartha/Apps/Agama-linux-x64/resources/app/node_modules/bluebird/js/release/util.js:16:23)
at Promise._settlePromiseFromHandler (/home/siddhartha/Apps/Agama-linux-x64/resources/app/node_modules/bluebird/js/release/promise.js:512:31)
at Promise._settlePromise (/home/siddhartha/Apps/Agama-linux-x64/resources/app/node_modules/bluebird/js/release/promise.js:569:18)
at Promise._settlePromise0 (/home/siddhartha/Apps/Agama-linux-x64/resources/app/node_modules/bluebird/js/release/promise.js:614:10)
at Promise._settlePromises (/home/siddhartha/Apps/Agama-linux-x64/resources/app/node_modules/bluebird/js/release/promise.js:693:18)
at Async._drainQueue (/home/siddhartha/Apps/Agama-linux-x64/resources/app/node_modules/bluebird/js/release/async.js:133:16)
at Async._drainQueues (/home/siddhartha/Apps/Agama-linux-x64/resources/app/node_modules/bluebird/js/release/async.js:143:10)
at Immediate.Async.drainQueues (/home/siddhartha/Apps/Agama-linux-x64/resources/app/node_modules/bluebird/js/release/async.js:17:14)
at runCallback (timers.js:789:20)
at tryOnImmediate (timers.js:751:5)
at processImmediate [as _immediateCallback] (timers.js:722:5)


The friction losses are considered by the equations
tau / tauRef = (+w / wRef) ^ power_w for w > +wLinear - tau / tauRef = (-w / wRef) ^ power_w for w < -wLinear
with
tauRef * wRef = PRef
being the friction torque at the reference angular velocity
wRef
. The exponent power_w
is
approximately 1.5 for axial ventilation and approximately 2.0 for
radial ventilation.
For stability reasons the friction torque tau
is
approximated by a linear curve
tau / tauLinear = w / wLinear
with
tauLinear = tauRef*(wLinear/wRef) ^ power_w
in the range -wLinear ≤ w ≤ wLinear
with
wLinear = 0.001 * wRef
. The relationship of torque and
angular velocity is depicted in Fig. 1
Fig. 1: Friction loss torque versus angular
velocity for power_w = 2 |
If it is desired to neglect friction losses, set
frictionParameters.PRef = 0
(this is the default).


I am currently in my final year of studies at the University of Bristol doing a MEng in Computer Science with Innovation. When I graduate, I plan to pursue a career in software engineering helping companies achieve the impossible.
I am passionate about software development, innovation and technology!
I am fully dedicated to the projects I choose to work on.
I want everything done in the best way possible.
I am passionate about my projects.
I am not afraid to take calculated risks.
I have a lot of experience with coming up with new ideas in a lean and agile way.
I am a computer scientist at heart.
Through all my demanding projects and work experiences I have learnt how to quickly notice and fix problems.
I can work with diverse and transdisciplinary teams.
According to the Health and Safety Executive (2018), depression and anxiety accounted for 49% of all sick days taken by employees between 2016 and 2017; equating to an annual loss of 12.5 million working days. Combined with costs associated with presenteeism and staff turnover, mental health amounts to an outgoing of £33 to £42 billion for employers every year (Stevenson & Farmer, 2017).
The Coell online platform is designed to bring employees from SMEs together to follow and share their passions, creating connected wellness within the working community. Coell’s platform enables employees to:
As highlighted in the picture to the right, which shows one frame from the game ‘The Division 2’ (released in 2018), the cost of producing 3D assets for a variety of applications is large and growing. The games industry is growing rapidly, with 8.2% compound annual growth rate from 2016 to 2020.
A piece of software that can synthesise and stylise new 3D assets, learning from the data which creative companies have stored in order to create new designs. Using techniques such as Generative Adversarial Networks and Transfer Learning, we believe this problem is solvable with a new kind of AI.
Watershed challenged the team with a brief for their Playable Cities project. The challenge was to create an installation that puts people and play at the heart of the city. From our client’s brief it was clear that the solution design should respond to the theme of winter gathering and our target users should be the everyday commuters.
The goal for the Cairn People was to be in the intersection of art, society and technology. The idea of Cairn People involves a number of large-scale figures depicting everyday commuter poses, built from brightly coloured blocked that light up from the bottom to the top as the sum sets. They are centered around the theme of winter and its effect on our lives during the cold, dark months, bringing colour and light to various areas of Bristol in a playful experience. The project is a celebration of the everyday, and hopefully it will be something that inspires an excited people on their everyday journeys. We hope to create a little wonder in people’s lives, and, through this, to spark genuine human connection.
Over the last two years, I regularly mentored a global cohort of students in how to develop a growth mindset, learn from failure, how to network, how to develop lean business models, and how to ideate successfully.
This is part of my role as a mentor for the Bristol Futures Online Course, one of the university's flagship online programmes, which I have been with helping with from the start.
I have facilitated and mentored students designing web applications in how to solve the real needs of their clients.
I provided guidance on developing technical specifications, excelling in client relationships, performing unit and user testing and presenting and writing their final project.
I organised and led an entire summer camp consisting of a hundred children and fifteen staff members.
I was responsible for giving to children and parents alike an overall excellent experience.
I inspired potential university applicants to apply for our university’s Innovation degree while sharing my passion and enthusiasm about my studies.
I acquired experience in the field of financial consulting and assessed various business plans for Deloitte’s customers.
Joined senior consultants in their meeting with the Bank of Cyprus.
Attended Deloitte’s financial model building training and conducted a number of financial modelling case studies.


Reverb synthesis with a spectral autoencoder
Smarter equalizer with β-VAE
Nested allpass filters
Dry
Short reverb
Long dark reverb
(Strange delay)
Gain |
|
Frequency |
|
Q (bandwidth) |
The beta term weighs the KL loss against the reconstruction loss
Larger beta means greater disentanglement
β = 0.000
β = 0.001
β = 0.010
β = 0.020


Pixel Art Maker!
Pixel Art Maker
Choose Grid Size
Grid Height:
Grid Width:
Pick A Color
Pick a Background
Design Canvas


Resume - Personal Info
-
Web Design and Development 2017.8 - 2018.2
24/7 Teach
- Supported the development of our Online Learning Platform by using PHP, Angular JS
- Supported and upgraded Grading and Data analysis application and adjusted the display of website to
optimize the design more clean and user friendly
- Utilized the in-house development and project management tools
-
Data Analyst Intern 2017.4 - 2017.6
Autohome Inc.
- Tracked and monitored searching keywords weekly to update order of cars on homepage, detected and analysis
abnormal performance of DAU
- Gathered text data of review from users to create evaluation reports for 5 most popular middle-sized SUV,
assisted to implement new features of the personalized recommendation system by analyzing click rates, reading
time and volume of transactions
- Supported normalized relational database to ensure efficient analysis process resulted in cut down 30% searching
time
- Visualized reports to marketing group and team leaders, delivered solution to operation team
- Maintained the content of social media platforms, and managed content of Autohome APP resulted in increasing
nearly 4000 new users within two months
-
Business Analyst Intern 2016.6 - 2017.8
Camelot Information System Inc.
- Completed documentation on twelve assigned systems and databases, including business rules, logic, andprocesses for
Yihaikerry company on the TWMS project
- Analyzed major retailer related warehouse operations, including performance and productivity data, error rates and their
root causes
- Finished independent research of current SAP system, focused on stocking functions to identify the data flow later
transfered to the new systems
- Prepared for team meeting and presentation weekly to team leaders and maintained direct communication with client
-
Master of Science 2015 - 2017
Depaul University
Chicago, IL, US
Name of Institute
-
Bachelor of Arts 2009 - 2013
Guangxi University
Nanning, Guangxi, China
Name of Institute


Naming in Ghana takes on a culture that names children either male or female according to the day they were born
Numeric Month (1-12):
Day of Month (1-31):
Year:


Gecode::Search::Seq::LDS< Tracer > Class Template Reference
Limited discrepancy search engine implementation. More...
#include <lds.hh>
Public Member Functions | |
| LDS (Space *s, const Options &o) | |
| Initialize for space s with options o. | |
| virtual Space * | next (void) |
| Return next solution (NULL, if none exists or search has been stopped). | |
| virtual Statistics | statistics (void) const |
| Return statistics. | |
| void | constrain (const Space &b) |
| Constrain future solutions to be better than b (should never be called). | |
| void | reset (Space *s) |
| Reset engine to restart at space s. | |
| virtual bool | stopped (void) const |
| Check whether engine has been stopped. | |
| virtual | ~LDS (void) |
| Destructor. | |
Protected Attributes | |
| Options | opt |
| Search options. | |
| Probe< Tracer > | e |
| The probe engine. | |
| Space * | root |
| Root node for problem. | |
| unsigned int | d |
| Current discrepancy. | |
| bool | no_solution |
| Solution found for current discrepancy. |
Detailed Description
template<class Tracer>
class Gecode::Search::Seq::LDS< Tracer >
Limited discrepancy search engine implementation.
Definition at line 105 of file lds.hh.
Constructor & Destructor Documentation
template<class Tracer >
| Gecode::Search::Seq::LDS< Tracer >::LDS | ( | Space * | s, | |
| const Options & | o | |||
| ) | [inline] |
template<class Tracer >
| Gecode::Search::Seq::LDS< Tracer >::~LDS | ( | void | ) | [inline, virtual] |
Member Function Documentation
template<class Tracer >
| Space * Gecode::Search::Seq::LDS< Tracer >::next | ( | void | ) | [inline, virtual] |
Return next solution (NULL, if none exists or search has been stopped).
Implements Gecode::Search::Engine.
template<class Tracer >
| Statistics Gecode::Search::Seq::LDS< Tracer >::statistics | ( | void | ) | const [inline, virtual] |
template<class Tracer >
| void Gecode::Search::Seq::LDS< Tracer >::constrain | ( | const Space & | b | ) | [inline, virtual] |
Constrain future solutions to be better than b (should never be called).
Reimplemented from Gecode::Search::Engine.
template<class Tracer >
| void Gecode::Search::Seq::LDS< Tracer >::reset | ( | Space * | s | ) | [inline, virtual] |
Reset engine to restart at space s.
Reimplemented from Gecode::Search::Engine.
template<class Tracer >
| bool Gecode::Search::Seq::LDS< Tracer >::stopped | ( | void | ) | const [inline, virtual] |
Check whether engine has been stopped.
Implements Gecode::Search::Engine.
Member Data Documentation
template<class Tracer >
Options Gecode::Search::Seq::LDS< Tracer >::opt [protected] |
template<class Tracer >
Probe<Tracer> Gecode::Search::Seq::LDS< Tracer >::e [protected] |
template<class Tracer >
Space* Gecode::Search::Seq::LDS< Tracer >::root [protected] |
template<class Tracer >
unsigned int Gecode::Search::Seq::LDS< Tracer >::d [protected] |
template<class Tracer >
bool Gecode::Search::Seq::LDS< Tracer >::no_solution [protected] |
The documentation for this class was generated from the following files:


--- layout: page title: Things subtitle: Circuits and Stuff desc: Blinky lights, BLE and Shinies permalink: /things/ ---
A bracelet with blinking LED lights. No, it doesn't use neopixels. It's much smaller and that is the hard part.
A frantically put together LED bangle for a friend who attended DefCon 2017
An overview of the DC503 Party Badge for DefCon 2018


{% include 'components/head.html' %}
Autocue
Scripts are immutable. Any edits will be saved with a new ID.


Full stack web development, web design and accessibility, Linux, JavaScript, music production, cycling, trail running, wake surfing, snowboarding
In 2012 I made the decision to turn my life long interest and fascination in technology into a career. I decided that to achieve my new found goals as efficiently as possible I should go back to school full time.
I attended Chattahoochee Technical College majoring in Computer Information Systems Technology. I enjoyed my classes and I learned a lot while earning my degree and in the process I found my biggest passion in technology was in programming and web development.
After I graduated I decided to continue my education to gain all the skills I would need to become a Web Developer. After many hours of researching schools and programs all across the country I came to the conclusion that Epicodus located in Portland, OR was the best place for me. I felt that a program like Epicodus would prepare me for all of the technical and non technical skills I wanted to improve on such as working on team projects and pair programming.
It turned out to be a great decision because I learned so many new things during my time at Epicodus. I’m also very happy living in Portland and in January of 2016 I started my technology career as a Software QA Analyst and Web Developer at Plus QA. I was able to learn and improve my problem solving and analytical skills in this position. In early 2017 I decided it was time to take the next step with my career by pursuing a position that would allow me to grow more as a developer.
In June, 2017 I began a new position as a Front-End Web Application Developer at Stevens Water Monitoring Systems. In the time since I started this position I've designed and developed a large-scale Angular web application from the ground up and we released this new SaaS platform to our customers at the end of Q1 2018.


Lisbon’s Technology Innovation Community
Stay informed. Discover the next events. Find the next business partner, professional opportunity, workspace or a new educational path to allow further development.
203
Profiles
78
Companies
31
Jobs
23
Courses
12
Investors
47
Workspaces
Latest News
-
EatTasty delivered 250 thousand portuguese lunches to offices in Lisbon and Madrid
4 December 2019
in Observador
- companies


| Date | Description | Amount | Gold Balance |
|---|
Welcome to a world of fantasy and magic! A world of mysterious humanoids like the erks, the drevs, the gronks, and the glorns. And above them all, high in mountain peaks, dwell the majestic dragons. In this game you will see through the eyes of one of these magnificent creatures.
Dragons are wise, powerful, and long-lived but their pride brings them into conflict with other intelligent races. In 2008 D.Y. the High Dragon Council instituted a system of taxes and penalties to establish a facade of order, aid them in diplomatic negotiations to prevent all out war between the dragons and the humanoid peoples, and funnel the vast wealth of the dragons to themselves.
As majestic as you may be, you're just an average dragon and in no position to oppose the council's decrees. You've procrastinated once again and now there are just ten minutes until the courier arrives to collect your tax forms. Can you finish them in time? Grab a pen, paper, and a calculator, and press the "I'm ready!" button when you're ready to begin!
The goal of the game is to complete your D-1045 form on time without any errors. You can drag documents around with your mouse. Follow the instructions included with the form for an explanation of how to complete each line item.
A pen and paper will be handy.
A calculator is also highly recommended.
The official council tax courier arrives for your tax forms and payment.
A few days later, over tea, you look over your paperwork with your friend, Verna Fairwing, Professional Dragon Accountant (PDA). She gives you an assessment of your return.
Thanks for playing!
Match the column and row on the table below with the line items on your D-1045. For example, your result for line A1 should match the value at column A, row 1. (Lines that do not exist on the chart have been filled with random values)


Youtube Social Network
Home
My Account
Analytics
Views Estimator
Select a Category
Entertainment
Music
Comedy
People & Blogs
Sports
Film & Animation
News & Politics
Pets & Animals
Autos & Vehicles
Gadgets & Games
Howto & DIY
Travel & Places
UNA
Science & Technology
Nonprofits & Activism
Howto & Style
Education
Travel & Events
Gaming
Total Ratings
Comments
Page Rank for Video
Clustering
Based on our K-means Clustering Algorithm, you have been identified as
{{cluster}}
user
Learn More
Username
{{session['username']}}


Experiments in Coffee Roasting
First record of coffee roasting experiments.
Posted on Sun, 15 Mar 2015 13:00:00 MDT by Aaron Bieber
Etgiopia Yirga Cheffe Kore Kochoer & Brazil Pulp Natural Fazenda do Sertao
Beans: 50⁄50 of each. (Batch of 100g)
First Crack: Ooops
Second Crack: Ooops
Total Roast Time: Ooops
First Crack: 2:35
Second Crack: 4:00
Total Roast Time: 4:55
First Crack: 2:08
Second Crack: 3:54
Total Roast Time: 4:34


Assignment by Marty Stepp and Victoria Kirst. Based on Priority Queue assignment from Jerry Cain.
In the problem, you will implement a collection called a priority queue using a linked list. This problem focuses on linked lists and pointers, along with classes and objects. This is an individual assignment. Write your own solution and do not work in a pair/group on this program.
In this problem you will write a PatientQueue
class that manages a waiting line of patients to be processed at a hospital.
In this class we have learned about queues that process elements in a first-in, first-out (FIFO) order. But FIFO is not the best order to assist patients in a hospital, because some patients have more urgent and critical injuries than others. As each new patient checks in at the hospital, the staff assesses their injuries and gives that patient an integer priority rating, with smaller integers representing greater urgency. (For example, a patient of priority 1 is more urgent and should receive care before a patient of priority 2.)
Once a doctor is ready to see a patient, the patient with the most urgent (smallest) priority is seen first. That is, regardless of the order in which you add/enqueue the elements, when you remove/dequeue them, the one with the lowest priority number comes out first, then the second-smallest, and so on, with the largest priority item coming out last. A queue that processes its elements in order of increasing priority like this is also called a priority queue.
Your class will use a singly linked list as its internal data storage. The elements of the linked list are stored in sorted order internally. As new elements are enqueued, you should add them at the appropriate place in the linked list so as to maintain the sorted order. The primary benefit of this implementation is that when removing a patient to process them, you do not need to search the linked list to find the smallest element and remove/return it; it is always at the front of the list. Enqueuing is slower, because you must search for the proper place to enqueue new elements, but dequeue/peeking and general overall performance are fairly good.
If two patients in the queue have the same priority, you will break ties by choosing the patient who arrived earliest with that priority. This means that if a patient arrives at priority K and there are already other patients in the queue with priority K, your new patient should be placed after them.
For example, if the following patients arrive at the hospital in this order:
Then if you were to dequeue the patients to process them, they would come out in this order: Ford, Bernard, Dolores, William, Teddy, Arnold.
(It is worth noting that outside of the context of this homework assignment, internally a given implementation of a priority queue might not actually store its elements in sorted order; all that matters is that when they are dequeued, they come out in sorted order by priority. This difference between the external expected behavior of the priority queue and its true internal state can lead to interesting differences in implementation.)
You will write a PatientQueue
class that uses a sorted linked list as its internal data storage.
This class is only allowed to have a single private member variable inside it: a pointer to the front of your list.
We supply you with a PatientNode
structure (in patientnode.h/cpp) that is a small structure representing a single node of the linked list.
Each PatientNode
stores a string value and integer priority in it, and a pointer to a next node.
You should use this structure to store the elements of your queue along with their priorities.
struct PatientNode {
string name;
int priority;
PatientNode* next;
// constructor - each parameter is optional
PatientNode(string name, int priority, PatientNode* next);
...
};
As stated previously, the elements of the linked list are stored in sorted order internally. As new elements are enqueued, you should add them at the appropriate place in the linked list so as to maintain the sorted order. The primary benefit of this implementation is that when dequeuing, you do not need to search the linked list to find the element with most urgent priority to remove/return it; it is always at the front of the list. Enqueuing new patients is slower, because you must search for the proper place to enqueue them, but dequeuing a patient to process them is very fast, because they are at the front of the list.
The following is a diagram of the internal linked list state of a PatientQueue
after enqueuing the elements listed previously:
front -> {2:Ford} -> {4:Bernard} -> {5:Dolores} -> {5:William} -> {5:Teddy} -> {8:Arnold}
A tricky part of this implementation is inserting a new node in the proper place when a new patient arrives. You must look for the proper insertion point by finding the last element whose priority is at least as large as the new value to insert. Remember that, as shown in class, you must often stop one node early so that you can adjust the next pointer of the preceding node. For example, if you were going to insert the value "Stubbs" with priority 5 into the list shown above, your code should iterate until you have a pointer to the node for "Teddy", as shown below:
front -> {2:Ford} -> {4:Bernard} -> {5:Dolores} -> {5:William} -> {5:Teddy} -> {8:Arnold} ^ | current ---+
Once the current
pointer shown above points to the right location, you can insert the new node as shown below:
front -> {2:Ford} -> {4:Bernard} -> {5:Dolores} -> {5:William} -> {5:Teddy} {8:Arnold} ^ | ^ | v | current ---+ {5:Stubbs}
Your class must support all of the following operations. Each member must run within the Big-Oh runtime noted; the N in this context means the length of the linked list.
| Member Name | Description | Big-Oh |
|---|---|---|
PatientQueue() |
In this parameterless constructor you should initialize a new empty queue (with a null front for your internal linked list). | O(1) |
~PatientQueue() |
In this destructor you must free up any memory used by your linked list nodes. | O(N) |
pq.newPatient(name, priority); |
In this function you should add the given person into your patient queue with the given priority. Duplicate names and priorities are allowed. Any string is a legal value, and any integer is a legal priority; there are no invalid values that can be passed. | O(N) |
pq.processPatient() |
In this function you should remove the patient with the most urgent priority from your queue, and you should also return their name as a string. You should throw a string exception if the queue does not contain any patients. | O(1) |
pq.frontName() |
In this function you should return the name of the most urgent patient (the person in the front of your patient queue), without removing it or altering the state of the queue. You should throw a string exception if the queue does not contain any patients. | O(1) |
pq.frontPriority() |
In this function you should return the integer priority of the most urgent patient (the person in the front of your patient queue), without removing it or altering the state of the queue. You should throw a string exception if the queue does not contain any patients. | O(1) |
pq.upgradePatient(name, newPriority); |
In this function you will modify the priority of a given existing patient in the queue. The intent is to change the patient's priority to be more urgent (a smaller integer) than its current value, perhaps because the patient's condition has gotten worse. If the given patient is present in the queue and already has a more urgent priority than the given new priority, or if the given patient is not already in the queue, your function should throw a string exception. If the given patient name occurs multiple times in the queue, you should alter the priority of the first occurrence you find when searching your linked list from the start. | O(N) |
pq.isEmpty() |
In this function you should return true if your patient queue does not contain any elements and false if it does contain at least one patient.
|
O(1) |
pq.clear(); |
In this function you should remove all elements from the patient queue, freeing memory for all nodes that are removed. | O(N) |
ostream << pq |
You should write a << operator for printing your patient queue to the console.
The elements should be printed out in front-to-back order and must be in the form of value:priority with {} braces and separated by a comma and space, such as:
{2:Ford, 4:Bernard, 5:Dolores, 5:William, 5:Teddy, 8:Arnold}
The PatientNode structure has a << operator that may be useful to you.
Your formatting and spacing should match exactly.
Do not place a \n or endl at the end of your output.
|
O(N) |
The headers of every member must match those specified above. Do not change the parameters or function names.
Constructor/destructor:
Your class must define a parameterless constructor.
Since your implementation allocates dynamic memory (using new
), you must ensure that there are no memory leaks by freeing any such allocated memory at the appropriate time.
This will mean that you will need a destructor to free the memory for all of your nodes.
Helper functions:
The members listed on the previous page represent your class's required behavior.
But you may add other member functions to help you implement all of the appropriate behavior.
Any other member functions you provide must be private
.
Remember that each member function of your class should have a clear, coherent purpose.
You should provide private helper members for common repeated operations.
Make a member function and/or parameter const
if it does not perform modification of the object's state.
You will also need to do the following:
Add descriptive comments to PatientQueue.h/cpp. Both files should have top-of-file headers; one file should have header comments atop each member function, either the .h or .cpp; and the .cpp should have internal comments describing the details of each function's implementation.
Declare your necessary private member variable in PatientQueue.h, along with any private member functions you want to help you implement the required public behavior. Your inner data storage must be a singly linked list of patient nodes; do not use any other collections or data structures in any part of your code.
Implement the bodies of all member functions and constructors in PatientQueue.cpp.
Make member functions const
as appropriate.
Some of the member functions you will write do not modify the state of the patient queue.
For all such functions, mark them as const
at the end of their headers in the .h and .cpp files in your code.
For example, if a member named foo
doesn't modify the list, you should change its header to:
class PatientQueue { ... void foo() const; };
Other than adding const
to some headers, you should not modify the provided public member headers in any way.
Here are a few other constraints we expect you to follow in your implementation:
You should not make unnecessary passes over the linked list.
For example, when enqueuing an element, a poor implementation would be to traverse the entire list once to count its size and to find the proper index at which to insert, and then make a second traversal to get back to that spot and add the new element.
Do not make such multiple passes.
Also, keep in mind that your queue class is not allowed to store an integer size member variable; you must use the presence of a null next
pointer to figure out where the end of the list is and how long it is.
Duplicate patient names and priorities are allowed in your queue.
For example, the upgradePatient
operation should affect only a single occurrence of a patient's name (the first one found).
If there are other occurrences of that same value in the queue, a single call to upgradePatient
shouldn't affect them all.
You are not allowed to use a sort
function or library to arrange the elements of your list, nor are you allowed to create any temporary or auxiliary data structures anywhere in your code.
You must implement all behavior using only the one linked list of nodes as specified.
You will need pointers for several of your implementations, but you should not use pointers-to-pointers (for example, PatientNode**
).
If you like, you are allowed to use a reference to a pointer (e.g. PQNode*&
).
You should not create any more PatientNode
objects than necessary.
For example, if a PatientQueue
contains 6 elements, there should be exactly 6 PatientNode
objects in its internal linked list; no more, no less.
You shouldn't, say, have a seventh empty "dummy" node at the front or back of the list that serves only as a marker,
nor should you create a new PatientNode
that is just thrown away or discarded without being used as part of the linked list.
You can declare as many local variable pointers to PatientNode
s as you like.
Draw pictures: When manipulating linked lists, it is often helpful to draw pictures of the linked list before, during, and after each of the operations you perform on it. Manipulating linked lists can be tricky, but if you have a picture in front of you as you're coding it can make your job substantially easier.
List states: When processing a linked list, you should consider the following states and transitions between them in your code as you add and remove elements. You should also, for each state below, think about the effect of adding a node in the front, middle, and back of the list.
| zero nodes |
front / |
|---|---|
| one node |
+---+---+ front --> | ? | / | +---+---+ |
| N nodes |
+---+---+ +---+---+ +---+---+ +---+---+ front --> | ? | | --> | ? | |--> ... | ? | |--> | ? | / | +---+---+ +---+---+ +---+---+ +---+---+ |
As in other assignments, you should follow our Style Guide for information about expected coding style. You are also expected to follow all of the general style constraints emphasized in the Homework 1-4 specs, such as the ones about good problem decomposition, parameters, redundancy, using proper C++ idioms, and commenting. The following are additional points of emphasis and style contraints specific to this problem. (Some of these may seem overly strict or arbitrary, but we need to constrain the assignment to force you to properly practice pointers and linked lists as intended.)
Commenting: Add descriptive comments to your .h and .cpp files. Both files should have top-of-file headers. One file should have header comments atop each member function (either the .h or .cpp; your choice). The .cpp file should have internal comments describing the details of each function's implementation.
Restrictions on pointers: The whole point of this assignment is to practice pointers and linked lists. Therefore, do not declare or use any other collections in any part of your code; all data should be stored in your linked list of nodes. There are some C++ "smart pointer" libraries that manage pointers and memory automatically, allocating and freeing memory as needed; you should not use any such libraries on this assignment.
Restrictions on private member variables:
As stated previously, the only member variable (a.k.a. instance variable; private variable; field) you are allowed to have is a PatientNode*
pointer to the front of your list.
You may not have any other member variables.
Do not declare an int
for the list size.
Do not declare members that are pointers to any other nodes in the list.
Do not declare any collections or data structures as members.
Restrictions on modifying member function headers:
Please do not make modifications to the PatientQueue
class's public constructor or public member functions' names, parameter types, or return types.
Our client code should be able to call public member functions on your queue successfully without any modification.
Restrictions on creation and usage of nodes:
The only place in your code where you should be using the new
keyword is in the newPatient
function.
No other members should use new
or create new nodes under any circumstances.
You also should not be modifying or swapping nodes' name
values after they are added to the queue.
In other words, you should implement all of the linked list / patient queue operations like upgradePatient
by manipulating node pointers, not by creating entirely new nodes and not by modifying "data" of existing nodes.
You also should not create any more PatientNode
structures than necessary.
For example, if the client has called newPatient
6 times, your code should have created exactly 6 total PatientNode
objects; no more, no less.
You shouldn't, say, have a seventh empty "dummy" node at the front or back of the list that serves only as a marker, and you shouldn't accidentally create a temporary node object that is lost or thrown away.
You can declare as many local variable pointers to nodes as you like.
Restrictions on traversal of the list:
Any function that modifies your linked list should do so by traversing across your linked list a single time, not multiple times.
For example, in functions like newPatient
, do not make one traversal to find a node or place of interest and then a second traversal to manipulate/modify the list at that place.
Do the entire job in a single pass.
Do not traverse the list farther than you need to. That is to say, once you have found the node of interest, do not unnecessarily process the rest of the list; break/return out of code as needed once the work is done.
Avoiding memory leaks:
This item is listed under Style even though it is technically a functional requirement, because memory leakage is not usually visible while a program is running.
To ensure that your class does not leak memory, you must delete all of the node objects in your linked list whenever data is removed or cleared from the list.
You must also properly implement a destructor that deletes the memory used by all of the linked list nodes inside your PatientQueue
object.
For each assignment problem, we receive various frequent student questions. The answers to some of those questions can be found by clicking the link below.
For this problem, most good extra feature ideas involve adding operations to your queue beyond those specified. Here are some ideas for extra features that you could add to your program:
=
assignment statement, copy constructor, and deep copying.
Google about the C++ "Rule of Three" and follow that guideline in your implementation.
iterator
type and begin
and end
member functions in your queue, which would enable "for-each" over your PQ. This requires knowledge of the C++ STL library.
Indicating that you have done extra features: If you complete any extra features, then in the comment heading on the top of your program, please list all extra features that you worked on and where in the code they can be found (what functions, lines, etc. so that the grader can look at their code easily).
Submitting a program with extra features: Since we use automated testing for part of our grading process, it is important that you submit a program that conforms to the preceding spec, even if you want to do extra features. If your feature(s) cause your program to change the output that it produces in such a way that it no longer matches the expected sample output test cases provided, you should submit two versions of your program file: a first one with the standard file name without any extra features added (or with all necessary features disabled or commented out), and a second one whose file name has the suffix -extra.cpp with the extra features enabled. Please distinguish them in by explaining which is which in the comment header. Our turnin system saves every submission you make, so if you make multiple submissions we will be able to view all of them; your previously submitted files will not be lost or overwritten.


Evoked due to injustice, conflict, humiliation, negligence or betrayal. If anger is active, the individual attacks the target, verbally or physically. If anger is passive, the person silently sulks and feels tension and hostility.
An emotional response of revulsion to something considered offensive or unpleasant. It is a sensation that refers to something revolting.
A response to impending danger. It is a survival mechanism that is a reaction to some negative stimulus. It may be a mild caution or an extreme phobia.
Joy or happiness has shades of enjoyment, satisfaction and pleasure. There is a sense of well-being, inner peace, love, safety and contentment.
Indicates a feeling of loss and disadvantage. When a person can be observed to be quiet, less energetic and withdrawn, it may be inferred that sadness exists.
A person's reasoning and analytical attitude about things
A persons degree of certainty.
A persons degree of inhibition.
The extent a person is open to experience a variety of activities.
The tendency to act in an organized or thoughtful way.
The tendency to seek stimulation in the company of others.
The tendency to be compassionate and cooperative towards others.
The extent a person's emotion is sensitive to the environment


Look: Jorja Smith Just Won Woman Crush Wednesday W/ Steamy Jamaica Bikini Pics
by Team SOHHR&B singer Jorja Smith is warming up everyone’s Wednesday. The British crooner went online this week to share some paradise-looking pics of herself if Jamaica. Look and comment below!


We got a new Lenovo T430U yesterday and with its new SSD we discovered it boots from the BIOS to Windows 8 in three seconds.
I remember corporate machines back in the 90s taking 20 minutes to boot - so I got to thinking - is the improvement the modern hardware or the modern OS - or a combination of the two.
So in the interests of scientific enquiry I gave it a go and got the following results - all using VMware workstation on a Intel Core -5 CPU with 16G RAM. I deliberately did not use VMware tools for any of them because they are not available for the older operating systems and do tend to speed things up. I also compared this with Windows RT on my little Surface with its ARM processor and 2GB RAM, and also with the iPad, the Xbox and two different phones.
Windows 7 Professional - 20 seconds
Windows NT 4 Workstation - 18 seconds
Windows Server 2000 - 22 seconds
Windows 8 Enterprise - 6 seconds for a full restart or 4 seconds from the 'shutdown' state which is really a sort of suspend to disk.
Ubuntu Linux was very slightly longer than Windows 8 at about 7 seconds - also way faster than it used to be.
Mac Book Air 13" 2012 - 9 seconds - not bad either.
I then had a look at our other leisure type devices which are largely ARM based and noted that on the whole they were a lot slower than the Intel based stuff - though of course they don't tend to be stuff you shut down that often in the normal run of things.
Surface RT - 23 seconds
IPad 3 - 31 seconds
Nexus 7 - 46 seconds
HTC 8X (Windows Phone 8) - 37 seconds
iPhone 4S (iOS 6) - 29 seconds
Xbox 360 (IBM Xenon Power PC processor) - 41 seconds
Trouble with these devices it that it is impossible to known how much of it is the OS and how much the hardware. For example on my 8X the Windows Phone boot screen only showed for one second - the rest was all the HTC logo. I don't have my old Nokia 800 WP7 to hand - but I seem to remember that booted way quicker.
There has obviously been a huge improvement between Windows 7 and 8 and between old and new versions of Linux, but also modern hardware boots old operating systems greatly faster than you would imagine.


REGISTRATION FORM
Enter Name:
Enter Email:
Enter Password:
Enter Mobile No:
Fav Technology:
HTML
CSS
JS
BOOSTRAP
GenderFav Technology:
Male
female
Other
Select Color
Select BIRTHDATE
Select DATE & TIME
Upload Your Aadharcard
Hidden Field
Iamge Type
Select Month
Select Age
Search On
Enter TelePhone No
Select Time
Select Week
Enter Your URL