• 한국정보처리학회:학술대회논문집
• /
• 한국정보처리학회 2012년도 추계학술발표대회
• /
• pp.1344-1347
• /
• 2012

Mobile Cloud Computing services anywhere, anytime access to the Internet via a mobile terminal means to provide services, speakers are called Mobiloud. Computing processing power limitations of mobile devices, storage, due to space constraints, the tasks handled by mobile devices and data processing services to move to cloud environments. In recent years, smartphone, tablet PC and mobile device companies and individuals to spread and spread, and the content of the accelerating cloud painters, mobile cloud that can communicate with each other requires a standard service.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제6권10호
• /
• pp.2632-2649
• /
• 2012

Most approaches to human action recognition is limited due to the use of simple action datasets under controlled environments or focus on excessively localized features without sufficiently exploring the spatio-temporal information. This paper proposed a framework for recognizing realistic human actions. Specifically, a new action representation is proposed based on computing a rich set of descriptors from keypoint trajectories. To obtain efficient and compact representations for actions, we develop a feature fusion method to combine spatial-temporal local motion descriptors by the movement of the camera which is detected by the distribution of spatio-temporal interest points in the clips. A new topic model called Markov Semantic Model is proposed for semantic feature selection which relies on the different kinds of dependencies between words produced by "syntactic " and "semantic" constraints. The informative features are selected collaboratively based on the different types of dependencies between words produced by short range and long range constraints. Building on the nonlinear SVMs, we validate this proposed hierarchical framework on several realistic action datasets.

• 산업공학
• /
• 제11권3호
• /
• pp.65-75
• /
• 1998

This research considers the problem of scheduling jobs on parallel machines with non-common due dates and additional resource constraints. The objective is to minimize the total absolute deviation of job completion times about the due dates. Job processing times are assumed to be the same. This problem is motivated by restrictions that occur in the handling and processing of jobs in certain phases of semiconductor manufacturing and other production systems. We examine two problems. For the first of these, the number of different types of additional: resources and resource requirements per job are arbitrary. The problem is formulated as a zero-one integer linear programming and the Lagrangian relaxation approach is used. For the second case, there exists one single type of additional resource and the resource requirements per job are zero or one. We show how to formulate the problem as an assignment problem.

• International Journal of Control, Automation, and Systems
• /
• 제1권4호
• /
• pp.412-430
• /
• 2003

In many practical problems in signal processing and control, the signal values are often restricted to belong to a finite number of levels. These questions are generally referred to as "finite alphabet" problems. There are many applications of this class of problems including: on-off control, optimal audio quantization, design of finite impulse response filters having quantized coefficients, equalization of digital communication channels subject to intersymbol interference, and control over networked communication channels. This paper will explain how this diverse class of problems can be formulated as optimization problems having finite alphabet constraints. Methods for solving these problems will be described and it will be shown that a semi-closed form solution exists. Special cases of the result include well known practical algorithms such as optimal noise shaping quantizers in audio signal processing and decision feedback equalizers in digital communication. Associated stability questions will also be addressed and several real world applications will be presented.

• 한국정보과학회:학술대회논문집
• /
• 한국정보과학회 1998년도 가을 학술발표논문집 Vol.25 No.2 (2)
• /
• pp.297-299
• /
• 1998

As there comes out better and better solutions for delivering multimedia data on the internet, the number of WebCAM sites which transmits pictures of any spot to the user's system is getting increased. WebCAM service over the internet can be compared with the CATV in that it is beyond the spatial constraints. In this project, we construct a WebCAM site Which performs not only the fundamental WebCAM functions of capturing images and of transmitting them periodically but also various kinds of modules carrying out tasks such as image processing, remote control of the camera, processing multiple user requests, making panorama views and so on using Java which is the most popular language for the internet or CGI. The past images are stored in a database implemented for the WebCAM system, so the system can be extended to get over the constraints in time also.

• 한국정보처리학회논문지
• /
• 제6권6호
• /
• pp.1646-1655
• /
• 1999

