Question: Signal processing methods to enhance angular resolution in homodyne FMCW radar systems.

This document introduces an innovative millimeter-wave holographic radar system designed for automotive use, characterized by its straightforward architecture. This simplicity is achieved through the selective activation of both transmitting and receiving antennas. Additionally, a technique for super resolution is incorporated to enhance the precision of angular position detection within the radar system. Through experimental development, the radar has successfully achieved an azimuthal angular resolution below 2 degrees while maintaining an azimuthal field of view (FoV) in excess of 20 degrees concurrently.

In the proposed system, the switching mechanism between antennas plays a critical role in simplifying the radar's overall structure, making it more feasible for practical automotive integration. The super resolution technique, meanwhile, significantly improves the radar's ability to accurately determine the angular positions of objects in its environment. The experimental outcomes confirm the system's effectiveness in achieving high angular resolution and a broad field of view simultaneously, which are essential capabilities for advanced driver assistance systems (ADAS) and autonomous driving technologies.

In the wide-angle (WA) images embedded in an around-view monitor system, the subject(s) in the peripheral region is normally small and has little information. Furthermore, since the outer region suffers from the non-uniform blur phenomenon and artifact caused by the inherent optical characteristic of WA lenses, its visual quality tends to deteriorate. According to our experiments, conventional image enhancement techniques rarely improve the degraded visual quality of the outer region of WA images. In order to solve the above-mentioned problem, this paper proposes a joint sharpness enhancement (SE) and super-resolution (SR) algorithm which can improve the sharpness and resolution of WA images together. The proposed SE algorithm improves the sharpness of the deteriorated WA images by exploiting self-similarity. Also, the proposed SR algorithm generates super-resolved images by using high-resolution information which is classified according to the extended local binary pattern-based classifier and learned on a pattern basis. Experimental results show that the proposed scheme effectively improves the sharpness and resolution of the input deteriorated WA images. Even in terms of quantitative metrics such as just noticeable blur, structural similarity, and peak signal-to-noise ratio. Finally, the proposed scheme guarantees real-time processing such that it achieves 720p video at 29 Hz on a low cost GPU platform.

For effective speech processing in an automotive environment, speech enhancement is necessary due to significant levels of background noise. In this paper, we present a cost effective small footprint implementation of one particular speech enhancement technique: dual microphone delay-and-sum beamforming. In order to save resources, the implementation utilizes the overlapping frame property used in speech processing systems. The implementation also exhibits a simple interconnection structure leading to even greater resource saving. Experiment results show that the proposed design can produce enhanced output very close to that generated by a theoretical (floating-point) model while only requiring a modest hardware resource usage.

The radar signatures of automotive targets were measured from 22 to 29 GHz and 76 to 81 GHz inside an anechoic chamber using a vector network analyzer. Radar cross section maps of a sedan, truck, van, pedestrian, motorcycle, and bicycle as a function of effective radar sensor bandwidth, center frequency, and polarization are presented.

Millimeter-wave anti-collision radars have been widely investigated in advanced CMOS technologies recently. This paper presents a fully integrated 77GHz FMCW radar system in 65nm CMOS. The FMCW radar transmits a continuous wave which is triangularly modulated in frequency and receives the wave reflected from objects. As can be illustrated in Fig. 11.2.1, for a moving target, the received frequency would be shifted (i.e. Doppler shift), resulting in two different offset frequencies f + and f− for the falling and rising ramps. Denoting the modulation range and period as B and Tm, respectively, we can derive the distance R and the relative velocity VR as listed in Fig. 11.2.1, where fc represents the center frequency and c the speed of light.

Multiple-Input and Multiple-Output (MIMO) arrays provide more degrees of freedom than conventional phased arrays. They require that every transmitting element of the array can be identified when received. One way to achieve this is to give every element its own unique frequency. Offset-transmitters may be used to introduce MIMO or Doppler Division Multiple Access (DDMA) into phased-arrays without an excessive increase in waveform-generating hardware. Our dual-channel demonstrator IC can obtain a phase accuracy better than 1 degree and an spurious level of better than -65dBc for a single on-chip channel. This work investigates at X-band the effects of the limited on-chip isolation of 35dB, when multiple offset outputs are generated on a single chip for both beam steering and DDMA. In case of beam steering, the requirements on channel-to-channel isolation are less strict, making it well within reach. In the case of DDMA, we recommend increasing the channel-to-channel isolation by implementing multiple chips, in which case independent signals can be generated.

This paper presents a synthetic aperture radar (SAR) imaging system using a stepped frequency waveform. The main problem in stepped frequency SAR is the range difference in one sequence of pulses. This paper analyzes the influence of range difference in one sequence of pulses in detail and proposes a method to compensate this influence in the Doppler domain. A Stolt interpolation for the stepped frequency signal is used to focus the data accurately. The parameters for the stepped frequency SAR are analyzed, and some criteria are proposed for system design. Finally, simulation and experimental results are presented to demonstrate the validity of the proposed method. The experimental data are collected by using a stepped frequency radar mounted on a rail.

We are developing a probabilistic technique for performing multiple target detection and localization based on data from a swarm of flying sensors, for example to be mounted on a group of micro-UAVs (unmanned aerial vehicles). Swarms of sensors can facilitate detecting and discriminating low signal-to-clutter targets by allowing correlation between different sensor types and/or different aspect angles. However, for deployment of swarms to be feasible, UAVs must operate more autonomously. The current approach is designed to reduce the load on humans controlling UAVs by providing computerized interpretation of a set of images from multiple sensors. We consider a complex case in which target detection and localization are performed concurrently with sensor fusion, multi-target signature association, and improved UAV navigation. This method yields the bonus feature of estimating precise tracks for UAVs, which may be applicable for automatic collision avoidance. We cast the problem in a probabilistic framework known as modeling field theory (MFT), in which the pdf of the data is composed of a mixture of components, each conditional upon parameters including target positions as well as sensor kinematics. The most likely set of parameters is found by maximizing the log-likelihood function using an iterative approach related to expectation-maximization. In terms of computational complexity, this approach scales linearly with number of targets and sensors, which represents an improvement over most existing methods. Also, since data association is treated probabilistically, this method is not prone to catastrophic failure if data association is incorrect. Results from computer simulations are described which quantitatively show the advantages of increasing the number of sensors in the swarm, both in terms of clutter suppression and more accurate target localization. 2005 Elsevier B.V. All rights reserved.

In this paper, a new single element broad band cavity backed multi-layer microstrip patch antenna is presented. This antenna is designed to be used in 79 GHz MIMO radar applications, and is fabricated with advanced high resolution multi-layer PCB technology. It has a wide bandwidth of 11.43 GHz, which is 14.5% of the center frequency. The beam widths in both E and H-planes are very wide, and are 144 degrees and 80 degrees respectively. Also, the antenna gain and efficiency are respectively 4.7 dB and 87%. Furthermore, measurements have been done, and show a good agreement with simulations.

Autonomous vehicles must often navigate environments that are at least partially unknown. They are faced with the tasks of creating a coordinate system to localize themselves on, identify the positions of obstacles, and chart safe paths through the environment. This process is known as Simultaneous Localization and Mapping, or SLAM. SLAM has traditionally been executed using measurements of distance to features in the environment. We propose an angle based methodology using a single phased array antenna and DSP.aimed to reduce this requirement to a single path for each data type. Additionally, our method makes use of rudimentary echo-location to discover reflective obstacles. Finally, our method uses Voronoi Tessellation for path planning.

Depth cameras are a ubiquitous technology used in a wide range of applications, including robotic and machine vision, human-computer interaction, autonomous vehicles as well as augmented and virtual reality. In this paper, we explore the design and applications of phased multi-camera time-of-flight (ToF) systems. We develop a reproducible hardware system that allows for the exposure times and waveforms of up to three cameras to be synchronized. Using this system, we analyze waveform interference between multiple light sources in ToF applications and propose simple solutions to this problem. Building on the concept of orthogonal frequency design, we demonstrate state-of-the-art results for instantaneous radial velocity capture via Doppler time-of-flight imaging and we explore new directions for optically probing global illumination, for example by de-scattering dynamic scenes and by non-line-of-sight motion detection via frequency gating.


Question: Advancing an information security framework specifically for the automotive industry.

The Evolution of Security and Safety Integration in the Automotive Industry

The escalating sophistication of automotive systems, coupled with their integration into external networks and the internet of things, has significantly amplified the risk of cyber-attacks and hacking. The vulnerabilities and potential consequences of security breaches in contemporary automotive systems are now widely recognized. It is well-established that a breach of security can precipitate safety violations. While the field of safety has evolved over time, security remains a relatively nascent discipline. Arguments have been made that the methodologies of security engineering are akin to those of functional safety engineering, as codified by ISO 26262, and that they should be executed concurrently but by specialized teams. Efforts are underway to delineate a security engineering process that parallels the functional safety engineering process for automotive systems. However, is formalizing the integration of safety and security sufficient to ensure the production of safe and secure vehicles? Upon embarking on this endeavor with the aim of creating such systems, it becomes apparent that numerous challenges, inconsistencies, and concerns must be addressed prior to the manufacture of truly safe and secure systems. This paper endeavors to highlight some of these critical challenge areas and propose a roadmap for the industry to navigate these complexities effectively.

