• Title/Summary/Keyword: Np-spaces

Search Result 8, Processing Time 0.022 seconds

Np-SPACES

  • Kim, Yun-Su
    • Journal of the Korean Mathematical Society
    • /
    • v.48 no.5
    • /
    • pp.1043-1052
    • /
    • 2011
  • We introduce a new norm, called the $N^p$-norm (1 $\leq$ p < ${\infty}$ on the space $N^p$(V,W) where V and W are abstract operator spaces. By proving some fundamental properties of the space $N^p$(V,W), we also discover that if W is complete, then the space $N^p$(V,W) is also a Banach space with respect to this norm for 1 $\leq$ p < ${\infty}$.

Silicon/Carbon Composites Having Bimodal Mesopores for High Capacity and Stable Li-Ion Battery Anodes (고용량 고안정성 리튬 이차전지 음극소재를 위한 이중 중공을 갖는 실리콘/탄소 복합체의 설계)

  • Park, Hongyeol;Lee, Jung Kyoo
    • Clean Technology
    • /
    • v.27 no.3
    • /
    • pp.223-231
    • /
    • 2021
  • In order to address many issues associated with large volume changes of silicon, which has very low electrical conductivity but offers about 10 times higher theoretical capacity than graphite (Gr), a silicon nanoparticles/hollow carbon (SiNP/HC) composite having bimodal-mesopores was prepared using silica nanoparticles as a template. A control SiNP/C composite without a hollow structure was also prepared for comparison. The physico-chemical and electrochemical properties of SiNP/HC were analyzed by X-ray diffractometry, X-ray photoelectron spectroscopy, nitrogen adsorption/desorption measurements for surface area and pore size distribution, scanning electron microscopy, transmission electron microscopy, galvanostatic cycling, and cyclic voltammetry tests to compare them with those of the SiNP/C composite. The SiNP/HC composite showed significantly better cycle life and efficiency than the SiNP/C, with minimal increase in electrode thickness after long cycles. A hybrid composite, SiNP/HC@Gr, prepared by physical mixing of the SiNP/HC and Gr at a 50:50 weight ratio, exhibited even better cycle life and efficiency than the SiNP/HC at low capacity. Thus, silicon/carbon composites designed to have hollow spaces capable of accommodating volume expansion were found to be highly effective for long cycle life of silicon-based composites. However, further study is required to improve the low initial coulombic efficiency of SiNP/HC and SiNP/HC@Gr, which is possibly because of their high surface area causing excessive electrolyte decomposition for the formation of solid-electrolyte-interface layers.

Embedding Binomial Trees in Complete Binary Trees (이항트리의 완전이진트리에 대한 임베딩)

  • 윤수만;최정임형석
    • Proceedings of the IEEK Conference
    • /
    • 1998.10a
    • /
    • pp.479-482
    • /
    • 1998
  • Whether a given tree is a subgraph of the interconnection network topology is one of the important problem in parallel computing. Trees are used as the underlying structure for divide and conquer algorithms and provide the solution spaces for NP-complete problems. Complete binary trees are the basic structure among those trees. Binomial trees play an important role in broadcasting messages in parallel networks. If binomial trees can be efficiently embedded in complex binary trees, broadcasting algorithms can be effeciently performed on the interconnection networks. In this paper, we present average dilation 2 embedding of binomial trees in complete binary trees.

  • PDF

Embedding Complete binary trees in Binomial trees (완전이진트리의 이항트리에 대한 임베딩)

  • 윤수민;최정임형석
    • Proceedings of the IEEK Conference
    • /
    • 1998.06a
    • /
    • pp.289-292
    • /
    • 1998
  • Trees are the underlying structure for divide-and-conquer algorithms and the graphs that provide the solution spaces for NP-complete problems. Complete binary trees are the basic structure among trees. Therefore, if complete binary trees can be embedded in binomial trees, the algorithms which are provided by complete binary trees can be performed efficiently on the interconnection networks which have binomial trees as their subgraphs or in which binomial trees can be embedded easily. In this paper, we present dilation 2 embedding of complete binary trees in binomial trees.

  • PDF

The Atmospheric Factors Affecting User's Satisfaction in Natural Parks (자연공원의 분위기가 이용자의 만족도에 미치는 영향 - 국립공원과 도립공원을 대상으로 -)

  • 장병문;배민기
    • Journal of the Korean Institute of Landscape Architecture
    • /
    • v.30 no.1
    • /
    • pp.29-43
    • /
    • 2002
  • The purpose of this paper is to examine atmospherical factors affecting user's satisfaction in natural park to answer the research question: what are the effects of atmosphere on user's satisfaction in natural parks(NP). After reviewing the literature, mechanism of NP, and use elements in NP, We constructed the conceptual framework and have formulated the hypothesis of this research. We had obtained data through a questionnaire, which surveyed 508 visitors at 6 of the 73 NP in Korea in 2001, based on stratified sampling method. We have analyzed the data using descriptive statistical methods, the mean difference test, Pearson's correlation analysis, and the multiple linear regression method. We found that 1) the five atmospheric variables, j.e., number of users(NOU), crowding, damage to park resources(DPR), and maintenance of park resources and facilities(MPRF), encounter level(EL) affecting user's satisfaction, have tuned out to be statistically significant at a five percent level. The direction of the relationship between user's satisfaction and MPRF, NOU, EL is the same as that of the dependent variable and the opposite of crowding, and BPR, 2) in bivariate analysis, the positive relationships between user's satisfaction and park resources, MPRF are fairly high and statistically significant. The higher the value of DPR, and crowing, the lower the degree of user's satisfaction, 3) in multivariate analysis, such variables as NOU, crowding, DPR, EL, and MPRF affecting user's satisfaction have been statistically significant at five percent level, and 4) the relative contribution of MPRF, park resources, park facilities, NOU, crowding, DPR, and size of activity space on user's satisfaction have been determined to have respectively 6.00, 4.78, 2.53, 1.83, 1.64, 1.59 and 2.03 times more important than that of EL. Among the atmospheric variables, MPRF is the most important at 1.26 times higher than that of park resources. The research results suggest that the development of devices for the increase in user's satisfaction and user management program based on the knowledge we have found, be recommended in the planning and development process of natural park. The approach adopted by this research is valid and useful for evaluation criteria of NP. It is recommended that more empirical studies by activity types, activity spaces, and seasons on atmospheric elements affecting user's satisfaction be performed in the future.

