SoroushVahidi/scidocs huggingface dataset:
Finding application errors and security flaws using PQL: a program query language
(2005)

A number of effective error detection tools have been built in recent years to check if a program conforms to certain design rules. An important class of design rules deals with sequences of events asso-ciated with a set of related objects. This paper presents a language called PQL (Program Query Language) that allows programmers to express such questions easily in an application-specific context. A query looks like a code excerpt corresponding to the shortest amount of code that would violate a design rule. Details of the tar-get application's precise implementation are abstracted away. The programmer may also specify actions to perform when a match is found, such as recording relevant information or even correcting an erroneous execution on the fly.We have developed both static and dynamic techniques to find solutions to PQL queries. Our static analyzer finds all potential matches conservatively using a context-sensitive, flow-insensitive, inclusion-based pointer alias analysis. Static results are also use-ful in reducing the number of instrumentation points for dynamic analysis. Our dynamic analyzer instruments the source program to catch all violations precisely as the program runs and to optionally perform user-specified actions.We have implemented the techniques described in this paper and found 206 errors in 6 large real-world open-source Java applica-tions containing a total of nearly 60,000 classes. These errors are important security flaws, resource leaks, and violations of consis-tency invariants. The combination of static and dynamic analysis proves effective at addressing a wide range of debugging and pro-gram comprehension queries. We have found that dynamic analysis is especially suitable for preventing errors such as security vulner-abilities at runtime.
A First Step Towards Automated Detection of Buffer Overrun Vulnerabilities
(2000)

We describe a new technique for finding potential buffer overrun vulnerabilities in security-critical C code. The key to success is to use static analysis: we formulate detection of buffer overruns as an integer range analysis problem. One major advantage of static analysis is that security bugs can be eliminated before code is deployed. We have implemented our design and used our prototype to find new remotely-exploitable vulnerabilities in a large, widely deployed software package. An earlier hand audit missed
StackGuard: Automatic Adaptive Detection and Prevention of Buffer-Overflow Attacks
(1998)

This paper presents a systematic solution to the persistent problem of buffer overflow attacks. Buffer overflow attacks gained notoriety in 1988 as part of the Morris Worm incident on the Internet. While it is fairly simple to fix individual buffer overflow vulnerabilities, buffer overflow attacks continue to this day. Hundreds of attacks have been discovered, and while most of the obvious vulnerabilities have now been patched, more sophisticated buffer overflow attacks continue to emerge. We describe StackGuard: a simple compiler technique that virtually eliminates buffer overflow vulnerabilities with only modest performance penalties. Privileged programs that are recompiled with the StackGuard compiler extension no longer yield control to the attacker, but rather enter a fail-safe state. These programs require no source code changes at all, and are binary-compatible with existing operating systems and libraries. We describe the compiler technique (a simple patch to gcc), as well as a set of variations on the technique that tradeoff between penetration resistance and performance. We present experimental results of both the penetration resistance and the performance impact of this technique. This research is partially supported by DARPA contracts F3060296-1-0331 and F30602-96-1-0302. Ryerson Polytechnic University
Securing web application code by static analysis and runtime protection
(2004)

Security remains a major roadblock to universal acceptance of the Web for many kinds of transactions, especially since the recent sharp increase in remotely exploitable vulnerabilities have been attributed to Web application bugs. Many verification tools are discovering previously unknown vulnerabilities in legacy C programs, raising hopes that the same success can be achieved with Web applications. In this paper, we describe a sound and holistic approach to ensuring Web application security. Viewing Web application vulnerabilities as a secure information flow problem, we created a lattice-based static analysis algorithm derived from type systems and typestate, and addressed its soundness. During the analysis, sections of code considered vulnerable are instrumented with runtime guards, thus securing Web applications in the absence of user intervention. With sufficient annotations, runtime overhead can be reduced to zero. We also created a tool named.WebSSARI (Web application Security by Static Analysis and Runtime Inspection) to test our algorithm, and used it to verify 230 open-source Web application projects on SourceForge.net, which were selected to represent projects of different maturity, popularity, and scale. 69 contained vulnerabilities. After notifying the developers, 38 acknowledged our findings and stated their plans to provide patches. Our statistics also show that static analysis reduced potential runtime overhead by 98.4%.
An investigation into language model data augmentation for low-resourced STT and KWS
(2017)

