28 results on '"Gelenbe, Erol"'
Search Results
2. Modelling of the Energy Depletion Process and Battery Depletion Attacks for Battery-Powered Internet of Things (IoT) Devices.
- Author
-
Kuaban, Godlove Suila, Gelenbe, Erol, Czachórski, Tadeusz, Czekalski, Piotr, and Tangka, Julius Kewir
- Subjects
- *
INTERNET of things , *WIENER processes , *PROBABILITY density function , *THRESHOLD energy - Abstract
The Internet of Things (IoT) is transforming almost every industry, including agriculture, food processing, health care, oil and gas, environmental protection, transportation and logistics, manufacturing, home automation, and safety. Cost-effective, small-sized batteries are often used to power IoT devices being deployed with limited energy capacity. The limited energy capacity of IoT devices makes them vulnerable to battery depletion attacks designed to exhaust the energy stored in the battery rapidly and eventually shut down the device. In designing and deploying IoT devices, the battery and device specifications should be chosen in such a way as to ensure a long lifetime of the device. This paper proposes diffusion approximation as a mathematical framework for modelling the energy depletion process in IoT batteries. We applied diffusion or Brownian motion processes to model the energy depletion of a battery of an IoT device. We used this model to obtain the probability density function, mean, variance, and probability of the lifetime of an IoT device. Furthermore, we studied the influence of active power consumption, sleep time, and battery capacity on the probability density function, mean, and probability of the lifetime of an IoT device. We modelled ghost energy depletion attacks and their impact on the lifetime of IoT devices. We used numerical examples to study the influence of battery depletion attacks on the distribution of the lifetime of an IoT device. We also introduced an energy threshold after which the device's battery should be replaced in order to ensure that the battery is not completely drained before it is replaced. [ABSTRACT FROM AUTHOR]
- Published
- 2023
- Full Text
- View/download PDF
3. Computer Science Awards.
- Subjects
- *
GABOR Denes-dij , *COMPUTER science awards , *PROFESSIONAL employees , *AWARDS - Abstract
The article announces that Academisch Medisch Centrum (ACM) Fellow Erol Gelenbe and Gal Kaminka of Bar-Ilan University have received the Dennis Gabor Award and Landau Prize.
- Published
- 2014
4. Steps Toward Self-Aware Networks.
- Author
-
GELENBE, EROL
- Subjects
- *
COMPUTER network management , *AUTONOMIC computing , *ELECTRONIC data processing , *COMPUTER network protocols , *QUALITY of service , *COMPUTER science - Abstract
The article discusses the design of self-aware networks (SANs), examining the theoretical and experimental research concerning the technical procedures necessary to establish such networks. SANs are comprised of nodes that can autonomously join and leave a network, as well as discover paths when a need to communicate arises. Other topics of discussion include connections that use paths which optimize the connections own quality of service (QoS) criteria and bio-inspired techniques for networking.
- Published
- 2009
- Full Text
- View/download PDF
5. The Distribution of a Program in Primary and Fast Buffer Storage.
- Author
-
Gelenbe, Erol and Weissman, C.
- Subjects
- *
BUFFER storage (Computer science) , *VIRTUAL storage (Computer science) , *COMPUTER storage devices , *COMPUTER systems , *ELECTRONIC systems , *COMPUTER industry - Abstract
A virtual memory computer system with a fast buffer (cache) memory between primary memory and the central processing unit is considered. The optimal distribution it a program between the buffer and primary memory is studied using the program's lifetime function. Expression for the distribution of a program which maximizes the useful fraction of the cost-time integral of primary and fast buffer storage are obtained for swapping and nonswapping buffer management policies. [ABSTRACT FROM AUTHOR]
- Published
- 1973
- Full Text
- View/download PDF
6. Minimizing Wasted Space in Partitioned Segmentation.
- Author
-
Gelenbe, Erol, Boekhorst, J. C. A., Kessels, J. L. W., and Weissman, C.
- Subjects
- *
VIRTUAL storage (Computer science) , *COMPUTER storage devices , *VIRTUAL machine systems , *ALGORITHMS , *ERLANG (Computer program language) , *PROGRAMMING languages - Abstract
A paged virtual memory system using a finite number of page sizes is considered. Two algorithms for assigning pages to segments are discussed. Both of these algorithms are simple to implement. The problem of choosing the page sizes to minimize the expected value of total wasted space in internal fragmentation and in a page table, per segment, is then solved for a probability density function of segment size which may be expressed as a convex combination of Erlang densities. [ABSTRACT FROM AUTHOR]
- Published
- 1973
- Full Text
- View/download PDF
7. Synchronising Energy Harvesting and Data Packets in a Wireless Sensor.
- Author
-
Gelenbe, Erol
- Subjects
- *
ENERGY harvesting , *DATA packeting , *REMOTE sensing , *ENERGY storage , *BUFFER storage (Computer science) , *PROBABILITY theory , *MATHEMATICAL analysis - Abstract
We consider a wireless sensor node that gathers energy through harvesting and reaps data through sensing. The node has a wireless transmitter that sends out a data packet whenever there is at least one "energy packet" and one "data packet", where an energy packet represents the amount of accumulated energy at the node that can allow the transmission of a data packet. We show that such a system is unstable when both the energy storage space and the data backlog buffer approach infinity, and we obtain the stable stationary solution when both buffers are finite. We then show that if a single energy packet is not sufficient to transmit a data packet, there are conditions under which the system is stable, and we provide the explicit expression for the joint probability distribution of the number of energy and data packets in the system. Since the two flows of energy and data can be viewed as flows that are instantaneously synchronised, this paper also provides a mathematical analysis of a fundamental problem in computer science related to the stability of the "join" synchronisation primitive. [ABSTRACT FROM AUTHOR]
- Published
- 2015
- Full Text
- View/download PDF
8. Directional Navigation Improves Opportunistic Communication for Emergencies.
- Author
-
Kokuti, Andras and Gelenbe, Erol
- Subjects
- *
BUILDING evacuation , *EMERGENCY management , *BUILT environment , *SHOPPING centers , *FIRES , *ALGORITHM research - Abstract
We present a novel direction based shortest path search algorithm to guide evacuees during an emergency. It uses opportunistic communications (oppcomms) with low-cost wearable mobile nodes that can exchange packets at close range of a few to some tens of meters without help of an infrastructure. The algorithm seeks the shortest path to exits which are safest with regard to a hazard, and is integrated into an autonomous Emergency Support System (ESS) to guide evacuees in a built environment. The algorithm proposed that ESSs are evaluated with the DBES (Distributed Building Evacuation Simulator) by simulating a shopping centre where fire is spreading. The results show that the directional path finding algorithm can offer significant improvements for the evacuees. [ABSTRACT FROM AUTHOR]
- Published
- 2014
- Full Text
- View/download PDF
9. Emergency Navigation without an Infrastructure.
- Author
-
Gelenbe, Erol and Huibo Bi
- Subjects
- *
SENSOR networks , *WIRELESS sensor networks , *TELECOMMUNICATION systems , *ALGORITHM research , *DETECTORS , *SMARTPHONES - Abstract
Emergency navigation systems for buildings and other built environments, such as sport arenas or shopping centres, typically rely on simple sensor networks to detect emergencies and, then, provide automatic signs to direct the evacuees. The major drawbacks of such static wireless sensor network (WSN)-based emergency navigation systems are the very limited computing capacity, which makes adaptivity very difficult, and the restricted battery power, due to the low cost of sensor nodes for unattended operation. If static wireless sensor networks and cloud-computing can be integrated, then intensive computations that are needed to determine optimal evacuation routes in the presence of time-varying hazards can be offloaded to the cloud, but the disadvantages of limited battery life-time at the client side, as well as the high likelihood of system malfunction during an emergency still remain. By making use of the powerful sensing ability of smart phones, which are increasingly ubiquitous, this paper presents a cloud-enabled indoor emergency navigation framework to direct evacuees in a coordinated fashion and to improve the reliability and resilience for both communication and localization. By combining social potential fields (SPF) and a cognitive packet network (CPN)-based algorithm, evacuees are guided to exits in dynamic loose clusters. Rather than relying on a conventional telecommunications infrastructure, we suggest an ad hoc cognitive packet network (AHCPN)-based protocol to adaptively search optimal communication routes between portable devices and the network egress nodes that provide access to cloud servers, in a manner that spares the remaining battery power of smart phones and minimizes the time latency. Experimental results through detailed simulations indicate that smart human motion and smart network management can increase the survival rate of evacuees and reduce the number of drained smart phones in an evacuation process. [ABSTRACT FROM AUTHOR]
- Published
- 2014
- Full Text
- View/download PDF
10. Search in the universe of big networks and data.
- Author
-
Gelenbe, Erol and Abdelrahman, Omer
- Subjects
- *
INTERNET searching , *WEB search engines , *BIG data , *MATHEMATICAL formulas - Abstract
Searching the Internet for some object characterized by its attributes in the form of data, such as a hotel in a certain city whose price is lower than some amount, is one of our most common activities when we access the web. We discuss this problem in a general setting, and compute the average amount of time and energy it takes to find an object in an infinitely large search space. We consider the use of N search agents that act concurrently in both the case where the search agent knows which way it needs to go to find the object, and the case where the search agent is completely ignorant and may even head away from the object being sought. We show that under mild conditions regarding the randomness of the search and the use of a time-out, the search agent will always find the object in spite of the fact that the search space is infinite. We obtain a formula for the average search time and the average energy expended by N search agents acting concurrently and independent of each other. We see that the time-out itself can be used to minimize the search time and the amount of energy that is consumed to find an object. An approximate formula is derived for the number of search agents that can help us guarantee that an object is found in a given time, and we discuss how the competition between search agents and other agents that try to hide the data object can be used by opposing parties to guarantee their own success. [ABSTRACT FROM PUBLISHER]
- Published
- 2014
- Full Text
- View/download PDF
11. Large scale simulation for human evacuation and rescue
- Author
-
Gelenbe, Erol and Wu, Fang-Jing
- Subjects
- *
COMPUTER simulation , *SENSOR networks , *EMERGENCY management , *CIVILIAN evacuation , *COMPUTER algorithms , *COMPUTER systems - Abstract
Abstract: This paper surveys recent research on the use of sensor networks, communications and computer systems to enhance the human outcome of emergency situations. Areas covered include sensing, communication with evacuees and emergency personnel, path finding algorithms for safe evacuation, simulation and prediction, and decision tools. The systems being considered are a special instance of real-time cyber-physical-human systems that have become a crucial component of all large scale physical infrastructures such as buildings, campuses, sports and entertainment venues, and transportation hubs. [Copyright &y& Elsevier]
- Published
- 2012
- Full Text
- View/download PDF
12. Anomaly detection in gene expression via stochastic models of gene regulatory networks.
- Author
-
Haseong Kim and Gelenbe, Erol
- Subjects
- *
GENE expression , *GENETIC regulation , *DNA microarrays , *YEAST , *STOCHASTIC models - Abstract
Background: The steady-state behaviour of gene regulatory networks (GRNs) can provide crucial evidence for detecting disease-causing genes. However, monitoring the dynamics of GRNs is particularly difficult because biological data only reflects a snapshot of the dynamical behaviour of the living organism. Also most GRN data and methods are used to provide limited structural inferences. Results: In this study, the theory of stochastic GRNs, derived from G-Networks, is applied to GRNs in order to monitor their steady-state behaviours. This approach is applied to a simulation dataset which is generated by using the stochastic gene expression model, and observe that the G-Network properly detects the abnormally expressed genes in the simulation study. In the analysis of real data concerning the cell cycle microarray of budding yeast, our approach finds that the steady-state probability of CLB2 is lower than that of other agents, while most of the genes have similar steady-state probabilities. These results lead to the conclusion that the key regulatory genes of the cell cycle can be expressed in the absence of CLB type cyclines, which was also the conclusion of the original microarray experiment study. Conclusion: G-networks provide an efficient way to monitor steady-state of GRNs. Our method produces more reliable results then the conventional t-test in detecting differentially expressed genes. Also G-networks are successfully applied to the yeast GRNs. This study will be the base of further GRN dynamics studies cooperated with conventional GRN inference algorithms. [ABSTRACT FROM AUTHOR]
- Published
- 2009
- Full Text
- View/download PDF
13. Genetic Algorithms for Route Discovery.
- Author
-
Gelenbe, Erol, Peixiang Liu, and Lamé, Jeremy
- Subjects
- *
GENETIC algorithms , *PACKET switching , *NETWORK routers , *COMPUTER networks , *QUALITY of service , *COMPUTER network architectures - Abstract
Packet routing in networks requires knowledge about available paths, which can be either acquired dynamically while the traffic is being forwarded, or statically (in advance) based on prior information of a network's topology. This paper describes an experimental investigation of path discovery using genetic algorithms (GAs). We start with the quality-of-service (QoS)-driven routing protocol called ‘cognitive packet network’ (CPN), which uses smart packets (SPs) to dynamically select routes in a distributed autonomic manner based on a user's QoS requirements. We extend it by introducing a GA at the source routers, which modifies and filters the paths discovered by the CPN. The GA can combine the paths that were previously discovered to create new untested but valid source-to-destination paths, which are then selected on the basis of their ‘fitness.’ We present an implementation of this approach, where the GA runs in background mode so as not to overload the ingress routers. Measurements conducted on a network test bed indicate that when the background-traffic load of the network is light to medium, the GA can result in improved QoS. When the background-traffic load is high, it appears that the use of the GA may be detrimental to the QoS experienced by users as compared to CPN routing because the GA uses less timely state information in its decision making. [ABSTRACT FROM AUTHOR]
- Published
- 2006
- Full Text
- View/download PDF
14. Learning in the Multiple Class Random Neural Network.
- Author
-
Gelenbe, Erol and Hussain, Khaled F.
- Subjects
- *
ALGORITHMS , *LEARNING , *ARTIFICIAL neural networks - Abstract
Introduces a learning algorithm which applied both to recurrent and feedforward multiple signal class random neural networks (MCRNN). Popularity of artificial neural networks; Mathematical model of the MCRNN; Formula for the learning algorithm.
- Published
- 2002
- Full Text
- View/download PDF
15. Area-Based Results for Mine Detection.
- Author
-
Gelenbe, Erol and Kocak, Tasak
- Subjects
- *
FALSE alarms , *MINE detection (Military explosives) - Abstract
Provides information on a study which considered two area-based methods for reducing false alarms of mine detection and unexploded ordnance. Effect of declaration on false alarms and receiver operation characteristic; Conclusions.
- Published
- 2000
- Full Text
- View/download PDF
16. Smart SDN Management of Fog Services to Optimize QoS and Energy.
- Author
-
Fröhlich, Piotr, Gelenbe, Erol, Fiołka, Jerzy, Chęciński, Jacek, Nowak, Mateusz, Filus, Zdzisław, and Skarmeta, Antonio
- Subjects
- *
SOFTWARE-defined networking , *ARTIFICIAL intelligence , *REACTION time , *MIMO systems , *REINFORCEMENT learning , *TIME-varying systems , *NUMBER systems , *INTERNET of things - Abstract
The short latency required by IoT devices that need to access specific services have led to the development of Fog architectures that can serve as a useful intermediary between IoT systems and the Cloud. However, the massive numbers of IoT devices that are being deployed raise concerns about the power consumption of such systems as the number of IoT devices and Fog servers increase. Thus, in this paper, we describe a software-defined network (SDN)-based control scheme for client–server interaction that constantly measures ongoing client–server response times and estimates network power consumption, in order to select connection paths that minimize a composite goal function, including both QoS and power consumption. The approach using reinforcement learning with neural networks has been implemented in a test-bed and is detailed in this paper. Experiments are presented that show the effectiveness of our proposed system in the presence of a time-varying workload of client-to-service requests, resulting in a reduction of power consumption of approximately 15% for an average response time increase of under 2%. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
17. Function Approximation with Spiked Random Networks.
- Author
-
Gelenbe, Erol and Mao, Zhi-Hong
- Subjects
- *
ARTIFICIAL neural networks , *APPROXIMATION theory - Abstract
Provides information on a study that examined the function approximation properties of the random neural-network model (GNN). Introduction of the GNN; Related models of GNN; Conclusions.
- Published
- 1999
- Full Text
- View/download PDF
18. Optimization of the Number of Copies in a Distributed Data Base.
- Author
-
Coffman Jr., Edward G., Gelenbe, Erol, and Plateau, Brigitte
- Subjects
- *
DISTRIBUTED databases , *DATABASES , *COMPUTER algorithms , *ALGORITHMS , *QUEUING theory , *SOFTWARE engineering - Abstract
We consider the effect on system performance of the distribution of a data base in the form of multiple copies at distinct sites. The purpose of our analysis is to determine the gain in READ throughput that can be obtained in the presence of consistency preserving algorithms that have to be implemented when UPDATE operations are carried out on each copy. We show that READ throughput diminishes if the number or copies exceeds an optimal value. The theoretical model we develop is applied to a system in which consistency is preserved through the use of Ellis' ring algorithm. [ABSTRACT FROM AUTHOR]
- Published
- 1981
- Full Text
- View/download PDF
19. Random Injection Control of Multiprogramming in Virtual Memory.
- Author
-
Gelenbe, Erol and Kurinckx, Alain
- Subjects
- *
VIRTUAL storage (Computer science) , *COMPUTER storage devices , *COMPUTER systems , *ELECTRONIC systems , *COMPUTER software , *SOFTWARE engineering - Abstract
We propose a new method for the control of a multiprogrammed virtual memory computer system. A mathematical model solved by decomposition permits us to justify that the method avoids thrashing. Simulation experiments are used to test the robustness of the predictions of the mathematical model when certain simplifying assumptions are relaxed and when a slightly simpler control technique based on the same principle is used. Comparisons are given with the case where an "optimal" control is used and with that with no control. We also provide a simulation evaluating the estimators used in an implementation of the control, as well as the responsiveness of the controlled system to transients in the workload. [ABSTRACT FROM AUTHOR]
- Published
- 1978
20. Task assignment and transaction clustering heuristics for distributed systems.
- Author
-
Aguilar, Jose and Gelenbe, Erol
- Subjects
- *
INTERNET - Abstract
Discusses the task assignment problem for distributed systems such as the Internet in the United States. Similarity to clustering transactions for load balancing purposes; Graph-theoretic representation and heuristics; Evaluation of genetic algorithms, simulated annealing, and three novel algorithms through neural networks.
- Published
- 1997
- Full Text
- View/download PDF
21. Scheduling of distributed tasks for survivability of the application.
- Author
-
Chabridon, Sophie and Gelenbe, Erol
- Subjects
- *
PARALLEL computers - Abstract
Presents the techniques in insuring the survivability and fault-tolerance of a distributed or parallel application in the presence of processor stoppages or failures in computers in the United States. Checkpointing and rollback recovery techniques; Analysis of robustness considerations for the model of Parallel Random Access Machine.
- Published
- 1997
- Full Text
- View/download PDF
22. Guest Editor's Introduction to the Special Issue On Neural Network Software and Systems.
- Author
-
Gelenbe, Erol
- Subjects
- *
ARTIFICIAL neural networks , *ARTIFICIAL intelligence , *COMPUTER software , *COMPUTER systems , *SOFTWARE engineering , *COMPUTER networks , *COMPUTER programming - Abstract
This guest editorial introduces a special issue of the periodical "IEEE Transactions on Software Engineering" which focuses on neural network software and systems. It outlines the history of artificial neural networks and their role in the origin of the theory of computing. The special issue addresses aspects of neural computation that are closely related to software engineering. The main problem at hand is the development of paradigms to deal effectively with the issues related to neural network programming. The papers in the issue highlight increasingly important issues of artificial neural network programming tools and systems, and suggest applications of neural networks to the diverse and difficult problems of software engineering.
- Published
- 1992
23. Introduction.
- Author
-
Gelenbe, Erol
- Subjects
- *
PERIODICALS , *SOFTWARE engineering , *PARALLEL computers , *DISTRIBUTED computing , *DIGITAL signal processing , *DIGITAL communications - Abstract
The October 1991 issue of the periodical "IEEE Transactions on Software Engineering," is devoted to research accomplishments in the area of parallel systems and architectures. It demonstrates the commitment of the periodical to the timely dissemination of advanced information on the performance of parallel systems. The papers featured cover important issues which have to be addressed to make parallel and distributed high-performance computing successful. It includes load balancing, performance evaluation methodology, predicting of response times from the detailed and realistic representation of task structures and digital signal applications.
- Published
- 1991
24. Size-Based Routing Policies: Non-Asymptotic Analysis and Design of Decentralized Systems †.
- Author
-
Bachmat, Eitan, Doncel, Josu, Gelenbe, Erol, and Calzarossa, Maria Carla
- Subjects
- *
QUEUING theory , *POLICY analysis , *QUALITY of service , *SPECIAL effects in lighting , *NUMBER systems - Abstract
Size-based routing policies are known to perform well when the variance of the distribution of the job size is very high. We consider two size-based policies in this paper: Task Assignment with Guessing Size (TAGS) and Size Interval Task Assignment (SITA). The latter assumes that the size of jobs is known, whereas the former does not. Recently, it has been shown by our previous work that when the ratio of the largest to shortest job tends to infinity and the system load is fixed and low, the average waiting time of SITA is, at most, two times less than that of TAGS. In this article, we first analyze the ratio between the mean waiting time of TAGS and the mean waiting time of SITA in a non-asymptotic regime, and we show that for two servers, and when the job size distribution is Bounded Pareto with parameter α = 1 , this ratio is unbounded from above. We then consider a system with an arbitrary number of servers and we compare the mean waiting time of TAGS with that of Size Interval Task Assignment with Equal load (SITA-E), which is a SITA policy where the load of all the servers are equal. We show that in the light traffic regime, the performance ratio under consideration is unbounded from above when (i) the job size distribution is Bounded Pareto with parameter α = 1 and an arbitrary number of servers as well as (ii) for Bounded Pareto distributed job sizes with α ∈ (0 , 2) \ { 1 } and the number of servers tends to infinity. Finally, we use the result of our previous work to show how to design decentralized systems with quality of service constraints. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
25. A Manifesto for Future Generation Cloud Computing: Research Directions for the Next Decade.
- Author
-
BUYYA, RAJKUMAR, SRIRAMA, SATISH NARAYANA, CASALE, GIULIANO, CALHEIROS, RODRIGO, SIMMHAN, YOGESH, VARGHESE, BLESSON, GELENBE, EROL, JAVADI, BAHMAN, VAQUERO, LUIS MIGUEL, NETTO, MARCO A. S., TOOSI, ADEL NADJARAN, RODRIGUEZ, MARIA ALEJANDRA, LLORENTE, IGNACIO M., DE CAPITANI DI VIMERCATI, SABRINA, SAMARATI, PIERANGELA, MILOJICIC, DEJAN, VARELA, CARLOS, BAHSOON, RAMI, DE ASSUNCAO, MARCOS DIAS, and RANA, OMER
- Subjects
- *
CLOUD computing , *ON-demand computing , *SOFTWARE-defined networking , *SCIENTIFIC computing , *INTERNET of things , *SOFTWARE reliability - Abstract
The Cloud computing paradigm has revolutionised the computer science horizon during the past decade and has enabled the emergence of computing as the fifth utility. It has captured significant attention of academia, industries, and government bodies. Now, it has emerged as the backbone of modern economy by offering subscription-based services anytime, anywhere following a pay-as-you-go model. This has instigated (1) shorter establishment times for start-ups, (2) creation of scalable global enterprise applications, (3) better cost-to-value associativity for scientific and high-performance computing applications, and (4) different invocation/execution models for pervasive and ubiquitous applications. The recent technological developments and paradigms such as serverless computing, software-defined networking, Internet of Things, and processing at network edge are creating new opportunities for Cloud computing. However, they are also posing several new challenges and creating the need for new approaches and research strategies, as well as the re-evaluation of the models that were developed to address issues such as scalability, elasticity, reliability, security, sustainability, and application models. The proposed manifesto addresses them by identifying the major open challenges in Cloud computing, emerging trends, and impact areas. It then offers research directions for the next decade, thus helping in the realisation of Future Generation Cloud Computing. [ABSTRACT FROM AUTHOR]
- Published
- 2019
- Full Text
- View/download PDF
26. A Sustainable Model for Integrating Current Topics in Machine Learning Research Into the Undergraduate Curriculum.
- Author
-
Georgiopoulos, Michael, DeMara, Ronald F., Gonzalez, Avelino J., Wu, Annie S., Mollaghasemi, Mansooreh, Gelenbe, Erol, Kysilka, Marcella, Secretan, Jimmy, Sharma, Carthik A., and Alnsour, Ayman J.
- Subjects
- *
CURRICULUM planning , *TEACHING models , *MACHINE learning , *COLLEGE curriculum , *COMPUTER science education - Abstract
This paper presents an integrated research and teaching model that has resulted from an NSF-funded effort to introduce results of current Machine Learning research into the engineering and computer science curriculum at the University of Central Florida (UCF). While in-depth exposure to current topics in Machine Learning has traditionally occurred at the graduate level, the model developed affords an innovative and feasible approach to expanding the depth of coverage in research topics to undergraduate students. The model has been self-sustaining as evidenced by its continued operation during the years after the NSF grant's expiration, and is transferable to other institutions due to its use of modular and faculty-specific technical content. This model offers a tightly coupled teaching and research approach to introducing current topics in Machine Learning research to undergraduates, while also involving them in the research process itself. The approach has provided new mechanisms to increase faculty participation in undergraduate research, has exposed approximately 15 undergraduates annually to research at UCF, and has effectively prepared a number of these students for graduate study through active involvement in the research process and coauthoring of publications. [ABSTRACT FROM AUTHOR]
- Published
- 2009
- Full Text
- View/download PDF
27. Efficient Feature Selection for Static Analysis Vulnerability Prediction.
- Author
-
Filus, Katarzyna, Boryszko, Paweł, Domańska, Joanna, Siavvas, Miltiadis, Gelenbe, Erol, and Larrucea, Xabier
- Subjects
- *
DATA mining software , *COMPUTER software quality control , *MACHINE learning , *STATISTICAL correlation , *FORECASTING - Abstract
Common software vulnerabilities can result in severe security breaches, financial losses, and reputation deterioration and require research effort to improve software security. The acceleration of the software production cycle, limited testing resources, and the lack of security expertise among programmers require the identification of efficient software vulnerability predictors to highlight the system components on which testing should be focused. Although static code analyzers are often used to improve software quality together with machine learning and data mining for software vulnerability prediction, the work regarding the selection and evaluation of different types of relevant vulnerability features is still limited. Thus, in this paper, we examine features generated by SonarQube and CCCC tools, to identify those that can be used for software vulnerability prediction. We investigate the suitability of thirty-three different features to train thirteen distinct machine learning algorithms to design vulnerability predictors and identify the most relevant features that should be used for training. Our evaluation is based on a comprehensive feature selection process based on the correlation analysis of the features, together with four well-known feature selection techniques. Our experiments, using a large publicly available dataset, facilitate the evaluation and result in the identification of small, but efficient sets of features for software vulnerability prediction. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
28. Comprehensive user requirements engineering methodology for secure and interoperable health data exchange.
- Author
-
Natsiavas, Pantelis, Rasmussen, Janne, Voss-Knude, Maja, Votis, Κostas, Coppolino, Luigi, Campegiani, Paolo, Cano, Isaac, Marí, David, Faiella, Giuliana, Clemente, Fabrizio, Nalin, Marco, Grivas, Evangelos, Stan, Oana, Gelenbe, Erol, Dumortier, Jos, Petersen, Jan, Tzovaras, Dimitrios, Romano, Luigi, Komnios, Ioannis, and Koutkias, Vassilis
- Subjects
- *
MEDICAL care , *COMPUTER crimes , *HEALTH information technology , *INTERNET security , *INTERNETWORKING , *COMPARATIVE studies , *RESEARCH methodology , *MEDICAL cooperation , *MEDICAL informatics , *RESEARCH , *SYSTEM analysis , *EVALUATION research , *DATA security , *ACQUISITION of data - Abstract
Background: Increased digitalization of healthcare comes along with the cost of cybercrime proliferation. This results to patients' and healthcare providers' skepticism to adopt Health Information Technologies (HIT). In Europe, this shortcoming hampers efficient cross-border health data exchange, which requires a holistic, secure and interoperable framework. This study aimed to provide the foundations for designing a secure and interoperable toolkit for cross-border health data exchange within the European Union (EU), conducted in the scope of the KONFIDO project. Particularly, we present our user requirements engineering methodology and the obtained results, driving the technical design of the KONFIDO toolkit.Methods: Our methodology relied on four pillars: (a) a gap analysis study, reviewing a range of relevant projects/initiatives, technologies as well as cybersecurity strategies for HIT interoperability and cybersecurity; (b) the definition of user scenarios with major focus on cross-border health data exchange in the three pilot countries of the project; (c) a user requirements elicitation phase containing a threat analysis of the business processes entailed in the user scenarios, and (d) surveying and discussing with key stakeholders, aiming to validate the obtained outcomes and identify barriers and facilitators for HIT adoption linked with cybersecurity and interoperability.Results: According to the gap analysis outcomes, full adherence with information security standards is currently not universally met. Sustainability plans shall be defined for adapting existing/evolving frameworks to the state-of-the-art. Overall, lack of integration in a holistic security approach was clearly identified. For each user scenario, we concluded with a comprehensive workflow, highlighting challenges and open issues for their application in our pilot sites. The threat analysis resulted in a set of 30 user goals in total, documented in detail. Finally, indicative barriers of HIT acceptance include lack of awareness regarding HIT risks and legislations, lack of a security-oriented culture and management commitment, as well as usability constraints, while important facilitators concern the adoption of standards and current efforts for a common EU legislation framework.Conclusions: Our study provides important insights to address secure and interoperable health data exchange, while our methodological framework constitutes a paradigm for investigating diverse cybersecurity-related risks in the health sector. [ABSTRACT FROM AUTHOR]- Published
- 2018
- Full Text
- View/download PDF
Catalog
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.