• Journal of the Korea Fashion and Costume Design Association
• /
• v.26 no.1
• /
• pp.45-60
• /
• 2024

This study analyzes the athleisure wear purchase status, wearing conditions, and design preferences of men in their 20s and 30s and provides basic data for the development of men's athleisure wear that reflects consumer preferences. An online survey was conducted on 200 men from August 23 to August 27, 2023. The questionnaire consisted of a total of 48 questions, including 8 questions about the respondent's general information, 19 questions about the purchase status of athleisure wear, 6 questions about the status of wearing athleisure wear, and 15 questions about athleisure wear design preferences. The survey results are as follows. The most common motive for exercise participation was 'maintaining health.' 'Nike' was the most preferred and purchased brand among athleisure wear brands, and the main place of purchase of athleisure wear was 'Internet and mobile shopping malls', reflecting the recent purchasing trend of the MZ generation. When purchasing athleisure wear, the most common selection criterion was 'design', followed by 'fitting comfort', 'possibility to use as daily wear', and 'price'. The most common route to obtain purchase information was 'Internet search', and the 'overall satisfaction' with athleisure wear was found to be satisfactory with an average of 3.83. The most common reason for wearing athleisure wear was 'because it is comfortable to do activities', followed by 'because it can be used as everyday wear'. Lastly, 'black', 'short-sleeved t-shirt', 'short length' sleeve, 'round neckline', 'waist length', and 'relaxed loose fit' were preferred for the top design, and 'black', 'shorts', 'full elastic type' waistband, 'regular fit that fits the body well' were preferred for the bottom design.

• Journal of KIISE:Information Networking
• /
• v.32 no.1
• /
• pp.89-99
• /
• 2005

Advances of Internet and rC accelerate distribution and sharing of information, which make P2P(Peer-to-Peer) computing paradigm appear P2P computing Paradigm is the computing paradigm that shares computing resources and services between users directly. A fundamental problem that confronts Peer-to-Peer applications is the efficient location of the node that stoles a desired item. P2P systems treat the majority of their components as equivalent. This purist philosophy is useful from an academic standpoint, since it simplifies algorithmic analysis. In reality, however, some peers are more equal than others. We propose the P2P protocol considering differences of capabilities of computers, which is ignored in previous researches. And we examine the possibility and applications of the protocol. Simulating the Magic Square, we estimate the performances of the protocol with the number of hop and network round time. Finally, we analyze the performance of the protocol with the numerical formula. We call our p2p protocol the Magic Square. Although the numbers that magic square contains have no meaning, the sum of the numbers in magic square is same in each row, column, and main diagonal. The design goals of our p2p protocol are similar query response time and query path length between request peer and response peer, although the network information stored in each peer is not important.

• Journal of Internet Computing and Services
• /
• v.6 no.2
• /
• pp.69-84
• /
• 2005

As the Internet users are increasing rapidly, a cluster web server system is attracted by many researchers and Internet service providers. The cluster web server has been developed to efficiently support a larger number of users as well as to provide high scalable and available system. In order to provide the high performance in the cluster web server, efficient load distribution is important, and recently many content-aware request distribution techniques have been proposed. In this paper, we propose a new content-aware load balancing technique that can evenly distribute the workload to each node in the cluster web server. The proposed technique is based on the hash histogram transformation, in which each URL entry of the web log file is hashed, and the access frequency and file size are accumulated as a histogram. Each user request is assigned into a node by mapping of (hashed value-server node) in the histogram transformation. In the proposed technique, the histogram is updated periodically and then the even distribution of user requests can be maintained continuously. In addition to the load balancing, our technique can exploit the cache effect to improve the performance. The simulation results show that the performance of our technique is quite better than that of the traditional round-robin method and we can improve the performance more than $10\%$ compared with the existing workload-aware load balancing(WARD) method.

• Journal of Internet of Things and Convergence
• /
• v.10 no.4
• /
• pp.1-8
• /
• 2024

As technology advances, Internet of Things (IoT) technology is rapidly evolving as well. Various protocols, including Message Queuing Telemetry Transport (MQTT), are being used in IoT technology. MQTT, a lightweight messaging protocol, is considered a de-facto standard in the IoT field due to its efficiency in transmitting data even in environments with limited bandwidth and power. In this paper, we propose a method to improve the message transmission method in MQTT 5.0, specifically focusing on the shared subscription feature. The widely used round-robin method in shared subscriptions has the drawback of not considering the current state of the clients. To address this limitation, we propose a method to select the optimal transmission method by considering the current state. We model this problem based on Markov decision process (MDP) and utilize Q-Learning to select the optimal transmission method. Through simulation results, we compare our proposed method with existing methods in various environments and conduct performance analysis. We confirm that our proposed method outperforms existing methods in terms of performance and conclude by suggesting future research directions.

• Journal of Institute of Control, Robotics and Systems
• /
• v.13 no.11
• /
• pp.1099-1105
• /
• 2007

