Toyota

About: Toyota is a company organization based out in Safenwil, Switzerland. It is known for research contribution in the topics: Internal combustion engine & Battery (electricity). The organization has 40032 authors who have published 55003 publications receiving 735317 citations. The organization is also known as: Toyota Motor Corporation & Toyota Jidosha KK.

Exhaust gas purification device of internal combustion engine

Abstract: A catalyst (22) suitable for reduction of the NOx in an exhaust gas by ammonia in the presence of excess oxygen is arranged in the exhaust passage (18, 21) of an internal combustion engine. An aqueous urea solution is fed through a flow control valve (33) to the inside of the exhaust passage (21) upstream of the catalyst (22). When the temperature of the catalyst (22) is low, a large amount of the aqueous urea solution is fed to make the urea contained in the aqueous urea solution be stored in the catalyst (22). When the engine is accelerated and the temperature of the catalyst (22) rises, ammonia is released at a little at a time from the inside of the catalyst (22) and the NOx in the exhaust gas is reduced by the released ammonia.

Effects of Li+, K+, and Ba2+ Cations on the ORR at Model and High Surface Area Pt and Au Surfaces in Alkaline Solutions

Abstract: This Letter reveals new findings on the influence of noncovalent interactions on the electrochemical interface. Using surface X-ray scattering, we demonstrate that the barium cations are located at 3.4 A away from the surface, suggesting that they are partially hydrated, though not adsorbed at the surface. The effect of the cation on the oxygen reduction reaction (ORR) ranges from significant (Pt) to little (Au), depending on the nature of the metal and cation. Finally, we show that these results, as obtained on well-defined single-crystal surfaces, correlate well with observations on high surface area nanoparticle catalysts.

A Stochastic Geometry Approach to the Modeling of DSRC for Vehicular Safety Communication

Abstract: Vehicle-to-vehicle safety communications based on the dedicated short-range communication technology have the potential to enable a set of applications that help avoid traffic accidents. The performance of these applications, largely affected by the reliability of communication links, stringently ties back to the MAC and PHY layer design, which has been standardized as IEEE 802.11p. The link reliabilities depend on the signal-to-interference-plus-noise ratio (SINR), which, in turn, depends on the locations and transmit power values of the transmitting nodes. Hence, an accurate network model needs to take into account the network geometry. For such geometric models, however, there is a lack of mathematical understanding of the characteristics and performance of IEEE 802.11p. Important questions such as the scalability performance of IEEE 802.11p have to be answered by simulations, which can be very time consuming and provide limited insights to future protocol design. In this paper, we investigate the performance of IEEE 802.11p by proposing a novel mathematical model based on queuing theory and stochastic geometry. In particular, we extend the Matern hard-core type-II process with a discrete and nonuniform distribution, which is used to derive the temporal states of backoff counters. By doing so, concurrent transmissions from nodes within the carrier sensing ranges of each other are taken into account, leading to a more accurate approximation to real network dynamics. A comparison with Network Simulator 2 (ns2) simulations shows that our model achieves a good approximation in networks with different densities.

Distributed request routing

Abstract: A plurality of servers for processing client requests forward the requests among themselves to achieve a balanced load. When a server initially receives a client request, it randomly selects another of the plurality of servers, referred to as a first-chance server, and forwards the request to this server. Upon receiving the request, the first-chance server determines if it is overloaded and if not, processes the request. However, if overloaded, the first-chance server compares its load to the load of one or more predetermined next-neighbor servers. If the next-neighbor server(s) are more loaded than the first-chance server, the first-chance server processes the request. Otherwise, the first-chance server forwards the request to the least loaded next-neighbor server. The next-neighbor receiving the request either processes it directly, or alternatively, based on its current load and that of its next-neighbor server(s), forwards the request to another next-neighbor server for processing.