Automotive UWB (Ultra-Wideband) short range radar (SSR) is on the market as a key technology for novel comfort and safety systems. SiGe based 79 GHz UWB SRR will be a definite candidate for the long term substitution of the 24 GHz UWB SRR. This paper will give an overview of the finished BMBF joint project KOKON and the recently started successing project RoCC, which concentrate on the development of this technology and sensor demonstrators. In both projects, the responsibilities of Daimler AG deal with application based sensor specification, test and evaluation of realized sensor demonstrators. Recent UWB SRR frequency regulation approaches and activitites will be introduced. Furthermore, some first results of Daimler activities within RoCC will be presented, dealing with the packaging and operation of these sensors within the complex car environment.

Internet of Things is an up-and-coming information and technology industry, and in such an environment of the concept and the content and the extension of Internet of Things are not very distinctive, the project of Internet of Things which is a piece of small area with small-scale and self-system obtain gratifying achievement and bright future, it can promote the development of Internet of Things in some extent. But there are some serious hidden danger and potential crisis problems. The paper focuses on the application of Internet of Things in the nation and even in the global in the future, analysing the existed security risks of the Internet of Things 's network points, transmission, finally we propose some suggestive solutions due to these problems.

Testing automation tools enable developers and/or testers to easily automate the entire process of testing in software development. Nevertheless, adopting automated testing is not easy and unsuccessful due to a lack of key information and skills. In order to help solve such problems, we have designed a new framework to support a clear overview of the test design and/or plan for automating tests in distributed environments. Those that are new to testing do not need to delve into complex automation tools or test scripts. This framework allows a programmer or tester to graphically specify the granularity of execution control and aids communication between various stakeholders and software developers. It also enables them to perform the automated Continuous Integration environment. In this paper, we describe details on experiences and usage of the proposed framework.

Concerns about information security and privacy continue to make headlines in the media and rate as serious issues in business and public surveys. Conventional thinking suggests that enhancements to governance models and business practices improve the performance of individual businesses. However, is this enough? Good governance is based on clear rights and responsibilities, and this panel will address the contention that such clarity is lacking in the treatment of personal information. As a result, certain types of business innovation may be constrained and good practices may remain tick box exercises, disconnected from wider business objectives. More radical thinking would go beyond incremental improvements to the status quo and recognize the profound challenges to privacy and information security created by digital technology. This panel will bring together a range of research disciplines and senior business representatives to critique current practice and develop a future research agenda.

Traditionally, the vehicle has been the extension of the man's ambulatory system, docile to the driver's commands. Recent advances in communications, controls and embedded systems have changed this model, paving the way to the Intelligent Vehicle Grid. The car is now a formidable sensor platform, absorbing information from the environment (and from other cars) and feeding it to drivers and infrastructure to assist in safe navigation, pollution control and traffic management. The next step in this evolution is just around the corner: the Internet of Autonomous Vehicles. Pioneered by the Google car, the Internet of Vehicles will be a distributed transport fabric capable to make its own decisions about driving customers to their destinations. Like other important instantiations of the Internet of Things (e.g., the smart building), the Internet of Vehicles will have communications, storage, intelligence, and learning capabilities to anticipate the customers' intentions. The concept that will help transition to the Internet of Vehicles is the Vehicular Cloud, the equivalent of Internet cloud for vehicles, providing all the services required by the autonomous vehicles. In this article, we discuss the evolution from Intelligent Vehicle Grid to Autonomous, Internet-connected Vehicles, and Vehicular Cloud.

Mobile road works on the hard shoulder of German highways bear an increased accident risk for the crew of the protective vehicle which safeguards road works against moving traffic. The project “Automated Unmanned Protective Vehicle for Highway Hard Shoulder Road Works” aims at the unmanned operation of the protective vehicle in order to reduce this risk. Simultaneously, this means the very first unmanned operation of a vehicle on German roads in public traffic. This contribution introduces the project by pointing out the main objectives and demonstrates the current state of the system design regarding functionality, modes of operation, as well as the functional system architecture. Pivotal for the project, the scientific challenges raised by the unmanned operation - strongly related to the general challenges in the field of automated driving - are presented as well. The results of the project shall serve as a basis to stimulate an advanced discussion about ensuring safety for fully automated vehicles in public traffic operating at higher speeds and in less defined environments. Thus, this contribution aims at contacting the scientific community in an early state of the project.

Reports about serious vulnerabilities in critical IT components have triggered increased focus on cybersecurity worldwide. Among the man y initiatives to strengthen cybersecurity it is common to see the establishment and stre gthening of CERTs and other centers for cybersecurity. On the other hand , strengthening education in IT security and applying methods for secure systems d velopment are methods that receive much less attention. In this paper we expla in how the lack of focus on security in IT education programs worldwide is a signifi cant contributor to security vulnerabilities, and we propose an agile method for s ecure software design that requires team members to have received adequa te security education and training.

The Internet of Things (IoT) will connect not only computers and mobile devices, but it will also interconnect smart buildings, homes, and cities, as well as electrical grids, gas, and water networks, automobiles, airplanes, etc. IoT will lead to the development of a wide range of advanced information services that need to be processed in real-time and require data centers with large storage and computing power. The integration of IoT with Cloud and Fog Computing can bring not only the required computational power and storage capacity, but they enable IoT services to be pervasive, cost-effective, and can be accessed from anywhere using any device (mobile or stationary). However, IoT infrastructures and services will introduce grand security challenges due to the significant increase in the attack surface, complexity, heterogeneity and number of resources. In this paper, we present an IoT security framework for smart infrastructures such as Smart Homes (SH) and smart buildings (SB). We also present a general threat model that can be used to develop a security protection methodology for IoT services against cyber-attacks (known or unknown). Additionally, we show that Anomaly Behavior Analysis (ABA) Intrusion Detection System (ABA-IDS) can detect and classify a wide range of attacks against IoT sensors.

Automatic Dependent Surveillance-Broadcast (ADS-B) is a surveillance system used in Air Traffic Control. With this system, the aircraft transmits their own information (identity, position, velocity, etc.) to any equipped listener for surveillance scope. The ADS-B is based on a very simple protocol and does not provide any kind of authentication and encryption, making it vulnerable to many types of cyber-attacks. In the paper, the use of the airplane/transmitter carrier phase is proposed as a feature to perform a classification of the aircraft and, therefore, distinguish legitimate messages from fake ones. The feature extraction process is described and a classification method is selected. Finally, a complete intruder detection algorithm is proposed and evaluated with real data.

As a component of the intelligent transportation system (ITS) and one of the concrete applications of mobile ad hoc networks, inter-vehicle communication (IVC) has attracted research attention from both the academia and industry of, notably, US, EU, and Japan. The most important feature of IVC is its ability to extend the horizon of drivers and on-board devices (e.g., radar or sensors) and, thus, to improve road traffic safety and efficiency. This paper surveys IVC with respect to key enabling technologies ranging from physical radio frequency to group communication primitives and security issues. The mobility models used to evaluate the feasibility of these technologies are also briefly described. We focus on the discussion of various MAC protocols that seem to be indispensable components in the network protocol stack of IVC. By analyzing the application requirements and the protocols built upon the MAC layer to meet these requirements, we also advocate our perspective that ad hoc routing protocols and group communication primitives migrated from wired networks might not be an efficient way to support the envisioned applications, and that new coordination algorithms directly based on MAC could be designed for this purpose.


Question: Advancing an information security framework specifically for the automotive industry.

This paper presents a thorough investigation into the external attack surfaces of contemporary automobiles, revealing their susceptibility to remote compromise. Despite previous research highlighting the vulnerability of internal networks in modern cars, the requirement for physical access has been seen as an unlikely scenario. Our study challenges this assumption by demonstrating that automobiles can indeed be remotely exploited through various attack vectors. We uncover that remote attacks are possible through mechanisms such as mechanics tools, CD players, Bluetooth, and cellular radios. Moreover, these wireless channels enable long-range vehicle control, location tracking, audio eavesdropping, and vehicle theft. The paper delves into the systemic factors within the automotive ecosystem that contribute to these vulnerabilities and the difficulties in addressing them effectively. Our findings underscore the need for a comprehensive information security framework tailored to the automotive domain, addressing the unique challenges posed by the interconnectedness of modern vehicles.

We are currently living in an age, where the use of the Internet has become second nature to millions of people. Not only do businesses depend on the Internet for all types of electronic transactions, but more and more home users are experiencing the immense benefit of the Internet. However, this dependence and use of the Internet bring new and dangerous risks. This is due to increasing attempts from unauthorised third parties to compromise private information for their own benefit – the whole wide area of cyber crime. It is therefore essential that all users understand the risks of using the Internet, the importance of securing their personal information and the consequences if this is not done properly. It is well known that home users are specifically vulnerable, and that cyber criminals have such users squarely in their target. This vulnerability of home users are due to many factors, but one of the most important ones is the fact that such home users are in many cases not aware of the risks of using the Internet, and often venture into cyber space without any awareness preparation for this journey. This paper specifically investigates the position of the home user, and proposes a new model, The E-Awareness Model (E-AM), in which home users can be forced to acquaint themselves with the risks involved in venturing into cyber space. The E-AM consists of two components : the awareness component housed in the E-Awareness Portal, and the enforcement component. This model proposes a way to improve information security awareness amongst home users by presenting some information security content and enforcing the absorption of this content. The main difference between the presented model and other existing information security awareness models, is that in the presented model the acquiring/absorption of the awareness content is compulsory the user is forced to proceed via the E-Awareness Portal without the option of bypassing it.

