This paper presents the results of detecting various motion states, essential for infrastructure-free tactical situational awareness, using Machine Learning (ML) for motion classification. We investigated if the use o...
详细信息
ISBN:
(纸本)9781510834101
This paper presents the results of detecting various motion states, essential for infrastructure-free tactical situational awareness, using Machine Learning (ML) for motion classification. We investigated if the use of multiple IMUs will bring additional information and improve the sensing of motion contexts. Namely, we used three different Inertial Measurement Units (IMUs) with the first attached to the user's torso, the second to the foot, and the third to the helmet. We also studied the best combination of sensors, measurements, and features used for detecting the contexts and for obtaining an accurate position solution. The full set of sensors studied included the three IMUs, a camera, a barometer, and an ultrasonic sensor. The method was tested with data collected in two experiments encompassing various motion patterns. Results showed that all sensors bring added value to the motion detection and that the motions having multiple instances in the data, even the ones considered as difficult to be identified like crawling, could be accurately classified. Also, the selection of features used for the classification process is discussed and evaluated as well as few different ML algorithms for classification. This research is a significant step towards infrastructure-free situational awareness for tactical applications.
In this paper, we propose two low-complexity automatic modulation classification (AMC) classifiers based on order-statistics: the linear support vector machine (LSVM) and the approximate maximum likelihood (AML). Spec...
详细信息
ISBN:
(纸本)9781509017010
In this paper, we propose two low-complexity automatic modulation classification (AMC) classifiers based on order-statistics: the linear support vector machine (LSVM) and the approximate maximum likelihood (AML). Specifically, LSVM applies the linear combination of the entire order-statistics of the received signals for the classification, while AML resorts to the asymptotic distribution of the reduced order-statistics to decrease the computational complexity. The Simulations show that the performance of our proposed classifiers is close to that of the maximum likelihood (ML) classifier and outperforms the Kolmogorov-Smirnov (KS) and cumulant-based classifiers. While the complexity of our proposed classifiers is much lower than that of the ML classifier.
The ClawZ toolset has been successful in verifying that Ada code is correctly generated from Simulink models in an industrial setting, using the Z notation. D-RisQ is now extending this technique to new domains of the...
详细信息
ISBN:
(纸本)9783319336008;9783319335995
The ClawZ toolset has been successful in verifying that Ada code is correctly generated from Simulink models in an industrial setting, using the Z notation. D-RisQ is now extending this technique to new domains of the C programming language, which requires changes to their highly complex proof technique. In this paper, we present initial results in the technology transfer of the graphical PSGraph language to support this extension, and show feasibility of PSGraph for industrial use with strong maintainability requirements.
We present a method for verifying relational program properties, that is, properties that relate the input and the output of two programs. Our verification method is parametric with respect to the definition of the op...
详细信息
ISBN:
(数字)9783662534137
ISBN:
(纸本)9783662534137;9783662534120
We present a method for verifying relational program properties, that is, properties that relate the input and the output of two programs. Our verification method is parametric with respect to the definition of the operational semantics of the programming language in which the two programs are written. That definition of the semantics consists of a set Int of constrained Horn clauses (CHCs) that encode the interpreter of the programming language. Then, given the programs and the relational property we want to verify, we generate, by using Int, a set of constrained Horn clauses whose satisfiability is equivalent to the validity of the property. Unfortunately, state-of-the-art solvers for CHCs have severe limitations in proving the satisfiability, or the unsatisfiability, of such sets of clauses. We propose some transformation techniques that increase the power of CHC solvers when verifying relational properties. We show that these transformations, based on unfold/fold rules, preserve satisfiability. Through an experimental evaluation, we show that in many cases CHC solvers are able to prove the satisfiability (or the unsatisfiability) of sets of clauses obtained by applying the transformations we propose, whereas the same solvers are unable to perform those proofs when given as input the original, untransformed sets of CHCs.
Electromagnetic survey equipment is widely used in the geophysical field, such as mineral exploration and underground oil detection. To meet the demand of high processing speed and flexible maneuverability, this paper...
详细信息
Electromagnetic survey equipment is widely used in the geophysical field, such as mineral exploration and underground oil detection. To meet the demand of high processing speed and flexible maneuverability, this paper proposes a wireless transient electromagnetic system combined virtual instrument and Wi-Fi technology. Transient electromagnetic receiver and transmitter, Wi-Fi communication links and human operation terminal comprise the whole acquisition system. With the implementation of software programmed by using LabVIEW, the system can process in real-time. This system replaces the old dedicated hardware with compact and flexible device with the same functionality and superior performance.
Provenance, or information about the origin or derivation of data, is important for assessing the trustworthiness of data and identifying and correcting mistakes. Most prior implementations of data provenance have inv...
详细信息
ISBN:
(纸本)9781450341486
Provenance, or information about the origin or derivation of data, is important for assessing the trustworthiness of data and identifying and correcting mistakes. Most prior implementations of data provenance have involved heavyweight modifications to database systems and little attention has been paid to how the provenance data can be used outside such a system. We present extensions to the Links programming language that build on its support for language-integrated query to support provenance queries by rewriting and normalizing monadic comprehensions and extending the type system to distinguish provenance metadata from normal data. The main contribution of this paper is to show that the two most common forms of provenance can be implemented efficiently and used safely as a programming language feature with no changes to the database system.
Algorithmic and data refinement are well studied topics that provide a mathematically rigorous approach to gradually introducing details in the implementation of software. Program refinements are performed in the cont...
详细信息
Algorithmic and data refinement are well studied topics that provide a mathematically rigorous approach to gradually introducing details in the implementation of software. Program refinements are performed in the context of some programming language, but mainstream languages lack features for recording the sequence of refinement steps in the program text. To experiment with the combination of refinement, automated verification, and language design, refinement features have been added to the verification-aware programming language Dafny. This paper describes those features and reflects on some initial usage thereof.
The elegant theory of the call-by-value lambda-calculus relies on weak evaluation and closed terms, that are natural hypotheses in the study of programminglanguages. To model proof assistants, however, strong evaluat...
详细信息
ISBN:
(纸本)9783319479576;9783319479583
The elegant theory of the call-by-value lambda-calculus relies on weak evaluation and closed terms, that are natural hypotheses in the study of programminglanguages. To model proof assistants, however, strong evaluation and open terms are required, and it is well known that the operational semantics of call-by-value becomes problematic in this case. Here we study the intermediate setting-that we call Open Call-by-Value-of weak evaluation with open terms, on top of which Gregoire and Leroy designed the abstract machine of Coq. Various calculi for Open Call-by-Value already exist, each one with its pros and cons. This paper presents a detailed comparative study of the operational semantics of four of them, coming from different areas such as the study of abstract machines, denotational semantics, linear logic proof nets, and sequent calculus. We show that these calculi are all equivalent from a termination point of view, justifying the slogan Open Call-by-Value.
A novel parallelized, automated, predictive imprint cooling model (PAPRICO) was developed for modeling and simulation of combustor liners using a Reynolds averaged Navier-Stokes (RANS) approach. The methodology involv...
详细信息
ISBN:
(纸本)9780791849750
A novel parallelized, automated, predictive imprint cooling model (PAPRICO) was developed for modeling and simulation of combustor liners using a Reynolds averaged Navier-Stokes (RANS) approach. The methodology involves removing the film and effusion cooling jet geometry from the liner while retaining the cooling hole imprints on the liner. The PAPRICO can operate under two modalities, viz., two-sided and onesided. For the two-sided PAPRICO model, the imprints are kept on the plenum and combustor sides of the liner. For the one-sided PAPRICO model, the imprints are retained only on the combustor side of the liner and there is no need for a plenum. Consequently, the one-sided PAPRICO significantly reduces the size of the mesh when compared with a mesh that resolves the film and effusion cooling holes. The PAPRICO model neither needs a priori knowledge of the cooling flow rates through various combustor liner regions nor specific mesh partitioning. The PAPRICO model uses the one-dimensional adiabatic, calorifically perfect, total energy equation. The total temperature, total pressure, jet angle, jet orientation, and discharge coefficient are needed to determine the imprint mass flow rate, momentum, enthalpy, turbulent kinetic energy, and eddy dissipation rate. These physical quantities are included in the governing equations as volumetric source terms in cells adjacent to the liner on the combustor side. Additionally, the two-sided PAPRICO model integrates the volumetric sources to calculate their corresponding volumetric sinks in the cells adjacent to the liner on the plenum side. The PAPRICO model user-defined subroutines were written in C programming language and linked to the ANSYS Fluent. A Fluent graphical user interface panel was also developed in Scheme language to effectively and conveniently form effusion cooling regions based on jet angle, jet orientation, pattern, and discharge coefficient. The PAPRICO algorithm automatically identifies and computes the je
Plagiarism is a big concern in academia and it can be a problem in every course. Plagiarism occurs when someone present others work as their own. Students plagiarize in different areas: homework assignments, essays, p...
详细信息
ISBN:
(纸本)9789532330885
Plagiarism is a big concern in academia and it can be a problem in every course. Plagiarism occurs when someone present others work as their own. Students plagiarize in different areas: homework assignments, essays, projects, etc. In this work focus is on programming courses and plagiarism in programming assignments. While source code plagiarism detection, is in some way very similar to text plagiarism detection, it is very different in other ways. So, a lot of research is done focusing on source-code plagiarism. Some questions that are researched in this field are: what is considered plagiarism in programming assignments, how to perform plagiarism detection in programming assignments, how to do it automatically, what tool(s) to use, how students cheat in programming courses, how they try to obfuscate cheating, and many other questions. This work is a review of important research papers in the field of source-code plagiarism detection in academia. This paper tries to answer some of the mentioned research questions and give indication to future work.
暂无评论