Adam Jardine, Christopher Oakden · Linguistic Inquiry · 2023
This squib demonstrates how process-specific constraints—in which related but distinct processes in a language can be subject to differing conditions—can be captured with Boolean monadic recursive schemes (BMRSs), a computational formalism for phonological analysis based in mathematical logic. We use the case study of pharyngeal harmony in Palestinian Arabic, which motivated a discussion between Davis (1995) and McCarthy (1997) about the relative advantages and drawbacks of rule-based and Optimality Theory frameworks. We show how BMRS grammars naturally capture process-specific constraints in a way comparable to OT, while still being more computationally restrictive.
Cited by 1
Nicola Quadri · CERN Document Server (European Organization for Nuclear Research) · 2015
Cited by 0
Hartani, R. · NPARC · 1997
NRC publication: Yes
Cited by 0
Adam Beguelin, Philip M. Papadopoulos · 1994
PVM (Parallel Virtual Machine) assigns a single task identification (tid) to each process running on the distributed virtual machine. The tid encodes a machine identification and in the case of a multiprocessor machine, a node identification. Tid's are assigned in such a way that processes may be spawned locally with the local message routing process (pvmd) notifying the other pvmd's after the process addition. While this is a useful and convenient method from a systems view, it does not provide a sufficiently high level of abstraction for programmers who often prefer a 0 -- N naming scheme for spawned processes. PVM3 uses the notion of process groups to simplify the naming problem. Groups are implemented in a central server process that maps group names to (instance,tid) pairs and provides a mechanism for collective communications. Group membership is allowed to undergo changes during a program run and are termed dynamic. This ability can be especially important for long term calculat...
Cited by 0
Seppe K. L. M. vanden Broucke, Jan Vanthienen, Bart Baesens · 2014
The field of process mining deals with the extraction of knowledge from event logs. One task within the area of process mining entails the discovery of process models to represent real-life behavior as observed in day-to-day business activities. A large number of such process discovery algorithms have been proposed during the course of the past decade, among which techniques to mine declarative process models (e.g. Declare and AGNEs Miner) as well as evolutionary based techniques (e.g. Genetic Miner and Process Tree Miner). In this paper, we present the initial results of a newly proposed evolutionary based process discovery algorithm which aims to discover declarative process models, hence combining these two classes (declarative and genetic) of discovery techniques. To do so, we herein use a language bias similar to the one found in AGNEs Miner to allow for the conversion from a set of declarative control-flow based constraints (determining the conditions which have to be satisfied to enable to execution of an activity) to a procedural process model, i.e. a Petri net, though this language bias can be extended to include data-based constraints as well.
Cited by 6
V. D. Elvira · EPJ Web of Conferences · 2024
We present different elements of the 2021–2022 Computational Frontier (CompF) effort within the Snowmass process, including organization, events, and highlights of the final report [1]. With focus in the next 10–15 years, we analyze the impact of newly established and emerging technologies, identify challenges within theoretical, experimental and observational research programs, and present the report recommendations. We emphasize the main recommendation, which is the formation of a Coordinating Panel for Software and Computing (CPSC).
Cited by 0Open access
Michele Scagliarini, Raffaele Vermiglio · Journal of Modern Applied Statistical Methods · 2008
In manufacturing industry there is growing interest in measures of process capability under multivariate setting. Although there are many statistical packages to assess univariate capability, a current problem with the multivariate measures of capability is the shortage of user friendly software. In this article a Visual Basic program has been developed to realize an Excel spreadsheet that may be used to compute two multivariate measures of capability. The aim of this article is to provide a useful tool for practitioners dealing with multivariate capability assessment problems. The features of the program include easy data entry and clear report format.
Cited by 3Open access
Richard Wiste · ACM SIGSOC Bulletin · 1975
The various activities engaged in by those involved in computing can be looked upon from a number of perspectives. A choice of psychological, economic, geographic, political, or other perspectives may be made either on largely heuristic grounds or on grounds more closely tied to serious argument concerning the proper conduct of the activity under discussion. The choice of perspective embodied in this paper was made largely on the latter grounds. The basic argument is that, for many purposes, computing should be looked upon as a political process. If it were looked upon in this way, many things might be done otherwise, and the changes would be decidedly for the better.
Cited by 0Open access
Lopez, Phillip Alfonso · OSTI OAI (U.S. Department of Energy Office of Scientific and Technical Information) · 2018
Abstract not provided.
Cited by 0Open access
J. C. M. Baeten, J. A. Bergstra · 2008
Abstract. The real time process algebra of Baeten and Bergstra [Formal Aspects of Computing, 3, 142-188 (1991)] is extended to real space by requiring the presence of spatial coordinates for each atomic action, in addition to the required temporal attribute. It is found that asynchronous communication cannot easily be avoided. Based on the state operators of Baeten and Bergstra [Information and Computation, 78, 205-245 (1988)] and following Bergstra et al. [Proc. Seminar on Concurrency, LNCS 197, Springer, 1985, pp. 76-95], asychronous communication mechanisms are introduced as an additional feature of real space process algebra. The overall emphasis is on the introductory explanation of the features of real space process algebra, and characteristic examples are given for each of these. 1.
Cited by 0
Upul Senanayake (784902), Mahendra Piraveenan (287456), Albert Zomaya (784903) · Figshare · 2015
<p>Stage I involves running pagerank algorithm on the citation network and obtaining a pagerank value for each paper. Stage II involves assigning a suitably weighted proportion of each pagerank value to the authors of the corresponding paper. Stage III involves summing all pagerank value ‘shares’ an author has obtained, comparing it with other authors in the community and assigning a percentile value to that author accordingly. The considered community could be the world scientific community at large, or a subset thereof.</p>
Cited by 0Open access
Mousavi, Seyedmajid · University of Debrecen Electronic Archive (University of Debrecen) · 2017
Cited by 0
Koichiro Matsuno, Tateki Suzuki · 2003
Nonprogrammable molecular computing is observed in two distinct classes of biological processes, evolutionary and developmental. Evolutionary molecular computing generates information at the rate of approximately 3*10/sup -15/ b/s/degree of freedom. In contrast, developmental molecular computing generates information at the rate of approximately 10/sup 2/ b/s/degree of freedom. A unit of the developmental degree of freedom is an aggregate of those evolutionary degrees of freedom whose number is roughly of the order of 10/sup 16/.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
Cited by 0
Ying-ying Wong · 2009
Cited by 0Open access
Mike Dry · 2009
This paper presents two techniques for analyzing hydrometallurgical circuits and illustrates them using two worked examples. One is the leaching of laterite using sulfuric acid and the other is the leaching of uranium using sodium carbonate. A spreadsheet-based calculation technique using the stoichiometry of the process is compared to the use of specialized process modeling software.
Cited by 0
Nina Oertel, Jens Dibbern, Zoltan Nochta et al. · 2007
The term “ubiquitous technology ” refers to any technology that extends common objects with data processing capabilities, e.g. RFID systems, wireless sensor networks or networked embedded systems. In this study, we uncover the mechanisms by which these technologies contribute to an increased business process performance. We apply the theory of task-technology fit to establish a model of the impact of ubiquitous technologies on business process performance. Based on expert interviews in a large standard software company, the potential of ubiquitous technologies for enhancing performance in a number of generic business processes is explored. Furthermore, we illustrate how our findings can be applied to identify value-creating ubiquitous computing applications in companies.
Cited by 0
2006
Cited by 0
Urjaswala Vora · Lecture notes in networks and systems · 2024
Cited by 2
Umesh Kumar Verma · 2018
Cited by 0
Jinn‐Tsong Tsai, Wen‐Hsien Ho, Gong-Ming Hsu et al. · 2008
This paper proposes an optimal process design by using soft computing approaches. The proposed procedure integrates the Taguchi method, the artificial neural network, and the genetic algorithm. The Taguchi method is applied to collect experimental data representing the quality performances of a system. The artificial neural network is used to build a system model. The genetic algorithm is employed to search for the optimal process parameters. A process parameters design for a titanium dioxide (TiO <inf xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2</inf> ) thin film of the vacuum sputtering process is studied in this paper. The result estimated from the system model of the proposed procedure is satisfactory.
Cited by 5