Company profile - Canadian Company Capabilities
Third-Party Information Liability Disclaimer
Some of the information on this Web page has been provided by external sources. The Government of Canada is not responsible for the accuracy, reliability or currency of the information supplied by external sources. Users wishing to rely upon this information should consult directly with the source of the information. Content provided by external sources is not subject to official languages, privacy and accessibility requirements.
Informus Inc.
Mailing Address:
2 Vista Humber Dr.ETOBICOKE, Ontario
M9P 3R7
Location Address:
2 Vista Humber Dr.ETOBICOKE, Ontario
M9P 3R7
Tel.:<PHONE_NUMBER>
Fax:
Company Profile
BUSINESS CONSULTING (COMMERCIAL RISK & DISPUTE RESOLUTION)
ART DEALER
PUBLISHING
(1) BUSINESS CONSULTING
Ian MacDonald has decades of experience in general management, sales, marketing, research, new product development, sales management, commercial risk analysis, collections, bankruptcy and project administration.
He assists corporations in:
(a) developing systems to avoid commercial risk losses.
(b) resolving disputes with suppliers, customers and government departments.
EXPERIENCE:
DUN & BRADSTREET - Credit Reporter (determined commercial risk by interviewing thousands of business owners), Reporting Supervisor (trained reporters and managed hundreds of correspondents in analyzing commercial risk), Sales Representative - Marketing Services Division (sold commercial market identifiers to sales, advertising and marketing executives) General Manager - Marketing Services Division (established, trained and organized a dynamic national sales team), General Sales Manager of All Divisions (successfully motivated a team of 100 sales reps and managers in 3 divisions in 12 offices)
CREDITEL - Ontario Regional Manager (bottom line responsibility for four offices and two hundred employees in collections, sales & administration), Senior Vice President - Credit Reporting Division (bottom line responsibility for hundreds of employees across Canada in 15 offices. Built a successful credit reporting operation that took away half of Dun & Bradstreet's market in Canada. Invented an "amazingly predictive" commercial risk scoring system.)
DRAKE / OFFICE OVERLOAD - Intercontinental Collections Limited (President of a small collection agency), Screening Systems iternational Limited (General Manager - developed a senior executive screening service)
Marketing Overload (General Manager - selling and conducting market research studies)
EQUIFAX- Vice President (responsible for the integration of the Creditel acquisition)
(2) ART DEALER
A faster, easier, inexpensive way for collectors to sell their art. To sell a painting, a current, reasonable price must first be determined . At our expense, we research and provide you with our recommended fair price.
FIRST STEP - Contact us and provide us with as much information as you can about your painting.
THE PROCESS - As soon as an agreed-to-price is determined, Informus commences marketing your painting. When Informus receives payment from a buyer, Informus then purchases the painting from you. Informus Inc. adds $500 to the "agreed-to-prices" to cover its expenses. The buyer pays this $500, not you. At any time you can ask Informus to cease marketing your painting. There are no contracts to sign. It is straightforward transaction. You get your agreed-to-price. The painting stays in your possession until the day you receive full payment for it.
(3) PUBLISHING
Our Newest Novel - MASSIVE RETALIATION
"...indeed the ending was a surprise. Massive Retaliation is a great read for all action/adventure enthusiasts that keeps you hooked from start to finish. Not unlike a James Bond adventure, there is a mix of fantasy and reality but the storyline keeps you guessing and remains perfectly plausible throughout. The author's obvious in-depth knowledge of the Caribbean means this fast paced adventure is full of many fascinating facts about the islands, their histories and their lifestyles. Highly Recommended." - Steve Carpenter, Caerphilly, Wales, U.K.
Massive Retaliation, an exciting, thought provoking, new novel by author Ian D. MacDonald.It explores what happens in the year 2020 (an election year) when the People's Republic of China challenges the super power of the United States by developing a naval base in the Eastern Caribbean island of Saint Matts. China would only intrude into American's "private lake" if they had developed a technology to render the United States powerless to stop them. Upon learning of this intrusion, the Secretary of State sends analyst, Dr. Robert Lyons, to Saint Matts to assess the situation. Lyons encounters greed, bravery, assassination, betrayal, corruption, nuclear destruction and love.
MASSIVE RETALIATION is available at:
AMAZON - www.amazon.com in both a printed book format and KINDLE electronic book format.
KOBO - electronic book format at www.kobo.com
When in these websites enter "massive retaliation ian macdonald" to locate the book.
OR GO TO THE FOLLOWING DIRECT AMAZON LINK
http://www.amazon.com/dp/B00BLGXO2I
OR ENTER IN THE ISBN#<PHONE_NUMBER>705 IN THE KINDLE SEARCH ENGINE
A review of the first chapter of the book is available at amazon.com. Excerpts from the book are provided at massive-retaliation.com along with a list of characters, information on the author, etc.
Full profile
Full profile
Contact information
Company description
541619 - Other Management Consulting Services
Product / Service / Licensing
Market profile
Alliances:
- Financial
- Technology
Industry sector market interests:
- Plastics and Rubber Products
Sector information
Classification codes
Key / Major clients:
Our clients wish to remain anonymous.Success stories:
In August 2011, Informus Inc. was given 23 oil paintings by established artists to sell for a foundation. By november half the paintings had been sold for prices between $2,500 and $9,000.Through a micromanagement organization system invented by Ian MacDonald and applied to a salary based sales force he was able to to profitably grow a customer base from 4,500 customers to 12,500 customers by taking away more than 5,000 customers from the world leader in an industry whose sales force was commission based.
Third-Party Information Liability Disclaimer
Some of the information on this Web page has been provided by external sources. The Government of Canada is not responsible for the accuracy, reliability or currency of the information supplied by external sources. Users wishing to rely upon this information should consult directly with the source of the information. Content provided by external sources is not subject to official languages, privacy and accessibility requirements.
Contacts
Contact information
Description
Company description
541619 - Other Management Consulting Services
Products, services and licensing
Product / Service / Licensing
Market
Market profile
Alliances:
- Financial
- Technology
Industry sector market interests:
- Plastics and Rubber Products
Sector
Sector information
Classification codes
Key / Major clients:
Our clients wish to remain anonymous.Success stories:
In August 2011, Informus Inc. was given 23 oil paintings by established artists to sell for a foundation. By november half the paintings had been sold for prices between $2,500 and $9,000.Through a micromanagement organization system invented by Ian MacDonald and applied to a salary based sales force he was able to to profitably grow a customer base from 4,500 customers to 12,500 customers by taking away more than 5,000 customers from the world leader in an industry whose sales force was commission based.


A simple user operation will usually involve all three types of objects. For example, suppose the user selects the Open trigger from the File menu. The following actions will be taken:
MSG_GEN_DOCUMENT_CONTROL_INITIATE_OPEN_DOC
to the GenDocumentControl object. The GenDocumentControl object responds by displaying a file selector.
MSG_GEN_DOCUMENT_GROUP_OPEN_DOC
to the GenDocumentGroup, passing the name and path of the file to open.
GenDocumentClass
or of a programmer-specified class. The GenDocumentGroup object sends a
MSG_GEN_DOCUMENT_OPEN
to the document object, passing the file and path name to be opened.
Most of these steps are transparent to the application programmer. Typically, an application will intercept
MSG_GEN_DOCUMENT_INITIALIZE_DOCUMENT_FILE
; the programmer needs only to write this handler, not all the code needed for the above steps.


{% include "ga.html" %}
Please wait ...
×
Modal Header
Some text in the modal.
×
Share the visualization using the current URL:
×
Save a snapshot of the visualization:
{% include 'config.html' %}


|
LEAN Production System Design
- Identified 7 types of waste within a production cell along with possible countermeasures to reduce waste
- Collaborated with team members to form 8 design rationale that improved the cell layout and material flow
- Decreased the number of operators needed from 5 to 4
|
Business Card Holder Design
- Developed 12 engineering characteristics from customer requirements
- Integrated features of prototypes from each person on the team to form the final product
|
FAQ Chatbot
- Utilized 5 frequently asked questions from the ISEN department’s website for chatbot development
- Designed the chatbot to answer questions appropriately with conversational flow
- Planned out 27 different user interactions
- Documented test chat sessions and modified design when improvement was possible
|
Lifting Task Evaluation
- Observed a worker lifting a box and recorded data for analysis
- Computed the recommended weight limit and the risk of lower back injury
- Provided 2 recommendations to lower the risk of injury with a lifting index after applying each one
- Illustrated how each recommendation would change the task
|


User registers with a new yubikey.
User signs in with same username and password, confirms with yubikey.


To access your render click here: powered by upload.farm
Object Count
Controls:
E to easily select eraser brush, press again to restore last brush
S to easily select selector brush, press again to restore last brush
W to toggle highlights temporarily (If you hold W and hover mouse to dropdowns it might break. Just toggle highlights in the highlight menu to fix for now)
Esc discards picked up building
To delete buildings, either drop it to non-buildable area, click on it with eraser or press either Del or fn+Backspace or Esc
Hold ⌘ or Ctrl or Shift when placing buildings to "duplicate" it.
If you need to scroll the editor and can't see the horizontal scrollbar, use middle mouse button
You can enable brush overwriting mode in options
You can open object counter window from the options menu
You can find your save game file from %AppData%/StardewValley/Saves
When you press save, your farm layout is saved and page will be reloaded to confirm the save. You can then use the url to link to your farm (or bookmark it)
3. Does this work on touch devices (tablets, phones)?
Current version does not officially support touch devices yet but it is planned for future.


| |
| Name: | | Nor Solution |
| |
| Version: | | <IP_ADDRESS> [] |
| |
| Publisher: | | nor-gate |
| |
| Installation Issue Alternative: | | Uninstall App |
| |
| Installation Issue Alternative: | | rundll32 dfshim CleanOnlineAppCache |
| |
| The following prerequisites are required: |
| |
- Microsoft .NET Framework 4.5.2 (x86 and x64)
|
|
If these components are already installed, you can launch the application now. Otherwise, click the button below to install the prerequisites and run the application.
|
| |
|
|


This is a second page, returning the previous page (where counter existed) it will be displayed at original time.
If time has passed since leaving the page, the div will be displayed up return.


Judges 5:22
Then were the horsehoofs broken by the means of the pransings, the pransings of their mighty ones.


System Architect Symbol details for "Phenomenon Or Qualifier"
Activity State (Class)
- Description:
"Activity" in a state which it is currently or has been previously.
- Comment:
Note that there are both subtypes (comprising all the possible states) and a "power type" of
"Activity State Type". The latter's contents are identical to the subtypes; it exists in order to
control topics such as access and permission to amend.
focus for qualification (Association)
- From Class:
"Phenomenon Or Qualifier"
- To Class:
"Phenomenon Qualifier"
- From Class:
"Phenomenon Or Qualifier"
- To Class:
"Phenomenon Qualifier"
Phenomenon Or Qualifier (Class)
- Description:
"Subject Phenomenon" or "Phenomenon Qualifier" extending knowledge about a "Subject".
Phenomenon Qualifier (Class)
- Description:
Extension or modification of a "Subject Phenomenon" or another "Phenomenon Qualifier".
PhOQ/Direction (Generalization Node)
- Base Class:
"Phenomenon Or Qualifier"
- Definitions Used:
-
Phenomenon Or Qualifier (Class)
recorder (Association)
- From Class:
"Activity State"
- To Class:
"Phenomenon Or Qualifier"
- From Class:
"Activity State"
- To Class:
"Phenomenon Or Qualifier"
reporter (Association)
- From Class:
"Activity State"
- To Class:
"Phenomenon Or Qualifier"
- From Class:
"Activity State"
- To Class:
"Phenomenon Or Qualifier"
Subject Phenomenon (Class)
- Description:
Fact or event, related to a "Subject", that appears or is perceived by one of the senses or by the
mind.


TileMan+Tirex: new alternative for Tile Service
FOSS4G 2013/Tokyo
Hiroshi Miura(@miurahr)
OpenStreetMap Foundation Japan
github.com/osmfj/tileman
Realize simple tile CDN for Japan
Utilize cloud server sponsord by GMO Internet
Starting local tile service
Feature to help adoption in public sector
Map design to familiar local users
Flexible
Distributed tile server frontend
http://osmfj.github.io/tileman
Non-fledged Tile Serving Manager
It makes Tirex to different
Just started in March, 2013. and now v1.3 and soon v1.4.
Powerful load control and direction
by requested tiles geometory.
by client address, city, country
by requested browser version
Border dispute Island between Korea and Japan.
From IP Address Korean, From IP Address Japan
OSMF Japan serves Japan tiles: tile.openstreetmap.jp
Act as cache server for other tiles than Japan
Dynamic boarder display control
Serving live tiles around Japan
render-ahead feature enabled
Uubntu PPA at launchpad.net/~osmjapan
Vagrant support (one line command build server)
Typical Servers configuration
Extensive servers configuration
Web Application Server
high-performance & 10K+ connections
Lua programming language
backends: MySQL, PostgreSQL, Memcached, and Redis
nginx.org: high performance http server
World 2nd http server (12.3% of active site)
Asynchronous architecture, event driven
Low memory foot print, CPU usage
lua.org
Scripting language born in Brazil in 1992
Simple procedural syntax/tileman_software_stack.png
powerful data description
Dynamic variable type
Register-based virtual machine
Automatic memory management
Tirex: pronounce "Ti-rex"
the tile server suite
designed for OpenStreetMap
powered by Perl
multiple backend: mapnik, mapserver, et. al.
parallel rendering
Help create/import/update postgis DB from planet data
Expire old tile using powerful Tirex-batch
Vagrant script for automate configution .
mod_tile/renderd protocol support
Lightweight Vector tile service
Automation support
Ideas, suggestion and participation are welcome!
tile-serving ML or github.com/osmfj/tileman
You can reach this presentation at https://miurahr.github.io/
Tile Server supported by GMO Internet group.
Use a spacebar or arrow keys to navigate


Moles that can turn into cancer (malignant melanoma) may be raised, like regular moles, or flush with the skin surface, like large, dark freckles. They often begin as an abnormal growth of pigment cells, which then darken with exposure to the sun. Pigmented lesions on the pads of the hands and soles of the feet (more commonly seen in African Americans), and dark streaks under the fingernails or toenails can also be signs of melanoma. There is even a rare type of melanoma that has no pigment.
If you have a mole or moles with any of the following features (which suggest they are cancerous), see your doctor or a dermatologist right away:
The incidence of malignant melanomas is increasing in the population at large. They are most prevalent in adults over thirty years of age and are actually the most common cancer in people who are between twenty-five and thirty-five. The following increase your risk of developing this cancer:
Monitor your moles on a regular basis, including those in the genital area, where changes are often missed (the use of a mirror may be helpful). Avoid tanning beds. If you are at a high risk of developing a malignant melanoma, your dermatologist or primary care doctor should assist you in monitoring your moles. If you detect a suspicious mole, see your doctor or dermatologist as soon as possible so that it can be removed early and examined under a microscope. A simple removal of the mole is all that is necessary if it is less than .75 millimeters and without special features as seen under the microscope by a pathologist. If there is a need for further surgery, consider getting a thorough evaluation by someone who specializes in melanoma treatment.
Try to preempt this problem by using sun protection routinely after six months of age. The UVB sun protection factor should be SPF 30 or greater, and the container should indicate that both UVB and UVA light are blocked. (Also see Appendix C, for routine screening information.)
If you have spent lots of time in the sun, and have developed a round, pearly bump on your face, you may have a skin cancer known as basal cell carcinoma. The face, like other areas of the skin exposed to sunlight, is a common site for this type of tumor. Basal cell cancers are usually slow-growing and do not spread, but there are exceptions. Basal cell carcinomas are most often diagnosed in people forty years of age and older. However, they can also be found in people as young as in their twenties. Albinos are particularly at risk of getting this skin condition.
A diagnosis is made when your doctor cuts off a slice of the bump and inspects it under a microscope. Surgical removal can usually cure this condition. If you suspect you may have skin cancer, do not wait. See your physician early.
In the unusual, inherited condition called Peutz-Jeghers syndrome, freckles occur on the lips and on the inside of the mouth. They may be present at birth, develop over time, or even disappear over time. It is important to determine whether they are associated with dangerous polyps (growths) in the intestines.
If you have freckles that follow this pattern, an evaluation by a doctor may be appropriate to find and remove any polyps. This may help you to avoid intestinal bleeding and to prevent cancerous growths. Sometimes the polyps may already be malignant, in which case early surgical removal can be curative.
Let your doctor know if you have this warning signal, especially if you have a family member who has had cancer of the colon. (See Tip 226 for more information on this disorder in children.)
The deposit or plaque will usually be oblong in shape rather than round like a cyst, and will be about a quarter of an inch wide. If you have one of these, it will usually not cause you any discomfort. The plaque is inside of your skin, though, so you will not be able to remove it by squeezing out its contents.
The plaque is probably a fatty deposit, and as such, it may be a warning sign that you have a dangerously high blood cholesterol and/or triglyceride level. The cholesterol can invade the wall of an artery, eventually resulting in total blockage of the vital blood vessels that provide nourishment to the heart or brain, causing a heart attack or stroke.
These yellow, cheesy-looking plaques are a warning message that you should heed. See your doctor and have your blood checked for cholesterol and other fats. Plaques can be removed for cosmetic reasons, but they may recur, unless the underlying problems are resolved. Most importantly, high cholesterol and other fat levels in the blood should be lowered with diet and/or medicines. (See Tip 174 for more information on an elevated cholesterol level, especially in senior citizens. Also see Appendix C, for information on cholesterol screenings.)


About This Site
This is an attempt to collect, share and test the lessons delivered in Diploma in IT course started in January 2018. The said course is conducted in Kulhudhuffushi campus of MI College. I will also be uploading materials provided by the lecturers, as is (if I get time). I hope my classmates will benefit from this.
Course Intro
Download Intro PresentationSemester 1
- Building Next Generation Websites
- Web Page Development Using Adobe Dreamweaver CS
- Computer Statistics
- Photoshop
- eProject(Website Development)
Semester 2
- Database Management
- Effective Communication Skills
- Hardware and Networking
- Programming Logic and Practices
- eProject(RDBMS)


All meta information goes in the head section...View the page source (Ctrl + U) to see the meta tags


Maritime Bulletin Daily Nov 02 – 03
by Mikhail VoytenkoAccidents
• Freighter attacked in Gulf of Guinea, 9 crew kidnapped
• Italian Aframax tanker Master medevac, France
• Aground and Not Under Command vessels Worldwide Alerts (2 ships)
Details only for subscribers.
Annual subscription $750. For annual subscription, contact<EMAIL_ADDRESS>Subscribe if you want to receive accidents news ASAP and in full.


#include <SFML/Audio/Export.h>
#include <SFML/Audio/Types.h>
#include <SFML/System/InputStream.h>
#include <SFML/System/Time.h>
#include <stddef.h>
Go to the source code of this file.
Functions | |
| CSFML_AUDIO_API sfSoundBuffer * | sfSoundBuffer_createFromFile (const char *filename) |
| Create a new sound buffer and load it from a file. More... | |
| CSFML_AUDIO_API sfSoundBuffer * | sfSoundBuffer_createFromMemory (const void *data, size_t sizeInBytes) |
| Create a new sound buffer and load it from a file in memory. More... | |
| CSFML_AUDIO_API sfSoundBuffer * | sfSoundBuffer_createFromStream (sfInputStream *stream) |
| Create a new sound buffer and load it from a custom stream. More... | |
| CSFML_AUDIO_API sfSoundBuffer * | sfSoundBuffer_createFromSamples (const sfInt16 *samples, sfUint64 sampleCount, unsigned int channelCount, unsigned int sampleRate) |
| Create a new sound buffer and load it from an array of samples in memory. More... | |
| CSFML_AUDIO_API sfSoundBuffer * | sfSoundBuffer_copy (const sfSoundBuffer *soundBuffer) |
| Create a new sound buffer by copying an existing one. More... | |
| CSFML_AUDIO_API void | sfSoundBuffer_destroy (sfSoundBuffer *soundBuffer) |
| Destroy a sound buffer. More... | |
| CSFML_AUDIO_API sfBool | sfSoundBuffer_saveToFile (const sfSoundBuffer *soundBuffer, const char *filename) |
| Save a sound buffer to an audio file. More... | |
| CSFML_AUDIO_API const sfInt16 * | sfSoundBuffer_getSamples (const sfSoundBuffer *soundBuffer) |
| Get the array of audio samples stored in a sound buffer. More... | |
| CSFML_AUDIO_API sfUint64 | sfSoundBuffer_getSampleCount (const sfSoundBuffer *soundBuffer) |
| Get the number of samples stored in a sound buffer. More... | |
| CSFML_AUDIO_API unsigned int | sfSoundBuffer_getSampleRate (const sfSoundBuffer *soundBuffer) |
| Get the sample rate of a sound buffer. More... | |
| CSFML_AUDIO_API unsigned int | sfSoundBuffer_getChannelCount (const sfSoundBuffer *soundBuffer) |
| Get the number of channels used by a sound buffer. More... | |
| CSFML_AUDIO_API sfTime | sfSoundBuffer_getDuration (const sfSoundBuffer *soundBuffer) |
| Get the total duration of a sound buffer. More... | |
| CSFML_AUDIO_API sfSoundBuffer* sfSoundBuffer_copy | ( | const sfSoundBuffer * | soundBuffer | ) |
Create a new sound buffer by copying an existing one.
| soundBuffer | Sound buffer to copy |
| CSFML_AUDIO_API sfSoundBuffer* sfSoundBuffer_createFromFile | ( | const char * | filename | ) |
Create a new sound buffer and load it from a file.
Here is a complete list of all the supported audio formats: ogg, wav, flac, aiff, au, raw, paf, svx, nist, voc, ircam, w64, mat4, mat5 pvf, htk, sds, avr, sd2, caf, wve, mpc2k, rf64.
| filename | Path of the sound file to load |
| CSFML_AUDIO_API sfSoundBuffer* sfSoundBuffer_createFromMemory | ( | const void * | data, |
| size_t | sizeInBytes | ||
| ) |
Create a new sound buffer and load it from a file in memory.
Here is a complete list of all the supported audio formats: ogg, wav, flac, aiff, au, raw, paf, svx, nist, voc, ircam, w64, mat4, mat5 pvf, htk, sds, avr, sd2, caf, wve, mpc2k, rf64.
| data | Pointer to the file data in memory |
| sizeInBytes | Size of the data to load, in bytes |
| CSFML_AUDIO_API sfSoundBuffer* sfSoundBuffer_createFromSamples | ( | const sfInt16 * | samples, |
| sfUint64 | sampleCount, | ||
| unsigned int | channelCount, | ||
| unsigned int | sampleRate | ||
| ) |
Create a new sound buffer and load it from an array of samples in memory.
The assumed format of the audio samples is 16 bits signed integer (sfInt16).
| samples | Pointer to the array of samples in memory |
| sampleCount | Number of samples in the array |
| channelCount | Number of channels (1 = mono, 2 = stereo, ...) |
| sampleRate | Sample rate (number of samples to play per second) |
| CSFML_AUDIO_API sfSoundBuffer* sfSoundBuffer_createFromStream | ( | sfInputStream * | stream | ) |
Create a new sound buffer and load it from a custom stream.
Here is a complete list of all the supported audio formats: ogg, wav, flac, aiff, au, raw, paf, svx, nist, voc, ircam, w64, mat4, mat5 pvf, htk, sds, avr, sd2, caf, wve, mpc2k, rf64.
| stream | Source stream to read from |
| CSFML_AUDIO_API void sfSoundBuffer_destroy | ( | sfSoundBuffer * | soundBuffer | ) |
Destroy a sound buffer.
| soundBuffer | Sound buffer to destroy |
| CSFML_AUDIO_API unsigned int sfSoundBuffer_getChannelCount | ( | const sfSoundBuffer * | soundBuffer | ) |
Get the number of channels used by a sound buffer.
If the sound is mono then the number of channels will be 1, 2 for stereo, etc.
| soundBuffer | Sound buffer object |
| CSFML_AUDIO_API sfTime sfSoundBuffer_getDuration | ( | const sfSoundBuffer * | soundBuffer | ) |
Get the total duration of a sound buffer.
| soundBuffer | Sound buffer object |
| CSFML_AUDIO_API sfUint64 sfSoundBuffer_getSampleCount | ( | const sfSoundBuffer * | soundBuffer | ) |
Get the number of samples stored in a sound buffer.
The array of samples can be accessed with the sfSoundBuffer_getSamples function.
| soundBuffer | Sound buffer object |
| CSFML_AUDIO_API unsigned int sfSoundBuffer_getSampleRate | ( | const sfSoundBuffer * | soundBuffer | ) |
Get the sample rate of a sound buffer.
The sample rate is the number of samples played per second. The higher, the better the quality (for example, 44100 samples/s is CD quality).
| soundBuffer | Sound buffer object |
| CSFML_AUDIO_API const sfInt16* sfSoundBuffer_getSamples | ( | const sfSoundBuffer * | soundBuffer | ) |
Get the array of audio samples stored in a sound buffer.
The format of the returned samples is 16 bits signed integer (sfInt16). The total number of samples in this array is given by the sfSoundBuffer_getSampleCount function.
| soundBuffer | Sound buffer object |
| CSFML_AUDIO_API sfBool sfSoundBuffer_saveToFile | ( | const sfSoundBuffer * | soundBuffer, |
| const char * | filename | ||
| ) |
Save a sound buffer to an audio file.
Here is a complete list of all the supported audio formats: ogg, wav, flac, aiff, au, raw, paf, svx, nist, voc, ircam, w64, mat4, mat5 pvf, htk, sds, avr, sd2, caf, wve, mpc2k, rf64.
| soundBuffer | Sound buffer object |
| filename | Path of the sound file to write |


@inproceedings{sekar2017condorcet, title = {Condorcet Consistent Bundling with Social Choice}, author = {Sekar, Shreyas and Sikdar, Sujoy and Lirong Xia}, booktitle = {Proceedings of the 2017 International Conference on Autonomous Agents and Multiagent Systems}, year = {2017} organization = {International Foundation for Autonomous Agents and Multiagent Systems} }
@inproceedings{sikdar2017optimal, title = {Optimal Decision Making with CP-nets and PCP-nets}, author = {Sikdar, Sujoy and Adal{\i}, Sibel and Lirong Xia}, booktitle = {Proceedings of the 2017 International Conference on Autonomous Agents and Multiagent Systems}, year = {2017} organization = {International Foundation for Autonomous Agents and Multiagent Systems} }
@inproceedings{sikdar2017mechanism, title = {Mechanism Design for Multi-Type Housing Market}, author = {Sikdar, Sujoy and Adal{\i}, Sibel and Lirong Xia}, booktitle = {Proceedings of the 31st AAAI Conference on Artificial Intelligence (AAAI-17)}, year = {2017} organization = {AAAI} }
@inproceedings{sikdar2014finding, title = {Finding true and credible information on Twitter}, author = {Sikdar, Sujoy and Adal{\i}, Sibel and Amin, Md. Tanvir and Abdelzaher, Tarek and Chan, Kevin and Cho, Jin-Hee and Kang, Byungkyu and O'Donovan, John}, booktitle = {Information Fusion (FUSION), 2014 17th International Conference on}, pages = {1--8}, year = {2014}, organization = {IEEE} }
@article{sikdar2013cutting, title = {Cutting Through the Noise: Defining Ground Truth in Information Credibility on Twitter}, author = {Sikdar, Sujoy Kumar and Kang, Byungkyu and O'Donovan, John and Hollerer, Tobias and Adal{\i}, Sibel}, journal = {HUMAN}, volume = {2}, number = {3}, pages = {pp--151}, year = {2013} }
@inproceedings{sikdar2013understanding, title = {Understanding information credibility on twitter}, author = {Sikdar, Sujoy and Kang, Byungkyu and O'Donovan, John and Hollerer, Tobias and Adal{\i}, Sibel}, booktitle = {Social Computing (SocialCom), 2013 International Conference on}, pages = {19--24}, year = {2013}, organization = {IEEE} }
This file was generated by bibtex2html 1.95.


As of version 1.0.0, I consider this module complete. I will continue to
suppport it and look for useful features to add, but right now I don't see any.
- Current – 1.0.4 (13 Feb 2018) –
- Fixed bug where the SharedMemory and Semaphore classes
didn't behave correctly when assigned a file descriptor of 0. Thanks to
Thomas Troeger for the bug report.
- Fixed a small but significant documentation bug which stated that the size param was ignored when opening
an existing SharedMemory segment. Thanks to Thomas Troeger, again.
- Fixed a compilation failure under Python 3 when the internal use POSIX_IPC_DEBUG
flag was on. Děkuji to Tomáš Zahradnický for the bug report.
- 1.0.3 (10 Jan 2018) –
A mea culpa release to clean up some accumulated technical debt.
- Moved repository to git and GitHub.
- Changed link options in the build script for the first demo that caused a build fail on some (all?) Linuxes.
- Fix a few bugs where functions that were documented to accept keyword arguments only accepted them as positional arguments; added tests to exercise keyword arguments.
- Removed dependency on setuptools from setup.py.
- Added code to semaphore tests to avoid triggering a bug on older FreeBSDs (and perhaps other BSDs).
- PEP8 improvements.
- 1.0.2 (10 Jan 2018) –
This version was also skipped due to a release error. Those responsible for sacking the people who have just been sacked, have been sacked.
- 1.0.1 (10 Jan 2018) –
This version was skipped due to a release error. Those responsible have been sacked.
- 1.0.0 (11 Mar 2015) –
- Added ability to pass names as unicode in Python 2.
- Added ability to pass names as bytes in Python 3.
- Dropped support for Python < 2.7.
- Made unit tests nicer by taking advantage of Python 2.7+
certainty and removed some code that only supported Python 2.6.
- 0.9.9 (14 Nov 2014) –
- Added the ability to build on platforms that don't support the
POSIX Realtime Signals Extension. ありがとう to Takashi Yamamoto for
the patch.
- Added extensive unit tests.
- Minor documentation updates.
- 0.9.8 (20 Feb 2014) –
As with 0.9.7, there are no code or feature changes in this version.
This version merely corrects a documentation error.
This version comes with a big wish for peace in Ukraine. Мир!
- 0.9.7 (20 Feb 2014) –
There are no code or feature changes in this version. The bump in
version number reflects that this is the first version
also available on PyPI.
This version comes with a big wish for peace in Ukraine. Мир!
- 0.9.6 (23 Oct 2013) –
Fixed two BSD-specific bugs introduced in version 0.9.5
that occurred if the kernel module mqueuefs wasn't
loaded at install time. Specifically --
- The installer
would print a harmless but distracting error message from sysctl.
(This also affected OS X which is FreeBSD-ish.)
- posix_ipc would build with an inappropriate
value for QUEUE_MESSAGES_MAX_DEFAULT.
Subsequent attempts to create a message queue would fail unless the
caller set the max_messages param to an appropriate
value. (This didn't affect OS X since OS X doesn't support message
queues at all.)
Also, rewrote the message queue thread notification code to address
the old bug (Fatal Python error: PyEval_AcquireLock: current thread state is NULL)
that appeared during release testing for 0.9.5 and which
has plagued me on and off since I wrote this code. The new code uses
the
algorithm recommended in the Python documentation which may have
been flaky when I started using it in Python 2.4. It seems stable now
under Python 2.6+/3.
- 0.9.5 (14 Oct 2013) –
- Added the ability to use Semaphores in context managers.
Thanks to Matt Ruffalo for the suggestion and patch.
- Fixed a big under FreeBSD 9.x where I used overly ambitious
values for some message queue constants at build time. Now,
posix_ipc asks sysctl for the correct values.
Köszönöm to Attila Nagy for the bug report.
- 0.9.4 (2 Sept 2012) –
Fixed a buglet. When creating shared memory under Linux and
specifying both a size and the read-only flag, creating the memory
would succeed but calling ftruncate() would fail.
The failure to change the size was correctly reported
but posix_ipc failed to clean up the shared memory segment
it had created. That's now fixed. Thanks to Kevin Miles for the bug
report.
- 0.9.3 (2 Jan 2012) –
Added a bugfix/feature to raise an error (rather than segault)
when trying to use a closed semaphore.
Thanks to Russel for the suggestion and patch.
- 0.9.2 (6 Nov 2011) –
- Fixed a bug where timeouts in Semaphore.acquire(),
MessageQueue.send() and MessageQueue.receive()
were only accurate to about one second due to use of the C call
time(). Switching to gettimeofday() fixes
the problem. Thanks to Douglas Young for the bug report and
patch.
- Fixed a bug in prober.py that caused install to fail
under Ubuntu 11.10. prober.py specified link options
in the wrong order, and so linking one of the test
applications that's built during setup was failing. Thanks
to Kevin Miles for the bug report.
- Added a check in prober.py to see if
sysconf_names exists in the os module. It
doesn't exist under Cygwin, and this code caused an error
on that platform. Thanks to Rizwan Raza for the bug report.
- 0.9.1 (7 Apr 2011) –
- Fixed (?) a bug in message queue thread notification that caused
ceval: tstate mix-up and other fun messages. Thanks to
Lev Maximov for the bug report.
- Added the demo3 directory with demos of message queue.
This was supposed be included in version 0.9.0 but I accidentally
left it out. (Also reported by Lev.)
- 0.9.0 (31 Dec 2010) –
Added the demo3 directory with demos of message queue
notification techniques. Also, fixed two bugs related to message
queue notification. Big thanks to
Philip D. Bober for debugging and providing a patch to the
most difficult part of the code. The bugs were –
- First, the series of calls to set up the Python thread in
process_notification() were simply wrong. They worked
some (most?) of the time but would segfault eventually because
I was creating a Python thread state when I should not have.
- Second, the code in process_notification() failed
to consider that the user's callback might re-request
notification, thus overwriting pointers that I would later
decref. process_notification() is now thread-safe.
- 0.8.1 (15 Mar 2010) –
Fixed a sloppy declaration that caused a compile error under
Cygwin 1.7.1. Thanks to Jill McCutcheon for the bug report.
- 0.8.0 (2 Mar 2010) –
- Fixed message queue support detection in FreeBSD and
the platform-specific documentation about FreeBSD.
- Rearranged the documentation and split the history
(which you're reading now) into a separate file.
- I fixed two small bugs related to the confusing
message queue constants. The bugs and associated changes are
explained below. The explanation is really long not
because the changes were big (they weren't), but because
they and rationale behind them are subtle.
Fixing these bugs was made easier by this realization:
on all of the systems to which I have access that implement
message queues (FreeBSD, OpenSolaris, Linux, and Windows +
Cygwin), all except Linux implement them as
memory-mapped files or something similar. On these
non-Linux systems, the
maximum queue message count and size are pretty darn big
(LONG_MAX). Therefore, only on Linux is anyone likely to
encounter limits to message queue size and content.
The first bug I fixed was related to four message queue
constants mentioned in posix_ipc documentation:
QUEUE_MESSAGES_MAX,
QUEUE_MESSAGES_MAX_DEFAULT,
QUEUE_MESSAGE_SIZE_MAX and
QUEUE_MESSAGE_SIZE_MAX_DEFAULT. All four were defined
in the C
code, but the two XXX_DEFAULT constants weren't exposed on
the Python side.
The second bug was that under Linux, QUEUE_MESSAGES_MAX and
QUEUE_MESSAGE_SIZE_MAX were permanently fixed to their
values at posix_ipc's compile/install time even if the
relevant system values changed later. Thanks to Kyle Tippetts
for bringing this to my attention.
QUEUE_MESSAGES_MAX_DEFAULT was arbitrarily limited to
(at most) 1024. This wasn't a bug, just a bad choice.
I made a few changes in order to fix these problems –
- The constants QUEUE_MESSAGES_MAX and
QUEUE_MESSAGE_SIZE_MAX
have been deleted since they were only sure to
be accurate on systems where they were irrelevant. Furthermore,
Linux (the only place where they matter) exposes these values
through the file system (in
/proc/sys/fs/mqueue/msg_max and
/proc/sys/fs/mqueue/msgsize_max respectively) so Python
apps that need them can read them without any help
from posix_ipc.
- QUEUE_MESSAGES_MAX_DEFAULT and
QUEUE_MESSAGE_SIZE_MAX_DEFAULT are now exposed to
Python as they should have been all along.
QUEUE_MESSAGES_MAX_DEFAULT is now set to
LONG_MAX on all platforms except Linux, where
it's set at compile time from /proc/sys/fs/mqueue/msg_max.
- QUEUE_MESSAGE_SIZE_MAX_DEFAULT remains at the fairly
arbitrary value of 8k. It's not a good idea to make it too big
since a buffer of this size is allocated every time
MessageQueue.receive() is called. Under Linux, I
check the contents of /proc/sys/fs/mqueue/msgsize_max
and make QUEUE_MESSAGE_SIZE_MAX_DEFAULT smaller if
necessary.
- 0.7.0 (21 Feb 2010) –
Added Python 3.1 support.
- 0.6.3 (15 Feb 2009) –
- 0.6.2 (30 Dec 2009) –
Fixed a bug where a MessageQueue's mode
attribute returned garbage. Grazie to Stefano Debenedetti for
the bug report.
- 0.6.1 (29 Nov 2009) –
There were no functional changes to the module in this version, but
I added the convenience function close_fd() and fixed
some docmentation and demo bugs/sloppiness.
- Added the convenience function SharedMemory.close_fd().
Thanks to Kyle Tippetts for pointing out the usefulness
of this.
- Added the module attributes __version__,
__copyright__, __author__ and
__license__.
- Fixed the license info embedded in posix_ipc_module.c
which was still referring to GPL.
- Replaced file() in setup.py with
open()/close().
- Demo changes –
- Made the demo a bit faster, especially for large
shared memory chunks. Thanks to Andrew Trevorrow
for the suggestion and patch.
- Fixed a bug in premise.c; it wasn't closing the semaphore.
- Fixed a bug in premise.py; it wasn't closing the
shared memory's file descriptor.
- Fixed bugs in conclusion.py; it wasn't closing the
shared memory's file descriptor, the semaphore or
the mapfile.
- 0.6 (5 Oct 2009) –
- Relicensed from the GPL to a BSD license to celebrate the
one year anniversary of this module.
- Updated Cygwin info.
- 0.5.5 (17 Sept 2009) –
- Set MQ_MAX_MESSAGES and MQ_MAX_MESSAGE_SIZE to
LONG_MAX under cygwin.
(Danke to René Liebscher.)
- Surrounded the #define PAGE_SIZE in probe_results.h with
#ifndef/#endif because it is already defined on some systems.
(Danke to René Liebscher, again.)
- Minor documentation changes.
- 0.5.4 (21 Jun 2009) –
- 0.5.3 (8 Mar 2009) –
- Added automatic generation of names.
- Changed status to beta.
- 0.5.2 (12 Feb 2009) –
- Fixed a memory leak in MessageQueue.receive().
- Fixed a bug where the name of the MessageQueue
current_messages attribute didn't match the name
given in the documentation.
- Added the VERSION attribute to the module.
- Fixed a documentation bug that said message queue
notifications were not yet supported.
- 0.5.1 (8 Feb 2009) –
- Fixed outdated info in setup.py that was showing up
in the Python package index. Updated README while I
was at it.
- 0.5 (8 Feb 2009) –
- Added the message queue notification feature.
- Added a mode attribute to each type.
- Added str() and repr() support to
each object.
- Added a demo for message queues.
- Fixed some minor documentation problems and added
some information (esp. about Windows + Cygwin).
- 0.4 (9 Jan 2009) –
- Added message queue support.
- Fixed the poor choices I'd made for names for classes and
errors by removing the leading "Posix" and "PosixIpc".
- Simplified the prober and expanded it (for message
queue support).
- Cleaned up this documentation.
- 0.3.2 (4 Jan 2009) –
- Fixed an uninitialized value passed to PyMem_Free() when
invalid params were passed to either constructor.
- 0.3.1 (1 Jan 2009) –
- Fixed a big bug where the custom exceptions defined by this
module weren't visible.
- Fixed a compile complaint about the redefinition of
SEM_VALUE_MAX on Linux (Ubuntu) that I introduced
in the previous version.
- Fixed a bug in the demo program premise.c where I wasn't
closing the file descriptor associated with the shared
memory.
- Added the PAGE_SIZE attribute. This was already
available in the mmap module that you need to use shared
memory anyway, but adding it makes the interface more
consistent with the sysv_ipc module.
- 0.3 (19 Dec 2008) –
- Added informative custom errors instead of raising
OSError when something goes wrong.
- Made the code friendly to multi-threaded applications.
- Added the constants O_CREX and
SEMAPHORE_VALUE_MAX.
- Added code to prohibit negative timeout values.
- 0.2 (4 Dec 2008) –
- Removed the un-Pythonic try_acquire() method. The
same functionality is now available by passing a timeout of
0 to the .acquire() method.
- Renamed the module constant ACQUIRE_TIMEOUT_SUPPORTED to
SEMAPHORE_TIMEOUT_SUPPORTED.
- Moved the demo code into its own directory and added C
versions of the Python scripts. The parameters are now in a
text file shared by the Python and C program, so you can
run the C version of Mrs. Premise and have it communicate with
the Python version of Mrs. Conclusion and vice versa.
- 0.1 (9 Oct 2008) – Original (alpha) version.


Lost Child Process Guide
Lost Child Procedures
Step 1
- Security immediately moves to designated exit points:
- Circle area
- Main parking lot exit
- Hotel parking exit
- Ski Patrol / Mountain Safety immediately moves to designated exit points:
- Ski patrol ambulance exit (gate near Alpine lift)
- Backside gate exit
- Whitney's Way cut-over to Boulder Ridge parking lot
- Lift Ops supervisor to notify each lift station
- Operators post message and start looking for child
Step 2:
- The designated staff member (with a radio) will proceed with the reporting person to the area where the child was last seen.
Step 3:
If child was skiing/snowboarding
- The designated staff member should wait with the reporting person at the bottom of the last slope the child was skiing.
- Direct the patrol dispatcher to notify all on-snow patrollers and mountain safety.
- Identify and void the lost persons lift ticket.
If child was NOT skiing/snowboarding
- The designated staff member will do a cursory search the are where the child was last seen.
- Direct Courtesy staff to start a Facilities search of the all indoor public locations.
- Direct Lodge Maintenance to check restrooms - (Lodge maintenance) Radio Channel 10
- If child was previously skiing, check the racks for the child's skis.
- Direct Security to check the reporting persons vehicle - (Security) radio channel 1.
Step 4 (if child is not found within one hour):
- Notify the General Manager, Risk Manager or MOD
- Full area search and patrol sweep (Patrol Supervisor) Radio Ch-2
- Call other family or friends
Lost Parent Procedure
When a child reports a lost parent, a staff member will accompany the child on a search of the immediate area. Then escort the child to guest services.


In the Cartesian coordinates, a point is described by its coordinates (x,y,z), which, in the vector form, is written as
|
| (74) |
where r is the location vector of the point; , , and are the basis vectors of the Cartesian coordinates, which are constant, independent of spactial location. The transformation between the Cartesian coordinates system, (x,y,z), and a general coordinates system, (x1,x2,x3), can be expressed as
|
| (75) |
For example, cylindrical coordinates (R,ϕ,Z) can be considered as a general coordinate systems, which are deﬁned by r = R cosϕ + R sinϕ + Z.
The transformation function in Eq. (75) can be written as
|
| (76) |


Manage Vendors
Manage Products
User Login
Add Products
Product Name
Price
Quantity
Vender
No Vendor Available
Add Product
Product Table
Name
Price
Quantity
Vendor
Delete


org.amino.alg.graph
Class GraphAlg
java.lang.Object
org.amino.alg.graph.GraphAlg
public class GraphAlg
- extends java.lang.Object
- Author:
- Zhi Gan
|
Method Summary |
static
<E> java.util.Collection<java.util.Collection<Node<E>>> |
|
getConnectedComponents(UndirectedGraph<E> graph,
java.util.concurrent.ExecutorService threadPool)
parallel Connected Component algorithm based on [Steve Goddard 1996]. |
static
|
getMST(UndirectedGraph graph,
java.util.concurrent.ExecutorService pool)
parallel MST algorithm based on Boruvka's algorithm. |
static
|
getShortestPath(Graph<E> graph,
java.util.concurrent.ExecutorService exec,
Node<E> source,
Node<E> end)
|
static
<E> java.util.Collection<java.util.Collection<Node<E>>> |
|
getStrongComponents(DirectedGraph<E> graph,
java.util.concurrent.ExecutorService threadPool)
Parallel Strong Connected Component algorithm based on [LK
Fleischer2000]. |
| Methods inherited from class java.lang.Object |
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
GraphAlg
public GraphAlg()
getStrongComponents
public static <E> java.util.Collection<java.util.Collection<Node<E>>> getStrongComponents(DirectedGraph<E> graph,
java.util.concurrent.ExecutorService threadPool)
- Parallel Strong Connected Component algorithm based on [LK
Fleischer2000]. The targeted graph is supposed not to be modified while
computing SCC.
some parameters to be set based on experiments result: 1 the initial
capacity of hashset used in BFS visting 2 the initial capacity of hashset
for "remain" set 3 the initial capacity of vector for scc 4 the threshold
of divide-and-conquer
- Type Parameters:
E
- value type of the node in the target graph- Parameters:
graph
- directed graph to compute strong components. The graph will
not be modifiedthreadPool
- the thread pool used to do computation
- Returns:
- a collection of strong components, each of which in turn is a
collection of graph nodes
getConnectedComponents
public static <E> java.util.Collection<java.util.Collection<Node<E>>> getConnectedComponents(UndirectedGraph<E> graph,
java.util.concurrent.ExecutorService threadPool)
- parallel Connected Component algorithm based on [Steve Goddard 1996].
Only the initial presentation of the algorithm in the paper, namely A0,
is implemented. A0 is for the CREW-PRAM model, and A1 & A2 are the
adaptation of A0 to mesh-connected computer. Currently, this algorithm
just compute an undirected graph with vertices V={1,2,...,n}, for
simplicity
- Type Parameters:
E
- value type of the node in the target graph- Parameters:
graph
- undirected graph to compute connected components. The graph
will not be modifiedthreadPool
- the thread pool used to do computation
- Returns:
- a collection of connected components, each of which in turn is a
collection of graph nodes
getMST
public static <E> Graph<E> getMST(UndirectedGraph graph,
java.util.concurrent.ExecutorService pool)
throws java.lang.InterruptedException,
java.util.concurrent.ExecutionException
- parallel MST algorithm based on Boruvka's algorithm.
- Type Parameters:
E
- value type of the node in the target graph- Parameters:
graph
- the graph to compute minimum spanning treepool
- external thread pool
- Returns:
- a minimum spanning tree in the form of undirected graph
- Throws:
java.lang.InterruptedException
- thrown exception if be interrupted
java.util.concurrent.ExecutionException
- Exception thrown when attempting to retrieve the result of a
task that aborted by throwing an exception
getShortestPath
public static <E> double getShortestPath(Graph<E> graph,
java.util.concurrent.ExecutorService exec,
Node<E> source,
Node<E> end)
- Type Parameters:
E
- type of element on node- Parameters:
graph
- Graphexec
- Thread poolsource
- source nodeend
- end node
- Returns:
- the shortest path from source node to end node


{% extends "templates/base.html" %} {% block content %}
{% if geo-tag %}
Most likely this photo was taken at latitude: {{geo-tag.latitude|double-format:5}}, longitude: {{geo-tag.longitude|double-format:5}}
{% endif %}If you think this is not correct:


Belgrade
Bulija Bencinija 5
+3816592562
Toll free
E-mail
<EMAIL_ADDRESS>Home
About
Products
Contact
Author
GET IN TOUCH
Home
Contact us
Social profiles
Call me
+3816592562
Email me
bw@gmile.com


Project Xenon Discussion Board
Here is a place for users to make posts and chat.
User Name:
Post Title:
Post Description:
I agree to follow the terms of use
Create Post
Blog Postings:


Find & share great offers
offerbooth India’s Largest Network of Offers|
OfferBooth platform contains the trademark, logos, trade name, service marks and other marks, which are the brain property of OfferBooth or their vendors or respective third parties. You realize that OfferBooth uses the Marks of vendors and respective third parties procured from the owner and/or distribution channel. In doing so, OfferBooth has no intention, whatsoever, to acquire rights of use or license to these Marks. |
|
This Infringement policy helps in creating a safer marketplace by prohibiting
the use of offerBooth platform for infringing the brain property
rights of third parties or of the rightful owner. OfferBooth policy
requires sellers and buyers or users to adhere with all governmental
laws and regulations including but not limited to the Infringement
policy as amended from time to time. How to report a listingIf you have a high-quality conviction that your IP right has been infringed
by any of our sellers or anyone else on OfferBooth’s platform, you
may follow the below process and /or seek Legal advice. The email should contain the below information.
Details/documents of legal proceedings initiated against the entities (infringing the Intellectual Property rights of the owner) |


|
Rendering and Animation Platform
|
A mesh composed of triangular faces. More...
#include <Mesh.h>
Classes | |
| struct | Face |
Public Member Functions | |
| Mesh () | |
| Default constructor. More... | |
| void | setName (const ::std::string &name) |
| Sets the name of the mesh. More... | |
| void | setVertices (const ::std::vector< Math::Vector3f > &vertices) |
| Sets the vertices of the mesh. More... | |
| void | setTextureCoordinates (const ::std::vector< Math::Vector2f > &textureCoordinates) |
| Sets the texture coordinates of the mesh. More... | |
| bool | hasTextureCoordinates () const |
| Query if this object has texture coordinates. More... | |
| void | setMaterial (Material *material) |
| Sets the material associated with the mesh. More... | |
| void | setFaces (const ::std::vector< Face > &faces) |
| Sets the faces. More... | |
| const std::string & | getName () const |
| Gets the name. More... | |
| const ::std::vector < Math::Vector3f > & | getVertices () const |
| Gets the vertices. More... | |
| const ::std::vector < Math::Vector2f > & | getTextureCoordinates () const |
| Gets the texture coordinates. More... | |
| const ::std::vector< Face > & | getFaces () const |
| Gets the faces of the mesh. More... | |
| const Material * | getMaterial () const |
| Gets the material. More... | |
| void | setVerticesNormals (const ::std::vector< Math::Vector3f > &normals) |
| Sets vertices normals. More... | |
| const ::std::vector < Math::Vector3f > & | getVerticesNormals () const |
| Gets vertices normals. More... | |
| bool | hasVerticesNormals () const |
| Query if this object has vertices normals. More... | |
| Math::Vector3f | computeFaceNormal (const Face &face) |
| Calculates the face normal. More... | |
| Math::Vector3f | computeFaceNormal (size_t index) |
| Calculates the face normal. More... | |
| void | computeFacesNormals () |
| Calculates the faces normals. More... | |
| void | computeVertexNormal () |
| Calculates a per vertex normal. This function assumes that a normal has been computed for each face. If its not the case, please, call computeFacesNormals before calling this method. More... | |
| void | clean () |
| Cleans the 3D model by removing unused vertices. More... | |
A mesh composed of triangular faces.
|
inline |
Default constructor.
| void HelperGl::Mesh::clean | ( | ) |
Cleans the 3D model by removing unused vertices.
|
inline |
Calculates the face normal.
| face | The face. |
|
inline |
Calculates the face normal.
| index | Zero-based index of the. |
|
inline |
Calculates the faces normals.
| void HelperGl::Mesh::computeVertexNormal | ( | ) |
Calculates a per vertex normal. This function assumes that a normal has been computed for each face. If its not the case, please, call computeFacesNormals before calling this method.
|
inline |
Gets the faces of the mesh.
|
inline |
Gets the material.
|
inline |
Gets the name.
|
inline |
Gets the texture coordinates.
|
inline |
Gets the vertices.
|
inline |
Gets vertices normals.
|
inline |
Query if this object has texture coordinates.
|
inline |
Query if this object has vertices normals.
|
inline |
Sets the faces.
| faces | The faces. |
|
inline |
Sets the material associated with the mesh.
| [in,out] | material | If non-null, the material. |
|
inline |
Sets the name of the mesh.
| name | The name. |
|
inline |
Sets the texture coordinates of the mesh.
| textureCoordinates | The texture coordinates. |
|
inline |
Sets the vertices of the mesh.
| vertices | The vertices. |
|
inline |
Sets vertices normals.
| normals | The normals. |


Hello! I am Ocean Nguyen. Web Developer, Youtuber and Photographer.
As a passionate person trying to be the best version of myself so my motto is "Easy is not an option. Do or do not there is no try"
April 2018 - Present
Started at NashTech as Direct Entry member but be trusted by Line Manager and Project Manager. I had a chance to prove myself to become better.
- Developer of the year 2018
March 2017 - February 2018
Started as Internship then promoted to a Junior Java Developer. I had done the following dominant things:
- Integrating services' Government office into integrated axis and data rotation ESB
- Being responsible for developing both Backend and Frontend
- Creating advanced queries in Java to allow partners access data in a secure, and responsive manner
August 2015 - November 2017
Being an assistant for my professor in Thang Long university's subjects to help freshman learn C++ programming language and fundamental information.
2015 - 2016
- Carrying out 25 Project Euler lessons to guide newbies some techniques and tips
- Opening two tutorial classes about Discrete Mathematics and Data Structure to apply algorithms easily.
2018 - 2020
IIG/ETS
- TOEIC 710
2014 - 2018
Thang Long University
- 3.44 GPA
Address
49, Me Tri, Nam Tu Liem, Ha Noi
Phone
0399-352-179
duongnd2016@gmail.com


Establishing and creating the visible and multi-dimension Architecture, Structural and MEP
2
CLASH DETECTION
Completing the clash detection among various design parties,engineers and even different organisations in con struction drawings.
3
MEP INTEGRATION
Profoundly completing the pipeline integration, design coordination and intra-organisational cooperation between Plumbing, HVAC and Electrical engineering.
4
CURTAIN WALL REMEDYING
Creating the abnormity wall based on parametric design tools, and completing detailed curtain wall nodes visibly.
5
BIM CONSULTING
To help you to precisely know what is BIM? How BIM use? When and who is suitably to implement BIM?


Front-end Engineer Roadmap
This is the collection of links, which has inspired and motivated me to improve my skills of development.
{{group.name}}
{{link.title}}
{{tag.name}}


CMShape Class Reference
| Inherits from | CMObject : NSObject |
| Declared in | CMShape.h CMShape.m |
Overview
Base shape class which is used by all the shapes.
Tasks
Other Methods
Properties
-
- setElasticity:
Elasticity of the shape.  However due to inaccuracies in the simulation using 1.0 or greater is not recommended however. -
- elasticity
Returns the elasticity of the shape. -
- setFriction:
Friction coefficient. Chipmunk uses the Coulomb friction model, a value of 0.0 is frictionless. -
- friction
Returns the friction coefficient. Chipmunk uses the Coulomb friction model, a value of 0.0 is frictionless. -
- setCollisionType:
A user defined collision type which can be used to identify a type of object on screen. (is used by the collision detection) -
- collisionType
Returns the user defined collision type. -
- setGroup:
Shapes in the same non-zero group do not generate collisions. Useful when creating an object out of many shapes that you don’t want to self collide. Defaults to CPNOGROUP. -
- group
Returns the group. -
- setLayer:
Shapes only collide if they are in the same bit-planes. i.e. (a->layers & b->layers) != 0 By default, a shape occupies all bit-planes. -
- layer
Returns the layer bit mask. -
- setSensor:
A boolean value if this shape is a sensor or not. Sensors only call collision callbacks, and never generate real collisions. -
- sensor
Flag indicating if this shape is a sensor or not.Sensors only call collision callbacks, and never generate real collisions. -
- boundingBox
Returns the bounding box of this shape. -
- setData:
Associates an object with this shape, it is not used by Chipmunk but can be used to create a binding between an Sparrow object and a cpShape. -
- data
Returns the associated object with this body.
Operations
-
- body
Returns the body associated with this shape. -
- addToSpace
Add this shape to the Chipmunk space. -
- addToSpaceAsStatic
Add this body to the Chipmunk space as a static object. -
- removeFromSpace
Remove this shape from the Chipmunk space. (it will determine by itself if the Shape is static or not)
Instance Methods
addToSpaceAsStatic
Add this body to the Chipmunk space as a static object.
- (void)addToSpaceAsStatic
Declared In
CMShape.h
body
Returns the body associated with this shape.
- (CMBody *)body
Return Value
the body associated with this shape.
Declared In
CMShape.h
boundingBox
Returns the bounding box of this shape.
- (cpBB)boundingBox
Return Value
the bounding box of this shape.
Declared In
CMShape.h
collisionType
Returns the user defined collision type.
- (cpCollisionType)collisionType
Return Value
the user defined collision type.
Declared In
CMShape.h
data
Returns the associated object with this body.
- (id)data
Return Value
the associated object with this body.
Declared In
CMShape.h
elasticity
Returns the elasticity of the shape.
- (float)elasticity
Return Value
the elasticity of the shape.
Declared In
CMShape.h
friction
Returns the friction coefficient. Chipmunk uses the Coulomb friction model, a value of 0.0 is frictionless.
- (float)friction
Return Value
the friction
Discussion
Returns the friction coefficient. Chipmunk uses the Coulomb friction model, a value of 0.0 is frictionless.
For a listing of various frictions see: http://www.roymech.co.uk/UsefulTables/Tribology/coof_frict.htm
Declared In
CMShape.h
group
Returns the group.
- (cpGroup)group
Return Value
the group (defalts to CPNOGROUP)
Declared In
CMShape.h
layer
Returns the layer bit mask.
- (cpLayers)layer
Return Value
the layer bit mask.
Declared In
CMShape.h
removeFromSpace
Remove this shape from the Chipmunk space. (it will determine by itself if the Shape is static or not)
- (void)removeFromSpace
Declared In
CMShape.h
sensor
Flag indicating if this shape is a sensor or not.Sensors only call collision callbacks, and never generate real collisions.
- (BOOL)sensor
Return Value
YES when this shape is a sensor, NO if not.
Declared In
CMShape.h
setCollisionType:
A user defined collision type which can be used to identify a type of object on screen. (is used by the collision detection)
- (void)setCollisionType:(cpCollisionType)type
Parameters
- type
- the type
Discussion
A user defined collision type which can be used to identify a type of object on screen. (is used by the collision detection)
For example, if a have a ball and a block on the screen i could identify the ball as type 1 and the block as type 2.
Declared In
CMShape.h
setData:
Associates an object with this shape, it is not used by Chipmunk but can be used to create a binding between an Sparrow object and a cpShape.
- (void)setData:(id)data
Parameters
- data
- an object to associate
Declared In
CMShape.h
setElasticity:
Elasticity of the shape.  However due to inaccuracies in the simulation using 1.0 or greater is not recommended however.
- (void)setElasticity:(float)elasticity
Parameters
- elasticity
- a value between 0.0 and (adviced) 1.0
Declared In
CMShape.h
setFriction:
Friction coefficient. Chipmunk uses the Coulomb friction model, a value of 0.0 is frictionless.
- (void)setFriction:(float)friction
Parameters
- friction
- a value 0f 0.0 is frictionless
Discussion
Friction coefficient. Chipmunk uses the Coulomb friction model, a value of 0.0 is frictionless.
For a listing of various frictions see: http://www.roymech.co.uk/UsefulTables/Tribology/coof_frict.htm
Declared In
CMShape.h
setGroup:
Shapes in the same non-zero group do not generate collisions. Useful when creating an object out of many shapes that you don’t want to self collide. Defaults to CPNOGROUP.
- (void)setGroup:(cpGroup)group
Parameters
- group
- the group
Declared In
CMShape.h
setLayer:
Shapes only collide if they are in the same bit-planes. i.e. (a->layers & b->layers) != 0 By default, a shape occupies all bit-planes.
- (void)setLayer:(cpLayers)layer
Parameters
- layer
- the layer bit mask.
Discussion
Shapes only collide if they are in the same bit-planes. i.e. (a->layers & b->layers) != 0 By default, a shape occupies all bit-planes.
Wikipedia has a nice article on bitmasks if you are unfamiliar with how to use them. Defaults to CPALLLAYERS.
Declared In
CMShape.h
Properties
cpShape
The Chipmunk cpShape.
@property (nonatomic, readonly) cpShape *cpShape
Declared In
CMShape.h


{% extends "views/base.html" %} {% set active_page = "index" %} {% block title %}Blake Commagere{% endblock %} {% block body %} {#
Blake is an angel investor, serial entrepreneur, and an advisor to several companies in the SF Bay Area. In his career, he has started 7 companies, and sold 5 of them. He regularly gives talks on a wide variety of subjects including: Growth Hacking/Viral Marketing, Fundraising, and Psychology Management.
He created the social gaming category by building some of the biggest apps ever (over 50 Million players) on Facebook, including the iconic games Zombies, Vampires and Werewolves. Blake also wrote and designed the first version of Causes on Facebook, which has over 120 Million users and has raised over $100 million for various charities.


Data Structures |
| struct | USB_ClassInfo_MS_Host_t |
| | Mass Storage Class Host Mode Configuration and State Structure. More...
|
| struct | SCSI_Capacity_t |
| | SCSI Device LUN Capacity Structure. More...
|
Defines |
| #define | MS_ERROR_LOGICAL_CMD_FAILED 0x80 |
Enumerations |
| enum | MS_Host_EnumerationFailure_ErrorCodes_t {
MS_ENUMERROR_NoError = 0,
MS_ENUMERROR_InvalidConfigDescriptor = 1,
MS_ENUMERROR_NoCompatibleInterfaceFound = 2
} |
Functions |
| uint8_t | MS_Host_ConfigurePipes (USB_ClassInfo_MS_Host_t *const MSInterfaceInfo, uint16_t ConfigDescriptorSize, void *ConfigDescriptorData) ATTR_NON_NULL_PTR_ARG(1) ATTR_NON_NULL_PTR_ARG(3) |
| uint8_t | MS_Host_ResetMSInterface (USB_ClassInfo_MS_Host_t *const MSInterfaceInfo) ATTR_NON_NULL_PTR_ARG(1) |
| uint8_t | MS_Host_GetMaxLUN (USB_ClassInfo_MS_Host_t *const MSInterfaceInfo, uint8_t *const MaxLUNIndex) ATTR_NON_NULL_PTR_ARG(1) ATTR_NON_NULL_PTR_ARG(2) |
| uint8_t | MS_Host_GetInquiryData (USB_ClassInfo_MS_Host_t *const MSInterfaceInfo, const uint8_t LUNIndex, SCSI_Inquiry_Response_t *const InquiryData) ATTR_NON_NULL_PTR_ARG(1) ATTR_NON_NULL_PTR_ARG(3) |
| uint8_t | MS_Host_TestUnitReady (USB_ClassInfo_MS_Host_t *const MSInterfaceInfo, const uint8_t LUNIndex) ATTR_NON_NULL_PTR_ARG(1) |
| uint8_t | MS_Host_ReadDeviceCapacity (USB_ClassInfo_MS_Host_t *const MSInterfaceInfo, const uint8_t LUNIndex, SCSI_Capacity_t *const DeviceCapacity) ATTR_NON_NULL_PTR_ARG(1) ATTR_NON_NULL_PTR_ARG(3) |
| uint8_t | MS_Host_RequestSense (USB_ClassInfo_MS_Host_t *const MSInterfaceInfo, const uint8_t LUNIndex, SCSI_Request_Sense_Response_t *const SenseData) ATTR_NON_NULL_PTR_ARG(1) ATTR_NON_NULL_PTR_ARG(3) |
| uint8_t | MS_Host_PreventAllowMediumRemoval (USB_ClassInfo_MS_Host_t *const MSInterfaceInfo, const uint8_t LUNIndex, const bool PreventRemoval) ATTR_NON_NULL_PTR_ARG(1) |
| uint8_t | MS_Host_ReadDeviceBlocks (USB_ClassInfo_MS_Host_t *const MSInterfaceInfo, const uint8_t LUNIndex, const uint32_t BlockAddress, const uint8_t Blocks, const uint16_t BlockSize, void *BlockBuffer) ATTR_NON_NULL_PTR_ARG(1) ATTR_NON_NULL_PTR_ARG(6) |
| uint8_t | MS_Host_WriteDeviceBlocks (USB_ClassInfo_MS_Host_t *const MSInterfaceInfo, const uint8_t LUNIndex, const uint32_t BlockAddress, const uint8_t Blocks, const uint16_t BlockSize, const void *BlockBuffer) ATTR_NON_NULL_PTR_ARG(1) ATTR_NON_NULL_PTR_ARG(6) |
| static void | MS_Host_USBTask (USB_ClassInfo_MS_Host_t *const MSInterfaceInfo) |
Detailed Description
Module Source Dependencies
The following files must be built with any user project that uses this module:
- LUFA/Drivers/USB/Class/Host/MassStorage.c (Makefile source module name: LUFA_SRC_USBCLASS)
Description
Host Mode USB Class driver framework interface, for the Mass Storage USB Class driver.
Define Documentation
| #define MS_ERROR_LOGICAL_CMD_FAILED 0x80 |
Error code for some Mass Storage Host functions, indicating a logical (and not hardware) error.
Enumeration Type Documentation
- Enumerator:
| MS_ENUMERROR_NoError |
Configuration Descriptor was processed successfully.
|
| MS_ENUMERROR_InvalidConfigDescriptor |
The device returned an invalid Configuration Descriptor.
|
| MS_ENUMERROR_NoCompatibleInterfaceFound |
A compatible Mass Storage interface was not found in the device's Configuration Descriptor.
|
Function Documentation
| uint8_t MS_Host_ConfigurePipes |
( |
USB_ClassInfo_MS_Host_t *const |
MSInterfaceInfo, |
|
|
uint16_t |
ConfigDescriptorSize, |
|
|
void * |
ConfigDescriptorData |
|
) |
| |
Host interface configuration routine, to configure a given Mass Storage host interface instance using the Configuration Descriptor read from an attached USB device. This function automatically updates the given Mass Storage Host instance's state values and configures the pipes required to communicate with the interface if it is found within the device. This should be called once after the stack has enumerated the attached device, while the host state machine is in the Addressed state.
- Note:
- The pipe index numbers as given in the interface's configuration structure must not overlap with any other interface, or pipe bank corruption will occur. Gaps in the allocated pipe numbers or non-sequential indexes within a single interface is allowed, but no two interfaces of any type have have interleaved pipe indexes.
- Parameters:
-
| [in,out] | MSInterfaceInfo | Pointer to a structure containing an MS Class host configuration and state. |
| [in] | ConfigDescriptorSize | Length of the attached device's Configuration Descriptor. |
| [in] | ConfigDescriptorData | Pointer to a buffer containing the attached device's Configuration Descriptor. |
- Returns:
- A value from the MS_Host_EnumerationFailure_ErrorCodes_t enum.
Retrieves the Mass Storage device's inquiry data for the specified LUN, indicating the device characteristics and properties.
- Precondition:
- This function must only be called when the Host state machine is in the HOST_STATE_Configured state or the call will fail.
- Parameters:
-
| [in,out] | MSInterfaceInfo | Pointer to a structure containing a MS Class host configuration and state. |
| [in] | LUNIndex | LUN index within the device the command is being issued to. |
| [out] | InquiryData | Location where the read inquiry data should be stored. |
- Returns:
- A value from the Pipe_Stream_RW_ErrorCodes_t enum or MS_ERROR_LOGICAL_CMD_FAILED.
Sends a GET MAX LUN control request to the attached device, retrieving the index of the highest LUN (Logical UNit, a logical drive) in the device. This value can then be used in the other functions of the Mass Storage Host mode Class driver to address a specific LUN within the device.
- Note:
- Some devices do not support this request, and will STALL it when issued. To get around this, on unsupported devices the max LUN index will be reported as zero and no error will be returned if the device STALLs the request.
- Parameters:
-
| [in,out] | MSInterfaceInfo | Pointer to a structure containing a MS Class host configuration and state. |
| [out] | MaxLUNIndex | Pointer to a location where the highest LUN index value should be stored. |
- Returns:
- A value from the USB_Host_SendControlErrorCodes_t enum.
| uint8_t MS_Host_PreventAllowMediumRemoval |
( |
USB_ClassInfo_MS_Host_t *const |
MSInterfaceInfo, |
|
|
const uint8_t |
LUNIndex, |
|
|
const bool |
PreventRemoval |
|
) |
| |
Issues a PREVENT MEDIUM REMOVAL command, to logically (or, depending on the type of device, physically) lock the device from removal so that blocks of data on the medium can be read or altered.
- Precondition:
- This function must only be called when the Host state machine is in the HOST_STATE_Configured state or the call will fail.
- Parameters:
-
| [in,out] | MSInterfaceInfo | Pointer to a structure containing a MS Class host configuration and state. |
| [in] | LUNIndex | LUN index within the device the command is being issued to. |
| [in] | PreventRemoval | Boolean true if the device should be locked from removal, false otherwise. |
- Returns:
- A value from the Pipe_Stream_RW_ErrorCodes_t enum or MS_ERROR_LOGICAL_CMD_FAILED if not ready.
| uint8_t MS_Host_ReadDeviceBlocks |
( |
USB_ClassInfo_MS_Host_t *const |
MSInterfaceInfo, |
|
|
const uint8_t |
LUNIndex, |
|
|
const uint32_t |
BlockAddress, |
|
|
const uint8_t |
Blocks, |
|
|
const uint16_t |
BlockSize, |
|
|
void * |
BlockBuffer |
|
) |
| |
Reads blocks of data from the attached Mass Storage device's medium.
- Precondition:
- This function must only be called when the Host state machine is in the HOST_STATE_Configured state or the call will fail.
- Parameters:
-
| [in,out] | MSInterfaceInfo | Pointer to a structure containing a MS Class host configuration and state. |
| [in] | LUNIndex | LUN index within the device the command is being issued to. |
| [in] | BlockAddress | Starting block address within the device to read from. |
| [in] | Blocks | Total number of blocks to read. |
| [in] | BlockSize | Size in bytes of each block within the device. |
| [out] | BlockBuffer | Pointer to where the read data from the device should be stored. |
- Returns:
- A value from the Pipe_Stream_RW_ErrorCodes_t enum or MS_ERROR_LOGICAL_CMD_FAILED if not ready.
Retrieves the total capacity of the attached USB Mass Storage device, in blocks, and block size.
- Precondition:
- This function must only be called when the Host state machine is in the HOST_STATE_Configured state or the call will fail.
- Parameters:
-
| [in,out] | MSInterfaceInfo | Pointer to a structure containing a MS Class host configuration and state. |
| [in] | LUNIndex | LUN index within the device the command is being issued to. |
| [out] | DeviceCapacity | Pointer to the location where the capacity information should be stored. |
- Returns:
- A value from the Pipe_Stream_RW_ErrorCodes_t enum or MS_ERROR_LOGICAL_CMD_FAILED if not ready.
Retrieves the device sense data, indicating the current device state and error codes for the previously issued command.
- Precondition:
- This function must only be called when the Host state machine is in the HOST_STATE_Configured state or the call will fail.
- Parameters:
-
| [in,out] | MSInterfaceInfo | Pointer to a structure containing a MS Class host configuration and state. |
| [in] | LUNIndex | LUN index within the device the command is being issued to. |
| [out] | SenseData | Pointer to the location where the sense information should be stored. |
- Returns:
- A value from the Pipe_Stream_RW_ErrorCodes_t enum or MS_ERROR_LOGICAL_CMD_FAILED if not ready.
Sends a MASS STORAGE RESET control request to the attached device, resetting the Mass Storage Interface and readying it for the next Mass Storage command.
- Parameters:
-
| [in,out] | MSInterfaceInfo | Pointer to a structure containing a MS Class host configuration and state. |
- Returns:
- A value from the USB_Host_SendControlErrorCodes_t enum.
Sends a TEST UNIT READY command to the device, to determine if it is ready to accept other SCSI commands.
- Parameters:
-
| [in,out] | MSInterfaceInfo | Pointer to a structure containing a MS Class host configuration and state. |
| [in] | LUNIndex | LUN index within the device the command is being issued to. |
- Returns:
- A value from the Pipe_Stream_RW_ErrorCodes_t enum or MS_ERROR_LOGICAL_CMD_FAILED if not ready.
General management task for a given Mass Storage host class interface, required for the correct operation of the interface. This should be called frequently in the main program loop, before the master USB management task USB_USBTask().
- Parameters:
-
| [in,out] | MSInterfaceInfo | Pointer to a structure containing an Mass Storage Class host configuration and state. |
| uint8_t MS_Host_WriteDeviceBlocks |
( |
USB_ClassInfo_MS_Host_t *const |
MSInterfaceInfo, |
|
|
const uint8_t |
LUNIndex, |
|
|
const uint32_t |
BlockAddress, |
|
|
const uint8_t |
Blocks, |
|
|
const uint16_t |
BlockSize, |
|
|
const void * |
BlockBuffer |
|
) |
| |
Writes blocks of data to the attached Mass Storage device's medium.
- Precondition:
- This function must only be called when the Host state machine is in the HOST_STATE_Configured state or the call will fail.
- Parameters:
-
| [in,out] | MSInterfaceInfo | Pointer to a structure containing a MS Class host configuration and state. |
| [in] | LUNIndex | LUN index within the device the command is being issued to. |
| [in] | BlockAddress | Starting block address within the device to write to. |
| [in] | Blocks | Total number of blocks to read. |
| [in] | BlockSize | Size in bytes of each block within the device. |
| [in] | BlockBuffer | Pointer to where the data to write should be sourced from. |
- Returns:
- A value from the Pipe_Stream_RW_ErrorCodes_t enum or MS_ERROR_LOGICAL_CMD_FAILED if not ready.


We're not sure how you got here. If you were trying to save a timetable as image or PDF, please check your link and try again.


If you're seeing this, that means I haven't finished configuring the Hugo site generator yet.
It'll be up within a day. If it isn't, bug me on Twitter: @WillieCubed


}
Abaseen is a designer of brand marketing, with experience managing global teams and multi-million-dollar campaigns. Her background in brand strategy, visual design,web designing and account management inform her mindful but competitive approach.
Last updated 3 mins ago
Fazli azim is a director of brand marketing, with experience managing global teams and multi-million-dollar campaigns. Her background in brand strategy, visual design,web development and account management inform her mindful but competitive approach.
Last updated 3 mins ago
Fazli azim is a director of brand marketing, with experience managing global teams and multi-million-dollar campaigns. Her background in brand strategy, visual design,web development and account management inform her mindful but competitive approach.
Last updated 3 mins ago
If you’re job seeking, considering a career change or looking to take on projects or gigs, mention it in your statement. Include your email address in the last sentence, so it’s easy to get in touch with you.


Michael Scofield’s letter
问题描述 :
I believe many people are the fans of prison break. How clever Michael is!! In order that the message won’t be found by FBI easily, he usually send code letters to Sara by a paper crane. Hence, the paper crane is Michael in the heart of Sara. Now can you write a program to help Sara encode the letter from Michael easily?
The letter from Michael every time is a string of lowercase letters. You should encode letters as the rules below:
b is ‘ ‘, q is ‘,’, t is ‘!’, m is l, i is e, c is a, a is c, e is i, l is m. It is interesting. Are you found that it is just change michael to leahcim?
The letter from Michael every time is a string of lowercase letters. You should encode letters as the rules below:
b is ‘ ‘, q is ‘,’, t is ‘!’, m is l, i is e, c is a, a is c, e is i, l is m. It is interesting. Are you found that it is just change michael to leahcim?
输入:
The input will consist of several cases, one per line.
Each case is a letter from Michael, the letteres won’t exceed 10000.
Each case is a letter from Michael, the letteres won’t exceed 10000.
输出:
The input will consist of several cases, one per line.
Each case is a letter from Michael, the letteres won’t exceed 10000.
Each case is a letter from Michael, the letteres won’t exceed 10000.
样例输入:
pmicsibforgevibliqbscrct ebmovibyout
样例输出:
please forgive me, sara! i love you!
2011-12-15 02:28:25
地址：http://acm.hdu.edu.cn/showproblem.php?pid=2140
题意：给出加密的字符串，输出解密。加密规则在题中。
mark：那个l很像1……wa了一次，没看数组范围，开了个100的，2B了。
代码：
# include <stdio.h> char tab[300] ; char str[10010] ; int main () { int i ; char s1[] = "bqtmicael", s2[] = " ,!leacim" ; for (i = 0 ; i < 9 ; i++) tab[s1[i]] = s2[i] ; while (gets (str)) { for (i = 0 ; str[i] ; i++) { if (tab[str[i]] == 0) putchar (str[i]) ; else putchar (tab[str[i]]) ; } printf ("\n") ; } }
解题转自：http://www.cnblogs.com/lzsz1212/archive/2012/01/06/2314621.html
(adsbygoogle = window.adsbygoogle || []).push({});
这个更C刺j激，A 片：htTP://uVU.Cc/ijW7
#include <stdio.h>
int main(void)
{
int arr[] = {10,20,30,40,50,60};
int *p=arr;
printf("%d,%d,",*p++,*++p);
printf("%d,%d,%d",*p,*p++,*++p);
return 0;
}
为什么是 20,20,50,40,50. 我觉得的应该是 20,20,40,40,50 . 谁能解释下？
跟书上的解法不一样，不知道哪个效率要高些
这个还不错
你这个代码显示风格很给你啊，怎么做出来的？
这个差别应该不会太大，或许编辑器就自动优化成内联函数了
。。。
int L[m+1][n+1];这样定义出错，这个在gcc上可以编译通过 在VS上不行 应该改为new 或者vector
为什么暴力求解方法循环到sqrt(n) 就可以了呢
分三种情况讨论。Not Possible就是impossible
题目需要求解的是最小值，而且没有考虑可能存在环
51行错了，改为：void Union(struct subset subsets[], int x, int y)
我是来看评论的
对，就是把这32位当成一个长度为32的数组
可以参考算法导论中的时间戳。就是结束访问时间，最后结束的顶点肯定是入度为0的顶点，因为DFS要回溯


As an enterprise offering our clients services such as International Trade, IP incubation and Physicians Agency, EKKA committed to the dissemination of high-quality content and the promotion of excellent brands.
By the integration of trading, marketing, production, advertising and broking, we have established tight relationship with doctors, medical institutions from multiple disciplines.
With the professional abilities of evaluation and siftings, EKKA is able to pick out high-quality products for the customers and help excellent brands all over the world enter the market of China.
In the era of information explosion, we need more voices from experts. EKKA will always be our partners' best friends and our customers' best choice.


WEEK 21 TUESDAY
Year 1 (Year 2)
FIRST READING 1 Thessalonians 2:1-8
“We were ready to share with you not only the Gospel of God but also our own selves.”
A reading from the first Letter of Saint Paul to the Thessalonians
You yourselves know, brethren, that our visit to you was not in vain;
but though we had already suffered and been shamefully treated at Philippi, as you
know, we had courage in our God to declare to you the gospel of God in the face
of great opposition. For our appeal does not spring from error or uncleanness,
nor is it made with guile; but just as we have been approved by God to be
entrusted with the gospel, so we speak, not to please men, but to please God
who tests our hearts. For we never used either words of flattery, as you know,
or a cloak for greed, as God is witness; nor did we seek glory from men,
whether from you or from others, though we might have made demands as apostles
of Christ. But we were gentle among you, like a nurse taking care of her
children. So, being affectionately desirous of you, we were ready to share with
you not only the gospel of God but also our own selves, because you had become
very dear to us.
The word of the Lord
RESPONSORIAL PSALM Psalm 139:1-3.4-6 (R. 1)
R. O Lord, you search me and you know me.
 You yourself know my resting and my
rising; you discern my thoughts from afar. You mark when I walk or lie down;
you know all my ways through and through.
R. O Lord, you search me and you know me.
Before ever a word is on my tongue, you know it, O LORD, through and
through.  Too wonderful for me, this knowledge; too high, beyond my reach.
R. O Lord, you search me and you know me.
FIRST READING 2 Thessalonians 2:1-3.14-17
“Hold to the traditions which you were taught by us.”
A reading from the second Letter of Saint Paul to the Thessalonians
Concerning the coming of our Lord Jesus Christ and our assembling to
meet him, we beg you, brethren, not to be quickly shaken in mind or excited, either
by spirit or by word, or by letter purporting to be from us, to the effect that
the day of the Lord has come. Let no one deceive you in any way. God has called
you through our gospel, so that you may obtain the glory of our Lord Jesus
Christ. So then, brethren, stand firm and hold to the traditions which you were
taught by us, either by word of mouth or by letter. Now may our Lord Jesus
Christ himself, and God our Father, who loved us and gave us eternal comfort
and good hope through grace, comfort your hearts and establish them in every
good work and word.
The word of the Lord
RESPONSORIAL PSALM Psalm 96:10.11-12a.12b-13 (R. 13b)
R. The Lord comes to judge the earth.
Say
to the nations, 'The LORD is king.' The world he made firm in its place; he
will judge the peoples in fairness.
R. The Lord comes to judge the earth.
Let
the heavens rejoice and earth be glad; let the sea and all within it thunder
praise. Let the land and all it bears rejoice.
R. The Lord comes to judge the earth.
Then will all the trees of the wood shout for joy at the presence of the
LORD, for he comes, he comes to judge the earth. He will judge the world with
justice; he will govern the peoples with his truth.
R. The Lord comes to judge the earth.
R. Alleluia. The word of the Lord is living and active; discerning the thoughts and intentions of the heart. R. Alleluia.
GOSPEL Matthew 23:23-26
“These you ought to have done, without neglecting the others.”
A reading from the holy Gospel according to Matthew
At that time: Jesus said, "Woe to you, scribes and Pharisees,
hypocrites! for you tithe mint and dill and cummin, and have neglected the weightier matters of the
law, justice and mercy and faith; these you ought to have done, without
neglecting the others. You blind guides, straining out a gnat and swallowing a
camel!  You blind Pharisee! first cleanse the inside of the cup and of the plate, that
the outside also may be clean.
The Gospel of the Lord


Preparation time
less than 30 mins
Cooking time
30 mins to 1 hour
Serves
Serves 6
For the winter vegetable ratatouille, preheat the oven to 200C/400F/Gas 6.
Mix all of the vegetable cubes, the onion and the garlic in a deep-sided roasting tin until well combined.
Drizzle over some of the olive oil and season, to taste, with salt and freshly ground black pepper.
Place the roasting tin over a medium heat and stir the vegetables well to coat all of the vegetables in the oil.
When the vegetables start to sizzle, transfer the roasting tin to the oven and cook for 35-40 minutes, stirring the vegetables occasionally and adding more of the remaining oil, as necessary, until the vegetables are tender.
Meanwhile, for lemon beurre blanc, bring the shallots, white wine vinegar, lemon juice, lemon zest and white wine to the boil in a non-reactive saucepan. Continue to boil until the volume of liquid has reduced to two tablespoons.
Add the cold water and return the mixture to the boil. Boil again until only one tablespoon of liquid remains in the pan.
Reduce the heat to low, then whisk in the butter, a cube at a time, waiting until each cube has melted before adding the next. Continue to whisk until the sauce is pale and thick, then remove the pan from the heat and season, to taste, with salt and freshly ground black pepper. Add more lemon juice, as necessary, to taste.
Strain the sauce through a sieve into a clean saucepan and set aside until needed (do not refrigerate or the sauce will separate). Gently reheat the sauce just before serving, stirring well.
Meanwhile, for the roast cod, reduce the oven temperature to 180C/350F/Gas 4.
Heat the oil and butter in a frying pan over a medium heat. When the butter has stopped foaming, place the cod fillets into the pan, skin-sides down, and fry until the skin is crisp and golden-brown. Season, to taste, with salt and freshly ground black pepper. Carefully turn the fillets over and continue to fry until golden-brown on both sides.
Transfer the cod fillets to a roasting tray and cook in the oven for 4-5 minutes, or until just cooked through. (NB: The cod is cooked through when the flesh is opaque.)
To serve, divide the winter ratatouille equally among six serving plates. Place one roasted cod fillet on top of each serving. Spoon over the lemon beurre blanc.


The span around this always gets stripped.
Content in a span only if foo was not defined.
This is a literal dolars sign before
not_a_var: $$not_a_var
$a
- $x is divisible by 3
-
${x} is not divisible by 3,
but it is divisible by ${y}!
${value_of('somevar', 'somevar is not set')}
${Markup('1234&')}
${i} divides by 3
${i} is not a friend of 3
${i} aspires to be a number that divides by 3
${_('')}


Smriti Irani performs 'sword dance' at function in Gujarat
The union minister who could be seen wielding two swords on the stage, tried her best to match steps with the performers
by ANIBhavnagar (Gujarat): Union Minister Smriti Irani performed 'Talwar Raas', a traditional dance form using swords, at a cultural programme in Bhavnagar on Friday.
Irani, who could be seen wielding two swords on the stage, tried her best to match steps with the girls performing there.
The Union Cabinet Minister for Textiles and Women and Child Development was in Bhavnagar for a cultural event hosted by the Shri Swaminarayan Gurukul.'Talwar Raas', is a traditional folk dance that is popular in Gujarat and Rajasthan.
Sign up for all the latest news, top galleries and trending videos from Mid-day.com
Subscribe
Loading...


Password Generator
Password
Generate password
Length
Length
Include
uppercase
lowercase
numbers
symbols


Introduction to Spark 2.0 - Part 6 : Custom Optimizers in Spark SQL
Spark 2.0 is the next major release of Apache Spark. This release brings major changes to abstractions, API’s and libraries of the platform. This release sets the tone for next year’s direction of the framework. So understanding these few features is critical to understand for the ones who want to make use all the advances in this new release. So in this series of blog posts, I will be discussing about different improvements landing in Spark 2.0.
This is the sixth blog in series, where I will be discussing about adding custom optimizers to spark sql catalyst optimizer. You can access all the posts in the series here.
TL;DR All code examples are available on github.
Catalyst optimizer
Spark SQL uses an optimizer called catalyst to optimize all the queries written both in spark sql and dataframe dsl. This optimizer makes queries run much faster than their RDD counterparts. Spark keeps on improving this optimizer every version in order to improve performance without changing user code.
Catalyst is a modular library which is build as a rule based system. Each rule in the the framework focuses on the specific optimization. For example, rule like ConstantFolding focuses on removing constant expression from the query. For more information catalyst, you can refer to my earlier talk on anatomy of dataframe.
In earlier versions of spark, if we wanted add our own optimizations, we need to change the source code of spark. This is not preferable in many cases where optimizations are only applicable to the domain or user specific problems. So developer community wanted to have a pluggable way to add their optimizations to the catalyst in runtime.
In Spark 2.0, we have an experimental API for adding user defined custom optimizations. In the rest of the blog I will be discussing about how to write an optimization rule and add it to catalyst.
Optimized plan for a dataframe
Before we write our optimization rule, let’s understand how to access the optimized plan in spark. The below code shows a simple example
In above code, we have loaded a csv file and multiplied one to one of the column. We can look at the optimized plan for that dataframe using optimizedPlan object on queryExecution. queryExecution allows us to access all the information related execution of the query. Optimized plan is one of them.
Every plan in spark is represented as a tree. So numberedTreeString method pretty prints the optimized plan. When we run this code we get below result.
00 Project [(cast(amountPaid#3 as double) * 1.0) AS (amountPaid * 1)#5]
01 +- Relation[transactionId#0,customerId#1,itemId#2,amountPaid#3] csv
All plans are read bottom to top. The below are the two nodes of tree
-
01 Relation - Signifies the dataframe we created from csv file
-
00 Project - Signifies the projection
You can observe some of the casts added by the spark for correct results.
Writing an optimizer rule
From the above plan, it’s clear that its going to multiply 1.0 to each of the value of column. But it’s not optimal plan. Whenever we see 1 in multiplication, we know it’s going to return exact same value. We can use this knowledge to write a rule and add smartness to the optimizer.
The following code show how to write such a rule.
Here we are extending from Rule which operates on logical plan. Most of the rules are written as pattern matching in scala. In code, we are checking is the right operand is literal and it’s value is 1.0. Here we are very specific about where value 1 should appear. If it appears on the left it will not optimize. As it’s for example, for brevity I have not included checking for left also. But you can easily add.
So whenever we have right value as 1, we will skip the right expression altogether and return left.
Integrating our optimizer rule
Once we have our rule, next step is to add to the optimizer. The below code shows that.
On spark session, we have an experimental object which exposes all the experimental API’s. Using this API, you can add list of custom rules to catalyst with extraOptimizations.
Using the custom optimization
Once we have our rule added, we need to check it is applied or not. We will do same manipulation again as below code.
If we observe the output now,
00 Project [cast(amountPaid#3 as double) AS (amountPaid * 1)#7]
01 +- Relation[transactionId#0,customerId#1,itemId#2,amountPaid#3] csv
You can observe now that multiplication is gone. This denotes the our optimization is applied. You can access complete code here.
In Spark 2.0 users can add their own custom rules to catalyst to optimize their code. This makes spark more developer friendly and powerful generic engine.
References
Catalyst: Allow adding custom optimizers - https://issues.apache.org/jira/browse/SPARK-9843


You need to enable JavaScript to run this app.
Escape game
If you see this you need a compatible browser, try Firefox, Chrome
Actions


{% extends 'wallet/index.html' %} {% block bodyclass %}{{ super() }} add{% endblock %} {% block title %}Add Wallet{% endblock %} {% block breadcrumb %} {{ super() }}
I have used this wallet application to connect to various altcoin instances. Works for me.
{% set submittext='Add wallet' %} {% include 'form.html' %}


CodeIgniter is a powerful PHP framework with a very small footprint. Built for developers and by developers who need a simple and elegant toolkit to create powerful fully-featured web applications.
Find Out MoreCodeIgniter is an Application Development Framework.
It is a toolkit for people who build websites using PHP. With a tiny footprint and a shallow learning curve that will have you coding your application in just hours, not days, not weeks.
The CodeIgniter goal is to enable you to develop projects much faster than you could if you were writing code from scratch.
CodeIgniter lets you creatively focus on your project by minimizing the amount of code needed for a given task. It has nearly zero configuration and is designed to work on virtually any hosting environment.
An MVC architecture provides seperation of your php code from your website design.
The "Model, View, Controller" MVC model means your pages are free from scripting because the presentation layers are seperate from the logic and code. CodeIgniter also provides a rich set of libraries for commonly needed tasks, as well as a logical MVC structure to access these libraries.
FREE OPEN SOURCE STABLE
CodeIgniter has a tiny footprint. It is a powerhouse toolbox in a tiny package.
CodeIgniter is very fast and outperforms the competition in nearly all benchmark tests.
Start coding your app, not fighting the framework. CodeIgniter lets you work the way you want to.
We take security very seriously. The framework itself is highly secure and provides the tools you need to make your app secure.
Never be lost again. The documentation is thorough and comprehensive, packed with ideas and code examples, covering every aspect of the framework and how it works.
CodeIgniter works almost straight out of the box. With a shallow and fast learning curve, the rest is up to you.
© CodeIgniter is a project of the CodeIgniter Foundation. Codeigniter is open source software released under the MIT open source licence.


Simple website project created for my step father…
Closed
The MIT License Copyright (c) 2013 Daniel Racine


--- layout: post title: Performance Testing Rails with BlitzIO date: '2012-04-13T11:57:23-05:00' tags: - performance - blitzio - ruby - rails - testing - load permalink: /post/21027306312/performance-testing-rails-with-blitzio ---
Haven’t you always wanted to make some changes to your server and then absolutely slam it with traffic to see the result? Thats pretty much what I did last week while writing how to Super Charge your Rails App with Rack Cache, using the BlitzIO tool.
If you’re interested in trying out Blitz watch a demo in the screencast below.
For a walkthrough on how to add Rack::Cache and Memcache to your server read my performance article on the Heroku Dev Center.


A poor ui design can ruin your company reputation, so we offer your quality designs that will leave your clients astonished when they see your company ui / ux design.
We ensure you get professional, and creative websites, which are mobile-friendly and responsive, we can help you bring your ideas to life.
Get your professional andriod apps up and running.
Branding is not a logo, not a corporate identity, not marketing and also not advertising, Branding is Confidence, Passion, Security, and A set of unique values. We are here to help you build your brand
Giving you the best logo designs, flyers, Ad banners, e.t.c.
We help you ensure that your website is up and running smoothly and 100% secured from any cyber attacks.
Start working with Tec-A - We get your website ready on time and do not exceed deadlines given to us by our clients, We can provide everything you need to generate awareness, drive traffic, connect, stay secured.
Our clients will have to discuss their project ideas with us in details and how they intend on reaching the goal of their organization.
Our team will develop and elaborate on the project and have clients say their view of developments
After all review has been done and client is ok with the project case, we get it ready for delivery.
We are happy working with each of these companies, and we wish them the best in their different bussiness fields. It was a great priviledge and awesome experience working with them all.


Nahum 1:8
But with an overrunning flood he will make an utter end of the place thereof, and darkness shall pursue his enemies.


$test_plan_name
Introduction
Test Environment
Scope
Test Cases
| Test Area | Component | Type | ID | Scenario | Description | Tag | Pre-Conditions | Steps | Expected Behavior | Status | Result |
|---|
Functional New Features
Functional Enhancements
Functional New Features - Successful / Failed
Total Test: 0, Passed: 0, Failed: 0
Functional Enhancements - Successful / Failed
Total Test: 0, Passed: 0, Failed: 0
Non Functional New Features
Non Functional Enhancements
Non Functional New Features - Successful / Failed
Total Test: 0, Passed: 0, Failed: 0
Non Functional Enhancements - Successful / Failed
Total Test: 0, Passed: 0, Failed: 0