Searcharxiv⌕ Search

SEARCH · Searcharxiv

Results for “cs.GL”

Search indexed arXiv papers on artificial intelligence, large language models, computer vision and robotics. Read source abstracts and follow links to arXiv.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 37 records · Page 2Linked to original sources

A Reflection on the Structure and Process of the Web of Data

The Web community has introduced a set of standards and technologies for representing, querying, and manipulating a globally distributed data structure known as the Web of Data. The proponents of the Web of Data envision much of the world's data being interrelated and openly accessible to the general public. This vision is analogous in many ways to the Web of Documents of common knowledge, but instead of making documents and media openly accessible, the focus is on making data openly accessible. In providing data for public use, there has been a stimulated interest in a movement dubbed Open Data. Open Data is analogous in many ways to the Open Source movement. However, instead of focusing on software, Open Data is focused on the legal and licensing issues around publicly exposed data. Together, various technological and legal tools are laying the groundwork for the future of global-scale data management on the Web. As of today, in its early form, the Web of Data hosts a variety of data sets that include encyclopedic facts, drug and protein data, metadata on music, books and scholarly articles, social network representations, geospatial information, and many other types of information. The size and diversity of the Web of Data is a demonstration of the flexibility of the underlying standards and the overall feasibility of the project as a whole. The purpose of this article is to provide a review of the technological underpinnings of the Web of Data as well as some of the hurdles that need to be overcome if the Web of Data is to emerge as the defacto medium for data representation, distribution, and ultimately, processing.

cs.AI↗

Exploration of the Gap Between Computer Science Curriculum and Industrial I.T Skills Requirements

This paper sets out to examine the skills gaps between the industrial application of Information Technology and university academic programmes (curriculum). It looks at some of the causes, and considers the probable solutions for bridging the gap between them and suggests the possibilities of exploring a new role for our universities and employers of labor. It also highlights strategies to abolish the misalignment between university and industry. The main concept is to blend the academic rigidity with the industrial relevance.

cs.GL↗

Planet-scale Human Mobility Measurement

Research into, and design and construction of mobile systems and algorithms requires access to large-scale mobility data. Unfortunately, the wireless and mobile research community lacks such data. For instance, the largest available human contact traces contain only 100 nodes with very sparse connectivity, limited by experimental logistics. In this paper we pose a challenge to the community: how can we collect mobility data from billions of human participants? We re-assert the importance of large-scale datasets in communication network design, and claim that this could impact fundamental studies in other academic disciplines. In effect, we argue that planet-scale mobility measurements can help to save the world. For example, through understanding large-scale human mobility, we can track and model and contain the spread of epidemics of various kinds.

cs.NI↗

A Dialogue Concerning Two World Systems: Info-Computational vs. Mechanistic

The dialogue develops arguments for and against adopting a new world system, info-computationalist naturalism, that is poised to replace the traditional mechanistic world system. We try to figure out what the info-computational paradigm would mean, in particular its pancomputationalism. We make some steps towards developing the notion of computing that is necessary here, especially in relation to traditional notions. We investigate whether pancomputationalism can possibly provide the basic causal structure to the world, whether the overall research programme appears productive and whether it can revigorate computationalism in the philosophy of mind.

cs.GL↗

Search for overlapped communities by parallel genetic algorithms

In the last decade the broad scope of complex networks has led to a rapid progress. In this area a particular interest has the study of community structures. The analysis of this type of structure requires the formalization of the intuitive concept of community and the definition of indices of goodness for the obtained results. A lot of algorithms has been presented to reach this goal. In particular, an interesting problem is the search of overlapped communities and it is field seems very interesting a solution based on the use of genetic algorithms. The approach discusses in this paper is based on a parallel implementation of a genetic algorithm and shows the performance benefits of this solution.

cs.IR↗

Going Green: A Holistic Approach to Transform Business

In recent years environmental and energy conservation issues have taken the central theme in the global business arena. The reality of rising energy cost and their impact on international affairs coupled with the different kinds of environmental issues has shifted the social and economic consciousness of the business community. Hence, the business community is now in search of an eco-friendly business model. This paper highlights the concept of green business and their needs in the current global scenario.

cs.CY↗

Removing Barriers to Interdisciplinary Research

A significant amount of high-impact contemporary scientific research occurs where biology, computer science, engineering and chemistry converge. Although programmes have been put in place to support such work, the complex dynamics of interdisciplinarity are still poorly understood. In this paper we interrogate the nature of interdisciplinary research and how we might measure its "success", identify potential barriers to its implementation, and suggest possible mechanisms for removing these impediments.

