franka_tut_reasoning package¶
Submodules¶
franka_tut_reasoning.errors module¶
Errors module.
Are defined here the errors for the reasoning module
-
exception
franka_tut_reasoning.errors.
Error
¶ Bases:
exceptions.Exception
Base class for exceptions in this module.
-
exception
franka_tut_reasoning.errors.
Grasping_Error
(symbol)¶ Bases:
franka_tut_reasoning.errors.Error
Exception raised when the width of the object to grasp is superior to the maximum width of the gripper
-
exception
franka_tut_reasoning.errors.
LocationUnknown_Error
(symbol)¶ Bases:
franka_tut_reasoning.errors.Error
Exception raised when the action requires a motion to un undefined location
-
exception
franka_tut_reasoning.errors.
RequestSemantic_Error
¶ Bases:
franka_tut_reasoning.errors.Error
Exception raised when the request can be matched to several utterances
-
exception
franka_tut_reasoning.errors.
RequestSyntax_Error
(symbol)¶ Bases:
franka_tut_reasoning.errors.Error
Exception raised when the request cannot be matched to any utterance
-
exception
franka_tut_reasoning.errors.
TargetUnknown_Error
(symbol)¶ Bases:
franka_tut_reasoning.errors.Error
Exception raised when one of the attribute of the request is not known
-
exception
franka_tut_reasoning.errors.
WidthUnknown_Error
(symbol)¶ Bases:
franka_tut_reasoning.errors.Error
Exception raised when the width of the object to grasp is not know is not known
franka_tut_reasoning.grounding_action_server module¶
franka_tut_reasoning.main module¶
Reasoning module.
This module is the core of the system. It interacts with the knowledge base via a prolog interface defined in a second module in this package to reason over it. It can be activated via the GUI or via the senses, i.e., the sensors installed on the robot.
-
class
franka_tut_reasoning.main.
Reasoning
(kb_interface, planner, action_server)¶ Bases:
object
-
activation_callback
()¶
-
actuator_callback
(feedback)¶
-
callback
(data)¶ speech recognition response callback
-
ending_callback
(state, result)¶
-
human_callback
(msg)¶
-
speak
(msg)¶
-
unknown_symbol_publisher
= <rospy.topics.Publisher object>¶
-
franka_tut_reasoning.ontology_manager module¶
Knowledge base module.
Are defined here the different requests to the knowledge. Reasoning about the RDF results is also included.
-
class
franka_tut_reasoning.ontology_manager.
RdfManager
¶ Bases:
object
docstring for RdfManager.
-
check_attribute
(attribute)¶
-
extract_actions_from_step
(step)¶
-
extract_actions_from_task
(task)¶
-
find_utterances
(action)¶ Retrieve utterances available in the knowledge base that match the command.
- action : str
- An action extracted from an user request.
- List[str]
- The list of matching utterances.
-
get_action_preconditions
(action)¶
-
get_first_task_from_step
(step)¶ Retrieve the tasks that compose a step from a skill.
- step : str
- Name of the step.
- List[str]
- The tasks that are involved in this step.
-
get_following_slot
(slot)¶ Retrieve the slot linked to the argument.
- slot : str
- An action extracted from an user request.
- List[str]
- The potential targets linked to this action.
-
get_skills
()¶ Retrieve skills available.
- List[str]
- The list of skills.
-
get_step_info
(command_name)¶ Retrieve information available for a given skill.
Retrieve the skill activated by the command sent as argument, list its steps, and for each one of them gets all information available.
- command_name : str
- An utterance.
- List[(x,y)]
- The list of (predicate, object).
-
get_task_from_step
(step)¶ Retrieve the tasks that compose a step from a skill.
- step : str
- Name of the step.
- List[str]
- The tasks that are involved in this step.
-
get_task_steps
(task_name)¶ Retrieve skills available.
- task_name : str
- the name of a skill
- List[str]
- The list of steps for this skill.
-
ground_subclass
(new_class, mother_class)¶ Activate grounding process for a new subclass.
- new_class : str
- Name of the new class to add.
- mother_class : str
- Name of the mother class
-
rec_extract_actions_from_task
(task)¶
-
relate_new_skill
(new_skill, related_skill)¶ Add new utterance as trigger for a given skill.
- new_skill : (action, target)
- Signature of the new utterance.
- related_skill : (action, target)
- Signature of the reference.
-
retrieve_description
(entity)¶
-
retrieve_location
(entity)¶
-
retrieve_width
(entity)¶
-
send_query
(query)¶ Retrieve matches to a given query.
Reach the query url and use json to embbed the query itself.
- query : sparql
- The query
- List[str]
- The list of matches.
-
-
class
franka_tut_reasoning.ontology_manager.
TaskSemanticManager
¶ Bases:
franka_tut_reasoning.ontology_manager.RdfManager
docstring for TaskSemanticManager.
-
check_semantic
(action, target, set_skills)¶ Solves the ambiguities if necessary to retrieve only one skill to trigger in answer of a request
-
check_syntax
(action, target)¶ Match the request with the skills having a compatible syntax
-
compare_command
(target)¶
-
comply_to_preconditions
(node)¶
-
ground_new_symbol
(items, server_type, symbol)¶
-
has_constraint
(step)¶
-
is_gripper_operational
(node)¶
-
is_rotation_angle_valid
(node)¶
-
is_target_graspable
(node)¶ Checks if the width of the object is less than max width of the gripper
-
is_target_reachable
(node)¶ Checks if the target is known and maps it to its location
-
matching_attribute
(attribute)¶
-
procedural_attachment
(steps, context)¶
-
retrieve_actions
(skill)¶
-
franka_tut_reasoning.planner module¶
-
class
franka_tut_reasoning.planner.
AutomatedPlanner
¶ Bases:
franka_tut_reasoning.planner.Planner
docstring for AutomatedPlanner.
-
decide_next_move
()¶ Decides which action to take next
-
find_next_step
()¶
-
initialize
(steps, constraints)¶
-
-
class
franka_tut_reasoning.planner.
CollaborativePlanner
¶ Bases:
franka_tut_reasoning.planner.Planner
docstring for CollaborativePlanner.
-
decide_next_move
()¶ Decides which action to take next
-
-
class
franka_tut_reasoning.planner.
InteractivePlanner
¶ Bases:
franka_tut_reasoning.planner.Planner
docstring for InteractivePlanner.
-
decide_next_move
()¶ Decides which action to take next
-
find_first_step
()¶ Identifies the first action required by the robot
-
find_next_step
()¶
-
initialize
(steps, constraints)¶
-
-
class
franka_tut_reasoning.planner.
Planner
¶ Bases:
object
docstring for Planner.
-
add_node
(name, x, agent='Human')¶ adds a new step
-
attribute_node_to_human
(node)¶
-
attribute_node_to_robot
(node)¶
-
complete_step
(node)¶
-
decide_next_move
()¶ Decision making strategy
-
draw_graph
()¶
-
generator_move
(moves, params)¶
-
initialize
(steps, constraints)¶ Create groups of steps depending on the strategy
-
print_graph
()¶
-
franka_tut_reasoning.task_server module¶
-
class
franka_tut_reasoning.task_server.
TaskActionServer
(name)¶ Bases:
object
-
actuator_cb
(msg)¶
-
feedback
= robot_feedback: action_name: '' attributes: [] status: 0 human_feedback: action_name: '' attributes: [] status: 0¶
-
goal_cb
()¶
-
gripper_command
= position: 0.0 max_effort: 0.0¶
-
joint_state
= header: seq: 0 stamp: secs: 0 nsecs: 0 frame_id: '' name: [] position: [] velocity: [] effort: []¶
-
motion_name
= data: ''¶
-
pose
= position: x: 0.0 y: 0.0 z: 0.0 orientation: x: 0.0 y: 0.0 z: 0.0 w: 0.0¶
-
preempt_cb
()¶
-
pub_cartesian_motion
= <rospy.topics.Publisher object>¶
-
pub_gripper_motion
= <rospy.topics.Publisher object>¶
-
pub_joint_action
= <rospy.topics.Publisher object>¶
-
pub_motion
= <rospy.topics.Publisher object>¶
-
result
= result: ''¶
-
classmethod
send_cartesian_motion
(poses)¶
-
classmethod
send_gripper_motion
(width)¶
-
classmethod
send_joint_action
(angle)¶
-
classmethod
send_motion
(motion_name)¶
-
send_new_command
(next_move)¶ Just look for the next step
-
sensor_feedback_cb
(msg)¶
-


