• Title/Summary/Keyword: software updates

Search Result 70, Processing Time 0.025 seconds

Orthogonal Nonnegative Matrix Factorization: Multiplicative Updates on Stiefel Manifolds (Stiefel 다양체에서 곱셈의 업데이트를 이용한 비음수 행렬의 직교 분해)

  • Yoo, Ji-Ho;Choi, Seung-Jin
    • Journal of KIISE:Software and Applications
    • /
    • v.36 no.5
    • /
    • pp.347-352
    • /
    • 2009
  • Nonnegative matrix factorization (NMF) is a popular method for multivariate analysis of nonnegative data, the goal of which is decompose a data matrix into a product of two factor matrices with all entries in factor matrices restricted to be nonnegative. NMF was shown to be useful in a task of clustering (especially document clustering). In this paper we present an algorithm for orthogonal nonnegative matrix factorization, where an orthogonality constraint is imposed on the nonnegative decomposition of a term-document matrix. We develop multiplicative updates directly from true gradient on Stiefel manifold, whereas existing algorithms consider additive orthogonality constraints. Experiments on several different document data sets show our orthogonal NMF algorithms perform better in a task of clustering, compared to the standard NMF and an existing orthogonal NMF.

An Efficient If Routing Lookup by Using Routing Interval

  • Wang, Pi-Chung;Chan, Chia-Tai;Chen, Yaw-Chung
    • Journal of Communications and Networks
    • /
    • v.3 no.4
    • /
    • pp.374-382
    • /
    • 2001
  • Nowadays, the commonly used table lookup scheme for IP routing is based on the sc-called classless interdomain routing (CIDR). With CIDR, routers must find out the best matching prefix (BMP) for IP packets forwarding, this complicates the IP lookup. Currently, this process is mainly performed in software and several schemes hale been proposed for hardware implementation. Since the IP lookup performance is a major design issue for the new generation routers, in this article we investigate the properties of the routing table and present a new approach for IP lookups, our approach is not based Gn BMP and significantly reduces the complexity, thus the computation cast of existing schemes can be significantly reduced. We also propose an efficient IP lookup algorithm, with which we improve the binary search on prefixes to 30 millions of packets per second (MPPS) and 5,000 route updates/s under the same experiment setup with an even larger routing table.

  • PDF

An Efficient Algorithm for Real-Time 3D Terrain Walkthrough

  • Hesse, Michael;Gavrilova, Marina L.
    • International Journal of CAD/CAM
    • /
    • v.3 no.1_2
    • /
    • pp.111-117
    • /
    • 2003
  • The paper presents an efficient algorithm based on ROAM for visualization of large scale terrain models in real-time. The quality and smoothness of the terrain data visualization within a 3D interactive environment is preserved, while the complexity of the algorithm is kept on a reasonable level. The main contribution of the paper is an introduction of a number of efficient techniques such as implicit coordinates method within the patch array representing ROAM and the viewpoint dependent triangle rendering method for dynamic level of detail (LOD) updates. In addition, the paper presents experimental comparison of a variety of culling techniques, including a newly introduced method: relational position culling. These techniques are incorporated in the visualization software, which allows to achieve more realistic terrain representation and the real-time level of detail reduction.

Modified Feistel Network Block Cipher Algorithm (변형 피스탈 네트워크 블록 암호 알고리즘)

  • Cho, Gyeong-Yeon;Song, Hong-Bok
    • Journal of the Korea Computer Industry Society
    • /
    • v.10 no.3
    • /
    • pp.105-114
    • /
    • 2009
  • In this paper a modified Feistel network 128 bit block cipher algorithm is proposed. The proposed algorithm has a 128, 196 or 256 bit key and it updates a selected 32 bit word from input value whole by deformed Feistel Network structure. Existing of such structural special quality is getting into block cipher algorithms and big distinction. The proposed block cipher algorithm shows much improved software speed compared with international standard block cipher algorithm AES and domestic standard block cipher algorithm SEED and ARIA. It may be utilized much in same field coming smart card that must perform in limited environment if use these special quality.

  • PDF

Threats and response measures according to the type of software updates (소프트웨어 업데이트 유형별 위협요소 및 대응방안)

  • Lee, Daesung
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2014.05a
    • /
    • pp.277-279
    • /
    • 2014
  • In case of APT attacks, the update server is being used as a means of dissemination, the update program is running malicious code or data in applications such as anti-virus signature is vulnerable to manipulation, SW Update threat identification and prevention measures are urgently required. This paper presents a natiional and international SW update structure, update process exploits and response measures to examine, Through the extraction/analysis of a domestic famous SW update log, we are willing to select the necessary component of the normal program update to identify a white list.

  • PDF

