• Journal of Internet Computing and Services
• /
• v.11 no.1
• /
• pp.15-20
• /
• 2010

In this paper, we propose a novel approach to reduce spatial query access latency and energy consumption by leveraging results from nearby peers in wireless broadcast environments. We propose a three-tier Hierarchical Location-Based Sequential access index, called HLBS, which provides selective tuning (pruning and searching entries) without pointers using a linear accessing structure based on the location of each data object. The HLBS saves search cost and index overhead, since the small index size with a sequential index structure results in low access latency overhead and facilitates efficient searches for sequential-access media (wireless channels with data broadcast). Comprehensive experiments illustrate that the proposed scheme is more efficient than the previous techniques in terms of energy consumption.

• Annual Conference of KIPS
• /
• 2024.05a
• /
• pp.774-776
• /
• 2024

The effective implementation of advanced speech recognition (ASR) systems necessitates the deployment of sophisticated keyword spotting models that are both responsive and resource-efficient. The initial local detection of user interactions is crucial as it allows for the selective transmission of audio data to cloud services, thereby reducing operational costs and mitigating privacy risks associated with continuous data streaming. In this paper, we address these needs and propose utilizing the Whisper-Tiny model with fine-tuning process to specifically recognize keywords from google speech dataset which includes 65000 audio clips of keyword commands. By adapting the model's encoder and appending a lightweight classification head, we ensure that it operates within the limited resource constraints of local devices. The proposed model achieves the notable test accuracy of 92.94%. This architecture demonstrates the efficiency as on-device model with stringent resources leading to enhanced accessibility in everyday speech recognition applications.

• Journal of KIISE:Databases
• /
• v.32 no.4
• /
• pp.405-415
• /
• 2005

Indexing techniques are used to implement selective tuning in wireless environments Indices are broadcast together with data to help mobile clients locate the required information. As a result, clients stay in doze mode most of the time. The drawback of this solution is that broadcast cycles are lengthened due to additional index information. In location-aware mobile services(LAMSs), it is important to reduce the query response time, since a late query response nay contain out-of-date information. In this paper, we present a broadcast-based spatial query processing method (BBS) designed to support k-NN query processing. In the BBS, broadcasted data objects are sorted sequentially based on their locations, and the server broadcasts the location dependent data along with an index segment. The performance of this scheme is investigated in relation to various environmental variables, such as the distributions of the data objects, the average speed of the clients and the size of the service area.

• Proceedings of the Korean Vacuum Society Conference
• /
• 2012.08a
• /
• pp.181-181
• /
• 2012

Direct synthesis of graphene using a chemical vapor deposition (CVD) has been considered a facile way to produce large-area and uniform graphene film, which is an accessible method from an application standpoint. Hence, their fundamental understanding is highly required. Unfortunately, the CVD growth mechanism of graphene on Cu remains elusive and controversial. Here, we present the evidences for two different growth modes of graphene on Cu investigated by varying carbon feedstock (C2H2 and CH4) and working pressure. The number of uniform graphene layer grown by C2H2 increased with increasing its injection time. A combined secondary ion mass spectrometry (SIMS) and X-ray diffraction (XRD) study revealed a carbon-diffused Cu layer created below surface region of Cu substrate with the expansion of Cu lattice. The graphene on Cu was grown by the diffusion and precipitation mode not by the surface adsorption mode, because similar results were observed in graphene/Ni system. The carbon-diffused Cu layer was also observed after graphene growth under high CH4 pressure. Based on various previous results and ours, we have successfully found that there are two selective growth modes for graphene on Cu substrate, and a desired mode can be chosen by tuning working pressure corresponding to the kind of carbon feedstock. We believe that this finding will shed light on high quality graphene growth and its multifaceted applications.

• Journal of Internet Computing and Services
• /
• v.10 no.6
• /
• pp.1-6
• /
• 2009

In this paper, we propose an energy efficient index scheme for Nearest Neighbor queries, specially designed for mobile P2P environments. we propose a PMBR (P2P Minimum Boundary Rectangle) index that provides the client with the ability of selective contacting and tuning from other nodes. The mobile client is able to identify whether or not the neighbor nodes have the desired information by accessing PMBR. Thus, the client immediately switches to change to another node's broadcast channel if the index does not contain the desired information. Furthermore, the client is able to predict the arrival time of the desired data items and only needs to tune into the broadcast channel when the requested data items arrives, by first accessing PMBR. Thus, the mobile client can stay in power save mode most of time, and tune into the broadcast channel only when the requested data items arrive. Experiments are conducted to evaluate the performance of the proposed scheme. Comprehensive experiments illustrate that the proposed scheme is more efficient than the previous techniques in terms of energy consumption.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.16 no.5
• /
• pp.223-229
• /
• 2023

This Paper propose the method that measure main system parameters for PI(proportional-integral) current control of a.c. motor adopting the vector control technique. For current control, the PI control input is could be tuning by several selective methods. Among the several methods, the method that using the main system parameters, wire resistance and inductance, are frequently used. In this study, the technique to dissect and measure these two system parameters through the results of simple feedback control. This analytic measurement method is measuring parameters step by step dissecting the results of P control using simple proportional feedback gain about the unit step or multiple step reference command. This strategy is an real time analytic measurement method that calculate current control gains of torque component and flux component both for vector control of A.C. motor without introducing the further measurement circuits and complex measuring algorithms.

• Journal of KIISE:Databases
• /
• v.28 no.4
• /
• pp.742-757
• /
• 2001

Since database management systems(DBMSS) have limited lock resources, transactions requesting locks beyond the limit mutt be aborted. In the worst carte, if such transactions are aborted repeatedly, the DBMS can become paralyzed, i.e., transaction execute but cannot commit. Lock escalation is considered a solution to this problem. However, existing lock escalation methods do not provide a complete solution. In this paper, we prognose a new lock escalation method, adaptive lock escalation, that selves most of the problems. First, we propose a general model for lock escalation and present the concept of the unescalatable look, which is the major cause making the transactions to abort. Second, we propose the notions of semi lock escalation, lock blocking, and selective relief as the mechanisms to control the number of unescalatable locks. We then propose the adaptive lock escalation method using these notions. Adaptive lock escalation reduces needless aborts and guarantees that the DBMS is not paralyzed under excessive lock requests. It also allows graceful degradation of performance under those circumstances. Third, through extensive simulation, we show that adaptive lock escalation outperforms existing lock escalation methods. The results show that, compared to the existing methods, adaptive lock escalation reduces the number of aborts and the average response time, and increases the throughput to a great extent. Especially, it is shown that the number of concurrent transactions can be increased more than 16 ~256 fold. The contribution of this paper is significant in that it has formally analysed the role of lock escalation in lock resource management and identified the detailed underlying mechanisms. Existing lock escalation methods rely on users or system administrator to handle the problems of excessive lock requests. In contrast, adaptive lock escalation releases the users of this responsibility by providing graceful degradation and preventing system paralysis through automatic control of unescalatable locks Thus adaptive lock escalation can contribute to developing self-tuning: DBMSS that draw a lot of attention these days.