scholarly journals Heterotic computing: exploiting hybrid computational devices

2015 ◽  
Vol 373 (2046) ◽  
pp. 20150091 ◽  
Author(s):  
Viv Kendon ◽  
Angelika Sebald ◽  
Susan Stepney
Keyword(s):  
Ad Hoc ◽  
State Of The Art ◽  
The State ◽  
Computational Theory ◽  
Practical Applications ◽  
The Individual ◽  
Computational Systems

Current computational theory deals almost exclusively with single models: classical, neural, analogue, quantum, etc. In practice, researchers use ad hoc combinations, realizing only recently that they can be fundamentally more powerful than the individual parts. A Theo Murphy meeting brought together theorists and practitioners of various types of computing, to engage in combining the individual strengths to produce powerful new heterotic devices. ‘Heterotic computing’ is defined as a combination of two or more computational systems such that they provide an advantage over either substrate used separately. This post-meeting collection of articles provides a wide-ranging survey of the state of the art in diverse computational paradigms, together with reflections on their future combination into powerful and practical applications.

scholarly journals Estado del arte del rendimiento académico en la educación media

2014 ◽  
Vol 17 (17) ◽  
pp. 197-220
Author(s):  
Oscar Hernán Cerquera Losada
Keyword(s):  
Academic Achievement ◽  
Secondary Education ◽  
State Of The Art ◽  
School Achievement ◽  
The State ◽  
Main Research ◽  
The World ◽  
El Sistema ◽  
The Individual

Este documento muestra el Estado de arte de los determinantes del rendimiento académico en la educación media, teniendo en cuenta las principales investigaciones realizadas, tanto a nivel nacional como internacional, acerca de los factores que influyen en el logro escolar de los estudiantes. Con este trabajo, se busca establecer las principales variables, tanto en Colombia como en algunos lugares del mundo, que afectan el desempeño académico de los estudiantes. Este documento se organiza en dos sesiones, determinantes a nivel mundial y determinantes a nivel colombiano; cada sesión clasifica las investigaciones de acuerdo a los factores del estudiante, de la escuela y las características organizacionales y políticas. A pesar de existir muchas investigaciones sobre el tema, aún no se ha llegado a un consenso general sobre cómo determinar los factores del  rendimiento académico, pues en la realidad son muchas las características del individuo, la escuela o el sistema que se relacionan entre sí de diferente manera y pueden afectar el logro estudiantil.ABSTRACTThis document shows the state of the art of the determinants of academic achievement in secondary education, taking into account the main research conducted, both nationally and internationally, about the factors that influence school achievement of students. With this paper, we seek to establish the main variables which affect the academic achievement of students in Colombia as well as in some parts of the world. This document is organized in two sessions: world and Colombian determinants; each session classifies research according to the factors of the student, the school and organizational and political characteristics. Although there is much research on the topic so far it has not been possible to reach a consensus on how to determine the factors of academic achievement, because in reality many characteristics of the individual, of the school or of the system relate to each other differently and can affect student achievement.RESUMOEste documento mostra o Estado da arte dos determinantes do rendimento escolar no ensino medio, tendo em conta às principais pesquisas realizadas, tanto a nível nacional como internacionalmente, sobres os fatores que influenciam o desempenho escolar dos estudantes. Com este trabalho, se procura estabelecer as principais variáveis, tanto na Colômbia e em alguns lugares do mundo, afetando o desempenho acadêmico dos estudantes. Este documento está organizado em duas sessões, determinantes a nível mundial e determinantes a nível colombiano; cada sessão clasifica as pesquisas de acordó a os fatores do estudante, da escola e das características organizacionais e políticas. Embora haja muitas pesquisas sobre o tema, ainda não se chegou a um consenso geral sobre os fatores determinantes no desempenho acadêmico, porque na realidade são muitas as características do indivíduo, a escola ou o sistema que se relacionam uns com os outros de forma diferente e podem afetar o desempenho acadêmico.

Planning of Material Handling : Literature Review