Advance Driver Assistance Systems (ADAS), once limited to high end luxury automobiles are fast becoming popular with Mid and entry level segments driven in part by legislation coming in to effect in the latter part of this decade. These systems require support for a wide variety of applications, from surround-view visual systems to safety critical vision applications (eg Pedestrian Detect, automatic braking etc). In this white paper we describe some of the existing and emerging trends and applications in each of these segments along with the requirements and motivations for each of these features. We also highlight TI's automotive class TDA2x device, a state of the art automotive grade device capable of handling complex ADAS applications within a low power and cost budget.

Fully autonomous driving is one if not the killer application for the upcoming decade of real-time systems. However, in the presence of increasingly sophisticated attacks by highly skilled and well equipped adversarial teams, autonomous driving must not only guarantee timeliness and hence safety. It must also consider the dependability of the software concerning these properties while the system is facing attacks. For distributed systems, fault-and-intrusion tolerance toolboxes already offer a few solutions to tolerate partial compromise of the system behind a majority of healthy components operating in consensus. In this paper, we present a concept of an intrusion-tolerant architecture for autonomous driving. In such a scenario, predictability and recovery challenges arise from the inclusion of increasingly more complex software on increasingly less predictable hardware. We highlight how an intrusion tolerant design can help solve these issues by allowing timeliness to emerge from a majority of complex components being fast enough, often enough while preserving safety under attack through pre-computed fail safes.

We trace in pragmatic terms some of what we know about knowledge, information technology, knowledge management practice and research, and provide two complementary frameworks that highlight potential opportunities for building a research agenda in this area. The papers in this special issue are then discussed.

The proposed security development lifecycle (SecDLC) model delivers a perpetual cycle of information security management and refinement. Using real-world examples, the authors show how SecDLC ensures the goals of preserving, monitoring, and improving security practices, policies, and standards in private and public sectors. The authors describe the four phases of SecDLC, comparing and contrasting them to existing security development models.

Modern Industrial Control Systems (ICS) rely on enterprise to plant floor connectivity. Where the size, diversity, and therefore complexity of ICS increase, operational requirements, goals, and challenges defined by users across various sub-systems follow. Recent trends in Information Technology (IT) and Operational Technology (OT) convergence may cause operators to lose a comprehensive understanding of end-to-end data flow requirements. This presents a risk to system security and resilience. Sensors were once solely applied for operational process use, but now act as inputs supporting a diverse set of organisational requirements. If these are not fully understood, incomplete risk assessment, and inappropriate implementation of security controls could occur. In search of a solution, operators may turn to standards and guidelines. This paper reviews popular standards and guidelines, prior to the presentation of a case study and conceptual tool, highlighting the importance of data flows, critical data processing points, and system-to-user relationships. The proposed approach forms a basis for risk assessment and security control implementation, aiding the evolution of ICS security and resilience.

Threat classification is extremely important for organizations, as it is an important step towards implementation of information security. Most of the existing threat classifications listed threats in static ways without linking threats to information system areas. The aim of this paper is to design a methodology that can classify deliberate threats in a dynamic way to represent each threat in different areas of the information system. This technique is based on the following factors: the attacker's prior knowledge (i. e. the knowledge hold by the source of the threat) about the system, loss of security information and the criticality of the area that might be affected by that threat.

a r t i c l e i n f o Security countermeasures help ensure the confidentiality, availability, and integrity of information systems by preventing or mitigating asset losses from Cybersecurity attacks. Due to uncertainty, the financial impact of threats attacking assets is often difficult to measure quantitatively, and thus it is difficult to prescribe which countermeasures to employ. In this research, we describe a decision support system for calculating the uncertain risk faced by an organization under cyber attack as a function of uncertain threat rates, countermeasure costs, and impacts on its assets. The system uses a genetic algorithm to search for the best combination of countermeasures, allowing the user to determine the preferred tradeoff between the cost of the portfolio and resulting risk. Data collected from manufacturing firms provide an example of results under realistic input conditions. Assuring a secure information technology (IT) environment for the transaction of commerce is a major concern. The magnitude of the task is growing yearly, as attackers become more knowledgeable, more determined, and bolder in their efforts. According to a lead security expert at International Data Corporation, a global provider of market intelligence and advisory services for the IT community, " Emerging new attack vectors, more targeted campaigns, compliance, and the layering of new technologies on the corporate infrastructure are all factors having a tremendous impact on the overall risk to an organization " [21]. Given that corporate expenditures are usually a good indicator of the level of concern about an issue, security is obviously near the top of many IT executives' lists. According to IDC, the global market for providers of information security services is projected to exceed $32.5 billion in 2010 [21]. The New York Times recently noted that " the intrusion into Google's computers and related attacks from within China on some thirty other companies point to the rising sophistication of such assaults and the vulnerability of even the best defenses " [25]. The Times further states that, according to the Computer Security Institute, malware infections are up from one-half to almost two-thirds of companies surveyed last year, at an average cost of $235,000 for each organization. Finally, the newspaper observes, malware is being exploited in new terrains with malicious code that turns on cellphone microphones and cameras for the purpose of industrial spying [25]. Because of the variety of methods attackers use to try to infiltrate and disrupt …

The use of digital technology is growing at a very fast pace which led to the emergence of systems based on the cognitive infocommunications. The expansion of this sector impose the use of combining methods in order to ensure the robustness in cognitive systems.

Resource and information protection plays a relevant role in distributed systems like the ones present in the Internet of Things (IoT). Authorization frameworks like RBAC and ABAC do not provide scalable, manageable, effective, and efficient mechanisms to support distributed systems with many interacting services and are not able to effectively support the dynamicity and scaling needs of IoT contexts that envisage a potentially unbound number of sensors, actuators and related resources, services and subjects, as well as a more relevance of short-lived, unplanned and dynamic interaction patterns. Furthermore, as more end-users start using smart devices (e.g. smart phones, smart home appliances, etc.) the need to have more scalable, manageable, understandable and easy to use access control mechanisms increases. This paper describes a capability based access control system that enterprises, or even individuals, can use to manage their own access control processes to services and information. The proposed mechanism supports rights delegation and a more sophisticated access control customization. The proposed approach is being developed within the European FP7 IoT@Work project to manage access control to some of the project’s services deployed in the shop floor.


Question: Advancing an information security framework tailored for the automotive sector.

This paper explores the escalating landscape of security threats to automotive systems, particularly those reliant on Controller Area Network (CAN) bus technology, and proposes immediate countermeasures to address these vulnerabilities. Through a series of practical experiments, we scrutinized the security of contemporary automotive control systems, focusing on the window lift, warning light, airbag control, and central gateway systems. The outcomes of these tests are meticulously analyzed, and the attack scenarios are categorized using the CERT taxonomy. This taxonomy provides a framework for understanding the underlying security flaws and their potential impact on safety. In response to these findings, we present two immediate defensive strategies: enhanced intrusion detection and IT-forensic measures. The intrusion detection enhancements include three specific detection patterns, while the IT-forensic measures are based on a proactive forensic model. Both these strategies are evaluated in the context of the four attack scenarios, highlighting their respective strengths and limitations. These short-term solutions can be readily integrated into existing automotive IT architectures to mitigate basic weaknesses. Additionally, the paper outlines long-term concepts that are primarily preventative in nature but necessitate a comprehensive redesign of automotive IT systems. We also provide an overview of relevant research approaches, discussing their requirements, potential benefits, and constraints. These insights are crucial for developing a robust information security framework tailored to the automotive domain, ensuring the safety and integrity of modern vehicles. & 2010 Elsevier Ltd. All rights reserved.

Machine Learning, and in particular Deep Learning, are extremely capable tools for solving problems which are difficult, or intractable to tackle analytically. Application areas include pattern recognition, computer vision, speech and natural language processing. With the automotive industry aiming for increasing amount of automation in driving, the problems to solve become increasingly complex, which appeals to the use of supervised learning methods from Machine Learning and Deep Learning. With this approach, solutions to the problems are learned implicitly from training data, and inspecting their correctness is not possible directly. This presents concerns when the resulting systems are used to support safety-critical functions, as is the case with autonomous driving of automotive vehicles. This thesis studies the safety concerns related to learning systems within autonomous driving and applies a safety monitoring approach to a collision avoidance scenario. Experiments are performed using a simulated environment, with a deep learning system supporting perception for vehicle control, and a safety monitor for collision avoidance. The related operational situations and safety constraints are studied for an autonomous driving function, with potential faults in the learning system introduced and examined. Also, an example is considered for a measure that indicates trustworthiness of the learning system during operation.

