• Title/Summary/Keyword: Design complexity

Search Result 1,995, Processing Time 0.028 seconds

Fast Sequential Optimal Normal Bases Multipliers over Finite Fields (유한체위에서의 고속 최적정규기저 직렬 연산기)

  • Kim, Yong-Tae
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.8 no.8
    • /
    • pp.1207-1212
    • /
    • 2013
  • Arithmetic operations over finite fields are widely used in coding theory and cryptography. In both of these applications, there is a need to design low complexity finite field arithmetic units. The complexity of such a unit largely depends on how the field elements are represented. Among them, representation of elements using a optimal normal basis is quite attractive. Using an algorithm minimizing the number of 1's of multiplication matrix, in this paper, we propose a multiplier which is time and area efficient over finite fields with optimal normal basis.

A Hierarchical Expert System for Process Planning and Material Selection (공정계획과 재료선정의 동시적 해결을 위한 계층구조 전문가시스템)

  • 권순범;이영봉;이재규
    • Journal of Intelligence and Information Systems
    • /
    • v.6 no.2
    • /
    • pp.29-40
    • /
    • 2000
  • Process planning (selection and ordering of processes) and material selection for product manufacturing are two key things determined before taking full-scale manufacturing. Knowledge on product design. material characteristics, processes, time and cost all-together are mutually related and should be considered concurrently. Due to the complexity of problem, human experts have got only one of the feasilbe solutions with their field knowledge and experiences. We propose a hierarchical expert system framework of knowledge representation and reasoning in order to overcome the complexity. Manufacturing processes have inherently hierarchical relationships, from top level processes to bottom level operation processes. Process plan of one level is posted in process blackboard and used for lower level process planning. Process information on blackboard is also used to adjust the process plan in order to resolve the dead-end or inconsistency situation during reasoning. Decision variables for process, material, tool, time and cost are represented as object frames, and their relationships are represented as constraints and rules. Constraints are for relationship among variables such as compatibility, numerical inequality etc. Rules are for causal relationships among variables to reflect human expert\`s knowledge such as process precedence. CRSP(Constraint and Rule Satisfaction Problem) approach is adopted in order to obtain solution to satisfy both constraints and rules. The trade-off procedure gives user chances to see the impact of change of important variables such as material, cost, time and helps to determine the preferred solution. We developed the prototype system using visual C++ MFC, UNIK, and UNlK-CRSP on PC.

  • PDF

A study on the Robust and Systolic Topology for the Resilient Dynamic Multicasting Routing Protocol

  • Lee, Kang-Whan;Kim, Sung-Uk
    • Journal of information and communication convergence engineering
    • /
    • v.6 no.3
    • /
    • pp.255-260
    • /
    • 2008
  • In the recently years, there has been a big interest in ad hoc wireless network as they have tremendous military and commercial potential. An Ad hoc wireless network is composed of mobile computing devices that use having no fixed infrastructure of a multi-hop wireless network formed. So, the fact that limited resource could support the network of robust, simple framework and energy conserving etc. In this paper, we propose a new ad hoc multicast routing protocol for based on the ontology scheme called inference network. Ontology knowledge-based is one of the structure of context-aware. And the ontology clustering adopts a tree structure to enhance resilient against mobility and routing complexity. This proposed multicast routing protocol utilizes node locality to be improve the flexible connectivity and stable mobility on local discovery routing and flooding discovery routing. Also attempts to improve route recovery efficiency and reduce data transmissions of context-awareness. We also provide simulation results to validate the model complexity. We have developed that proposed an algorithm have design multi-hierarchy layered networks to simulate a desired system.

A Study on the Epistemological Condition of Modern Architecture in the Matter of Technology - Focused on the contemplation of Heidegger's Existential Phenomenology - (기술(技術)의 본질(本質)에 대한 현대건축(現代建築)의 인식조건(認識條件)에 관한 연구(硏究) - Heidegger의 보존(保存) 현상학적(現象學的) 사유방식(思惟方式)을 중심(中心)으로 -)

  • Byun, Tae-Ho
    • Journal of architectural history
    • /
    • v.11 no.4 s.32
    • /
    • pp.7-19
    • /
    • 2002
  • If we compare socio-cultural aspects of the two historical periods known as 'pre-modern' 'modern,' it would seem that the Aristotelian understanding of technology has difficulty explaining techno-cultural phenomenon of modern society. The problems are first that the discourse of scientific technology in the modern period has proceeded without a metaphysical base, and second that nothing in present culture regulates the limitations of scientific technology. The clear distinction between means and ends in the traditional approach is no longer valid in the jumble of interrelationships. Such complexity forces us to acknowledge that means and ends are relative and interchangeable, and that neither has a clear moral superiority over the other. Technology in modern society is no more a neutral means. The products of science do not always exist to serve human ends. In modem architecture and urban design, both its productive and destructive tendencies leave man and his society in an endless confusion of complexity and opposition. These problems of technology still result in unsolved question today. On this point, the discussion another currently prevalent attitude to technology, especially Heideggerian thinking in the below could give a somewhat clearer answer to the problem of modem architecture and technology, although it also comprises limited contemplation in itself.

  • PDF

Enhanced Adaptive Multi-stage Echo Canceller for High Speed Communications (고속 통신을 위한 향상된 적응 다단 반향 제거기)

  • Kwon, Oh Sang
    • Journal of Korea Society of Digital Industry and Information Management
    • /
    • v.10 no.3
    • /
    • pp.119-125
    • /
    • 2014
  • Echo cancellation is required for a dual-duplex high speed communication such as digital subscriber line(DSL), in order to allow each individual loop to operate in a full duplex fashion. Echo cancellation was one of the most difficult aspects of DSL design, requiring high linearity and total echo return loss in excess of 70 dB. For a long and rapidly changing echo response, if the echo is cancelled by an adaptive echo canceller, the echo canceller needs more taps and its performance is decreased. But if the response is divided into several responses, which response is estimated by a adaptive digital filter and combined, the computation complexities are decreased and the performance is increased. Therefore, the adaptive multi-stage echo canceller is proposed to decrease the computation complexity and increase the performance of echo return loss, in which the echo canceller is composed of several stage echo canceller estimating each divided echo response. Through computer simulations, this multi-stage echo canceller is verified to have merits for high speed communications such as DSL application.

Swarm-based hybridizations of neural network for predicting the concrete strength

  • Ma, Xinyan;Foong, Loke Kok;Morasaei, Armin;Ghabussi, Aria;Lyu, Zongjie
    • Smart Structures and Systems
    • /
    • v.26 no.2
    • /
    • pp.241-251
    • /
    • 2020
  • Due to the undeniable importance of approximating the concrete compressive strength (CSC) in civil engineering, this paper focuses on presenting four novel optimizations of multi-layer perceptron (MLP) neural network, namely artificial bee colony (ABC-MLP), grasshopper optimization algorithm (GOA-MLP), shuffled frog leaping algorithm (SFLA-MLP), and salp swarm algorithm (SSA-MLP) for predicting this crucial parameter. The used dataset consists of 103 rows of information concerning seven influential parameters (cement, slag, water, fly ash, superplasticizer, fine aggregate, and coarse aggregate). In this work, the best-fitted complexity of each ensemble is determined by a population-based sensitivity analysis. The GOA distinguished its self by the least complexity (population size = 50) and emerged as the second time-effective optimizer. Referring to the prediction results, all tested algorithms are able to construct reliable networks. However, the SSA (Correlation = 0.9652 and Error = 1.3939) and GOA (Correlation = 0.9629 and Error = 1.3922) performed more accurately than ABC (Correlation = 0.7060 and Error = 4.0161) and SFLA (Correlation = 0.8890 and Error = 2.5480). Therefore, the SSA-MLP and GOA-MLP can be promising alternatives to laboratorial and traditional CSC evaluative methods.

A Fuzzy Controller for Obstacle Avoidance Robots and Lower Complexity Lookup-Table Sharing Method Applicable to Real-time Control Systems (이동 로봇의 장애물회피를 위한 퍼지제어기와 실시간 제어시스템 적용을 위한 저(低)복잡도 검색테이블 공유기법)

  • Kim, Jin-Wook;Kim, Yoon-Gu;An, Jin-Ung
    • Journal of the Korean Society for Precision Engineering
    • /
    • v.27 no.2
    • /
    • pp.60-69
    • /
    • 2010
  • Lookup-Table (LUT) based fuzzy controller for obstacle avoidance enhances operations faster in multiple obstacles environment. An LUT based fuzzy controller with Positive/Negative (P/N) fuzzy rule base consisting of 18 rules was introduced in our paper$^1$ and this paper shows a 50-rule P/N fuzzy controller for enhancing performance in obstacle avoidance. As a rule, the more rules are necessary, the more buffers are required. This paper suggests LUT sharing method in order to reduce LUT buffer size without significant degradation of performance. The LUT sharing method makes buffer size independent of the whole fuzzy system's complexity. Simulation using MSRDS(MicroSoft Robotics Developer Studio) evaluates the proposed method, and in order to investigate its performance, experiments are carried out to Pioneer P3-DX in the LabVIEW environment. The simulation and experiments show little difference between the fully valued LUT-based method and the LUT sharing method in operation times. On the other hand, LUT sharing method reduced its buffer size by about 95% of full valued LUT-based design.

Deep CNN based Pilot Allocation Scheme in Massive MIMO systems

  • Kim, Kwihoon;Lee, Joohyung
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.14 no.10
    • /
    • pp.4214-4230
    • /
    • 2020
  • This paper introduces a pilot allocation scheme for massive MIMO systems based on deep convolutional neural network (CNN) learning. This work is an extension of a prior work on the basic deep learning framework of the pilot assignment problem, the application of which to a high-user density nature is difficult owing to the factorial increase in both input features and output layers. To solve this problem, by adopting the advantages of CNN in learning image data, we design input features that represent users' locations in all the cells as image data with a two-dimensional fixed-size matrix. Furthermore, using a sorting mechanism for applying proper rule, we construct output layers with a linear space complexity according to the number of users. We also develop a theoretical framework for the network capacity model of the massive MIMO systems and apply it to the training process. Finally, we implement the proposed deep CNN-based pilot assignment scheme using a commercial vanilla CNN, which takes into account shift invariant characteristics. Through extensive simulation, we demonstrate that the proposed work realizes about a 98% theoretical upper-bound performance and an elapsed time of 0.842 ms with low complexity in the case of a high-user-density condition.

A Study on the Use Intention of Xiaomi in Korean Market

  • Jin, Peng-Ru;Lee, Jong-Ho
    • The Journal of Industrial Distribution & Business
    • /
    • v.9 no.11
    • /
    • pp.17-24
    • /
    • 2018
  • Purpose - The portability, functionality, and convenience of smart phones are constantly updated. With the rapid popularization of users of mobile terminals, Xiaomi is also developing rapidly. In February 2015, the users of Xiaomi exceeded 100 million people. As a transnational industry, Xiaomi has developed rapidly in not only China but also Korea. However, through the literature review, there is no radmissible study on the Xiaomi mobile telephones in the Korean market, so it is necessary to study the Xiaomi mobile phones in Korean market. Research design, data, and methodology - Figure analysis of data and social science analytical software of IBM SPSS AMOS 23.0 and IBM Statistics 23.0 were used for all the data researched. Results - First, the innovative diffusion temperament and the compatibility of Xiaomi have positive impacts on achievement expectations and effort expectations. Second, the innovative diffusion temperament and the complexity of Xiaomi have negative impacts on achievement expectations and effort expectations. Third, the innovative diffusion characteristics and the relative superiority of Xiaomi have positive impacts on achievement expectations and effort expectations. Conclusions - Through the analysis of the prior study, the innovation acceptance characteristics consist of compatibility, complexity, relative superiority, observation possibility, and the attempt possibility; the technical acceptance characteristics consist of achievement expectations, effort expectations, social influence, promotion condition, the study conducts relevant research on the continued use intention and analyze the hypothesis of research model.

Design Space Exploration for NoC-Style Bus Networks

  • Kim, Jin-Sung;Lee, Jaesung
    • ETRI Journal
    • /
    • v.38 no.6
    • /
    • pp.1240-1249
    • /
    • 2016
  • With the number of IP cores in a multicore system-on-chip increasing to up to tens or hundreds, the role of on-chip interconnection networks is vital. We propose a networks-on-chip-style bus network as a compromise and redefine the exploration problem to find the best IP tiling patterns and communication path combinations. Before solving the problem, we estimate the time complexity and validate the infeasibility of the solution. To reduce the time complexity, we propose two fast exploration algorithms and develop a program to implement these algorithms. The program is executed for several experiments, and the exploration time is reduced to approximately 1/22 and 7/1,200 at the first and second steps of the exploration process, respectively. However, as a trade-off for the time saving, the time cost (TC) of the searched architecture is increased to up to 4.7% and 11.2%, respectively, at each step compared with that of the architecture obtained through full-case exploration. The reduction ratio can be decreased to 1/4,000 by simultaneously applying both the algorithms even though the resulting TC is increased to up to 13.1% when compared with that obtained through full-case exploration.