C R A S H -- a movie review by Justin K. Siegel
Cars are sexy. They have been sexy since they have been cars.  At your average drive-in movie, the ratio of people having intercourse in their cars to people actually watching the movie is about 12-1 (I should know -- I did an essay on this in Gr. 7.)
Crashing cars, however, are not generally considered to be sexy. But to the select group of perverts and sycophants who populate the world of David Cronenberg's new film, CRASH, they are. Their leader is man named Vaughan (Elias Koteas), who makes his living by recreating famous car-crashes (Jayne Mansfield, James Dean). One of his "followers" is Dr. Helen Remington (Holly Hunter), whose husband has just been killed by James Ballard (James Spader), in a gruesome car-crash. Helen is surprisingly indifferent about her husband's passing, and she recruits Ballard and his beautiful wife Catherine (Debarah Karah Unger) into Vaughan's little psycho-sexual orginization.
 The scene in which he administers oral sex to the scars is one of the most repulsive in recent memory. More repulsive than the boy/boy kiss between Spader and Koteas, which sent one of my friends fleeing the room.
I've never seen a movie with this many sex-scenes that was less sexually exciting (even SHOWGIRLS). CRASH seemed like it was just one interesting-to-watch, ten-minute sex-scene after another, but it was shot in a fashion that did its best not to be, um, _uplifting_.
If you are an intelligent human being looking for 100 intriguing, disturbing minutes, I would highly reccomend CRASH.
B+ (report card) 8 (0 to 10) *** 1/2 (0 to ****)
The review above was posted to the
rec.arts.movies.reviews newsgroup (de.rec.film.kritiken for German reviews).
The Internet Movie Database accepts no responsibility for the contents of the
review and has no editorial control. Unless stated otherwise, the copyright
belongs to the author.
Please direct comments/criticisms of the review to relevant newsgroups.
Broken URLs inthe reviews are the responsibility of the author.
The formatting of the review is likely to differ from the original due
to ASCII to HTML conversion.
Related links: index of all rec.arts.movies.reviews reviews


John Abraham set to lock horns with Ajay Devgn at the box-office
by FilmfareBox-office clashes seem to have become inevitable of late. We hear that Ajay Devgn’s Bhuj: The Pride Of India which also stars Sanjay Dutt and Sonakshi Sinha and John Abraham’s Attack are both slotted for an Independence Day 2020 release.
After Satyameva Jayate (2018) and Batla House (2019), John has now reserved the Independence Day weekend of 2020 for his upcoming action-thriller. The actor revealed this while having an interview with a leading daily, "It’s Attack, which rolls on January 4 and opens on August 14. I’ve come to believe that the day belongs to me, not just because it’s a national holiday but also for the feelings it brings forth. Attack is an apt Independence Day release, patriotic without being jingoistic. It will be directed by Lakshya Anand, who assisted Kabir Khan on New York and Ek Tha Tiger, and Siddharth Anand on Bang Bang."
There have been reports that the film might clash with Ajay Devgn-Sanjay Dutt's Bhuj: The Pride of India, which is all set to release on the same day, August 14, 2020. The film is based on a true event during the 1971 Indo-Pak war. Ajay Devgn essays the role of Squadron Leader Vijay Karnik and will be directed by Abhishek Dudhaiya.