Inter-vehicular communication is an important research area that is rapidly growing due to considerable advances in mobile and wireless communication technologies, as well as the growth of microprocessing capabilities inside today’s cars, and other moving vehicles. A good amount of research has been done to exploit the different services that can be provided to enhance the safety and comfort of the driver. Additional functions provide the car electronics and the passengers with access to the Internet and other core network resources. This paper provides a survey of the latest advances in the area of inter-vehicular communication (IVC) including vehicle-to-vehicle (V2V) and vehicle-to-infrastructure (V2I) functions and services. In addition, the paper presents the most important projects and protocols that are involved in IVC systems as well as the different issues and challenges that exist at each layer of the networking model.

Recently, ‘Industry 4.0’ has become the supporting force in the manufacturing field. From CPS to Industry 4.0, they are leading a new round of industrial revolution. To meet the fourth industrial revolution, USA, European countries, Japan, South Korea and China have presented different versions of the so-called ‘Industry 4.0’ strategies respectively, which are different from each other in the content, but their common goal is to achieve manufacturing structural adjustment and restructuring and upgrading, to seize a place for future manufacturing, to provide users with better service. What is more, we summarised the five major trends of the future manufacturing. Then, we introduce some enabling technologies about Industry 4.0, among them, CPS plays a key role in the Industry 4.0 factory. Based on the customer to business (C2B) mode, we regard everything as a service, and propose a structure of Industry 4.0. Finally, the automotive industry as an example, we make a brief introduction about an Industry 4.0 case. [Received 15 December 2015; Revised 30 May 2016; Accepted 30 May 2016]

The Internet of Things is currently getting significant interest from the scientific community. Academia and industry are both focused on moving ahead in attempts to enhance usability, maintainability, and security through standardization and development of best practices.We focus on security because of its impact as one of themost limiting factors to wider Internet ofThings adoption. Numerous research areas exist in the security domain, ranging from cryptography to network security to identitymanagement.This paper provides a survey of existing research applicable to the Internet of Things environment at the application layer in the areas of identity management, authentication, and authorization. We survey and analyze more than 200 articles, categorize them, and present current trends in the Internet of Things security domain.

Editor: Peter Anderson Rochester Institute of Technology 1 Lomb Memorial Dr. Rochester, NY 14623 pga@cs.rit.edu Each technique receives similar coverage, including a description of its new and prerequisite vocabulary, its model, the bug assumptlons that underlie its effectiveness, typical applications, examples (almost all based on standard IRS tax forms), caveats and limitations, automation and tools for the technique, a self-evaluation quiz, and exercises. Common threads in the presentation show the role

The "Internet of Things"(IoT) opens opportunities for devices and softwares to share information on an unprecedented scale. However, such a large interconnected network poses new challenges to system developers and users. In this article, we propose a layered architecture of IoT system. Using this model, we try to identify and assess each layer's challenges. We also discuss several existing technologies that can be used make this architecture secure.

This paper aims to highlight vision related tasks centered around “car”, which has been largely neglected by vision community in comparison to other objects. We show that there are still many interesting car-related problems and applications, which are not yet well explored and researched. To facilitate future car-related research, in this paper we present our on-going effort in collecting a large-scale dataset, “CompCars”, that covers not only different car views, but also their different internal and external parts, and rich attributes. Importantly, the dataset is constructed with a cross-modality nature, containing a surveillance-nature set and a web-nature set. We further demonstrate a few important applications exploiting the dataset, namely car model classification, car model verification, and attribute prediction. We also discuss specific challenges of the car-related problems and other potential applications that worth further investigations. The latest dataset can be downloaded at http://mmlab.ie.cuhk.edu.hk/ datasets/comp_cars/index.html.

Value of software log file analysis has been constantly increasing with the value of information to organizations. Log management tools still have a lot to deliver in order to empower their customers with the true strength of log information. In addition to the traditional uses such as testing software functional conformance, troubleshooting and performance benchmarking, log analysis has proven its capabilities in fields like intrusion detection and compliance evaluation. This is verified by the emphasis on log analysis in regulations like PCI DSS, FISMA, HIPAA and frameworks such as ISO 27001 and COBIT. In this paper we present an in depth analysis into current log analysis domains and common problems. A practical guide to the use of few popular log analysis tools is also included. Lack of proper support for structured analysis is identified as one major flaw in existing tools. After that, we describe a framework we developed for structured log analysis with the view of providing a solution to open problems in the domain. The core strength of the framework is its ability to handle many log file formats that are not well served by existing tools and providing sophisticated infrastructure for automating recurring log analysis procedures. We prove the usefulness of the framework with a simple experiment.

This study explores, in the context of semiautonomous driving, how the content of the verbalized message accompanying the car’s autonomous action affects the driver’s attitude and safety performance. Using a driving simulator with an auto-braking function, we tested different messages that provided advance explanation of the car’s imminent autonomous action. Messages providing only “how” information describing actions (e.g., “The car is braking”) led to poor driving performance, whereas “why” information describing reasoning for actions (e.g., “Obstacle ahead”) was preferred by drivers and led to better driving performance. Providing both “how and why” resulted in the safest driving performance but increased negative feelings in drivers. These results suggest that, to increase overall safety, car makers need to attend not only to the design of autonomous actions but also to the right way to explain these actions to the drivers.

We survey promising directions for research in the area of formal methods and its applications, including fundamental questions about the combination of formal methods and machine learning, and applications to cyberphysical systems and education.


Question: Advancing an information security framework specifically for the automotive domain.

This study showcases relay attacks on Passive Keyless Entry and Start (PKES) systems, prevalent in contemporary vehicles, illustrating how these systems can be compromised. Two practical and affordable attack methods, wired and wireless physical-layer relays, are developed to enable an attacker to gain unauthorized entry and ignition capability by forwarding messages between the vehicle and the smart key. These relays operate independently of modulation techniques, protocols, and the presence of strong authentication or encryption. An exhaustive assessment on a diverse range of 10 car models from 8 manufacturers reveals that the attack can be executed effectively by relaying signals in a single direction, from the vehicle to the key, even when the actual distance between the key and the vehicle is substantial (tested up to 50 meters without direct line of sight). Moreover, the research indicates that a smart key can be activated from a distance of up to 8 meters, eliminating the need for the attacker to be in close proximity to the key for initiating the relay. The study delves into critical system attributes and suggests that PKES systems with similar design principles are likely to be susceptible to the same form of attack. As a concluding point, immediate countermeasures are proposed to reduce the risk of relay attacks, alongside emerging solutions that aim to thwart such attacks while preserving the user convenience that PKES systems were originally designed to provide.

The deployment of building automation systems (BAS) allows to increase comfort, safety and security and to reduce operational cost. Today such systems typically follow a two-layered hierarchical approach. While control networks interconnect distributed sensors, actuators and controllers, a backbone provides the necessary infrastructure for management tasks hosted by configuration and management devices. In addition, devices interconnecting the control network with the backbone and the backbone with further networks (e.g., the Internet) play a strategic role. All BAS devices contributing to a particular functionality differ in their requirements for hardware. This paper discusses requirements for devices used in the building automation domain and presents our work in progress to assemble platforms with different purposes relying on a modular architecture.

Advance Driver Assistance Systems (ADAS), once limited to high end luxury automobiles are fast becoming popular with Mid and entry level segments driven in part by legislation coming in to effect in the latter part of this decade. These systems require support for a wide variety of applications, from surround-view visual systems to safety critical vision applications (eg Pedestrian Detect, automatic braking etc). In this white paper we describe some of the existing and emerging trends and applications in each of these segments along with the requirements and motivations for each of these features. We also highlight TI's automotive class TDA2x device, a state of the art automotive grade device capable of handling complex ADAS applications within a low power and cost budget.

Editor: Peter Anderson Rochester Institute of Technology 1 Lomb Memorial Dr. Rochester, NY 14623 pga@cs.rit.edu Each technique receives similar coverage, including a description of its new and prerequisite vocabulary, its model, the bug assumptlons that underlie its effectiveness, typical applications, examples (almost all based on standard IRS tax forms), caveats and limitations, automation and tools for the technique, a self-evaluation quiz, and exercises. Common threads in the presentation show the role

Network and application vulnerability assessments have a tendency to be difficult and costly; however, failing to have an assessment done and fixing security loopholes may result in a security breach by malicious attackers. A security breach can cost an organization time and money remediating the damage, such as lost confidential business information, which far exceeds the cost of a security assessment. Our solution for this problem is a semi-automated system that can help a penetration tester, security professional, or systems administrator, scan and report on the vulnerabilities of a network and services running on the network. It is also able to perform some simulated attacks. This system relies on a miniaturized computer to host the necessary components to conduct a security assessment. This system has been done in an open source manner to allow others to contribute and benefit from a community effort in the name of security.

IoT is going to be an established part of life by extending the communication and networking anytime, anywhere. Security requirements for IoT will certainly underline the importance of properly formulated, implemented, and enforced security policies throughout their life-cycle. This paper gives a detailed survey and analysis of embedded security, especially in the area of IoT. Together with the conventional security solutions, the paper highlights the need to provide in-built security in the device itself to provide a flexible infrastructure for dynamic prevention, detection, diagnosis, isolation, and countermeasures against successful breaches. Based on this survey and analysis, the paper defines the security needs taking into account computational time, energy consumption and memory requirements of the devices. Finally, this paper proposes an embedded security framework as a feature of software/hardware co-design methodology.

