• Title/Summary/Keyword: dense networks

Search Result 176, Processing Time 0.035 seconds

Attention-based CNN-BiGRU for Bengali Music Emotion Classification

  • Subhasish Ghosh;Omar Faruk Riad
    • International Journal of Computer Science & Network Security
    • /
    • v.23 no.9
    • /
    • pp.47-54
    • /
    • 2023
  • For Bengali music emotion classification, deep learning models, particularly CNN and RNN are frequently used. But previous researches had the flaws of low accuracy and overfitting problem. In this research, attention-based Conv1D and BiGRU model is designed for music emotion classification and comparative experimentation shows that the proposed model is classifying emotions more accurate. We have proposed a Conv1D and Bi-GRU with the attention-based model for emotion classification of our Bengali music dataset. The model integrates attention-based. Wav preprocessing makes use of MFCCs. To reduce the dimensionality of the feature space, contextual features were extracted from two Conv1D layers. In order to solve the overfitting problems, dropouts are utilized. Two bidirectional GRUs networks are used to update previous and future emotion representation of the output from the Conv1D layers. Two BiGRU layers are conntected to an attention mechanism to give various MFCC feature vectors more attention. Moreover, the attention mechanism has increased the accuracy of the proposed classification model. The vector is finally classified into four emotion classes: Angry, Happy, Relax, Sad; using a dense, fully connected layer with softmax activation. The proposed Conv1D+BiGRU+Attention model is efficient at classifying emotions in the Bengali music dataset than baseline methods. For our Bengali music dataset, the performance of our proposed model is 95%.

Prediction of Closed Quotient During Vocal Phonation using GRU-type Neural Network with Audio Signals

  • Hyeonbin Han;Keun Young Lee;Seong-Yoon Shin;Yoseup Kim;Gwanghyun Jo;Jihoon Park;Young-Min Kim
    • Journal of information and communication convergence engineering
    • /
    • v.22 no.2
    • /
    • pp.145-152
    • /
    • 2024
  • Closed quotient (CQ) represents the time ratio for which the vocal folds remain in contact during voice production. Because analyzing CQ values serves as an important reference point in vocal training for professional singers, these values have been measured mechanically or electrically by either inverse filtering of airflows captured by a circumferentially vented mask or post-processing of electroglottography waveforms. In this study, we introduced a novel algorithm to predict the CQ values only from audio signals. This has eliminated the need for mechanical or electrical measurement techniques. Our algorithm is based on a gated recurrent unit (GRU)-type neural network. To enhance the efficiency, we pre-processed an audio signal using the pitch feature extraction algorithm. Then, GRU-type neural networks were employed to extract the features. This was followed by a dense layer for the final prediction. The Results section reports the mean square error between the predicted and real CQ. It shows the capability of the proposed algorithm to predict CQ values.

Cluster-based Delay-adaptive Sensor Scheduling for Energy-saving in Wireless Sensor Networks (센서네트워크에서 클러스터기반의 에너지 효율형 센서 스케쥴링 연구)

  • Choi, Wook;Lee, Yong;Chung, Yoo-Jin
    • Journal of the Korea Society for Simulation
    • /
    • v.18 no.3
    • /
    • pp.47-59
    • /
    • 2009
  • Due to the application-specific nature of wireless sensor networks, the sensitivity to such a requirement as data reporting latency may vary depending on the type of applications, thus requiring application-specific algorithm and protocol design paradigms which help us to maximize energy conservation and thus the network lifetime. In this paper, we propose a novel delay-adaptive sensor scheduling scheme for energy-saving data gathering which is based on a two phase clustering (TPC). The ultimate goal is to extend the network lifetime by providing sensors with high adaptability to the application-dependent and time-varying delay requirements. The TPC requests sensors to construct two types of links: direct and relay links. The direct links are used for control and forwarding time critical sensed data. On the other hand, the relay links are used only for data forwarding based on the user delay constraints, thus allowing the sensors to opportunistically use the most energy-saving links and forming a multi-hop path. Simulation results demonstrate that cluster-based delay-adaptive data gathering strategy (CD-DGS) saves a significant amount of energy for dense sensor networks by adapting to the user delay constraints.

