@conference {570, title = {Making Blockchain Validators Honest}, booktitle = {2022 Fourth International Conference on Blockchain Computing and Applications (BCCA)}, year = {2022}, abstract = {

The importance of honesty among blockchain validators can not be overemphasized, especially as blockchain is used by many as an underlying technology for the development of various Industry 4.0 solutions. In the blockchain consensus process, validators validate the correctness of transactions and propose new blocks for addition to the blockchain. They are rewarded for this task with the blockchain native token (e.g., ETH on the Ethereum blockchain). This reward is often distributed among validators with respect to their staked amount. An increasing number of validators joining the network leads to a decreasing chance of a validator being chosen for the validation task and thus a reduction in the validation reward. This situation results in some form of competition among the validators, leading them to carry out various malicious actions to influence the blockchain validator selection protocol in order to be chosen. In this paper, we examine the competitive interactions between validators in a blockchain consensus process and propose a model using an infinitely repeated game model that ensures that the validators are deterred from behaving maliciously while also encouraging a self-policing notion due to the extra incentive mechanism of an improved reputation score when a validator can verifiably report malicious activities by others. Further, we discuss the factors that can incentivize or disincentivize a validator to either continue to behave honestly or switch to dishonest behavior.

}, doi = {10.1109/BCCA55292.2022.9921952}, url = {https://ieeexplore.ieee.org/abstract/document/9921952}, author = {Salau, Abiola and Dantu, Ram and Morozov, Kirill and Badruddoja, Syed and Upadhyay, Kritagya} } @conference {503, title = {Towards a Threat Model and Security Analysis for Data Cooperatives}, booktitle = {19th International Conference on Security and Cryptography (SECRYPT 2022)}, year = {2022}, abstract = {

Data cooperative (called {\textquotedblleft}data coop{\textquotedblright} for short) is an emerging approach in the area of secure data management. It promises its users a better protection and control of their data, as compared to the traditional way of their handling by the data collectors (such as governments, big data companies, and others). However, for the success of data coops, existing challenges with respect to data management systems need to be adequately addressed. Especially, they concern terms of security and privacy, as well as the power imbalance between providers/owners and collectors of data. Designing a security and privacy model for a data coop requires a systematic threat modeling approach that identifies the security landscape, attack vectors, threats, and vulnerabilities, as well as the respective mitigation strategies. In this paper, we analyze the security of data cooperatives, identify potential security risks and threats, and suggest adequate countermeasures. We also discuss existing challenges that hinder the widespread adoption of data coops.\ 

}, keywords = {Cybersecurity, Data Cooperatives, Secure Data Management, Security and Privacy., Threat Model}, doi = {10.5220/0011328700003283}, author = {Salau, Abiola and Dantu, Ram and Morozov, Kirill and Upadhyay, Kritagya and Badruddoja, Syed} } @conference {397, title = {CMCAP: Ephemeral Sandboxes for Adaptive Access Control}, booktitle = {Proceedings of the 24th ACM Symposium on Access Control Models and Technologies}, year = {2019}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, keywords = {adaptive access control, ephemeral sandboxes, information flow control, intrusion prevention, runtime containment}, isbn = {978-1-4503-6753-0}, doi = {10.1145/3322431.3325414}, url = {http://doi.acm.org/10.1145/3322431.3325414}, author = {Bucuti, Theogene and Dantu, Ram and Morozov, Kirill} } @conference {409, title = {Distributed Ledger for Spammers{\textquoteright} Resume}, booktitle = {2019 IEEE Conference on Communications and Network Security (CNS)}, year = {2019}, month = {June}, abstract = {

Unsolicited, and most likely spoofed, robot calls are not just an annoyance, but also carry a potential threat with the onset of automation, impersonation, and even voice manipulation technologies as malicious elements attempt to use deception to steal sensitive information or invoke action. Despite steps taken to protect consumers, the issue appears to be far from under control. In this paper, we propose a solution to use blockchain as a platform to share spam transactions through a peer-to-peer mechanism that will maintain a global database of reported spam transactions in order to identify and trace spam activity effectively. Storing spam transactions on a distributed ledger with consensus-based approval of transactions adds reliability to the data and can optimize the data points that will be available to spam detection algorithms in order to fight spam effectively. As this is peer to peer-based sharing, there is no need to rely on third-party providers for storing and sharing this data to the users. Every spam call received will be added as a detailed transaction on the blockchain to execute a smart contract that will calculate the trustworthiness of the caller. Call records are used to identify spam transactions while the blockchain ledgers store this data. We discuss the relevance and advantages of a distributed ledger to store these transactions. This paper does not aim at solving the spam problem with an optimized detection algorithm but evaluates the characteristics and performance of the blockchain as a distributed ledger and its relevance to serve as a platform for peer-to-peer spam detection mechanisms. We evaluate different blockchain metrics like transaction processing rates, gas costs and ledger sizes and discuss how they scale in order to store the spam reports data on the blockchain.

}, keywords = {blockchain, Peer-to-peer, Robocalls, smart contract, Spam detection}, doi = {10.1109/CNS.2019.8802789}, author = {Muttavarapu, Anudeep and Dantu, Ram and Thompson, Mark} } @conference {587, title = {Verifying OAuth Implementations Through Encrypted Network Analysis}, booktitle = {Proceedings of the 24th ACM Symposium on Access Control Models and Technologies}, year = {2019}, publisher = {Association for Computing Machinery}, organization = {Association for Computing Machinery}, address = {New York, NY, USA}, abstract = {

Verifying protocol implementations via application analysis can be cumbersome. Rapid development cycles of both the protocol and applications that use it can hinder up-to-date analysis. A better approach is to use formal models to characterize the applications platform and then verify the protocol through analysis of the network traffic tied to the models. To test this method, the popular protocol OAuth is considered. Currently, formal models of OAuth do not take into consideration the mobile environment, and implementation verification is largely based on code analysis. Our preliminary results are two fold; we sketch an extension to a formal model that incorporates the specifics of the Android platform and classify OAuth device types using machine learning on encrypted VPN traffic.

}, keywords = {Android, authorization, formal models, network analysis, oauth}, isbn = {9781450367530}, doi = {10.1145/3322431.3326449}, url = {https://doi.org/10.1145/3322431.3326449}, author = {Talkington, Josh and Dantu, Ram and Morozov, Kirill} } @conference {322, title = {A Decentralized Marketplace Application on the Ethereum Blockchain}, booktitle = {IEEE 4th International Conference on Collaboration and Internet Computing (CIC)}, year = {2018}, month = {10/2018}, publisher = {IEEE}, organization = {IEEE}, address = {Philadelphia, PA, USA}, abstract = {

Modern centralized online marketplaces such as eBay offer an alternative option for consumers to both sell and purchase goods with relative ease. However, drawbacks to these marketplaces include the platform{\textquoteright}s ability to block merchants at their own whim, the fees paid to the platform when listing a product and when selling a product, and the lack of privacy of users{\textquoteright} data. In this paper, we propose an application that remedies all three of these drawbacks through use of the Ethereum blockchain platform. The application was developed using the Truffle development framework. The application{\textquoteright}s functions were contained within an Ethereum smart contract, which was then migrated to the Ethereum network. The user{\textquoteright}s input was read through a web interface and sent to the Ethereum network via the web3.js API. Statistics about the application were gathered on the Rinkeby test network. The application was shown to have an average transaction runtime of 3.8 seconds, and an average gas consumption of 4.6 wei. Contract creation times for the application were shown to be less than a second. A cost analysis of the application was then conducted. The gas consumption of the transactions needed to both buy and sell a product was converted into US dollars, and the gas cost of the application was then compared to the cost to use an online auction marketplace such as eBay as well as an in-person auction house such as Sotheby{\textquoteright}s. The results showed that selling on the application is cheaper than existing online options as well as existing in-person options. These tests showed that our application was successful in addressing the drawbacks of current auction marketplaces.

}, keywords = {API, application program interfaces, auction marketplaces, average gas consumption, blockchain, centralized online marketplaces, Computer science, contract creation times, cost analysis, Cryptocurrency, decentralized, decentralized marketplace application, e-commerce, eBay, electronic commerce, Ethereum, Ethereum blockchain platform, Ethereum network, Ethereum smart contract, gas cost, human factors, in-person options, Internet, marketplace, Measurement, online auction marketplace, online options, peer-to-peer computing, Rinkeby test network, security of data, smart contract, Truffle development framework, user data, user interfaces, Web interface}, doi = {10.1109/CIC.2018.00023}, author = {Ranganthan, Vishnu Prasad and Ram Dantu and Paul, Aditya and Mears, Paula and Morozov, Kirill} } @article {388, title = {On the security of the Courtois-Finiasz-Sendrier signature}, year = {2018}, isbn = {23915455}, url = {https://www.degruyter.com/view/j/math.2018.16.issue-1/math-2018-0011/math-2018-0011.xml}, author = {Morozov, Kirill and Sarathi, Roy Partha and Rainer, Steinwandt and Rui, Xu} } @article {328, title = { Effective CPR Procedure With Real-Time Evaluation and Feedback Using Smartphones }, number = {US20150351647A1}, year = {2015}, month = {12/2015}, abstract = {

A method for performing CPR, comprising activating an application on one or more mobile phones having one or more sensors, placing one or more mobile phones on the finger of a subject to collect information about the subject, determining whether CPR is necessary based on the collected information about the subject, calibrating the sensors of the one or more mobile phones, placing the one or more mobile phones in a position on a hand of a user of the one or more mobile phones, administering chest compressions to the subject, activating a sensor of the one or more mobile phones, including an accelerometer sensor, to permit the application to capture information about the chest compression rate and displacement relating to movement of the chest of the subject, and transmitting the chest compression rate and displacement information of the subject to the emergency dispatcher using the mobile phone.

}, author = {Ram Dantu and Gupta, Neeraj and Dantu, Vishnu and Morgan, Zachary} } @conference {271, title = {PhD Forum: A System Identification Approach to Monitoring Network Traffic Security}, booktitle = {2015 IEEE 2nd International Conference on Cyber Security and Cloud Computing}, year = {2015}, month = {Nov}, abstract = {

Network security is a growing area of interest for cyber systems, especially given the increasing number of attacks on companies each year. Though there are a vast amount of tools already available, System Identification (SI) complements intrusion detection systems to help manage network traffic stability. SI is the science of building mathematical models of dynamic systems. This paper introduces the use of SI for modeling network traffic and utilizes a linear time invariant model to analyze performance of real connections and attack instances. We generated several ARX models where each represented a different threat state in the network. We utilized the KDD CUP 1999{\textquoteright}s DARPA dataset to analyze the performance when dealing with different attacks. Results show that the average model fit was 84.14\% when determining if the system was experiencing normal traffic. This value is promising because it shows how well the system is able to determine a network state in a given time when fed input.

}, keywords = {ARX, ARX model, autoregressive processes, Computational modeling, computer network security, Computer security, cyber system, dynamic system, Electronic mail, intrusion detection system, linear time invariant model, Mathematical model, Models, network traffic security, network traffic stability, Predictive models, Security, Silicon, System Identification, system identification approach, telecommunication traffic}, doi = {10.1109/CSCloud.2015.85}, author = {Mayo, Quentin and Bryce, Renee and Ram Dantu} } @article {9, title = {Magnetic Maps for Indoor Navigation}, journal = {IEEE Transactions on Instrumentation and Measurement}, volume = {60}, year = {2011}, pages = {3883 - 3891}, abstract = {

Magnetic field fluctuations and anomalies inside buildings tend to have a great effect on the compass, which is one of the simplest navigation devices. Alternative navigation requires landmark identification, so those landmarks can be used as guideposts in assisting individuals. By employing a mobile phone with built\_in magnetometer, an extensive data set of 2000 measurements was collected. Using these fields, we identify landmarks and guideposts and create magnetic maps for multiple corridors of a floor in a building. Different phones are used at different sensitivity rates, which effectively portray similar results. Magnetic signatures are used for identifying locations and rooms and are independent of the person, the phone, and the sensitivity of the sensor being used. Magnetic field behavior is demonstrated and compared with theoretical distributions of these fields. The developed magnetic maps can complement existing visual maps for location tracking and navigation of autonomous robots indoors. These maps are particularly useful during limited visual feedback in poor lighting conditions. Moreover, building designers could include this landmark and guidepost information when developing the architecture of a building, which could in turn help people or robots navigate during disasters and emergency evacuations.

}, keywords = {Buildings, Magnetic field measurement, Magnetic field measurements, Magnetic fields, Magnetometers, Mobile handsets, mobile phones, Navigation, sensors, Uncertainty}, doi = {10.1109/TIM.2011.2147690}, author = {Gozick, Brandon and Subbu, Kalyan and Ram Dantu and Maeshiro, Tomyo} } @article {63, title = {Next generation 9-1-1: Architecture and challenges in realizing an IP-multimedia-based emergency service}, journal = {Journal of Homeland Security and Emergency Management}, volume = {7}, year = {2010}, abstract = {

Next generation 9-1-1 (NG-9-1-1) services will enable the use of multimedia (voice, video, text messages, and data) for emergency communications. This will be made possible using a whole new architecture for emergency communications, one that is based on the internet protocol (IP) and open standards. VOIP based communication services vastly improve the effectiveness of relief during mass disasters, as was observed during Katrina. However, delivering the latest multimedia technology to Public Service Answering Points (PSAPs) presents both new opportunities and challenges. In this paper, we review how technology is evolving towards an NG-9-1-1 solution and underscore the challenges and issues that still require investigation.

}, author = {Gupta, Neeraj and Ram Dantu and Schulzrinne, Henning and Goulart, Anna and Magnussen, Walt} } @conference {78, title = {Penetration Testing for Spam Filters}, booktitle = {Proceedings of the 2009 33rd Annual IEEE International Computer Software and Applications Conference - Volume 02}, year = {2009}, publisher = {IEEE Computer Society}, organization = {IEEE Computer Society}, address = {Seattle, WA}, abstract = {

Despite all the advances on techniques to block spam e-mail messages we still receive them on a frequent basis. This is due mainly to the ability of the spammers to modify the message and pass the filters. Therefore a testing technique that could resemble the behavior of spammers would improve the number of scenarios tested and allow filters to be developed based on the potential changes made by the spammers. An approach based on Natural Language Processing (NLP) for the penetration of spam filters is proposed here. Preliminary results using SpamAssassin are provided indicating the feasibility of the proposed approach.

}, keywords = {mutation testing, penetration testing, spam filter}, isbn = {978-0-7695-3726-9}, doi = {10.1109/COMPSAC.2009.168}, url = {http://dx.doi.org/10.1109/COMPSAC.2009.168}, author = {Madhavan, Yugesh and Cangussu, Jo{\~a}o and Ram Dantu} } @conference {38, title = {Discovery of Social Groups Using Call Detail Records}, booktitle = {On the Move to Meaningful Internet Systems: OTM 2008 Workshops}, year = {2008}, month = {11/2008}, publisher = {Springer Berlin Heidelberg}, organization = {Springer Berlin Heidelberg}, address = {Monterrey, Mexico}, abstract = {

In this paper we propose the affinity model for classifying social groups based on mobile phone call detail records. We use affinity to measure the similarity between probability distributions. Since phone calls are stochastic process, it makes more sense to use probability affinity to classify the social groups. This work is useful for enhancing homeland security, detecting unwanted calls (e.g., spam) and product marketing. For validation of our results, we used actual call logs of 100 users collected at MIT by the Reality Mining Project group for a period of 8 months. The experimental results show that our model achieves good performance with high accuracy.

}, isbn = {978-3-540-88875-8}, doi = {10.1007/978-3-540-88875-8_72}, url = {http://dx.doi.org/10.1007/978-3-540-88875-8_72}, author = {Zhang, Huiqi and Ram Dantu}, editor = {Meersman, Robert and Tari, Zahir and Herrero, Pilar} } @inbook {12, title = {Group Recommendation System for Facebook}, booktitle = {On the Move to Meaningful Internet Systems: OTM 2008 Workshops, Monterrey, Mexico, November 9-14, 2008. Proceedings}, year = {2008}, pages = {211{\textendash}219}, publisher = {Springer Berlin Heidelberg}, organization = {Springer Berlin Heidelberg}, address = {Berlin, Heidelberg}, abstract = {

Online social networking has become a part of our everyday lives, and one of the popular online social network (SN) sites on the Internet is Facebook, where users communicate with their friends, join to groups, create groups, play games, and make friends around the world. Also, the vast number of groups are created for different causes and beliefs. However, overwhelming number of groups in one category causes difficulties for users to select a right group to join. To solve this problem, we introduce group recommendation system (GRS) using combination of hierarchical clustering technique and decision tree. We believe that Facebook SN groups can be identified based on their members{\textquoteright} profiles. Number of experiment results showed that GRS can make 73\% accurate recommendation.

}, keywords = {decision tree, recommendation system, Social network}, isbn = {978-3-540-88875-8}, doi = {10.1007/978-3-540-88875-8_41}, url = {http://dx.doi.org/10.1007/978-3-540-88875-8_41}, author = {Baatarjav, Enkh-Amgalan and Phithakkitnukoon, Santi and Ram Dantu}, editor = {Meersman, Robert and Tari, Zahir and Herrero, Pilar} } @conference {49, title = {Inferring Social Groups Using Call Logs}, booktitle = {On the Move to Meaningful Internet Systems: OTM 2008 Workshops}, year = {2008}, month = {11/2008}, pages = {200{\textendash}210}, publisher = {Springer Berlin Heidelberg}, organization = {Springer Berlin Heidelberg}, address = {Monterrey, Mexico}, abstract = {

Recent increase in population of mobile phone users makes it a valuable source of information for social network analysis. For a given call log, how much can we tell about the person{\textquoteright}s social group? Unnoticeably, phone user{\textquoteright}s calling personality and habit has been concealed in the call logs from which we believe that it can be extracted to infer its user{\textquoteright}s social group information. In this paper, we present an end-to-end system for inferring social networks based on {\textquotedblleft}only{\textquotedblright} call logs using kernel-based na{\"\i}ve Bayesian learning. We also introduce normalized mutual information for feature selection process. Our model is evaluated with real-life call logs where it performs at high accuracy rate of 81.82\%.

}, isbn = {978-3-540-88875-8}, doi = {10.1007/978-3-540-88875-8_40}, url = {http://dx.doi.org/10.1007/978-3-540-88875-8_40}, author = {Phithakkitnukoon, Santi and Ram Dantu}, editor = {Meersman, Robert and Tari, Zahir and Herrero, Pilar} } @article {292, title = {Method and system for providing services for wireless data calls}, year = {2007}, month = {05/2007}, publisher = {Cisco Technology Inc}, address = {US}, abstract = {

A method and system for providing services for wireless data calls includes monitoring a wireless data call for a predefined event associated with a service for the wireless data call. The service is initiated for the wireless data call in response to detecting the predefined event for the data call. The predefined event may comprise a uniform resource locator (URL) match or change, excess use of transmission or time resources, a location change of a mobile device for the wireless data call, a network event, or a combination of any or all suitable events.

}, keywords = {call, data, network, service, wireless}, issn = {US7225238B1}, url = {https://patents.google.com/patent/US7225238/en}, author = {Ram Dantu and Patel, Pulin and Patel, Pravir and Garbuz, Alexander and Miernik, Jerzy and Patel, Achal and Holur, Balaji} } @article {79, title = {Dynamic resource management in QoS controlled networks}, journal = {Telecommunication Systems}, volume = {32}, year = {2006}, pages = {11{\textendash}30}, abstract = {

This paper addresses the problem of resource fragmentation (RF) in QoS controllednetworks. Resources are said to be fragmented when they are available in non-contiguousblocks and hence cannot be utilized by incoming calls with high resource demands. This paper shows the effect of resource fragmentation on QoS controlled networks and presents the Dynamic Resource Redistribution (DRR) algorithm to counteract RF. The DRR algorithm reduces the effects of RF by attempting to redistribute resources in different paths to make resources to incoming calls. A variety of simulation experiments were conducted to study the performance of the DRR algorithm on different network topologies with varying traffic characteristics. The DRR algorithm, when used, increased the number of calls accommodated in the network as well as the overall resource allocation in the network.

}, issn = {1572-9451}, doi = {10.1007/s11235-006-8200-4}, url = {http://dx.doi.org/10.1007/s11235-006-8200-4}, author = {Prasanna, Venkatesan and Mikler, Armin and Ram Dantu and Abbas, Kaja} } @article {296, title = {Wireless router and method for processing traffic in a wireless communications network}, year = {2006}, month = {06/2006}, publisher = {Cisco Technology Inc}, address = {US}, abstract = {

A wireless communications network includes a wireless-specific router topology layer that connects cellular sites to a wireline topology. The wireless-specific router topology provides a distributed architecture in which call processing including call setup, resource preservation, air bandwidth allocation, switching, soft handoff, and micromobility is performed at the cell level. The wireless routers are technology independent to support various cellular technologies. The wireless router may include a first interface operable to communicate wireless packets for a call with a remote device and a second interface operable to communicate wireline packets for the call with the wireline network. A traffic controller is coupled to the first and second interfaces and operable to convert traffic between the wireless and wireline packets and to route packets to a destination mobile or wireline device. A selection and distribution unit is operable to select and distribute traffic to support soft handoff for calls in the wireless communications network.

}, keywords = {network, router, routers, traffic, wireless}, issn = {US7068624B1}, url = {https://patents.google.com/patent/US7068624B1/en}, author = {Ram Dantu and Patel, Pulin and Choksi, Ojas and Patel, Achal and Ali, Mohammad and Miernik, Jerzy and Holur, Balajl} } @article {194, title = {Signaling System 7 (SS7) Message Transfer Part 2 (MTP2) - User Peer-to-Peer Adaptation Layer (M2PA)}, year = {2005}, author = {George, Tom and Bidulock, Brian and Ram Dantu and Schwarzbauer, Hanns and Morneault, Ken} } @conference {48, title = {Data centric modeling of environmental sensor networks}, booktitle = {Global Telecommunications Conference Workshops, 2004. GlobeCom Workshops 2004. IEEE}, year = {2004}, month = {Nov}, abstract = {

Meteorological and hydrological sensors deployed over several hundred kilometers of geographical area comprise an environmental sensor network. Large amounts of data need to be processed in minimal time and transmitted over the available low speed and low bandwidth links. This paper describes algorithms for optimal data collection and data fusion. An inductive model using exponential back-off policy is used to collect optimal amount of data. The data measurements for temperature, pH and specific conductance collected for a year from the sensors deployed at Lake Lewisville are used to test the inductive model. Energy savings of 90\% are achieved even with 1\% of degree of tolerance. The problem of data fusion is addressed by the introduction of a novel concept of a super-sensor, based on self-organization and collaboration among sensors. A histogram application is described that uses recursive doubling for global collaboration between sensors. The performance of the networked super-sensor in comparison to a centralized polling approach is analyzed for optimality on two different geographical areas.

}, keywords = {Bandwidth, biosensors, data centric modeling, data fusion, environmental sensor network, exponential back-off policy, Histograms, hydrological sensor, International collaboration, Lakes, meteorological, Meteorology, networked super-sensor, optimal data collection, sensor fusion, Sensor phenomena and characterization, Temperature measurement, temperature sensors, Testing}, doi = {10.1109/GLOCOMW.2004.1417621}, author = {Ram Dantu and Abbas, Kaja and O{\textquoteright}Neill, Marty and Mikler, Armin} } @article {229, title = {Requirements for Separation of IP Control and Forwarding}, year = {2003}, month = {11/2003}, publisher = {RFC Editor}, abstract = {

This document introduces the Forwarding and Control Element\ Separation (ForCES) architecture and defines a set of associated\ terminology.\  This document also defines a set of architectural,\ modeling, and protocol\ requirements to logically separate the control\ and data forwarding planes of an IP (IPv4, IPv6, etc.) networking\ device.

}, author = {Anderson, Todd and Bowen, Ed and Ram Dantu and Doria, Avri and Gopal, Ram and Salim, Jamal and Khosravi, Hormuzd and Minhazuddin, Muneyb and Wasserman, Margaret} } @article {279, title = {Constraint-Based Label Switched Path Setup using Label Distribution Protocol}, year = {2002}, url = {https://tools.ietf.org/html/rfc3212}, author = {Andersson, Loa and Callon, Ross and Ram Dantu and Doolan, Paul and Feldman, Nancy and Fredette, Andre and Gray, Eric and Heinanen, Juha and Jamoussi, Bilel and Kilty, Timothy and Malis, Andrew and Girish, Muckai and Worster, Tom and Wu, Liwen} } @article {280, title = {Signaling System 7 (SS7) Message Transfer Part 2 (MTP2) - User Adaptation Layer}, year = {2002}, url = {https://tools.ietf.org/html/rfc3331}, author = {Morneault, Ken and Ram Dantu and Sidebottom, Greg and Bidulock, Brian and Heitz, Jacob} }