There are currently many problems with the development and assessment of software intensive safety-critical systems. In this paper we describe the problems, and introduce a novel approach to their solution, based around goal-structuring concepts, which we believe will ameliorate some of the difficulties. We discuss the use of modified and new forms of safety assessment notations to provide evidence of safety, and the use of data derived from such notations as a means of providing quantified input into the design assessment process. We then show how the design assessment can be partially automated, and from this develop some ideas on how we might move from analytical to synthetic approaches, using safety criteria and evidence as a fitness function for comparing alternative automatically-generated designs.

Automatic dependent surveillance-broadcast (ADS-B) has become a crucial part of next generation air traffic surveillance technology and will be mandatorily deployed for most of the airspaces worldwide by 2020. Each aircraft equipped with an ADS-B device keeps broadcasting plaintext messages to other aircraft and the ground station controllers once or twice per second. The lack of security measures in ADS-B systems makes it susceptible to different attacks. Among the various security issues, we investigate the integrity and authenticity of ADS-B messages. We propose a new framework for providing ADS-B with authentication based on three-level hierarchical identity-based signature (HIBS) with batch verification. Previous signature-based ADS-B authentication protocols focused on how to generate signatures efficiently, while our schemes can also significantly reduce the verification cost, which is critical to ADS-B systems, since at any time an ADS-B receiver may receive lots of signatures. We design two concrete schemes. The basic scheme supports partial batch verification and the extended scheme provides full batch verification. We give a formal security proof for the extended scheme. Experiment results show that our schemes with batch verification are tremendously more efficient in batch verifying <inline-formula><tex-math notation="LaTeX">$n$ </tex-math><alternatives><inline-graphic xlink:href="yang-ieq1-2459709.gif"/></alternatives></inline-formula> signatures than verifying <inline-formula><tex-math notation="LaTeX">$n$</tex-math><alternatives> <inline-graphic xlink:href="yang-ieq2-2459709.gif"/></alternatives></inline-formula> signatures independently. For example, the running time of verifying 100 signatures is 502 and 484 ms for the basic scheme and the extended scheme respectively, while the time is 2500 ms if verifying the signatures independently.

In this paper we discuss a software design framework that is capable of realizing network-centricity and the rising multicore technology. Instead of producing static design documents in the form of UML diagrams, we propose automatic generation of a visual simulation model, which represents the target system design. We discuss a design environment that is responsible for the generation and execution of the simulation model.

This study explores, in the context of semiautonomous driving, how the content of the verbalized message accompanying the car’s autonomous action affects the driver’s attitude and safety performance. Using a driving simulator with an auto-braking function, we tested different messages that provided advance explanation of the car’s imminent autonomous action. Messages providing only “how” information describing actions (e.g., “The car is braking”) led to poor driving performance, whereas “why” information describing reasoning for actions (e.g., “Obstacle ahead”) was preferred by drivers and led to better driving performance. Providing both “how and why” resulted in the safest driving performance but increased negative feelings in drivers. These results suggest that, to increase overall safety, car makers need to attend not only to the design of autonomous actions but also to the right way to explain these actions to the drivers.

Security issues are becoming more and more important to acti vities of individuals, organizations and the society in our modern ne tworked computerized world. In this chapter we survey a few optimization framewor ks for problems related to security of various networked system such as the int erne or the power grid system.


Question: Advancing an information security framework specifically for the automotive industry.

The Evolution of Cybersecurity in the Automotive Sector: A Comprehensive Perspective

The integration of information technology (IT) in the automotive industry has become pivotal, driving innovation and functionality in modern vehicles. With IT expenses already substantial and projected to rise significantly, the focus on safety and reliability has been complemented by a growing emphasis on IT security. This shift is critical as vehicular IT systems face the risk of targeted attacks or unauthorized access. While security features like immobilizers and digital tachographs have become commonplace, the comprehensive safeguarding of automotive IT systems is a relatively new frontier.

This paper offers a detailed exploration of the current state of IT security within the automotive domain. Initially, we provide an overview of the existing IT security landscape in vehicles, highlighting its significance and evolution. We then delve into the fundamentals of cryptography, explaining key terms and functions that underpin IT security measures. A key segment of the paper is dedicated to elucidating the necessity of robust IT security in the automotive sector. We outline common security threats, outline the objectives that guide security strategies, and discuss the unique constraints faced by the industry.

Following this, we introduce the core security technologies and mechanisms that are pivotal in the automotive context. These include encryption, authentication, and access control, among others, which are essential for protecting vehicles from cyber threats. We then proceed to examine specific vehicular applications, business models, and components that heavily rely on IT security. This includes features like remote diagnostics, over-the-air updates, and connected car services.

Our analysis concludes with an in-depth discussion on the challenges and opportunities that the automotive IT community faces in integrating IT security into vehicles. This includes the need for standardized security protocols, the development of secure communication channels, and the continuous adaptation to emerging cyber threats. The paper aims to provide a holistic view of the current state and future prospects of automotive cybersecurity, emphasizing the pivotal role it will play in the evolution of the automotive industry.

The Internet of Things (IoT) continues to grow as uniquely identifiable objects are added to the internet. The addition of these devices, and their remote connectivity, has brought a new level of efficiency into our lives. However, the security of these devices has come into question. While many may be secure, the sheer number creates an environment where even a small percentage of insecure devices may create significant vulnerabilities. This paper evaluates some of the emerging vulnerabilities that exist and puts some figures to the scale of the threat.

Cyber-physical systems U+0028 CPS U+0029 are complex systems with organic integration and in-depth collaboration of computation, communications and control U+0028 3C U+0029 technology. Subject to the theory and technology of existing network systems and physical systems, the development of CPS is facing enormous challenges. This paper first introduces the concept and characteristics of CPS and analyzes the present situation of CPS researches. Then the development of CPS is discussed from perspectives of system model, information processing technology and software design. At last it analyzes the main obstacles and key researches in developing CPS.

Ethical issues, with respect to computer-based information systems, are important to the individual IS practitioner. These same issues also have an important impact on the moral well-being of organizations and societies. Considerable discussion has taken place in the Information Systems (IS) literature on specific ethical issues, but there is little published work which relates these issues to mainstream ethical theory. This paper describes a range of ethical theories drawn from philosophy literature and uses these theories to critique aspects of the newly revised ACM Code of Ethics. Some in the IS field on problematic ethical issues which are not resolved by the Code are then identified and discussed. The paper draws some implications and conclusions on the value of ethical theory and codes of practice, and on further work to develop existing ethical themes and to promote new initiatives in the ethical domain.

This paper presents a study of security advances and challenges associated with emergent 4G wireless technologies. The paper makes a number of contributions to the field. First, it studies the security standards evolution across different generations of wireless standards. Second, the security-related standards, architecture and design for the LTE and WiMAX technologies are analyzed. Third, security issues and vulnerabilities present in the above 4G standards are discussed. Finally, we point to potential areas for future vulnerabilities and evaluate areas in 4G security which warrant attention and future work by the research and advanced technology industry.

Automotive UWB (Ultra-Wideband) short range radar (SSR) is on the market as a key technology for novel comfort and safety systems. SiGe based 79 GHz UWB SRR will be a definite candidate for the long term substitution of the 24 GHz UWB SRR. This paper will give an overview of the finished BMBF joint project KOKON and the recently started successing project RoCC, which concentrate on the development of this technology and sensor demonstrators. In both projects, the responsibilities of Daimler AG deal with application based sensor specification, test and evaluation of realized sensor demonstrators. Recent UWB SRR frequency regulation approaches and activitites will be introduced. Furthermore, some first results of Daimler activities within RoCC will be presented, dealing with the packaging and operation of these sensors within the complex car environment.

Reports about serious vulnerabilities in critical IT components have triggered increased focus on cybersecurity worldwide. Among the man y initiatives to strengthen cybersecurity it is common to see the establishment and stre gthening of CERTs and other centers for cybersecurity. On the other hand , strengthening education in IT security and applying methods for secure systems d velopment are methods that receive much less attention. In this paper we expla in how the lack of focus on security in IT education programs worldwide is a signifi cant contributor to security vulnerabilities, and we propose an agile method for s ecure software design that requires team members to have received adequa te security education and training.

The introduction of automation in cyber-physical systems (CPS) has raised major safety and security concerns. One attack vector is the sensing unit whose measurements can be manipulated by an adversary through attacks such as denial of service and delay injection. To secure an autonomous CPS from such attacks, we use a challenge response authentication (CRA) technique for detection of attack in active sensors data and estimate safe measurements using the recursive least square algorithm. For demonstrating effectiveness of our proposed approach, a car-follower model is considered where the follower vehicle's radar sensor measurements are manipulated in an attempt to cause a collision.

