• Title/Summary/Keyword: computer topology

Search Result 614, Processing Time 0.025 seconds

A quantitative measurement of concrete air content using image analyses

  • Hwang, C.L.;Peng, S.S.;Wang, E.;Lin, S.H.;Huang, S.L.
    • Computers and Concrete
    • /
    • v.7 no.3
    • /
    • pp.239-247
    • /
    • 2010
  • A proposed topology method is introduced to measure the air content of fresh cement paste and hardened concrete. The method takes advantage of chromatographic analysis in void areas that are highlighted using different color schemes and later calculated using built-in computer software. The air content measured by the topology method is compared with results obtained from the conventional ASTM methods. It is concluded that the proposed method is reliable, and costs less and is easier to operate compared with the ASTM methods. In addition, 3 dimensional pore models can be created using image post-processing techniques. The proposed method helps researchers in understanding the formation and existence of concrete pores. This paper reports a detailed test program demonstrating the standard operating procedure used for the proposed method and presents a comparison of results between the proposed method and conventional ASTM Specifications. It is also concluded that the air content increases with increasing size of pores and increasing percentage of coarse aggregates.

ON THE SIMPLICIAL COMPLEX STEMMED FROM A DIGITAL GRAPH

  • HAN, SANG-EON
    • Honam Mathematical Journal
    • /
    • v.27 no.1
    • /
    • pp.115-129
    • /
    • 2005
  • In this paper, we give a digital graph-theoretical approach of the study of digital images with relation to a simplicial complex. Thus, a digital graph $G_k$ with some k-adjacency in ${\mathbb{Z}}^n$ can be recognized by the simplicial complex spanned by $G_k$. Moreover, we demonstrate that a graphically $(k_0,\;k_1)$-continuous map $f:G_{k_0}{\subset}{\mathbb{Z}}^{n_0}{\rightarrow}G_{k_1}{\subset}{\mathbb{Z}}^{n_1}$ can be converted into the simplicial map $S(f):S(G_{k_0}){\rightarrow}S(G_{k_1})$ with relation to combinatorial topology. Finally, if $G_{k_0}$ is not $(k_0,\;3^{n_0}-1)$-homotopy equivalent to $SC^{n_0,4}_{3^{n_0}-1}$, a graphically $(k_0,\;k_1)$-continuous map (respectively a graphically $(k_0,\;k_1)$-isomorphisim) $f:G_{k_0}{\subset}{\mathbb{Z}}^{n_0}{\rightarrow}G_{k_1}{\subset}{\mathbb{Z}^{n_1}$ induces the group homomorphism (respectively the group isomorphisim) $S(f)_*:{\pi}_1(S(G_{k_0}),\;v_0){\rightarrow}{\pi}_1(S(G_{k_1}),\;f(v_0))$ in algebraic topology.

  • PDF

Localized Algorithm to Improve Connectivity and Topological Resilience of Multi-hop Wireless Networks

  • Kim, Tae-Hoon;Tipper, David;Krishnamurthy, Prashant
    • Journal of information and communication convergence engineering
    • /
    • v.11 no.2
    • /
    • pp.69-81
    • /
    • 2013
  • Maintaining connectivity is essential in multi-hop wireless networks since the network topology cannot be pre-determined due to mobility and environmental effects. To maintain the connectivity, a critical point in the network topology should be identified where the critical point is the link or node that partitions the network when it fails. In this paper, we propose a new critical point identification algorithm and also present numerical results that compare the critical points of the network and H-hop sub-network illustrating how effectively sub-network information can detect the network-wide critical points. Then, we propose two localized topological control resilient schemes that can be applied to both global and local H-hop sub-network critical points to improve the network connectivity and the network resilience. Numerical studies to evaluate the proposed schemes under node and link failure network conditions show that our proposed resilient schemes increase the probability of the network being connected in variety of link and node failure conditions.

Topology-aware Virtual Network Embedding Using Multiple Characteristics

  • Liao, Jianxin;Feng, Min;Li, Tonghong;Wang, Jingyu;Qing, Sude
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.8 no.1
    • /
    • pp.145-164
    • /
    • 2014
  • Network virtualization provides a promising tool to allow multiple heterogeneous virtual networks to run on a shared substrate network simultaneously. A long-standing challenge in network virtualization is the Virtual Network Embedding (VNE) problem: how to embed virtual networks onto specific physical nodes and links in the substrate network effectively. Recent research presents several heuristic algorithms that only consider single topological attribute of networks, which may lead to decreased utilization of resources. In this paper, we introduce six complementary characteristics that reflect different topological attributes, and propose three topology-aware VNE algorithms by leveraging the respective advantages of different characteristics. In addition, a new KS-core decomposition algorithm based on two characteristics is devised to better disentangle the hierarchical topological structure of virtual networks. Due to the overall consideration of topological attributes of substrate and virtual networks by using multiple characteristics, our study better coordinates node and link embedding. Extensive simulations demonstrate that our proposed algorithms improve the long-term average revenue, acceptance ratio, and revenue/cost ratio compared to previous algorithms.

GROUP SECRET KEY GENERATION FOR 5G Networks

  • Allam, Ali M.
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.13 no.8
    • /
    • pp.4041-4059
    • /
    • 2019
  • Key establishment method based on channel reciprocity for time division duplex (TDD) system has earned a vital consideration in the majority of recent research. While most of the cellular systems rely on frequency division duplex (FDD) systems, especially the 5G network, which is not characterized by the channel reciprocity feature. This paper realizes the generation of a group secret key for multi-terminals communicated through a wireless network in FDD mode, by utilizing the nature of the physical layer for the wireless links between them. I consider a new group key generation approach, which using bitwise XOR with a modified pairwise secret key generation approach not based on the channel reciprocity feature. Precisely, this multi-node secret key agreement technique designed for three wireless network topologies: 1) the triangle topology, 2) the multi-terminal star topology, and 3) the multi-node chain topology. Three multi-node secret key agreement protocols suggest for these wireless communication topologies in FDD mode, respectively. I determine the upper bound for the generation rate of the secret key shared among multi-node, for the three multi-terminals topologies, and give numerical cases to expose the achievement of my offered technique.