A Priority- based Minimum Interference Path Multicast Routing Algorithm in NGOI based DWDM (고밀도 파장 분할 다중화 방식 기반 차세대 광 인터넷망에서 우선순위 기반 최소간섭 경로 멀티캐스트 라우팅 알고리즘)

  • Jo, Chan-Hyo;Seo, Sang-Bo;Lee, Jun-Won;Kim, Sung-Un
    • Journal of KIISE:Information Networking
    • /
    • v.36 no.4
    • /
    • pp.286-296
    • /
    • 2009
  • A major challenge in next generation optical Internet (NGOI) networks based on dense-wavelength division multiplexing (DWDM) is the provision of guaranteed quality-of-service (QoS) for a wide variety of multimedia applications. One of the critical issues in NGOI is the routing and wavelength assignment problem that is embossed as very important and plays a key role in improving the global efficiency for capacity utilization. But the previous researches had the delay problem, and the path routed by higher priority nodes may be congested and interfere with potential future multicast session requests. To overcome these problems, in this research we suggest a Priority-based Minimum Interference Path Multicast Routing (PMIPMR) algorithm, a new routing algorithm which finds alternative routes based on node priorities and Virtual Source (VS) nodes that has both splitting and wavelength conversion, and then chooses a path that does not interfere with potential future multicast session requests when congestions occur in the network. The PMIPMR algorithm reduces blocking rate significantly and increases the wavelength utilization by avoiding congestion in future multicast session requests.

Secure and Efficient V2V Message Authentication Scheme in Dense Vehicular Communication Networks (차량 밀집환경에서 안전하고 효율적인 V2V 메시지 인증기법)

  • Jung, Seock-Jae;Yoo, Young-Jun;Paik, Jung-Ha;Lee, Dong-Hoon
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.20 no.4
    • /
    • pp.41-52
    • /
    • 2010
  • Message authentication is an essential security element in vehicular ad-hoc network(VANET). For a secure message authentication, integrity, availability, privacy preserving skill, and also efficiency in various environment should be provided. RAISE scheme has been proposed to provide efficient message authentication in the environment crowded with lots of vehicles and generally considered to be hard to provide efficiency. However, as the number of vehicles communicating in the area increases, the overhead is also incurred in proportion to the number of vehicles so that it still needs to be reduced, and the scheme is vulnerable to some attacks. In this paper, to make up for the vulnerabilities in dense vehicular communication network, we propose a more secure and efficient scheme using a process that RSU(Road Side Unit) transmits the messages of neighbor vehicles at once with Bloom Filter, and timestamp to protect against replay attack. Moreover, by adding a handover function to the scheme, we simplify the authentication process as omitting the unnecessary key-exchange process when a vehicle moves to other area. And we confirm the safety and efficiency of the scheme by simulating the false positive probability and calculating the traffic.

Consequences of land use change on bird distribution at Sakaerat Environmental Research Station

  • Trisurat, Yongyut;Duengkae, Prateep
    • Journal of Ecology and Environment
    • /
    • v.34 no.2
    • /
    • pp.203-214
    • /
    • 2011
  • The objectives of this research were to predict land-use/land-cover change at the Sakaerat Environmental Research Station (SERS) and to analyze its consequences on the distribution for Black-crested Bulbul (Pycnonotus melanicterus), which is a popular species for bird-watching activity. The Dyna-CLUE model was used to determine land-use allocation between 2008 and 2020 under two scenarios. Trend scenario was a continuation of recent land-use change (2002-2008), while the integrated land-use management scenario aimed to protect 45% of study area under intact forest, rehabilitated forest and reforestation for renewable energy. The maximum entropy model (Maxent), Geographic Information System (GIS) and FRAGSTATS package were used to predict bird occurrence and assess landscape fragmentation indices, respectively. The results revealed that parts of secondary growth, agriculture areas and dry dipterocarp forest close to road networks would be converted to other land use classes, especially eucalyptus plantation. Distance to dry evergreen forest, distance to secondary growth and distance to road were important factors for Black-crested Bulbul distribution because this species prefers to inhabit ecotones between dense forest and open woodland. The predicted for occurrence of Black-crested Bulbul in 2008 covers an area of 3,802 ha and relatively reduces to 3,342 ha in 2020 for trend scenario and to 3,627 ha for integrated-land use management scenario. However, intact habitats would be severely fragmented, which can be noticed by total habitat area, largest patch index and total core area indices, especially under the trend scenario. These consequences are likely to diminish the recreation and education values of the SERS to the public.

