34 results
Search Results
2. Algorithms for the Uniqueness of the Longest Common Subsequence.
- Author
-
Wang, Yue
- Subjects
ALGORITHMS ,COMPUTER science - Abstract
Given several number sequences, determining the longest common subsequence is a classical problem in computer science. This problem has applications in bioinformatics, especially determining transposable genes. Nevertheless, related works only consider how to find one longest common subsequence. In this paper, we consider how to determine the uniqueness of the longest common subsequence. If there are multiple longest common subsequences, we also determine which number appears in all/some/none of the longest common subsequences. We focus on four scenarios: (1) linear sequences without duplicated numbers; (2) circular sequences without duplicated numbers; (3) linear sequences with duplicated numbers; (4) circular sequences with duplicated numbers. We develop corresponding algorithms and apply them to gene sequencing data. [ABSTRACT FROM AUTHOR]
- Published
- 2023
- Full Text
- View/download PDF
3. AHiLS—An Algorithm for Establishing Hierarchy among Detected Weak Local Reflection Symmetries in Raster Images.
- Author
-
Podgorelec, David, Kolingerová, Ivana, Lovenjak, Luka, and Žalik, Borut
- Abstract
A new algorithm is presented for detecting the local weak reflection symmetries in raster images. It uses contours extracted from the segmented image. A convex hull is constructed on the contours, and so-called anchor points are placed on it. The bundles of symmetry line candidates are placed in these points. Each line splits the plane into two open half-planes and arranges the contours into three sets: the first contains the contours pierced by the considered line, while the second and the third include the contours located in one or the other half-plane. The contours are then checked for the reflection symmetry. This means looking for self-symmetries in the first set, and symmetric pairs with one contour in the second set and one contour in the third set. The line which is evaluated as the best symmetry line is selected. After that, the symmetric contours are removed from sets two and three. The remaining contours are then checked again for symmetry. A multi-branch tree representing the hierarchy of the detected local symmetries is the result of the algorithm. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
4. Assyrian merchants meet nuclear physicists: history of the early contributions from social sciences to computer science. The case of automatic pattern detection in graphs (1950s–1970s).
- Author
-
Plutniak, Sébastien
- Subjects
COMPUTER science ,SCIENTIFIC computing ,NP-complete problems ,PHYSICISTS ,MERCHANTS ,TECHNOLOGY transfer - Abstract
Community detection is a major issue in network analysis. This paper combines a socio-historical approach with an experimental reconstruction of programs to investigate the early automation of clique detection algorithms, which remains one of the unsolved NP-complete problems today. The research led by the archaeologist Jean-Claude Gardin from the 1950s on non-numerical information and graph analysis is retraced to demonstrate the early contributions of social sciences and humanities. The limited recognition and reception of Gardin's innovative computer application to the humanities are addressed through two factors, in addition to the effects of historiography and bibliographies on the recording, discoverability, and reuse of scientific productions: (1) funding policies, evidenced by the transfer of research effort on graph applications from temporary interdisciplinary spaces to disciplinary organizations related to the then-emerging field of computer science; and (2) the erratic careers of algorithms, in which efficiency, flaws, corrections, and authors' status, were determining factors. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
5. METAHEURISTIC OPTIMIZATION ALGORITHM BASED ON THE TWO-STEP ADAMS-BASHFORTH METHOD IN TRAINING MULTI-LAYER PERCEPTRONS.
- Author
-
Khudhur, Hisham M. and Ibraheem, Kais I.
- Subjects
MULTILAYER perceptrons ,METAHEURISTIC algorithms ,MATHEMATICAL optimization ,COMPUTER science ,UNEMPLOYMENT statistics ,RANDOM variables ,PROBLEM solving - Abstract
The proposed metaheuristic optimization algorithm based on the two-step Adams-Bashforth scheme (MOABT) was used in this paper for Multilayer Perceptron Training (MLP). In computer science and mathematical examples, metaheuristic is high-level procedures or guidelines designed to find, devise, or select algorithmic research methods to obtain high-quality solutions to an example problem, especially if the information is insufficient or incomplete, or if computational capacity is limited. Many metaheuristic methods include some stochastic example operations, which means that the resulting solution is dependent on the random variables that are generated during the search. The use of higher evidence can frequently find good solutions with less computational effort than iterative methods and algorithms because it searches a broad range of feasible solutions at the same time. Therefore, metaheuristic is a useful approach to solving example problems. There are several characteristics that distinguish metaheuristic strategies for the research process. The goal is to efficiently explore the search perimeter to find the best and closest solution. The techniques that make up metaheuristic algorithms range from simple searches to complex learning processes. Eight model data sets are used to calculate the proposed approach, and there are five classification data sets and three proximate job data sets included in this set. The numerical results were compared with those of the well-known evolutionary trainer Gray Wolf Optimizer (GWO). The statistical study revealed that the MOABT algorithm can outperform other algorithms in terms of avoiding local optimum and speed of convergence to global optimum. The results also show that the proposed problems can be classified and approximated with high accuracy. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
6. AN ANALYSIS OF DIFFERENT COMPUTER SCIENCE ALGORITHMS WITH THE GRAPH THEORY OF MATHEMATICS.
- Author
-
Donga, Jayna, Bhojak, Priyank, Patel, Kanu, and Shah, Vatsal
- Subjects
COMPUTER science ,GRAPH theory - Abstract
The field of mathematics plays an important role in different domains. one of the important concept of mathematics is the Graph theory which is most commonly used in area of computer science to design computer algorithms. The well-known problem in mathematics which represents graph theory is the Travelling salesman problem. The travelling sales man problem is the problem in graph theory needs to find optimal path (i.e. minimum total distance) to traverse all the cities with the constraint to returning back to the initial state (city). There is no general solutions available to solve this problem but there is similarity between the travelling sales man problem and minimum spanning tree. so, this problem can be implemented with the help of minimum spanning tree which also focus on finding minimum distance for each nodes with the constraint of not to form any cycle. In this paper we have presented few computer science algorithms which are implemented using graph theory of mathematics and also tried to analyze their differences and applications. [ABSTRACT FROM AUTHOR]
- Published
- 2021
7. FLoCIC: A Few Lines of Code for Raster Image Compression.
- Author
-
Žalik, Borut, Strnad, Damjan, Kohek, Štefan, Kolingerová, Ivana, Nerat, Andrej, Lukač, Niko, Lipuš, Bogdan, Žalik, Mitja, and Podgorelec, David
- Subjects
IMAGE compression ,JPEG (Image coding standard) ,ENTROPY (Information theory) - Abstract
A new approach is proposed for lossless raster image compression employing interpolative coding. A new multifunction prediction scheme is presented first. Then, interpolative coding, which has not been applied frequently for image compression, is explained briefly. Its simplification is introduced in regard to the original approach. It is determined that the JPEG LS predictor reduces the information entropy slightly better than the multi-functional approach. Furthermore, the interpolative coding was moderately more efficient than the most frequently used arithmetic coding. Finally, our compression pipeline is compared against JPEG LS, JPEG 2000 in the lossless mode, and PNG using 24 standard grayscale benchmark images. JPEG LS turned out to be the most efficient, followed by JPEG 2000, while our approach using simplified interpolative coding was moderately better than PNG. The implementation of the proposed encoder is extremely simple and can be performed in less than 60 lines of programming code for the coder and 60 lines for the decoder, which is demonstrated in the given pseudocodes. [ABSTRACT FROM AUTHOR]
- Published
- 2023
- Full Text
- View/download PDF
8. Revival of Classical Algorithms: A Bibliometric Study on the Trends of Neural Networks and Genetic Algorithms.
- Author
-
Lou, Ta-Feng and Hung, Wei-Hsi
- Subjects
GENETIC algorithms ,ARTIFICIAL intelligence ,COMPUTER science ,ALGORITHMS ,BIBLIOMETRICS ,SYNTHETIC biology ,DEEP learning - Abstract
The purpose of our bibliometric research was to capture and analyze the trends of two types of well-known classical artificial intelligence (AI) algorithms: neural networks (NNs) and genetic algorithms (GAs). Symmetry is a very popular international and interdisciplinary scientific journal that cover six major research subjects of mathematics, computer science, engineering science, physics, biology, and chemistry which are all related to our research on classical AI algorithms; therefore, we referred to the most innovative research articles of classical AI algorithms that have been published in Symmetry, which have also introduced new advanced applications for NNs and Gas. Furthermore, we used the keywords of "neural network algorithm" or "artificial neural network" to search the SSCI database from 2002 to 2021 and obtained 951 NN publications. For comparison purposes, we also analyzed GA trends by using the keywords "genetic algorithm" to search the SSCI database over the same period and we obtained 878 GA publications. All of the NN and GA publication results were categorized into eight groups for deep analyses so as to investigate their current trends and forecasts. Furthermore, we applied the Kolmogorov–Smirnov test (K–S test) to check whether our bibliometric research complied with Lotka's law. In summary, we found that the number of applications for both NNs and GAs are continuing to grow but the use of NNs is increasing more sharply than the use of GAs due to the boom in deep learning development. We hope that our research can serve as a roadmap for other NN and GA researchers to help them to save time and stay at the cutting edge of AI research trends. [ABSTRACT FROM AUTHOR]
- Published
- 2023
- Full Text
- View/download PDF
9. Time-Aware Boolean Spatial Keyword Queries.
- Author
-
Chen, Gang, Zhao, Jingwen, Gao, Yunjun, Chen, Lei, and Chen, Rui
- Subjects
BOOLEAN functions ,LOCATION-based services ,KEYWORDS ,SEARCH algorithms ,TAGS (Metadata) - Abstract
With advances in geo-positioning technologies and mobile internet, location-based services have attracted much attention, and spatial keyword queries are catching on fast. However, as far as we aware, no prior work considers the temporal information of geo-tagged objects. Temporal information is important in the spatial keyword query because many objects are not always valid. For example, visitors may plan their trips according to the opening time of attractions. In this paper, we identify and solve a novel problem, i.e., the time-aware Boolean spatial keyword query (TABSKQ), which returns the $k$
- Published
- 2017
- Full Text
- View/download PDF
10. Extended network and algorithm finding maximal flows.
- Author
-
Viet, Tran Ngoc and Le Hong Dung
- Subjects
ALGORITHMS ,COMPUTER science ,EDGES (Geometry) - Abstract
Graph is a powerful mathematical tool applied in many fields as transportation, communication, informatics, economy, in ordinary graph the weights of edges and vertexes are considered independently where the length of a path is the sum of weights of the edges and the vertexes on this path. However, in many practical problems, weights at a vertex are not the same for all paths passing this vertex, but depend on coming and leaving edges. The paper develops a model of extended network that can be applied to modelling many practical problems more exactly and effectively. The main contribution of this paper is algorithm finding maximal flows on extended networks. [ABSTRACT FROM AUTHOR]
- Published
- 2020
- Full Text
- View/download PDF
11. DISCRETE MATHEMATICS AND PROGRAMMING - TEACHING AND LEARNING APPROACHES.
- Author
-
Raykova, Mariyana, Kostadinova, Hristina, and Boev, Stoyan
- Subjects
DISCRETE mathematics ,MATHEMATICAL programming ,LEARNING ,COMPUTER science - Abstract
Discrete mathematics is one of the most important parts of the introduction to programming. Although known as the basis of writing good software and its usage is necessary, the students have many difficulties while gaining the competency to apply it in software projects. In order to make it a little bit easier for learners, an additional course Discrete Mathematics and Programming was conducted in the Informatics major in the New Bulgarian University. Its objectives, conduction, some exemplary tasks and homework are presented in this paper. The difficulties in the learning process and different approaches to reduce them are discussed. [ABSTRACT FROM AUTHOR]
- Published
- 2019
12. A review of applied methods of optimization in steel structures.
- Author
-
Kazem, Alireza and Matinrad, Pantea
- Subjects
BEES algorithm ,METAHEURISTIC algorithms ,STEEL ,COMPUTER science ,MATHEMATICAL optimization - Abstract
Recent dazzling progress in computer science and stringent requirements of the design of "more optimized" buildings put forwards the study and research of the various optimization methods in the building sector. This study presents a comprehensive review of the state‐of‐the‐art and the most applicable algorithms applying computational optimization to Steel buildings and different steel design problems. Four different algorithms including Neural Network, Bee and Bat‐Inspired algorithm and Metaheuristic Optimization algorithm have been studied with emphasized on the application of these methods in steel structures. Algorithm Key points are reviewed with more details including configuration of the algorithms and control of building systems, besides particular attention on accuracy and capability of them to be converged as an optimized solution. From different convergence rate, number of unknown parameters and boundaries of solutions It can be concluded that in near future researches should be oriented towards improving the efficiency of the most effective search techniques and realistic approximation methods especially in large‐scale building optimization problems; and reducing time with increasing accuracy for such activities. Further effort should be required to quantify the robustness in optimal answers so as to improve building performance. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
13. A Role for IEEE in Quantum Computing.
- Author
-
DeBenedictis, Erik P.
- Subjects
QUANTUM computing ,BENCHMARKING (Management) ,ARTIFICIAL intelligence ,COMPUTER science ,TOTAL quality management - Abstract
Will quantum computation become an important milestone in human progress? Passionate advocates and equally passionate skeptics abound. IEEE already provides useful, neutral forums for state-of-the-art science and engineering knowledge as well as practical benchmarks for quantum computation evaluation. But could the organization do more? [ABSTRACT FROM AUTHOR]
- Published
- 2018
- Full Text
- View/download PDF
14. GPSPA: a new adaptive algorithm for maintaining shortest path routing trees in stochastic networks.
- Author
-
Misra, Sudip and Oommen, B. John
- Subjects
ALGORITHMS ,STOCHASTIC processes ,TELECOMMUNICATION ,COMPUTER systems ,COMPUTER science - Abstract
This paper presents a new efficient solution to the Dynamic Shortest Path Routing Problem, using the principles of Generalized Pursuit Learning. It proposes an efficient algorithm for maintaining shortest path routing trees in networks that undergo stochastic updates in their structure. It involves finding the shortest path in a stochastic network, where there are continuous probabilistically based updates in link-costs. In vast, rapidly changing telecommunications (wired or wireless) networks, where links go up and down continuously and rapidly, and where there are simultaneous random updates in link costs, the existing algorithms are inefficient. In such cases, shortest paths need to be computed within a very short time (often in the order of microseconds) by scanning and processing the minimal number of nodes and links. The proposed algorithm, referred to as the Generalized Pursuit Shortest Path Algorithm (GPSPA), will be very useful in this regard, because after convergence, it seems to be the best algorithm to-date for this purpose. Indeed, it has the advantage that it can be used to find the shortest path within the ‘statistical’ average network, which converges irrespective of whether there are new changes in link-costs or not. Existing algorithms are not characterized by such a behaviour inasmuch as they would recalculate the affected shortest paths after each link-cost update. The algorithm has been rigorously evaluated experimentally, and it has been found to be a few orders of magnitude superior to the algorithms available in the literature. Copyright © 2004 John Wiley & Sons, Ltd. [ABSTRACT FROM AUTHOR]
- Published
- 2004
- Full Text
- View/download PDF
15. The Research of Localization Protocol for Wireless Sensor Networks.
- Author
-
Minwei He
- Subjects
LOCALIZATION (Mathematics) ,WIRELESS sensor networks ,COMPUTER algorithms ,MAXIMUM likelihood statistics ,DATA packeting ,COMPUTER science ,DATA transmission systems - Abstract
In this paper, we present a localization protocol for wireless sensor networks. The protocol provides three types of localization algorithms, namely, The localization algorithm during the phase of initialization The localization algorithm for new wireless sensor node, and the localization algorithm for moved beacon node. In the first localization algorithm, the trilateration and maximum likelihood estimation are used. During the phase of initialization, the nodes, that their positions had been confirmed, are allowed to send the data packets contained the localization message. The nodes, that their positions are unknown, are not allowed to send any data packet during the phase of initialization, are allowed to receive the data packets from other nodes. During the normal runtime of wireless sensor networks, the new nodes are allowed to send the inquiring data packet. In this localization protocol, the second sign, that is need in TOA(time of arrival), TDOA(time difference of arrival), and RSSI(received signal strength indicator), is not needed. [ABSTRACT FROM AUTHOR]
- Published
- 2009
16. TOTAL DUAL INTEGRALITY IN SOME FACILITY LOCATION PROBLEMS.
- Author
-
XUJIN CHEN, ZHIBIN CHEN, and WENAN ZANG
- Subjects
FACILITY location problems ,POLYHEDRA ,DUAL integral equations ,ALGORITHMS ,OPERATIONS research ,COMPUTER science - Abstract
Facility location, arising in a rich variety of applications, has been studied extensively in the fields of operations research and computer science. In this paper we consider the classical uncapacitated facility location problem and its "prize-collecting" variant introduced by Baïou and Barahona, and we show that the linear systems associated with these problems are totally dual integral if and only if the input graphs do not contain a certain type of odd cycles. As corollaries, we get structural characterizations of two min-max relations on facility location. Our results strengthen the integrality theorems on facility location polytopes proved by Baïou and Barahona; our proofs lead to combinatorial polynomial-time algorithms for the facility location problems that we consider. [ABSTRACT FROM AUTHOR]
- Published
- 2012
- Full Text
- View/download PDF
17. LA COMPETENCIA ELABORAR PROGRAMAS INFORMÁTICOS DESDE EL PROCESO DE ENSEÑANZA--APRENDIZAJE DE LA DISCIPLINA LENGUAJE Y TÉCNICAS DE PROGRAMACIÓN.
- Author
-
Martínez Maillo, Sergio and Fariñas Almuiña, Juan Luis
- Subjects
COMPUTER science ,ALGORITHMS ,PROGRAMMING languages ,TEACHING ,LEARNING - Abstract
Copyright of Revista Didasc@lia: Didáctica y Educación is the property of Universitaria de Las Tunas, Centro de Estudios de Didactica and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
- Published
- 2012
18. Analysis Algorithms to Search the Web Links.
- Author
-
Ramona, Stancu Ana-Maria and Cristian, Apetrei Marius
- Subjects
ALGORITHMS ,INTERNET searching ,SEARCH algorithms ,SEARCH engines ,MATHEMATICS ,COMPUTER science - Abstract
In this paper we want to achieve an algorithm for carrying out searches on the web. We speak of the two algorithms, namely Kleinberg and Page Rank, search algorithms. [ABSTRACT FROM AUTHOR]
- Published
- 2012
19. Weighing Matrices and String Sorting.
- Author
-
Kotsireas, Ilias, Koukouvinos, Christos, and Seberry, Jennifer
- Subjects
ALGORITHMS ,SPECTRAL energy distribution ,COMPUTER science ,COMBINATORICS ,MATHEMATICAL analysis - Abstract
In this paper we establish a fundamental link between the search for weighing matrices constructed from two circulants and the operation of sorting strings, an operation that has been studied extensively in computer science. In particular, we demonstrate that the search for weighing matrices constructed from two circulants using the power spectral density criterion and exploiting structural patterns for the locations of the zeros in candidate solutions, can be viewed as a string sorting problem together with a linear time algorithm to locate common strings in two sorted arrays. This allows us to bring into bear efficient algorithms from the string sorting literature. We also state and prove some new enhancements to the power spectral density criterion, that allow us to treat successfully the rounding error effect and speed up the algorithm. Finally, we use these ideas to find new weighing matrices of order 2 n and weights 2 n – 13, 2 n – 17 constructed from two circulants. [ABSTRACT FROM AUTHOR]
- Published
- 2009
- Full Text
- View/download PDF
20. ROUTABILITY-DRIVEN PACKING:: METRICS AND ALGORITHMS FOR CLUSTER-BASED FPGAs.
- Author
-
Bozorgzadeh, E., Memik, S. Ogrenci, Yang, X., and Sarrafzadeh, M.
- Subjects
ALGORITHMS ,ELECTRONIC systems ,VERY large scale circuit integration ,ELECTRONIC circuits ,ELECTRONICS ,COMPUTER science - Abstract
Most of the FPGA's area and delay are due to routing. Considering routability at earlier steps of the CAD flow would both yield better quality and faster design process. In this paper, we discuss the metrics that affect routability in packing logic into clusters. We are presenting a routability-driven clustering method for cluster-based FPGAs. Our method packs LUTs into logic clusters while incorporating routability metrics into a cost function. Based on our routability model, the routability in timing-driven packing algorithm is analyzed. We integrate our routability model into a timing-driven packing algorithm. Our method yields up to 50% improvement in terms of the minimum number of routing tracks compared to VPack (16.5% on average). The average routing area improvement is 27% over VPack and 12% over t-VPack. [ABSTRACT FROM AUTHOR]
- Published
- 2004
- Full Text
- View/download PDF
21. Thinking Algorithmically: From Cold War Computer Science to the Socialist Information Culture.
- Author
-
TATARCHENKO, KSENIA
- Subjects
AUTOMATION ,COLD War, 1945-1991 ,COMPUTER science - Abstract
Cold War competition shaped the process of computerization in both East and West during the second half of the twentieth century. This article combines insights from Science and Technology Studies, which brought the analysis of Cold War technopolitics beyond the context of the nation-state, with approaches from Critical Algorithm Studies, to question the algorithm's role in the global "computer revolution." It traces the algorithm's trajectory across several geographical, political, and discursive spaces to argue that its mutable cultural valences made the algorithm a universalizing attribute for representing human-machine interactions across the ideological divide. It shows that discourses about the human capacity to devise algorithms, a practice central to computer programming, became a space for negotiating different versions of modern subjectivity. This article focuses on two related episodes to demonstrate how the notion of "algorithmic thinking" became explicitly associated with a range of politicized agendas, each claiming the algorithm's power. On one hand, the coupling of "algorithm" and "thinking" was used to describe a naturalized cognitive capacity shared among the members of the international scientific community and projected backward to the medieval scholar Al-Khwarizmi. On the other hand, the universal spread of "algorithmic thinking" became the educational goal of a late Soviet computer literacy campaign under the slogan of "Programming, the Second Literacy," a metaphor and a political vision conceived to bring about the Socialist "Information Age. [ABSTRACT FROM AUTHOR]
- Published
- 2019
- Full Text
- View/download PDF
22. Bilgi İşlemsel Düşünme Becerisine Yönelik Öz Yeterlik Algısı Ölçeği: Geçerlik ve Güvenirlik Çalışması.
- Author
-
Gülbahar, Yasemin, Kert, Serhat Bahadır, and Kalelioğlu, Filiz
- Subjects
CONFIRMATORY factor analysis ,PROBLEM solving ,ABILITY ,SENSORY perception ,COMPUTER science ,SELF-efficacy - Abstract
Copyright of Turkish Journal of Computer & Mathematics Education is the property of Karadeniz Technical University, Distance Education Research & Application Center and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
- Published
- 2019
- Full Text
- View/download PDF
23. FROM THE ALGORITHMIC THINKING TO THE CONCEPT OF PROJECT.
- Author
-
VLADA, Marin
- Subjects
ALGORITHMS ,PROBLEM solving ,SCIENTIFIC knowledge ,INFORMATION technology ,COMPUTER algorithms ,ELECTRONIC data processing personnel - Abstract
This article presents several important topics that show the importance of algorithms and solving problems in the development of scientific knowledge. In the problem-solving processes require demonstrative thinking, an algorithms thinking. This paper presents a modern approach to the concept of algorithm and explains in detail how it would be seen (by students, teachers, and specialists) algorithm taking into account various aspects that are virtually disregarded the classical approach. The concept of a dynamic evolution algorithm was determined by the competence and experience of IT professionals in the activity of solving problems using computer. Developed and developing algorithms represented the implementation of various projects. Projects in all fields have led to developing society. [ABSTRACT FROM AUTHOR]
- Published
- 2011
24. A NOVEL FEATURE SELECTION ALGORITHM FOR TEXT CLASSIFICATION BASED ON TFIDF-WEIGHT AND KL-DIVERGENCE.
- Author
-
WANG Baoyi and ZHANG Shaomin
- Subjects
FEATURE selection ,TEXT processing (Computer science) ,COMPUTER algorithms ,INFORMATION processing ,COMPUTER science - Published
- 2005
25. Structural Machines as a Mathematical Model of Biological and Chemical Computers.
- Author
-
Burgin, Mark and Adamatzky, Andrew
- Subjects
MATHEMATICAL models ,TURING machines ,BIOLOGICALLY inspired computing ,COMPUTER science ,KOLMOGOROV complexity - Abstract
To rigorously describe and study the living morphological computers, we develop a formal model of algorithms and computations called a structural machine providing theoretical tools for exploration of possibilities of biological computations and extension of their applications. We study properties of structural machines demonstrating how they can model the most popular in computer science model of computation -- Turing machine. We also prove that structural machines can solve some problems more efficiently than Turing machines. We also show how structural machines model a programmable amorphous biological computer called a Physarum machine, as well as an inductive Turing machine. [ABSTRACT FROM AUTHOR]
- Published
- 2017
26. The shortest path problem with an obstructor.
- Author
-
Yamaguchi, Kazuaki, Araki, Toshiro, and Kashiwabara, Toshinobu
- Subjects
ALGORITHMS ,OBSTRUCTION theory ,COMPUTER science ,COMPUTER networks ,COMMUNICATION ,MATHEMATICS - Abstract
Given, a graph G = (V, E), with two vertices s and t specified as the origin and destination, respectively; a positive integer K called the obstruction number; and (positive) weights l (·) on the edges; then, two players P1 and P2 play a game with the following rules. P1 starts from s, and tries to arrive at t by tracing an edge on each move. P2 cuts in his turn, P2 cuts some edges. The maximum total number of edges that P2 can cut is K during the game. It is assumed that both P1 and P2 can see the whole graph. P1 tries to minimize the sum of traveled edge weights (called the path length), and P2 tries to maximize the path length. This paper shows that the path length when the two players do their best can be determined in O(n
k-l (m + n log n)) (m = |E| n = (|V|) time. It is also shown that the problem of deciding whether or not the path length when the two players do their best is not greater than a certain positive integer is P-SPACE-complete, even if the weight on each edge is 1. © 1998 Scripta Technica. Electron Comm Jpn Pt 3, 81(2): 13–23, 1998 [ABSTRACT FROM AUTHOR]- Published
- 1998
- Full Text
- View/download PDF
27. What an Algorithm Is.
- Author
-
Hill, Robin
- Subjects
ALGORITHM research ,COMPUTER science ,PHILOSOPHY methodology ,ARTICULATION (Speech) ,IMPLICATION (Logic) - Abstract
The algorithm, a building block of computer science, is defined from an intuitive and pragmatic point of view, through a methodological lens of philosophy rather than that of formal computation. The treatment extracts properties of abstraction, control, structure, finiteness, effective mechanism, and imperativity, and intentional aspects of goal and preconditions. The focus on the algorithm as a robust conceptual object obviates issues of correctness and minimality. Neither the articulation of an algorithm nor the dynamic process constitute the algorithm itself. Analysis for implications in computer science and philosophy reveals unexpected results, new questions, and new perspectives on current questions, including the relationship between our informally construed algorithms and Turing machines. Exploration in terms of current computational and philosophical thinking invites further developments. [ABSTRACT FROM AUTHOR]
- Published
- 2016
- Full Text
- View/download PDF
28. Improving a tone labeling algorithm for Sesotho.
- Author
-
Raborife, Mpho, Ewert, Sigrid, and Zerbian, Sabine
- Subjects
SOTHO language ,LINGUISTICS ,SPEECH processing systems ,ORTHOGRAPHY & spelling ,COMPUTER science - Abstract
We report on a study that aimed to improve an existing tone label prediction algorithm for Sesotho, an official language of South Africa. Tone is an important prosodic feature of Sesotho, since speakers use tone to distinguish meaning. In order to implement tone in a Text-to-Speech system for Sesotho, a tone modeling algorithm must receive as input the tone labels of the syllables of each word. Then it can predict the appropriate intonation of the word. Since Sesotho does not mark tone labels in orthography, the labels have to be predicted according to the tonal rules of the language. The existing tone label prediction algorithm has two drawbacks, namely it implements three tonal rules only and is restricted to the clitic phrase domain. In our study, we developed an algorithm that implements four additional tonal rules and addresses all parts of speech. The results show that the latter algorithm significantly improves the existing one by increasing the number of matched tone labels. [ABSTRACT FROM AUTHOR]
- Published
- 2015
- Full Text
- View/download PDF
29. AN EFFICIENT LINEAR-TIME CLUSTERING ALGORITHMS.
- Author
-
WANG Li, ZANG Liangjun, and SONG Renfeng
- Subjects
DATA mining ,ALGORITHMS ,LINEAR systems ,PARALLEL algorithms ,COMPUTER science - Published
- 2005
30. STABBING BALLS AND SIMPLIFYING PROTEINS.
- Author
-
DAESCU, O. and LUO, J.
- Subjects
MANIPULATION therapy ,COMPUTATIONAL geometry ,VISUALIZATION ,COMPUTER science ,PROTEIN analysis - Published
- 2005
31. Information Processing as an Account of Concrete Digital Computation.
- Author
-
Fresco, Nir
- Subjects
INFORMATION processing ,COGNITIVE science ,ALGORITHMS ,ELECTRONIC data processing ,TURING machines ,COMPUTER science - Abstract
It is common in cognitive science to equate computation (and in particular digital computation) with information processing. Yet, it is hard to find a comprehensive explicit account of concrete digital computation in information processing terms. An information processing account seems like a natural candidate to explain digital computation. But when 'information' comes under scrutiny, this account becomes a less obvious candidate. Four interpretations of information are examined here as the basis for an information processing account of digital computation, namely Shannon information, algorithmic information, factual information and instructional information. I argue that any plausible account of concrete computation has to be capable of explaining at least the three key algorithmic notions of input, output and procedures. Whist algorithmic information fares better than Shannon information, the most plausible candidate for an information processing account is instructional information. [ABSTRACT FROM AUTHOR]
- Published
- 2013
- Full Text
- View/download PDF
32. An empirical analysis of algorithms for partially Clairvoyant scheduling.
- Author
-
Subramani, K. and Desovski, D.
- Subjects
COMPUTER scheduling ,ALGORITHMS ,REAL-time computing ,TIME-sharing computer systems ,COMPUTER programming ,COMPUTER science - Abstract
We contrast the performance of three algorithms for the problem of deciding whether a Partially Clairvoyant real-time system with relative timing constraints, as specified in the E-T-C scheduling framework, has a feasible schedule. In the E-T-C scheduling model, real-time scheduling problems are specified through a specialized class of constraint logic programs (CLPs) called Quantified Linear Programs (QLPs) [Subramani, K., 2003, An analysis of quantified linear programs. In: C.S. Calude (Ed.) Proceedings of the 4th International Conference on Discrete Mathematics and Theoretical Computer Science (DMTCS), volume 2731 of Lecture Notes in Computer Science, July (Springer-Verlag), pp. 265- 277]; thus algorithms for determining the schedulability of instances are procedures to determine the satisfiability of CLPs. Two of these algorithms, viz., the primal algorithm and the dual algorithm have already been discussed in the literature, while a third algorithm called the randomized dual algorithm has been recently proposed [Subramani, K. and Desovski, D. 2005, A new verification procedure for partially Clairvoyant scheduling. Proceedings of the 3rd International Conference on Formal Modelling and Analysis of Timed Systems (FORMATS), October; Subramani, K. and Desovski, D., 2005, Out of order quantifier elimination for standard quantified linear programs, Journal of Symbolic Computation, 40, 1383-1396]. Our experiments demonstrate that the dual-based algorithms (i.e. the dual and the randomized dual) are more effective from an implementational perspective; this is surprising since all three algorithms have the same worst case asymptotic complexity. [ABSTRACT FROM AUTHOR]
- Published
- 2007
- Full Text
- View/download PDF
33. Software Patenting.
- Author
-
Zekos, Georgios I.
- Subjects
PATENTS ,INVENTIONS ,COMPUTER science ,COMPUTER software ,ALGORITHMS - Abstract
Patentable inventions in computer science cannot be whole software programs. An executable software program stored in the memory of a computer is an example of a machine component, embodied in electrical signals, having a particular physical structure. Software components could be patented within tangible inventions; however, pure software is still largely unprotected. Examiners are required to look, not at how the computer interprets the algorithm, but at the results of the process. The determination of the patentability of the subject matter must be made on the basis of externally observable behavior of the device in question, rather than on any knowledge of whether a device is implemented in hardware or in software. A software invention can be a new physical or electronic and virtual object, which performs a new function, either electronic/virtual or physical, with virtual effects felt in the real world. [ABSTRACT FROM AUTHOR]
- Published
- 2006
- Full Text
- View/download PDF
34. A Starting Method for Solving Nonlinear Volterra Integral Equations of the Second Kind.
- Author
-
Iguchi, Ken and Timlake, W. P.
- Subjects
VOLTERRA equations ,INTEGRAL equations ,ABEL integral equations ,NONLINEAR evolution equations ,NUMERICAL analysis ,COMPUTER science - Abstract
A fourth-order starting method is given for Volterra integral equations of the second kind and numerical c examples are presented. [ABSTRACT FROM AUTHOR]
- Published
- 1972
- Full Text
- View/download PDF
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.