This HTML5 document contains 88 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

PrefixNamespace IRI
n18http://dbkwik.webdatacommons.org/resource/vJ_m4upH5fhjzmBhrlq2ZQ==
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n22http://dbkwik.webdatacommons.org/resource/cLdc_izgvd0hqPjCMhnpUg==
n48http://dbkwik.webdatacommons.org/resource/jkIuZ9xnoIK4jXb4fO7gmQ==
n59http://dbkwik.webdatacommons.org/resource/W__-XfbIIR54oEiA8Hu9PQ==
n77http://dbkwik.webdatacommons.org/resource/uZsUXx4_fhw75HPKsj8W6Q==
n43http://dbkwik.webdatacommons.org/resource/PxtHqtk3mZvFCfiQZMAGgA==
n31http://dbkwik.webdatacommons.org/resource/HUkRDwDQ7jCRXFPW5lK25w==
n38http://dbkwik.webdatacommons.org/resource/hvQFH6yelqwU9vbt7FivNA==
n11http://dbkwik.webdatacommons.org/resource/tQmkhwnCgp2OKtSivg73Dg==
n25http://dbkwik.webdatacommons.org/resource/k7ofOJh3ORe5M8xsj7L06Q==
n27http://dbkwik.webdatacommons.org/resource/K6WdLvgCF4rO81e5luvenA==
n89http://dbkwik.webdatacommons.org/resource/pwGYN7fNcAKvdoGi53cfVQ==
n81http://dbkwik.webdatacommons.org/resource/VElr8U4Yp_dpF40S_Jczig==
n63http://dbkwik.webdatacommons.org/resource/SUmA21p6NwOQFYYFq8oPXw==
n62http://dbkwik.webdatacommons.org/resource/XJ02lsDGSInR7EXy5cAvxA==
n85http://dbkwik.webdatacommons.org/resource/-k2WAaFefRmoZuxnTohizg==
n53http://dbkwik.webdatacommons.org/resource/WuLf91wzNDPD6JoqZ98ZQg==
n70http://dbkwik.webdatacommons.org/resource/S080uxYB9WVDJxd2KwNagA==
n34http://dbkwik.webdatacommons.org/resource/XUC2A3SkXurMsfkXV7M6kg==
n8http://dbkwik.webdatacommons.org/resource/dx4OlmGF5e_oJhviT8qR2A==
n67http://dbkwik.webdatacommons.org/resource/XT5BaPFaosxYfJ22mrXWOw==
n20http://dbkwik.webdatacommons.org/resource/Ockw_2cp4-p4qqsfvC2BBw==
n84http://dbkwik.webdatacommons.org/mafiawars/property/
n13http://dbkwik.webdatacommons.org/resource/I00QxKQCAeEeUJRNqr3SlQ==
n78http://dbkwik.webdatacommons.org/resource/NxPlapp_jqnRksiqbl_M-Q==
n82http://dbkwik.webdatacommons.org/resource/DEPCtsL3isv93jHwz965aQ==
n35http://dbkwik.webdatacommons.org/resource/VrAJUJNNnHxHdjtqETYvMQ==
n72http://dbkwik.webdatacommons.org/resource/2hlzkB4oFXvvYQYMobKj4w==
n40http://dbkwik.webdatacommons.org/resource/XqEN0GkfHYNIgJ4DU8-aEQ==
xsdhhttp://www.w3.org/2001/XMLSchema#
n2http://dbkwik.webdatacommons.org/resource/kxpX4jLjoakjMJrbhHp54Q==
n94http://dbkwik.webdatacommons.org/resource/i36WmiFZ5JrYLir4g7rlwA==
n39http://dbkwik.webdatacommons.org/resource/YKzFtAHYyBZalmxYOj-cVg==
n93http://dbkwik.webdatacommons.org/resource/THE5nAFUAg47--MZGV8FXg==
n9http://dbkwik.webdatacommons.org/sca21/property/
n29http://dbkwik.webdatacommons.org/resource/u0VFukMZfej0SgGbY6z20w==
n57http://dbkwik.webdatacommons.org/resource/yRv_yCvrfACk8apqt2vRVA==
n46http://dbkwik.webdatacommons.org/resource/onCYCpdZ3W4MvWZH-c-DmQ==
n15http://dbkwik.webdatacommons.org/resource/2AW4O3ovyiSoNCd6r0qbsw==
n42http://dbkwik.webdatacommons.org/resource/m5268hoCy0FopVdhvAYd7w==
n50http://dbkwik.webdatacommons.org/resource/vazdhQaqR7mo9VhGrdUZQg==
dctermshttp://purl.org/dc/terms/
n91http://dbkwik.webdatacommons.org/resource/b42XuHzZ9e58AM2IoAmA3Q==
n61http://dbkwik.webdatacommons.org/resource/m417WCiUA4Q9E5gBqe5xgQ==
n10http://dbkwik.webdatacommons.org/resource/8ebZxONF2Fg6zDUs6Kp0Eg==
n36http://dbkwik.webdatacommons.org/resource/PSW_e3ktGtSu7he4wMIC0A==
n73http://dbkwik.webdatacommons.org/resource/ZwcMY0ziTtEeDIqYZuU5Ug==
n5http://dbkwik.webdatacommons.org/resource/4LGx4OnKL7_46CZx-YYkug==
n7http://dbkwik.webdatacommons.org/sims/property/
n30http://dbkwik.webdatacommons.org/resource/jKA6LDd2QxKBHQS7F8XhZQ==
n24http://dbkwik.webdatacommons.org/resource/M2BBzE6MfqGpO3aFTwmTeA==
n51http://dbkwik.webdatacommons.org/resource/Vv8myydoI2m7BQeFaiEXog==
n68http://dbkwik.webdatacommons.org/resource/Ovjq6ELlSZWc8oHrGo2efg==
n76http://dbkwik.webdatacommons.org/resource/EBTk8fB32gpdlsr7xXF73Q==
n47http://dbkwik.webdatacommons.org/resource/HDt3OW4oT71AbXvz1HeWVw==
n88http://dbkwik.webdatacommons.org/resource/5oMz7ybZ1k0H8Xb571X24A==
n17http://dbkwik.webdatacommons.org/resource/QClKFdd-KcFGOEbe2LVjew==
n69http://dbkwik.webdatacommons.org/resource/TrQzkWqtfrgQOnFQfVcDWg==
n75http://dbkwik.webdatacommons.org/resource/d4af_p3w23nUj2d_6TLkdg==
n26http://dbkwik.webdatacommons.org/movies/property/
n74http://dbkwik.webdatacommons.org/resource/vd075PyoffUF3JYIAi9Phw==
n83http://dbkwik.webdatacommons.org/resource/AwygGpK2pa7Zht5fcNCipg==
n41http://dbkwik.webdatacommons.org/resource/TgOVbXtoSofCtrjpr1F5Hw==
n28http://dbkwik.webdatacommons.org/resource/4CGJk_wgLQKYXAPvXhmMyw==
n3http://dbkwik.webdatacommons.org/resource/nPLAObyrRL-iGQuAG5xrDg==
n95http://dbkwik.webdatacommons.org/resource/Gdsl5HC_NGAEppKN5HnrHg==
n56http://dbkwik.webdatacommons.org/resource/z2DbPdPMlCqp30PJSfbOnQ==
n79http://dbkwik.webdatacommons.org/resource/eRaJwcRG_vyIyUiE6c8P_w==
n23http://dbkwik.webdatacommons.org/resource/RiaMY-W7ua567zJeXjY1LA==
n87http://dbkwik.webdatacommons.org/resource/bezxUXkJr0jIel_QKpK9pw==
n64http://dbkwik.webdatacommons.org/resource/TdVZBIow6wjuDsXfa9NsXA==
dbrhttp://dbpedia.org/resource/
rdfshttp://www.w3.org/2000/01/rdf-schema#
n32http://dbkwik.webdatacommons.org/resource/TGVw_48bfxR4O_s_eW_eZQ==
n44http://dbkwik.webdatacommons.org/resource/LVlUlVfHELqE7S00fkyFtQ==
n16http://dbkwik.webdatacommons.org/memory-alpha/property/
n45http://dbkwik.webdatacommons.org/resource/fsiUJVI5e_xecFqBponOKw==
n92http://dbkwik.webdatacommons.org/resource/n1cZI0FC9Z3yQDKZSpkbUg==
n71http://dbkwik.webdatacommons.org/resource/PqdAYy3XLSdjcM8CryR82g==
owlhttp://www.w3.org/2002/07/owl#
n80http://dbkwik.webdatacommons.org/resource/vyf7btcGUBrkp1lEUa5kGg==
n55http://dbkwik.webdatacommons.org/resource/zq8rUHHMv0Imt1MmQqSWYA==
n54http://dbkwik.webdatacommons.org/resource/m1Sw-Yd3HS7yeIVxhpeG2g==
n90http://dbkwik.webdatacommons.org/resource/C73oVEYzJgADV11W0Q0FOw==
n14http://dbkwik.webdatacommons.org/ontology/
n60http://dbkwik.webdatacommons.org/resource/TedTVPo4HvX3e5MBDIOvfw==
n37http://dbkwik.webdatacommons.org/resource/KkVvO3QF3w7Fe40sEFU_6A==
n52http://dbkwik.webdatacommons.org/resource/LEzfXnBr06S-WD1j_S4ObQ==
n58http://dbkwik.webdatacommons.org/resource/-w5k8Zf461Jmpmn06LRtsg==
n49http://dbkwik.webdatacommons.org/resource/i3wMgUelKx6OVgTRZNLlxQ==
n21http://dbkwik.webdatacommons.org/resource/A64EG2Ls5k9AkTTKbL4eIQ==
n6http://dbkwik.webdatacommons.org/resource/Q8UvVmgeF1HFIXszwjPrqA==
n33http://dbkwik.webdatacommons.org/resource/_CPP96hKbgb1bgdgF1o4rg==
n19http://dbkwik.webdatacommons.org/resource/K1AXy2wpE6A9Vlhgcgzh8w==
n86http://dbkwik.webdatacommons.org/resource/ioQXQ0FujdZwhxmyFpS9IQ==
Subject Item
n2:
rdf:type
n22: n32:
rdfs:label
Carpool
rdfs:comment
The carpool comes whenever a Sim goes to work. (For children, the school bus serves as the carpool. For teens, the school bus and carpool may be separate, as they can have part-time jobs.) In The Sims 2 and The Sims 3, the carpool has a visible driver, but it is nearly impossible to play this Sim. The carpool is scheduled to arrive an hour before the Sim's workday begins, though it may arrive a bit after the top of the hour. It will sit at the curb, beeping its horn, for an hour, and will then leave, even if the Sim hasn't gotten in. Sims in a good mood will autonomously start to head for the carpool shortly after it arrives, though in some cases, the player will need to cancel whatever action the Sim is performing because it may take too long and the Sim will miss the carpool. The player Workaholic advertising executive of Bauer & Cole, Daniel Miller has an important business meeting, but he finds himself having to drive the neighborhood carpool for his sons, Bucky & Andrew and their friends, Chelsea, Kayla and Travis when his wife gets sick. A comedic car chase ensues through Seattle and Daniel discovers the kids do not really respect him & they react better to Franklin. In an alternate future, this book was present in an abandoned library on 31st century Earth. (ENT: "Shockwave, Part II") Unlike some of the other 20th century works that appear on screen, this is a real novel. It is a fact that there are far too many vehicles on the road today. The result is traffic jams, accidents, and worst of all, pollution and wasted gas. Another little known fact is if three or more people are in an average car, it can be the most energy efficient mode of transportation per person/mile traveled. Here is how the system would work. The passenger inputs a destination and the fact that he is ready to leave in a GPS enabled devise plus his security code to verify he is who he says he is. His system is connected to the central computer. Car pooling and ride sharing can simply refer to using a car or vehicle with two or more occupants instead of just the one driver. There are many intentional efforts of providing car sharing parking areas, posting areas, websites, and more. It is a fact that there are far too many vehicles on many roads today. The result is traffic jams, accidents, noise, stress, and worst of all, pollution and wasted gas. If three or more people are in an average car, it can be the most energy efficient mode of transportation per person and per mile traveled.
owl:sameAs
dbr:Carpool
n55:
134
dcterms:subject
n13: n18: n19: n33: n36: n46: n60: n61: n64: n69: n70: n73: n75: n77: n95:
n84:wikiPageUsesTemplate
n85:
n16:wikiPageUsesTemplate
n17: n28: n51:
n26:wikiPageUsesTemplate
n27: n30: n68:
n9:wikiPageUsesTemplate
n10: n24: n25: n31: n38: n40: n43: n44: n49: n56: n57: n58: n67: n72: n74: n82: n83: n93:
n7:wikiPageUsesTemplate
n8: n11: n71: n78:
n15:
208
n5:
n6: n39: n45: n50: n94:
n76:
2012-11-21
n79:
M. James Langlois n86:
n37:
5520.0
n52:
n53: Michael G. Nathanson
n54:
United States
n42:
Carpool
n23:
Vehicles
n41:
Theatrical release poster
n88:
English
n47:
n48:
n20:
n21:
n3:
215
n29:
3325651.0
n80:
n81:
n91:
n92:
n87:
Superior
n89:
n90:
n59:
1.7E7
n62:
n63: Mark Christopher
n34:
n35:
n14:abstract
In an alternate future, this book was present in an abandoned library on 31st century Earth. (ENT: "Shockwave, Part II") Unlike some of the other 20th century works that appear on screen, this is a real novel. The carpool comes whenever a Sim goes to work. (For children, the school bus serves as the carpool. For teens, the school bus and carpool may be separate, as they can have part-time jobs.) In The Sims 2 and The Sims 3, the carpool has a visible driver, but it is nearly impossible to play this Sim. The carpool is scheduled to arrive an hour before the Sim's workday begins, though it may arrive a bit after the top of the hour. It will sit at the curb, beeping its horn, for an hour, and will then leave, even if the Sim hasn't gotten in. Sims in a good mood will autonomously start to head for the carpool shortly after it arrives, though in some cases, the player will need to cancel whatever action the Sim is performing because it may take too long and the Sim will miss the carpool. The player can cancel the Go to Work/Go to School action in order to let the Sim do something else, such as use the toilet, take a quick shower, or watch TV a little longer. However, the player will then have to click on the carpool or school bus and select Go to Work or Go to School in order to send the Sim to work or school. Of course, the player can choose to let the Sim miss the carpool or school bus and stay home. (In The Sims, this is the only way a Sim can get a day off from work or school.) If two or more Sims are scheduled to go to work at the same time, only one carpool vehicle will come. At least in The Sims 2, it seems that it will be the carpool for the Sim who will come home earliest. In The Sims, if two or more Sims are scheduled to return from work at the same time, each one will return in his or her job's carpool. This is necessary because, in The Sims, the chance cards Sims may receive when coming home are linked to the carpool controller. In The Sims 2, two or more Sims who return at the same time will arrive in a single carpool. Also, if a Sim returns home from work at the same time that another Sim's carpool is scheduled to arrive, that Sim's carpool vehicle will remain on the lot, and will be used to take the departing Sim(s) to work, regardless of what their normal carpool vehicle would be. This even applies to jobs that don't use carpool vehicles. In The Sims 2, if the Nightlife expansion pack is installed, the carpool will not come for a Sim who has been made the owner of a car. In The Sims 3, the carpool comes regardless of whether or not a vehicle is assigned. In The Sims 4, there are no carpools; the Sim simply vanishes from the sidewalk when leaving for work. Workaholic advertising executive of Bauer & Cole, Daniel Miller has an important business meeting, but he finds himself having to drive the neighborhood carpool for his sons, Bucky & Andrew and their friends, Chelsea, Kayla and Travis when his wife gets sick. Stopping to get Danish for the kids at Hammerman's Gourmet To Go grocery store, things go even more awry when he finds himself a victim of a robbery. The situation worsens as Franklin Laszlo (the desperate owner of Laszlo Bros. Carnival who had been contemplating a bank robbery of Puget Savings and Loan) robs the robbers and takes Daniel and the kids hostage in their Toyota Previa van as his truck is blocked by an armored car. A comedic car chase ensues through Seattle and Daniel discovers the kids do not really respect him & they react better to Franklin. It is a fact that there are far too many vehicles on the road today. The result is traffic jams, accidents, and worst of all, pollution and wasted gas. Another little known fact is if three or more people are in an average car, it can be the most energy efficient mode of transportation per person/mile traveled. The customer, both driver and passenger communicates wirelessly with a computer through a form of G.P.S enabled device with mapping capability. Voice and cell phone capability may be employed but is not essential. There are GPS systems available from many companies for cars and people. Many cell phones and cars already have GPS and communication capabilities. Now, lets take this idea and add it to the idea of “Car Pooling.” Some individuals already take advantage of this form of transportation to save on gas, to share expenses or to save on the stress of having to drive for hours every day just to get to work and back. Car pooling is very inefficient though as you must find the person to pick up. You pick them up and drop them off etc. You often need to go far out of your way. Car Pooling currently works best when you are traveling longer distances.. Here is how the system would work. The passenger inputs a destination and the fact that he is ready to leave in a GPS enabled devise plus his security code to verify he is who he says he is. His system is connected to the central computer. A driver with a car enabled GPS devise who is signed in to the system and who is going to the node in the passengers path is directed by his G.P.S. system which is tied to a central computer. A node is a transfer point or hub and it is an intermediary way point on a persons journey. The G.P.S. tells the driver how and where to turn to the passengers house. He then proceeds to the node, possibly picking up others as he goes. At the nearest node, all passengers get out and are directed by their GPS to a car going toward their final destination. Since lots of cars or other modes of transportation are headed to Toronto, for instance, but few or none to Huntsville, the devise will send that person to Toronto if that is the best current option to eventually get him to his destination in Huntsville.. He passes through nodes until he reaches his destination. Small towns may have a few nodes, mostly on major roads out of town. Cities like Toronto would have hundreds. Nodes would be located by major roads, bus, train, subways and transport interlinks. In major cities most on road parking would be replaced by nodes greatly reducing available parking and greatly increasing the incentive to leave your car at home but picking up and dropping off people very convenient.. Remaining parking would be available to people who participate. As the central computer knows who it sent with whom, it can charge passengers and credit drivers. Security can be assured by the fact that it knows who is traveling with whom. Car pooling and ride sharing can simply refer to using a car or vehicle with two or more occupants instead of just the one driver. There are many intentional efforts of providing car sharing parking areas, posting areas, websites, and more. It is a fact that there are far too many vehicles on many roads today. The result is traffic jams, accidents, noise, stress, and worst of all, pollution and wasted gas. If three or more people are in an average car, it can be the most energy efficient mode of transportation per person and per mile traveled. G.P.S. systems can be used to help car pooling efforts. The customer, both driver and passenger communicates through a computer and a form of G.P.S enabled device with mapping capability. Voice and cell phone capability may be employed but is not essential. There are GPS systems available from many companies for cars and people. Many cell phones and cars already have GPS and communication capabilities. Some individuals already take advantage of this form of transportation to save on gas, to share expenses or to save on the stress of having to drive for hours every day just to get to work and back. Car pooling is very inefficient though as you must find the person to pick up. You pick them up and drop them off etc. You often need to go far out of your way. Car pooling currently works best when you are traveling longer distances. Here is how the system would work. The passenger inputs a destination and the fact that he is ready to leave in a GPS enabled devise plus his security code to verify he is who he says he is. His system is connected to the central computer. A driver with a car enabled GPS devise who is signed in to the system and who is going to the node in the passengers path is directed by his G.P.S. system which is tied to a central computer. A node is a transfer point or hub and it is an intermediary way point on a persons journey. The G.P.S. tells the driver how and where to turn to the passengers house. He then proceeds to the node, possibly picking up others as he goes. At the nearest node, all passengers get out and are directed by their GPS to a car going toward their final destination. Since lots of cars or other modes of transportation are headed to Toronto, for instance, but few or none to Huntsville, the devise will send that person to Toronto if that is the best current option to eventually get him to his destination in Huntsville.. He passes through nodes until he reaches his destination. Small towns may have a few nodes, mostly on major roads out of town. Cities like Toronto would have hundreds. Nodes would be located by major roads, bus, train, subways and transport interlinks. In major cities most on road parking would be replaced by nodes greatly reducing available parking and greatly increasing the incentive to leave your car at home but picking up and dropping off people very convenient.. Remaining parking would be available to people who participate. As the central computer knows who it sent with whom, it can charge passengers and credit drivers. Security can be assured by the fact that it knows who is traveling with whom.