SearcharxivSearch

arXiv subjects

Lipika Deka

Publications and source records attributed to Lipika Deka.

8 recordsLinked to original sources

Characterising Payload Entropy in Packet Flows

Accurate and timely detection of cyber threats is critical to keeping our online economy and data safe. A key technique in early detection is the classification of unusual patterns of network behaviour, often hidden as low-frequency events within complex time-series packet flows. One of the ways in which such anomalies can be detected is to analyse the information entropy of the payload within individual packets, since changes in entropy can often indicate suspicious activity - such as whether session encryption has been compromised, or whether a plaintext channel has been co-opted as a covert channel. To decide whether activity is anomalous we need to compare real-time entropy values with baseline values, and while the analysis of entropy in packet data is not particularly new, to the best of our knowledge there are no published baselines for payload entropy across common network services. We offer two contributions: 1) We analyse several large packet datasets to establish baseline payload information entropy values for common network services, 2) We describe an efficient method for engineering entropy metrics when performing flow recovery from live or offline packet data, which can be expressed within feature subsets for subsequent analysis and machine learning applications.

cs.CR

Improved Flow Recovery from Packet Data

Typical event datasets such as those used in network intrusion detection comprise hundreds of thousands, sometimes millions, of discrete packet events. These datasets tend to be high dimensional, stateful, and time-series in nature, holding complex local and temporal feature associations. Packet data can be abstracted into lower dimensional summary data, such as packet flow records, where some of the temporal complexities of packet data can be mitigated, and smaller well-engineered feature subsets can be created. This data can be invaluable as training data for machine learning and cyber threat detection techniques. Data can be collected in real-time, or from historical packet trace archives. In this paper we focus on how flow records and summary metadata can be extracted from packet data with high accuracy and robustness. We identify limitations in current methods, how they may impact datasets, and how these flaws may impact learning models. Finally, we propose methods to improve the state of the art and introduce proof of concept tools to support this work.

cs.CR

Use of Remote Sensing Data to Identify Air Pollution Signatures in India

Air quality has major impact on a country's socio-economic position and identifying major air pollution sources is at the heart of tackling the issue. Spatially and temporally distributed air quality data acquisition across a country as varied as India has been a challenge to such analysis. The launch of the Sentinel-5P satellite has helped in the observation of a wider variety of air pollutants than measured before at a global scale on a daily basis. In this chapter, spatio-temporal multi pollutant data retrieved from Sentinel-5P satellite is used to cluster states as well as districts in India and associated average monthly pollution signature and trends depicted by each of the clusters are derived and presented.The clustering signatures can be used to identify states and districts based on the types of pollutants emitted by various pollution sources.

cs.LG

Synergizing Roadway Infrastructure Investment with Digital Infrastructure for Infrastructure-Based Connected Vehicle Applications: Review of Current Status and Future Directions

The safety, mobility, environmental, energy, and economic benefits of transportation systems, which are the focus of recent connected vehicle (CV) programs, are potentially dramatic. However, realization of these benefits largely hinges on the timely integration of digital technology into upcoming as well as existing transportation infrastructure. CVs must be enabled to broadcast and receive data to and from other CVs [vehicle-to-vehicle (V2V) communication], to and from infrastructure [vehicle-to-infrastructure (V2I) communication], and to and from other road users, such as bicyclists or pedestrians (vehicle-to-other road users communication). Further, the infrastructure and transportation agencies that manage V2I-focused applications must be able to collect, process, distribute, and archive these data quickly, reliably, and securely. This paper focuses on V2I applications and investigates current digital roadway infrastructure initiatives. It highlights the importance of including digital infrastructure investment alongside investment in more traditional transportation infrastructure to keep up with the auto industry push toward increasing intervehicular communication. By studying current CV testbeds and smart-city initiatives, this paper identifies digital infrastructure being used by public agencies. It also examines public agencies limited budgeting for digital infrastructure and finds that current expenditure is inadequate for realizing the potential benefits of V2I applications. Finally, the paper presents a set of recommendations, based on a review of current practices and future needs, designed to guide agencies responsible for transportation infrastructure. It stresses the importance of collaboration for establishing national and international platforms for the planning, deployment, and management of digital infrastructure to support connected transportation systems.

cs.CY

Connected Vehicle Application Development Platform (CVDeP) for Edge-centric Cyber-Physical Systems

Connected vehicle (CV) application developers need a development platform to build, test and debug CV applications, such as safety, mobility, and environmental applications, in an edge-centric Cyber-Physical Systems. Our study objective is to develop and evaluate a scalable and secure CV application development platform (CVDeP) that enables the CV application developers to build, test and debug CV applications in real-time. CVDeP ensures that the functional requirements of the CV applications meet the latency requirements imposed by corresponding CV applications. We conducted a case study to evaluate the efficacy of CVDeP using two CV applications (one safety and one mobility application) and validated them through a field evaluation at the Clemson University Connected and Autonomous Vehicle Testbed (CU-CAVT). The analysis outcome proves the efficacy of CVDeP, which satisfies the functional requirements (e.g., latency, throughput) of a CV application while maintaining scalability, and security of the platform and applications.

cs.NI

New fermionic formula for unrestricted Kostka polynomials

A new fermionic formula for the unrestricted Kostka polynomials of type $A_{n-1}^{(1)}$ is presented. This formula is different from the one given by Hatayama et al. and is valid for all crystal paths based on Kirillov-Reshetihkin modules, not just for the symmetric and anti-symmetric case. The fermionic formula can be interpreted in terms of a new set of unrestricted rigged configurations. For the proof a statistics preserving bijection from this new set of unrestricted rigged configurations to the set of unrestricted crystal paths is given which generalizes a bijection of Kirillov and Reshetikhin.

math.CO

Fermionic Formulas For Unrestricted Kostka Polynomials And Superconformal Characters

The problem of finding fermionic formulas for the many generalizations of Kostka polynomials and for the characters of conformal field theories has been a very exciting research topic for the last few decades. In this dissertation we present new fermionic formulas for the unrestricted Kostka polynomials extending the work of Kirillov and Reshetikhin. We also present new fermionic formulas for the characters of N=1 and N=2 superconformal algebras which extend the work of Berkovich, McCoy and Schilling. Fermionic formulas for the unrestricted Kostka polynomials of type $A_{n-1}^{(1)}$ in the case of symmetric and anti-symmetric crystal paths were given by Hatayama et al. We present new fermionic formulas for the unrestricted Kostka polynomials of type $A_{n-1}^{(1)}$ for all crystal paths based on Kirillov-Reshetihkin modules. We interpret the fermionic formulas in terms of a new set of unrestricted rigged configurations. Fermionic formulas for the N=1 and N=2 superconformal algebras are derived using the Bailey lemma by establishing new Bailey flows from the nonunitary minimal models to the superconformal models.

math.CO

Non-unitary minimal models, Bailey's lemma and N=1,2 superconformal algebras

Using the Bailey flow construction, we derive character identities for the N=1 superconformal models SM(p',2p+p') and SM(p',3p'-2p), and the N=2 superconformal model with central charge c=3(1-2p/p') from the nonunitary minimal models M(p,p'). A new Ramond sector character formula for representations of N=2 superconformal algebras with central element c=3(1-2p/p') is given.

math-ph