Native Development Kit and Software Development Kit Comparison for Android Applications

2017 ◽  
Vol 6 (3) ◽  
pp. 5-13
Author(s):  
Arturo Mascorro ◽  
Francisco Mesa ◽  
Jose Alvarez ◽  
Laura Cruz
Keyword(s):  
Software Development ◽  
Comparative Study ◽  
Discrete Cosine Transform ◽  
Matrix Multiplication ◽  
Computational Cost ◽  
Sorting Algorithm ◽  
Memory Usage ◽  
Memory Consumption ◽  
Java Language ◽  
Android Applications

ABSTRACTA computational cost comparative study through both Java and C applications was developed. Computational routines consist of a matrix multiplications, the discrete cosine transform and the bubble-sorting algorithm. Memory and Runtime for each application were measure. It was determined that the runtime of matrix multiplication in Java was within the limits of 200 and 300 milliseconds, as opposed to the application developed in C, which shown to be stable with an execution period less than 20 milliseconds. In the ordering algorithm with the bubble method, it was observe that the Java language show be very slow compared to C. In addition, the memory usage was lower in most of the applications, showing a minimum difference. Applications were tested in both, a mobile LG-E510f and a Laptop Toshiba Satellite. The study allowed to report the profit generated in both runtime and memory consumption when performing a native implementation in C and Java.

Fast Bilinear Algorithms for Symmetric Tensor Contractions

2020 ◽  
Vol 0 (0) ◽  
Author(s):  
Edgar Solomonik ◽  
James Demmel
Keyword(s):  
Symmetric Matrix ◽  
Matrix Multiplication ◽  
Computational Cost ◽  
Symmetric Tensor ◽  
Partial Sums ◽  
Symmetric Tensors ◽  
Outer Product ◽  
Bilinear Complexity ◽  
Special Cases ◽  
Tensor Contractions

AbstractIn matrix-vector multiplication, matrix symmetry does not permit a straightforward reduction in computational cost. More generally, in contractions of symmetric tensors, the symmetries are not preserved in the usual algebraic form of contraction algorithms. We introduce an algorithm that reduces the bilinear complexity (number of computed elementwise products) for most types of symmetric tensor contractions. In particular, it lowers the bilinear complexity of symmetrized contractions of symmetric tensors of order {s+v} and {v+t} by a factor of {\frac{(s+t+v)!}{s!t!v!}} to leading order. The algorithm computes a symmetric tensor of bilinear products, then subtracts unwanted parts of its partial sums. Special cases of this algorithm provide improvements to the bilinear complexity of the multiplication of a symmetric matrix and a vector, the symmetrized vector outer product, and the symmetrized product of symmetric matrices. While the algorithm requires more additions for each elementwise product, the total number of operations is in some cases less than classical algorithms, for tensors of any size. We provide a round-off error analysis of the algorithm and demonstrate that the error is not too large in practice. Finally, we provide an optimized implementation for one variant of the symmetry-preserving algorithm, which achieves speedups of up to 4.58\times for a particular tensor contraction, relative to a classical approach that casts the problem as a matrix-matrix multiplication.

scholarly journals A Flexible Proof Format for SAT Solver-Elaborator Communication

2021 ◽  
pp. 59-75
Author(s):  
Seulkee Baek ◽  
Mario Carneiro ◽  
Marijn J. H. Heule
Keyword(s):  
Computational Cost ◽  
Memory Usage ◽  
Median Reduction ◽  
Implementation Effort ◽  
Sat Solver ◽  
Proof Methods

AbstractWe introduce , a new proof format for unsatisfiable SAT problems, and its associated toolchain. Compared to , the format allows solvers to include more information in proofs to reduce the computational cost of subsequent elaboration to . The format is easy to parse forward and backward, and it is extensible to future proof methods. The provision of optional proof steps allows SAT solver developers to balance implementation effort against elaboration time, with little to no overhead on solver time. We benchmark our toolchain against a comparable toolchain and confirm >84% median reduction in elaboration time and >94% median decrease in peak memory usage.

scholarly journals Empirical study prove that breadth-first search is more effective memory usage than depth-first search in frontier boundary cyclic graph

2021 ◽  
Vol 10 (2) ◽  
pp. 265
Author(s):  
Al Refai Mohammed N. ◽  
Jamhawi Zeyad
Keyword(s):  
Memory Usage ◽  
Graph Searching ◽  
Breadth First Search ◽  
Memory Consumption ◽  
Depth First Search ◽  
Spiral Path ◽  
Level Number ◽  
Graph Size ◽  
Cyclic Graph ◽  
Better Than

<p><span id="docs-internal-guid-06e4528a-7fff-0e38-150e-f136d6f22d84"><span>Memory consumption, of opened and closed lists in graph searching algorithms, affect in finding the solution. Using frontier boundary will reduce the memory usage for a closed list, and improve graph size expansion. The blind algorithms, depth-first frontier Searches, and breadth-first frontier Searches were used to compare the memory usage in slide tile puzzles as an example of the cyclic graph. This paper aims to prove that breadth-first frontier search is better than depth-first frontier search in memory usage. Both opened and closed lists in the cyclic graph are used. The level number and nodes count at each level for slide tile puzzles are changed when starting from different empty tile location. Eventually, the unorganized spiral path in depth-first search appears clearly through moving inside the graph to find goals.</span></span></p>

Independent Living Support for Disabled and Elderly People using Cell Phones

