• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.4A
• /
• pp.350-359
• /
• 2010

In this paper, we provide a subchannel allocation algorithm for a femtocell system with OFDMA. This algorithm aims to maximize the minimum number of allocated subchannels among all femtocells and in addition, to maximize the total usage of subchannels in all femtocells. The subchannel allocation algorithm consists of three steps: constructing an interference graph, coloring algorithm, and mapping subchannels to colors. In the first step, the femtocell system is modelled by an interference graph, in which each femtocell is modeled as a node and two nodes that interfere with each other are connected by an edge. Based on this interference graph, by using a coloring scheme and mapping subchannels to each color, we can allocate subchannels to each femtocell. Finally, the performance of this algorithm is provided by simulation.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.8 no.6
• /
• pp.36-45
• /
• 2009

Recently, there are interested in the automatic traffic flowing and accident detection using various low level information from video in the road. In this paper, the automatic traffic flowing and algorithm, and application of traffic accident detection using traffic management systems are studied. To achieve these purposes, the spatio-temporal relation models using topological and directional relations have been made, then a matching of the proposed models with the directional motion verbs proposed by Levin's verbs of inherently directed motion is applied. Finally, the synonym and antonym are inserted by using WordNet. For the similarity measuring between proposed modeling and trajectory of moving object in the video, the objects are extracted, and then compared with the trajectories of moving objects by the proposed modeling. Because of the different features with each proposed modeling, the rules that have been generated will be applied to the similarity measurement by TSR (Tangent Space Representation). Through this research, we can extend our results to the automatic accident detection of vehicle using CCTV.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.41 no.10
• /
• pp.87-96
• /
• 2004

These days, it is essential that a business-class hotel provide customers with Internet service. So the most hotels have been installing facilities actively for Internet service. Businessmen also want to use Internet service level to their own office or home in hotel room. But now TV and VoD(partial) based-on CATV in hotel is supplied, and the additional network are installed for Internet service. The existing TV also must be replaced to HDTV within 2 or 3 years. The objective of this paper is to implement the next generation hotel multimedia service system using xDSL technology, VLAN mapping technology, and QoS technology. This system can provide each room in hotel with high-quality video service and Internet service simultaneously, and can also supply Internet access service using wireless LAN for the Places, such as lobby, conference room, and coffee shop in hotel. Therefore, this system can create the new market in hotel multimedia service field by connecting xDSL technology to VLAN mapping technology for charging and QoS technology for video stream transmission.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.46 no.7
• /
• pp.39-44
• /
• 2009

It is well-known that the performance of turbo codes can be improved by allocating different energies per code symbol. In this paper, based on this observation, we propose a joint encoding and modulation scheme for quadrature amplitude modulated turbo code systems. In the proposed scheme, the amount of energy difference between the turbo coded symbols is optimized by optimizing the constellation of quadrature amplitude modulation (QAM). The proposed scheme offers better coding gain compared to the conventional combination of binary turbo code and QAM at the bit error rate of 10$^{-5}$. Also, the performance of binary turbo codes with the proposed QAM constellation for various code symbol mapping strategies are verified.

• Journal of the Korea Computer Industry Society
• /
• v.2 no.6
• /
• pp.837-844
• /
• 2001

XML has already been settled down as a standard for the exchange of commercial data on the web. Though most institutions have a wish to use XML document as an EDI form for all sorts of document exchange, it is unfortune that previous commercial data is still saved in the relational form of data base. Therefore, it is necessary that data saved in the relational form of data base be transformed into XML document form for the better use of document exchange. In order to transform relational form of data base to XML, one solution is to publish XML document by way of mapping each field of the relational form of data base table onto XML. However, in the case of building one XML document out of more i~km two data base tables, a join should be performed since a mere mapping associated with DTD tan not solve the problem. In this paper, we build the view for the XML in which alignments generated from the join are presented. and then through this view the contents with the relational form of data base should be transformed into XML. Briefly speaking, This paper aims to propose algorithm concerned with this transformation and to realize it.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.19 no.10
• /
• pp.2331-2340
• /
• 2015

In this paper, we propose a social-based collaboration systems for business process management in the mobile cloud. This XMDR-DAI is to provide services for data sharing and exchange between local systems that operate independently in a cloud environment, take charge of a social-based collaborative business process management. Social-based collaborative business processes are handled in a collision among a structure such as unit conversion, meaning conflict, and the schema mapping data resulting from the inner query. The conflict was resolved by mapping process which takes in each XMDR-DAI.

• Journal of KIISE
• /
• v.43 no.2
• /
• pp.163-176
• /
• 2016

The contention overhead on the same channel in an NoC architecture can significantly increase a communication delay due to the simultaneous communication requests that occur. To reduce the overall overhead, we propose task-to-tile binding techniques for an NoC-based manycore platform, whereby it is assumed that the task mapping decision has already made. Since the NoC architecture may have multiple memory tiles as its size grows, memory clustering is used to balance the load of memory by making applications access different memory tiles. We assume that the information on the communication overhead of each application is known since it is specified in a dataflow task graph. Using this information, this paper proposes two heurisitics that perform binding of multiple tasks at once based on a proper memory clustering method. Experiments with an NoC simulator prove that the proposed heurisitic shows performance gains that are 25% greater than that of the previous binding heuristic.

• Journal of Intelligence and Information Systems
• /
• v.12 no.2
• /
• pp.145-165
• /
• 2006

Information filtering systems, which are designed fur users' needs, do not satisfy user's diverse requests as their filtering accuracy is unstable sometimes. This study suggests an information filtering system based on cognitive brain mapping by simulating the processes of information in human brain. Compared to traditional filtering systems, which use specific words or pattern in their filtering systems, the method suggested in this article uses both key words and relationships among these words. The significance of this study is on simulating information storing processes in human brain by mapping both key words and their relationships among them together. To combine these two methods, this study finds balances in representing two methods by searching optimal weights of each of them.

• The KIPS Transactions:PartA
• /
• v.11A no.2
• /
• pp.189-194
• /
• 2004

This paper describes method to distribute much high-dimensional facial expression motion data to 2 dimensional space, and method to create facial expression animation by select expressions that want by realtime as animator navigates this space. In this paper composed expression space using about 2400 facial expression frames. The creation of facial space is ended by decision of shortest distance between any two expressions. The expression space as manifold space expresses approximately distance between two points as following. After define expression state vector that express state of each expression using distance matrix which represent distance between any markers, if two expression adjoin, regard this as approximate about shortest distance between two expressions. So, if adjacency distance is decided between adjacency expressions, connect these adjacency distances and yield shortest distance between any two expression states, use Floyd algorithm for this. To materialize expression space that is high-dimensional space, project on 2 dimensions using Sammon's Mapping. Facial animation create by realtime with animators navigating 2 dimensional space using user interface.

• The Journal of the Acoustical Society of Korea
• /
• v.15 no.4
• /
• pp.58-64
• /
• 1996

This paper was proposed the recognition method by using parameters which was estimated from the data on the estimated plane and a neural network. After the LPC estimated in each frame algorithm was mapped to the estimated plane by the optimum feature mapping function, we estimated the C-LPC and the maximum and minimum value and 3 divided power from the mapping data on the estimated plane. As a result of the experiment of the speech recognition that those parameters were applied to the input of a neural network, it was found that those parameters estimated from the estimated plane have the features of the original speech for a change in the time scale and that the recongnition rate by the proposed methods was 96.3 percent.