In the rapidly evolving landscape of web services, efficient interaction and optimal selection among services with different quality parameters are essential. This paper addresses the complex challenge of selecting candidate services for abstract services within probabilistic graph structures. We propose a new hybrid method that combines node-based and path-based graph simplification techniques, allowing for the identification of new patterns, such as parallel and nested loops. We use NSGAII to improve scalability and accuracy in service selection. The proposed approach simplifies the composition graph while optimizing the selection process by considering important quality parameters such as execution cost, response time, and availability. Through systematic simplification and a robust fitness function, we ensure a definitive and accurate response to user queries. The results show significant improvements in the proposed approach compared to existing methods, making it a comprehensive solution for effectively composing web services in dynamic environments.

Mobile devices are widely used and they are providing people with needed information anytime and anywhere. One of the most important mobile applications is related to the navigation and other GIS capabilities. The development of mobile applications needs to be adapted with the special features and limitations of this computing environment. Looking in this direction, we present a context aware mobile map representation which used the dual graph of street networks for automatic simplification and generalization of streets in various contexts. For this purpose, after the introduction and selection of context factors, the degree of dual graph nodes are used for automatic generation of maps with fewer details. We will show that we could increase the capability and efficiency of mobile GISs by using dual graphs, because by using that, the structure and the topology of street network could be maintained in generalization process.The proposed approach is validated by a case study applied to a region of Tehran city. The case study clearly showed the benefits of usingdual graphs in mobile map applications.

Terrain simplification problem is one of fundamental problems in computational geometry and it has many applications in other fields such as geometric information systems, computer graphics, image processing. Terrain is commonly defined by a set of n points in three dimension space. Major goal of terrain simplification problem is removing some points of one terrain so that maximum error of simplified surface is a certain threshold. There are two optimization goals for this problem: (1) min-k, where for a given error threshold e, the goal is to find a simplification with the minimum number of points for which the error is that most e, and (2) min-e, where for a given number n, the goal is to find a simplification of at most m points that has the minimum simplification error. simplification problem is NP-hard in optimal case.In this paper we present a hybrid algorithm for terrain simplification that performs in three phases. First, terrain is divided to some clusters, then any cluster is simplified independently and finally, the simplified clusters are merged. Our algorithm solves the problem in O (n2Ön). The proposed algorithm is implemented and verified by experiments.

This paper presents a new method for simplification of Boolean functions based on Boolean differences. The proposed method is applicable to various forms of Boolean functions, including truth tables and Binary Decision Diagrams (BDDs). The Boolean differences are extended to cover the truth tables with don't-care components and cutset graphs in BDDs. The results of simplification agree with Quine-McCluskey and ESPRESSO methods. Experimental tests on MCNC and Berkeley PLA benchmarks show that the proposed method gains a performance of 1.5-10 times faster than ESPRESSO. The algorithms of the proposed method are implemented in Java/Perl/C++, and a toolset for logic function simplification is developed.

Syntax principles in Arabic are the main base of this language, yet they have always been accompanied with complexity specially in the field of education. No doubt that different factors create this situation. Some of these factors are vapidity of principles, traditional methodology, fruitless efforts and aimless education. Furthermore, naturally, syntax consists of philosophical analysis and a large amount of idioms and details which make it difficult to for being understood not only by the learners but also by the teachers. Thus, it seems necessary to simplify the syntactic rules, and this is why so many attempts have been done up to now in this field although with little effect. Regarding all these facts it appears that irregular, sparse and not education-related solutions for syntax simplification will not be of any use. Instead, for accomplishing this task, we should use linguistic and teaching facts and knowledge. This paper aims to answer the questions like: How much could the attempts to simplify the syntax principles achieve? Why were these efforts fruitless? Which method can be suggested to simplify syntax education with better results?

Frequency response diagrams of a system include detailed and recognizable ‎information about the structural and parameter effects of the transfer function model ‎of the system. The information are qualitatively and quantitatively obtainable from ‎simultaneous consideration of amplitude ratio and phase information. In this paper, ‎some rules and relationships are presented for making use of frequency response ‎information in order to identify the structure of rational and irrational models in a ‎heuristic manner. Estimation of the values of the parameters are also accomplished in ‎a graphical trial and error procedure. As an example, the heuristic method was applied ‎for identifying the simplified model of a rotary cement kiln from the frequency ‎response information of the analytically derived model of the system. The analytical ‎model of the kiln, used in this paper, was obtained elsewere in a detailed procedure ‎with some assumptions and by using initial and boundary conditions. Results obtained ‎from identification of the simplified model for rotary cement kiln not only reveal the ‎application of the heuristic method for model identification, but also demonstrate the ‎appearance of unstable poles and zeros in the model of the system‏.‏

Bijan Jalali was one of the first poets to turn to prose poetry in simple language from the beginning, and his choice was not due to the development of modern poetry in Iran, especially Nima, but due to his presence in France and the influence of European literature. Jalali’ s poetry neither is half-hearted nor has the characteristics of white poetry, and in a sense it can be considered as a mediator between poetry and prose or white poetry or prose poetry. The kind of glorious expression in simplification and shorthand is a reflection of his life that has been internalized in the poet, so it is not acquired or artificial. After the forties and fifties, and the decline of symbolic and ideological expression, new poets, especially the new generation, have turned to glorious poetry. The point that has been neglected in introduction and review of Bijan Jalali's poems in the shadow of his simplification is his romances. At a glance, it seems that the poet has a tendency towards nature and mysticism, and the mentality of single life but his love poems have been ignored. The love we are talking about here is different from the love of nature and God and animals. Specifically, we are talking about earthly love and women, which has been addressed directly and indirectly in various collections. After studying Jalali's poems, the frequency of romances in different periods of his life is so great that makes it possible to publish a book solely on a selection of his romance poems.