endfio.cpp
contains functions to read/write MF/MT sections
in an ENDF-6 formatted file, which comprise of the functions
in endflib.cpp
. The data structure shown in
the previous section is very basic, and the
real data given in files are complicated combinations of these data
blocks, depending on a type of data (cross sections, scattering
angular distributions, energy distributions, etc.) Due to the
complexity of the ENDF-6 format, the current version of DeCE cannot
handle all the data structure defined in the ENDF-6 manual.
The simplest example is given below. This is to read the MF=3 section for a given MT number.
int ENDFReadMF3(ifstream *fp, ENDF *lib, int mt) { if( (ENDFSeekHead(fp,lib,3,mt))< 0 ) return(-1); lib->resetPOS(); ENDFReadTAB1(fp,lib); return(lib->getPOS()); }
First, DeCE searches for the starting line of that section
with ENDFSeekHead()
and reads its HEAD, then reset index. The
main part is simply read by ENDFReadTAB1()
.
Writing an MF=3 section is much easier. There are only three lines to do this - write HEAD, TAB1, and SEND (section end).
void ENDFWriteMF3(ENDF *lib) { ENDFWriteHEAD(lib); ENDFWriteTAB1(lib); ENDFWriteSEND(lib); }
This is the basic procedure to read/write a section in the ENDF-6 file. However, the order of data blocks are often controlled by a member variable in a CONT record. Below an example is given to the case MF=1, in which the format of delayed / prompt number of neutrons is different - coefficients of a polynomial function are given, or data are tabulated. In the case of delayed neutron, decay constants of precursors are given first.
int ENDFReadMF1(ifstream *fp, ENDF *lib, int mt) { if( (ENDFSeekHead(fp,lib,1,mt))< 0 ) return(-1); lib->resetPOS(); Record head = lib->getENDFhead(); int lnu = head.l2; if(mt == 455){ // delayed neutron ENDFReadLIST(fp,lib); // decay constants if(lnu==1) ENDFReadLIST(fp,lib); // polynomial else ENDFReadTAB1(fp,lib); // tabulated } else if( (mt == 452) || (mt == 456) ){ //prompt or total if(lnu==1) ENDFReadLIST(fp,lib); else ENDFReadTAB1(fp,lib); } return(lib->getPOS()); }
In the current version of DeCE, ENDFReadMFn()
and
ENDFWriteMfn()
, where n is from 1 to 35, except
for 7 (thermal scattering) and 11 (not in use). As mentioned above,
there are some missing data structures in these functions.


About The Summit
The Cape and Islands Youth Climate Action Summit is a day long event for youth and accompanying teachers from across Cape Cod to learn more about the climate crisis, from a number of individual perspectives!
Join us as we discuss Climate Change, how it relates to Cape Cod, and what we can do about it. (There will be food!)
Schedule
-
8:15 AM
Light Breakfast in the Lobby
Panera Bread -
8:45 AM
Brief Welcome
Student Leadership Team -
8:50 AM
Opening Speaker
Alexandra Vecchio, Mass Audubon's Climate Change Program Coordinator -
9:10 AM
Crude: the Musical
Crude Cast and Crew -
9:40 AM
Talkback Panel Q&A
Crude Cast and Crew, Sponsors, Alexandra Vecchio, and Keith Lewison -
10:10 AM
Action Plan How-To
Alexandra Vecchio and Tammy Harper, Director of Education and Community Outreach -
10:45 AM
Break / Travel to Arts Center
School Transportation
-
11:00 AM
Lunch
Rory’s Market & Kitchen -
11:50 AM
Breakout Sessions Round 1
See Breakout Sessions -
12:40 PM
Breakout Sessions Round 2
See Breakout Sessions -
1:30 PM
Action Plan Development
Student Leadership Team -
3:00 PM
Ice Cream Social
Ben & Jerry's
Breakout Sessions
Sunrise Movement (Jack McCoy) and Presidential Politics (Andrew Juan)
Cape Light Compact (Joyce Flynn and Austin Brandt) and E2 Solar (David Schlesinger)
Dr. Kumara Sidhartha and Dr. Jane B. Ward
Cape Cod Regional STEM Network (Bridget Burger), WEEinfo, Inc. (Chris Powicki), and Woods Hole Research Center (Anya Suslova)
Our Sponsors
Special thanks to Panera Bread, Rory’s Market and Kitchen, and Ben and Jerry’s


| PostgreSQL 9.0.10 Documentation | ||||
|---|---|---|---|---|
| Prev | Up | Appendix E. Release Notes | Next |
Release Date: 2008-03-17
This release contains a variety of fixes from 8.2.6. For information about new features in the 8.2 major release, see Section E.72.
A dump/restore is not required for those running 8.2.X. However, you might need to REINDEX indexes on textual columns after updating, if you are affected by the Windows locale issue described below.
Fix character string comparison for Windows locales that consider different character combinations as equal (Tom)
This fix applies only on Windows and only when using UTF-8 database encoding. The same fix was made for all other cases over two years ago, but Windows with UTF-8 uses a separate code path that was not updated. If you are using a locale that considers some non-identical strings as equal, you may need to REINDEX to fix existing indexes on textual columns.
Repair potential deadlock between concurrent VACUUM FULL operations on different system catalogs (Tom)
Fix longstanding LISTEN/NOTIFY race condition (Tom)
In rare cases a session that had just executed a LISTEN might not get a notification, even though one would be expected because the concurrent transaction executing NOTIFY was observed to commit later.
A side effect of the fix is that a transaction that has executed a not-yet-committed LISTEN command will not see any row in pg_listener for the LISTEN, should it choose to look; formerly it would have. This behavior was never documented one way or the other, but it is possible that some applications depend on the old behavior.
Disallow LISTEN and UNLISTEN within a prepared transaction (Tom)
This was formerly allowed but trying to do it had various unpleasant consequences, notably that the originating backend could not exit as long as an UNLISTEN remained uncommitted.
Disallow dropping a temporary table within a prepared transaction (Heikki)
This was correctly disallowed by 8.1, but the check was inadvertently broken in 8.2.
Fix rare crash when an error occurs during a query using a hash index (Heikki)
Fix memory leaks in certain usages of set-returning functions (Neil)
Fix input of datetime values for February 29 in years BC (Tom)
The former coding was mistaken about which years were leap years.
Fix "unrecognized node type" error in some variants of ALTER OWNER (Tom)
Ensure pg_stat_activity.waiting flag is cleared when a lock wait is aborted (Tom)
Fix handling of process permissions on Windows Vista (Dave, Magnus)
In particular, this fix allows starting the server as the Administrator user.
Update time zone data files to tzdata release 2008a (in particular, recent Chile changes); adjust timezone abbreviation VET (Venezuela) to mean UTC-4:30, not UTC-4:00 (Tom)
Fix pg_ctl to correctly extract the postmaster's port number from command-line options (Itagaki Takahiro, Tom)
Previously, pg_ctl start -w could try to contact the postmaster on the wrong port, leading to bogus reports of startup failure.
Use -fwrapv to defend against possible misoptimization in recent gcc versions (Tom)
This is known to be necessary when building PostgreSQL with gcc 4.3 or later.
Correctly enforce statement_timeout values longer than INT_MAX microseconds (about 35 minutes) (Tom)
This bug affects only builds with --enable-integer-datetimes.
Fix "unexpected PARAM_SUBLINK ID" planner error when constant-folding simplifies a sub-select (Tom)
Fix logical errors in constraint-exclusion handling of IS NULL and NOT expressions (Tom)
The planner would sometimes exclude partitions that should not have been excluded because of the possibility of NULL results.
Fix another cause of "failed to build any N-way joins" planner errors (Tom)
This could happen in cases where a clauseless join needed to be forced before a join clause could be exploited.
Fix incorrect constant propagation in outer-join planning (Tom)
The planner could sometimes incorrectly conclude that a variable could be constrained to be equal to a constant, leading to wrong query results.
Fix display of constant expressions in ORDER BY and GROUP BY (Tom)
An explictly casted constant would be shown incorrectly. This could for example lead to corruption of a view definition during dump and reload.
Fix libpq to handle NOTICE messages correctly during COPY OUT (Tom)
This failure has only been observed to occur when a user-defined datatype's output routine issues a NOTICE, but there is no guarantee it couldn't happen due to other causes.


--- layout: page title: About header-img: "img/about-bg.png" ---
USNA grad, former Submarine Officer, passionate engineer and programmer.


edhrec is a service that makes card recommendations for Magic: The Gathering EDH decks.
Recommendations are generated by the edhrec bot, which uses a collaborative filtering algorithm to suggest cards for you to add/replace.
Enter in your commander or a TappedOut deck link and click "Get Recommendations!".
Here are some example queries you can use to try out edhrec.


KNOX
Explore
Import
A Genetic Design Space Repository
Knox is a platform for storing, tracking, and synthesizing combinatorial genetic designs.
Explore
Branches
CSV
Eugene
SBOL
Delete Design
Delete Branch
Reset Commit
Revert Commit
Save as New Commit
Save as New Branch
Apply Operators
Enumerate Designs


--- layout: default ---
DalFox is a fast, powerful parameter analysis and XSS scanner, based on a golang/DOM parser. supports friendly Pipeline, CI/CD and testing of different types of XSS. I talk about naming. Dal(달) is the Korean pronunciation of moon and fox was made into Fox(Find Of XSS).
DalFox's open-source project and made it with ❤
if you want contribute this project, please see CONTRIBUTING.md and Pull-Request with cool your contents


--- layout: page title: Tutoring & Mentoring permalink: /tutoring/ ---
I'm John, a software engineer with 6+ years of experience at companies like Meta, American Express, and venture funded startups like Skiplagged and Kustomer.
Since you're here, I'm assuming you either want tutoring or mentorship, or are just taking a look! Either way, welcome to my home on the internet.
How I can help: Computer science requires a strong foundation, but once you have that foundation, you can learn almost any of it by yourself. I'll help you by identifying what you are getting confused by, and coming up with exercises and examples for you to learn by doing.
How I can help: I've been in this position myself, and I've coached several other bootcamp graduates who now all are employed. We can take a look at your profile together, and I can share some advice on how to stand out and be an exceptional candidate, even without prior industry experience.
How I can help: As someone who has been promoted to senior engineer before, I know firsthand how confusing the criteria for senior engineer can be. Usually technical chops are not what's lacking. Instead, it's more about behaviors and habits. We'll review your work routine and I can provide some advice on where you can make adjustments.
Knowing how to code has transformed my life.
It's provided me abundant career opportunities. It's allowed me to meet some of my best friends. And it may be the most powerful tool for creation we have today.
All the instructors and resources I've ever learned from gave me one of the biggest gifts I could have ever received, and I want to be able to give that gift to the future generation of engineers too.
Here's why I think I would be a good tutor or mentor for you.
I currently have 1 active student so still have room for 1 more.
You can contact me through this Google Form! Talk soon!


#include "common/PxSerialFramework.h"
Go to the source code of this file.
Classes | |
| class | PxCollection |
| Collection class for serialization. More... | |
Functions | |
| PX_PHYSX_COMMON_API physx::PxCollection *PX_CALL_CONV | PxCreateCollection () |
| Creates a collection object. More... | |


Glyph hack, Save as icon image. /* This tool is an unofficial tool */ Enjoy glyph-hacking and Ingress!!


|
|
|
Causes
There are numerous causes of this disorder. They include:
- physical problems, such as endometriosis, cystitis, or vaginitis
- systemic problems, such as diabetes, high blood pressure, or hypothyroidism. Even pregnancy or the postpartum period (time after delivery of a child) may affect desire. Menopause is also known to reduce sexual desire.
- medications, including oral contraceptives, anti-depressants, antihypertensives, and tranquilizers
- surgery, such as mastectomy or hysterectomy which may affect how a woman feels about her sexual self.
- stress
- depression
- use of alcohol, drugs, or cigarette smoking
|
|


the-foundry
Businessmodel of The Foundry
Customer Segments
Foundry provides a range of creative and design software products and services to commercial customers across a range of industries. According to the Company’s website, it principally serves customers across the following categories:
- Film and Television, including movie and television studios, specialist visual effects artists and companies, and production companies;
- Design, including designers of consumer goods, electronics, toys, jewellery, accessories, and various other products;
- Games and Virtual Reality, including games developers, software studios, and specialist virtual and augmented reality developers;
- Automotive, including automotive manufacturers and designers;
- Apparel, including designers of clothing, footwear, and other apparel items; and
- Education, including students, graduates, and educators. Foundry names several of its clients on its website, including high-profile names such as Brooks Running, Mercedes Benz, LAIKA, and Blur Studio.
Foundry principally serves customers in its native UK, as well as in the US. The Company’s products are available worldwide, however, with the Company serving clients across a range of geographic markets.
Value Propositions
Foundry provides value to its clients in the following ways:
- Its reputation and industry standing, with the Company established as a reliable and well-regarded provider of design and creative software products, with its positive track record demonstrated by its ability to secure business from high-profile companies such as Mercedes Benz and its involvement in popular projects such as the movie Gravity;
- Its innovative solutions and proprietary technologies, with the Company utilising a range of proprietary technologies in its products, making its offerings unique, as well as maintaining a commitment to developing new and innovative products, ensuring it remains at the industry’s cutting edge;
- Its industry expertise and experience, with the Company employing high-trained, specialist technical personnel, and having experience of working on numerous high-profile design projects across multiple industries;
- The flexibility of its various products, with the Company offering a broad catalogue of design software products that cater to a diverse commercial client base, including customers in the media, automotive, apparel, and games industries; and
- Its international reach, with the Company making its products available to a broad international client base. ### Channels
Foundry operates a website at www.foundry.com, through which it provides information on its product catalogue, its target industries, and its corporate activities.
The Company also operates an online sales channel through its website, with customers able to browse products, make purchases, and organises free software trials. Foundry’s online store appears to be its principal sales channel. The Company does, however, employ dedicated sales personnel who operate out of the Company’s offices in the UK, Ireland, the US, China, and Japan.
Foundry additionally makes a portion of its sales through a network of channel and distribution partners. This includes various authorised resellers, independent software vendors, and sales agents. The services of these partners are utilised principally across various international markets in which the Company is not directly represented.
Customer Relationships
Foundry makes its entire product portfolio available to customers on a self-service basis. Customers are able to browse the Company’s products, make purchases, organises trials and tutorials, and make payments through the Company’s website without interacting directly with members of the Company’s sales and service teams.
Foundry provides ongoing support to its customers. Customers are able to create support request through the Company’s website, with customers able to access personalised assistance and guidance with unique problems.
The Company also makes the contact details of its various international offices available, enabling customers to call the Company directly. Foundry additionally operates an extensive support centre, through which customers can access a wide range of resource, such as FAQs, technical documentation, and licensing information.
Foundry hosts an online community portal, through which users can interact with one another, discuss problems and ideas, and collaborate on projects. It also operates several social media accounts – including with Facebook, Google+, Twitter, YouTube, and Vine – through which it is able to publish company updates and interact directly with customers.
Key Activities
Foundry is a developer and seller of software solutions for artists and designers in the design, film, television, shortform, and games industries in the UK and internationally.
The company offers an extensive suite of products, including NUKE, a node-based compositor; MODO that provides 3D modeling, animation, sculpting, effects, and rendering solutions; MARI, a 3D paint tool that enables users to paint directly onto 3D models; and HIERO that gives shot management, conform, and review solutions.
The Company also offers products that include collection of plug-in tools, solutions lighting in CG projects, and web-based visual story development tools. Foundry is headquartered in the UK, and has operating offices in the US, Ireland, Japan, and China.
Key Partners
Foundry works closely with a network of partners that support its various development and distribution operations. These partners can be organised broadly into the following categories:
- Supplier and Vendor Partners, comprising suppliers of services, technologies, and equipment that are utilised across the enterprise in support of its core development and distribution operations;
- Channel and Distribution Partners, comprising the Company’s network of independent software vendors, sales agents, and authorised resellers that assist in extending the Company’s own in-house sales and marketing reach;
- Technology and Development Partners, comprising various technology companies, IT service providers, and software developers that assist in the development of the Company’s products and the maintenance of its IT systems; and
- Strategic and Alliance Partners, comprising companies across range of sectors, with which the Company collaborates on a range of joint projects, including in marketing, branding, and development. Foundry has a number of partnerships in place. In recent years, the Company has launched partnerships with MakerBot and DreamSpace, and secured funding form several financial partners.
Key Resources
Foundry’s key resources are its technologies and intellectual properties, its software products and solutions, its IT and communications infrastructure, its sales and distribution channels, its partnerships, and its personnel.
While Foundry utilises a range of proprietary technologies in the development of its unique software products, searches of records published by the US Patent and Trademark Office identified no patent applications files in the name of Foundry, either as applicant or assignee.
Foundry additionally owns and or leases a number of physical properties around the world. This principally comprises its network of offices across the UK, China, Japan, Ireland, and the US.
Cost Structure
Foundry incurs costs in relation to the development of its technologies and products, the development and maintenance of its online retail platform, the maintenance of its IT and communications infrastructure, the procurement of professional services, the operation of its sales and distribution channels, the management of its partnerships, the implementation of marketing and advertising campaigns, and the retention of its personnel.
Revenue Streams
Foundry generates revenue through the development and sale of various design and creative software products to customers across a number of industries, notably the design, movie and television, and apparel sectors.
The Company derives its revenue by selling and renting licenses for its various software products. The prices for products vary, with the Company’s most recent products NUKE and NUKEX for sale at €3,104 and €5,855 respectively.
Foundry remains a privately owned company and as such is not obliged to publish its financial results online. Research identified no reference to the Company’s revenue figures. A third party corporate database, however, estimates that the Company generates between $100 million and $250 million each year.


|
Clingo C API
C API for clingo providing high level functions to control grounding and solving.
|
Inspection of models and a high-level interface to add constraints during solving.
For an example, see model.c.
Typedefs | |
| typedef struct clingo_solve_control | clingo_solve_control_t |
| Object to add clauses during search. | |
| typedef struct clingo_model | clingo_model_t |
| Object representing a model. | |
| typedef int | clingo_model_type_t |
| Corresponding type to clingo_model_type_e. | |
| typedef unsigned | clingo_show_type_bitset_t |
| Corresponding type to clingo_show_type_e. | |
Enumerations | |
| enum | clingo_model_type_e { clingo_model_type_stable_model = 0, clingo_model_type_brave_consequences = 1, clingo_model_type_cautious_consequences = 2 } |
| Enumeration for the different model types. More... | |
| enum | clingo_show_type_e { clingo_show_type_shown = 2, clingo_show_type_atoms = 4, clingo_show_type_terms = 8, clingo_show_type_theory = 16, clingo_show_type_all = 31, clingo_show_type_complement = 32 } |
| Enumeration of bit flags to select symbols in models. More... | |
Functions for Inspecting Models | |
| CLINGO_VISIBILITY_DEFAULT bool | clingo_model_type (clingo_model_t const *model, clingo_model_type_t *type) |
| Get the type of the model. More... | |
| CLINGO_VISIBILITY_DEFAULT bool | clingo_model_number (clingo_model_t const *model, uint64_t *number) |
| Get the running number of the model. More... | |
| CLINGO_VISIBILITY_DEFAULT bool | clingo_model_symbols_size (clingo_model_t const *model, clingo_show_type_bitset_t show, size_t *size) |
| Get the number of symbols of the selected types in the model. More... | |
| CLINGO_VISIBILITY_DEFAULT bool | clingo_model_symbols (clingo_model_t const *model, clingo_show_type_bitset_t show, clingo_symbol_t *symbols, size_t size) |
| Get the symbols of the selected types in the model. More... | |
| CLINGO_VISIBILITY_DEFAULT bool | clingo_model_contains (clingo_model_t const *model, clingo_symbol_t atom, bool *contained) |
| Constant time lookup to test whether an atom is in a model. More... | |
| CLINGO_VISIBILITY_DEFAULT bool | clingo_model_is_true (clingo_model_t const *model, clingo_literal_t literal, bool *result) |
| Check if a program literal is true in a model. More... | |
| CLINGO_VISIBILITY_DEFAULT bool | clingo_model_cost_size (clingo_model_t const *model, size_t *size) |
| Get the number of cost values of a model. More... | |
| CLINGO_VISIBILITY_DEFAULT bool | clingo_model_cost (clingo_model_t const *model, int64_t *costs, size_t size) |
| Get the cost vector of a model. More... | |
| CLINGO_VISIBILITY_DEFAULT bool | clingo_model_optimality_proven (clingo_model_t const *model, bool *proven) |
| Whether the optimality of a model has been proven. More... | |
| CLINGO_VISIBILITY_DEFAULT bool | clingo_model_thread_id (clingo_model_t const *model, clingo_id_t *id) |
| Get the id of the solver thread that found the model. More... | |
| CLINGO_VISIBILITY_DEFAULT bool | clingo_model_extend (clingo_model_t *model, clingo_symbol_t const *symbols, size_t size) |
| Add symbols to the model. More... | |
Functions for Adding Clauses | |
| CLINGO_VISIBILITY_DEFAULT bool | clingo_model_context (clingo_model_t const *model, clingo_solve_control_t **control) |
| Get the associated solve control object of a model. More... | |
| CLINGO_VISIBILITY_DEFAULT bool | clingo_solve_control_symbolic_atoms (clingo_solve_control_t const *control, clingo_symbolic_atoms_t const **atoms) |
| Get an object to inspect the symbolic atoms. More... | |
| CLINGO_VISIBILITY_DEFAULT bool | clingo_solve_control_add_clause (clingo_solve_control_t *control, clingo_literal_t const *clause, size_t size) |
| Add a clause that applies to the current solving step during model enumeration. More... | |
| enum clingo_model_type_e |
Enumeration for the different model types.
| enum clingo_show_type_e |
Enumeration of bit flags to select symbols in models.
| Enumerator | |
|---|---|
| clingo_show_type_shown | Select shown atoms and terms. |
| clingo_show_type_atoms | Select all atoms. |
| clingo_show_type_terms | Select all terms. |
| clingo_show_type_theory | Select symbols added by theory. |
| clingo_show_type_all | Select everything. |
| clingo_show_type_complement | Select false instead of true atoms (clingo_show_type_atoms) or terms (clingo_show_type_terms). |
| CLINGO_VISIBILITY_DEFAULT bool clingo_model_contains | ( | clingo_model_t const * | model, |
| clingo_symbol_t | atom, | ||
| bool * | contained | ||
| ) |
Constant time lookup to test whether an atom is in a model.
| [in] | model | the target |
| [in] | atom | the atom to lookup |
| [out] | contained | whether the atom is contained |
| CLINGO_VISIBILITY_DEFAULT bool clingo_model_context | ( | clingo_model_t const * | model, |
| clingo_solve_control_t ** | control | ||
| ) |
Get the associated solve control object of a model.
This object allows for adding clauses during model enumeration.
| [in] | model | the target |
| [out] | control | the resulting solve control object |
| CLINGO_VISIBILITY_DEFAULT bool clingo_model_cost | ( | clingo_model_t const * | model, |
| int64_t * | costs, | ||
| size_t | size | ||
| ) |
Get the cost vector of a model.
| [in] | model | the target |
| [out] | costs | the resulting costs |
| [in] | size | the number of costs |
| CLINGO_VISIBILITY_DEFAULT bool clingo_model_cost_size | ( | clingo_model_t const * | model, |
| size_t * | size | ||
| ) |
Get the number of cost values of a model.
| [in] | model | the target |
| [out] | size | the number of costs |
| CLINGO_VISIBILITY_DEFAULT bool clingo_model_extend | ( | clingo_model_t * | model, |
| clingo_symbol_t const * | symbols, | ||
| size_t | size | ||
| ) |
Add symbols to the model.
These symbols will appear in clingo's output, which means that this function is only meaningful if there is an underlying clingo application. Only models passed to the clingo_solve_event_callback_t are extendable.
| [in] | model | the target |
| [in] | symbols | the symbols to add |
| [in] | size | the number of symbols to add |
| CLINGO_VISIBILITY_DEFAULT bool clingo_model_is_true | ( | clingo_model_t const * | model, |
| clingo_literal_t | literal, | ||
| bool * | result | ||
| ) |
Check if a program literal is true in a model.
| [in] | model | the target |
| [in] | literal | the literal to lookup |
| [out] | result | whether the literal is true |
| CLINGO_VISIBILITY_DEFAULT bool clingo_model_number | ( | clingo_model_t const * | model, |
| uint64_t * | number | ||
| ) |
Get the running number of the model.
| [in] | model | the target |
| [out] | number | the number of the model |
| CLINGO_VISIBILITY_DEFAULT bool clingo_model_optimality_proven | ( | clingo_model_t const * | model, |
| bool * | proven | ||
| ) |
Whether the optimality of a model has been proven.
| [in] | model | the target |
| [out] | proven | whether the optimality has been proven |
| CLINGO_VISIBILITY_DEFAULT bool clingo_model_symbols | ( | clingo_model_t const * | model, |
| clingo_show_type_bitset_t | show, | ||
| clingo_symbol_t * | symbols, | ||
| size_t | size | ||
| ) |
Get the symbols of the selected types in the model.
| [in] | model | the target |
| [in] | show | which symbols to select |
| [out] | symbols | the resulting symbols |
| [in] | size | the number of selected symbols |
| CLINGO_VISIBILITY_DEFAULT bool clingo_model_symbols_size | ( | clingo_model_t const * | model, |
| clingo_show_type_bitset_t | show, | ||
| size_t * | size | ||
| ) |
Get the number of symbols of the selected types in the model.
| [in] | model | the target |
| [in] | show | which symbols to select |
| [out] | size | the number symbols |
| CLINGO_VISIBILITY_DEFAULT bool clingo_model_thread_id | ( | clingo_model_t const * | model, |
| clingo_id_t * | id | ||
| ) |
Get the id of the solver thread that found the model.
| [in] | model | the target |
| [out] | id | the resulting thread id |
| CLINGO_VISIBILITY_DEFAULT bool clingo_model_type | ( | clingo_model_t const * | model, |
| clingo_model_type_t * | type | ||
| ) |
Get the type of the model.
| [in] | model | the target |
| [out] | type | the type of the model |
| CLINGO_VISIBILITY_DEFAULT bool clingo_solve_control_add_clause | ( | clingo_solve_control_t * | control, |
| clingo_literal_t const * | clause, | ||
| size_t | size | ||
| ) |
Add a clause that applies to the current solving step during model enumeration.
| [in] | control | the target |
| [in] | clause | array of literals representing the clause |
| [in] | size | the size of the literal array |
| CLINGO_VISIBILITY_DEFAULT bool clingo_solve_control_symbolic_atoms | ( | clingo_solve_control_t const * | control, |
| clingo_symbolic_atoms_t const ** | atoms | ||
| ) |
Get an object to inspect the symbolic atoms.
| [in] | control | the target |
| [out] | atoms | the resulting object |


Hi this is my github repo I think
I can't be bothered to make this index page look good sorry
Here's some links


Constituency profile: Dudley North
Labour faces a battle to hold one of the most marginal seats in the country.
Labour won the constituency of Dudley North in 2017 by a majority of just 22.
The winning candidate was Ian Austin: an MP with a track record for pulling off wafer-thin victories.
Having become MP for the seat in 2005, in 2010 Austin held Dudley North with a majority of only 649.
He held on again in 2015, increasing his majority to 4,181.
In 2017 two recounts were necessary before Austin was declared the winner.
With his new majority of 22, he was now MP for one of the most marginal seats in the country.
The 2019 election will be a very different contest, however.
He has also encouraged his constituents to cast their vote at this election for the Conservatives.
Labour is fielding a brand new candidate, Melanie Dudley, who appeared alongside Jeremy Corbyn at a campaign event in the constituency on Thursday.
Ms Dudley is up against three other candidates, from the Conservatives, Liberal Democrats and Greens.
The Conservatives will be hoping that Ian Austin’s intervention will boost their chances of victory.
The party has never had an MP for Dudley North since the seat was created in 1997.
Meanwhile, Labour will be hoping there is enough residual support in the constituency to see them over the line.
But with a swing of only 0.03% needed for the seat to change hands, they face a huge battle to cling on.


--- title: Happy Labor Day weekend! date: 2016-09-02 00:00:00 -06:00 categories: - whats-blooming layout: post blog-banner: whats-blooming-now-fall.jpg post-date: September 02, 2016 post-time: 1:55 PM blog-image: wbn-default.jpg ---
Pink Octopus
Bellflower Campanula 'Pink Octopus'
Can you tell why this flower is called Pink Octopus?
Loebner Magnolia Magnolia x loebneri 'Merrill'
Hey Miss Magnolia, what unusual fruit you have!
Swamp Leather Flower Clematis crispa
This gorgeous flower can be seen along the Floral Walk.
Bulgarian Carrot Capsicum annuum 'Bulgarian Carrot'
These peppers in the Herb Garden may look like carrots, but they sure don't taste like them!
Creeping Raspberry Rubus pentalobus
Orange raspberries! Did you know there was such a thing? Not to mention they are quite tasty.


Kubernetes has a web-based user interface that displays the current cluster state graphically.
By default, the Kubernetes UI is deployed as a cluster addon. To access it, visit https://<kubernetes-master>/ui
, which redirects to https://<kubernetes-master>/api/v1/proxy/namespaces/kube-system/services/kube-ui/#/dashboard/
.
If you find that you’re not able to access the UI, it may be because the kube-ui service has not been started on your cluster. In that case, you can start it manually with:
kubectl create -f cluster/addons/kube-ui/kube-ui-rc.yaml --namespace=kube-system
kubectl create -f cluster/addons/kube-ui/kube-ui-svc.yaml --namespace=kube-system
Normally, this should be taken care of automatically by the kube-addons.sh
script that runs on the master.
The Kubernetes UI can be used to introspect your current cluster, such as checking how resources are used, or looking at error messages. You cannot, however, use the UI to modify your cluster.
After accessing Kubernetes UI, you’ll see a homepage dynamically listing out all nodes in your current cluster, with related information including internal IP addresses, CPU usage, memory usage, and file systems usage.
Click on the “Views” button in the top-right of the page to see other views available, which include: Explore, Pods, Nodes, Replication Controllers, Services, and Events.
The “Explore” view allows your to see the pods, replication controllers, and services in current cluster easily.
The “Group by” dropdown list allows you to group these resources by a number of factors, such as type, name, host, etc.
You can also create filters by clicking on the down triangle of any listed resource instances and choose which filters you want to add.
To see more details of each resource instance, simply click on it.
Other views (Pods, Nodes, Replication Controllers, Services, and Events) simply list information about each type of resource. You can also click on any instance for more details.
For more information, see the Kubernetes UI development document in the www directory.


Create User
Select your favourite superhero:
Superman
Batman
Wonder Woman
Flash
Thor
Hulk
Select your favourite video game:
Fallout
GTA
Half Life
Uncharted


Very good, very red sweatshirt for winter season. Mostly made from wool. New year, snow, winter, bla, bla, bla
56$
Only today you got a discount for every thing 10%. Hurry up!. AAAAAAAAAAAAAAAAAAAA!


{% extends 'layout.html' %} {% block pageTitle %} Question page {% endblock %} {% block content %}
Any children under 20 included on your tax credit claim are also entitled to the same help.
Your partner and any children under 20 included on your tax credit claim are also entitled to the same help.
You don't have to do anything more, although you may have to show proof you get tax credit to your pharmacist, optician or dentist.
You can use your tax credit exemption certificate, this is a small plastic card that should have been sent to you.
If you have lost it, you can use your latest tax credit award notice as proof.
What did you think of this service? (Takes 30 seconds)


1.) this is Better Battlelog, not Battlelog. We can't fix this issue.
2.) check your LOCAL Browser settings, i think you have disabled CSS in your browser settings AND/OR you have changed the setting to only show HTML code, no CSS and no JS.
3.) if 2. doesn't help, pls try it in the official Battlelog Forum on
http://battlelog.battlefield.com/forum
:-)
GreatApo
Open battlelog with on other browser. If the css runs there, then your browser settings have disabled the css OR you have install an addon that does so.


