scholarly journals THE PROCESS OF DETECTING BLOCKS WITH REPETITIONS AND EXCESS BUILDING USING A LANGUAGE-INDEPENDENT INCREASE DETECTOR

2021 ◽  
Vol 297 (3) ◽  
pp. 39-45
Author(s):  
N. PRAVORSKA ◽  
О. BARMAC ◽  
D. MEDZATIY ◽  
T. SHESTAKEVYCH ◽  
◽  
...  
Keyword(s):  
Data Structure ◽  
Programming Language ◽  
Simple Algorithm ◽  
Inverted Index ◽  
Graphical Methods ◽  
Program Code ◽  
Executable Code ◽  
Software Code ◽  
Automated Tools ◽  
Global Data

To avoid malfunctions of the developed software caused by errors, even when developed by professionals, a number of automated tools are used, which allow to evaluate the software code. A variety of detectors are commonly used to detect errors that occur due to duplicate blocks of executable code. The importance of developing such detectors is that the product is not dependent on the programming language and has a simple algorithm for finding cloned blocks of code. The approach of the language-independent repetition detector is based on a method based on the use of the clone index. It is a global data structure that resembles a typical inverted index. This approach is based on the text, ie the method becomes the basis for research independent of language. In recent years, additional methods have become increasingly popular, which analyze the source and executable code at a smaller level, and there are attempts to avoid unnecessary recalculations, by transferring information between versions. Reviewing the research presented in the works of scientists dealing with this problem, it was decided to propose an approach to improve methods for detecting repetitions and redundancy of program code based on language-independent incremental repetition detector (MNIDP). Most additional research is based on tree-like and graphical methods, ie they are strictly dependent on the programming language. The solution in the MNIDP campaign is to take the text as a basis, ie the method becomes the basis for research independent of language. This technique is not strictly language-independent, but due to the fact that the tokenization stage will be included, with the help of minor adjustments the desired result has been achieved. This provides a detailed analysis of the internal composition (namely, elements) of the detector and explanations of the work at different stages of the detection process.

scholarly journals SPARC Data Structure: Rationale and Design of a FAIR Standard for Biomedical Research Data

2021 ◽  
Author(s):  
Anita Bandrowski ◽  
Jeffrey S. Grethe ◽  
Anna Pilko ◽  
Tom Gillespie ◽  
Gabi Pine ◽  
...  
Keyword(s):  
Data Structure ◽  
Biomedical Research ◽  
Large Scale ◽  
Open Data ◽  
Cell Types ◽  
Research Data ◽  
Imaging Data ◽  
Organ Specific ◽  
The Rich ◽  
Automated Tools

AbstractThe NIH Common Fund’s Stimulating Peripheral Activity to Relieve Conditions (SPARC) initiative is a large-scale program that seeks to accelerate the development of therapeutic devices that modulate electrical activity in nerves to improve organ function. Integral to the SPARC program are the rich anatomical and functional datasets produced by investigators across the SPARC consortium that provide key details about organ-specific circuitry, including structural and functional connectivity, mapping of cell types and molecular profiling. These datasets are provided to the research community through an open data platform, the SPARC Portal. To ensure SPARC datasets are Findable, Accessible, Interoperable and Reusable (FAIR), they are all submitted to the SPARC portal following a standard scheme established by the SPARC Curation Team, called the SPARC Data Structure (SDS). Inspired by the Brain Imaging Data Structure (BIDS), the SDS has been designed to capture the large variety of data generated by SPARC investigators who are coming from all fields of biomedical research. Here we present the rationale and design of the SDS, including a description of the SPARC curation process and the automated tools for complying with the SDS, including the SDS validator and Software to Organize Data Automatically (SODA) for SPARC. The objective is to provide detailed guidelines for anyone desiring to comply with the SDS. Since the SDS are suitable for any type of biomedical research data, it can be adopted by any group desiring to follow the FAIR data principles for managing their data, even outside of the SPARC consortium. Finally, this manuscript provides a foundational framework that can be used by any organization desiring to either adapt the SDS to suit the specific needs of their data or simply desiring to design their own FAIR data sharing scheme from scratch.

