Evaluation and derivation of process plans in turning

The objective of this paper is to formalize process planning selection to minimise the total processing time and the total number of processing steps. The study is performed by defining the processes and part description for turned parts. Two examples solved by the two proposed methods are reported. One of them is the derivation of a new plan which can be expressed as a function of the generated plans. The second method is based on the combination of process plans to generate a new plan which conforms optimally to the change in specification.Peer Reviewedhttp://deepblue.lib.umich.edu/bitstream/2027.42/45881/1/170_2005_Article_BF01351320.pd

A rolling-horizon quadratic-programming approach to the signal control problem in large-scale congested urban road networks

The paper investigates the efficiency of a recently developed signal control methodology, which offers a computationally feasible technique for real-time network-wide signal control in large-scale urban traffic networks and is applicable also under congested traffic conditions. In this methodology, the traffic flow process is modeled by use of the store-and-forward modeling paradigm, and the problem of network-wide signal control (including all constraints) is formulated as a quadratic-programming problem that aims at minimizing and balancing the link queues so as to minimize the risk of queue spillback. For the application of the proposed methodology in real time, the corresponding optimization algorithm is embedded in a rolling-horizon (model-predictive) control scheme. The control strategy’s efficiency and real-time feasibility is demonstrated and compared with the Linear-Quadratic approach taken by the signal control strategy TUC (Traffic-responsive Urban Control) as well as with optimized fixed-control settings via their simulation-based application to the road network of the city centre of Chania, Greece, under a number of different demand scenarios. The comparative evaluation is based on various criteria and tools including the recently proposed fundamental diagram for urban network traffic

A derivational rephrasing experiment for question answering

In Knowledge Management, variations in information expressions have proven a real challenge. In particular, classical semantic relations (e.g. synonymy) do not connect words with different parts-of-speech. The method proposed tries to address this issue. It consists in building a derivational resource from a morphological derivation tool together with derivational guidelines from a dictionary in order to store only correct derivatives. This resource, combined with a syntactic parser, a semantic disambiguator and some derivational patterns, helps to reformulate an original sentence while keeping the initial meaning in a convincing manner This approach has been evaluated in three different ways: the precision of the derivatives produced from a lemma; its ability to provide well-formed reformulations from an original sentence, preserving the initial meaning; its impact on the results coping with a real issue, ie a question answering task . The evaluation of this approach through a question answering system shows the pros and cons of this system, while foreshadowing some interesting future developments

Implementation of a Port-graph Model for Finance

In this paper we examine the process involved in the design and implementation of a port-graph model to be used for the analysis of an agent-based rational negligence model. Rational negligence describes the phenomenon that occurred during the financial crisis of 2008 whereby investors chose to trade asset-backed securities without performing independent evaluations of the underlying assets. This has contributed to motivating the search for more effective and transparent tools in the modelling of the capital markets. This paper shall contain the details of a proposal for the use of a visual declarative language, based on strategic port-graph rewriting, as a visual modelling tool to analyse an asset-backed securitisation market.Comment: In Proceedings TERMGRAPH 2018, arXiv:1902.0151

Voting and the Cardinal Aggregation of Judgments

The paper elaborates the idea that voting is an instance of the aggregation of judgments, this being a more general concept than the aggregation of preferences. To aggregate judgments one must first measure them. I show that such aggregation has been unproblematic whenever it has been based on an independent and unrestricted scale. The scales analyzed in voting theory are either context dependent or subject to unreasonable restrictions. This is the real source of the diverse 'paradoxes of voting' that would better be termed 'voting pathologies'. The theory leads me to advocate what I term evaluative voting. It can also be called utilitarian voting as it is based on having voters express their cardinal preferences. The alternative that maximizes the sum wins. This proposal operationalizes, in an election context, the abstract cardinal theories of collective choice due to Fleming and Harsanyi. On pragmatic grounds, I argue for a three valued scale for general elections

Repotting the Geraniums: On Nested Graph Transformation Rules

We propose a scheme for rule amalgamation based on nested graph predicates. Essentially, we extend all the graphs in such a predicate with right hand sides. Whenever such an enriched nested predicate matches (i.e., is satisfied by) a given host graph, this results in many individual match morphisms, and thus many “small” rule applications. The total effect is described by the amalgamated rule. This makes for a smooth, uniform and very powerful amalgamation scheme, which we demonstrate on a number of examples. Among the examples is the following, which we believe to be inexpressible in very few other parallel rule formalism proposed in the literature: repot all flowering geraniums whose pots have cracked.\u

Organic Farming Scenarios: Operational Analysis and Costs of implementing Innovative Technologies

The objective of this study has been to design a number of farm scenarios representing future plausible and internally consistent organic farming enterprises based on milk, pig, and plant production and use these farm scenarios as the basis for the generation of generalised knowledge on labour and machinery input and costs. Also, an impact analysis and feasibility study of introducing innovative technologies into the organic production system has been invoked. The labour demand for the production farms ranged from 61 to 253hha1 and from 194 to 396hLU1 (LU is livestock units) for work in the animal houses. Model validation results showed that farm managerial tasks amount to 14–19% of the total labour requirement. The impact of introducing new technologies and work methods related to organic farming was evaluated using two innovative examples of weed control: a weeding robot and an integrated system for band steaming. While these technologies increased the capital investment required, the labour demand was reduced by 83–85% in sugar beet and 60% in carrots, which would improve profitability by 72–85% if fully utilised. Profitability is reduced, if automation efforts result in insufficient weed removal compared to manual weeding. Specifically, the benefit gained by robotic weeding was sensitive to the weed intensity and the initial price of the equipment, but a weeding efficiency of under 25% is required to make it unprofitable. This approach demonstrates the feasibility of applying and testing operational models in organic farming systems in the continued evaluation and documentation of labour and machinery inputs