This web scheduler is a fork of
Nextdoor/ndscheduler
and written in Python.
The source code can be found on
palto42/ndscheduler
ndscheduler version {{ website_info['version'] }}
Job packs: {{ website_info['job_versions'] }}
Contributors: see GitHub
This software is published under BSD 2-Clause "Simplified" License
| Job Name | Schedule (UTC) | Next Run | Action |
|---|
| Job Name | Status | Scheduled At (local) | Last Updated At (local) | Description |
|---|
| Job Name | Event | User | Time (local) | Description |
|---|


{% load staticfiles %}
Home Page Twistouts/braidouts Braids/Addins WashNgo How To Profile Page
"Braids/Addins" also know as "protective styles" is a good way to maintain you natural hair. Here you can learn how to care for these styles and also find diffrent tutorials of your intrest to help you care for your natural hair.


study
ACB+LIA
Perlas 2013
Andersen 2013,
Gwam 2017
Zhou 2017
Overall (I-squared = 0.0%, p = 0.566)
P=0.000
NOTE: Weights are from random effects analysis
LIA
WMD (95% CI)
~0.50 (-0.72, -0.28)
~0.40 (-0.87, 0.07)
0.46 (-0.54, -0.38)
0.07 (-0.63, 0.49)
~0.46 (-0.53, -0.38)
Weight
wz
261
83.80
1.82
100.00


