Search results for " programmi"
showing 10 items of 1629 documents
The Windy clustered prize-collecting arc-routing problem
2011
This paper introduces the windy clustered prize-collecting arc-routing problem. It is an arc-routing problem where each demand edge is associated with a profit that is collected once if the edge is serviced, independent of the number of times the edge is traversed. It is further required that if a demand edge is serviced, then all the demand edges of its component are also serviced. A mathematical programming formulation is given and some polyhedral results including several facet-defining and valid inequalities are presented. The separation problem for the different families of inequalities is studied. Numerical results from computational experiments are analyzed. © 2011 INFORMS.
The ius liberorum of non-Roman citizens in Egypt. Some notes on an old Taubenschlag’s hypothesis
2019
Abstract Normally the ius liberorum is associated with Roman citizens, but in the lex Irnitana we have evidence of non-Roman members of the curial class of Baetica who took advantage of this privilege. In Roman Egypt, the constitution of the boulai in the nome capitals could have provided a similar context for the selection of local elites in which Romanized Egyptians obtained that privilege.
Artificial intelligence techniques for cancer treatment planning
1988
An artificial intelligence system, NEWCHEM, for the development of new oncology therapies is described. This system takes into account the most recent advances in molecular and cellular biology and in cell-drug interaction, and aims to guide experimentation in the design of new optimal protocols. Further work is being carried out, aimed to embody in the system all the basic knowledge of biology, physiopathology and pharmacology, to reason qualitatively from first principles so as to be able to suggest cancer therapies.
Exploring the use of multi-gene genetic programming in regional models for the simulation of monthly river runoff series
2023
The use of new data-driven approaches based on the so-called expert systems to simulate runoff generation processes is a promising frontier that may allow for overcoming some modeling difficulties related to more complex traditional approaches. The present study highlights the potential of expert systems in creating regional hydrological models, for which they can benefit from the availability of large database. Different soft computing models for the reconstruction of the monthly natural runoff in river basins are explored, focusing on a new class of heuristic models, which is the Multi-Gene Genetic Programming (MGGP). The region under study is Sicily (Italy), where a regression based rain…
Pose classification using support vector machines
2000
In this work a software architecture is presented for the automatic recognition of human arm poses. Our research has been carried on in the robotics framework. A mobile robot that has to find its path to the goal in a partially structured environment can be trained by a human operator to follow particular routes in order to perform its task quickly. The system is able to recognize and classify some different poses of the operator's arms as direction commands like "turn-left", "turn-right", "go-straight", and so on. A binary image of the operator silhouette is obtained from the gray-level input. Next, a slice centered on the silhouette itself is processed in order to compute the eigenvalues …
Solving type-2 Assembly Line Balancing Problem with Fuzzy Binary Linear Programming
2013
Models of E-Democracy
2006
Pulished article in Communications of the Association for Information Systems, 17 (1), 818-840. Also available from the publisher: http://aisel.aisnet.org/cais/vol17/iss1/37/ Several theories of E-Democracy have been presented, and implementations of and experiments in E-Democracy emerged. However, existing literature on the subject appears rather non-comprehensive, lacking an integrated basis, for gathering knowledge in the future. After an analysis of theories of E-Democracy versus implementations reported in related literature, we address the need for a model generally absent from contemporary theoretical literature: the Partisan model of E-Democracy. We aim to simplify the current "jung…
Discontinuous Gradient Constraints and the Infinity Laplacian
2012
Motivated by tug-of-war games and asymptotic analysis of certain variational problems, we consider a gradient constraint problem involving the infinity Laplace operator. We prove that this problem always has a solution that is unique if a certain regularity condition on the constraint is satisfied. If this regularity condition fails, then solutions obtained from game theory and $L^p$-approximation need not coincide.
Analysis and Optimization Technique of Secure Smart Grid Communication Network for Sustainable Development
2019
The smart network includes many sub-frameworks, for example, the Home Area Network (HAN), which are at risk and prone to be attacked remotely. A smart grid communication is meant to design a mutual authentication scheme and a key management protocol. This study is aimed with an efficient arrangement for HAN that analyzes a framework set-up for HAN. In this paper, we have analyzed three cases: First, we show the normal execution then execution along with attackers. Using mutual authentication, we overcome attacks. It has introduced a number of routing schemes for grid networks in recent years, and they provide different level of privacy protection at different cost. First, an unspecified key…
A Multi-Expert Based Approach to Continuous Authentication of Mobile-Device Users
2003
Currently used in mobile devices PIN-based user authentication cannot provide a sufficient security level. Methods based on multi-modal user authentication involving biometrics (i.e. physical and behavioral characteristics of a person) may be employed to cope with this problem. However, dealing with physical characteristics only, these methods are either unable to provide continuous and user-friendly identity verification, or are resource consuming.