본 논문에서는 최적의 control dominated ASIC 설계를 위한 VHDL 중간 표현 그래프 CDDG(Control Dominated Data Graph)와 최소 제한조건 스케쥴링 알고리즘을 제안한다. CDDG는 VHDL 동작 기술의 조건 분기 및 반복구조 등을 효과적으로 나타낼 수 있는 제어 흐름 그래프로서 하드웨어 설계의 특성을 지원하기 위한 데이터 종속 관계, 하드웨어 자원 제한 및 시간 제한 조건이 표현된다. 제안된 스케쥴링 알고리즘은 CDDG의 부그래프로 표현된 제한조건에 대해, 부그래프들의 최소화하는 과정과 회로 동작의 허용 시간을 검사하는 최대 시간 제한의 검색 및 각 연산 노드들의 동작시간을 결정하는 과정으로 수행된다. 벤치마크 데이터를 사용하여 실험한 결과, 제안된 알고리즘이 기존의 알고리즘에 비해 우수함을 확인하였다.

• 한국정보처리학회:학술대회논문집
• /
• 한국정보처리학회 2005년도 추계학술발표대회 및 정기총회
• /
• pp.87-90
• /
• 2005

XML(eXtensible Markup Language)은 웹 상의 데이터를 표현하고, 교환하기 위한 표준 언어로써 XML 로 표현된 문서를 관계형 데이터베이스 관리시스템(RDBMS)에 저장하고 관리하는 기법에 대한 연구[1][2][3]가 활발히 진행되어 왔다. 이러한 연구들은 DTD(Document Type Definition)를 입력 받아 해당 DTD 에서 관계형 스키마를 추론하는 기법을 사용한다. 하지만, 기존의 연구들은 DTD 간소화 절차를 적용하기 때문에 DTD 내에서 추론될 수 있는 의미적인 부분들이 스키마 생성 시에 보존이 되지 못한다. 또한, 기존의 연구들은 XML 데이터의 내용(content)와 구조(structure) 정보만을 저장하는데 초점이 맞춰져 있기 때문에, XML 문서 저장 시 데이터의 무결성을 보장하기 위해 저장프로시져나 트리거를 이용해야 하는 번거로움이 생긴다. 본 논문에서는 [3]의 연구에서 제시한 Inlining 기법을 기반으로 기존의 Inlining 기법의 문제점인 DTD 에서 추론할 수 있는 의미적인 부분의 손실을 관계형 스키마로 보존하는 방법과 효율적인 릴레이션 생성을 위해 개선된 Inlining 기법을 제시한다.

• International Journal of Control, Automation, and Systems
• /
• 제6권2호
• /
• pp.160-170
• /
• 2008

Temperature control of an enclosed thermal system which has many applications including Rapid Thermal Processing (RTP) of semiconductor wafers showed an input-constraint violation for nonlinear controllers due to inherent strong coupling between the elements [1]. In this paper, a constrained nonlinear optimal control design is developed, which accommodates input constraints using the linear algebraic equivalence of the nonlinear controllers, for the temperature control of an enclosed thermal process. First, it will be shown that design of nonlinear controllers is equivalent to solving a set of linear algebraic equations-the linear algebraic equivalence of nonlinear controllers (LAENC). Then an input-constrained nonlinear optimal controller is designed based on that LAENC using the constrained linear least squares method. Through numerical simulations, it is demonstrated that the proposed controller achieves the equivalent performances to the classical nonlinear controllers with less total energy consumption. Moreover, it generates the practical control solution, in other words, control solutions do not violate the input-constraints.

• 한국정보처리학회:학술대회논문집
• /
• 한국정보처리학회 2002년도 춘계학술발표논문집 (상)
• /
• pp.687-690
• /
• 2002

In this paper, we present a novel semaphore implementation scheme which shortens finish time of high priority tasks and improves reliability of a system. The real-time systems have time constraints. Especially, the task with hard real-time constraints must meet its deadline. Consequently, managing shared resources is considered guaranteeing mutual exclusion as well as meeting task's deadline under unfavorable condition. According to the number and sort of the locked semaphores under the event occurred, this paper presents the reduction of the finish time of high priority task by decision whether the context switched or not. The experimental results show that the proposed method gives performance improvements in finish time of high priority tasks of about 11% over zuberi[4] method.

• Journal of Information Processing Systems
• /
• 제8권1호
• /
• pp.21-54
• /
• 2012

As we know every software development process is pretty large and consists of different modules. This raises the idea of prioritizing different software modules so that important modules can be tested by preference. In the software testing process, it is not possible to test each and every module regressively, which is due to time and cost constraints. To deal with these constraints, this paper proposes an approach that is based on the fuzzy multi-criteria approach for prioritizing several software modules and calculates optimal time and cost for software testing by using fuzzy logic and the fault tolerance approach.