This is an asynchronous boostrap function that runs before your Sails app gets lifted (i.e. starts up). This gives you an opportunity to set up your data model, run jobs, or perform some special logic.
module.exports.bootstrap = function (cb) {
// It's very important to trigger this callback method when you are finished
// with the bootstrap! (otherwise your server will never lift, since it's waiting on the bootstrap)
cb();
};


OFFICIAL CRYPTO PHOTOS DOCUMENTATION
The Crypto Photos project logo:
The Crypto Photos project website: http://crypto.photos
The explosive emergence of decentralized and distributed technologies (otherwise known as "blockchain" technology) has given way to a flood of new talent entering the ecosystem. As a result, new industry-specific apps and programs are being released on a daily basis. One of the most common needs of the developers is to simply have access to an exhaustive library of cryptocurrency asset icons...
It is for this reason that the Crypto Photos project aspires to be the most complete collection of cryptocurrency asset icons on the internet!
FORMATTING & SYNTAX
All source photos are formatted as .PNG and are sized at exactly 300x300 px
All photos displayed on the project website are rendered at 150x150 px
Search by asset symbol's first letter
To view all asset icons beginning with a specific letter of the alphabet, simply navigate to the index of that letter by using the URL format below:
http://crypto.photos/x
where "x" is the letter of the alphabet that you wish to search.
Search for assets with non-alphabetic first characters
To vew all asset icons which begin with non-letter characters, navigate to the following URL:
http://crypto.photos/num
Direct logo icon linking
To link directly to a specific icon use the following format:
http://crypto.icon/x/xyz.png
where "x" is the first letter of the asset symbol, and "xyz" is the lowercase asset symbol. Be sure to add the file type (.png) onto the end.
FEEDBACK
You can connect with the developers of this project by sending an email to the following address:
<EMAIL_ADDRESS>LICENSE
Copyright 2017 ResoNova
Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions:
The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.
 IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