This paper reports on investigations using two techniques for language model text data augmentation for low-resourced automatic speech recognition and keyword search. Lowresourced languages are characterized by limited training materials, which typically results in high out-of-vocabulary (OOV) rates and poor language model estimates. One technique makes use of recurrent neural networks (RNNs) using word or subword units. Word-based RNNs keep the same system vocabulary, so they cannot reduce the OOV, whereas subword units can reduce the OOV but generate many false combinations. A complementary technique is based on automatic machine translation, which requires parallel texts and is able to add words to the vocabulary. These methods were assessed on 10 languages in the context of the Babel program and NIST OpenKWS evaluation. Although improvements vary across languages with both methods, small gains were generally observed in terms of word error rate reduction and improved keyword search performance.
Supervised Dynamic and Adaptive Discretization for Rule Mining
(2015)

Association rule mining is a well-researched topic in data mining. However, a common limitation with existing algorithms is that they mainly deal with categorical data. In this work we propose a methodology that allows adaptive discretization and quantitative rule discovery in large mixed databases. More specifically, we propose a top-down, recursive approach to find ranges of values for continuous attributes that result in high confidence rules. Our approach allows any given continuous attribute to be discretized in multiple ways. Compared to a global discretization scheme, our approach makes it possible to capture different intervariable interactions. We applied our algorithm to various synthetic and real datasets, including Intel manufacturing data that motivated our research. The experimental results and analysis indicate that our algorithm is capable of finding more meaningful rules for multivariate data, in addition to being more efficient than the state-of-the-art techniques.
Modeling social influence through network autocorrelation: constructing the weight matrix
(2002)

Many physical and social phenomena are embedded within networks of interdependencies, the so-called ‘context’ of these phenomena. In network analysis, this type of process is typically modeled as a network autocorrelation model. Parameter estimates and inferences based on autocorrelation models, hinge upon the chosen specification of weight matrix W, the elements of which represent the influence pattern present in the network. In this paper I discuss how social influence processes can be incorporated in the specification of W. Theories of social influence center around ‘communication’ and ‘comparison’; it is discussed how these can be operationalized in a network analysis context. Starting from that, a series of operationalizations of W is discussed. Finally, statistical tests are presented that allow an analyst to test various specifications against one another or pick the best fitting model from a set of models. © 2002 Elsevier Science B.V. All rights reserved.
Application of generalized Bagley-polygon four-port power dividers to designing microwave dual-band bandpass planar filters
(2010)

A new type of microwave dual-band bandpass planar filter based on signal-interference techniques is reported. The described filter approach consists of transversal filtering sections made up of generalized Bagley-polygon four-port power dividers. This transversal section, by exploiting feedforward signal-interaction concepts, enables dual-band bandpass filtering transfer functions with several transmission zeros to be obtained. A set of closed formulas and guidelines for the analytical synthesis of the dual-passband transversal filtering section are derived. Moreover, its practical usefulness is proven with the development and testing of a 2.75/3.25-GHz dual-band microstrip prototype.
Measuring user acceptance of emerging information technologies: an assessment of possible method biases
(1995)