The importance of software security cannot be overstated. In the past, researchers have applied program analysis techniques to automatically detect security vulnerabilities and verify security properties. However, such techniques have limited success in reality because they require manually provided code-level security specifications. Manually writing and generating these code-level security specifications are tedious and error-prone. Additionally, they seldom exist in production software. In this paper, we propose a novel method and tool, called AutoISES, which Automatically Infers Security Specifications by statically analyzing source code, and then directly use these specifications to automatically detect security violations. Our experiments with the Linux kernel and Xen demonstrated the effectiveness of this approach – AutoISES automatically generated 84 security specifications and detected 8 vulnerabilities in the Linux kernel and Xen, 7 of which have already been confirmed by the corresponding developers.

A description is given of a software-process maturity framework that has been developed to provide the US Department of Defense with a means to characterize the capabilities of software-development organizations. This software-development process-maturity model reasonably represents the actual ways in which software-development organizations improve. It provides a framework for assessing these organizations and identifying the priority areas for immediate improvement. It also helps identify those places where advanced technology can be most valuable in improving the software-development process. The framework can be used by any software organization to assess its own capabilities and identify the most important areas for improvement.<<ETX>>

Network and application vulnerability assessments have a tendency to be difficult and costly; however, failing to have an assessment done and fixing security loopholes may result in a security breach by malicious attackers. A security breach can cost an organization time and money remediating the damage, such as lost confidential business information, which far exceeds the cost of a security assessment. Our solution for this problem is a semi-automated system that can help a penetration tester, security professional, or systems administrator, scan and report on the vulnerabilities of a network and services running on the network. It is also able to perform some simulated attacks. This system relies on a miniaturized computer to host the necessary components to conduct a security assessment. This system has been done in an open source manner to allow others to contribute and benefit from a community effort in the name of security.


Question: An enhanced Floyd algorithm for solving the shortest path problem.

This paper explores the intricacies of the Floyd-Warshall algorithm, a fundamental technique for calculating the shortest paths between all pairs of vertices in a weighted directed graph. Beyond its primary function, the algorithm is also capable of identifying negative cycles within the graph. However, our analysis reveals a critical flaw in the conventional implementation of the Floyd-Warshall algorithm. Specifically, we highlight that the algorithm may encounter issues when dealing with negative cycles, as it can generate exponentially large numbers during execution, leading to computational errors or inaccuracies. This unexpected behavior underscores the need for careful consideration of algorithmic design and implementation, particularly in scenarios where negative cycle detection is a key requirement. To address this limitation, modifications to the algorithm's structure and data handling processes may be necessary to ensure its reliability and efficiency in all graph scenarios.

The complexity of a class of vehicle routing and scheduling problems is investigated. We review known NP-hardness results and compile the results on the worst-case performance of approximation algorithms. Some directions for future research are suggested. The presentation is based on two discussion sessions during the Workshop to Investigate Future Directions in Routing and Scheduling of Vehicles and Crews, held at the University of Maryland at College Park, June 4-6, 1979.

Full terms and conditions of use: http://pubsonline.informs.org/page/terms-and-conditions This article may be used only for the purposes of research, teaching, and/or private study. Commercial use or systematic downloading (by robots or other automatic processes) is prohibited without explicit Publisher approval, unless otherwise noted. For more information, contact permissions@informs.org. The Publisher does not warrant or guarantee the article’s accuracy, completeness, merchantability, fitness for a particular purpose, or non-infringement. Descriptions of, or references to, products or publications, or inclusion of an advertisement in this article, neither constitutes nor implies a guarantee, endorsement, or support of claims made of that product, publication, or service. © 1990 INFORMS

Structure and Algorithms Jakob Puchinger NICTA Victoria Laboratory Department of Computer Science & Software Engineering University of Melbourne, Australia jakobp@csse.unimelb.edu.au Günther R. Raidl Institute of Computer Graphics and Algorithms Vienna University of Technology, Austria raidl@ads.tuwien.ac.at Ulrich Pferschy Department of Statistics and Operations Research University of Graz, Austria pferschy@uni-graz.at

We start by def ining conven t ions and t e rmino logy that will be used th roughou t this paper . String C = clc~ ... cp is a subsequence of string A = aja2 "'" am if there is a mapp ing F : {1, 2 . . . . , p} ~ {1, 2, ... , m} such that F(i) = k only if c~ = ak and F is a m o n o t o n e strictly increasing funct ion (i .e. F(i) = u, F(]) = v, and i < j imply that u < v). C can be fo rmed by delet ing m p (not necessari ly ad jacen t ) symbols f rom A . F o r example , " c o u r s e " is a subsequence of " c o m p u t e r sc ience . " Str ing C is a c o m m o n s ubs equence of strings A and B if C is a s u b s e q u e n c e of A and also a subsequence of B. String C is a longest c o m m o n subsequence (abbrev ia ted LCS) of string A and B if C is a c o m m o n subsequence of A and B of maximal length , i .e. there is no c o m m o n subsequence of A and B that has grea te r length. Th roughou t this paper , we assume that A and B are strings of lengths m and n , m _< n , that have an LCS C of (unknown) length p . We assume that the symbols that may appea r in these strings c o m e f rom some a lphabet of size t . A symbol can be s tored in m e m o r y by using log t bits, which we assume will fit in one word of memory . Symbols can be c o m p a r e d (a -< b?) in one t ime unit . The n u m b e r of di f ferent symbols that actual ly appear in string B is def ined to be s (which must be less than n and t). The longest c o m m o n s u b s e q u e n c e prob lem has been solved by using a recurs ion re la t ionship on the length of the solut ion [7, 12, 16, 21]. These are general ly appl icable a lgor i thms that take O ( m n ) t ime for any input strings o f lengths m and n even though the lower bound on t ime of O ( m n ) need not apply to all inputs [2]. We present a lgor i thms that , depend ing on the na ture of the Input, may not requ i re quadra t ic t ime to r ecove r an LCS. The first a lgor i thm is appl icable in the genera l case and requi res O ( p n + n log n) t ime. T h e second a lgor i thm requi res t ime b o u n d e d by O((m + 1 p )p log n). In the c o m m o n special case where p is close to m , this a lgor i thm takes t ime

The vehicle routing problem with multiple use of vehicles is a variant of the classical vehicle routing problem. It arises when each vehicle performs several routes during the workday due to strict time limits on route duration (e.g., when perishable goods are transported). The routes are defined over customers with a revenue, a demand and a time window. Given a fixed-size fleet of vehicles, it might not be possible to serve all customers. Thus, the customers must be chosen based on their associated revenue minus the traveling cost to reach them. We introduce a branch-and-price approach to address this problem where lower bounds are computed by solving the linear programming relaxation of a set packing formulation, using column generation. The pricing subproblems are elementary shortest path problems with resource constraints. Computational results are reported on euclidean problems derived from well-known benchmark instances for the vehicle routing problem with time windows. 2009 Elsevier B.V. All rights reserved.

Traffic engineering consists in improving the performance of the teleco-munication networks which is evaluated by a large number of criteria. The ultimate objective is to avoid congestion in the network by keeping its links from being overloaded. In large Ethernet networks with thousands of servers, such as data centers, improving the performance of the traditional switching protocols is a crucial but very challenging task due to an exploration in the size of solution space and the complexity. Thus, exact methods are inappropriate even for reasonable size networks. Local Search (LS) is a powerful method for solving computational optimization problems such as the Vertex Cover, Traveling Salesman, or Boolean Satisfiability. The advantage of LS for these problems is its ability to find an intelligent path from a low quality solution to a high quality one in a huge search space. In this thesis, we propose different approximate methods based on Local Search for solving the class of traffic engineering problems in data center networks that implement Spanning Tree Protocol and Multiple Spanning Tree Protocol. First, we tackle the minimization of the maximal link utilization in the Ethernet networks with one spanning tree. Next, we cope with data center networks containing many spanning trees. We then deal with the minimization of service disruption and the worst-case maximal link utilization in data center networks with many spanning trees. Last, we develop a novel design of multi-objective algorithms for solving the traffic engineering problems in large data centers by taking into account three objectives to be minimized: maximal link utilization, network total load and number of used links. Our schemes reduce significantly the size of the search space by releasing the dependence of the solutions from the link cost computation iii iv in order to obtain an intended spanning tree. We propose efficient in-cremental techniques to speed up the computation of objective values. Furthermore, our approaches show good results on the credible data sets and are evaluated by the strong assessment methods. ACKNOWLEDGEMENTS First of all, I would like to thank Yves Deville and Olivier Bonaventure for the four years they spent helping me. I am very lucky to have two great advisors of two different promoting styles. Yves Deville is a very demanding supervisor who wants every smallest detail to be clear and intuitive. His ideas and his criticisms sometimes made me nervous or even angry but I could not deny the truth …

We show how to find a Hamiltonian cycle in a graph of degree at most three with n vertices, in time O(2) ≈ 1.260 and linear space. Our algorithm can find the minimum weight Hamiltonian cycle (traveling salesman problem), in the same time bound. We can also count or list all Hamiltonian cycles in a degree three graph in time O(2) ≈ 1.297. We also solve the traveling salesman problem in graphs of degree at most four, by randomized and deterministic algorithms with runtime O((27/4)) ≈ 1.890 and O((27/4+ ǫ)) respectively. Our algorithms allow the input to specify a set of forced edges which must be part of any generated cycle. Our cycle listing algorithm shows that every degree three graph has O(2) Hamiltonian cycles; we also exhibit a family of graphs with 2 Hamiltonian cycles per graph. Article Type Communicated by Submitted Revised Regular paper J. S. B. Mitchell April 2004 Work supported in part by NSF grant CCR-9912338. A preliminary version of this paper appeared at the 8th Annual Workshop on Algorithms and Data Structures,

