1,144 research outputs found
Computational analysis of contamination in Kojima Lake using upwind-type finite element method
No full textWe have computed the phase of spreading contaminations in Kojima Lake by using the upwind-type finite element method. We have treated the two cases: the pollutant flows from the Sasagase river and from the Kurashiki River. We see that the upwind-type finite element method is effective in both cases, when the diffusion constant is quite small
Visual abstract - Supplemental material for Single-Direction Approach for Thoracoscopic Segmentectomy of the Left Upper Lobe Anterior Segment With Mediastinal Lingular Artery
No full textSupplemental material, sj-pptx-1-inv-10.1177_15569845221086561 for Single-Direction Approach for Thoracoscopic Segmentectomy of the Left Upper Lobe Anterior Segment With Mediastinal Lingular Artery by Kuniyo Sueyoshi, Fumitsugu Kojima, Kosuke Otsubo, Shinya Hirota, Atsushi Kitamura and Toru Bando in Innovations</p
Marketing dynamics and management excellence. The sources of successful internationalization of food processing company from transition economy (Case: MASPEX - Poland)
No full textThe paper presents a case story of the fall and rise of the food industry in Poland's transition economy, illustrated with the example of one of its most successful companies. The author distinguishes three stages of the economic transition of Poland: · stage one, in which the Polish food processing industry collapsed, faced with fierce foreign competition after the implementation of a strategy of liberalization and privatization; · stage two (since late 1990s) when young, dynamic and relatively well- educated Polish entrepreneurs and managers not only started to regain the local market but also begun international expansion, intensifying exports, primarily to EU markets, · stage three, during which the internationalization took the form of FDI in the former neighboring socialist/communist countries. The MASPEX Group provides an excellent example of successful revival and expansion achieved thanks to the company's: · dynamic marketing strategy executed by · a young, dynamic and highly professional management team.Poland, food processing industry, internationalization, transition economy., Agribusiness,
Computational water analysis in an artificial lake: Kojima Lake case
No full textWe treat the problem of water pollution by the method of a mathematical model. We illustrate the method of analysis with Kojima Lake. We analyze in-flow and out-flow of the lake, compute numerical solutions of the governing equations of the water flow and the pollutant. The simulation leads to the conclusion concerning the figure of Kojima Lake
Computational water analysis in an artificial lake: Kojima Lake case
No full textWe treat the problem of water pollution by the method of a mathematical model. We illustrate the method of analysis with Kojima Lake. We analyze in-flow and out-flow of the lake, compute numerical solutions of the governing equations of the water flow and the pollutant. The simulation leads to the conclusion concerning the figure of Kojima Lake
Toru Terada's "Hakucho Masamune"(1947)
No full text寺田透(1915-1995)は文芸批評家で、同時にフランス文学者であった。彼は、小林秀雄(1902-1983)の後に現れた批評家であった。彼は小林の強い影響を受けている。この論文では、寺田が、正宗白鳥(1897-1962)の初期小説をどのように評価したかを扱う。寺田は、白鳥論を1947年に発表して、文芸評論家として出発した。この寺田による評論は、白鳥自身に認められた。寺田は、白鳥の初期小説の主人公たちが夢想家であると指摘した。本論文では、その寺田の主張が正しいかどうか、検討した。結論として、寺田の主張がおおむね正しいことが、分かった。Toru Terada(1915-1995) was both a literary critic and a scholar of French literature. He ranked as a critic after Hideo Kobayashi(1902-1983), who greatly influenced Terada. In this article the author dealt with how Toru Terada thought of the early novels of Hakucho Masamune(1897-1962). Terada started his literary career after he published an article on Hakucho in 1947. The article by Terada was recognized as valid by Hakucho himself. In the same article, "Hakucho Masamune," Terada pointed out that the main characters in Hakucho's early novels were dreamers. In this article the author examines whether Terada was right or not. He concludes that what Terada pointed out is almost right.論文(articles)departmental bulletin pape
Toru Terada's view of Soseki Natsume
No full text寺田透(1915-1995)は文芸批評家でフランス文学の研究者であった。彼は小林秀雄(1902-1983)以後に出現した批評家であった(小林の影響が強かった)。本論文では寺田が夏目漱石(1867-1916)の作品をどのように考えたかということと、寺田自身の批評の立場とを扱った。Toru Terada(1915-1995) was both a literary critic and a scholar of French literature. He ranked as a critic after Hideo Kobayashi(1902-1983), who greatly influenced Terada. In this article the author dealt with what Terada thought of Soseki Natsume(1867-1916) and also with Terada's own literary position.論文(Article)departmental bulletin pape
Computational analysis of contamination in Kojima Lake using upwind-type finite element method
No full textWe have computed the phase of spreading contaminations in Kojima Lake by using the upwind-type finite element method. We have treated the two cases: the pollutant flows from the Sasagase river and from the Kurashiki River. We see that the upwind-type finite element method is effective in both cases, when the diffusion constant is quite small
Bandwidth of the composition of two graphs
No full textAbstractThe bandwidth B(G) of a graph G is the minimum of the quantity max{|f(x)−f(y)|:xy∈E(G)} taken over all proper numberings f of G. The composition of two graphs G and H, written as G[H], is the graph with vertex set V(G)×V(H) and with (u1,v1) is adjacent to (u2,v2) if either u1 is adjacent to u2 in G or u1=u2 and v1 is adjacent to v2 in H. In this paper, we investigate the bandwidth of the composition of two graphs. Let G be a connected graph. We denote the diameter of G by D(G). For two distinct vertices x,y∈V(G), we define wG(x,y) as the maximum number of internally vertex-disjoint (x,y)-paths whose lengths are the distance between x and y. We define w(G) as the minimum of wG(x,y) over all pairs of vertices x,y of G with the distance between x and y is equal to D(G). Let G be a non-complete connected graph and let H be any graph. Among other results, we prove that if |V(G)|=B(G)D(G)−w(G)+2, then B(G[H])=(B(G)+1)|V(H)|−1. Moreover, we show that this result determines the bandwidth of the composition of some classes of graphs composed with any graph
- …