Game-Theoretic Optimization of Common Control Channel Establishment for Spectrum Efficiency in Cognitive Small Cell Network

  • Jiao Yan
    • International journal of advanced smart convergence
    • /
    • v.13 no.1
    • /
    • pp.1-11
    • /
    • 2024
  • Cognitive small cell networks, consisting of macro-cells and small cells, are foreseen as a promising candidate solution to address 5G spectrum scarcity. Recently, many technological issues (such as spectrum sensing, spectrum sharing) related to cognitive small cell networks have been studied, but the common control channel (CCC) establishment problem has been ignored. CCC is an indispensable medium for control message exchange that could have a huge significant on transmitter-receiver handshake, channel access negotiation, topology change, and routing information updates, etc. Therefore, establishing CCC in cognitive small cell networks is a challenging problem. In this paper, we propose a potential game theory-based approach for CCC establishment in cognitive radio networks. We design a utility function and demonstrate that it is an exact potential game with a pure Nash equilibrium. To maintain the common control channel list (CCL), we develop a CCC update algorithm. The simulation results demonstrate that the proposed approach has good convergence. On the other hand, it exhibits good delay and overhead of all networks.

A Study on Vulnerability Analysis and Memory Forensics of ESP32

  • Jiyeon Baek;Jiwon Jang;Seongmin Kim
    • Journal of Internet Computing and Services
    • /
    • v.25 no.3
    • /
    • pp.1-8
    • /
    • 2024
  • As the Internet of Things (IoT) has gained significant prominence in our daily lives, most IoT devices rely on over-the-air technology to automatically update firmware or software remotely via the network connection to relieve the burden of manual updates by users. And preserving security for OTA interface is one of the main requirements to defend against potential threats. This paper presents a simulation of an attack scenario on the commoditized System-on-a-chip, ESP32 chip, utilized for drones during their OTA update process. We demonstrate three types of attacks, WiFi cracking, ARP spoofing, and TCP SYN flooding techniques and postpone the OTA update procedure on an ESP32 Drone. As in this scenario, unpatched IoT devices can be vulnerable to a variety of potential threats. Additionally, we review the chip to obtain traces of attacks from a forensics perspective and acquire memory forensic artifacts to indicate the SYN flooding attack.

Development of Universal Remote Control System using TFT Color LCD (TFT Color LCD를 사용한 통합형 리모컨 개발)

  • Kim Yong-Pyo;Yoon Dong-Han;Choi Un-Ha
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.10 no.8
    • /
    • pp.1495-1501
    • /
    • 2006
  • In this paper, It is purposed to Develope Development of Home Automation Remote Control System using W Color touch LCD(liquid crystal display). This control remotely with remote control innovative and ergonomic design, right combination of LCD and hard buttons and its industry leading technology puts your customers at the cutting-edge of home entertainment. Remote Control for casual users is programmed automatically programmed with multiple free step macros and IR commands. Radio Frequency (RF) operation provides 50-100 inch range though walls and doors. Editor includes a vast library of IR codes for hundreds of brands and models of A/V components. This database is constantly growing with the inclusion of new devices every month. Keep your software up to date by using the Live Update feature. Rather than un-installing and re-installing the software, you download updates to the software from the internet.

Efficiently Managing the B-tree using Write Pattern Conversion on NAND Flash Memory (낸드 플래시 메모리 상에서 쓰기 패턴 변환을 통한 효율적인 B-트리 관리)

  • Park, Bong-Joo;Choi, Hae-Gi
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.36 no.6
    • /
    • pp.521-531
    • /
    • 2009
  • Flash memory has physical characteristics different from hard disk where two costs of a read and write operations differ each other and an overwrite on flash memory is impossible to be done. In order to solve these restrictions with software, storage systems equipped with flash memory deploy FTL(Flash Translation Layer) software. Several FTL algorithms have been suggested so far and most of them prefer sequential write pattern to random write pattern. In this paper, we provide a new technique to efficiently store and maintain the B-tree index on flash memory. The operations like inserts, deletes, updates of keys for the B-tree generate random writes rather than sequential writes on flash memory, leading to inefficiency to the B-tree maintenance. In our technique, we convert random writes generated by the B-tree into sequential writes and then store them to the write-buffer on flash memory. If the buffer is full later, some sequential writes in the buffer will be issued to FTL. Our diverse experimental results show that our technique outperforms the existing ones with respect to the I/O cost of flash memory.

Analysis of Security Requirements for Secure Update of IVI(In-Vehicle-Infotainment) Using Threat Modeling and Common Criteria (위협모델링과 공통평가기준을 활용한 인포테인먼트의 안전한 업데이트 보안요구사항 분석)

  • Kang, Soo-young;Kim, Seung-joo
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.29 no.3
    • /
    • pp.613-628
    • /
    • 2019
  • In-Vehicle Infotainment provides navigation and various functions through the installation of the application. And infotainment is very important to control the entire vehicle by sending commands to the ECU. Infotainment supports a variety of wireless communication protocols to install and update applications. So Infotainment is becoming an attack surface through wireless communcation protocol for hacker's access. If malicious software is installed in infotainment, it can gain control of the vehicle and send a malicious purpose command to the ECU, affecting the life of the driver. Therefore, measures are needed to verify the security and reliability of infotainment software updates, and security requirements must be derived and verified. It must be developed in accordance with SDL to provide security and reliability, and systematic security requirements must be derived by applying threat modeling. Therefore, this paper conducts threat modeling to derive infotainment update security requirements. Also, the security requirements are mapped to the Common Criteria to provide criteria for updating infotainment software.