RISS 학술연구정보서비스

검색
다국어 입력

http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.

변환된 중국어를 복사하여 사용하시면 됩니다.

예시)
  • 中文 을 입력하시려면 zhongwen을 입력하시고 space를누르시면됩니다.
  • 北京 을 입력하시려면 beijing을 입력하시고 space를 누르시면 됩니다.
닫기
    인기검색어 순위 펼치기

    RISS 인기검색어

      검색결과 좁혀 보기

      선택해제
      • 좁혀본 항목 보기순서

        • 원문유무
        • 원문제공처
        • 등재정보
        • 학술지명
          펼치기
        • 주제분류
        • 발행연도
          펼치기
        • 작성언어
        • 저자
          펼치기

      오늘 본 자료

      • 오늘 본 자료가 없습니다.
      더보기
      • 무료
      • 기관 내 무료
      • 유료
      • KCI등재

        A cache placement algorithm based on comprehensive utility in big data multi-access edge computing

        ( Yanpei Liu ),( Wei Huang ),( Li Han ),( Liping Wang ) 한국인터넷정보학회 2021 KSII Transactions on Internet and Information Syst Vol.15 No.11

        The recent rapid growth of mobile network traffic places multi-access edge computing in an important position to reduce network load and improve network capacity and service quality. Contrasting with traditional mobile cloud computing, multi-access edge computing includes a base station cooperative cache layer and user cooperative cache layer. Selecting the most appropriate cache content according to actual needs and determining the most appropriate location to optimize the cache performance have emerged as serious issues in multi-access edge computing that must be solved urgently. For this reason, a cache placement algorithm based on comprehensive utility in big data multi-access edge computing (CPBCU) is proposed in this work. Firstly, the cache value generated by cache placement is calculated using the cache capacity, data popularity, and node replacement rate. Secondly, the cache placement problem is then modeled according to the cache value, data object acquisition, and replacement cost. The cache placement model is then transformed into a combinatorial optimization problem and the cache objects are placed on the appropriate data nodes using tabu search algorithm. Finally, to verify the feasibility and effectiveness of the algorithm, a multi-access edge computing experimental environment is built. Experimental results show that CPBCU provides a significant improvement in cache service rate, data response time, and replacement number compared with other cache placement algorithms.

      • 历代皇权相权关系考略及余绪 — 基于相权权力消长的维度

        Pan Yanpei 한양대학교(ERICA캠퍼스) 한국미래문화연구소 2021 미래문화 Vol.0 No.2

        纵观中国古代政治史,皇权和相权自产生伊始似乎就始终处于对立面,两 者此消彼长,彼此制约:斗争是贯穿两者关系的主线,而相互制约则会形成 一个暂时的内在平衡,一旦平衡打破,新的斗争和新的平衡又会轮回出现。 周而复始,中国的社会发展史就此书写。初读史书,笔者也认为皇权与相权 是绝对的对立,两者之间不存在中间状态,相权应对皇权顶礼膜拜,丞相也 应对皇帝惟命是从。读史至深处,才意识到认识上的偏颇——皇权与相权乃 是中国漫长封建统治史特有的产物,两者均是政权维系的要素,而他们的矛 盾对立反映的是统治集团内部的权力分配的失衡,是阶层内部而非不同阶层 之间的对立。在此基础上,对皇权与相权关系进行探讨并思考,发现其反映 的实质为同一组织机构内部领导者和管理者权限之争,而这一发现对与当今 社会仍具有借鉴意义。 Throughout the political history of ancient China, the imperial power and the Prime Minister's power seem to have always been in opposition since their emergence. The two change each other and restrict each other: struggle is the main line running through the relationship between the two, and mutual restriction will form a temporary internal balance. Once the balance is broken, new struggles and new balances will appear again. Over and over again, the history of China's social development has been written. After reading history books for the first time, the author also believes that the imperial power and the Prime Minister’s power are absolutely opposite, and there is no intermediate state between them. The Prime Minister’s power should worship the imperial power, and Prime Minister should obey the Emperor. After reading the history deeply, I realized the bias in previous understanding: the imperial power and the Prime Minister’s power are the unique products of China's long feudal ruling history. Both of them are the elements of regime maintenance, and their contradiction reflects the imbalance of power distribution within the ruling group, and the opposition is within the class rather than between different classes. On this basis, this paper discusses and considers the relationship between the imperial power and the Prime Minister’s power, and finds that its essence is the dispute between the authority of leaders and managers in the same organization, which is still of reference significance to today's society.

      • KCI등재

        Enumeration of three kinds of rooted maps on the Klein bottle

        Wenzhong Liu,Yanpei Liu 한국전산응용수학회 2007 Journal of applied mathematics & informatics Vol.24 No.1

        In this paper, 2 essential rooted maps on the Klein bottle arecounted and an explicit expression with the size as a parameter is given.Further, the numbers of singular maps and the maps with one vertex onthe Klein bottle are derived.AMS Mathematics Subject Classication: 05C45.Key words and phrases : 2 essential map, singular map, enufunction.1. IntroductionEnumeration of non-planar maps has been initiated in the 1960s by Brown [3].On the object, some scholars did some inuential works such as Bender et al. [2],Arqu`es [1], Gao [4] and Liu [79], only name a few. In this paper, enumeratingformulae of three kinds of rooted maps on the Klein bottle are obtained byinvestigating g essential maps with the small genera which play an importantrole in the study of general maps on surfaces.The article begins with some denitions. Terms without description can beseen in [7-9].LetX = {x1,x2 · ,xn} be a set andK = {1,β,γ}, the Klein group,i.e.,α2 = β2 = γ2 = 1, where γ= = . F o rx ∈X, Kx = {x,αx,βx,γx}.Ifthe permutationP on X (X)=n.i=1Kxi = X satises the following conditions:for anyl ∈N and any x ∈ X, Plx .=αx, αP = P1 and the group ψτgenerated byτ= {α,β,γ} is transitive onX , and thenM =(X,P) is called amap.If a map M = (X,P) has an element, theroot denoted by r = r(M ), inXmarked beforehand, thenM is called arooted mapand the marked edge is calledthe root-edgeofM . Likewise theroot-vertexand the root-faceare clear. In thisReceived November 24, 2005.Corresponding author.1 Supported by NNSFC under Grant 603730308 and 10571013.c. 2007 Korean Society for Computational & Applied Mathematics and Korean SIGCAM .411412 Wenzhong Liu and Yanpei Liupaper, maps always mean rooted . ForM = (X,P), the root, the root-vertex,the root-edge and the root-face ofM are denoted by r(M ),vr(M ),er(M ) andfr(M ) respectively.A surfaceΣ here is a compact close 2 manifolds. Anorientable (nonori-

      • KCI등재

        Bisingular maps on the torus

        ZHAOXIANG LI,YANPEI LIU 한국전산응용수학회 2007 Journal of applied mathematics & informatics Vol.23 No.1

        A map is bisingular if each edge is either a loop or an isthmus (i.e., on the boundary of the same face). In this paper we study the number of rooted bisingular maps on the sphere and the torus, and we also present formula for such maps with four parameters: the root-valency,the number of isthmus, the number of planar loops and the number of essential loops.

      • KCI등재

        Chromatic sums of rooted triangulations on the projective plane$^{**}$

        Zhaoxiang Li,Yanpei Liu 한국전산응용수학회 2005 Journal of applied mathematics & informatics Vol.18 No.1-2

        In this paper we study the chromatic sum functions for rooted nonseparable near-triangular maps on the projective plane. A chromatic sum equation for such maps is obtained.

      • KCI등재
      • KCI등재

        Chromatic sums of singular maps on some surface

        Zhaoxiang Li,Yanpei Liu 한국전산응용수학회 2004 Journal of applied mathematics & informatics Vol.15 No.-

        A map is singular if each edge is on the same face on a surface (i.e., those have only one face on a surface). Because any map with loop is not colorable, all maps here are assumed to be loopless. In this paper povides the explicit expression of chromatic sum functions for rooted singular maps on the projective plane, the torus and the Klein bottle. From the explicit expression of chromatic sum functions of such maps, the explicit expression of enumerating functions of such maps are also derived.

      • KCI등재
      • KCI등재

      연관 검색어 추천

      이 검색어로 많이 본 자료

      활용도 높은 자료

      해외이동버튼