2019 ◽  
Vol 13 (2) ◽  
pp. 29-44
Author(s):  
Péter Telek ◽  
Ákos Cservenák
Keyword(s):  
Literature Review ◽  
Material Handling ◽  
State Of The Art ◽  
The State ◽  
Integrated Planning ◽  
Complex Process ◽  
Individual Planning ◽  
The Individual ◽  
The University

Nowadays, there are many well proved, effective processes to solve planning tasks in the field of material handling used advanced calculations forms and software. Unfortunately, most of them are used for individual tasks, so the applicability of their results is limited. The Institute of Logistics of the University of Miskolc has been working on integrated planning of handling machines for decades, where the individual planning tasks have to be solved together in a complex process. The main aim of this paper to give an overview about the state of the art of the planning of material handling, based on a literature review of the Science Direct publication database. As a result of this research we can determine some new direction for the planning of material handling.

scholarly journals Fast and Simple Mixture of Softmaxes with BPE and Hybrid-LightRNN for Language Generation

2019 ◽  
Vol 33 ◽  
pp. 6626-6633
Author(s):  
Xiang Kong ◽  
Qizhe Xie ◽  
Zihang Dai ◽  
Eduard Hovy
Keyword(s):  
Machine Translation ◽  
State Of The Art ◽  
The State ◽  
Computational Time ◽  
Memory Consumption ◽  
Image Captioning ◽  
Vocabulary Size ◽  
Language Generation ◽  
Practical Applications ◽  
Coding Schemes

Mixture of Softmaxes (MoS) has been shown to be effective at addressing the expressiveness limitation of Softmax-based models. Despite the known advantage, MoS is practically sealed by its large consumption of memory and computational time due to the need of computing multiple Softmaxes. In this work, we set out to unleash the power of MoS in practical applications by investigating improved word coding schemes, which could effectively reduce the vocabulary size and hence relieve the memory and computation burden. We show both BPE and our proposed Hybrid-LightRNN lead to improved encoding mechanisms that can halve the time and memory consumption of MoS without performance losses. With MoS, we achieve an improvement of 1.5 BLEU scores on IWSLT 2014 German-to-English corpus and an improvement of 0.76 CIDEr score on image captioning. Moreover, on the larger WMT 2014 machine translation dataset, our MoSboosted Transformer yields 29.6 BLEU score for English-toGerman and 42.1 BLEU score for English-to-French, outperforming the single-Softmax Transformer by 0.9 and 0.4 BLEU scores respectively and achieving the state-of-the-art result on WMT 2014 English-to-German task.

Researching Telework

2000 ◽  
pp. 255-276 ◽  
Author(s):  
Nicole B. Ellison
Keyword(s):  
Organizational Culture ◽  
State Of The Art ◽  
The State ◽  
Future Research ◽  
Scholarly Literature ◽  
Home Based ◽  
The Family ◽  
The Individual ◽  
The Impact

This chapter examines the state of the art in telework research. The author reviews the most central scholarly literature examining the phenomenon of telework (also called home-based work or telecommuting) and develops a framework for organizing this body of work. She organizes previous research on telework into six major thematic concerns relating to the definition, measurement, and scope of telework; management of teleworkers; travel-related impacts of telework; organizational culture and employee isolation; boundaries between “home” and “work” and the impact of telework on the individual and the family. Areas for future research are suggested.

Library simulation: The computer locates the data needle in the journal haystack

SIMULATION ◽  
1968 ◽  
Vol 10 (2) ◽  
pp. 69-70
Author(s):  
Joseph J. Mangino
Keyword(s):  
Information Technology ◽  
State Of The Art ◽  
Current Data ◽  
The State ◽  
High Response ◽  
Operational System ◽  
Work Assignment ◽  
Normal Text ◽  
The Individual

