waashk/dblp huggingface dataset:
fmm: fusion media middleware for actual feeling service. recently for media content from internet users, the increased interest in the web is huge and rich. between media content, especially in the eyes and ears of internet users attracted to the limelight of the media content is video content. additionally, in conjunction with web 2.0 internet users by their openness to each other and share content to create new forms of distribution of the flow. video media content for distribution on the web was created by a professional content to experts, but web 2.0 era, the ugc (user generated content) in the form of self-produced content is the most. made by the general internet users, but self-produced content to provide video information only and has limitations. to satisfy internet users as consumers, not just the images you add various effects are realized the need to provide the video. therefore, this paper used ontology concept for providing media that has actual feeling instead of simple information media. obtained knowledge of input media by using ontology concept stand in the basis of extracting actual feeling effects. on the basis of this methodology, this paper proposes fusion media middleware (fmm) that has function of offering fused media (music, sounds, images etc.). we describe the formatting guidelines for acm sig proceedings.
architecture of electronic surveillance of p2p based voip service. architectures of electronic surveillance of various types of p2p-based voip services are described in this paper. there are kinds of architectures of p2p based voip service according to the telecommunication networks used including pstn, mobile network, and voip network. in other words, appropriate architecture and points of electronic surveillance of p2p based voip services depend on the voip service architecture. hereupon, electronic surveillance architectures of p2p based voip service users whose counterpart uses pstn or voip service, and characteristics of each are described.
an application of host identity tags to dkim for identifying signers. the domainkeys identified mail (dkim) protocol gives a solution to guarantee the authentication and the integrity of e-mail messages. and in practice, to make dkim come from theory to engineering, a concept of adsp (author domain signing practice) has been put forth in an ietf draft. however, on the aspects of identifying a signer and delegating the signing ability, adsp fails to give a specification. yet the hits (host identity tags), put forth in rfc 5201, are born to identify signers featuring asymmetric key pairs and hits will offer extra functions for security of the keys involved and management of the identifiers. this paper proposes to apply hits to dkim for identifying signers.
design for supporting the multimedia emergency voip using pstn and ip network. internet is rapidly increased, and various services are deployed over internet. it is an important issue to support emergency service in voip, because many users want to use the emergency service similar to the service in pstn network. voip terminals which can create audio, video, and image data are able to send multimedia data to emergency agent. but the current voip service cannot provide multimedia data to emergency agent, because emergency calls have to flow through pstn network. if emergency agent has got some video as well as audio data for emergency call, it will be very helpful to rescue somebody in danger. in this paper, we will consider new network model to provide multimedia data to psap in emergency call.
huffman coding algorithm for compression of sensor data in wireless sensor networks. sensor data exhibit strong correlation in both space and time. many algorithms have been proposed to utilize these characteristics. however, each sensor just utilizes neighboring information, because its communication range is restrained. information that includes the distribution and characteristics of whole sensor data provides other opportunities to enhance the compression technique. in this paper, we propose an orthogonal approach for compressing sensor readings based on a novel feedback technique. that is, the base station or a super node generates huffman code for the compression of sensor data and broadcasts it into sensor networks as feedback information. all sensor nodes that have received the information compress their sensor data and transmit them to the base station. we call this approach as feedback-diffusion and this modified huffman coding as shuffman coding. in order to show the superiority of our approach, we compare it with the existing data compression algorithms in terms of the lifetime of the sensor network. as a result, our experimental results show that the whole network lifetime was prolonged by about 30%.
a novel genetic variable representation for dynamic optimization problems in evolutionary computation. this paper introduces a novel genetic variable representation for dynamic optimization problems in evolutionary computation. this variable representation allows static evolutionary optimization approaches to be extended to efficiently explore global and better local optimal areas in dynamic fitness landscapes. it represents a single individual as a pair of real-valued vector (x, r) &isin; rn x r2 in the evolutionary search population. the first vector x corresponds to a point in the n-dimensional search space (an object variable vector), while the second vector r represents the dynamic fitness value and the dynamic tendency of the individual x in the dynamic environment. r is the control variable (also called strategy variable), which allow self-adaptation. the object variable vector x is operated by different genetic strategies according to its corresponding r. as a case study, we have integrated the new variable representation into genetic algorithms (gas), yielding an dynamic optimization genetic algorithm (doga). doga is experimentally tested with 5 benchmark dynamic problems. the results all demonstrate that doga consistently outperforms other gas on dynamic optimization problems.
an efficient algorithm for as path inferring. discovering the as paths between two ases is invaluable for a wide area of network research and application activities. the traditional techniques for path discovery require direct access to the source node. recently, with more accurate as relationship inferring algorithm and publicly available as topology data, it is possible to infer as paths without accessing the source. this paper proposes an efficient algorithm for inferring all pair shortest as paths in a relationship annotated as graph. the running time of the algorithm is o(nm), where n is the number of nodes and m is the number of edges in as graph. the algorithm bases on the bread-first-search (bfs) algorithm, and experimental results show that it reduces running time dramatically compared with the existing algorithm whose running time is o(n3).
service discovery mechanism based on trustable dht in manet. service discovery mechanism is a core technique for getting a desired service in manet (mobile ad-hoc network) environment. however, as feature of manet, existing mechanisms have some problem that service requester search for trustable service. also it can not support scalability, in this paper, how to reliably support applications such as service discovery on top of manet. we are firstly finding a trustable service provider and configure dht (distributed hash table). p2p (peer-to-peer)'s dht can be adopted to service discovery mechanism because p2p and manet share certain similarities, primarily the fact that both are instances of self-organizing decentralized systems. especially, proposed dht systems used for p2p overlay network can be effective in reducing the communication overhead in service discovery. so proposed mechanism can support for reliably searching required service and scalability. simulation results show that our mechanism is scalable and outperforms existing service discovery mechanism.
efficient execution of application applets based on persistent object caching in java card system. atomic transactions involving persistent objects in java card system environment often creates performance bottleneck due to access speed gap between ram and flash memory. this paper proposes simple yet efficient way of handling persistent objects for atomic transactions by utilizing object caching and buffering. the proposed scheme significantly improves application execution performance.
middleware-based distributed systems software process. middleware facilitates the development of distributed systems by accommodating heterogeneity, hiding distribution details and providing a set of common and domain specific services. it plays a central and essential role for developing distributed systems. however, middleware is considered a mean rather than core elements of development process in the existing distributed systems software process. this paper explains the concept of middleware by categorizes middleware and analysis the problems of current middleware architectures. it also extracts three essential non-functional requirements of middleware and proposes a middleware-based distributed systems software process. the proposed software process consists in five phases: requirements analysis, design, validation, development and testing. the characteristics of middleware are considered in the entire software process.
application services based on location information in the sip phone. application service based on location information, 1588 representative number service such as flower delivery service, pizza delivery service and emergency call service such as 112, 113, 119, is a nationwide one. if internet phone subscriber calls to representative number, that call is transferred to the shortest service center based on the present location information of subscriber and service is supported to the caller. we describe the mechanism that sip phone, mounted basic sip protocol and presence protocol, can provide various application services based on location information. in order to support application service based on location information, we describe the system components of voip service provider and message flows among system components.
bridge transmission method of medical sensor node in u-healthcare services. when monitoring vital sign, cables between medical sensors and monitoring system make a patient uncomfortable. furthermore, it gets worse in case of a steady monitoring is needed. recently researches, therefore, are actively underway to integrate a wireless sensor network into vital sign monitoring devices. however, the measured data from the sensor can't be transmitted if a patient moves out of the transmission range since the receiving and transmitting range of the measured date is limited within a specific range. in order to clear out this sort of problem, this research suggests the bridge transmission method that can deliver data between nodes via other devices even if the medical sensor device went out of transmission range for a gateway. experiments have been carried out by materializing a bridge transmission module on sensor nodes to verify effectiveness of our suggesting transmission method, and ten experiments having transmitted 1,000 packets by case showed 98.4% of success in receiving
sampling scheme for better rbf network. neural networks have been developed for machine learning and data mining tasks, and because data mining problems contain a large amount of data, sampling is a necessity for the success of the task. for this reason, this paper suggests an effective sampling technique that is based on a generated decision tree, where the trees are generated based on a fast and dirty tree generation algorithm. experiments with several sample sizes and rbf network showed that the method is more effective with respect to accuracy than conventional random sampling method.
a detection model based on statistical against ddos attack. a development and research for distributed denial of service attack detection is underway. a statistical technique identified efficiently the normal packets and abnormal packets. in this paper several statistical techniques, using a mix of various offers a way to detect the attack. to verify the effectiveness of the proposed technique, it set packet filtering on router and the proposed ddos attacks detection method on a linux router. in result, the proposed technique detected various attacks, provided normal service mostly.
ecu configuration framework based on autosar ecu configuration metamodel. autosar (automotive open system architecture) is a partnership of automotive manufacturers and suppliers working together to develop and establish a de-facto open industry standard for automotive e/e architectures. autosar defines architecture, methodology, and application interfaces. the methodology describes ways to exchange formats or description templates to enable a seamless configuration process of the basic software stack and the integration of application software in ecus and it includes even the methodology how to use this framework. the configuration process is comprised of several steps such as system configurations and ecu configuration. in ecu configuration step, many ecu configuration parameters based on system configuration results are organized into xml files. this paper describes methodology how these ecu configuration parameters are described, classified, and stored in xml files.
vehicular client roaming and location-based handoff through multiple wlan aps in a container terminal. this paper reports on measurement results for the simultaneous use of multiple wlan aps in a large area. we describe some problems of applying legacy ieee 802.11 wlan technologies to a freight container terminal as a special application example. we begin by describing the characteristics of it infrastructures in a container terminal environment, and examine s/w application requirements and work processes in a container terminal. one of the key problems based on clients' complaints is frequent network disconnections. to find the cause of this problem, we observe the characteristics of service clients and collect the raw network data from actual measurements in a container terminal. we transform the collected raw data into meaningful secondary data and analyze the results. based on our analyses, we suggest several candidate solutions to mitigate the frequent network disconnections and enhance the network performance. we perform one of the suggestions location-based handoff, for evaluation.
apjava: an aspect-oriented parallel programming model in java. the paper introduces the apjava programming environment, called apjava. apjava is an aspect-oriented parallel dialect of java that imports hpjava-like arrays -- in particular the distributed arrays -- as new data structures. the main purpose of apjava is to provide an easy-to-use aspect-oriented parallel programming environment to engineers and scientists unfamiliar with parallel programming. the paper discusses an overview of apjava and pre-translation scheme and basic translation scheme adopted in a translator for the apjava language.
an improved camera identification method based on the texture complexity and the image restoration. the identification of source camera is useful to improve the capability of evidence in the digital image such as distinguish the photographer taking illegal images and adopting digital images as evidence of crime. luk&aacute;&scaron;, et al. showed the method for source camera identification based on the correlation of pnu (pixel nonuniformity) noise. however, the wavelet-based denoising filter for suppressing the random noise reduces the accuracy of camera identification. it is caused by the fact that the denoising filter diffuses the edge and makes the pnu noise less pronounced. moreover, it is difficult to extract pnu noise from the images taken by cameras which are equipped with the image improvement functions such as motion blur correction, contrast enhancement, and noise reduction. in this paper, we propose a method for improving the camera identification accuracy by selecting pixels based on the texture complexity. we also propose a-method for improving the identification accuracy by applying the image restoration method.
a study on intrusion protection techniques against linux kernel backdoor. as the existing backdoor worked at user mode, which is application mode, it was possible to check the existence of backdoor by the integrity check of system file. however, for the backdoor using kernel module, it is impossible to check its existence by the integrity check of system file. even various programs were presented to protect this lkm kernel backdoor, there is limitation in protection as they examine the changes on the system call table. this study, recognizing the danger of invasion through such lkm kernel backdoor, will provide alternative for the limitation which the existing integrity check couldn't prevent intrusion through kernel backdoor.
bio-inspired simulation tool for pert. this genetic programming based tool simulates activities and resource allocations in the program (project) evaluation and review technique method of project control. users constrain the optimization problem by means of a visual interface and genetic programming discovers a umber of acceptable solutions that satisfy the user constraints. it evolves computer programs that, when executed, produce a variable length vector of real numbers. this vector is then interpreted according to the grammar that abides by the user constraints. the tool has a wide application in the management of large and complex projects as it handles the a priori simulation of events that may delay or compromise the project, and enables the project owners and project managers to come up with robust and innovative contingency measures to decrease the likelihood of project failure before project start-up.
novel ofdm frame synchronization in multi-user environments. in this paper, we propose a novel frame synchronization algorithm for an orthogonal frequency division multiplexing (ofdm) system in multi-user environments. in order to enhance the synchronization performance, we add a repeated orthgonal gold sequence (rogs) directly to ofdm signals in the time domain. the power level of a rogs needs to be low engough in order not to affect a normal operation of the ofdm systems. frame synchronization can be achieved successfully over rayleigh fading channel interfereed by impulsive noise owing to good auto and cross-correlation properties of the rogs.
a study on the ber performance of turbo coded t-dmb system. the t-dmb system being able to transmit video service needs additional fec blocks which consist of rs code and convolutional interleaver along with the existing rcpc code. in this paper we propose a new turbo coded t-dmb system that replaces the existing rs code, convolutional interleaver and rcpc code by a turbo code without altering the puncturing procedure and puncturing vectors defined in the standard t-dmb system for compatibility. simulation results show that the new turbo coded system yields considerable performance gain after just 2 iterations.
a study of intelligent earth work using the process simulation. because it is a very repetitive and monotonous work and needs lots of construction equipment, the earth work operation for site development is a good field to apply automation technology. this study has analyzed input condition which has carried out in actual earth work. it has deduced simulation which would help to decide ideal combination of earthwork equipment through reflecting capacity of equipment and processing simulation according to input. in kind of construction which characterized specific process has repeated, simulation will have used to effectively as a reasonable decision to plan process of site planning process of u-construction.
design and implementation of a live-analysis digital forensic system. as the popularity of the internet continues growing, not only change our life, but also change the way of crime. number of crime by computer as tools, place or target, cases of such offenders increases these days, fact to the crime of computer case traditional investigators have been unable to complete the admissibility of evidence. to solve this problem, we must collect the evidence by digital forensics tools and analysis the digital data, or recover the damaged data. in this research, we use the open source digital forensics tools base on linux and want to make sure the stability of software then prove the evidence what we have. to avoid the data loss due to the shutdown of machines, we use the live-analysis to collect data and design the live dvd/usb to make image file and analysis the image. we use the md5 and sha-1 code to identity the file before the final report and ensure the reliability of forensic evidence on court.
a new stereo matching algorithm for binocular vision. the stereo matching algorithms for binocular vision are very popular and widely applied. however, the algorithms may have lower matching quality or higher time complexity. to improve that, a new stereo matching algorithm based on square and gradient for binocular vision is proposed in the paper. it divides an image line into a serious of ranges with comparing the gradients of the points in left and right image lines. the best matching in each range is found based on the summery of squared differences. the algorithm inherits the high quality of gradient algorithm and high performance of ssd algorithm and meanwhile avoids the additive noise.
combined ranking for multi-media web search engine. in this paper and we propose a new system structure for multi-media data search engine where the ranking for non-text data can be vastly improved. we first discuss why current search engines are not enough to search for multi-media data, and then introduce the new form of a database, called mixed database. then we explain how our ranking system will work and how it works on our search engine.
biomedical signal compression based on basis pursuit. this paper presents a discussion concerning eeg signals compression using the basis pursuit (bp) approach applied for several overcomplete wavelet dictionaries. the compression is based on an "optimal" superposition of dictionary elements, by minimizing the 11 norm of the error. the best results have been obtained with the daubechies10 dictionary.
a context-aware service model using a multi-level prediction algorithm in smart home environments. smart home is emerging as the future digital home environments that provide various ubiquitous home services like u-life, u-health, etc. it is composed of some home appliances and sensors which are connected through wired/wireless network. ubiquitous home services become aware of user's context with the information gathered from sensors and make home appliances adapt to the current home situation for maximizing user convenience. in these context-aware home environments, it is the one of significant research topics to predict user behaviors in order to proactively control the home environment. in this paper, we propose multi-level prediction algorithm for context-aware services in ubiquitous home environment. the algorithm has two phases, prediction and execution. in the first prediction phase, the next location of user is predicted using tree algorithm with information on users, time, location, devices. in the second execution phase, our table matching method decides home appliances to run according to the prediction, device's location, and user requirement. since usually home appliances operate together rather than separately, our approach introduces the concept of mode service, so that it is possible to control multiple devices as well as a single one. we also devised some scenarios for the conceptual verification and validated our algorithm through simulations.