Dynamic Density-based Inhibited Message Diffusion For Reducing Overhead In Delay Tolerant Network (DTN에서 오버헤드 감소를 위한 동적 밀도 기반 메시지 확산 억제 기법)

  • Dho, Yoon-hyung;Oh, Young-jun;Lee, Kang-whan
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2015.05a
    • /
    • pp.120-122
    • /
    • 2015
  • In this paper, we proposed an algorithm of the unnecessary copied message inhibition using dynamic density what is called DDIM(Dynamic Density-based Inhibited Message diffusion) in DTNs(Delay Tolerant Networks). Existing DTN routing algorithms as Epidemic and Spray and Wait have some problems that occur large overhead in dense network due to the thoughtless message diffusion. Our proposed method, the DDIM, determines adjusted number of copied message through dynamic node density that is calculated using node's radio coverage and neighbor nodes in period time to solve message diffusion problem. It decrease overhead without losing message delivery ratio and increased latency through reducing message diffusion. In this paper, we compare delivery ratio, average latency and overhead of proposed algorithm, DDIM, and existing DTN routing algorithm and prove enhanced performance through simulation results.

  • PDF

Utilization of Legacy APs for Seamless Handover in a SDN Environment (네트워크 가상화 환경에서 끊김 없는 핸드오버를 위한 일반 AP 활용)

  • Lee, Hyung-Bong;Kwon, Ki-Hyeon
    • Journal of Digital Contents Society
    • /
    • v.19 no.8
    • /
    • pp.1545-1554
    • /
    • 2018
  • In order to support the mobility of the wireless devices, at least two APs (Access Points) must be arranged in a single AP area to maintain communication area. In the WLAN (Wireless LAN) environment, seamless handover is one of the most important issues in terms of effective utilization of wireless networks and maximization of services for users. On the other hand, SDN (Software-Defined Networking), which is emerging rapidly in recent years, is revolutionizing network management in terms of flexibility, fine control, and convenience. SDN originally reduces latency time or increases network robustness by real-time flow table control reducing or bypassing paths between switches in LAN-based data centers. In this study, we apply OpenFlow, a SDN platform focused on wired LAN, to a dense WLAN environment using legacy APs to implement and evaluate seamless handover for streaming services of digital contents.

UHF and S-Band Radar Networks (UHF와 S밴드 레이더 관측망 구축)

  • Kim, Park-Sa;Kim, Kwang-Ho;Campistrom, Bernard;Yoon, Hong-Joo;Kwon, Byung-Hyuk
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.13 no.2
    • /
    • pp.305-312
    • /
    • 2018
  • The quality of the radar and profiler network was estimated to forecast difficult meteorological situations. A network of UHF Doppler wind profilers and Doppler weather radars have been deployed all over the Korean Peninsular, with dense spatial resolution between instruments. The radar network allows to retrieve the three dimensional dynamics and to analyze the numerical model outputs at small and meso scales. This work has seldom been performed in any other place of the world, with such a high resolution. The wind field from radar network is a good agreement with the background wind fields based on the numerical modeling. This study will be helpful to forecast severe weathers as well as local meteorological phenomena.

RWA Algorithm for Differentiated Service in Next Generation Optical Internet Backbone Networks (차세대 광인터넷 백본망에서 차등화 서비스 제공을 위한 RWA 알고리즘)

  • 송현수;배정현;김성운;김영부;이현진;이재동
    • Journal of KIISE:Information Networking
    • /
    • v.31 no.2
    • /
    • pp.196-206
    • /
    • 2004
  • In the Next Generation Internet(NGI) backbone network, a Dense Wavelength Division Multiplexing (DWDM) technology has been more and more highlighted to cover the increasing subscribers and bandwidth requirement. For such a DWDM network, Routine and Wavelength Assignment (RWA) is the essential problem to establish the optimal path and assign a wavelength efficiently to the selected path in resource utilization. However, the existing RWA algorithms do not consider the congestion in the network so that the performance of then is so limited. To solve this problem, in this paper, we introduce a new RWA algorithm, called Multi Wavelength-Minimum Interference path Routing (MW-MIPR) that establishes a routing path to minimize the interference for many potential future connection setup request. And then, we also propose a wavelength-routed QoS routing scheme based on differentiated QoS classes with applying MW-MIPR algorithm. Simulation results are also given to prove the efficiency of the proposed algorithms.