Let G= (V,E,σ,μ) be a simple connected undirected fuzzy graph. In this paper, we use a fuzzy graph model to represent a traffic network of a city and discuss a method to find the different type of accidental zones in a traffic flows. This paper is based on fuzzy coloring of fuzzy graphs and fuzziness of vertices. Using this approach, we can minimize the total waiting time of a traffic flow. It will help to reduce the traffic jam of a road.

problems To understand the class of polynomial-time solvable proble ms, we must first have a formal notion of what a “problem” is. We define anbstract problemQ to be a binary relation on a set I of probleminstancesand a setS of problemsolutions. For example, an instance for SHORTEST-PATH is a triple consi sting of a graph and two vertices. A solution is a sequence of vertices in the g raph, with perhaps the empty sequence denoting that no path exists. The problem SHORTEST-PATH itself is the relation that associates each instance of a gra ph and two vertices with a shortest path in the graph that connects the two vertices. S ince shortest paths are not necessarily unique, a given problem instance may have mo r than one solution. This formulation of an abstract problem is more general than is required for our purposes. As we saw above, the theory of NP-completeness res tricts attention to decision problems : those having a yes/no solution. In this case, we can view an abstract decision problem as a function that maps the instan ce setI to the solution set {0, 1}. For example, a decision problem related to SHORTEST-PATH i s the problem PATH that we saw earlier. If i = 〈G,u, v,k〉 is an instance of the decision problem PATH, then PATH(i ) = 1 (yes) if a shortest path fromu to v has at mostk edges, and PATH (i ) = 0 (no) otherwise. Many abstract problems are not decision problems, but rather optimization problems , in which some value must be minimized or maximized. As we saw above, however, it is usual ly a simple matter to recast an optimization problem as a decision problem that is no harder. 1See Hopcroft and Ullman [156] or Lewis and Papadimitriou [20 4] for a thorough treatment of the Turing-machine model. 34.1 Polynomial time 973

Ant colony optimization (ACO) is a meta-heuristic based on colony of artificial ants which work cooperatively, building solutions by moving on the problem graph and by communicating through artificial pheromone trails mimicking real ants. One of the active research directions is the application of ACO algorithms to solve dynamic shortest path problems. Solving traffic jams is one such problem where the cost i.e. time to travel increases during rush hours resulting in tremendous strain on daily commuters and chaos. This paper describes a new approach-DSATJ (Dynamic System for Avoiding Traffic Jam) which aims at choosing an alternative optimum path to avoid traffic jam and then resuming that same path again when the traffic is regulated. The approach is inspired by variants of ACO algorithms. Traffic jam is detected through pheromone values on edges which are updated according to goodness of solution on the optimal tours only. Randomness is introduced in the probability function to ensure maximum exploration by ants. Experiments were carried out with the partial road map of North-West region of Delhi, India, to observe the performance of our approach.


Question: An optimized Floyd algorithm for solving the shortest path problem.

This paper presents a specialized solution for the vehicle routing problem with time windows, focusing on scenarios where vehicles are utilized multiple times within a single workday. This problem variation is pertinent when dealing with stringent time constraints on route duration, such as in the transportation of perishable goods. The routes are meticulously planned for customers, each having an associated revenue, demand, and specific time window. Given a fixed fleet size, it's often unfeasible to service all customers, necessitating a strategic selection process based on the net revenue (revenue minus travel cost) of each customer. We propose a branch-and-price methodology to tackle this issue, where lower bounds are established through the linear programming relaxation of a set packing formulation, facilitated by column generation techniques. The pricing subproblems are essentially simplified shortest path problems with resource constraints. To validate our approach, we have conducted computational experiments on Euclidean problems derived from established benchmark instances for the vehicle routing problem with time windows. These results underscore the efficacy of our method in addressing complex routing scenarios. 2009 Elsevier B.V. All rights reserved.

**Question**: A Comparative Analysis of Machine Learning Techniques for Predicting Stock Market Trends

**Documents**: A novel approach to the problem of stock market trend prediction using machine learning techniques
The prediction of stock market trends is a challenging task due to the non-stationary and noisy nature of the financial time series. In this paper, we propose a novel approach to address this problem by using machine learning techniques. We compare the performance of several machine learning models, including support vector machines (SVM), artificial neural networks (ANN), and random forest (RF), in predicting the direction of the stock market movement. The models are trained on historical stock price data and evaluated using a variety of performance metrics. The results show that the RF model outperforms the other models in terms of accuracy and robustness. We also analyze the importance of different features in the prediction process and find that technical indicators such as moving averages and relative strength index (RSI) are the most significant predictors of stock market trends. Our findings suggest that machine learning techniques can be effectively used for stock market trend prediction, and RF is a promising model for this task.

**Similar Documents**: This study delves into the complex domain of stock market trend prediction, a task fraught with difficulty due to the inherent volatility and noise in financial time series. To tackle this challenge, we introduce a comprehensive methodology that harnesses the power of machine learning techniques. Our investigation compares the efficacy of various machine learning models,

An efficient and reliable algorithm for computing the Euclidean distance between a pair of convex sets in Rm is described. Extensive numerical experience with a broad family of polytopes in R 3 shows that the computational cost is approximately linear in the total number of vertices specifying the two polytopes. The algorithm has special features which makes its application in a variety of robotics problems attractive. These are discussed and an example of collision

Progressive algorithms are algorithms that, on the way to computing a complete solution to the problem at hand, output intermediate solutions that approximate the complete solution increasingly well. We present a framework for analyzing such algorithms, and develop efficient progressive algorithms for two geometric problems: computing the convex hull of a planar point set, and finding popular places in a set of trajectories.

Computer networks have become a critical infrastructure. As such, networks should not only meet strict requirements in terms of correctness, availability, and performance, but they should also be very flexible and support fast updates, e.g., due to a change in the security policy, increasing traffic, or failures. In this paper, we present a structured survey of mechanisms and protocols to update computer networks in a fast and consistent manner. In particular, we identify and discuss the different desirable consistency properties that should be provided throughout a network update, the algorithmic techniques which are needed to meet these consistency properties, and the implications on the speed and costs at which updates can be performed. We also explain the relationship between consistent network update problems and classic algorithmic optimization ones. While our survey is mainly motivated by the advent of Software-Defined Networks (SDNs) and their primary need for correct and efficient update techniques, the fundamental underlying problems are not new, and we provide a historical perspective of the subject as well. CCS Concepts: rGeneral and reference → Surveys and overviews; rNetworks → Network algorithms; rComputer systems organization→ Distributed architectures;

Wayfinding, i.e. getting from some origin to a destination, is one of the prime everyday problems humans encounter. It has received a lot of attention in research and many (commercial) systems propose assistance in this task. We present an approach to route directions based on the idea to adapt route directions to route and environment's characteristics. The lack of such an adaptation is a major drawback of existing systems. Our approach is based on an informationand representation-theoretic analysis of routes and takes into account findings of behavioral research. The resulting systematics is the framework for the optimization process. We discuss the consequences of using an optimization process for generating route directions and outline its algorithmic realization.

We study approximation algorithms for placing replicated data in arbitrary networks. Consider a network of nodes with individual storage capacities and a metric communication cost function, in which each node periodically issues a request for an object drawn from a collection of uniform-length objects. We consider the problem of placing copies of the objects among the nodes such that the average access cost is minimized. Our main result is a polynomial-time constant-factor approximation algorithm for this placement problem. Our algorithm is based on a careful rounding of a linear programming relaxation of the problem. We also show that the data placement problem is MAXSNP-hard.
We extend our approximation result to a generalization of the data placement problem that models additional costs such as the cost of realizing the placement. We also show that when object lengths are non-uniform, a constant-factor approximation is achievable if the capacity at each node in the approximate solution is allowed to exceed that in the optimal solution by the length of the largest object.

This article discusses the routing and wavelength assignment (RWA) problem in optical networks employing wavelenength division multiplexing (WDM) technology. Two variants of the problem are studied: static RWA, whereby the traffic requirements are known in advance, and dynamic RWA in which connection requests arrive in some random fashion. Both point-topoint and multicast traffic demands are considered.

We provide a tight analysis of Grover’s recent algorithm for quantum database searching. We give a simple closed-form formula for the probability of success after any given number of iterations of the algorithm. This allows us to determine the number of iterations necessary to achieve almost certainty of finding the answer. Furthermore, we analyse the behaviour of the algorithm when the element to be found appears more than once in the table and we provide a new algorithm to find such an element even when the number of solutions is not known ahead of time. Using techniques from Shor’s quantum factoring algorithm in addition to Grover’s approach, we introduce a new technique for approximate quantum counting, which allows to estimate the number of solutions. Finally we provide a lower bound on the efficiency of any possible quantum database searching algorithm and we show that Grover’s algorithm nearly comes within a factor 2 of being optimal in terms of the number of probes required in the table.