cs.GL↗

Education for Computational Science and Engineering

Computational science and engineering (CSE) has been misunderstood to advance with the construction of enormous computers. To the contrary, the historical record demonstrates that innovations in CSE come from improvements to the mathematics embodied by computer programs. Whether scientists and engineers become inventors who make these breakthroughs depends on circumstances and the interdisciplinary extent of their educations. The USA currently has the largest CSE professorate, but the data suggest this prominence is ephemeral.

math.HO↗

First-order Logic: Modality and Intensionality

Contemporary use of the term 'intension' derives from the traditional logical Frege-Russell's doctrine that an idea (logic formula) has both an extension and an intension. From the Montague's point of view, the meaning of an idea can be considered as particular extensions in different possible worlds. In this paper we analyze the minimal intensional semantic enrichment of the syntax of the FOL language, by unification of different views: Tarskian extensional semantics of the FOL, modal interpretation of quantifiers, and a derivation of the Tarskian theory of truth from unified semantic theory based on a single meaning relation. We show that not all modal predicate logics are intensional, and that an equivalent modal Kripke's interpretation of logic quantifiers in FOL results in a particular pure extensional modal predicate logic (as is the standard Tarskian semantics of the FOL). This minimal intensional enrichment is obtained by adopting the theory of properties, relations and propositions (PRP) as the universe or domain of the FOL, composed by particulars and universals (or concepts), with the two-step interpretation of the FOL that eliminates the weak points of the Montague's intensional semantics. Differently from the Bealer's intensional FOL, we show that it is not necessary the introduction of the intensional abstraction in order to obtain the full intensional properties of the FOL. Final result of this paper is represented by the commutative homomorphic diagram that holds in each given possible world of this new intensional FOL, from the free algebra of the FOL syntax, toward its intensional algebra of concepts, and, successively, to the new extensional relational algebra (different from Cylindric algebras), and we show that it corresponds to the Tarski's interpretation of the standard extensional FOL in this possible world.

cs.LO↗

Introducing Sourcements

Sourcing processes are discussed at a high abstraction level. A dedicated terminology is developed concerning general aspects of sourcing. The term sourcement is coined to denote a building block for sourcing. No- tions of allocation, functional architecture and allocational architecture, equilibrium, and configuration are discussed. Limitations of the concept of outsourcing are outlined. This theoretical work is meant to serve as a point of departure for the subsequent development of a detailed theory of sourcing and sourcing transformations, which can be a tool for dealing with practical applica- tions.

cs.SE↗

Gender Gaps in the Mathematical Sciences: The Creativity Factor

This article presents an overview, and recent history, of studies of gender gaps in the mathematically-intensive sciences. Included are several statistics about gender differences in science, and about public resources aimed at addressing them. We then examine the role that gender differences in creativity play in explaining the recent and current gender differences in the mathematical sciences, and identify several constructive suggestions aimed at improving analytical creativity output in research institutions.

math.HO↗

Foreword: A Computable Universe, Understanding Computation and Exploring Nature As Computation

I am most honoured to have the privilege to present the Foreword to this fascinating and wonderfully varied collection of contributions, concerning the nature of computation and of its deep connection with the operation of those basic laws, known or yet unknown, governing the universe in which we live. Fundamentally deep questions are indeed being grappled with here, and the fact that we find so many different viewpoints is something to be expected, since, in truth, we know little about the foundational nature and origins of these basic laws, despite the immense precision that we so often find revealed in them. Accordingly, it is not surprising that within the viewpoints expressed here is some unabashed speculation, occasionally bordering on just partially justified guesswork, while elsewhere we find a good deal of precise reasoning, some in the form of rigorous mathematical theorems. Both of these are as should be, for without some inspired guesswork we cannot have new ideas as to where look in order to make genuinely new progress, and without precise mathematical reasoning, no less than in precise observation, we cannot know when we are right -- or, more usually, when we are wrong.

cs.GL↗

The Quantum Frontier