INFINITELY MANY SMALL SOLUTIONS FOR THE p(x)-LAPLACIAN OPERATOR WITH CRITICAL GROWTH

  • Zhou, Chenxing;Liang, Sihua
    • Journal of applied mathematics & informatics
    • /
    • v.32 no.1_2
    • /
    • pp.137-152
    • /
    • 2014
  • In this paper, we prove, in the spirit of [3, 12, 20, 22, 23], the existence of infinitely many small solutions to the following quasilinear elliptic equation $-{\Delta}_{p(x)}u+{\mid}u{\mid}^{p(x)-2}u={\mid}u{\mid}^{q(x)-2}u+{\lambda}f(x,u)$ in a smooth bounded domain ${\Omega}$ of ${\mathbb{R}}^N$. We also assume that $\{q(x)=p^*(x)\}{\neq}{\emptyset}$, where $p^*(x)$ = Np(x)/(N - p(x)) is the critical Sobolev exponent for variable exponents. The proof is based on a new version of the symmetric mountainpass lemma due to Kajikiya [22], and property of these solutions are also obtained.

Solving Optimization Problems by Using the Schema Extraction Method (스키마 추출 기법을 이용한 최적화 문제 해결)

  • Cho, Yong-Gun;Kang, Hoon
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2000.10a
    • /
    • pp.278-278
    • /
    • 2000
  • In this paper, we introduce a new genetic reordering operator based on the concept of schema to solve optimization problems such as the Traveling Salesman Problem(TSP) and maximizing or minimizing functions. In particular, because TSP is a well-known combinational optimization problem andbelongs to a NP-complete problem, there is huge solution space to be searched. For robustness to local minima, the operator separates selected strings into two parts to reduce the destructive probability of good building blocks. And it applies inversion to the schema part to prevent the premature convergence. At the same time, it searches new spaces of solutions. Additionally, the non-schema part is applied to inversion for robustness to local minima. By doing so, we can preserve diversity of the distributions in population and make GA be adaptive to the dynamic environment.

  • PDF

The Schema Extraction Method for GA Preserving Diversity of the Distributions in Population (개체 분포의 다양성을 유지시키는 GA를 위한 스키마 추출 기법)

  • Jo, Yong-Gun;Jang, Sung-Hwan;Hoon Kang
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 2000.05a
    • /
    • pp.232-235
    • /
    • 2000
  • In this paper, we introduce a new genetic reordering operator based on the concept of schema to solve the Traveling Salesman Problem(TSP). Because TSP is a well-known combinatorial optimization problem and belongs to a NP-complete problem, there is a huge solution space to be searched. For robustness to local minima, the operator separates selected strings into two parts to reduce the destructive probability of good building blocks. And it applies inversion to the schema part to prevent the premature convergence. At the same time, it searches new spaces of solutions. In addition, we have the non-schema part to be applied to inversion as well as for robustness to local minima. By doing so, we can preserve diversity of the distributions in population and make GA be adaptive to the dynamic environment.

  • PDF