Um die anderen Arten von Veröffentlichungen zu diesem Thema anzuzeigen, folgen Sie diesem Link: Multi-paradigm programming.
Zeitschriftenartikel zum Thema „Multi-paradigm programming“
Geben Sie eine Quelle nach APA, MLA, Chicago, Harvard und anderen Zitierweisen an
Machen Sie sich mit Top-50 Zeitschriftenartikel für die Forschung zum Thema "Multi-paradigm programming" bekannt.
Neben jedem Werk im Literaturverzeichnis ist die Option "Zur Bibliographie hinzufügen" verfügbar. Nutzen Sie sie, wird Ihre bibliographische Angabe des gewählten Werkes nach der nötigen Zitierweise (APA, MLA, Harvard, Chicago, Vancouver usw.) automatisch gestaltet.
Sie können auch den vollen Text der wissenschaftlichen Publikation im PDF-Format herunterladen und eine Online-Annotation der Arbeit lesen, wenn die relevanten Parameter in den Metadaten verfügbar sind.
Sehen Sie die Zeitschriftenartikel für verschiedene Spezialgebieten durch und erstellen Sie Ihre Bibliographie auf korrekte Weise.
1
Thaker, Nimit, und Abhilash Shukla. „Python as Multi Paradigm Programming Language“. International Journal of Computer Applications 177, Nr. 31 (16.01.2020): 38–42. http://dx.doi.org/10.5120/ijca2020919775.
Der volle Inhalt der Quelle
2
Clark, K. L., und F. G. McCabe. „Go! – A Multi-Paradigm Programming Language for Implementing Multi-Threaded Agents“. Annals of Mathematics and Artificial Intelligence 41, Nr. 2-4 (August 2004): 171–206. http://dx.doi.org/10.1023/b:amai.0000031195.87297.d9.
Der volle Inhalt der Quelle
3
Ringström, Johan, Peter Fritzson und Johan Fagerström. „PREDULA a multi-paradigm parallel programming and debugging environment“. Microprocessing and Microprogramming 34, Nr. 1-5 (Februar 1992): 45–48. http://dx.doi.org/10.1016/0165-6074(92)90099-s.
Der volle Inhalt der Quelle
4
Vranic, Valentino. „Multi-paradigm design with feature modeling“. Computer Science and Information Systems 2, Nr. 1 (2005): 79–102. http://dx.doi.org/10.2298/csis0501079v.
Der volle Inhalt der QuelleAnnotation:
In this article, a method for selecting paradigms, viewed as solution domain concepts, appropriate for given application domain concepts is proposed. In this method, denoted as multi-paradigm design with feature modeling, both application and solution domain are modeled using feature modeling. The selection of paradigms is performed in the process of feature modeling based transformational analysis as a paradigm instantiation over application domain concepts. The output of transformational analysis is a set of paradigm instances annotated with the information about the corresponding application domain concepts and features. According to these paradigm instances, the code skeleton is being designed. The approach is presented in conjunction with its specialization to AspectJ programming language. Transformational analysis performed according to the AspectJ paradigm model enables an early aspect identification.
5
FUKAI, Yuji, Hiroaki KAWAI und Masayuki KUDO. „Construction of Efficient Learning Sequence in Multi-paradigm Programming Language“. Journal of JSEE 64, Nr. 1 (2016): 1_33–1_38. http://dx.doi.org/10.4307/jsee.64.1_33.
Der volle Inhalt der Quelle
6
Hapl, Lukas, und Hashim Habiballa. „The Influence of the Developed Specific Multi-Paradigm Programming in Digital Logic Education“. Mathematics 9, Nr. 11 (31.05.2021): 1255. http://dx.doi.org/10.3390/math9111255.
Der volle Inhalt der QuelleAnnotation:
This article introduces the possible usage of the developed programming discourse that can be used to support training in the digital logic area. The discourse merges several programming paradigms into one solution. The intended learners are secondary school students focused on digital system programming. The main intent is to find out whether digital logic curriculum based on Digital Circuits Based Logical Programming (DCBLP) inheritance has positive impact on the students and the way they explore the digital logic itself. Students’ cognitive and affective areas are in the scope of this preliminary research and questionnaires and cognitive tests will help to support the research. Experimental and control groups were used to gather relevant records. To analyse and support the interpretation of the data gathered by questionnaires, the chi-square test (two-tailed) has been used. ANOVA has been used to evaluate data for the achievement test results. The preliminary research revealed there is a possibility of using developed programming discourse DCBLP in digital logic training. Students claim overall usefulness of the discourse in the training; the strong motivation power of the programming discourse itself has not been discovered. From the test we conclude that the performance of the students trained using new programming discourse is significantly better. It is possible to use more different programming paradigms, such as imperative and declarative, in one solution to support training in the area of digital logic. Such solutions can enhance the way the students deal with the programming languages and also supports interdisciplinary relationships.
7
Brodsky, Yury I., und Leonid V. Kruglov. „Model-Oriented Programming as a Consequence of the Structural Theory of Multi-Сomponent Complex Systems“. International Journal of Education and Information Technologies 15 (10.03.2021): 1–12. http://dx.doi.org/10.46300/9109.2021.15.1.
Der volle Inhalt der QuelleAnnotation:
The paper offers a new programming paradigm, which implements CAD methods in programming, The level of encapsulation in model-oriented programming is higher than in the object-oriented approach. The key features of the MO-programming are declarative style (no imperative programs), and focusing on the distributed and high-performance calculations. The method proposed is based on the structural theory of multi-component complex systems, and is applicable for a rather wide class of tasks including the elaboration of simulation models of such systems.
8
ВЕЛИКОДНИЙ, С. С., und О. С. ТИМОФЄЄВА. „THE PARADIGM OF LINGUISTIC SUPPLY SUBMISSION BY GENERATIVE GRAMMAR ASSISTANCE“. Transport development, Nr. 1(1) (27.09.2017): 128–35. http://dx.doi.org/10.33082/td.2017.1-1.14.
Der volle Inhalt der QuelleAnnotation:
The article describes the creation of a system's concepts that form the paradigm of reengineering information technologies. Linguistic support of information technology considers the construction of a software system using one or more mutually agreed programming languages. Each programming language is based on the rules of a particular grammar.
The mathematical apparatus of generative grammars allows us to describe the process of translating a program system written in one programming language into another specific language.
The created paradigm allows you to work with multi-level information technologies, the parts of which are written in different programming languages. The paradigm formed in the article, from the scientific point of view, is laid in the basis of the methodology of information technology reengineering, and from the practical point of view it will be necessary for system programmers working with multilanguage superstructures of software systems that evolve over time and are improved in the process of exploitation.
9
Xinogalos, Stelios. „The quest for excellence in designing a multi-paradigm programming environment for novices“. International Journal of Teaching and Case Studies 2, Nr. 1 (2009): 1. http://dx.doi.org/10.1504/ijtcs.2009.026295.
Der volle Inhalt der Quelle
10
Cheang, Sin Man, Kwong Sak Leung und Kin Hong Lee. „Genetic Parallel Programming: Design and Implementation“. Evolutionary Computation 14, Nr. 2 (Juni 2006): 129–56. http://dx.doi.org/10.1162/evco.2006.14.2.129.
Der volle Inhalt der QuelleAnnotation:
This paper presents a novel Genetic Parallel Programming (GPP) paradigm for evolving parallel programs running on a Multi-Arithmetic-Logic-Unit (Multi-ALU) Processor (MAP). The MAP is a Multiple Instruction-streams, Multiple Data-streams (MIMD), general-purpose register machine that can be implemented on modern Very Large-Scale Integrated Circuits (VLSIs) in order to evaluate genetic programs at high speed. For human programmers, writing parallel programs is more difficult than writing sequential programs. However, experimental results show that GPP evolves parallel programs with less computational effort than that of their sequential counterparts. It creates a new approach to evolving a feasible problem solution in parallel program form and then serializes it into a sequential programif required. The effectiveness and efficiency of GPP are investigated using a suite of 14 well-studied benchmark problems. Experimental results show that GPP speeds up evolution substantially.
11
Cornu, Thierry, Paolo Ienne, Dagmar Niebur, Patrick Thiran und Marc A. Viredaz. „Design, Implementation, and Test of a Multi-Model Systolic Neural-Network Accelerator“. Scientific Programming 5, Nr. 1 (1996): 47–61. http://dx.doi.org/10.1155/1996/189626.
Der volle Inhalt der QuelleAnnotation:
A multi-model neural-network computer has been designed and built. A compute-intensive application in the field of power-system monitoring, using the Kohonen neural network, has then been ported onto this machine. After a short description of the system, this article focuses on the programming paradigm adopted. The performance of the machine is also evaluated and discussed.
12
BURIGANA, ALESSANDRO, FRANCESCO FABIANO, AGOSTINO DOVIER und ENRICO PONTELLI. „Modelling Multi-Agent Epistemic Planning in ASP“. Theory and Practice of Logic Programming 20, Nr. 5 (September 2020): 593–608. http://dx.doi.org/10.1017/s1471068420000289.
Der volle Inhalt der QuelleAnnotation:
AbstractDesigning agents that reason and act upon the world has always been one of the main objectives of the Artificial Intelligence community. While for planning in “simple” domains the agents can solely rely on facts about the world, in several contexts, e.g., economy, security, justice and politics, the mere knowledge of the world could be insufficient to reach a desired goal. In these scenarios, epistemic reasoning, i.e., reasoning about agents’ beliefs about themselves and about other agents’ beliefs, is essential to design winning strategies. This paper addresses the problem of reasoning in multi-agent epistemic settings exploiting declarative programming techniques. In particular, the paper presents an actual implementation of a multi-shot Answer Set Programming-based planner that can reason in multi-agent epistemic settings, called PLATO (ePistemic muLti-agent Answer seT programming sOlver). The ASP paradigm enables a concise and elegant design of the planner, w.r.t. other imperative implementations, facilitating the development of formal verification of correctness. The paper shows how the planner, exploiting an ad-hoc epistemic state representation and the efficiency of ASP solvers, has competitive performance results on benchmarks collected from the literature.
13
Aversa, R., B. Di Martino, N. Mazzocca und S. Venticinque. „A Skeleton Based Programming Paradigm for Mobile Multi-Agents on Distributed Systems and Its Realization within the MAGDA Mobile Agents Platform“. Mobile Information Systems 4, Nr. 2 (2008): 131–46. http://dx.doi.org/10.1155/2008/745406.
Der volle Inhalt der QuelleAnnotation:
Parallel programming effort can be reduced by using high level constructs such as algorithmic skeletons. Within the MAGDA toolset, supporting programming and execution of mobile agent based distributed applications, we provide a skeleton-based parallel programming environment, based on specialization of Algorithmic Skeleton Java interfaces and classes. Their implementation include mobile agent features for execution on heterogeneous systems, such as clusters of WSs and PCs, and support reliability and dynamic workload balancing. The user can thus develop a parallel, mobile agent based application by simply specialising a given set of classes and methods and using a set of added functionalities.
14
SWIFT, TERRANCE, und DAVID S. WARREN. „XSB: Extending Prolog with Tabled Logic Programming“. Theory and Practice of Logic Programming 12, Nr. 1-2 (30.12.2011): 157–87. http://dx.doi.org/10.1017/s1471068411000500.
Der volle Inhalt der QuelleAnnotation:
AbstractThe paradigm of Tabled Logic Programming (TLP) is now supported by a number of Prolog systems, including XSB, YAP Prolog, B-Prolog, Mercury, ALS, and Ciao. The reasons for this are partly theoretical: tabling ensures termination and optimal known complexity for queries to a large class of programs. However, the overriding reasons are practical. TLP allows sophisticated programs to be written concisely and efficiently, especially when mechanisms such as tabled negation and call and answer subsumption are supported. As a result, TLP has now been used in a variety of applications from program analysis to querying over the semantic web. This paper provides a survey of TLP and its applications as implemented in the XSB Prolog, along with discussion of how XSB supports tabling with dynamically changing code, and in a multi-threaded environment.
15
Huang, Jih-Jeng, und Gwo-Hshiung Tzeng. „NEW THINKING OF MULTI-OBJECTIVE PROGRAMMING WITH CHANGEABLE SPACE – IN SEARCH OF EXCELLENCE“. Technological and Economic Development of Economy 20, Nr. 2 (27.06.2014): 254–73. http://dx.doi.org/10.3846/20294913.2013.860931.
Der volle Inhalt der QuelleAnnotation:
Multi-objective programming (MOP) is a branch of mathematical programming that has been widely used to deal with various practical problems. With the introduction of new technologies and business models, a paradigm shift in optimization problems is gradually taking place from fixed to flexible optimization. For example, many organizations use outsourcing or business process reengineering (BPR) to improve or upgrade their objective and technological coefficients to achieve better performance. Hence, traditional MOP models should be extended from the concept of fixed to changeable parameters, called changeable space, which includes decision space and objective space. In this paper, we propose three kinds of MOP model with changeable parameters to help decision-makers achieve the desired point (aspiration level), which is better than the ideal point.
16
Lachikhin, A. V. „ALGORITHMS FOR FINDING OPTIMAL POLICY FOR INTELLIGENT AGENTS BASED ON MARKOV DECISION-MAKING PROCESSES“. Issues of radio electronics, Nr. 11 (20.11.2018): 29–32. http://dx.doi.org/10.21778/2218-5453-2018-11-29-32.
Der volle Inhalt der QuelleAnnotation:
Currently, the paradigm of intelligent agents and multi-agent systems is actively developing. The policy of agents ‘ actions can be represented as a Markov decision-making process. Such agents need methods to develop optimal policies. The purpose of this study is to review existing techniques, determine the possibility and conditions of their application. The main approaches based on linear and dynamic programming are considered. The specific algorithms used to find the extreme value of utility are given. The method of linear programming - simplex method, and the method of dynamic programming method-iteration of values are considered. The equations necessary to find the optimal policy of intelligent agent actions are given. Restrictions of application of various algorithms are considered. Conclusions the most suitable method for finding the optimal policy is the iteration of values.
17
SILVA, JOSEP, und GERMÁN VIDAL. „Forward slicing of functional logic programs by partial evaluation“. Theory and Practice of Logic Programming 7, Nr. 1-2 (Januar 2007): 215–47. http://dx.doi.org/10.1017/s1471068406002870.
Der volle Inhalt der QuelleAnnotation:
AbstractProgram slicing has been mainly studied in the context of imperative languages, where it has been applied to a wide variety of software engineering tasks, like program understanding, maintenance, debugging, testing, code reuse, etc. This work introduces the first forward slicing technique for declarative multi-paradigm programs which integrate features from functional and logic programming. Basically, given a program and aslicing criterion(a function call in our setting), the computed forward slice contains those parts of the original program which arereachablefrom the slicing criterion. Our approach to program slicing is based on an extension of (online) partial evaluation. Therefore, it provides a simple way to develop program slicing tools from existing partial evaluators and helps to clarify the relation between both methodologies. A slicing tool for the multi-paradigm language Curry, which demonstrates the usefulness of our approach, has been implemented in Curry itself.
18
Muddappa, S., R. Z. Makki, Z. Michalewicz und S. Isukapalli. „Pioneer: A New Tool for Coding of Multi-Level Finite State Machines Based on Evolution Programming“. VLSI Design 2, Nr. 2 (01.01.1994): 105–16. http://dx.doi.org/10.1155/1994/13748.
Der volle Inhalt der QuelleAnnotation:
In this paper we present a new tool for the encoding of multi-level finite state machines based on the concept of evolution programming. Evolution programs are stochastic adaptive algorithms, based on the paradigm of genetic algorithms whose search methods model some natural phenomenon: genetic inheritance and Darwinian strife for survival. Crossover and mutation rates were tailored to the state assignment problem experimentally. We present results over a wide range of MCNC benchmarks which demonstrate the effectiveness of the new tool. The results show that evolution programs can be effectively applied to state assignment.
19
Nair, Manjusha, Jinesh Manchan Kannimoola, Bharat Jayaraman, Bipin Nair und Shyam Diwakar. „Temporal constrained objects for modelling neuronal dynamics“. PeerJ Computer Science 4 (23.07.2018): e159. http://dx.doi.org/10.7717/peerj-cs.159.
Der volle Inhalt der QuelleAnnotation:
Background Several new programming languages and technologies have emerged in the past few decades in order to ease the task of modelling complex systems. Modelling the dynamics of complex systems requires various levels of abstractions and reductive measures in representing the underlying behaviour. This also often requires making a trade-off between how realistic a model should be in order to address the scientific questions of interest and the computational tractability of the model. Methods In this paper, we propose a novel programming paradigm, called temporal constrained objects, which facilitates a principled approach to modelling complex dynamical systems. Temporal constrained objects are an extension of constrained objects with a focus on the analysis and prediction of the dynamic behaviour of a system. The structural aspects of a neuronal system are represented using objects, as in object-oriented languages, while the dynamic behaviour of neurons and synapses are modelled using declarative temporal constraints. Computation in this paradigm is a process of constraint satisfaction within a time-based simulation. Results We identified the feasibility and practicality in automatically mapping different kinds of neuron and synapse models to the constraints of temporal constrained objects. Simple neuronal networks were modelled by composing circuit components, implicitly satisfying the internal constraints of each component and interface constraints of the composition. Simulations show that temporal constrained objects provide significant conciseness in the formulation of these models. The underlying computational engine employed here automatically finds the solutions to the problems stated, reducing the code for modelling and simulation control. All examples reported in this paper have been programmed and successfully tested using the prototype language called TCOB. The code along with the programming environment are available at http://github.com/compneuro/TCOB_Neuron. Discussion Temporal constrained objects provide powerful capabilities for modelling the structural and dynamic aspects of neural systems. Capabilities of the constraint programming paradigm, such as declarative specification, the ability to express partial information and non-directionality, and capabilities of the object-oriented paradigm especially aggregation and inheritance, make this paradigm the right candidate for complex systems and computational modelling studies. With the advent of multi-core parallel computer architectures and techniques or parallel constraint-solving, the paradigm of temporal constrained objects lends itself to highly efficient execution which is necessary for modelling and simulation of large brain circuits.
20
Casadei, Roberto, Gianluca Aguzzi und Mirko Viroli. „A Programming Approach to Collective Autonomy“. Journal of Sensor and Actuator Networks 10, Nr. 2 (19.04.2021): 27. http://dx.doi.org/10.3390/jsan10020027.
Der volle Inhalt der QuelleAnnotation:
Research and technology developments on autonomous agents and autonomic computing promote a vision of artificial systems that are able to resiliently manage themselves and autonomously deal with issues at runtime in dynamic environments. Indeed, autonomy can be leveraged to unburden humans from mundane tasks (cf. driving and autonomous vehicles), from the risk of operating in unknown or perilous environments (cf. rescue scenarios), or to support timely decision-making in complex settings (cf. data-centre operations). Beyond the results that individual autonomous agents can carry out, a further opportunity lies in the collaboration of multiple agents or robots. Emerging macro-paradigms provide an approach to programming whole collectives towards global goals. Aggregate computing is one such paradigm, formally grounded in a calculus of computational fields enabling functional composition of collective behaviours that could be proved, under certain technical conditions, to be self-stabilising. In this work, we address the concept of collective autonomy, i.e., the form of autonomy that applies at the level of a group of individuals. As a contribution, we define an agent control architecture for aggregate multi-agent systems, discuss how the aggregate computing framework relates to both individual and collective autonomy, and show how it can be used to program collective autonomous behaviour. We exemplify the concepts through a simulated case study, and outline a research roadmap towards reliable aggregate autonomy.
21
HU, WEI, TIANZHOU CHEN, QINGSONG SHI und SHA LIU. „CRITICAL-PATH DRIVEN ROUTERS FOR ON-CHIP NETWORKS“. Journal of Circuits, Systems and Computers 19, Nr. 07 (November 2010): 1543–57. http://dx.doi.org/10.1142/s021812661000689x.
Der volle Inhalt der QuelleAnnotation:
Multithreaded programming has become the dominant paradigm in computer architecture, mainly in the form of multi-core processors. The performance bottleneck of a multithreaded program is its critical path, whose length is its total execution time. As the number of cores within a processor increases, Network-on-Chip (NoC) has been proposed as a promising approach for inter-core communication. In order to optimize the performance of a multithreaded program running on an NoC based multi-core platform, we design and implement the critical-path driven router, which prioritizes inter-thread communication on the critical path when routing packets. The experimental results show that the critical-path driven router improves the execution time of the test case by 14.8% compared to the ordinary router.
22
Bertoli, Annalisa, Andrea Cervo, Carlo Alberto Rosati und Cesare Fantuzzi. „Smart Node Networks Orchestration: A New E2E Approach for Analysis and Design for Agile 4.0 Implementation“. Sensors 21, Nr. 5 (26.02.2021): 1624. http://dx.doi.org/10.3390/s21051624.
Der volle Inhalt der QuelleAnnotation:
The field of cyber-physical systems is a growing IT research area that addresses the deep integration of computing, communication and process control, possibly with humans in the loop. The goal of such area is to define modelling, controlling and programming methodologies for designing and managing complex mechatronics systems, also called industrial agents. Our research topic mainly focuses on the area of data mining and analysis by means of multi-agent orchestration of intelligent sensor nodes using internet protocols, providing also web-based HMI visualizations for data interpretability and analysis. Thanks to the rapid spreading of IoT systems, supported by modern and efficient telecommunication infrastructures and new decentralized control paradigms, the field of service-oriented programming finds new application in wireless sensor networks and microservices paradigm: we adopted such paradigm in the implementation of two different industrial use cases. Indeed, we expect a concrete and deep use of such technologies with 5G spreading. In the article, we describe the common software architectural pattern in IoT applications we used for the distributed smart sensors, providing also design and implementation details. In the use case section, the prototypes developed as proof of concept and the KPIs used for the system validation are described to provide a concrete solution overview.
23
Altomare, C., X. Gironella und D. Laucelli. „Evolutionary data-modelling of an innovative low reflective vertical quay“. Journal of Hydroinformatics 15, Nr. 3 (27.12.2012): 763–79. http://dx.doi.org/10.2166/hydro.2012.219.
Der volle Inhalt der QuelleAnnotation:
Vertical walls are commonly used as berthing structures. However, conventional vertical quays may have serious technical and environmental problems, as they reflect almost all the energy of the incident waves, thus affecting operational conditions and structural strength. These drawbacks can be overcome by the use of low reflective structures, but for some instances no theoretical equations exist to determine the relationship between the reflection coefficient and parameters that affect the structural response. Therefore, this study tries to fill this gap by examining the wave reflection of an absorbing gravity wall by means of evolutionary polynomial regression, a hybrid evolutionary modelling paradigm that combines the best features of conventional numerical regression and genetic programming. The method implements a multi-modelling approach in which a multi-objective genetic algorithm is used to get optimal models in terms of parsimony of mathematical expressions and fitting to data. A database of physical laboratory observations is used to predict the reflection as a function of a set of variables that characterize wave conditions and structure features. The proposed modelling paradigm proved to be a useful tool for data analysis and is able to find feasible explicit models featured by an appreciable generalization performance.
24
GEBSER, MARTIN, ROLAND KAMINSKI, BENJAMIN KAUFMANN und TORSTEN SCHAUB. „Multi-shot ASP solving with clingo“. Theory and Practice of Logic Programming 19, Nr. 1 (10.07.2018): 27–82. http://dx.doi.org/10.1017/s1471068418000054.
Der volle Inhalt der QuelleAnnotation:
AbstractWe introduce a new flexible paradigm of grounding and solving in Answer Set Programming (ASP), which we refer to as multi-shot ASP solving, and present its implementation in the ASP systemclingo. Multi-shot ASP solving features grounding and solving processes that deal with continuously changing logic programs. In doing so, they remain operative and accommodate changes in a seamless way. For instance, such processes allow for advanced forms of search, as in optimization or theory solving, or interaction with an environment, as in robotics or query answering. Common to them is that the problem specification evolves during the reasoning process, either because data or constraints are added, deleted, or replaced. This evolutionary aspect adds another dimension to ASP since it brings about state changing operations. We address this issue by providing an operational semantics that characterizes grounding and solving processes in multi-shot ASP solving. This characterization provides a semantic account of grounder and solver states along with the operations manipulating them. The operative nature of multi-shot solving avoids redundancies in relaunching grounder and solver programs and benefits from the solver's learning capacities.clingoaccomplishes this by complementing ASP's declarative input language with control capacities. On the declarative side, a new directive allows for structuring logic programs into named and parameterizable subprograms. The grounding and integration of these subprograms into the solving process is completely modular and fully controllable from the procedural side. To this end,clingooffers a new application programming interface that is conveniently accessible via scripting languages. By strictly separating logic and control,clingoalso abolishes the need for dedicated systems for incremental and reactive reasoning, likeiclingoandoclingo, respectively, and its flexibility goes well beyond the advanced yet still rigid solving processes of the latter.
25
Hsieh, Fu-Shiung. „A Comparative Study of Two Evolutionary Computation Approaches for Formation of Production Processes in Reconfigurable Manufacturing Systems“. International Journal of Manufacturing, Materials, and Mechanical Engineering 10, Nr. 3 (Juli 2020): 1–23. http://dx.doi.org/10.4018/ijmmme.2020070101.
Der volle Inhalt der QuelleAnnotation:
Due to the capabilities to effectively deal with changing demands and business environments, reconfigurable manufacturing systems (RMS) emerge as a paradigm for manufacturers to respond to challenges in the real world. This is to effectively form a production process based on resources available in RMS to meet the demand, which is an important issue. In this article, we address the process formation problem and model it based on a multi-agent system architecture. To specify the capabilities of machines and robots in RMS, we adopt Petri nets as the modelling tool and formulate the process formation problem as an integer programming problem. Due to the computational complexity in solving the integer programming problem, particle swarm optimization (PSO) and differential evolution (DE) approaches have been applied to solve the problem. Effectiveness of applying these two evolutionary computation algorithms to solve the process formation problem is compared based on experimental results.
26
Frénot, Stéphane, Frédéric Le Mouël, Julien Ponge und Guillaume Salagnac. „Various Extensions for the Ambient OSGi Framework“. International Journal of Adaptive, Resilient and Autonomic Systems 2, Nr. 3 (Juli 2011): 1–12. http://dx.doi.org/10.4018/jaras.2011070101.
Der volle Inhalt der QuelleAnnotation:
OSGi is a wrapper above the Java Virtual Machine that embraces two concepts: component approach and service-oriented programming. The component approach enables a Java run-time to host several concurrent applications, while the service-oriented programming paradigm allows the decomposition of applications into independent units that are dynamically bound at runtime. Combining component and service-oriented programming greatly simplifies the implementation of highly adaptive, constantly evolving applications. This, in turn, is an ideal match to the requirements and constraints of ambient intelligence computing, such as adaptation to changes associated with context evolution. OSGi particularly fits ambient requirements and constraints by absorbing and adapting to changes associated with context evolution. However, OSGi needs to be finely tuned in order to integrate ambient specific issues. This paper focuses on Zero-configuration architecture, Multi-provider framework, and Limited resource requirements. The authors studied many OSGi improvements that should be taken into account when building OSGi-based gateways. This paper summarizes the INRIA Amazones teamwork (http://amazones.gforge.inria.fr/) on extending OSGi specifications and implementations to cope with ambient concerns. This paper references three main concerns: management, isolation, and security.
27
Bošanský, Michal, und Bořek Patzák. „Different Approaches to Parallelization of Sparse Matrix Assembly Operation“. Applied Mechanics and Materials 825 (Februar 2016): 91–98. http://dx.doi.org/10.4028/www.scientific.net/amm.825.91.
Der volle Inhalt der QuelleAnnotation:
The aim of this paper is to evaluate efficiency of different approaches to parallelization ofstiffness matrix assembly operations, that can be found in any finite element software. OpenMP [1, 2]and POSIX Threads (Pthreads) programming models are two considered in this paper. The OpenMPmodel consist of an Application Program Interface (API) for multi-platform shared-memory parallelprogramming in C/C++. POSIX is an acronym for Portable Operating System Interface and Pthreadsstandards [3] defined as a set of C/C++ language [4] programming types and procedure calls forshared-memory parallel programming. The paper shows that parallelization can efficiently exploit thepower of modern available hardware, significantly reducing the needed computation time. Differentapproaches of each programming model are used for parallelization of stiffness matrix assemblycompared and their efficiency is evaluated in this paper.The different parallelization strategies were implemented in OOFEM [5] which is a free finiteelement code with object oriented architecture for solving mechanical, transport and fluid mechanicsproblems that operates on various platforms. The finite element method leads to set of algebraic equa-tions which components are assembled from contributions of individual elements. In this paper wefocus on assembly of sparse matrix contributions, such as stiffness as mass matrices. Domain decom-position paradigm, where the whole domain is decomposed into sub domain, which contributions areevaluated and assembled by individual threads is hard.The paper discuss the differences between approaches based on OpenMP and Pthreads, datascoping specification for correct parallel programming and memory allocation synchronization andscheduling.
28
Nosratabadi, Seyyed Mostafa, Reza Hemmati und Mohammad Jahandide. „Eco-environmental planning of various energy storages within multi-energy microgrid by stochastic price-based programming inclusive of demand response paradigm“. Journal of Energy Storage 36 (April 2021): 102418. http://dx.doi.org/10.1016/j.est.2021.102418.
Der volle Inhalt der Quelle
29
Liu, Chang, und Ying Zhong. „Multi-Level Adaptation in End-User Development of 3D Virtual Chemistry Experiments“. International Journal of Virtual and Personal Learning Environments 5, Nr. 1 (Januar 2014): 54–72. http://dx.doi.org/10.4018/ijvple.2014010104.
Der volle Inhalt der QuelleAnnotation:
Multi-level adaptation in end-user development (EUD) is an effective way to enable non-technical end users such as educators to gradually introduce more functionality with increasing complexity to 3D virtual learning environments developed by themselves using EUD approaches. Parameterization, integration, and extension are three levels of adaptation ranging from straightforward to complex in terms of what end users have to understand in order to develop functional software applications, all within reach of end users without special training on programming. A 3D educational application EUD system prototype, iVirtualWorld, has been expanded to support 3D virtual chemistry experiments generation using these three levels of EUD adaptation. An evaluation has been conducted on 18 participants from the education domain, and the results confirmed ease-of-learn, ease-of-use, and usefulness of this solution. Contributions of this paper are 1) a paradigm for applying EUD technologies in 3D virtual learning environment creation; 2) an easy-to-use tool for educators to build customized virtual chemistry experiments; and 3) empirical assessment data for the multi-level adaptation solution.
30
Pham, Xuan-Qui, Tien-Dung Nguyen, VanDung Nguyen und Eui-Nam Huh. „Joint Node Selection and Resource Allocation for Task Offloading in Scalable Vehicle-Assisted Multi-Access Edge Computing“. Symmetry 11, Nr. 1 (07.01.2019): 58. http://dx.doi.org/10.3390/sym11010058.
Der volle Inhalt der QuelleAnnotation:
The resource limitation of multi-access edge computing (MEC) is one of the major issues in order to provide low-latency high-reliability computing services for Internet of Things (IoT) devices. Moreover, with the steep rise of task requests from IoT devices, the requirement of computation tasks needs dynamic scalability while using the potential of offloading tasks to mobile volunteer nodes (MVNs). We, therefore, propose a scalable vehicle-assisted MEC (SVMEC) paradigm, which cannot only relieve the resource limitation of MEC but also enhance the scalability of computing services for IoT devices and reduce the cost of using computing resources. In the SVMEC paradigm, a MEC provider can execute its users’ tasks by choosing one of three ways: (i) Do itself on local MEC, (ii) offload to the remote cloud, and (iii) offload to the MVNs. We formulate the problem of joint node selection and resource allocation as a Mixed Integer Nonlinear Programming (MINLP) problem, whose major objective is to minimize the total computation overhead in terms of the weighted-sum of task completion time and monetary cost for using computing resources. In order to solve it, we adopt alternative optimization techniques by decomposing the original problem into two sub-problems: Resource allocation sub-problem and node selection sub-problem. Simulation results demonstrate that our proposed scheme outperforms the existing schemes in terms of the total computation overhead.
31
Jiang, Wei, Huiqiang Wang, Bingyang Li, Haibin Lv und Qingchuan Meng. „A multi-user multi-operator computing pricing method for Internet of things based on bi-level optimization“. International Journal of Distributed Sensor Networks 16, Nr. 1 (Januar 2020): 155014771990011. http://dx.doi.org/10.1177/1550147719900110.
Der volle Inhalt der QuelleAnnotation:
The Internet of mobile things is a promising paradigm that generates, stores, and processes amount of real-time data to render rich services for mobile users. Along with the increase of mobile devices in the field of Internet of things, more and more intelligent applications, such as face recognition and virtual reality, have emerged. These applications typically consume large amounts of computing and energy resources. However, due to the physical size limitations of Internet of things terminals, their computing capacity and power are limited, where users’ needs for application processing delay and power consumption cannot be met. Therefore, the concept of edge cloud computing has been proposed, which enhances the computing capacity of Internet of things terminals by offloading user tasks to edge servers for computation. When there are multiple operators, it is important to understand how users choose an operator to perform computation and how operators can reasonably price the computing capacity to meet their own interests. Therefore, we study the computation pricing and user decision-making problems of Internet of things under multi-user and multi-operator scenarios. The problem is divided into three phases and modeled as a two-level optimization problem. While an operator’s goal is to minimize the loss of his interests, the user’s goal is to minimize the computation cost (energy consumption and price). First, since the lower-level user decision-making problem is an integer linear programming problem, we transform it into an equivalent continuous linear programming problem by relaxation. Second, we transform the bi-level optimization problem into an equivalent single-level optimization problem by substituting the lower problem’s Karush–Kuhn–Tucker conditions into an upper problem. Finally, we use a spatial branch and bound algorithm to solve the problem. Experimental results show that the proposed algorithm can effectively maintain the benefits of both operators and users in the field of Internet of things.
32
Urgese, Gianvito, Francesco Barchi, Emanuele Parisi, Evelina Forno, Andrea Acquaviva und Enrico Macii. „Benchmarking a Many-Core Neuromorphic Platform With an MPI-Based DNA Sequence Matching Algorithm“. Electronics 8, Nr. 11 (14.11.2019): 1342. http://dx.doi.org/10.3390/electronics8111342.
Der volle Inhalt der QuelleAnnotation:
SpiNNaker is a neuromorphic globally asynchronous locally synchronous (GALS) multi-core architecture designed for simulating a spiking neural network (SNN) in real-time. Several studies have shown that neuromorphic platforms allow flexible and efficient simulations of SNN by exploiting the efficient communication infrastructure optimised for transmitting small packets across the many cores of the platform. However, the effectiveness of neuromorphic platforms in executing massively parallel general-purpose algorithms, while promising, is still to be explored. In this paper, we present an implementation of a parallel DNA sequence matching algorithm implemented by using the MPI programming paradigm ported to the SpiNNaker platform. In our implementation, all cores available in the board are configured for executing in parallel an optimised version of the Boyer-Moore (BM) algorithm. Exploiting this application, we benchmarked the SpiNNaker platform in terms of scalability and synchronisation latency. Experimental results indicate that the SpiNNaker parallel architecture allows a linear performance increase with the number of used cores and shows better scalability compared to a general-purpose multi-core computing platform.
33
Chargui, Tarik, Abdelghani Bekrar, Mohamed Reghioui und Damien Trentesaux. „Multi-Objective Sustainable Truck Scheduling in a Rail–Road Physical Internet Cross-Docking Hub Considering Energy Consumption“. Sustainability 11, Nr. 11 (03.06.2019): 3127. http://dx.doi.org/10.3390/su11113127.
Der volle Inhalt der QuelleAnnotation:
In the context of supply chain sustainability, Physical Internet (PI or π ) was presented as an innovative concept to create a global sustainable logistics system. One of the main components of the Physical Internet paradigm consists in encapsulating products in modular and standardized PI-containers able to move via PI-nodes (such as PI-hubs) using collaborative routing protocols. This study focuses on optimizing operations occurring in a Rail–Road PI-Hub cross-docking terminal. The problem consists of scheduling outbound trucks at the docks and the routing of PI-containers in the PI-sorter zone of the Rail–Road PI-Hub cross-docking terminal. The first objective is to minimize the energy consumption of the PI-conveyors used to transfer PI-containers from the train to the outbound trucks. The second objective is to minimize the cost of using outbound trucks for different destinations. The problem is formulated as a Multi-Objective Mixed-Integer Programming model (MO-MIP) and solved with CPLEX solver using Lexicographic Goal Programming. Then, two multi-objective hybrid meta-heuristics are proposed to enhance the computational time as CPLEX was time consuming, especially for large size instances: Multi-Objective Variable Neighborhood Search hybridized with Simulated Annealing (MO-VNSSA) and with a Tabu Search (MO-VNSTS). The two meta-heuristics are tested on 32 instances (27 small instances and 5 large instances). CPLEX found the optimal solutions for only 23 instances. Results show that the proposed MO-VNSSA and MO-VNSTS are able to find optimal and near optimal solutions within a reasonable computational time. The two meta-heuristics found optimal solutions for the first objective in all the instances. For the second objective, MO-VNSSA and MO-VNSTS found optimal solutions for 7 instances. In order to evaluate the results for the second objective, a one way analysis of variance ANOVA was performed.
34
Taki, Kazuo, und Nobuyuki Ichiyoshi. „Parallel processing on the multi-PSI computer and its evaluation â a programming paradigm based on a small-grain highly concurrent object model“. Systems and Computers in Japan 25, Nr. 1 (1994): 17–36. http://dx.doi.org/10.1002/scj.4690250102.
Der volle Inhalt der Quelle
35
L., Stephen, Mbugua J., Kyalo N. D. und Maitho T. „Social Support Structures; A catalyst to Sustainable Adolescents’ Reproductive Health Programming in Ghana“. Journal of Sustainable Development 14, Nr. 4 (26.05.2021): 1. http://dx.doi.org/10.5539/jsd.v14n4p1.
Der volle Inhalt der QuelleAnnotation:
The issue of adolescents’ reproductive ill-health has been widely recognized as a multi-scalar social problem that affects various sectors in the world today. In this regard, this empirical study was conducted to establish the extent to which social support structures, contribute to sustainable implementation of adolescents’ reproductive health programme in the Brong Ahafo Region of Ghana. A descriptive cross-sectional survey and correlational designs, underpinned by the pragmatic paradigm or mixed-method research as the appropriate research technique, was adopted study to investigate its purpose and objectives. Through a multistage sampling technique, a sample size of 189 respondents was generated from a target population of 332 stakeholders, with data obtained through key informant interview schedules, focus group discussions and direct observation, and structured and unstructured questionnaires administered in Ghana. It was found that social support structures and sustainable implementation of adolescent’s reproductive health programme are positively and significantly linked, since the model results shows that r = 0.831. R2 =0.691, F (1.180) = 401.713. p<0.001<0.05. We concluded that for sustainable implementation of adolescent’s reproductive health programmes, social support structures play a significant role in the process. Hence programme implementers and duty bearers of adolescent’s reproductive health interventions should take note of this fact and act accordingly.
36
Tonini, Federico, Bahare Khorsandi, Elisabetta Amato und Carla Raffaelli. „Scalable Edge Computing Deployment for Reliable Service Provisioning in Vehicular Networks“. Journal of Sensor and Actuator Networks 8, Nr. 4 (02.10.2019): 51. http://dx.doi.org/10.3390/jsan8040051.
Der volle Inhalt der QuelleAnnotation:
The global connected cars market is growing rapidly. Novel services will be offered to vehicles, many of them requiring low-latency and high-reliability networking solutions. The Cloud Radio Access Network (C-RAN) paradigm, thanks to the centralization and virtualization of baseband functions, offers numerous advantages in terms of costs and mobile radio performance. C-RAN can be deployed in conjunction with a Multi-access Edge Computing (MEC) infrastructure, bringing services close to vehicles supporting time-critical applications. However, a massive deployment of computational resources at the edge may be costly, especially when reliability requirements demand deployment of redundant resources. In this context, cost optimization based on integer linear programming may result in being too complex when the number of involved nodes is more than a few tens. This paper proposes a scalable approach for C-RAN and MEC computational resource deployment with protection against single-edge node failure. A two-step hybrid model is proposed to alleviate the computational complexity of the integer programming model when edge computing resources are located in physical nodes. Results show the effectiveness of the proposed hybrid strategy in finding optimal or near-optimal solutions with different network sizes and with affordable computational effort.
37
WESTFECHTEL, BERNHARD. „A GRAPH-BASED SYSTEM FOR MANAGING CONFIGURATIONS OF ENGINEERING DESIGN DOCUMENTS“. International Journal of Software Engineering and Knowledge Engineering 06, Nr. 04 (Dezember 1996): 549–83. http://dx.doi.org/10.1142/s0218194096000235.
Der volle Inhalt der QuelleAnnotation:
Due to increasing complexity of hardware and software systems, configuration management has been receiving more and more attention in nearly all engineering domains (e.g. electrical, mechanical, and software engineering). This observation has driven us to develop a domain-independent and adaptable configuration management model (called CoMa) for managing systems of engineering design documents. The CoMa model integrates composition hierarchies, dependencies, and versions into a coherent framework based on a sparse set of essential configuration management concepts. In order to give a clear and comprehensible specification, the CoMa model is defined in a high-level, multi-paradigm specification language (PROGRES) which combines concepts from various disciplines (database systems, knowledge-based systems, graph rewriting systems, programming languages). Finally, we also present an implementation which conforms to the formal specification and provides graphical, structure-oriented tools offering a bunch of sophisticated commands and operating in a heterogeneous environment.
38
Santangelo, A., A. Gentile, G. Vella, N. Ingraffia und M. Liotta. „XPL the Extensible Presentation Language“. Mobile Information Systems 5, Nr. 2 (2009): 125–39. http://dx.doi.org/10.1155/2009/317534.
Der volle Inhalt der QuelleAnnotation:
The last decade has witnessed a growing interest in the development of web interfaces enabling both multiple ways to access contents and, at the same time, fruition by multiple modalities of interaction (point-and-click, contents reading, voice commands, gestures, etc.). In this paper we describe a framework aimed at streamlining the design process of multi-channel, multimodal interfaces enabling full reuse of software components. This framework is called the eXtensible Presentation architecture and Language (XPL), a presentation language based on design pattern paradigm that keeps separated the presentation layer from the underlying programming logic. The language supplies a methodology to expedite multimodal interface development and to reduce the effort to implement interfaces for multiple access devices, by means of using the same code. This paper describes a methodology approach based on Visual Design Pattern (ViDP) and Verbal Design Pattern (VeDP), offering examples of multimodal and multichannel interfaces created with the XPL Editor.
39
Guo, Wei, und Pingyu Jiang. „Manufacturing service order allocation in the context of social manufacturing based on Stackelberg game“. Proceedings of the Institution of Mechanical Engineers, Part B: Journal of Engineering Manufacture 233, Nr. 8 (23.11.2018): 1890–901. http://dx.doi.org/10.1177/0954405418808190.
Der volle Inhalt der QuelleAnnotation:
For adapting the socialization, individuation and servitization in manufacturing industry, a new manufacturing paradigm called social manufacturing has received a lot of attention. Social manufacturing can be seen as a network that enterprises with socialized resources self-organized into communities that provide personalized machining and service capabilities to customers. Since a community of social manufacturing has multiple enterprises and emphasizes on the importance of service, manufacturing service order allocation must be studied from the new perspective considering objectives on service cost and quality of service. The manufacturing service order allocation can be seen as a one-to-many game model with multi-objective. In this article, a Stackelberg game model is proposed to tackle the manufacturing service order allocation problem with considering the payoffs on cost and quality of service. Since this Stackelberg game can be mapped to a multi-objective bi-level programming, a modified multi-objective hierarchical Bird Swarm Algorithm is used to find the Nash equilibrium of the game. Finally, a case from a professional printing firm is analyzed to validate the proposed methodology and model. The objective of this research is to find the Nash equilibrium on the manufacturing service order allocation and provide strategies guidance for customer and small- and medium-sized enterprises with optimal service cost and lead time. According to the game process and Nash equilibrium, some rules are revealed, and they are useful for guiding practical production.
40
Schmitt, Christian, Moritz Schmid, Sebastian Kuckuk, Harald Köstler, Jürgen Teich und Frank Hannig. „Reconfigurable Hardware Generation of Multigrid Solvers with Conjugate Gradient Coarse-Grid Solution“. Parallel Processing Letters 28, Nr. 04 (Dezember 2018): 1850016. http://dx.doi.org/10.1142/s0129626418500160.
Der volle Inhalt der QuelleAnnotation:
Not only in the field of high-performance computing (HPC), field programmable gate arrays (FPGAs) are a soaringly popular accelerator technology. However, they use a completely different programming paradigm and tool set compared to central processing units (CPUs) or even graphics processing units (GPUs), adding extra development steps and requiring special knowledge, hindering widespread use in scientific computing. To bridge this programmability gap, domain-specific languages (DSLs) are a popular choice to generate low-level implementations from an abstract algorithm description. In this work, we demonstrate our approach for the generation of numerical solver implementations based on the multigrid method for FPGAs from the same code base that is also used to generate code for CPUs using a hybrid parallelization of MPI and OpenMP. Our approach yields in a hardware design that can compute up to 11 V-cycles per second with an input grid size of 4096[Formula: see text]4096 and solution on the coarsest using the conjugate gradient (CG) method on a mid-range FPGA, beating vectorized, multi-threaded execution on an Intel Xeon processor.
41
Pham, Xuan-Qui, Tien-Dung Nguyen, VanDung Nguyen und Eui-Nam Huh. „Utility-Centric Service Provisioning in Multi-Access Edge Computing“. Applied Sciences 9, Nr. 18 (09.09.2019): 3776. http://dx.doi.org/10.3390/app9183776.
Der volle Inhalt der QuelleAnnotation:
Recently, multi-access edge computing (MEC) is a promising paradigm to offer resource-intensive and latency-sensitive services for IoT devices by pushing computing functionalities away from the core cloud to the edge of networks. Most existing research has focused on effectively improving the use of computing resources for computation offloading while neglecting non-trivial amounts of data, which need to be pre-stored to enable service execution (e.g., virtual/augmented reality, video analytics, etc.). In this paper, we, therefore, investigate service provisioning in MEC consisting of two sub-problems: (i) service placement determining services to be placed in each MEC node under its storage capacity constraint, and (ii) request scheduling determining where to schedule each request considering network delay and computation limitation of each MEC node. The main objective is proposed to ensure the quality of experience (QoE) of users, which is also yet to be studied extensively. A utility function modeling user perception of service latency is used to evaluate QoE. We formulate the problem of service provisioning in MEC as an Integer Nonlinear Programming (INLP), aiming at maximizing the total utility of all users. We then propose a Nested-Genetic Algorithm (Nested-GA) consisting of two genetic algorithms, each of whom solves a sub-problem regarding service placement or request scheduling decisions. Finally, simulation results demonstrate that our proposal outperforms conventional methods in terms of the total utility and achieves close-to-optimal solutions.
42
CAO, JIAN, und SHENSHENG ZHANG. „AN INTEGRATED MULTI-AGENT CSCW SYSTEM FOR CONCURRENT PRODUCT DEVELOPMENT“. International Journal of Information Technology & Decision Making 01, Nr. 03 (September 2002): 423–40. http://dx.doi.org/10.1142/s0219622002000270.
Der volle Inhalt der QuelleAnnotation:
Product development capability is more and more important for an enterprise in a knowledge-based economic era. In the philosophy of concurrent engineering, product development should be carried out in a concurrent way. Computer support is necessary for Concurrent Product Development (CPD). As an excellent tool to meet complex needs, CSCW has been used in CPD. But nearly all CSCW systems that have been developed so far concentrate on a more or less narrow sub-field of cooperative work. Thus, the need of integrated CSCW applications are apparent. The agent is a suitable programming paradigm that can be used to meet the complex needs. In this paper, a P-PROCE (Process, Product, Resource, Organization, Control & Evaluation) model is introduced for CPD firstly. By categorizing the agents of the multi-agent system (MAS) into different types of agent according to P-PROCE model and offering a structure of MAS, the CPD is mapped to MAS. The cooperation among agents is very important for MAS. In the paper, a two-layer cooperation structure of MAS is proposed. In the macro layer, agent based workflow control the CPD process and in the micro layer the entity agents interact with each other directly to fulfill the task. The key issues of these two cooperation layers are discussed in the paper. Component based structure of agent and an implemented case are also provided in the paper.
43
Huang, Lei, Yandong Zhao, Liang Mei, Peiyi Wu, Zhihua Zhao und Yijun Mao. „Structural Holes in the Multi-Sided Market: A Market Allocation Structure Analysis of China’s Car-Hailing Platform in the Context of Open Innovation“. Sustainability 11, Nr. 20 (19.10.2019): 5813. http://dx.doi.org/10.3390/su11205813.
Der volle Inhalt der QuelleAnnotation:
Car-hailing platform governance is an emerging topic of research and practice. The governance of the data-driven platform economy is challenging the research paradigm of competition regulation in the context of open innovation. This research is trying to reveal the market allocation structure of China’s online car-hailing industry from the perspective of personal data allocation by the study of Application Programming Interface (API) of sample platforms. On the basis of the networked nature of personal data allocation via APIs, this research constructs a mathematical model of the edge weight of data resource connections between platforms. Furthermore, this research optimises the structural hole analysis of complex networks to discuss the state of personal data resource allocation in China’s car-hailing industry. Results reveal that there are obvious structural holes within the sample network. When compared with related indicators, we found that accessing personal data resources is an essential component of the sample network competition capability and sustainable innovation. Social media platforms and online payment platforms more greatly impact car-hailing platform competition than other types of platforms within the multi-sided market context. This research offers a research perspective of personal data allocation for further study of competition, regulation and sustainable innovation of data-driven platform economies.
44
Abbott, Rogers, Dumesic und Levine. „Naturally Occurring and Experimentally Induced Rhesus Macaque Models for Polycystic Ovary Syndrome: Translational Gateways to Clinical Application“. Medical Sciences 7, Nr. 12 (27.11.2019): 107. http://dx.doi.org/10.3390/medsci7120107.
Der volle Inhalt der QuelleAnnotation:
Indian rhesus macaque nonhuman primate models for polycystic ovary syndrome (PCOS) implicate both female hyperandrogenism and developmental molecular origins as core components of PCOS etiopathogenesis. Establishing and exploiting macaque models for translational impact into the clinic, however, has required multi-year, integrated basic-clinical science collaborations. Paradigm shifting insight has accrued from such concerted investment, leading to novel mechanistic understanding of PCOS, including hyperandrogenic fetal and peripubertal origins, epigenetic programming, altered neural function, defective oocytes and embryos, adipogenic constraint enhancing progression to insulin resistance, pancreatic decompensation and type 2 diabetes, together with placental compromise, all contributing to transgenerational transmission of traits likely to manifest in adult PCOS phenotypes. Our recent demonstration of PCOS-related traits in naturally hyperandrogenic (High T) female macaques additionally creates opportunities to employ whole genome sequencing to enable exploration of gene variants within human PCOS candidate genes contributing to PCOS-related traits in macaque models. This review will therefore consider Indian macaque model contributions to various aspects of PCOS-related pathophysiology, as well as the benefits of using macaque models with compellingly close homologies to the human genome, phenotype, development and aging.
45
ROBERGE, VINCENT, MOHAMMED TARBOUCHI und FRANÇOIS ALLAIRE. „PARALLEL HYBRID METAHEURISTIC ON SHARED MEMORY SYSTEM FOR REAL-TIME UAV PATH PLANNING“. International Journal of Computational Intelligence and Applications 13, Nr. 02 (Juni 2014): 1450008. http://dx.doi.org/10.1142/s1469026814500084.
Der volle Inhalt der QuelleAnnotation:
In this paper, we present a parallel hybrid metaheuristic that combines the strengths of the particle swarm optimization (PSO) and the genetic algorithm (GA) to produce an improved path-planner algorithm for fixed wing unmanned aerial vehicles (UAVs). The proposed solution uses a multi-objective cost function we developed and generates in real-time feasible and quasi-optimal trajectories in complex 3D environments. Our parallel hybrid algorithm simulates multiple GA populations and PSO swarms in parallel while allowing migration of solutions. This collaboration between the GA and the PSO leads to an algorithm that exhibits the strengths of both optimization methods and produces superior solutions. Moreover, by using the "single-program, multiple-data" parallel programming paradigm, we maximize the use of today's multicore CPU and significantly reduce the execution time of the parallel program compared to a sequential implementation. We observed a quasi-linear speedup of 10.7 times faster on a 12-core shared memory system resulting in an execution time of 5 s which allows in-flight planning. Finally, we show with statistical significance that our parallel hybrid algorithm produces superior trajectories to the parallel GA or the parallel PSO we previously developed.
46
Rapley, Adam, Xavier Bellekens, Lynsay Shepherd und Colin McLean. „Mayall: A Framework for Desktop JavaScript Auditing and Post-Exploitation Analysis“. Informatics 5, Nr. 4 (17.12.2018): 46. http://dx.doi.org/10.3390/informatics5040046.
Der volle Inhalt der QuelleAnnotation:
Writing desktop applications in JavaScript offers developers the opportunity to create cross-platform applications with cutting-edge capabilities. However, in doing so, they are potentially submitting their code to a number of unsanctioned modifications from malicious actors. Electron is one such JavaScript application framework which facilitates this multi-platform out-the-box paradigm and is based upon the Node.js JavaScript runtime—an increasingly popular server-side technology. By bringing this technology to the client-side environment, previously unrealized risks are exposed to users due to the powerful system programming interface that Node.js exposes. In a concerted effort to highlight previously unexposed risks in these rapidly expanding frameworks, this paper presents the Mayall Framework, an extensible toolkit aimed at JavaScript security auditing and post-exploitation analysis. This paper also exposes fifteen highly popular Electron applications and demonstrates that two-thirds of applications were found to be using known vulnerable elements with high CVSS (Common Vulnerability Scoring System) scores. Moreover, this paper discloses a wide-reaching and overlooked vulnerability within the Electron Framework which is a direct byproduct of shipping the runtime unaltered with each application, allowing malicious actors to modify source code and inject covert malware inside verified and signed applications without restriction. Finally, a number of injection vectors are explored and appropriate remediations are proposed.
47
Bernabeu, Miguel O., Rafel Bordas, Pras Pathmanathan, Joe Pitt-Francis, Jonathan Cooper, Alan Garny, David J. Gavaghan, Blanca Rodriguez, James A. Southern und Jonathan P. Whiteley. „C haste : incorporating a novel multi-scale spatial and temporal algorithm into a large-scale open source library“. Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences 367, Nr. 1895 (28.05.2009): 1907–30. http://dx.doi.org/10.1098/rsta.2008.0309.
Der volle Inhalt der QuelleAnnotation:
Recent work has described the software engineering and computational infrastructure that has been set up as part of the Cancer, Heart and Soft Tissue Environment (C haste ) project. C haste is an open source software package that currently has heart and cancer modelling functionality. This software has been written using a programming paradigm imported from the commercial sector and has resulted in a code that has been subject to a far more rigorous testing procedure than that is usual in this field. In this paper, we explain how new functionality may be incorporated into C haste . Whiteley has developed a numerical algorithm for solving the bidomain equations that uses the multi-scale (MS) nature of the physiology modelled to enhance computational efficiency. Using a simple geometry in two dimensions and a purpose-built code, this algorithm was reported to give an increase in computational efficiency of more than two orders of magnitude. In this paper, we begin by reviewing numerical methods currently in use for solving the bidomain equations, explaining how these methods may be developed to use the MS algorithm discussed above. We then demonstrate the use of this algorithm within the C haste framework for solving the monodomain and bidomain equations in a three-dimensional realistic heart geometry. Finally, we discuss how C haste may be developed to include new physiological functionality—such as modelling a beating heart and fluid flow in the heart—and how new algorithms aimed at increasing the efficiency of the code may be incorporated.
48
Zelenchuk, Nikita, Ekaterina Pristavka und Aleksandr Maliavko. „Compiler from El programing language: improvement and development“. Digital Technology Security, Nr. 2 (25.06.2021): 9–19. http://dx.doi.org/10.17212/2782-2230-2021-2-9-19.
Der volle Inhalt der QuelleAnnotation:
The implementation of the new multi-paradigm (functionally- imperative) programming language El, developed at the Department of Computer Science of the Novosibirsk State Technical University, in the form of a compiler is associated with the need to find ways to solve a number of complex problems. The current version of the compiler does implement only partially functionality of the language and generates far from optimal executable codes. In this paper, we consider the problem of an efficient compilation of an El-program, taking into account the need to implement new high-level data structures (two-sided lists, vectors with special forms of access, and a number of others) and control structures of the language, which make it possible to uniformly define cyclic and branching computational processes, as well as those laid down in the language a mechanism for explicitly controlling the mutability of variables. The tasks of improving and developing a compiler organized according to the classical multi-platform scheme are briefly considered, in which the front-end (lexical, syntactic, and semantic analyzers) converts the program to be translated into pseudocode of a single format, and used efficient infrastructure for building LLVM compilers as a back-end that turns pseudocode into executable code for different platforms. Execution of all possible operations on elements of high-level data structures (lists, tuples, vectors), as well as on arbitrary-precision numbers, has been moved to the runtime support library and, accordingly, can be deeply optimized. For this structure, the outlined ways of solving the problem of developing and improving the compiler by deep reforming and optimization of the chain of transformations of the translated program implemented by the front-end are formulated. At the initial stage, it is planned to implement a new compiler for two platforms: Linux and Windows.
49
Zhao, Ketong, und Bingzhen Sun. „A supply chain model for Medicare of impoverished people with the policy of targeted poverty alleviation of China“. Kybernetes 49, Nr. 3 (11.07.2019): 896–915. http://dx.doi.org/10.1108/k-03-2019-0180.
Der volle Inhalt der QuelleAnnotation:
Purpose The purpose of this paper is to present a new method and model for constructing a new decision-making paradigm of Medicare, which can not only satisfy the needs of the sick people but also reduce the possibility of people slipping back to poverty due to diseases under the policy of Targeted Poverty Alleviation (TPA) of China. Design/methodology/approach This paper uses the traditional supply chain theory to analyze the Medicare of impoverished people with the policy of TPA of China and transforms it into a multi-layer supply chain optimization decision-making problem. First, a nonlinear integer programming model for poor people’s Medicare decision with opportunity constraints is constructed. To facilitate the solution of the optimal decision scheme, the abovementioned model is transformed into a linear integer programming model with opportunity constraints by using the Newsvendor model for reference. Meanwhile, the scope of the inventory model is discussed, for it can be combined with the construction of the medical insurance system better. Second, the theoretical model is applied to the practical problem. Finally, based on the results of the theoretical model applying the practical problem, we give further improvement and modification of the theoretical model applies it to the actual situation further. Findings This paper presents a theoretical model about determine the optimal the inventory, under the framework of traditional supply chain decision-making, for it can be combined with the construction of the medical insurance system better. The theoretical model is applied to the practical problem of the fight against poverty in XX County, China. By using the actual data and MATLAB, optimal decision scheme is obtained. Originality/value There are two aspects of value. On the one hand, this paper provides a new way to construct a Medicare system of impoverished people with TPA of China. On the other hand, this paper tries making a new way to handle the storage of medicines and related medical devices at basic standard clinics decision-making problems based on above mentioned Medicare system.
50
Dufour, Yvon, und Peter Steane. „Creative strategic thinking and sustainable leadership: lessons from Picasso“. Journal of Global Responsibility 5, Nr. 2 (02.09.2014): 219–25. http://dx.doi.org/10.1108/jgr-05-2014-0018.
Der volle Inhalt der QuelleAnnotation:
Purpose – The purpose of this paper is to look at Cubism as a source of insights into creative strategic thinking. Cubism originated in the joint effort by Picasso and Braque. It was a new revolutionary paradigm that overthrew classic principles of representation; dispensing with the idea of a single fixed viewpoint that had dominated art for more than six centuries. The classic idea that there is a single best rational analytical process by which strategy comes to be has been dominating management education and practice for more than six decades. Design/methodology/approach – We use Picasso’s drawings and paintings as a metaphor for how leaders can look at strategic problems differently, consider more creative choices, and in acting, create more sustainable companies. Findings – This article argues that problems occur in organisations not because of poor strategic planning and programming but because of a lack of creative strategic thinking. Implication – Picasso’s art is often multi-layered, offering perspective upon perspective, from slightly different angles. It forces the viewer to stop, think and reconsider alternative perspectives in the search for meaning. Sustainable leaders must do this every day. We call this “strategy as cubism”. Originality/value – Strategic cubism is about thinking creatively in strategic decision-making through the use of alternative information, which adds value to the overall strategic thinking. Leaders use cubism to shape communication between managers to create options and alternatives, rather than close down creativity, to better facilitate strategic choices that are more sustainable.