The success of the abstract model of computation, in terms of bits, logical operations, programming language constructs, and the like, makes it easy to forget that computation is a physical process. Our cherished notions of computation and information are grounded in classical mechanics, but the physics underlying our world is quantum. In the early 80s researchers began to ask how computation would change if we adopted a quantum mechanical, instead of a classical mechanical, view of computation. Slowly, a new picture of computation arose, one that gave rise to a variety of faster algorithms, novel cryptographic mechanisms, and alternative methods of communication. Small quantum information processing devices have been built, and efforts are underway to build larger ones. Even apart from the existence of these devices, the quantum view on information processing has provided significant insight into the nature of computation and information, and a deeper understanding of the physics of our universe and its connections with computation. We start by describing aspects of quantum mechanics that are at the heart of a quantum view of information processing. We give our own idiosyncratic view of a number of these topics in the hopes of correcting common misconceptions and highlighting aspects that are often overlooked. A number of the phenomena described were initially viewed as oddities of quantum mechanics. It was quantum information processing, first quantum cryptography and then, more dramatically, quantum computing, that turned the tables and showed that these oddities could be put to practical effect. It is these application we describe next. We conclude with a section describing some of the many questions left for future work, especially the mysteries surrounding where the power of quantum information ultimately comes from.

quant-ph↗

On the serial connection of the regular asynchronous systems

The asynchronous systems f are multi-valued functions, representing the non-deterministic models of the asynchronous circuits from the digital electrical engineering. In real time, they map an 'admissible input' function u:R\rightarrow{0,1}^{m} to a set f(u) of 'possible states' x\inf(u), where x:R\rightarrow{0,1}^{m}. When f is defined by making use of a 'generator function' Φ:{0,1}^{n}\times{0,1}^{m}\rightarrow{0,1}^{n}, the system is called regular. The usual definition of the serial connection of systems as composition of multi-valued functions does not bring the regular systems into regular systems, thus the first issue in this study is to modify in an acceptable manner the definition of the serial connection in a way that matches regularity. This intention was expressed for the first time, without proving the regularity of the serial connection of systems, in a previous work. Our present purpose is to restate with certain corrections and prove that result.

cs.GL↗

Info-Computationalism and Philosophical Aspects of Research in Information Sciences

The historical development has lead to the decay of Natural Philosophy which until 19th century included all of our knowledge about the physical world into the growing multitude of specialized sciences. The focus on the in-depth enquiry disentangled from its broad context lead to the problem of loss of common world-view and impossibility of communication between specialist research fields because of different languages they developed in isolation. The need for a new unifying framework is becoming increasingly apparent with the information technology enabling and intensifying the communication between different research fields and knowledge communities. This time, not only natural sciences, but also all of human knowledge is being integrated in a global network such as Internet with its diverse knowledge and language communities. Info-computationalism (ICON) as a synthesis of pancomputationalism and paninformationalism presents a unifying framework for understanding of natural phenomena including living beings and their cognition, their ways of processing information and producing knowledge. Within ICON physical universe is understood as a network of computational processes on an informational structure.

cs.GL↗

Alan Turing's Legacy: Info-Computational Philosophy of Nature

Alan Turing's pioneering work on computability, and his ideas on morphological computing support Andrew Hodges' view of Turing as a natural philosopher. Turing's natural philosophy differs importantly from Galileo's view that the book of nature is written in the language of mathematics (The Assayer, 1623). Computing is more than a language of nature as computation produces real time physical behaviors. This article presents the framework of Natural Info-computationalism as a contemporary natural philosophy that builds on the legacy of Turing's computationalism. Info-computationalism is a synthesis of Informational Structural Realism (the view that nature is a web of informational structures) and Natural Computationalism (the view that nature physically computes its own time development). It presents a framework for the development of a unified approach to nature, with common interpretation of inanimate nature as well as living organisms and their social networks. Computing is understood as information processing that drives all the changes on different levels of organization of information and can be modeled as morphological computing on data sets pertinent to informational structures. The use of infocomputational conceptualizations, models and tools makes possible for the first time in history the study of complex selforganizing adaptive systems, including basic characteristics and functions of living systems, intelligence, and cognition.

cs.GL↗

Axiomatic Tools versus Constructive approach to Unconventional Algorithms

In this paper, we analyze axiomatic issues of unconventional computations from a methodological and philosophical point of view. We explain how the new models of algorithms changed the algorithmic universe, making it open and allowing increased flexibility and creativity. However, the greater power of new types of algorithms also brought the greater complexity of the algorithmic universe, demanding new tools for its study. That is why we analyze new powerful tools brought forth by the axiomatic theory of algorithms, automata and computation.

cs.GL↗

Le droit du numérique : une histoire à préserver

Although the history of informatics is recent, this field poses unusual problems with respect to its preservation. These problems are amplified by legal issues, digital law being in itself a subject matter whose history is also worth presenting in a computer science museum. The purpose of this paper is to present a quick overview of the evolution of law regarding digital matters, from an historical perspective as well as with respect to the preservation and presentation of the works.

cs.GL↗