think outside the box


I am continually amazed at the beautiful, delicate Blue Flax that somehow took hold in my garden. They are awash in color every morning, yet not a single flower remains by the afternoon. They are the very definition of ephemeral.
I am continually amazed at the beautiful, delicate Blue Flax that somehow took hold in my garden. They are awash in color every morning, yet not a single flower remains by the afternoon. They are the very definition of ephemeral.
© Blue Flax Society.


1 or more errors found. The following files contained errors and were excluded from the upload. Click each message for details
1 or more warnings found. Click each message for details
Successfully uploaded all files!
All files not listed below were successfully uploaded. You will need to wait up to 30 minutes for images to process and to be visible in Geome.


Emmet's Suite Blahg Post#1
The subtitle, if you want it
2015.12.07
What are the benefits of version control? Well first of all, version control is amazing. With version control you can efficiently keep tabs on all of the stages of progress and project makes as it develops. Whether it is a small group of developers or an open source project with an unlimited about of contributers version control provides the platform in which development work can be contributed by one individual and confirmed for implementation by another in a communally progressive way. Not only that, with each improvement - or 'version' a snapshot is taken of the project at that state, so in the event of bugs and any other problems or revisional demands, any given previous 'snapshot' or 'commit' can be restored at any of these stages in the need to "go back a few steps."
How does git help you keep track of changes? It tells you who made changes, or commits, when and why. The commit log stores all of this information.
Why use GitHub to store your code? So you can develop your code with a group of interactive developers and restore every stage of its development for retro-active work or just as a case-study of how the project evolved over time into its current or final state.