In this paper, modified two-port time-domain passivity approach is proposed for stable bilateral control of teleoperators under time-varying communication delay. We separate input and output energy at each port of a bilateral controller, and propose a sufficient condition for satisfying the passivity of the bilateral controller including time-delay. Output energy at the master port should be less than the transmitted input energy from the slave port with time-delay, and output energy at the slave port should be less than the transmitted input energy from the master port with time-delay. For satisfying above two conditions, two passivity controllers are attached at each port of the bilateral controller. A packet reflector with wireless internet connection is used to introduce serious time-varying communication delay of teleoperators. Average amount of time-delay was about 190(msec) for round trip, and varying between 175(msec) and 275(msec). Moreover some data packet was lost during the communication due to UDP data communication. Even under the serious time-varying delay and packet loss communication condition, the proposed approach can achieve stable teleoperation in free motion and hard contact as well.

• International journal of advanced smart convergence
• /
• v.6 no.1
• /
• pp.57-67
• /
• 2017

In this paper, propose an algorithm to improve network lifetime by equally consuming energy of LEACH - Mobile sensor nodes. LEACH is one of energy efficient protocols. However, we did not consider the mobility of nodes. Therefore, the transmission reception success rate of the moving data is reduced. LEACH-Mobile is a protocol that has improved the drawbacks of these LEACH. However, since LEACH-Mobile has a larger number of data packets and consumes more energy than LEACH, it has a disadvantage that the lifetime of the network is short. In order to improvement these disadvantage, Based on the average of the remaining energy of the node, cluster heads are elected with a number of nodes whose energies are larger than the average of the remaining energy from the member nodes. After that, by trying to increase the lifetime of the network by equalizing the remaining energy. In to confirm whether improve the lifetime of the network, In this paper, the number of nodes and the position of all nodes are varied for each specific round, the rest energy is equalized, and the algorithm which uniformly selected the cluster head is compared with LEACH.

• International journal of advanced smart convergence
• /
• v.9 no.2
• /
• pp.185-194
• /
• 2020

Designing of a hierarchical clustering algorithm is one of the numerous approaches to minimize the energy consumption of the Wireless Sensor Networks (WSNs). In this paper, a homogeneous and randomly deployed sensor nodes is considered. These sensors are energy constrained elements. The nominal selection of the Cluster Head (CH) which falls under the clustering part of the network protocol is studied and compared to Low Energy Adaptive Clustering Hierarchy (LEACH) protocol. CHs in this proposed process is the function of total remaining energy of each node as well as total average energy of the whole arrangement. The algorithm considers initial energy, optimum value of cluster heads to elect the next group of cluster heads for the network as well as residual energy. Total remaining energy of each node is compared to total average energy of the system and if the result is positive, these nodes are eligible to become CH in the very next round. Analysis and numerical simulations quantify the efficiency and Average Energy Ratio (AER) of the proposed system.

• Smart Media Journal
• /
• v.4 no.4
• /
• pp.39-46
• /
• 2015

This paper describes hardware implementation of the encryption block of the '128 bit block cipher LEA' among various lightweight encryption algorithms for IoT (Internet of Things) security. Round function blocks and key-schedule blocks are designed by parallel circuits for high throughput. The encryption blocks support secret-key of 128 bits, and are designed by FSM method and 24/n stage(n=1, 2, 3, 4, 8, 12) pipeline methods. The LEA-128 encryption blocks are modeled using Verilog-HDL and implemented on FPGA, and according to the synthesis results, minimum area and maximum throughput are provided.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2002.05a
• /
• pp.418-425
• /
• 2002

Bluetooth is an emerging technology expected to provide users with short range, low cost, pico-cellular wireless connectivity. The access to the medium for Bluetooth is based on a Master driven Time Division Duplexing (TDD) scheme. A slave transmits packets in the reverse slot only after the master polls the slave (or transmits a packet to the slave) in a forward slot. The master transmits packets to a slave in even slots while the slave transmits packets to the master in an odd slot. The way in which the master schedules packets transmission to slaves or polls them determines system performance. In this paper. we propose a traffic adaptive MAC scheduling scheme for Bluetooth. The proposed scheme adopts the ISAR (Intelligent Segmentation and Reassembly) policy, which adjusts the packet size to the traffic patterns, to adapt the polling frequency to the traffic conditions. Also for achieving fairness among master-slave connections our scheme includes a priority policy assinging prioritised service tlimes to each connection. By considering a scenario where a Bluetooth master is used as wireless access point to the Internet, we show that our scheme improve the system throughput and average queue delay with regard to a naive Round Robin (RR) scheme.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2017.10a
• /
• pp.485-487
• /
• 2017

The whirlpool hash function adopted as an ISO / IEC standard 10118-3 by the international standardization organization is an algorithm that provides message integrity based on an SPN (Substitution Permutation Network) structure similar to AES block cipher. In this paper, we describe the hardware implementation of the Whirlpool hash function. The round block is designed with a 64-bit data path and encryption is performed over 10 rounds. To minimize area, key expansion and encryption algorithms use the same hardware. The Whirlpool hash function was modeled using Verilog HDL, and simulation was performed with ModelSim to verify normal operation.