به نام خدا
Title: A high abstraction level approach for detecting feature interactions between telecommunication services
Authors: Zohair Chentouf, Ahmed Khoumsi
Abstract: When several telecommunication services are running at the same time, undesirable behaviors may arise, which are commonly called feature interactions. Several methods have been developed for detecting and resolving feature interactions. However, most of these methods are based on detailed models of services, which make them suffer from state space explosion. Moreover, different telecommunication operators cannot cooperate to manage feature interactions by exchanging detailed service models because this violates the confidentiality principle. Our work is a part of the few attempts to develop feature interaction detection methods targeting to avoid or reduce significantly state space explosion. In order to reach this objective, we first develop a so called Cause Restrict language to model subscribers of telecommunication services at a very high abstraction level. A Cause Restrict model of a subscriber provides information such as: what is the cause of what, and what restricts (or forbids) what, and specifies coarsely the frequency of each operation cause or restrict by always or sometimes. Then, we develop a method that detects feature interactions between telecommunication services modeled in the Cause Restrict language. We demonstrate the applicability of our approach by modeling several services and detecting several feature interactions between them. New feature interactions have been detected by our approach.
Publish Year: 2013
Published in: Information Sciences - Science Direct
Number of Pages: 17
موضوع: مخابرات (Telecommunication)
ایران سای – مرجع مقالات علمی فنی مهندسی
حامی دانش بومی ایرانیان
به نام خدا
Title: Improved Genetic Algorithms based Optimum Path Planning for Mobile Robot
Authors: Soh Chin Yun , Veleppa Ganapathy ,Lim Ooi Chong
Abstract: Improved genetic algorithms incorporate other techniques, methods or algorithms to optimize the performance of genetic algorithm. In this paper, improved genetic algorithms of optimum path planning for mobile robot navigation are proposed. An Obstacle Avoidance Algorithm (OAA) and a Distinguish Algorithm (DA) are introduced to generate the initial population in order to improve the path planning efficiency to select only the feasible paths during the evolution of genetic algorithm. Domain heuristic knowledge based crossover, mutation, refinement and deletion operators are specifically designed to fit path planning for mobile robots. Proposed genetic algorithms feature unique, simple path representations, and simple but effective evaluation methods. Simulation studies and real time implementations are carried out to verify and validate the effectiveness of the proposed algorithms.
Publish Year: 2010
Published in: ICARCV - IEEE
Number of Pages: 13
موضوع: الگوریتم ژنتیک (Genetic Algorithms)
ایران سای – مرجع مقالات علمی فنی مهندسی
حامی دانش بومی ایرانیان
به نام خدا
Title: Fractal behind coin-reducing payment
Authors: Ken Yamamoto , Yoshihiro Yamazaki
Abstract: The minimal payment a payment method which minimizes the number of coins in a purse is presented. We focus on a time series of change given back to a shopper repeating the minimal payment. By using the delay plot, the set of successive change possesses a fine structure similar to the Sierpinski gasket. We also estimate affectivity of the minimal- payment method by means of the average number of coins in a purse, and conclude that the minimal-payment strategy is the best to reduce the number of coins in a purse. More- over, we compare our results to the rule-60 cellular automaton and the Pascal Sierpinski gaskets, which are known as generators of the discrete Sierpinski gasket.
Publish Year: 2012
Published in: Chaos, Solitons & Fractals - Science Direct
Number of Pages: 9
موضوع: فرکتال (Fractal)
ایران سای – مرجع مقالات علمی فنی مهندسی
حامی دانش بومی ایرانیان
به نام خدا
Title: Inductive Data Flow Graphs
Authors: Azadeh Farzan Zachary Kincaid, Andreas Podelski
Abstract: The correctness of a sequential program can be shown by the annotation of its control flow graph with inductive assertions. We pro-pose inductive data flow graphs, data flow graphs with incorporated inductive assertions, as the basis of an approach to verifying concurrent programs. An inductive data flow graph accounts for a set of dependencies between program actions in interleaved thread executions, and therefore stands as a representation for the set of concurrent program traces which give rise to these dependencies. The approach first constructs an inductive data flow graph and then checks whether all program traces are represented. The size of the inductive data flow graph is polynomial in the number of data dependencies (in a sense that can be made formal); it does not grow exponentially in the number of threads unless the data dependencies do. The approach shifts the burden of the exponential explosion towards the check whether all program traces are represented, i.e., to a combinatorial problem (over finite graphs).
Publish Year: 2013
Published in: ACM-SIGPLAN-SIGACT
Number of Pages: 14
موضوع: نظریه گراف (Graph Theory)
ایران سای – مرجع مقالات علمی فنی مهندسی
حامی دانش بومی ایرانیان
به نام خدا
Title: Minimizing Transmit Power for Cooperative Multicell System with Massive MIMO
Authors: Jinkyu Kang and Joonhyuk Kang
Abstract: We consider the problem of designing transmit beam former and power for downlink cooperative base-station(BS) system with a large antenna arrays. Since the design of the beam forming vector at the transmitter requires high computational complexity, in a large antenna arrays, we utilize the zero-forcing transmit beamformer, which is the simplest form and the optimal performance in a large antenna arrays. Therefore, this paper focuses on the design of power allocation with n¼üxed transmit beam former for minimizing the transmit power while meeting target signal-to-interference-and-noise-ratio(SINR) of each user and power constraints. We consider two scenarios according to the power constraints of cooperative BSs.One scenario is the sum power constraint on the cooperative base-stations. In this case, the cooperative BSs share the total available transmit power. However, each BS exists a maximum availabletransmit power in practical implementations. Thus, we consider amore realistic per BS power constraints. We proposed the solution strategies for both scenarios: For the sum power constraint case,a simple intuitive solution, where the power is allocated withoutregard to the power constraint until the SINR constraints issatisn¼üed, is presented. For the per BS power constraints case, weuse the properties of a large antenna arrays to n¼ünd the solution ofclosed form. We also demonstrate, via numerical simulation, the performance of proposed strategy is convergent to the optimal performance which is achieved by using the iterative algorithm.
Publish Year: 2013
Published in: CCNC - IEEE
Number of Pages: 5
موضوع: الکترونیک
ایران سای – مرجع مقالات علمی فنی مهندسی
حامی دانش بومی ایرانیان
