본문 바로가기
HOME> 저널/프로시딩 > 저널/프로시딩 검색상세

저널/프로시딩 상세정보

권호별목차 / 소장처보기

H : 소장처정보

T : 목차정보

Physica. A 46건

  1. [해외논문]   Editorial Board   SCI SCIE


    Physica. A v.507 ,pp. ii - ii , 2018 , 0378-4371 ,

    초록

    원문보기

    원문보기
    무료다운로드 유료다운로드

    회원님의 원문열람 권한에 따라 열람이 불가능 할 수 있으며 권한이 없는 경우 해당 사이트의 정책에 따라 회원가입 및 유료구매가 필요할 수 있습니다.이동하는 사이트에서의 모든 정보이용은 NDSL과 무관합니다.

    NDSL에서는 해당 원문을 복사서비스하고 있습니다. 아래의 원문복사신청 또는 장바구니담기를 통하여 원문복사서비스 이용이 가능합니다.

    이미지

    Fig. 1 이미지
  2. [해외논문]   Core structure: The coupling failure procedure in multiplex networks   SCI SCIE

    Liu, Yangyang (Department of Mathematics and Systems Science, College of Science, National University of Defense Technology, Changsha, Hunan, China ) , Zhao, Chengli (Department of Mathematics and Systems Science, College of Science, National University of Defense Technology, Changsha, Hunan, China ) , Zhang, Xue (Department of Mathematics and Systems Science, College of Science, National University of Defense Technology, Changsha, Hunan, China ) , Yi, Dongyun (Department of Mathematics and Systems Science, College of Science, National University of Defense Technology, Changsha, Hunan, China ) , Chen, Wen (Southwest Electronics and Telecommunication Technology Research Institute, Chengdu, Sichuan, China)
    Physica. A v.507 ,pp. 1 - 11 , 2018 , 0378-4371 ,

    초록

    Abstract Multiplex networks are a special class of multilayered networks in which a fixed set of nodes is connected by different types of links. The core organization, the residual graph from recursively removing dead-end nodes and their nearest neighbor, plays a significant role in a wide range of typical problems. However previous study about core structure ignored the fact that many real systems are coupled together. In this paper, we firstly generalize the pruning algorithm for multiplex networks, such that leaves in multiplex networks are redefined. The extended pruning algorithm corresponds to a coupling failure procedure in multiplex networks. We develop an analytical approach to study the structural stability of multiplex networks under this scenario. Specifically, by implementing the rate-equation approach to this generalized pruning process, we can analyze a set of cores and describe the birth point and their structures. Moreover, to clarify the general results, we solve the rate equation in four different distribution multiplex networks with two layers: ErdOs REnyi, exponentially distributed, purely power-law distributed, and static model networks. Finally, we explore the possible origin for the unique transition behavior in multiplex networks. Highlights We generalize the pruning algorithm for multiplex networks to extract the core structure. The rate equation is derived to describe the evolution of core percolation in multiplex networks with an arbitrary number of layers. The numerical results under four different degree distribution networks agree well with the analytical results. The possible origin for this transition phenomenon is discussed.

    원문보기

    원문보기
    무료다운로드 유료다운로드

    회원님의 원문열람 권한에 따라 열람이 불가능 할 수 있으며 권한이 없는 경우 해당 사이트의 정책에 따라 회원가입 및 유료구매가 필요할 수 있습니다.이동하는 사이트에서의 모든 정보이용은 NDSL과 무관합니다.

    NDSL에서는 해당 원문을 복사서비스하고 있습니다. 아래의 원문복사신청 또는 장바구니담기를 통하여 원문복사서비스 이용이 가능합니다.

    이미지

    Fig. 1 이미지
  3. [해외논문]   Prediction of competitive diffusion on complex networks   SCI SCIE

    Zhao, Jiuhua (Department of Automation, Shanghai Jiao Tong University, and Key Laboratory of System Control and Information Processing, Ministry of Education of China, Shanghai, 200240, China ) , Liu, Qipeng (Institute of Complexity Science, Qingdao University, Qingdao, 266071, China ) , Wang, Lin (Department of Automation, Shanghai Jiao Tong University, and Key Laboratory of System Control and Information Processing, Ministry of Education of China, Shanghai, 200240, China ) , Wang, Xiaofan (Department of Automation, Shanghai Jiao Tong University, and Key Laboratory of System Control and Information Processing, Ministry of Education of China, Shanghai, 200240, China)
    Physica. A v.507 ,pp. 12 - 21 , 2018 , 0378-4371 ,

    초록

    Abstract In this paper, we study the prediction problem of diffusion process on complex networks in competitive circumstances. With this problem solved, the competitors could timely intervene the diffusion process if needed such that an expected outcome might be obtained. We consider a model with two groups of competitors spreading opposite opinions on a network. A prediction method based on the mutual influences among the agents is proposed, called Influence Matrix (IM for short), and simulations on real-world networks show that the proposed IM method has quite high accuracy on predicting both the preference of any normal agent and the final competition result. For comparison purpose, classic centrality measures are also used to predict the competition result. It is shown that PageRank, Degree, Katz Centrality, and the IM method are suitable for predicting the competition result. More precisely, in undirected networks, the IM method performs better than these centrality measures when the competing group contains more than one agent; in directed networks, the IM method performs only second to PageRank. Highlights A competitive diffusion model with two groups of competitors is proposed. A prediction method based on mutual influences among agents, called IM, is given. The IM method can predict supporting bias of normal agents accurately. The IM method performs better when the competing group contains multiple agent.

    원문보기

    원문보기
    무료다운로드 유료다운로드

    회원님의 원문열람 권한에 따라 열람이 불가능 할 수 있으며 권한이 없는 경우 해당 사이트의 정책에 따라 회원가입 및 유료구매가 필요할 수 있습니다.이동하는 사이트에서의 모든 정보이용은 NDSL과 무관합니다.

    NDSL에서는 해당 원문을 복사서비스하고 있습니다. 아래의 원문복사신청 또는 장바구니담기를 통하여 원문복사서비스 이용이 가능합니다.

    이미지

    Fig. 1 이미지
  4. [해외논문]   The Blume–Capel model for spins S = 1 and 3 ∕ 2 in dimensions d = 2 and 3   SCI SCIE

    Butera, P. (Dipartimento di Fisica Universita' di Milano-Bicocca and Istituto Nazionale di Fisica Nucleare, Sezione di Milano-Bicocca, 3 Piazza della Scienza, 20126 Milano, Italy ) , Pernici, M. (Istituto Nazionale di Fisica Nucleare, Sezione di Milano, 16 Via Celoria, 20133 Milano, Italy)
    Physica. A v.507 ,pp. 22 - 66 , 2018 , 0378-4371 ,

    초록

    Abstract Expansions through the 24th order at high-temperature and up to 11th order at low-temperature are derived for the main observables of the Blume–Capel model on bipartite lattices ( s q , s c and b c c ) in 2 d and 3 d with various values of the spin and in presence of a magnetic field. All expansion coefficients are computed exactly as functions of the crystal and magnetic fields. Several critical properties of the model are analyzed in the two most studied cases of spin S = 1 and S = 3 ∕ 2 .

    원문보기

    원문보기
    무료다운로드 유료다운로드

    회원님의 원문열람 권한에 따라 열람이 불가능 할 수 있으며 권한이 없는 경우 해당 사이트의 정책에 따라 회원가입 및 유료구매가 필요할 수 있습니다.이동하는 사이트에서의 모든 정보이용은 NDSL과 무관합니다.

    NDSL에서는 해당 원문을 복사서비스하고 있습니다. 아래의 원문복사신청 또는 장바구니담기를 통하여 원문복사서비스 이용이 가능합니다.

    이미지

    Fig. 1 이미지
  5. [해외논문]   Quantum tunneling dynamics in symmetrical driven double well system based on Husimi representation   SCI SCIE

    Xu, Feng (School of Physics and Telecommunication Engineering, Shaanxi University of Technology, Hanzhong 723001, China ) , Zhai, Liangjun (The School of Mathematics and Physics, Jiangsu University of Technology, Changzhou 213001, China ) , Zheng, Yujun (School of Physics, Shandong University, Jinan 250100, China)
    Physica. A v.507 ,pp. 67 - 76 , 2018 , 0378-4371 ,

    초록

    Abstract In present study, the quantum tunneling process in symmetrical driven double-well system is studied by using the entangled trajectory molecular dynamics method based on the Husimi representation. Quantum tunneling dynamics show three different physical mechanisms vary with the amplitude and frequency of driven force: reposeful tunneling, chaos-assisted tunneling, oscillatory tunneling. Different form other methods, quantum underline dynamics process are explored by showing entangled trajectory in the phase space. We show chaotic behavior of entangled trajectories in the phase space, and the quantum tunneling process is vividly shown by comparing entangled trajectory with the classical trajectory with the same initial state. Furthermore, we discuss the effect of symmetry breaking on the potential to the quantum dynamical process, quantum tunneling probability will be remarkably reduced by breaking potential’s symmetry. Finally, the suppression of quantum wave packet tunneling under strong force is presented. Highlights Three different physical mechanisms of tunneling process have been shown, chaotic behavior of entangled trajectories enhances quantum tunneling process. Chaotic behavior of entangled trajectories enhances quantum tunneling process. Quantum coherence suppresses quantum wave packet tunneling.

    원문보기

    원문보기
    무료다운로드 유료다운로드

    회원님의 원문열람 권한에 따라 열람이 불가능 할 수 있으며 권한이 없는 경우 해당 사이트의 정책에 따라 회원가입 및 유료구매가 필요할 수 있습니다.이동하는 사이트에서의 모든 정보이용은 NDSL과 무관합니다.

    NDSL에서는 해당 원문을 복사서비스하고 있습니다. 아래의 원문복사신청 또는 장바구니담기를 통하여 원문복사서비스 이용이 가능합니다.

    이미지

    Fig. 1 이미지
  6. [해외논문]   Investigating the time evolution of some parameters describing inflow processes of pedestrians in a room   SCI SCIE

    Lian, Liping (State Key Laboratory of Fire Science, USTC, Hefei, China ) , Song, Weiguo (State Key Laboratory of Fire Science, USTC, Hefei, China ) , Yuen, Kwok Kit Richard (Department of Architecture and Civil Engineering, City University of Hong Kong, Hong Kong ) , Telesca, Luciano (Consiglio Nazionale delle Ricerche, Istituto di Metodologie per l'Analisi Ambientale, Tito, Italy)
    Physica. A v.507 ,pp. 77 - 88 , 2018 , 0378-4371 ,

    초록

    Abstract We investigated the properties of pedestrian inflow into a room (with one entrance and one exit) in two different conditions: without inactive persons and with the presence of inactive persons, who are pedestrians that after entering the room find randomly a position to stop, obstructing the inflow of the normal pedestrians. The average mutual distance ⟨ M D ⟩ , calculated averaging over all the distances between any two pedestrians, indicates that the spatial distribution of the pedestrians is different from that obtained by uniformly random distributed pedestrians occupying the same space as that of the room. The comparison of the ⟨ M D ⟩ with that of uniform spatial distributions obtained by using different room lengths suggests that the position of the exit could affect the spatial distribution of the pedestrians, who tend to randomly occupy the space which is delimited by the position of the exit. The analysis of the distance time series (which is the series of distances between successive positions occupied by a pedestrian) shows that the mean maximum distance is rather large when inactive persons obstructs the movement of the normal pedestrians; furthermore it tends to increase with the increase of the number of inactive persons, while in case of absence of inactive persons there is an apparent decrease with the increase of number of moving people. The detrended fluctuation analysis (DFA) applied to the distance time series shows that in both conditions pedestrians move persistently; however, without inactive persons DFA scaling exponent tends to slightly increase and stabilize with the increase of the number of moving people; with the presence of inactive persons, it tends to slightly decrease with the increase of the number of inactive persons. The obtained results contribute to a better understanding of the dynamical properties of pedestrian inflow processes, maybe leading to a better mathematical assessment of inflow models. Highlights Pedestrian inflow into a room is investigated with and without inactive persons. The obtained average mutual distance differs from that for uniformly random distribution. The mean maximum distance increases with the increase of the number of inactive persons. The distance time series is persistent with and without inactive persons.

    원문보기

    원문보기
    무료다운로드 유료다운로드

    회원님의 원문열람 권한에 따라 열람이 불가능 할 수 있으며 권한이 없는 경우 해당 사이트의 정책에 따라 회원가입 및 유료구매가 필요할 수 있습니다.이동하는 사이트에서의 모든 정보이용은 NDSL과 무관합니다.

    NDSL에서는 해당 원문을 복사서비스하고 있습니다. 아래의 원문복사신청 또는 장바구니담기를 통하여 원문복사서비스 이용이 가능합니다.

    이미지

    Fig. 1 이미지
  7. [해외논문]   The pre-history of econophysics and the history of economics: Boltzmann versus the marginalists   SCI SCIE

    Poitras, Geoffrey
    Physica. A v.507 ,pp. 89 - 98 , 2018 , 0378-4371 ,

    초록

    Abstract This paper contrasts developments in the pre-history of econophysics with the history of economics. The influence of classical physics on contributions of 19th century marginalists is identified and connections to the subsequent development of neoclassical economics discussed. The pre-history of econophysics is traced to a seminal contribution in the history of statistical mechanics: the classical ergodicity hypothesis introduced by L. Boltzmann. The subsequent role of the ergodicity hypothesis in empirical testing of the deterministic theories of neoclassical economics is identified. The stochastic models used in modern economics are compared with the more stochastically complex models of statistical mechanics used in econophysics. The influence of phenomenology in econophysics is identified and discussed. Highlights A comparative intellectual history of econophysics and economic science is provided to demonstrate why and how econophysics is distinct from economics. The history and role of the ergodicity hypothesis of Ludwig Boltzmann is considered. The use of phenomenological methods in econophysics is detailed. The role of ergodicity in empirical estimates of models in economics is identified.

    원문보기

    원문보기
    무료다운로드 유료다운로드

    회원님의 원문열람 권한에 따라 열람이 불가능 할 수 있으며 권한이 없는 경우 해당 사이트의 정책에 따라 회원가입 및 유료구매가 필요할 수 있습니다.이동하는 사이트에서의 모든 정보이용은 NDSL과 무관합니다.

    NDSL에서는 해당 원문을 복사서비스하고 있습니다. 아래의 원문복사신청 또는 장바구니담기를 통하여 원문복사서비스 이용이 가능합니다.

    이미지

    Fig. 1 이미지
  8. [해외논문]   Analysis on large-scale rating systems based on the signed network   SCI SCIE

    Gu, Ke (School of Systems Science, Beijing Normal University, 100875 Beijing, China ) , Fan, Ying (School of Systems Science, Beijing Normal University, 100875 Beijing, China ) , Zeng, An (School of Systems Science, Beijing Normal University, 100875 Beijing, China ) , Zhou, Jianlin (School of Systems Science, Beijing Normal University, 100875 Beijing, China ) , Di, Zengru (School of Systems Science, Beijing Normal University, 100875 Beijing, China)
    Physica. A v.507 ,pp. 99 - 109 , 2018 , 0378-4371 ,

    초록

    Abstract In many user–object online rating systems, it is obviously that the ratings usually show the users’ attitudes: like or dislike the objects. Inevitably there is a need to introduce the sign into the rating systems. We first focus on how to construct signed bipartite networks on rating systems and reveal the basic properties of them. We also analyze the basic motif of signed bipartite networks: quadrangle. Then we introduce a novel projection method Signed Common Neighbors (SCN) to get the projection to signed user-network. The basic statistics of the projections show that SCN can well reflect the roles of negative edges. Highlights Construct unweighted signed bipartite networks for user–object rating systems. Reveal the basic properties of real signed bipartite networks. Analyze the basic motif of signed bipartite networks: quadrangle. Introduce a novel projection method Signed Common Neighbors to get the projection to signed user-network.

    원문보기

    원문보기
    무료다운로드 유료다운로드

    회원님의 원문열람 권한에 따라 열람이 불가능 할 수 있으며 권한이 없는 경우 해당 사이트의 정책에 따라 회원가입 및 유료구매가 필요할 수 있습니다.이동하는 사이트에서의 모든 정보이용은 NDSL과 무관합니다.

    NDSL에서는 해당 원문을 복사서비스하고 있습니다. 아래의 원문복사신청 또는 장바구니담기를 통하여 원문복사서비스 이용이 가능합니다.

    이미지

    Fig. 1 이미지
  9. [해외논문]   Forecasting turning trends in knowledge networks   SCI SCIE

    Szá (Department of Biological Physics, Eotvos University, Pazmany Peter setany 1A, Budapest 1117, Hungary ) , ntó (MTA-ELTE Statistical and Biological Physics Research Group (Hungarian Academy of Sciences), Pazmany Peter setany 1A, Budapest 1117, Hungary) , -Vá , rnagy, Á , dá , m , Farkas, Illé , s J.
    Physica. A v.507 ,pp. 110 - 122 , 2018 , 0378-4371 ,

    초록

    Abstract A large portion of our collective human knowledge is in electronic repositories. These repositories range from “hard fact” databases (e.g., scientific publications and patents) to “soft” knowledge such as news portals. The common denominator between them all is that they can be thought of in terms of topics/keywords. The interest in these topics is constantly changing over time. Their frequency occurrence diagrams can be used for effective prediction by the most straightforward simplification. In this paper, we use these diagrams to produce simple and human-readable rules that are able to predict the future trends of the most important keywords in 5 data sets of different types. A thorough analysis of the necessary input variables and parameters and their relation to the success rate is presented, as well. Highlights Increasing, decreasing and stagnating topic classes were identified in 5 major data sets. The future class is predicted based on the past of the topic and its similar peers. Considering their yearly distance as input variable increases prediction effectivity.

    원문보기

    원문보기
    무료다운로드 유료다운로드

    회원님의 원문열람 권한에 따라 열람이 불가능 할 수 있으며 권한이 없는 경우 해당 사이트의 정책에 따라 회원가입 및 유료구매가 필요할 수 있습니다.이동하는 사이트에서의 모든 정보이용은 NDSL과 무관합니다.

    NDSL에서는 해당 원문을 복사서비스하고 있습니다. 아래의 원문복사신청 또는 장바구니담기를 통하여 원문복사서비스 이용이 가능합니다.

    이미지

    Fig. 1 이미지
  10. [해외논문]   Automatic image annotation using community detection in neighbor images   SCI SCIE

    Maihami, Vafa (Department of Electrical and Computer Engineering, Semnan University, Semnan, Iran ) , Yaghmaee, Farzin (Faculty of Electrical and Computer Engineering, Semnan University, Semnan, Iran)
    Physica. A v.507 ,pp. 123 - 132 , 2018 , 0378-4371 ,

    초록

    Abstract Automatic image annotation is useful in automatic image management and, understanding their contents. Automatic image annotation refers to the process of assigning tags/labels to images so that they clearly indicate the content which is meant to be conveyed. In this paper, a new method of automatic image annotation is presented. In the first phase of the proposed method, neighbor images which are similar to the query image, are retrieved using low-level features. In the second phase, a network (a relative graph) of the tags neighbor images is created and, finally, the tags of the densest community among all communities is selected for the query image as final tags. In order to show the efficiency of the proposed method some metrics such as precision, recall, and f-score are used in three standard datasets namely Corel5k, IAPR TC12 and Mir Flickr. The results show that the proposed method is more efficient than some state-of-the-art approaches. Highlights We proposed a method for automatic image annotation using community detection. A network among neighbor images tags for each query image is created. The densest community in the network is recognized and use its tags to the final tags.

    원문보기

    원문보기
    무료다운로드 유료다운로드

    회원님의 원문열람 권한에 따라 열람이 불가능 할 수 있으며 권한이 없는 경우 해당 사이트의 정책에 따라 회원가입 및 유료구매가 필요할 수 있습니다.이동하는 사이트에서의 모든 정보이용은 NDSL과 무관합니다.

    NDSL에서는 해당 원문을 복사서비스하고 있습니다. 아래의 원문복사신청 또는 장바구니담기를 통하여 원문복사서비스 이용이 가능합니다.

    이미지

    Fig. 1 이미지

논문관련 이미지