Web Developer • Third Born Child • 4 blidings
grew up and lived in indramayu, west java
Hello, I'm Winingsih Purwati.. usually people call me Wiwin
.
I'm a web developer from Indramayu, West Java, Indonesia.
I'm fast learner and flexible, I also like new things about tech, data science, and hobby of sewing also love Hypertext preprocessor and Javascript
Experience
PT. Jaring Solusi Aplikasi (Net2Software)
Programmer
Dec 2019 – April 2020
Job Desc :
- Develop web-based Online Examination application for FORKI
PT. Fiber Networks Indonesia
Programmer
Oct 2019 – Dec 2019
Job Desc :
- Develop api social media for customer hotel
PT. Daya Sinergi Telekomunikasi
Programmer
Jul 2018 – Jul 2019
Job Desc :
- Develop web-based Human Resource (HRIS) application
- Create a web-based Video Conferences application
- Create a web-based User Manager Mikrotik application
- Develop web-based Internal Video Conferences
- Develop web-based Purchasing
PT. Andalas Media Informatika
Supervisor Programmer
Oct 2017 – Jul 2018
Job Desc :
- Develop web-based Human Resource (HRIS) application
- Create a web-based Customer Relationship Management (CRM) application
- Create a web-based Purchasing application
- Create a web-based Inventory application
PT. Jaring Solusi Aplikasi (Net2Software)
Delivery Solutions & Product (Project Manager)
Oct 2016 – Oct 2017
Job Desc :
- Meeting with clients or prospective customers
- Deliver Minutes of Meeting (MOM)
- Design the system with a systems analyst team (Fowchart, Relational DB, etc)
- Division of tasks for programmers and scheduling
- Collecting programmer tasks
- Manual software tester
- User Acceptance Test (UAT) with clients or customers
- Documentation (User Manual/User Guide)
- Technical Documentation
Internship
PT. Integrasia Utama
Junior Web Developer
Jul 2015 – Dec 2015
Job Desc :
- Create a web-based Ticketing application
- Create a web-based Inventory application
- Create a web-based Customer Service application
PT. Panasonic Industrial Component Indonesia
Operator Production (Quality Control Inspector - Appearance)
Nov 2012 – Dec 2013
Job Desc :
- Inspect components (capasitor)