Developments in the information technology make pos sible the use of computer searching of normal text, to locate the articles of interest to match a professional pro file. These profiles are computer equivalents of an indi vidual's description of his work assignment, and are stored in the computer to be compared with new or current data being processed in normal text by the computer. The data is the author's/publisher's abstract of the article in the orig inal form. The computer reads the data and compares it with over 2500 profiles. When a match occurs, the abstract is selectively printed out and sent to the individual. This is an operational system used in the IBM Technical Informa tion Retrieval Center to keep IBMers aware of the state-of- the-art in their specialty. Feedback statistics are included to indicate the high response and satisfaction criteria of the users.

scholarly journals Handwritten Bangla Character Recognition Using the State-of-the-Art Deep Convolutional Neural Networks

2018 ◽  
Vol 2018 ◽  
pp. 1-13 ◽  
Author(s):  
Md Zahangir Alom ◽  
Paheding Sidike ◽  
Mahmudul Hasan ◽  
Tarek M. Taha ◽  
Vijayan K. Asari
Keyword(s):  
Neural Networks ◽  
Object Recognition ◽  
Convolutional Neural Networks ◽  
Character Recognition ◽  
State Of The Art ◽  
The State ◽  
Superior Performance ◽  
Deep Convolutional Neural Networks ◽  
Practical Applications ◽  
High Degree

In spite of advances in object recognition technology, handwritten Bangla character recognition (HBCR) remains largely unsolved due to the presence of many ambiguous handwritten characters and excessively cursive Bangla handwritings. Even many advanced existing methods do not lead to satisfactory performance in practice that related to HBCR. In this paper, a set of the state-of-the-art deep convolutional neural networks (DCNNs) is discussed and their performance on the application of HBCR is systematically evaluated. The main advantage of DCNN approaches is that they can extract discriminative features from raw data and represent them with a high degree of invariance to object distortions. The experimental results show the superior performance of DCNN models compared with the other popular object recognition approaches, which implies DCNN can be a good candidate for building an automatic HBCR system for practical applications.

On the Exact Solution of Prize-Collecting Steiner Tree Problems

2021 ◽  
Author(s):  
Daniel Rehfeldt ◽  
Thorsten Koch
Keyword(s):  
Exact Solution ◽  
Steiner Tree ◽  
State Of The Art ◽  
The State ◽  
Steiner Tree Problem ◽  
New Techniques ◽  
Practical Applications ◽  
Computational Performance ◽  
Benchmark Instances ◽  
Prize Collecting

The prize-collecting Steiner tree problem (PCSTP) is a well-known generalization of the classic Steiner tree problem in graphs, with a large number of practical applications. It attracted particular interest during the 11th DIMACS Challenge in 2014, and since then, several PCSTP solvers have been introduced in the literature. Although these new solvers further, and often drastically, improved on the results of the DIMACS Challenge, many PCSTP benchmark instances have remained unsolved. The following article describes further advances in the state of the art in exact PCSTP solving. It introduces new techniques and algorithms for PCSTP, involving various new transformations (or reductions) of PCSTP instances to equivalent problems, for example, to decrease the problem size or to obtain a better integer programming formulation. Several of the new techniques and algorithms provably dominate previous approaches. Further theoretical properties of the new components, such as their complexity, are discussed. Also, new complexity results for the exact solution of PCSTP and related problems are described, which form the base of the algorithm design. Finally, the new developments also translate into a strong computational performance: the resulting exact PCSTP solver outperforms all previous approaches, both in terms of runtime and solvability. In particular, it solves several formerly intractable benchmark instances from the 11th DIMACS Challenge to optimality. Moreover, several recently introduced large-scale instances with up to 10 million edges, previously considered to be too large for any exact approach, can now be solved to optimality in less than two hours. Summary of Contribution: The prize-collecting Steiner tree problem (PCSTP) is a well-known generalization of the classic Steiner tree problem in graphs, with many practical applications. The article introduces and analyses new techniques and algorithms for PCSTP that ultimately aim for improved (practical) exact solution. The algorithmic developments are underpinned by results on theoretical aspects, such as fixed-parameter tractability of PCSTP. Computationally, we considerably push the limits of tractibility, being able to solve PCSTP instances with up to 10 million edges. The new solver, which also considerably outperforms the state of the art on smaller instances, will be made publicly available as part of the SCIP Optimization Suite.

