waashk/dblp huggingface dataset:
implementation of ieee802.11a software defined receiver on chip multi-processor architecture using openmp. software radio (sr) is a promising technology for the next generation communication since it enables to implement various communication protocols in one platform. in general, software radio systems implemented in dsps or fpgas deliver satisfactory performance, but they do not provide enough flexibility which is a key merit of using soft radios. in this paper we implement a software radio system on a general purpose multiprocessor. running communication applications on an os-based general purpose processor has several merits. however, there are two big shortcomings. first, the system may not satisfy the required performance. second, it may be hard to meet the real time constraints. to achieve the required performance of signal processing, a chip multiprocessor is employed. typically, ample potential for parallelization is found in communication software. therefore by effectively utilizing task-level parallelism, chip multiprocessors can achieve the required performance. in this paper, we implement an ieee 802.11a baseband receiver in software, and parallelize the software by openmp. we also propose a new synchronization technique among threads. we evaluate the performance after running the software on an intel quad core workstation with the centos.
movement-aware alternative path routing protocol for vehicular multi-hop communications. vehicular ad-hoc networks (vanets) are now considered to be suitable for enhancing road safety and efficiency in vehicular environment. especially, due to the affluent spectrum resource, supports for non-safety relevant services, like inter-vehicle entertainments, are also under investigation. however, in the vehicular environments, the nodes can experience frequent link breakages due to the vehicle mobility characteristic. thus, a reliable multi-hop routing protocols is definitely needed to overcome the performance degradation caused by it. in this paper, we propose a novel scheme for non-safety applications, which is also referred as movement-aware alternative path routing protocol (marp), a reactive unicast routing protocol that considers two factors such as vehicle movement and multi-path to determine the optimum reliable routing paths. in addition, we devote special attention to the random characteristic of the radio propagation model to provide a simulation with the desired level of realism. after realistic simulation studies, the performance of proposed marp routing protocol outperforms the traditional vanets routing by reducing the routing overhead and enhancing the stability of routing path.
a study on intelligent cyber university. it is accepted that virtual university can easily study the lecture only press the mouse click or keyboard button anywhere and anytime, if you have a computer. in addition, many people believe that virtual university can save time and improve learning. in order to provide good lecture for them, it is needed that instructor should know how to understand their students related various course as well as find out their difficult problems. in this paper, we will propose new scheme to overcome the problem, which was originated from the cyber lecture. it is a studying method of full duplex direction. the method of traditional studying is one direction method. the computer simulation results confirms that full duplex virtual learning system has been proven to be much more efficient than one way direction which unfortunately does not consider to understanding problems.
capability and limitation of financial time-series data prediction using symbol string quantization. there are many methods for analyzing patterns in time-series data. although stock data represents a time series, there are few studies on pattern analysis and prediction stock price dynamics in the field of computer science. since people believe that stock price changes randomly we cannot predict stock prices using a scientific method. in this paper, we calculate randomness of stock price changes using kolmogorov complexity. it is related to the accuracy of stock prediction using semi-global alignments. we use stock price data of 690 firms listed on the korea stock exchange (krx) during 28 years for our experiments and to evaluate our methodology. when kolomogorov complexity is high we cannot predict accurately stock prices; while kolomogorov complexity is low, we can predict stock prices accurately. however, the prediction ratio of stock price changes of interest to investors, is 12% for short-term predictions and 54% for long-term predictions.
effective spelling correction in web queries and run-time db construction. studies on correcting errors in web search queries has some history over the past few years. there were novel ways in solving issues that occur when applying spelling correction techniques to query logs. this paper takes one more step forwards creating an effective and practical system out of what was learned so far, while also taking an intuitive approach to calculate a query's validity with the help of additional query information. this system consists of three phases that separates calculation from run-time database structure, which results in a faster program that can be used in real-time.
a threat-based privacy preservation system in untrusted environment. in an untrusted environment, it is hard to ensure that all the available technologies are being used to protect data privacy. once user's data is hosted outside of his/her local computer, a degree of control over his/her privacy information may be lost. consequently, a variety of threats may arise and result in hazards to the user. for that reason, users want to disclose privacy data in a minimum way so that the potential threats to their data can be also minimized. thus, the importance of privacy data elements must be verified by individual user. however, user may not be able to achieve this task if the threats are not obvious to the user. to address this problem, in this paper, we present a threat-based privacy preservation system that helps a user to evaluate the importance of privacy data and the risk of disclosing it. in our system, users can specify their privacy preferences by setting penalty values on potential threats. through a goal-oriented approach, our system can select proper services for users to restrict data disclosure by which the potential threats to users can be minimized.
privacy information protection in portable device. with the development of the information technology are increasing ever before, and the damage of it re-engineering is also rapidly increasing. particularly, overflow of critical information through the portable storage device is getting more important problems in these days. in this paper, we are making a suggestion of the pdsm (portable device security management) in order to solve these problems. the pdsm system is composed of 5 functions: 1) user identification/authentication, 2) specified data encryption and decryption, 3) copy prevention of stored data 4) deletion for data protection, 5) control management for major information. we also prototyped the pdsm which provides the privacy information protection for feasible approach in real system environments.
effective defect classification for flat display panel film images. in this paper, we propose an effective defect classification system for fdp (flat display panel) film images which are acquired in real production lines. a film image is segmented into a binary image with two non-overlapping regions: defect and non-defect regions. from the defect regions, various features are extracted such as brightness distribution, linearity, and morphologic characteristics. the film defects are classified through the analysis of those features extracted. empirical study shows our system classifies five types of film defects effectively.
optical wireless recharging model for wireless sensor nodes by using corner cube retroreflectors (ccrs). wireless sensor networks are included in today's important and evolving communication technologies. the size of sensors operating wirelessly decreases with the advent of advancement in device processing technologies like micro- and nano-electromechanical systems. this decrease in dimensions of sensors causes serious problem for battery storage capacity. we address this issue and propose a model of communication and recharging of wireless sensor network (wsn) nodes simultaneously using passive optical communication. we propose both line-of-sight and quasi-diffuse communication for this purpose. there are some situations where direct los is better option while at non-line-of-sight, the energy of a multi-spot quasi-diffuse beam can be utilized. in our model we have used modified corner cube retroreflector (ccr) and a newly proposed device thinfilm corner cube retroreflector (tccr) for passive communication and recharging sensor nodes. these devices have large angle of diversity due to which they can provide communication facility to large areas. our analysis shows that the proposed model could show better performance and significant increase in network life time.
research on load balancing mechanism based on handoff in heterogeneous network platform. modern service industry is a new kind of service industry based on information & communication technologies and modern management thinking, which is in accord with the concept "service science" by ibm. a heterogeneous network platform is founded to implement the applications of modern service industry. in this paper, an intelligent handoff algorithm is proposed to keep the service continuity in the heterogeneous network platform. and service class differentiation is considered to define the service priority according to service characters of real-time traffics and non-real-time traffics. a load balancing mechanism based handoff is proposed to balance the load of a network or cell by comparing the current load value with corresponding throughput thresholds. simulations illustrate that the load balancing algorithm can improve the blocking probability, call dropping probability and resource utilization to an extent.
a framework to support real-time features of intelligent service robots. in the ubiquitous environment, the real-time features for intelligent service robots are necessary to insure statistical and deterministic quality of service (qos) guarantees for latency. in this paper, we design and implement the real-time framework for intelligent service robots to support real-time features. the real-time framework with the priority-based real-time scheduling service will be operated on the general operating systems. it resolves a problem that the scheduler of general operating system can't support real-time features. it has been implemented on windows operating system for providing the qos guarantees for deterministic real-time robot applications. the performance measurements include both thread's response time and overhead to execute internal function of the real-time framework.
a statistical method for structure learning of bayesian networks from data. the bayesian network, a powerful tool for predicting and diagnosing uncertain phenomena, is used in various fields including artificial intelligence, business administration, and medical science. we use a statistical approach, and present a simple algorithm for learning bayesian network structure from data. first we obtain from data the original correlation graph and the correlation graphs when one or two variables are fixed. then we construct a bayesian network that would produce the most similar correlation graphs. simulation results are given to demonstrate that the algorithm determines the network structure with a high accuracy.
intelligent service reasoning model using data mining. this paper proposes an intelligent service reasoning (isr) model using data mining in smart home environments. this model creates a service tree used for service reasoning on the basis of the c4.5 algorithm, one of decision tree algorithms, and determines the services that will be provided to users through a quantitative weight estimation algorithm that uses a quantitative characteristic rule and a quantitative discrimination rule. the effectiveness in the performance of the developed model is validated through a smart home-network simulation.
a partition-based centralized leach algorithm for wireless sensor networks using solar energy. wireless sensor network (wsn) has been considered as a promising method for reliably monitoring both civil and military environments under hazardous conditions. due to such condition, the power supply for sensor in the network cannot be usually rechargeable or replaceable. thus, instead of battery replacement, we develop a solar energy recharging hardware to charge the battery of sensors to prolong the lifetime of each sensor recharging in the network. the proposed method, however, has a problem. each node cannot be charged with the same amount of power depending on its physical location. the classic leach protocol deploys the randomize rotation of cluster-heads to evenly distribute the energy load among sensors without considering the unbalanced residual energy of each node. so some enhanced solar aware leach protocols have been proposed, but it is not much efficient for prolonging the lifetime of network. this paper proposes an advanced leach algorithm which prioritizes each sensor for the cluster--head election according to its current energy and rate of energy harvesting. the simulation results and analysis show that our proposed algorithm could outperform existing methods in terms of the number of alive nodes.
analysis of rhythms of eeg signals using orthogonal polynomial approximation. we present a new method for analysis of the rhythms of the electroencephalogram (eeg) signal. the method is based on the multi-resolution analysis using the orthogonal polynomial approximation (opa). it is demonstrated that the proposed analysis technique employing the opa gives similar performance as the popular method based on the wavelet packet decomposition. however, the proposed technique is simpler in principle and can be implemented as a one-step process. some advantages of the proposed technique manifest in reduced computational complexity and feasibility of real-time implementation.
minimize the delay of parasitic capacitance and modeling in rlc circuit. this paper shows that how to minimize the delay. we changed several elements to minimize the delay in the circuit. simulation results show the best effect when the value of parasitic capacitance is changed. we found eligible point by simulating parasitic capacitance case by case based and proved it. types of case are elmore delay, interconnection delay, lowering parasitic capacitance's parameter entirely, raising parasitic capacitance's parameter in order of precedence, lowering parasitic capacitance's parameter in order of precedence, and changing inverter's w parameter. and it has been apparently proven that case of using parasitic capacitance is better than other methods.
a secure ubiquitous sensor network with dragon. the creation of wireless sensor networks provides a capable solution for a range of ubiquitous information services. its challenges like, data security and secrecy due to its hostile deployment nature of being flat to physical attacks with restricted source available. in order to competition the security pressure that sensor networks are exposed to, a cryptography algorithm is implemented at sensor nodes for node-to-node encryption, between nodes considering the data redundancy, energy constraint, and security requirement. in this paper, we analyze dragon stream cipher and propose a new d-mac secure data scheme which supports node-to-node encryption using dragon based-privacy [3] for sensor networks. our procedure regarded the entity verification and message authentication through the performance of authenticated encryption scheme in wireless sensor nodes.
optimal green time calculation using artificial intelligence. in order to reduce traffic accidents, many researchers studied a traffic accident model. the cause of traffic accidents is usually the miscalculation of traffic signals or bad traffic intersection design. therefore, it is necessary that calculating the optimal safe car speed based intersection conditions and weather. the conventional traffic light did not have the function of optimal cycle. thus, a conventional traffic cycle is not commensurate with the present traffic environment. in this paper, we proposed electro sensitive traffic light using fuzzy look up table method, which will reduce the average vehicle waiting time and improve average vehicle speed. in order to prove our propose scheme, computer simulation was used. as a result, our scheme is shown good result.
ubiquitous environmental infra systems for the green city. it is our objective to introduce a concept for the ubiquitous environmental infra system for controlling green house gas (ghg) emissions. the system suggested here was designed to collect data for ghgs generated from various point and non-point sources using various environmental, visible, and satellite sensors based upon graphic user interface and user-friendly controlling strategy for establishing an eco-friendly and low-carbon generating green city. given that major production of ghgs takes place in the cities, our system made up through technology fusion merging conventional and innovative environmental, nano, and information technologies is expected to allow the essential management of sources, generation, transport, and eventual removal of ghgs, and therefore, to contribute the mitigation of global warming problems. to this end, the new system introduced in this paper can be employed as a standardized concept for the green city in the future.
successive interference cancellation for cooperative communication systems. in this paper, we analyze and simulate a successive interference cancellation (sic) scheme for cooperative communication systems in wireless communication network. in the interference cancellation strategy, co-channel interference (cci) is mitigated by zero forcing (zf) or minimum mean square error (mmse) receivers. moreover, successive interference cancellation (sic) with optimal ordering algorithm is applied for rejecting cci efficiently. and we analyzed and simulated the proposed system performance in rayleigh fading channel. in order to justify the benefit of the proposed strategy, the overall system performance is illustrated in terms of bit error rate and compared with that of conventional interference cancellation receiver.
a 60hz interference reduction using slope trace waves. in this paper, a new method to remove 60hz power line interference from ecg (electrocardiogram) in time domain is introduced. the method uses two slope trace waves that are kind of delayed version of original signal with averaged slopes within a certain time interval. after the determination of the two slope trace waves, their arithmetic average is calculated. the result shows filtering effect removing the 60hz interference. in order to evaluate the effectiveness of the method, several ecgs from mit-bih arrhythmia database were chosen and 60hz sinusoidal waves with different amplitudes were added to them. the simulated ecg was then applied to the algorithm and the result showed its potential applicability to practical signal processing situation requiring effective 60hz interference removals with minimal waveform distortion.
an efficient design pattern algorithm for the environmental and hydrologic/hydraulic ubiquitous model developments. in this paper, we propose an efficient design pattern algorithm for the environmental and hydrologic/hydraulic ubiquitous model developments which specifies pattern names for retrieving, exploring the adapted patterns on the stage of design without pattern language that is redundant abstraction. by applying composite design pattern to the design of the recursive river and basin interface for total maximum daily load, we significantly improve the performance of polymorphism and especially of reusability than conventional basin models. thus, this study can contribute on the reducing iterations and repetitions of up-dating and committing after the spatial data changes that are frequently occurred in the process of the environmental gis model developments.
hybrid word sense disambiguation using language resources for transliteration of arabic numerals in korean. the high frequency of the use of arabic numerals in informative texts and their multiple senses and readings deteriorate the accuracy of tts systems. this paper presents a hybrid word sense disambiguation method exploiting a tagged corpus and a korean wordnet, korlex 1.0, for the correct and efficient conversion of arabic numerals into korean phonemes according to their senses. individual contextual features are extracted from the tagged corpus and are grouped in order to determine the sense of arabic numerals. least upper bound synsets among common hypernyms of contextual features were obtained from the korlex hierarchy, and they were used as semantic categories of the contextual features of arabic numerals. the semantic classes were trained to classify the meaning and the reading of arabic numerals using decision tree and to compose grapheme-to-phoneme rules for an automatic transliteration system for arabic numerals. the proposed system outperforms the customized tts systems by 3.9%--20.3%.
optimal rm scheduling for simply periodic tasks on uniform multiprocessors. the problem of scheduling simply periodic task systems upon a uniform multiprocessor is considered. each processor in a uniform multiprocessor is characterized by the speed or computing capacity, with the interpretation that a job executing on a processor with speed s for t time units completes (s x t) units of execution. in the partitioned approach to scheduling periodic tasks upon multiprocessors, each task is assigned to a specific processor and all jobs generated by a task are required to execute upon the same processor to which the task is assigned. however, the partitioning of periodic task systems requires solving the bin-packing problem, which is known to be intractable (np-hard in the strong sense). this paper presents a global scheduling algorithm which transforms a given simply periodic task system into another using a "task-splitting" technique. each transformed simply periodic task system is guaranteed to be successfully scheduled upon any uniform multiprocessor using a partitioned scheduling algorithm. the rate-monotonic (rm) algorithm is chosen for scheduling tasks on each processor. it is proven that the proposed algorithm achieves the theoretical maximum utilization bound upon any uniform multiprocessor platform. therefore, the proposed algorithm is optimal in the sense of maximizing achievable utilization for simply periodic task system on uniform multiprocessors.
session management of relay-based overlay multicast for managed group applications. in spite of the capability to provide efficient delivery of service, ip multicast has not been used widely because of technical limitations as well as management-related issues [1]. overlay multicast is introduced to overcome these problems which make it difficult to deploy various services requiring group communications. the multiple end-user hosts organize multicast delivery path forming a group. therefore, overlay multicast needs group management, a.k.a., session and membership management to provide robust and resilient group services. this paper proposes session and membership management method for overlay multicast. this paper describes the required session and membership management functions, and presents how those functions are processed. this paper will be helpful to service provider who needs to provide overlay multicast based service or for those who needs to enhance multicast-based service management.