waashk/dblp huggingface dataset:
creating an autonomous dancing robot. a robot with the ability to dance autonomously has many potential applications, such as serving as a prototype dancer for choreographers or as a participant in stage performances with human dancers. a robot that dances autonomously must be able to extract several features from audio in real time, including tempo, beat, and style. it must also be able to produce a continuous sequence of humanlike gestures. we chose the hitec robonova to use as a robot platform in our work on these problems. we have developed a beat identification algorithm that can extract the beat positions from audio in real time for multiple consecutive songs. our robonova can now produce sequences of smooth gestures that are synchronized with the predicted beats and match the tempo of the audio. our algorithm can also be easily moved to the hubo, a large humanoid robot that can move in a very humanlike manner.
a collective transaction processing scheme for mobile environment. technical advances in development of portable computers and wireless technology permit users to actively get advantage of mobile computing environment. better and faster communication mechanisms provided the needed flexibility which is demanded by variety of applications with stringent requirements. however, there are certain major issues that need to be taken seriously in this environment, such as reliability, concurrency control and data recovery, as there may exist more than one user in any one time to access or execute a transaction. a transaction is expressed in centralized or distributed environment as an atomic activity, while in a mobile environment a transaction is a long-lived process and this process may have to be split into sets of operations executed some on mobile host and others on stationary host. therefore, the task of ensuring consistency becomes more difficult in mobile environment. in this paper we study these issues and propose a reliable transaction model which combines the advantages of existing models to capture the data and mobility requirements in mobile environment.
hybrid analysis of advantage and efficiency of china agriculture. comparative advantage is the primary consideration during economy development. while to agriculture, this rule is often ignored and almost all countries or regions in one country support its development with finance, whether they have comparative advantage or not and no matter what the support efficiency is. this paper first gauges the efficiency value of agriculture fiscal support with the well-known panel-data model for the dataset of 25 provinces in china in recent 25 years. then we further analyze efficiency values combined with existed comparative advantage values by k-means clustering method, and 25 provinces are classified into 3 clusters. so according to hybrid information from the clustered results in consideration of both comparative advantage and comparative efficiency, the proposal for china agriculture development proposed by this paper will be more efficient and cost effective.
a study for semantics participation platform architecture using rdf/owl. in this paper, we describe platform to allow social participation. digital social is the technology for computer to estimate and reason the relation between human beings. with the relation being strengthened by digital social, you can encourage participation. especially emotion can change weak tie into strong tie by furthering participation. this study analyzes platform development to infer emotion and to anticipate various participation causes. therefore to express participation method and process, this paper described in rdf and owl, which are the essential languages for semantic web participation process, is realized in foal. this study can help develop participation platform architecture to be more relation-oriented.
study on service model for multimedia streaming and file hosting services using distributed overlay network. nowadays, since p2p technologies have been introduced, the amount of p2p traffic has been increased rapidly. the traffic is mainly composed of multimedia data such as video, music. as a matter of fact, much of such contents are illegal which violate copyrights. it should be also noted that legal video streaming or file distribution services are in rapid growth. such kind of services is legal but it does not use the p2p services that may contribute to the network performance. in this paper, we propose distributed services architecture for multimedia streaming and file sharing.
comparing two methods for acquiring 3d data of motion capture system by using psd camera and ccd camera. this paper presents a monocular psd-based motion capture system and ccd camera based system. the first system includes a psd (position sensitive detector) and active infrared (ir) led markers that are placed on the object to be tracked. the psd sensor is placed in the focal plane of a wide-angle lens. the microcontroller calculates the 3d position of the markers using only the measured intensity and the 2d position on the psd. the second system includes two ccd camera and led markers that are in hand and draw any motion trace. from the experimental results we see that the two kinds of methods for acquiring 3d data will be compare in accuracy, speed, process, methods, experimental circumstance.
automatic generation techniques of a resource monitor based on deployment diagram. the overall goal of this paper is to improve development environments of self-healing software to facilitate self-managing capabilities such as self-healing. this paper proposes using deployment diagram for self-healing approach to determine problems arising in external environments.
a parallel motion estimation engine for h.264 encoding using the umhexagons algorithm. we present a fast motion estimation engine for the unsymmetrical cross multi-hexagon-grid-search (umhexagons) algorithm used in h.264 video encoding. the architecture uses arrays of subtracting elements to maximize parallelism among search points on vertical or horizontal lines, and reduces sum of absolute differences (sad) calculations. performance is measured in terms of cycles required to encode common intermediate format (cif) video frames with 5 reference frames within a search range of 16. the number of cycles is reduced by around 99% compared with the jm 10.1 package running on a baseline pentium 4 processor. the architecture thus achieves real time motion estimation at a clock speed of only 200mhz.
a weighted-dissimilarity-based anomaly detection method for mobile networks. mobile wireless networks continue to be plagued by theft of identity and intrusion. both problems can be addressed in two different ways, either by misuse detection or anomaly-based detection. in this paper, we propose a weighted-dissimilarity-based anomaly detection method that can effectively identify abnormal behavior such as mobility patterns of mobile wireless networks. in the proposed algorithm, a normal profile is constructed from normal mobility patterns of mobile nodes in mobile wireless networks. from the constructed normal profile, the dissimilarity is computed by a weighted dissimilarity measure. if the computed dissimilarity value is greater than the dissimilarity threshold that is a system parameter, an alert message is occurred. the performance of the proposed method is evaluated through a simulation. from the result of the simulation, we know that the proposed method is superior to the performance of anomaly detection methods using other dissimilarity measures.
modeling rule for analysis and design of e-learning content. this paper classifies scorm model into individual modules and proposes the rule of object modeling to a uml class diagram. we verify the validity of the mapping technique proposed in this paper by analyzing and designing with reverse engineering after applying mapping technique to the contents developed with scorm-type e-learning writing tool. the proposed modeling technique can be applied to the analysis and design of standardized e-learning contents that can be developed in universities and corporations, and utilized as a communication means between developers and users.
a semantic drm contents in social-awareness using ontology. this paper proposes semantic drm (digital rights management) content to be developed by means of rdf (resource description framework) among ontology technology. the purpose of this paper is to implement drm utilizing semantic web technology for resolving the threat to copyright in ubiquitous network environment. this paper analyses research procedure and method to recognize environment and context socially through scenario. in other words, graph model and schema using rdf allows semantic features to conventional drm technology. proposed semantic drm can be applied to protect copyright of remix content with mash-up and syndication technology.
an energy-efficient skyline query processing method using priority-based bottom-up filtering. in sensor networks, many studies have been proposed to process in-network aggregation efficiently. unlike general aggregation queries, skyline query processing compares multi-dimensional data for the result. therefore, it is very difficult to process the skyline queries in sensor networks. it is important to filter unnecessary data for energy-efficient skyline query processing. existing approaches get rid of unnecessary data transmission by deploying filters to whole sensors. however, network lifetime is reduced due to energy consumption for transmitting filters. in this paper, we propose a lazy filtering-based in-network skyline query processing algorithm to reduce energy consumption by transmitting filters. our algorithm creates the skyline filter table (sft) in the data gathering process which sends data from sensor nodes to the base station and filters out unnecessary data transmissions using it. the experimental results show that our algorithm reduces false positive by 53% and improves network lifetime by 44% on average over the existing method.
hybrid file system. as density doubles with the rapidly dropping price each year for the past seven years (currently 32 gbits/chip), nand flash memory has virtually replaced hdds (hard disk drives) in battery-operated consumer devices such as cellular phones, pmps, and pdas. this trend has also enabled the introduction of so-called flash memory ssds (solid state disks) that has an interface identical to that of hdds but use nand flash memory inside as storage media. the ordinary filesystems designed for hdds are no longer suitable for ssds because ssds have many different features from hdds. we designed a hybrid filesystem, called hybridfs, that uses two kinds of storages - hdds and ssds. this is accomplished by distributing data into two partitions based on the data type. in hybridfs, data blocks of files are stored in a data partition in hdds, while metadata being stored in the metadata partition of ssds. separating data into the different storage type of disk partitions makes it possible to produce high i/o performance by taking appropriate i/o approach, according to the data characteristics.
an approach to enhancing reusabilities in service development. service-oriented computing is an emerging environment for business agility in the software industry. today, there is a focus on developing service-oriented software. in this environment, service is a key feature reflecting business concerns. however, there is still debate about how best to reflect business concerns in services and how to create more reusable services. therefore, in this paper, we propose an approach to enhancing the reusability of service development based on the concept of the product line.
development and verification of the drm standard protocol for media card. drm offers an efficient way to protect digital contents. however, existing general drm systems cannot be directly applied to low computation-power systems such as media cards. we propose an implementation of a drm system which is applicable to such limited environments by analyzing the main specifications and modifying key aspects of the cryptographic algorithms.
the study on the user authentication protocol in gsm. today's gsm platform is a successful wireless technology and an unprecedented story of global achievement. gsm platform evolved into 3rd generation mobile communication possibly not only voice call services but also the international roaming and a various kinds of the multimedia services. gsm requires an essential element techniques of a safe data transmission and a personal private protection. however, a crypto algorithm and a secure protocol for a safe data communication using gsm have various kind of problems.
on the design and implementation of a secure online password vault. many websites and web applications are secured using passwords. this requires internet users to keep track of many different strong passwords. since passwords are only used when users are online it appears that the most efficient and convenient way to store a users passwords would also be an online application. many users, however, are rightfully concerned about the security of such an approach. in particular they are worried that their online password account could be hacked or that password transmissions could be intercepted, potentially exposing all their accounts at the same time. in this paper we describe a new tool that we developed called "online safe vault" that allows users to securely store their passwords online. to secure the tool, passwords are always stored encrypted on our safe vault server and are also always transmitted over the network as encrypted passwords. en- and decryption is performed locally on the users machine. at the same time the passwords are never stored in plaintext on the users machine.
design and development of a distributed real-time tele-operation model: supporting u-gis integrated monitor system. in the real world it is very difficult to implement real-time models in uncontrolled distributed environments and to support well-defined interfaces from real-time systems to external systems. distributed real-time applications such as integrated monitor system to establish u-gis project environments require distributed real-time application integrated with tele-operation technology able to collect and process data (location information, image information and information about equipment in remote places) generated from remotely distributed construction sites in real time and operate equipment related to the sites from a long distance away. the main purpose of this paper is to study how to support real-time applications, to design tmo-based distributed real-time processing techniques for real industrial applications, to implement and develop a tmo-based drts model with less strict real-time constraints in ubiquitous environments.
terrain mapping and classification using neural networks. this paper describes a three-dimensional terrain mapping and classification technique to allow the operation of mobile robots in outdoor environments using laser range finders. we propose the use of a multi-layer perceptron neural network to classify the terrain into navigable, partially navigable, and non-navigable. the maps generated by our approach can be used for path planning, navigation, and local obstacle avoidance. experimental tests using an outdoor robot and a laser sensor demonstrate the accuracy of the presented methods.
smoke detection using boundary growing and moments. in this paper, we propose a smoke detection method using block based subtraction, boundary region growing and moments in outdoor video sequences. our proposed method is composed of three steps; the initial change area segmentation step, the boundary finding and expanding step, and the smoke classification step. in the first step, we use a background subtraction to detect changed areas in the current input frame against the background image. in the second step, we find boundaries of the changed areas using labeling algorithm and expand the boundaries to their neighbors using the boundary region growing algorithm. in the final step, ellipses of the boundaries are estimated using moments. we classify whether the boundary is smoke by using the temporal information.
inter-service revisit analysis of three user groups using intra-day behavior in the mobile clickstream. the mobile internet proliferates and penetrates all aspects of daily life. the 4 billion mobile users will increase their impacts on data services. the author came to a sense that the intra-day mobile behaviors are classified into three user groups: always-on, night, and infrequent users. the author proposes a two-phase method to identify these three user groups. the author shows the case study result from 2001 commercial service logs with two different mobile services. the derived user groups are evaluated by the revisit ratio in the following month. the results are discussed to highlight the three-segment model in intra-day mobile user behaviors. they show the clear revisit ratio difference among the three user groups in the four services in observation. the two services in the two case studies are significantly different, however, they still exhibit consistent patterns in the three group classification.
a molecular docking system using cuda. a molecular docking system enables biologists to check whether two molecular models can be combined at a specific position and remain in their stable states by simulation. it can be used in developing new materials and designing new drugs. since the docking simulation consists of several complicated computations at the level of atoms, it requires high computing capabilities such as super computers and parallel computing systems. we propose a molecular docking system using parallel gpus in this paper. in our proposed method, a gpu can process an equation as a single logical work unit. the computations can be executed through parallel gpus in real-time. the proposed system was evaluated in its performance by comparing with conventional cpu-based systems. a series of experiments for measuring performance of the system showed that our system is 33 to 287 times faster than the cpu-based systems.
context-aware robot navigation based on sensor association rules. within the mobile robotics research community, a great many approaches have been proposed for solving the navigation problem. the key difference between these various navigation architectures is the manner in which they decompose the problem into smaller subunits. in this paper, a data mining methodology developed for the retrieving significant frequent patterns is extended to allow robots to learn and navigate on unknown terrain in natural way. the method has two phases: context identification phase and validation phase. conjunction of those phases provides an easy and straightforward way for exploring new workings space for robots.
parallel implementation of mobile robotic self-localization. self-localization is a fundamental problem in mobile robotics. it consists of estimating the position of a robot given a map of the environment and information obtained by sensors. among the algorithms used to address this issue, the monte carlo technique has obtained a considerable attention by the scientific community due to its simplicity and precision. monte carlo localization is a sample-based technique that estimates robot's pose using a probability density function represented by samples (particles). the complexity of this algorithm scales proportionally to the number of particles used. the larger the environment, the more particles are required for robot localization. this fact limits the use of this algorithm to medium size environments. in order to improve the efficiency of the monte carlo technique and allow it to be used in large environments we propose a parallel implementation. our implementation is based on openmp and mpi message passing interface. experimental results are used to show the efficiency of our approach.
adaptive intra cluster routing for wireless sensor networks. scientists have listed down ten emerging technologies that will change the world's future and wireless sensor network (wsn) is one of them. a lot of work is in progress to make this technology more effective by having research in this field. this network is composed of sensing nodes which are energy limited so energy efficiency is one of the most critical design issues. to have energy efficient network, efficient routing plays very important role. in this paper, adaptive intra cluster routing (aicr) is proposed which is the best solution to the problem offered by traditional routing algorithms. comparative study of aicr is done with multihop router [1] by simulating. simulation results have revealed that aicr is 17% more energy efficient and has increased network lifetime up to 12%.
clarm routing: cross layer adhoc-routing based on reputation management in wireless multi-hop networks. this paper presents a framework of wireless multi-hop networks exploiting an ad hoc routing protocol working on the layer 2.5, called clarm (cross layer adhoc-routing based on reputation management) routing protocol. the framework of clarm routing protocol incorporates following three things: a new concept of wireless multi-hop network architecture, a new 2.5-layer routing technique with a reputation management scheme, high throughput network performance based on cross-layer approache between mac (medium access control) and clarm layers. we compare the performance of the clarm routing protocol with previous routing algorithms, dsr (dynamic source routing) and aodv (ad hoc on demand distance vector), previous reputation management scheme core (collaborative reputation) and confidant (cooperation of nodes fairness in dynamic ad hoc networks). a case study on practical experiments and simulations shows that the clarm routing protocol yields better performance in terms of low rate of packet loss and high throughput network performance.
mining quantitative association rule of earthquake data. earthquake is a natural disaster which causes extensive poverty damage as well as the death of thousands and thousands of people. in this study, we tried to find the unknown characteristics of earthquakes using association rule mining methods global earthquake data occurred since 1973. as a way for mining of quantitative association rule on the earthquake data which includes date, location, magnitude and depth of earthquake. we divided it into small sections and applied a method to find out association rule by repeating the process to merge nearby sections. as the result from study, we could derive associate relationship between time and magnitude, depth and magnitude, as well as location and frequency. this result could prove the relationship more efficiently when data mining technique was applied to earthquake data. it would serve as a reference for further study of relationship with other attributes such as geology, tectonic and so on.
distributed cluster head election algorithm using local energy estimation. in the wireless sensor network (wsn), selecting cluster head (ch) is important issue to increase the network lifetime and selection time of ch is critical. we propose improved ch selection method that the election time of ch does not be increased as the local energy level is decreased. the proposed method, distributed cluster head election algorithm using local energy estimation (dchea), uses energy levels of neighboring sensor nodes as well as local energy level to prevent the decrease of the ch probability of the sensor node. the simulation result shows that the life time of the wsn using the proposed scheme is extended.