Adjustable-Performace, Single-Ended Input Double-Balanced Mixer

  • Choi, Jin-Yong;Lee, Kyung-Ho;Lee, Sang-Gug
    • JSTS:Journal of Semiconductor Technology and Science
    • /
    • v.1 no.4
    • /
    • pp.248-252
    • /
    • 2001
  • A noble single-ended input, double-balanced mixer topology is proposed. The mixer incorporates the common-source amplifier input stage with inductive degeneration for impedance matching. The analysis based on simulations shows that the overall performance of the mixer is excellent and is adjustable by varying the input transistor size to give best characteristics for the given linearity specifications.

  • PDF

Wireless Power Transfer System Design with Small Receiver Coil (소형 수신단 코일을 가지는 무선 전력 전송 시스템 설계)

  • Yu, Jayeong;Sul, Seung-Ki
    • Proceedings of the KIPE Conference
    • /
    • 2013.11a
    • /
    • pp.202-203
    • /
    • 2013
  • 본 논문에서는 무선 전력 전송 시스템의 두가지 회로방식(Topology)에 대해 분석하고 수신단 코일이 송신단 코일의 약 6.7%인 시스템을 설계한다. 또한 전원단 설계와 전원 저항, 부하 저항 설계방향을 제시한다.

  • PDF

A Fibonacci Posterorder Circulants (피보나치 후위순회 원형군)

  • Kim Yong-Seok
    • Annual Conference of KIPS
    • /
    • 2006.05a
    • /
    • pp.743-746
    • /
    • 2006
  • In this paper, we propose and analyze a new parallel computer topology, called the Fibonacci posterorder circulants. It connects ${\Large f}_x,\;n{\geq}2$ processing nodes, same the number of nodes used in a comparable Fibonacci cube. Yet its diameter is only ${\lfloor}\frac{n}{3}{\rfloor}$ almost one third that of the Fibonacci cube. Fibonacci cube is asymmetric, but it is a regular and symmetric static interconnection networks for large-scale, loosely coupled systems. It includes scalability and Fibonacci cube as a spanning subgraph.

  • PDF

Computer Topology and Its Applications

  • Han, Sang-Eon
    • Honam Mathematical Journal
    • /
    • v.25 no.1
    • /
    • pp.153-162
    • /
    • 2003
  • Recently, the generalized digital $(k_{0},\;k_{1})$-continuity and its properties are investigated. Furthermore, the k-type digital fundamental group for digital image has been studies with the generalized k-adjacencies. The main goal of this paper is to find some properties of the k-type digital fundamental group of Boxer and to investigate some properties of minimal simple closed k-curves with relation to their embedding into some spaces in ${\mathbb{Z}}^n(2{\leq}n{\leq}3)$.

  • PDF