E-Government Business Models

2009 ◽  
pp. 1-12 ◽  
Author(s):  
Marijn Janssen ◽  
George Kuk
Keyword(s):  
Business Models ◽  
State Of The Art ◽  
The State ◽  
Service Provisioning ◽  
Basic Premise ◽  
Research Challenges ◽  
Client Involvement ◽  
Service Offering ◽  
The Individual

Stimulated by the need to reduce cost and improve service provisioning and client involvement at the same time, the concept of business models has gained attention in the e-government domain over the last few years. Business models can appear at the individual organization and network level and describes how an entity plans to provide services. The basic premise of business models is that it helps to understand the relation between service offering and other elements and can be used as an instrument to improve service provisioning and lowering cost at the same time. In this chapter an overview of the state-of-the-art of e-government business models, a theory integrating the various elements and research challenges and issues are presented. There is ample need for research and overcoming these challenges result in better leveraging the advantages of business models.

Randomized error removal for online spread estimation in data streaming

2021 ◽  
Vol 14 (6) ◽  
pp. 1040-1052
Author(s):  
Haibo Wang ◽  
Chaoyi Ma ◽  
Olufemi O Odegbile ◽  
Shigang Chen ◽  
Jih-Kwon Peir
Keyword(s):  
Data Stream ◽  
State Of The Art ◽  
The State ◽  
High Rate ◽  
Estimation Accuracy ◽  
Data Streaming ◽  
Real World Data ◽  
Practical Applications ◽  
Spread Estimation ◽  
Error Removal

Measuring flow spread in real time from large, high-rate data streams has numerous practical applications, where a data stream is modeled as a sequence of data items from different flows and the spread of a flow is the number of distinct items in the flow. Past decades have witnessed tremendous performance improvement for single-flow spread estimation. However, when dealing with numerous flows in a data stream, it remains a significant challenge to measure per-flow spread accurately while reducing memory footprint. The goal of this paper is to introduce new multi-flow spread estimation designs that incur much smaller processing overhead and query overhead than the state of the art, yet achieves significant accuracy improvement in spread estimation. We formally analyze the performance of these new designs. We implement them in both hardware and software, and use real-world data traces to evaluate their performance in comparison with the state of the art. The experimental results show that our best sketch significantly improves over the best existing work in terms of estimation accuracy, data item processing throughput, and online query throughput.

scholarly journals Semantic Attachments for HTN Planning

2020 ◽  
Vol 34 (06) ◽  
pp. 9933-9940
Author(s):  
Maurício Cecílio Magnaguagno ◽  
Felipe Meneguzzi
Keyword(s):  
Domain Knowledge ◽  
Ad Hoc ◽  
Planning Process ◽  
State Of The Art ◽  
Fixed Number ◽  
The State ◽  
Decomposition Process ◽  
Htn Planning ◽  
Task Networks ◽  
Expensive Process

Hierarchical Task Networks (HTN) planning uses a decomposition process guided by domain knowledge to guide search towards a planning task. While many HTN planners allow calls to external processes (e.g. to a simulator interface) during the decomposition process, this is a computationally expensive process, so planner implementations often use such calls in an ad-hoc way using very specialized domain knowledge to limit the number of calls. Conversely, the classical planners that are capable of using external calls (often called semantic attachments) during planning are limited to generating a fixed number of ground operators at problem grounding time. We formalize Semantic Attachments for HTN planning using semi coroutines, allowing such procedurally defined predicates to link the planning process to custom unifications outside of the planner, such as numerical results from a robotics simulator. The resulting planner then uses such coroutines as part of its backtracking mechanism to search through parallel dimensions of the state-space (e.g. through numeric variables). We show empirically that our planner outperforms the state-of-the-art numeric planners in a number of domains using minimal extra domain knowledge.

Sign in / Sign up

Export Citation Format

Share Document