The measurement scales for the perceived usefulness and perceived ease of we constructs introduced by Davis [12/ have become widely used for forecasting user acceptance of emerging information technologies. An experiment was conducted to examine whether grouping of items caused artifactual inflation of reliability and validity measures. We found support for our hypothesis that the reliability and validity stemmed notfrom item grouping butfrom the constructs of perceived usefulness and perceived ease of use being clearly defined, and the items used co measure each of these consn-ucts clearly capturing the essence of the conscrucI.
Effect of gas type and flow rate on Cu free air ball formation in thermosonic wire bonding
(2011)

0026-2714/$ see front matter 2010 Elsevier Ltd. A doi:10.1016/j.microrel.2010.02.023 * Corresponding author. E-mail address: apequegn@uwaterloo.ca (A. Peque The development of novel Cu wires for thermosonic wire bonding is time consuming and the effects of shielding gas on the electrical flame off (EFO) process is not fully understood. An online method is used in this study for characterizing Cu free air balls (FABs) formed with different shielding gas types and flow rates. The ball heights before (HFAB) and after deformation (Hdef) are responses of the online method and measured as functions of gas flow rate. Sudden changes in the slopes of these functions, a non-parallelity of the two functions, and a large standard deviation of the HFAB measurements all identify FAB defects. Using scanning electron microscope (SEM) images in parallel with the online measurements golf-club shaped and pointed shaped FABs are found and the conditions at which they occur are identified. In general FAB defects are thought to be caused by changes in surface tension of the molten metal during EFO due to inhomogeneous cooling or oxidation. It is found that the convective cooling effect of the shielding gas increases with flow rate up to 0.65 l/min where the bulk temperature of a thermocouple at the EFO site decreases by 19 C. Flow rates above 0.7 l/min yield an undesirable EFO process due to an increase in oxidation which can be explained by a change in flow from laminar to turbulent. The addition of H2 to the shielding gas reduces the oxidation of the FAB as well as providing additional thermal energy during EFO. Different Cu wire materials yield different results where some perform better than others. 2010 Elsevier Ltd. All rights reserved.
Enclosed: a component-centric interface for designing prototype enclosures
(2013)

This paper explores the problem of designing enclosures (or physical cases) that are needed for prototyping electronic devices. We present a novel interface that uses electronic components as handles for designing the 3D shape of the enclosure. We use the .NET Gadgeteer platform as a case study of this problem, and implemented a proof-of-concept system for designing enclosures for Gadgeteer components. We show examples of enclosures designed and fabricated with our system.
Evaluation Techniques for Storage Hierarchies
(1970)

This paper introduces an efficient technique called “stack processing” that can be used in the cost-performance evaluation of a large class of storage hierarchies. The technique depends on a classification of page replacement algorithms as “stack algorithms” for which various properties are derived. These properties may be of use in the general areas of program modeling and system analysis, as well as in the evaluation of storage hierarchies. For a better understanding of storage hierarchies, we briefly review some basic concepts of their design.
Multispectral Deep Neural Networks for Pedestrian Detection
(2016)

Multispectral pedestrian detection is essential for around-the-clock applications, e.g., surveillance and autonomous driving. We deeply analyze Faster R-CNN for multispectral pedestrian detection task and then model it into a convolutional network (ConvNet) fusion problem. Further, we discover that ConvNet-based pedestrian detectors trained by color or thermal images separately provide complementary information in discriminating human instances. Thus there is a large potential to improve pedestrian detection by using color and thermal images in DNNs simultaneously. We carefully design four ConvNet fusion architectures that integrate two-branch ConvNets on different DNNs stages, all of which yield better performance compared with the baseline detector. Our experimental results on KAIST pedestrian benchmark show that the Halfway Fusion model that performs fusion on the middle-level convolutional features outperforms the baseline method by 11% and yields a missing rate 3.5% lower than the other proposed architectures.
Traffic Analysis of Encrypted Messaging Services: Apple iMessage and Beyond
(2014)

Instant messaging services are quickly becoming the most dominant form of communication among consumers around the world. Apple iMessage, for example, handles over 2 billion messages each day, while WhatsApp claims 16 billion messages from 400 million international users. To protect user privacy, many of these services typically implement end-to-end and transport layer encryption, which are meant to make eavesdropping infeasible even for the service providers themselves. In this paper, however, we show that it is possible for an eavesdropper to learn information about user actions, the language of messages, and even the length of those messages with greater than 96% accuracy despite the use of state-of-the-art encryption technologies simply by observing the sizes of encrypted packets. While our evaluation focuses on Apple iMessage, the attacks are completely generic and we show how they can be applied to many popular messaging services, including WhatsApp, Viber, and Telegram.
DroidCat: Effective Android Malware Detection and Categorization via App-Level Profiling
(2018)

Most existing Android malware detection and categorization techniques are static approaches, which suffer from evasion attacks, such as obfuscation. By analyzing program behaviors, dynamic approaches are potentially more resilient against these attacks. Yet existing dynamic approaches mostly rely on characterizing system calls which are subject to system-call obfuscation. This paper presents DroidCat, a novel dynamic app classification technique, to complement existing approaches. By using a diverse set of dynamic features based on method calls and inter-component communication (ICC) Intents without involving permission, app resources, or system calls while fully handling reflection, DroidCat achieves superior robustness than static approaches as well as dynamic approaches relying on system calls. The features were distilled from a behavioral characterization study of benign versus malicious apps. Through three complementary evaluation studies with 34 343 apps from various sources and spanning the past nine years, we demonstrated the stability of DroidCat in achieving high classification performance and superior accuracy compared with the two state-of-the-art peer techniques that represent both static and dynamic approaches. Overall, DroidCat achieved 97% F1-measure accuracy consistently for classifying apps evolving over the nine years, detecting or categorizing malware, 16%–27% higher than any of the two baselines compared. Furthermore, our experiments with obfuscated benchmarks confirmed higher robustness of DroidCat over these baseline techniques. We also investigated the effects of various design decisions on DroidCat’s effectiveness and the most important features for our dynamic classification. We found that features capturing app execution structure such as the distribution of method calls over user code and libraries are much more important than typical security features such as sensitive flows.
How We Transmit Memories to Other Brains: Constructing Shared Neural Representations Via Communication
(2017)

Humans are able to mentally construct an episode when listening to another person's recollection, even though they themselves did not experience the events. However, it is unknown how strongly the neural patterns elicited by mental construction resemble those found in the brain of the individual who experienced the original events. Using fMRI and a verbal communication task, we traced how neural patterns associated with viewing specific scenes in a movie are encoded, recalled, and then transferred to a group of naïve listeners. By comparing neural patterns across the 3 conditions, we report, for the first time, that event-specific neural patterns observed in the default mode network are shared across the encoding, recall, and construction of the same real-life episode. This study uncovers the intimate correspondences between memory encoding and event construction, and highlights the essential role our common language plays in the process of transmitting one's memories to other brains.
Development of a new hybrid ANN for solving a geotechnical problem related to tunnel boring machine performance
(2019)

Prediction of tunnel boring machine (TBM) performance parameters can be caused to reduce the risks associated with tunneling projects. This study is aimed to introduce a new hybrid model namely Firefly algorithm (FA) combined by artificial neural network (ANN) for solving problems in the field of geotechnical engineering particularly for estimation of penetration rate (PR) of TBM. For this purpose, the results obtained from the field observations and laboratory tests were considered as model inputs to estimate PR of TBMs operated in a water transfer tunnel in Malaysia. Five rock mass and material properties (rock strength, tensile strength of rock, rock quality designation, rock mass rating and weathering zone) and two machine factors (trust force and revolution per minute) were used in the new model for predicting PA. FA algorithm was used to optimize weight and bias of ANN to obtain a higher level of accuracy. A series of hybrid FA-ANN models using the most influential parameters on FA were constructed to estimate PR. For comparison, a simple ANN model was built to predict PR of TBM. This ANN model was improved on the basis of new ways. By doing this, the best ANN model was chosen for comparison purposes. After implementing the best models for two methods, the data were divided into five separate categories. This will minimize the chance of randomness. Then the best models were applied for these new categories. The results demonstrated that new hybrid intelligent model is able to provide higher performance capacity for predicting. Based on the coefficient of determination 0.948 and 0.936 and 0.885 and 0.889 for training and testing datasets of FA-ANN and ANN models, respectively, it was found that the new hybrid model can be introduced as a superior model for solving geotechnical engineering problems.
A whole-body control framework for humanoids operating in human environments
(2006)

Tomorrow's humanoids will operate in human environments, where efficient manipulation and locomotion skills, and safe contact interactions are critical design factors. We report here our recent efforts into these issues, materialized into a whole-body control framework. This framework integrates task-oriented dynamic control and control prioritization allowing to control multiple task primitives while complying with physical and movement-related constraints. Prioritization establishes a hierarchy between control spaces, assigning top priority to constraint-handling tasks, while projecting operational tasks in the null space of the constraints, and controlling the posture within the residual redundancy. This hierarchy is directly integrated at the kinematic level, allowing the program to monitor behavior feasibility at runtime. In addition, prioritization allows us to characterize the dynamic behavior of the individual control primitives subject to the constraints, and to synthesize operational space controllers at multiple levels. To complete this framework, we have developed free-floating models of the humanoid and incorporate the associated dynamics and the effects of the resulting support contacts into the control hierarchy. As part of a long term collaboration with Honda, we are currently implementing this framework into the humanoid robot Asimo
Path diversification for future internet end-to-end resilience and survivability
(2014)

Path Diversification is a new mechanism that can be used to select multiple paths between a given ingress and egress node pair using a quantified diversity measure to achieve maximum flow reliability. The path diversification mechanism is targeted at the end-to-end layer, but can be applied at any level for which a path discovery service is available. Path diversification also takes into account service requirements for low-latency or maximal reliability in selecting appropriate paths. Using this mechanism will allow future internetworking architectures to exploit naturally rich physical topologies to a far greater extent than is possible with shortest-path routing or equal-cost load balancing. We describe the path diversity metric and its application at various aggregation levels, and apply the path diversification process to 13 real-world network graphs as well as 4 synthetic topologies to asses the gain in flow reliability. Based on the analysis of flow reliability across a range of networks, we then extend our path diversity metric to create a composJ. P. Rohrer* E-mail: jprohrer@nps.edu Tel.: +1 831 656 3196 Computer Science Department, Naval Postgraduate School Monterey, California, USA A. Jabbar* E-mail: jabbar@ge.com Advanced Communication Systems Lab, GE Global Research Niskayuna, New York, USA J. P. G. Sterbenz E-mail: jpgs@{ittc.ku.edu|comp.lancs.ac.uk} Tel.: +1 785 864 7890 Information and Telecommunication Technology Center, The University of Kansas Lawrence, Kansas, USA and Lancaster University, Lancaster, UK * Work performed while at The University of Kansas ite compensated total graph diversity metric that is representative of a particular topology’s survivability with respect to distributed simultaneous link and node failures. We tune the accuracy of this metric having simulated the performance of each topology under a range of failure severities, and present the results. The topologies used are from nationalscale backbone networks with a variety of characteristics, which we characterize using standard graph-theoretic metrics. The end result is a compensated total graph diversity metric that accurately predicts the survivability of a given network topology.