Nowadays, to accommodate the swift expansion of cloud computing, big data, and other emerging technologies, integrating data center networks and SDN (Software Defined Network) is suggested, which also improves the network management’s convenience and flexibility. As network devices in these data centers continue to increase at a high rate, efficient route management to handle these devices’ vast amounts of data has emerged as a significant concern. This work suggests a novel admission and routing scheme considering the importance or priorities of the network flows, path energy, and routing path load. Using the SDN paradigm in DCN (Data Center Network), we first develop a Mixed Integer Linear Programming (MILP) formulation by jointly considering flow priority, path energy, and path load. The MILP formulation can maximize the number of flows as well as minimize the energy consumption and load variance in the network, or it can make a trade-off among all three. However, due to the potentially long running time, later, we introduce two greedy methods, Priority Based Energy Minimization Algorithm (PEMA) and Priority Based Evenly Load Distribution Algorithm (PEDL), where PEMA aims to maximize the flow with less energy, and PEDL focuses on maximizing the flow with reduced load variation. Finally, the developed routing strategies are implemented, and the simulation results demonstrate the out-performance of our work compared to the existing works in terms of successful flow ratio, energy savings, and load balancing.

Emergence of intelligent devices and mobile edge clouds (MECs) in 5G networks has exponentially increased the number of applications that demand low latency services. However, their resource heterogeneity, limited computing power and storage including congestion in the ultra-dense 5G network, make the real-time services challenging. Existing works are limited either by addressing application delay requirements or computational load balancing. This article develops an efficient resource allocation framework for selecting optimal servers and routing paths in the 5G MEC network by jointly optimizing latency, computational, and network load variances. First, we formulate the above multi-objective problem as a mixed-integer non-linear programming problem. Further, we adopt a hyper-heuristic (AWSH) algorithm by leveraging the combined powers ofAnt Colony,Whale,Sine-Cosine, andHenry Gas Solubility Optimization algorithms. The proposed AWSH algorithm works at the higher level, and it explores and exploits one of the three lower-level heuristics in each iteration to efficiently capture the dynamically varying environmental parameters and thereby address the resource allocation problem. Their collaborative effort helps to achieve a global optimum in allocating resources of 5G MEC network. Simulation results prove the superiority of the AWSH algorithm compared to state-of-the-art solutions in terms of service latency, successful offloading ratio, and load balancing.

Breast cancer is a common and highly heterogeneous cancer worldwide. Rapid detection and early diagnosis are essential in its treatment, but it is challenging due to mammogram’s uncertainty. Based on machine learning, operative clinical systems can be implemented to save patients’ lives. This study proposes an optimized support vector machine (SVM) model to predict breast cancer using the grid search method to find the best hyper-parameters. For validation, we offer an in-depth experimental study and we achieve, for Benign|Malignant|Average cases, accuracy of 98.69%|99.72%|99.0%, precision of 96.0%|100.0%|98.0%, recall of 100.0%|98.0%|98.0%, and Fl-score of 98.0%|97.0%|98.0% respectively. Comparison is made between the tuned hyper-parameter and default hyper-parameter performance. SVM performance with default parameters is 96%, while the maximum accuracy is achieved by hyper-parameters tuned. An SVM model is 99%, which can be a better cancer detection system. The results show performance improves when the best hyperparameters are used for SVM training. Thus, the analysis and comparison indicate that our stated system is better than the state-of-the-art ML-based breast cancer detection system.

Print interpreting is a form of communication that allows deaf and hard of hearing people to get access to speech. We carried out an eye tracking experiment where twenty participants read print interpreted text presented dynamically on a computer screen. We compared regression landing points on reread words between two dynamic text presentation formats: letter-by-letter and word-by-word. Then we investigated the gaze behaviour from a linguistic point of view in order to discover whether the dynamic presentation has an effect on linguistic factors. In particular, we have examined the parts of speech of the first and the second landing points of regressions. The findings suggest significant difference between the presentation formats. There is also a relationship between the gaze behaviour and the linguistic processing of dynamic text. Being conscious of this lexical hierarchy may help to develop supporting print interpreting tools and consequently may also help print interpreters to improve the presentation of dynamic text to the user.

We tracked the eye movements of 18 students as they translated three short texts with different complexity levels under three different time constraints. Participants with touch typing skills were found to attend more to on-screen text than participants without touch typing skills. Time pressure was found to mainly affect fixations on the source text, and text complexity was found to only affect the number of fixations on the source text. Overall, it was found that average fixation duration was longer in the target text area than in the source text area.