2013 ◽  
pp. 379-397
Author(s):  
Begoña García Zapirain ◽  
Amaia Mendez Zorrilla
Keyword(s):  
Independent Living ◽  
Technical Assistance ◽  
Smart Phones ◽  
Work Place ◽  
Technological Solution ◽  
Java Language ◽  
Deep State ◽  
Android Applications ◽  
Server Application ◽  
Application Module

This chapter presents a technological solution to promote and help independent access to work for disabled people using Smart Phones. A deep state of the art about smart phones technologies and about examples of other projects is presented. The aim is to develop a form of technical assistance that supports them in the control of schedules, prevention of dangerous areas in the work place, warnings, and automatic alarm generation. The device chosen to exchange all this information is a Smartphone based on Android Operating System and GPS technology. A set of Android applications have been developed using Java language, and controlling the device via Google-developed Java libraries. All of these are connected to the Server Application through the Communications Module. The server Application Module provides the assistants or psychologists the possibility of supervise all the handicapped people’s activities. The assistants, psychologists, and users have all evaluated the application very positively as it covers disabled people’s needs perfectly.

Object-Oriented Cognitive Complexity Measures

2017 ◽  
pp. 917-940
Author(s):  
Sanjay Misra ◽  
Adewole Adewumi
Keyword(s):  
Software Development ◽  
Comparative Study ◽  
Critical Review ◽  
Cognitive Complexity ◽  
Object Oriented ◽  
Point Of View ◽  
Complexity Measures ◽  
Cognitive Informatics ◽  
Validation Criteria ◽  
Object Oriented Metrics

This chapter presents the analysis of ten recently proposed object-oriented metrics based on cognitive informatics. The metrics based on cognitive informatics use cognitive weight. Cognitive weight is the representation of the understandability of the piece of software that evaluates the difficulty experienced in comprehending and/or performing the piece of software. Development of metrics based on Cognitive Informatics (CI) is a new area of research, and from this point of view, for the analysis of these metrics, it is important to know their acceptability from other existing evaluation and validation criteria. This chapter presents a critical review on existing object-oriented cognitive complexity measures. In addition, a comparative study based on some selected attributes is presented.

Comparing Software Bugs in Clone and Non-clone Code: An Empirical Study

2017 ◽  
Vol 27 (09n10) ◽  
pp. 1507-1527
Author(s):  
Judith F. Islam ◽  
Manishankar Mondal ◽  
Chanchal K. Roy ◽  
Kevin A. Schneider
Keyword(s):  
High Risk ◽  
Empirical Study ◽  
Software Development ◽  
Comparative Study ◽  
Software Maintenance ◽  
Statistical Significance ◽  
Ongoing Debate ◽  
Software Bugs ◽  
Bug Fixing

Code cloning is a recurrent operation in everyday software development. Whether it is a good or bad practice is an ongoing debate among researchers and developers for the last few decades. In this paper, we conduct a comparative study on bug-proneness in clone code and non-clone code by analyzing commit logs. According to our inspection of thousands of revisions of seven diverse subject systems, the percentage of changed files due to bug-fix commits is significantly higher in clone code compared with non-clone code. We perform a Mann–Whitney–Wilcoxon (MWW) test to show the statistical significance of our findings. In addition, the possibility of occurrence of severe bugs is higher in clone code than in non-clone code. Bug-fixing changes affecting clone code should be considered more carefully. Finally, our manual investigation shows that clone code containing if-condition and if–else blocks has a high risk of having severing bugs. Changes to such types of clone fragments should be done carefully during software maintenance. According to our findings, clone code appears to be more bug-prone than non-clone code.

scholarly journals Applying Two Simplified Ellipse-Based Tangential Models to Wheel-Rail Contact Using Three Alternative Nonelliptic Adaptation Approaches: A Comparative Study

2019 ◽  
Vol 2019 ◽  
pp. 1-17 ◽  
Author(s):  
Boyang An ◽  
Ping Wang ◽  
Jiayi Zhou ◽  
Rong Chen ◽  
Jingmang Xu ◽  
...  
Keyword(s):  
Comparative Study ◽  
Computational Cost ◽  
Rolling Contact ◽  
Railway Vehicle ◽  
Normal Contact ◽  
Tangential Contact ◽  
Track Dynamics ◽  
Contact Models ◽  
Creep Force

In the modeling of railway vehicle-track dynamics and wheel-rail damage, simplified tangential contact models based on ellipse assumption are usually used due to strict limitation of computational cost. Since most wheel-rail contact cases appear to be nonelliptic shapes, a fast and accurate tangential model for nonelliptic contact case is in demand. In this paper, two ellipse-based simplified tangential models (i.e., FASTSIM and FaStrip) using three alternative nonelliptic adaptation approaches, together with Kalker’s NORM algorithm, are applied to wheel-rail rolling contact cases. It aims at finding the best approach for dealing with nonelliptic rolling contact. Compared to previous studies, the nonelliptic normal contact solution in the present work is accurately solved rather than simplification. Therefore, it can avoid tangential modeling evaluation affected by inaccurate normal contact solution. By comparing with Kalker’s CONTACT code, it shows both FASTSIM-based and FaStrip-based models can provide accurate global creep force. With regard to local rolling contact solution, only the accuracy of FaStrip-based models is satisfactory. Moreover, Ayasse-Chollet’s local ellipse approach appears to be the best choice for nonelliptic adaptation.

Sign in / Sign up

Export Citation Format

Share Document