waashk/dblp huggingface dataset:
an introduction of indicator variables and their application to the characteristics of congested traffic flow at the merge area. research on the merge area has mainly dealt with free flow traffic and research on the congested traffic at the merge area is rare. this study investigates the relationship between mainline traffic and on-ramp traffic at three different segments of the merge area. for this purpose, new indicators based on traffic variables such as flow, speed, and density are used. the results show that a negative relationship exists between mainline and on-ramp flow. it is also found that the speed and the density of the right two lanes in the mainline traffic are significantly affected by the on-ramp flow. based on the correlation analysis of the indicators, it is confirmed that the right two lanes of the freeway mainline are influenced by the ramp flow. the revealed relationships between mainline and on-ramp traffic may help to analyze the capacity of the downstream freeway segment of the merge area in congested traffic.
header compression of rtp/udp/ip packets for real time high-speed ip networks. in this paper, a new header compression scheme considering bcb (basic compression bits) or ncb (negotiation compression bits). the header compression scheme can be used for reducing the header size by eliminated repeated fields in the packet header. here, the efficiency of the compression of the dynamic field in rtp/udp/ip packets is very important in real-time high-speed ip networks. our new compression method with sn and ts fields can be applicable to iphc (internet protocol header compression), rohc (robust header compression protocol), and other header compression schemes. the performance of the proposed scheme is discussed via simulation results.
an error sharing agent for multimedia collaboration environment running on pervasive networks. this paper presents the design of an error sharing agent for multimedia collaboration environment which is running on rcsm. rcsm means reconfigurable context-sensitive middleware. rcsm provides an object-based framework for supporting context-sensitive applications. it has other services in optional components. a good example of other services in rcsm is a distance education system for multimedia collaboration environment. we propose an adaptive error hooking agent based on a hybrid software architecture carv(centralized abstraction and replicated view). this system can be automatically enforced according to different situations such as wired or wireless network environment.
a context-aware elevator scheduling system for smart apartment buildings. ubiquitous computing technologies are becoming increasingly a part of our daily lives. for example, in the ubiquitous home environments, plenty of context information can be obtained from various home sensors, and this information can be exploited for smart home activities. this paper presents a new elevator scheduling system for smart apartment buildings that exploits the ubiquitous sensor technologies. in the proposed elevator scheduling system, floor sensors are located at each floor of the apartment building and detect the candidate elevator passengers' behavior before they come to the elevator door and push the elevator call button. the detected information is then delivered to the elevator scheduling system through the building network and the elevator scheduling system utilizes this information in the efficient control of the elevator. through extensive simulations with various passengers' traffic conditions, we show that the proposed system performs better than the conventional elevator scheduling system in terms of the passengers' average waiting time, the maximum waiting time, and the energy consumption of the elevator significantly.
how to overcome main obstacles to building a virtual telematics center. this paper describes the limiting factors for building a virtual telematics center which integrates its (intelligent transportation systems) information collected by the system of each of the three government agencies. it also provides some details into how some of the obstacles and barriers can be solved such as data standardization, system mechanisms and regulations. there are very few papers and case studies regarding real problems and solutions for integrating systems of different organizations in general, and telematics, in particular. the processes and outcomes of implementing systems in this study can be useful to develop other its and telematics systems.
efficient fixed codebook search method for acelp speech codecs. there are several sub-optimal search techniques for fast algebraic codebook search of acelp speech codecs. focused search method, depth-first tree search method and pulse replacement methods are used to reduce computational complexity of algebraic codebook search. in previous pulse replacement methods, the computational load is increased as the pulse replacement procedure is repeated. in this paper, we propose a fast algebraic codebook search method based on iteration-free pulse replacement. the proposed method is composed of two stages. at the first stage, an initial codevector is determined by the backward filtered target vector or the pulse-position likelihood-estimate vector. at the second stage, after computing pulse contributions for every track the pulse replacement is performed to maximize the search criterion qk over all combination replacing the pulses of the initial codevector with the most important pulses for every track. the performance of the proposed algebraic codebook search method is measured in terms of the segmental signal to noise ratio (snrseg) and pesq (perceptual evaluation of speech quality) using various speech data. experimental results show that the proposed method is very efficient in computational complexity and speech quality comparing to previous pulse replacement methods.
conventional beamformer using post-filter for speech enhancement. this paper presents a combined handsfree speech enhancement method based on a spatialpost-filter. the scheme uses a linear microphone array to capture a speech signal that has been corrupted by babble noise, car noise, and interference signals. simulation results for real environment show that the proposed structure achieves a maximum interference suppression of 12 db, an improvement of 6 db over the delay and sum beamformer. furthermore, the system is robust in the presence of distortion as opposed to the generalized sidelobe canceller. the subjective evaluation has shown that the combined system of delay and sum with the minimum mean square error estimator using a noncausal signal to noise ratio (snr) estimator obtained 3.8 points on a fivepoint.
improvement of adaptive modulation system with optimal turbo coded v-blast technique. in this paper, we propose and analyze the adaptive modulation system with optimal turbo coded v-blast (vertical-bell-lab layered space-time) technique that adopts the extrinsic information from map (maximum a posteriori) decoder with iterative decoding as a priori probability in two decoding procedures of a v-blast scheme; the ordering and the slicing. also, comparing with the adaptive modulation system using conventional turbo coded v-blast technique that is simply combined a v-blast scheme with a turbo coding scheme, we observe how much throughput performance can be improved. as a result of a simulation, it has been proved that the proposed system achieves a higher throughput performance than the conventional system in the whole snr (signal to noise ratio) range. specifically, the result shows that the maximum throughput improvement is about 350 kbps.
automatic face analysis system based on face recognition and facial physiognomy. an automatic face analysis system is proposed which uses face recognition and facial physiognomy. it first detects human's face, extracts its features, and classifies the shape of facial features. it will analyze the person's facial physiognomy and then automatically make an avatar drawing using the facial features. the face analysis method of the proposed algorithm can recognize face at real-time and analyze facial physiognomy which is composed of inherent physiological characteristics of humans, orientalism, and fortunes with regard to human's life. the proposed algorithm can draw the person's avatar automatically based on face recognition. we conform that the proposed algorithm could contribute to the scientific and quantitative on-line face analysis fields as well as the biometrics.
a study on the medical image transmission service based on ieee 802.15.4a. in this paper, the transmission service for medical image is proposed via ieee 802.15.4a on wpan environment. also, transmission and receiving performance of medical image using th uwb-ir system is evaluated on indoor multi-path fading environment. on the results, the proposed scheme can solve the problem of interference from the medical equipment in same frequency band, and minimize the loss due to the indoor multi-path fading environment. therefore, the transmission with low power usage is possible.
design and implementation of the decompiler for virtual machine code of the c++ compiler in the ubiquitous game platform. the ubiquitous game platform implemented by our team is composed of a c++ compiler, a java translator, and a virtual machine. the evm (embedded virtual machine) is a stack-based solution that supports object-oriented languages such as c++ and java. it uses the sil (standard intermediate language) as an intermediate language, which consists of an operation code set for procedural and object-oriented languages. the existing c++ compilers are used to execute programs after translating them into a target machine code. the downside of this method is its low practicality, along with its platform-dependency. to resolve this matter, we developed a c++ compiler that generates virtual machine codes based on platform-independent stacks that are not target machine codes. this paper presents a decompiler system that converts a c++ compiler generated intermediate language, namely sil, to a representation of a c++ program. this method optimizes the simulation needed for the generation of exacted sil code, and a solution that can verify the sil code generation through a c++ program represented in the decompiler. furthermore, the ease of extracting the meaning of a program, as opposed to assembly-structured sil codes, allows much more convenience in changing the software structure and correcting it to improve performance.
bandwidth extension of a narrowband speech coder for music delivery over ip. in this paper, we propose a bandwidth extension (bwe) algorithm of a narrowband speech coder for music delivery services over ip networks. the proposed bwe algorithm is based on an embedded structure of using a baseline coder followed by an enhancement layer. to minimize the bit-rate increase by the enhancement layer, the proposed algorithm shares spectral envelope and excitation parameters between the baseline coder and the enhancement layer. in this paper, we choose the ilbc as the baseline coder and mel-frequency cepstral coefficients (mfccs) are used to reconstruct higher frequency components at the enhancement layer. by doing this, the bit-rate of the proposed bwe coder is 15.45 kbit/s which is just 0.25 kbit/s higher than the ilbc. we compare the quality of the proposed bwe coder with that of the ilbc, and it is shown from an informal listening test that the proposed bwe coder provides significantly better quality than the ilbc for all four different kinds of music genres such as pop, classical, jazz and rock.
a sophisticated base station centralized simple clustering protocol for sensor networks. in wireless sensor networks, energy efficiency has been a key factor. so far, many energy-efficient routing protocols have been proposed and much attention has been paid to cluster-based routing protocols due to their advantages. however, some cluster-based sensor network routing protocols need location information of the sensor nodes in the network to construct clusters efficiently. owing to the cost, it is not feasible to know the locations of all sensor nodes in the sensor network. in this paper, we propose a sophisticated base station centralized simple clustering protocol (sbcsp). the proposed protocol utilizes the remaining energy of each sensor node, standard deviation of their energy consumed and the number of cluster heads changed depending on the number of sensor nodes alive in the sensor network. throughout the performance experiments, we show that sbcsp has better performance than low-energy adaptive clustering hierarchy (leach).
enterprise application framework for constructing secure rfid application. in the ubiquitous environment, anyone could easilyaccess all shared informations which means it also has many serious drawbacks, such as security problems. therefore the ubiquitous environment should provide a security service. this paper suggests an enterprise application framework(eaf) which includes a security module as well as a business process module for constructing secure rfid application. the security module includes user authentication mechanism, key sharing mechanism, and authorization mechanism. thus, this framework is expected to provide more secure management in the ubiquitous environments such as rfid applications.
reduced rbf centers based multi-user detection in ds-cdma systems. the major goal of this paper is to develop a practically implemental radial basis function neural network based multi-user detector for direct sequence code division in multiple access systems. this work is expected to provide an efficient solution by quickly setting up the proper number of radial basis function centers and their locations required in training. the basic idea in this research is to select all the possible radial basis function centers by using supervised k-means clustering technique, select the only centers which locate near seemingly decision boundary, and reduce them further by grouping some of the centers adjacent to each other. therefore, it reduces the computational burden for finding the proper number of radial basis function centers and their locations in the existing radial basis function based multi-user detector, and ultimately, make its implementation practical.
detecting image based spam email. image based spam email can easily circumvent widely used text based spam email filters. more and more spammers are adapting the technology. being able to detect the nature of email from its image content is urgently needed. we propose to use ocr (optical character recognition) technology to extract the embedded text from the images and then assess the nature of the email by the extracted text using the same text based engine. this approach avoids maintaining an extra image based detection engine and also takes the benefit of the strong and reasonably mature text based engine. the success of this approach relies on the accuracy of the ocr. however, regardless of how good an ocr is, misrecognition is unavoidable. therefore, a markov model which has the ability to tolerate misspells is also proposed. the solution proposed in this paper can be integrated smoothly into existing spam email filters.
reduction based symbolic value partition. theory of rough sets provides good foundations for the attribute reduction processes in data mining. for numeric attributes, it is enriched with appropriately designed discretization methods. however, not much has been done for symbolic attributes with large numbers of values. the paper presents a framework for the symbolic value partition problem, which is more general than the attribute reduction, and more complicated than the discretization problems.we demonstrate that such problem can be converted into a series of the attribute reduction phases. we propose an algorithm searching for a (sub)optimal attribute reduct coupled with attribute value domains partitions. experimental results show that the algorithm can help in computing smaller rule sets with better coverage, comparing to the standard attribute reduction approaches.
the accurate performance evaluation of time hopping uwb systems with pulse based polarity. the bit rate performance of the time hopping impulse radio uwb system with the pulse based polarity is analyzed. it is well known that the pulse polarity helps reduce the spectral spike appearing in the conventional impulse radio system. this paper provides the method for accurately modeling the multiple access interference(mai) in the system with the pulse polarity. the characteristic function is used to consider the mai. we also show the mai can be simplified as gaussian random variable when the number of pulses representing an information symbol or the pulse rate becomes large. it is obtained directly from approximating the characteristic function of the mai in case of the large number of pulses. some results have been shown to prove validity for our method. the results also show with the total processing gain fixed, increasing the pulse rates proves the system performance. but the system without the pulse polarity does not.
plus-tree: a routing protocol for wireless sensor networks. we study tree-based routing protocols for wireless sensor networks. the existing tree-based algorithm has a few shortcomings; (1) it may take a long path since sensor node must transmit packets via either its parent or its children nodes and (2) it is vulnerable to a link failure since the tree has to be reconstructed in case of a single link failure. we propose plus-tree, a routing protocol, which overcomes the shortcomings and improves the performance of the existing protocol. a node in plus-tree may have neighbor links other than tree links that can be used for alternative path. simulation results show that plus-tree performs better than the existing tree-based protocol with respect to hop counts.
a gdb-based real-time tracing tool for remote debugging of soc programs. since embedded systems based on system-on-a-chip(soc) have limited resources, debugging programs in such systems requires a remote debugging system that has enough resources. however, existing jtag based remote debugging system that uses gdb in linux environment does not provide tracing function, so it is hard to monitor the executions of soc program in real time. this paper adds a tracing facility to existing gdb remote debugging system to provide a real time monitoring tool. to demonstrate a real time tracing of synthetic program, intel a xscale pxa series processor based target system is used.
a hybrid intelligent multimedia service framework in next generation home network environment. in next generation home network environment (nghe), multimedia service will be a key concept of advanced intelligent and secure services which are different from the existing ones. in this paper, we propose a hybrid intelligent multimedia service framework (himsf) which is mixed with application technologies like intelligent home infrastructure or multimedia protection management through the ubiquitous sensor network based technology to provide a proper multimedia service suitable for nghe. the proposed framework provides an interoperability among heterogeneous equipments regarding home network appliances like wireless devices, electronic appliances, pc. in addition, it provides adaptive application services.
an analysis of a lymphoma/leukaemia dataset using rough sets and neural networks. in this paper, we describe a rough sets approach to classification and attribute extraction of a lymphoma cancer dataset. we verify the classification accuracy of the results obtained from rough sets with a two artificial neural network based classifiers (anns). our primary goal was to produce a classifier and a set of rules that could be used in a predictive manner. the dataset consisted of a number of relevant clinical variables obtained from patients that were suspected of having some form of blood based cancer (lymphoma or leukaemia). of the 18 attributes that were collected for this patient cohort, seven were useful with respect to outcome prediction. in addition, this study was able to predict with a high degree of accuracy whether or not the disease would undergo metastases.
the analysis of game playing experiences: focusing on massively multiplayer online role-playing game. the purpose of this study is to (1) develop an analytic framework to systematically code the players' cognitive process during massively multiplayer online role-playing game (mmorpg) gameplay, and (2) to empirically explore the players' cognitive process. to construct the analytical framework of mmorpg gameplay, previous studies regarding gameplay and problem solving theory are reviewed. the specific gameplay actions and contents are derived by using a concurrent protocol analysis method. consequently, gameplay actions are categorized into kinematics, perception, function, representation, methodology, and simulation. a new framework suitable for mmorpg gameplay is built. in order to study the players' cognitive process, the empirical experiment is executed during mmorpg gameplay. as a result of this study, we find a new problem space in the methodological scheme of gameplay. this study concludes with a number of key implications for game design in order to improve the quality of future gaming products.
information retrieval oriented word segmentation based on character association strength ranking. this paper presents a novel, ranking-style word segmentation approach, called rsvm-seg, which is well tailored to chinese information retrieval(cir). this strategy makes segmentation decision based on the ranking of the internal associative strength between each pair of adjacent characters of the sentence. on the training corpus composed of query items, a ranking model is learned by a widely-used tool ranking svm, with some useful statistical features, such as mutual information, difference of t-test, frequency and dictionary information. experimental results show that, this method is able to eliminate overlapping ambiguity much more effectively, compared to the current word segmentation methods. furthermore, as this strategy naturally generates segmentation results with different granularity, the performance of cir systems is improved and achieves the state of the art.
a casual conversation system using modality and word associations retrieved from the web. in this paper we present a textual dialogue system that uses word associations retrieved from the web to create propositions. we also show experiment results for the role of modality generation. the proposed system automatically extracts sets of words related to a conversation topic set freely by a user. after the extraction process, it generates an utterance, adds a modality and verifies the semantic reliability of the proposed sentence. we evaluate word associations extracted form the web, and the results of adding modality. over 80% of the extracted word associations were evaluated as correct. adding modality improved the system significantly for all evaluation criteria. we also show how our system can be used as a simple and expandable platform for almost any kind of experiment with human-computer textual conversation in japanese. two examples with affect analysis and humor generation are given.
automatic prediction of parser accuracy. statistical parsers have become increasingly accurate, to the point where they are useful in many natural language applications. however, estimating parsing accuracy on a wide variety of domains and genres is still a challenge in the absence of gold-standard parse trees. in this paper, we propose a technique that automatically takes into account certain characteristics of the domains of interest, and accurately predicts parser performance on data from these new domains. as a result, we have a cheap (no annotation involved) and effective recipe for measuring the performance of a statistical parser on any given domain.