ps_mark_tree()
generates a random environment variable name and sets
it in the current R process. This environment variable will be (by
default) inherited by all child (and grandchild, etc.) processes, and
will help finding these processes, even if and when they are (no longer)
related to the current R process. (I.e. they are not connected in the
process tree.)
ps_mark_tree() with_process_cleanup(expr) ps_find_tree(marker) ps_kill_tree(marker, sig = signals()$SIGKILL)
| expr | R expression to evaluate in the new context. |
|---|---|
| marker | String scalar, the name of the environment variable to use to find the marked processes. |
| sig | The signal to send to the marked processes on Unix. On Windows this argument is ignored currently. |
ps_mark_tree()
returns the name of the environment variable,
which can be used as the marker
in ps_kill_tree()
.
ps_find_tree()
returns a list of ps_handle
objects.
ps_kill_tree()
returns the pids of the killed processes, in a named
integer vector. The names are the file names of the executables, when
available.
with_process_cleanup()
returns the value of the evaluated expression.
ps_find_tree()
finds the processes that set the supplied environment
variable and returns them in a list.
ps_kill_tree()
finds the processes that set the supplied environment
variable, and kills them (or sends them the specified signal on Unix).
with_process_cleanup()
evaluates an R expression, and cleans up all
external processes that were started by the R process while evaluating
the expression. This includes child processes of child processes, etc.,
recursively. It returns a list with entries: result
is the result of
the expression, visible
is TRUE if the expression should be printed
to the screen, and process_cleanup
is a named integer vector of the
cleaned pids, names are the process names.
If expr
throws an error, then so does with_process_cleanup()
, the
same error. Nevertheless processes are still cleaned up.


As I start my first day of university tomorrow, I’d like to share with you grade 12’s the process of applying to university. This post will be a brief timeline and will only contain information about Ontario universities. I didn’t apply to Out of Province universities so I’m not knowledgable about that. By the way, I went to a semestered school in Ontario.
It’s 7:00am and right now I’m in the car leaving off to Waterloo. I will be living in a single room in Village 1. I will cover the topic of residences in a future post!
I’ve been preparing myself for move in day for months now. I’m still astonished by how fast semester 2 and the summer went. Of course, there were some moments that went incredibly slow (cramming for Chemistry tests, procrastinating on English essays, preparing for interviews, etc.) I don’t normally get this hyped for an event but this is the university life we’re talking about. My expectations of Waterloo are probably way too high right now. I’m sure it won’t disappoint as long as I make an effort to enjoy it.
To be precise, my official move in day is tomorrow (September 1st) but I requested to move in earlier due to a scheduling conflict. I hope there will be at least one person in my residence today. Nevertheless, I am excited to meet everyone from my floor and building tomorrow. I’ll probably roam around Waterloo tonight and hang out with my friends.
Anyways, I’m almost at Waterloo. It’s going to be bittersweet saying goodbye to my parents in a few hours. Oh well, c’est la vie.
Hey everyone! My name is Bo Peng and I’m a first-year Software Engineering student at the University of Waterloo. I’ll be blogging about my experiences (both good and bad) here. I’ll also post some informational stuff for you keen high schoolers wanting to apply to university.
I better get back to packing now… Move in day is tomorrow!


Bears vs. Rams prediction: Chicago will keep it close
by Brady Kannon, VSiNWhen the NFL set up this rematch from last season for “Sunday Night Football,” it figured it would be a dandy.
As it turns out, the hangover for the Super Bowl loser has been real, as the Rams are just 5-4 and third in the NFC West, and their newly signed, $134 million quarterback, Jared Goff, is in the bottom of the league for QB ranking.
It’s worse for their opponent, as the Bears are 4-5, own the 28th-ranked rushing offense and the No. 30 passing offense, and their quarterback, Mitchell Trubisky, ranks lower than Goff.
A positive for both sides has been defense. The Bears’ Khalil Mack and the Rams’ Aaron Donald are probably the most valuable defenders in the NFL, and it is likely that this game will be dictated by the defenses.
I believe the edge here comes on the defensive side and is in favor of the Bears, who allow just 17.4 points per game, fourth best in the league. This shapes up to be an ugly, defensive game in which points will be at a premium. I prefer to take the better defense and an underdog catching nearly a touchdown. I made this line Rams -5, and when I saw it open at Rams -7, I grabbed Chicago at the key number.
The Play: Da Bears, +6 ¹/₂ or better


Conway's Game of Life is the textbook example of Cellular Automata. Each cell follows a simple set of rules that decides if it will survive in the next generation, based on the amount of neighbouring cells, in this case:
- Less than 2 - the cells dies, as if by underpopulation.
- 2 or 3 - the cell survies to the next generation.
- More than 3 - the cells dies, as if by overpopulation.
- Exactly 3 - a new cell is born, as if by reproduction.
In this version of the game, everybody plays with the same grid at the same time. It's your collective goal to keep the cell population above 5% for as long as possible, or the game will reset. The cells can survive on their own for a limited amount of time, but to keep them alive for as many generations as possible you'll have to intervene by creating and killing cells at will! This is easy on your own at first but as time goes on generations will advance at accelerating speeds.
Designed and developed during spare time over the course of a week by Hugh Kennedy using Node.JS to run the server and NowJS to handle any otherwise nasty real-time stuff.