CONSTRAINED DISJOINT PATHS IN GEOMETRIC NETWORKS

2009 ◽  
Vol 08 (02) ◽  
pp. 141-154
Author(s):  
LAXMI P. GEWALI ◽  
DAN MAZZELLA ◽  
HENRY SELVARAJ
Keyword(s):  
Data Structure ◽  
Simple Algorithm ◽  
Efficient Algorithms ◽  
Disjoint Paths ◽  
Disjoint Path

We address the problem of constructing a pair of node-disjoint paths connecting two given nodes in a geometric network. We propose a simple algorithm for constructing such a path that does not use any complicated data structure which can be easily implemented. We also consider two variations of disjoint path pair problems which we call narrow corridor problem and width-bounded corridor problem and present efficient algorithms for solving them.

scholarly journals HYBRID TECHNIQUE FOR SOFTWARE CODE CLONE DETECTION

2012 ◽  
Vol 2 (2) ◽  
pp. 98-102
Author(s):  
Priyanka Batta ◽  
Miss Himanshi
Keyword(s):  
Research Area ◽  
Software Systems ◽  
Base Line ◽  
Hybrid Technique ◽  
Clone Detection ◽  
Program Code ◽  
Code Clone ◽  
Text Base ◽  
Software Clone Detection ◽  
Software Code

Software Clone detection is one of the hottest research area that helps in detecting duplicate code from an applications. The research has shown that 5% to 20% of software systems can contain duplicated code that is generated by simply copying the existing program code and pasting with or without minor modifications. Cloning creates problem when a bug is found in one code segment that was copied and pasted at several locations earlier. The objective of this study is to analyze the working of hybrid clone detection technique that design and analyze a hybrid technique for detecting software clone in an application. We will combine metric approach with text base (line of code) technique for the above said reason. A model will be designed to automate the concept of clone detection.

scholarly journals Rancang Bangun Aplikasi Penjualan Perlengkapan Olahraga (Studi Toko Baratha Sports)

2019 ◽  
Vol 5 (1) ◽  
pp. 43-50
Author(s):  
Sinta Rukiastiandari ◽  
Yohanes Ulu Mado
Keyword(s):  
Programming Language ◽  
The Internet ◽  
Program Code ◽  
Transaction Data ◽  
Transaction Process ◽  
Sporting Goods ◽  
Mozilla Firefox ◽  
A Site ◽  
Product Promotion

The Baratha Sports store is a store that serves various types of sales of sports equipment such as socks, soccer shoes, soccer clothes and other things. In 2013, this shop was founded by Mr. Tohir Adnan, located on Jalan Kinibalu Raya No.19 Harapan Jaya, Bekasi Utara. During this time the process of recording sales, processing the data of sporting goods and sales transaction data is still done using handwriting and still using book media. Difficulties in the process of recording sales and calculating the number of types and quantities of goods resulted in the data obtained being less accurate. To improve the accuracy of the data, it is necessary to develop a computerized sales information system.In this writing the author will present a site on the internet that deals with the sale of sports equipment, which aims to convey information on the sale of sports equipment online, making it easier for consumers to purchase products from the Baratha Sports Shop. In this research phase the making of program code the author uses supporting software such as Xampp, Programming Language PHP, HTML, Jquery and CSS and databases using MySQL. and the method used using the Waterfall method. Mozilla Firefox as a browser, Microsoft paint for editing images.This application is expected to help users (users) in the transaction process ordering equipment and sports equipment, facilitate the checking of the amount of equipment available sports equipment and facilitate the company in disseminating information and product promotion.

scholarly journals APPLICATION OF GIS FOR MANAGING CHANGES OF LAND PARCELS OVER TIME