We introduce a technique for traversal of Merkle trees, and propose an efficient algorithm that generates a sequence of leaves along with their associated authentication paths. For one choice of parameters, and a total of N leaves, our technique requires a worst-case computational effort of 2 log N/loglog N hash function evaluations per output, and a total storage capacity of less than 1.5 log N/loglog N hash values. This is a simultaneous improvement both in space and time complexity over any previously published algorithm.

Let P be a simple polygon with N vertices, each being assigned a weight ∈ {0,1}, and let C, the weight of P, be the added weight of all vertices. We prove that it is possible, in O(N) time, to find two vertices a,b in P, such that the segment ab lies entirely inside the polygon P and partitions it into two polygons, each with a weight not exceeding 2C/3. This computation assumes that all the vertices have been sorted along some axis, which can be done in O(Nlog N) time. We use this result to derive a number of efficient divide-and-conquer algorithms for: 1. Triangulating an N-gon in O(Nlog N) time. 2. Decomposing an N-gon into (few) convex pieces in O(Nlog N) time. 3. Given an O(Nlog N) preprocessing, computing the shortest distance between two arbitrary points inside an N-gon (i.e., the internal distance), in O(N) time. 4. Computing the longest internal path in an N-gon in O(N2) time. In all cases, the algorithms achieve significant improvements over previously known methods, either by displaying better performance or by gaining in simplicity. In particular, the best algorithms for Problems 2,3,4, known so far, performed respectively in O(N2), O(N2), and O(N4) time.

Many real-world applications require the successful combination of spatial and temporal reasoning. In this paper, we study the general framework of the Traveling Salesman Problem with Simple Temporal Constraints. Representationally, this framework subsumes the Traveling Salesman Problem, Simple Temporal Problems, as well as many of the frameworks described in the literature. We analyze the theoretical properties of the combined problem providing strong inapproximability results for the general problem, and positive results for


Question: An optimized Floyd algorithm to solve the shortest path problem.

This paper delves into the realm of algorithmic problem-solving, focusing on the class of problems that can be solved in polynomial time. To properly categorize these problems, a formal definition of an "abstract problem" is introduced, characterized as a binary relation between a set of problem instances, denoted as I, and a set of problem solutions, referred to as S. For instance, in the context of the SHORTEST-PATH problem, an instance is defined by a graph and two vertices, while a solution is a sequence of vertices that may or may not exist in the graph. The SHORTEST-PATH problem itself is the relationship that links each instance of a graph and two vertices with the shortest path between them. Given that shortest paths can be non-unique, an instance might correspond to multiple solutions. However, this abstract problem definition is more comprehensive than necessary for our exploration. The theory of NP-completeness, for instance, narrows its focus to decision problems—problems with binary outcomes. We can thus perceive an abstract decision problem as a function that maps the set of instances I to the solution set {0, 1}. Consider the PATH problem related to SHORTEST-PATH. If an instance i = 〈G, u, v, k〉 is part of the decision problem PATH, then PATH(i) equals 1 (yes) if the shortest path from u to v contains no more than k edges, and PATH(i) equals 0 (no) otherwise. While many abstract problems fall outside the realm of decision problems and are, in fact, optimization problems where a value needs to be either minimized or maximized, they can typically be rephrased as decision problems without increasing their complexity. This approach provides a unified framework for analyzing and solving a wide range of problems within the computational realm, highlighting the versatility of polynomial-time algorithms in addressing diverse computational challenges.

Computer networks have become a critical infrastructure. As such, networks should not only meet strict requirements in terms of correctness, availability, and performance, but they should also be very flexible and support fast updates, e.g., due to a change in the security policy, increasing traffic, or failures. In this paper, we present a structured survey of mechanisms and protocols to update computer networks in a fast and consistent manner. In particular, we identify and discuss the different desirable consistency properties that should be provided throughout a network update, the algorithmic techniques which are needed to meet these consistency properties, and the implications on the speed and costs at which updates can be performed. We also explain the relationship between consistent network update problems and classic algorithmic optimization ones. While our survey is mainly motivated by the advent of Software-Defined Networks (SDNs) and their primary need for correct and efficient update techniques, the fundamental underlying problems are not new, and we provide a historical perspective of the subject as well. CCS Concepts: rGeneral and reference → Surveys and overviews; rNetworks → Network algorithms; rComputer systems organization→ Distributed architectures;

Given a (combinatorial) optimization problem and a feasible solution to it, the corresponding inverse optimization problem is to find a minimal adjustment of the cost function such that the given solution becomes optimum. Several such problems have been studied in the last twelve years. After formalizing the notion of an inverse problem and its variants, we present various methods for solving them. Then we discuss the problems considered in the literature and the results that have been obtained. Finally, we formulate some open problems.

Let G= (V,E,σ,μ) be a simple connected undirected fuzzy graph. In this paper, we use a fuzzy graph model to represent a traffic network of a city and discuss a method to find the different type of accidental zones in a traffic flows. This paper is based on fuzzy coloring of fuzzy graphs and fuzziness of vertices. Using this approach, we can minimize the total waiting time of a traffic flow. It will help to reduce the traffic jam of a road.

The kernel K(P) of a simple polygon P wah n verUces is the locus of the points internal to P from which all verUces of P are wslble Equwalently, K(P) is the mtersectmn of appropriate half-planes determined by the polygon's edges Although it is known that to find the intersection of n generic half-planes requires time O(n log n), we show that one can exploit the ordering of the half-planes corresponding to the sequence of the polygon's edges to obtain a kernel finding algorithm which runs m time O(n) and is therefore optimal

The Hamiltonian cycle problem is one of the most popular NP-complete problems, and remains NP-complete even if we restrict ourselves to a class of (3-connected cubic) planar graphs [5,9]. Therefore, there seems to be no polynomial-time algorithm for the Hamiltonian cycle problem. However, for certain (nontrivial) classes of restricted graphs, there exist polynomial-time algorithms [3,4,6]. In fact, employing the proof technique used by Tutte [lo], Gouyou-Beauchamps has given an 0(n3) time algorithm for finding a Hamiltonian cycle in a 4-connected planar graph G, where n is the number of vertices of G [6]. Although such a graph G always has a Hamiltonian cycle [lo], it is not an easy matter to actually find a Hamiltonian cycle of G. However, for a little more restricted class of graphs, i.e., the class of 4-connected maximal planar graphs, we can construct an efficient algorithm. One can easily design an O(n*) time algorithm to find a Hamiltonian cycle in a 4-connetted maximal planar graph G with n vertices, entirely based on Whitney’s proof of his theorem [l 11. In this paper, we present an efficient algorithm for the problem, based on our simplified version of Whitney’s proof of his result. We employ ‘divide and conquer’ and some other techniques in the algorithm. The computational complexity of our algorithm is linear, thus optimal to within a constant factor.

Computation of the Euler number of a binary image is often necessary in image matching, image database retrieval, image analysis, pattern recognition, and computer vision. This paper proposes an improvement on the Euler number computing algorithm used in the famous image processing tool MATLAB. By use of the information obtained during processing the previous pixel, the number of times of checking the neighbor pixels for processing a pixel decrease from 4 to 2. Our method is very simple in principle, and easily implemented. The experimental results demonstrated that our method outperforms significantly conventional Euler number computing algorithms.

In this paper we describe a self-adjusting algorithm for packet routing, in which a reinforcement learning module is embedded into each node of a switching network. Only local communication is used to keep accurate statistics at each node on which routing policies lead to minimal delivery times. In simple experiments involving a 36-node, irregularly connected network, this learning approach proves superior to a nonadaptive algorithm based on precomputed shortest paths. The authors would like to thank for their support the Bellcore Cognitive Science Research Group, the National Defense Science and Engineering Graduate fellowship program, and National Science Foundation Grant IRI-9214873. The views and conclusions contained in this document are those of the authors and should not be interpreted as representing the o cial policies, either expressed or implied, of Bellcore, the National Science Foundation or the U.S. Government.

We give an NlogO(1) N-time randomized O(1)-approximation algorithm for computing the cost of minimum bichromatic matching between two planar point-sets of size N.

An efficient and reliable algorithm for computing the Euclidean distance between a pair of convex sets in Rm is described. Extensive numerical experience with a broad family of polytopes in R 3 shows that the computational cost is approximately linear in the total number of vertices specifying the two polytopes. The algorithm has special features which makes its application in a variety of robotics problems attractive. These are discussed and an example of collision

In this paper we present a polynomial time technology mapping algorithm, called Flow-Map, that optimally solves the LUT-based FPGA technology mapping problem for depth minimization for general Boolean networks. This theoretical breakthrough makes a sharp contrast with the fact that conventional technology mapping problem in library-based designs is NP-hard. A key step in Flow-Map is to compute a minimum height K-feasible cut in a network, solved by network flow computation. Our algorithm also effectively minimizes the number of LUTs by maximizing the volume of each cut and by several postprocessing operations. We tested the Flow-Map algorithm on a set of benchmarks and achieved reductions on both the network depth and the number of LUTs in mapping solutions as compared with previous algorithms.