International Journal of Computer Science & Network Security
/
v.22
no.4
/
pp.89-100
/
2022
With the advancement in the Internet of things Technology (IoT) cloud computing, billions of physical devices have been interconnected for sharing and collecting data in different applications. Despite many advancements, some latency - specific application in the real world is not feasible due to existing constraints of IoT devices and distance between cloud and IoT devices. In order to address issues of latency sensitive applications, fog computing has been developed that involves the availability of computing and storage resources at the edge of the network near the IoT devices. However, fog computing suffers from many limitations such as heterogeneity, storage capabilities, processing capability, memory limitations etc. Therefore, it requires an adequate task scheduling method for utilizing computing resources optimally at the fog layer. This work presents a comprehensive review of different task scheduling methods in fog computing. It analyses different task scheduling methods developed for a fog computing environment in multiple dimensions and compares them to highlight the advantages and disadvantages of methods. Finally, it presents promising research directions for fellow researchers in the fog computing environment.
The Journal of Korean Institute of Communications and Information Sciences
/
v.33
no.3C
/
pp.219-233
/
2008
Optimal scheduling of parallel tasks with some precedence relationship, onto a parallel machine is known to be NP-complete. The complexity of the problem increases when task scheduling is to be done in a heterogeneous environment, where the processors in the network may not be identical and take different amounts of time to execute the same task. This paper introduces a Duplication based Task Scheduling with Communication Cost in Heterogeneous Systems (DTSC), which provides optimal results for applications represented by Directed Acyclic Graphs (DAGs), provided a simple set of conditions on task computation and network communication time could be satisfied. Results from an extensive simulation show significant performance improvement from the proposed techniques over the Task duplication-based scheduling Algorithm for Network of Heterogeneous systems(TANH) and General Dynamic Level(GDL) scheduling algorithm.
The task network which is formed of different individuals can be recognized as a social network. Therefore, the way to communicate with people inside or outside the network has considerable influence on their outcome. Moreover, the position on which a member stands in a network shows the different effects of the information systems supporting communication with others. In this paper, it is to be studied how personal CMC (computer-mediated communication) tools affect the mission that those who work for a network perform through diverse task networks. Especially, we focused on synchronicity of CMC. On this score, the perspective of Media Synchronicity Theory was taken that had been suggested by criticizing Media Richness Theory. It is the objective, from this perspective, to find which characteristics of networks make the value of IT supporting synchronicity high. In the research trends of social networks, there have been two traditional perspectives to explain the effect of network: embeddedness and diversity ones. These differ from the aspect which type of social network can provide much more economic benefits. As similar studies have been reported by various researchers, these are also divided into the bonding and bridging views which are based on internal and external tie, respectively, Size, density, and centrality were measured as the characteristics of personal task networks. Size means the level of relationship between members. It is the total number of other colleagues who work with a specific member for a certain project. It means, the larger the size of task network, the more the number of coworkers who interact each other through the job. Density is the ratio of the number of relationships arranged actually to the total number of available ones. In an ego-centered network, it is defined as the ratio of the number of relationship made really to the total number of possible ones between members who are actually involved each other. The higher the level of density, the larger the number of projects on which the members collaborate. Centrality means that his/her position is on the exact center of whole network. There are several methods to measure it. In this research, betweenness centrality was adopted among them. It is measured by the position on which one member stands between others in a network. The determinant to raise its level is the shortest geodesic that represents the shortest distance between members. Centrality also indicates the level of role as a broker among others. To verify the hypotheses, we interviewed and surveyed a group of employees of a nationwide financial organization in which a groupware system is used. They were questioned about two CMC applications: MSN with a higher level of synchronicity and email with a lower one. As a result, the larger the size of his/her own task network, the smaller its density and the higher the level of his/her centrality, the higher the level of the effect using the task network with CMC tools. Above all, this positive effect is verified to be much more produced while using CMC applications with higher-level synchronicity. Among the a variety of situations under which the use of CMC gives more benefits, this research is considered as one of rare cases regarding the characteristics of task network as moderators by focusing ITs for the operation of his/her own task network. It is another contribution of this research to prove empirically that the values of information system depend on the social, or comparative, characteristic of time. Though the same amount of time is shared, the social characteristics of users change its value. In addition, it is significant to examine empirically that the ITs with higher-level synchronicity have the positive effect on productivity. Many businesses are worried about the negative effect of synchronous ITs, for their employees are likely to use them for personal social activities. However. this research can help to dismiss the concern against CMC tools.
Uninterrupted power supply has become indispensable during the maintenance task of active electric power lines as a result of today's highly information-oriented society and increasing demand of electric utilities. The maintenance task has the risk of electric shock and the danger of falling from high place. Therefore it is necessary to realize an autonomous robot system using electro-hydraulic manipulator because hydraulic manipulators have the advantage of electric insulation. Meanwhile it is relatively difficult to realize autonomous assembly tasks particularly in the case of manipulating flexible objects such as electric lines. In this report, a discrete event control system is introduced for automatic assembly task of electric lines into sleeves as one of the typical task of active electric power lines. In the implementation of a discrete event control system, LVQNN (linear vector quantization neural network) is applied to the insertion task of electric lines to sleeves. In order to apply these proposed control system to the unknown environment, virtual learning data for LVQNN is generated by fuzzy inference. By the experimental results of two types of electric lines and sleeves, these proposed discrete event control and neural network learning algorithm are confirmed very effective to the insertion tasks of electric lines to sleeves as a typical task of active electric power maintenance tasks.
Proceedings of the Korean Institute of Information and Commucation Sciences Conference
/
2018.05a
/
pp.419-421
/
2018
Cloud vehicular networks are a promising paradigm to improve vehicular through distributing computation tasks between remote clouds and local vehicular terminals. Software-Defined Network(SDN) can bring advantages to Intelligent Transportation System(ITS) through its ability to provide flexibility and programmability through a logically centralized controlled cluster that has a full comprehension of view of the network. However, as the SDN paradigm is currently studied in vehicular ad hoc networks(VANETs), adapting it to work on cloud-based vehicular network requires some changes to address particular computation features such as task computation of applications of cloud-based vehicular networks. There has been initial work on briging SDN concepts to vehicular networks to reduce the latency by using the fog computing technology, but most of these studies do not directly tackle the issue of task computation. This paper proposes a Software-Defined Cloud-based vehicular Network called SDCVN framework. In this framework, we study the effectiveness of task computation of applications of cloud-based vehicular networks with vehicular cloud and roadside edge cloud. Considering the edge cloud service migration due to the vehicle mobility, we present an efficient roadside cloud based controller entity scheme where the tasks are adaptively computed through vehicular cloud mode or roadside computing predictive trajectory decision mode. Simulation results show that our proposal demonstrates a stable and low route setup time in case of installing the forwarding rules of the routing applications because the source node needs to contact the controller once to setup the route.
Proceedings of the Korean Institute of Information and Commucation Sciences Conference
/
2018.05a
/
pp.238-240
/
2018
Cloud vehicular networks are a promising paradigm to improve vehicular through distributing computation tasks between remote clouds and local vehicular terminals. Software-Defined Network(SDN) can bring advantages to Intelligent Transportation System(ITS) through its ability to provide flexibility and programmability through a logically centralized controlled cluster that has a full comprehension of view of the network. However, as the SDN paradigm is currently studied in vehicular ad hoc networks(VANETs), adapting it to work on cloud-based vehicular network requires some changes to address particular computation features such as task computation of applications of cloud-based vehicular networks. There has been initial work on briging SDN concepts to vehicular networks to reduce the latency by using the fog computing technology, but most of these studies do not directly tackle the issue of task computation. This paper proposes a Software-Defined Cloud-based vehicular Network called SDCVN framework. In this framework, we study the effectiveness of task computation of applications of cloud-based vehicular networks with vehicular cloud and roadside edge cloud. Considering the edge cloud service migration due to the vehicle mobility, we present an efficient roadside cloud based controller entity scheme where the tasks are adaptively computed through vehicular cloud mode or roadside computing predictive trajectory decision mode. Simulation results show that our proposal demonstrates a stable and low route setup time in case of installing the forwarding rules of the routing applications because the source node needs to contact the controller once to setup the route.
Korean Journal of Construction Engineering and Management
/
v.20
no.1
/
pp.105-113
/
2019
A construction project is a complex process consisting of interdependent tasks. If one task has variation, other tasks will be affected additionally and it is difficult to reach consensus on task variation due to the characteristics of the construction site that is going on quickly and complicatedly. Therefore, this study identified the root cause of task variation in construction process. Adjacent matrix was created with the tasks corresponding to major causes of variation, and the network analysis was performed. The results of social network analysis in the construction process can stabilize the work flow in the complex process and improve the reliability of the process plan and the project performance.
Image semantic segmentation and dehazing are key tasks in the computer vision. In recent years, researches in both tasks have achieved substantial improvements in performance with the development of Convolutional Neural Network (CNN). However, most of the previous works for semantic segmentation assume the images are captured in clear weather and show degraded performance under hazy images with low contrast and faded color. Meanwhile, dehazing aims to recover clear image given observed hazy image, which is an ill-posed problem and can be alleviated with additional information about the image. In this work, we propose a deep multi-task network for simultaneous semantic segmentation and dehazing. The proposed network takes single haze image as input and predicts dense semantic segmentation map and clear image. The visual information getting refined during the dehazing process can help the recognition task of semantic segmentation. On the other hand, semantic features obtained during the semantic segmentation process can provide cues for color priors for objects, which can help dehazing process. Experimental results demonstrate the effectiveness of the proposed multi-task approach, showing improved performance compared to the separate networks.
Proceedings of the Korea Information Processing Society Conference
/
2019.05a
/
pp.472-474
/
2019
Because of the difference in network structure and loss function, Verification and identification models have their respective advantages and limitations for person reidentification (re-ID). In this work, we propose a multi-task network simultaneously computes the identification loss and verification loss for person reidentification. Given a pair of images as network input, the multi-task network simultaneously outputs the identities of the two images and whether the images belong to the same identity. In experiments, we analyze the major factors affect the accuracy of person reidentification. To address the occlusion problem and improve the generalization ability of reID models, we use the Random Erasing Augmentation (REA) method to preprocess the images. The method can be easily applied to different pre-trained networks, such as ResNet and VGG. The experimental results on the Market1501 datasets show significant and consistent improvements over the state-of-the-art methods.
KSII Transactions on Internet and Information Systems (TIIS)
/
v.15
no.6
/
pp.2282-2303
/
2021
To solve the problems of heavy computing load and system transmission pressure in energy internet (EI), we establish a three-tier cloud-edge integrated EI network based on a cloud-edge collaborative computing to achieve the tradeoff between energy consumption and the system delay. A joint optimization problem for resource allocation and task offloading in the threetier cloud-edge integrated EI network is formulated to minimize the total system cost under the constraints of the task scheduling binary variables of each sensor node, the maximum uplink transmit power of each sensor node, the limited computation capability of the sensor node and the maximum computation resource of each edge server, which is a Mixed Integer Non-linear Programming (MINLP) problem. To solve the problem, we propose a joint task offloading and resource allocation algorithm (JTOARA), which is decomposed into three subproblems including the uplink transmission power allocation sub-problem, the computation resource allocation sub-problem, and the offloading scheme selection subproblem. Then, the power allocation of each sensor node is achieved by bisection search algorithm, which has a fast convergence. While the computation resource allocation is derived by line optimization method and convex optimization theory. Finally, to achieve the optimal task offloading, we propose a cloud-edge collaborative computation offloading schemes based on game theory and prove the existence of Nash Equilibrium. The simulation results demonstrate that our proposed algorithm can improve output performance as comparing with the conventional algorithms, and its performance is close to the that of the enumerative algorithm.
본 웹사이트에 게시된 이메일 주소가 전자우편 수집 프로그램이나
그 밖의 기술적 장치를 이용하여 무단으로 수집되는 것을 거부하며,
이를 위반시 정보통신망법에 의해 형사 처벌됨을 유념하시기 바랍니다.
[게시일 2004년 10월 1일]
이용약관
제 1 장 총칙
제 1 조 (목적)
이 이용약관은 KoreaScience 홈페이지(이하 “당 사이트”)에서 제공하는 인터넷 서비스(이하 '서비스')의 가입조건 및 이용에 관한 제반 사항과 기타 필요한 사항을 구체적으로 규정함을 목적으로 합니다.
제 2 조 (용어의 정의)
① "이용자"라 함은 당 사이트에 접속하여 이 약관에 따라 당 사이트가 제공하는 서비스를 받는 회원 및 비회원을
말합니다.
② "회원"이라 함은 서비스를 이용하기 위하여 당 사이트에 개인정보를 제공하여 아이디(ID)와 비밀번호를 부여
받은 자를 말합니다.
③ "회원 아이디(ID)"라 함은 회원의 식별 및 서비스 이용을 위하여 자신이 선정한 문자 및 숫자의 조합을
말합니다.
④ "비밀번호(패스워드)"라 함은 회원이 자신의 비밀보호를 위하여 선정한 문자 및 숫자의 조합을 말합니다.
제 3 조 (이용약관의 효력 및 변경)
① 이 약관은 당 사이트에 게시하거나 기타의 방법으로 회원에게 공지함으로써 효력이 발생합니다.
② 당 사이트는 이 약관을 개정할 경우에 적용일자 및 개정사유를 명시하여 현행 약관과 함께 당 사이트의
초기화면에 그 적용일자 7일 이전부터 적용일자 전일까지 공지합니다. 다만, 회원에게 불리하게 약관내용을
변경하는 경우에는 최소한 30일 이상의 사전 유예기간을 두고 공지합니다. 이 경우 당 사이트는 개정 전
내용과 개정 후 내용을 명확하게 비교하여 이용자가 알기 쉽도록 표시합니다.
제 4 조(약관 외 준칙)
① 이 약관은 당 사이트가 제공하는 서비스에 관한 이용안내와 함께 적용됩니다.
② 이 약관에 명시되지 아니한 사항은 관계법령의 규정이 적용됩니다.
제 2 장 이용계약의 체결
제 5 조 (이용계약의 성립 등)
① 이용계약은 이용고객이 당 사이트가 정한 약관에 「동의합니다」를 선택하고, 당 사이트가 정한
온라인신청양식을 작성하여 서비스 이용을 신청한 후, 당 사이트가 이를 승낙함으로써 성립합니다.
② 제1항의 승낙은 당 사이트가 제공하는 과학기술정보검색, 맞춤정보, 서지정보 등 다른 서비스의 이용승낙을
포함합니다.
제 6 조 (회원가입)
서비스를 이용하고자 하는 고객은 당 사이트에서 정한 회원가입양식에 개인정보를 기재하여 가입을 하여야 합니다.
제 7 조 (개인정보의 보호 및 사용)
당 사이트는 관계법령이 정하는 바에 따라 회원 등록정보를 포함한 회원의 개인정보를 보호하기 위해 노력합니다. 회원 개인정보의 보호 및 사용에 대해서는 관련법령 및 당 사이트의 개인정보 보호정책이 적용됩니다.
제 8 조 (이용 신청의 승낙과 제한)
① 당 사이트는 제6조의 규정에 의한 이용신청고객에 대하여 서비스 이용을 승낙합니다.
② 당 사이트는 아래사항에 해당하는 경우에 대해서 승낙하지 아니 합니다.
- 이용계약 신청서의 내용을 허위로 기재한 경우
- 기타 규정한 제반사항을 위반하며 신청하는 경우
제 9 조 (회원 ID 부여 및 변경 등)
① 당 사이트는 이용고객에 대하여 약관에 정하는 바에 따라 자신이 선정한 회원 ID를 부여합니다.
② 회원 ID는 원칙적으로 변경이 불가하며 부득이한 사유로 인하여 변경 하고자 하는 경우에는 해당 ID를
해지하고 재가입해야 합니다.
③ 기타 회원 개인정보 관리 및 변경 등에 관한 사항은 서비스별 안내에 정하는 바에 의합니다.
제 3 장 계약 당사자의 의무
제 10 조 (KISTI의 의무)
① 당 사이트는 이용고객이 희망한 서비스 제공 개시일에 특별한 사정이 없는 한 서비스를 이용할 수 있도록
하여야 합니다.
② 당 사이트는 개인정보 보호를 위해 보안시스템을 구축하며 개인정보 보호정책을 공시하고 준수합니다.
③ 당 사이트는 회원으로부터 제기되는 의견이나 불만이 정당하다고 객관적으로 인정될 경우에는 적절한 절차를
거쳐 즉시 처리하여야 합니다. 다만, 즉시 처리가 곤란한 경우는 회원에게 그 사유와 처리일정을 통보하여야
합니다.
제 11 조 (회원의 의무)
① 이용자는 회원가입 신청 또는 회원정보 변경 시 실명으로 모든 사항을 사실에 근거하여 작성하여야 하며,
허위 또는 타인의 정보를 등록할 경우 일체의 권리를 주장할 수 없습니다.
② 당 사이트가 관계법령 및 개인정보 보호정책에 의거하여 그 책임을 지는 경우를 제외하고 회원에게 부여된
ID의 비밀번호 관리소홀, 부정사용에 의하여 발생하는 모든 결과에 대한 책임은 회원에게 있습니다.
③ 회원은 당 사이트 및 제 3자의 지적 재산권을 침해해서는 안 됩니다.
제 4 장 서비스의 이용
제 12 조 (서비스 이용 시간)
① 서비스 이용은 당 사이트의 업무상 또는 기술상 특별한 지장이 없는 한 연중무휴, 1일 24시간 운영을
원칙으로 합니다. 단, 당 사이트는 시스템 정기점검, 증설 및 교체를 위해 당 사이트가 정한 날이나 시간에
서비스를 일시 중단할 수 있으며, 예정되어 있는 작업으로 인한 서비스 일시중단은 당 사이트 홈페이지를
통해 사전에 공지합니다.
② 당 사이트는 서비스를 특정범위로 분할하여 각 범위별로 이용가능시간을 별도로 지정할 수 있습니다. 다만
이 경우 그 내용을 공지합니다.
제 13 조 (홈페이지 저작권)
① NDSL에서 제공하는 모든 저작물의 저작권은 원저작자에게 있으며, KISTI는 복제/배포/전송권을 확보하고
있습니다.
② NDSL에서 제공하는 콘텐츠를 상업적 및 기타 영리목적으로 복제/배포/전송할 경우 사전에 KISTI의 허락을
받아야 합니다.
③ NDSL에서 제공하는 콘텐츠를 보도, 비평, 교육, 연구 등을 위하여 정당한 범위 안에서 공정한 관행에
합치되게 인용할 수 있습니다.
④ NDSL에서 제공하는 콘텐츠를 무단 복제, 전송, 배포 기타 저작권법에 위반되는 방법으로 이용할 경우
저작권법 제136조에 따라 5년 이하의 징역 또는 5천만 원 이하의 벌금에 처해질 수 있습니다.
제 14 조 (유료서비스)
① 당 사이트 및 협력기관이 정한 유료서비스(원문복사 등)는 별도로 정해진 바에 따르며, 변경사항은 시행 전에
당 사이트 홈페이지를 통하여 회원에게 공지합니다.
② 유료서비스를 이용하려는 회원은 정해진 요금체계에 따라 요금을 납부해야 합니다.
제 5 장 계약 해지 및 이용 제한
제 15 조 (계약 해지)
회원이 이용계약을 해지하고자 하는 때에는 [가입해지] 메뉴를 이용해 직접 해지해야 합니다.
제 16 조 (서비스 이용제한)
① 당 사이트는 회원이 서비스 이용내용에 있어서 본 약관 제 11조 내용을 위반하거나, 다음 각 호에 해당하는
경우 서비스 이용을 제한할 수 있습니다.
- 2년 이상 서비스를 이용한 적이 없는 경우
- 기타 정상적인 서비스 운영에 방해가 될 경우
② 상기 이용제한 규정에 따라 서비스를 이용하는 회원에게 서비스 이용에 대하여 별도 공지 없이 서비스 이용의
일시정지, 이용계약 해지 할 수 있습니다.
제 17 조 (전자우편주소 수집 금지)
회원은 전자우편주소 추출기 등을 이용하여 전자우편주소를 수집 또는 제3자에게 제공할 수 없습니다.
제 6 장 손해배상 및 기타사항
제 18 조 (손해배상)
당 사이트는 무료로 제공되는 서비스와 관련하여 회원에게 어떠한 손해가 발생하더라도 당 사이트가 고의 또는 과실로 인한 손해발생을 제외하고는 이에 대하여 책임을 부담하지 아니합니다.
제 19 조 (관할 법원)
서비스 이용으로 발생한 분쟁에 대해 소송이 제기되는 경우 민사 소송법상의 관할 법원에 제기합니다.
[부 칙]
1. (시행일) 이 약관은 2016년 9월 5일부터 적용되며, 종전 약관은 본 약관으로 대체되며, 개정된 약관의 적용일 이전 가입자도 개정된 약관의 적용을 받습니다.