2010 ◽  
Vol 13 (1) ◽  
pp. 77-83
Author(s):  
Duc Trong Tran
Keyword(s):  
Data Structure ◽  
Information Management ◽  
Programming Language ◽  
Current Data ◽  
Specific Point ◽  
Temporal Gis ◽  
The Past ◽  
Over Time ◽  
Application Of Gis

The GISs which are used for land information management in VietNam not enabled us to anser questions such as "How was this parcel changed in the past? ..." To address this issue, a temporal GIS module is researched and developed which is based on ArcGIS current data structure and programming language ArcObject. Experiment results illustrate the capability of this newly developed GIS module in monitoring temporal parcel history and reconstructing whole parcels state at a specific point in time.

Research on Budget Quota Method Based on P3e/c for Hydraulic and Hydropower Engineering

2012 ◽  
Vol 170-173 ◽  
pp. 2004-2007
Author(s):  
Fei Fei Pan ◽  
Ning Li ◽  
Yong Lei Cao ◽  
Le Zhang
Keyword(s):  
Decision Making ◽  
Data Structure ◽  
Statistical Method ◽  
Programming Language ◽  
Data Frame ◽  
Quota System ◽  
Engineering Construction ◽  
Construction Scheduling ◽  
Java Programming ◽  
Hydropower Engineering

According to lacking a statistical method of resource and quantity under a unified standard in hydraulic and hydropower engineering construction, the budget quota method based on P3e/c was proposed. The hierarchy structure of data-frame of P3e/c and the data structure of budget quota were analyzed. The budget quota system based on P3e/c was developed by utilizing JAVA programming language. A certain hydraulic and hydropower engineering in southwest of China was taken as an example. The results indicate that the veracity, universality and efficiency of construction scheduling have been improved significantly by integrating budget quota and P3e/c. Moreover, it provides the basic data for construction scheduling statistic and analysis. The proposed method provides decision making basis for designers and managers.

SCIENTIFIC GRAPHICS IN PASCALABC.NET: PLOTTING FUNCTION GRAPHS IN A RECTANGULAR CARTESIAN COORDINATE SYSTEM

2020 ◽  
pp. 31-39
Author(s):  
V. O. Dzhenzher ◽  
L. V. Denisova
Keyword(s):  
Coordinate System ◽  
Programming Language ◽  
Distinctive Feature ◽  
Natural System ◽  
Cartesian Coordinate System ◽  
Program Code ◽  
System A ◽  
Cartesian Coordinate ◽  
Screen System

The article considers the algorithm for plotting functions in a rectangular Cartesian coordinate system. A method is described for converting coordinates from a natural system to a screen system. The algorithm is implemented in the programming language PascalABC.NET. The necessary information about the graphical tools of the language is presented, the program code with detailed explanations is given. A distinctive feature of the method is the use of visual and easily calculated parameters for scaling the graph.

scholarly journals Frequent item set mining using normalized FP-growth algorithm

2018 ◽  
Vol 7 (1.7) ◽  
pp. 59
Author(s):  
N K. Manikandan ◽  
D Manivannan
Keyword(s):  
Data Structure ◽  
Association Rule ◽  
Association Rule Mining ◽  
Hamming Distance ◽  
Data Access ◽  
Main Memory ◽  
Inverted Index ◽  
Rule Mining ◽  
High Dimension Data ◽  
Index Mapping

As the volume of data and its storage schemes are increasing drastically, the knowledge discovery from these huge volume of heterogeneous and high dimension data emerges as an essential process. Number of algorithms for data association analysis has been introduced considering time and main memory requirements. However this algorithms get completed when the items and records grows extremely high. In this paper we have created a data structure that can be reused without modifying the schema. So the aim of this work is to make an efficient association rule mining independent of the algorithm being selected.Our data structure make data access much faster by simplifying and reorganizing them by implementing shuffling strategy using hamming distance and inverted index mapping. In this work we explore our algorithm’s efficiency by using many datasets containing millions of records in it. We increased the runtime orders of the magnitude and reduced the auxiliary and main memory requirements. 

Sign in / Sign up

Export Citation Format

Share Document