| 1. |
- Arshad, Wajiha, et al.
(författare)
-
A rare case of retropharyngeal liposarcoma : a rare location of a rare diagnosis
- 2023
-
Ingår i: Journal of Surgical Case Reports. - : Oxford University Press (OUP). - 2042-8812. ; 2023:3
-
Tidskriftsartikel (refereegranskat)abstract
- We report a case of retropharyngeal liposarcoma in a 53-year-old female, who had complaints of neck swelling accompanied with dysphagia, orthopnea and dysphonia. Clinical examination revealed huge multinodular swelling in front of neck with bilateral extension, more prominent on left side and moving with deglutition. The diagnosis of retropharyngeal liposarcoma was established following CT scan, MRI and incisional biopsy. Surgical excision of mass along with near total thyroidectomy was performed. Postoperative hospital stay was uneventful. She remained well in follow-up period of 1 year as well. In conclusion, retropharyngeal liposarcoma is a rare tumor. A review of the literature explores the reasons behind the late presentation as well as the difficulties in diagnosis and treatment of this rare tumor.
|
|
| 2. |
- Bhatti, Muhammad Khurram, et al.
(författare)
-
Locality-aware task scheduling for homogeneous parallel computing systems
- 2018
-
Ingår i: Computing. - : Springer Science and Business Media LLC. - 0010-485X .- 1436-5057. ; 100:6, s. 557-595
-
Tidskriftsartikel (refereegranskat)abstract
- In systems with complex many-core cache hierarchy, exploiting data locality can significantly reduce execution time and energy consumption of parallel applications. Locality can be exploited at various hardware and software layers. For instance, by implementing private and shared caches in a multi-level fashion, recent hardware designs are already optimised for locality. However, this would all be useless if the software scheduling does not cast the execution in a manner that promotes locality available in the programs themselves. Since programs for parallel systems consist of tasks executed simultaneously, task scheduling becomes crucial for the performance in multi-level cache architectures. This paper presents a heuristic algorithm for homogeneous multi-core systems called locality-aware task scheduling (LeTS). The LeTS heuristic is a work-conserving algorithm that takes into account both locality and load balancing in order to reduce the execution time of target applications. The working principle of LeTS is based on two distinctive phases, namely; working task group formation phase (WTG-FP) and working task group ordering phase (WTG-OP). The WTG-FP forms groups of tasks in order to capture data reuse across tasks while the WTG-OP determines an optimal order of execution for task groups that minimizes the reuse distance of shared data between tasks. We have performed experiments using randomly generated task graphs by varying three major performance parameters, namely: (1) communication to computation ratio (CCR) between 0.1 and 1.0, (2) application size, i.e., task graphs comprising of 50-, 100-, and 300-tasks per graph, and (3) number of cores with 2-, 4-, 8-, and 16-cores execution scenarios. We have also performed experiments using selected real-world applications. The LeTS heuristic reduces overall execution time of applications by exploiting inter-task data locality. Results show that LeTS outperforms state-of-the-art algorithms in amortizing inter-task communication cost.
|
|
| 3. |
- Farooq, Umer, et al.
(författare)
-
Multi-Mobile Agent Trust Framework for Mitigating Internal Attacks and Augmenting RPL Security
- 2022
-
Ingår i: Sensors. - : MDPI. - 1424-8220. ; 22:12
-
Tidskriftsartikel (refereegranskat)abstract
- Recently, the Internet of Things (IoT) has emerged as an important way to connect diverse physical devices to the internet. The IoT paves the way for a slew of new cutting-edge applications. Despite the prospective benefits and many security solutions offered in the literature, the security of IoT networks remains a critical concern, considering the massive amount of data generated and transmitted. The resource-constrained, mobile, and heterogeneous nature of the IoT makes it increasingly challenging to preserve security in routing protocols, such as the routing protocol for low-power and lossy networks (RPL). RPL does not offer good protection against routing attacks, such as rank, Sybil, and sinkhole attacks. Therefore, to augment the security of RPL, this article proposes the energy-efficient multi-mobile agent-based trust framework for RPL (MMTM-RPL). The goal of MMTM-RPL is to mitigate internal attacks in IoT-based wireless sensor networks using fog layer capabilities. MMTM-RPL mitigates rank, Sybil, and sinkhole attacks while minimizing energy and message overheads by 25–30% due to the use of mobile agents and dynamic itineraries. MMTM-RPL enhances the security of RPL and improves network lifetime (by 25–30% or more) and the detection rate (by 10% or more) compared to state-of-the-art approaches, namely, DCTM-RPL, RBAM-IoT, RPL-MRC, and DSH-RPL.
|
|
