In recent years, providing the required criteria put forward for the full membership by the union is one of the prior targets of Turkey in the European Union full membership process. The objective of this study is to ...
详细信息
In recent years, providing the required criteria put forward for the full membership by the union is one of the prior targets of Turkey in the European Union full membership process. The objective of this study is to be able to evaluate situations of the membership process among European countries, candidate countries and Turkey. In the data set used in the period of 2005-2010, it is seen that the global economic crisis becoming efficient towards the end of 2007 has affected both EU countries and candidate countries economically. This period which included the effect of global crisis was taken as a data set to the study in order to add the effect of global crisis into the evaluation. The study was tried to be analyzed by using artificial neural networks and decision trees algorithms by means of a variety of economic signs. For that purpose, the data between years of 2005-2010 were used in this study. Primarily, the relative importance of independent variables was found by means of multilayered artificial neural networks and then dimension reduction operation was done. The criteria thought as affecting the membership was tried to be found out by using the decision trees method.
In recent years, there has been a fierce competition in the telecommunication sector. Technologic competition has made the competition in the sector a kind of strategic war. The sector of which role increased in terms...
详细信息
In recent years, there has been a fierce competition in the telecommunication sector. Technologic competition has made the competition in the sector a kind of strategic war. The sector of which role increased in terms of economic developments has entered a reconstruction process at an equal rate in all countries. In fact, countries which apprehend the future of the sector will also determine the future of economy. In this respect the aim of this study is to make performance benchmarking by using Data Envelopment Analysis and Malmquist Total Factor Productivity Index on telecommunication sector which is thought as one of the most important signs of national economies in the global economic crisis environment. This benchmarking, which includes the period of global crisis between the years of 2007-2010, targets to measure to what extent countries have been affected from the global crisis environment by means of performance evaluation among the strongest telecom managements of countries such as Turkey and Group of Eight (G8) countries? In the study, annual activity reports of the managements and a variety of input and output variables acquired from various research institutions were used as a data set.
The complexity of pairwise RNA structure alignment depends on the structural restrictions assumed for both the input structures and the computed consensus structure. For arbitrarily crossing input and consensus struct...
详细信息
In general, web search engines respond to queries by returning a list of links to web pages that are considered relevant. However, these queries are often ambiguous or too general and the users end up browsing through...
详细信息
In general, web search engines respond to queries by returning a list of links to web pages that are considered relevant. However, these queries are often ambiguous or too general and the users end up browsing through a long list of items in order to find what they are actually looking for. And hence the idea to cluster web search results so that the output would be a list of labelled clusters. An algorithm based on the ASM (Ants Sleeping Model) is proposed. In the ASM model each data is represented by an agent, its environment being a two dimensional grid. The agents will group themselves into clusters by making simple moves according to some local environment information. At any step an agent can pro-actively decide to directly communicate with one of its fellows and choose to move accordingly, the moves being expressed by fuzzy IF-THEN rules. Thus the chance of getting trapped in a local optimum is minimized and hybridization with a classical clustering algorithm becomes needless.
Access control is a vital security mechanism in today's operating systems, and the security policies dictating the security relevant behaviors is lengthy and complex, for example in Security-Enhanced Linux (SELinu...
详细信息
Access control is a vital security mechanism in today's operating systems, and the security policies dictating the security relevant behaviors is lengthy and complex, for example in Security-Enhanced Linux (SELinux). It is extremely difficult to verify the consistency between the security policies and the security goals desired by applications. In this paper, we present how to predict whether the information flow security goal is violated or not during runtime, how to generate the corresponding control actions on-line when divergence is detected and how to apply these actions in time based on software active monitoring technique. The symbolic security information flow model of SElinux is generated from a formalization of the access control mechanism which can be used to generate the N-step ahead projection of the future behavior. Information flow security goals are expressed in linear temporal logic (LTL) which provides clear description of the objectives desired by applications. Anticipatory monitor is generated from LTL formula automatically. We consider an on-line scheme where after the occurrence of an event, the next control action is determined on the basis of the N-step ahead projection of the future behavior. This procedure is repeated after the occurrence of next security relevant event. Thus, a closed-loop system is generated that all behavior sequences will satisfy the security goals.
In an interval graph G = (V,E) the distance between two vertices u, v is de£ned as the smallest number of edges in a path joining u and v. The eccentricity of a vertex v is the maximum among distances from all ot...
详细信息
In an interval graph G = (V,E) the distance between two vertices u, v is de£ned as the smallest number of edges in a path joining u and v. The eccentricity of a vertex v is the maximum among distances from all other vertices of V. The diameter (δ) and radius (ρ) of the graph G is respectively the maximum and minimum among all the eccentricities of G. The center of the graph G is the set C(G) of vertices with eccentricity ρ. In this context our aim is to establish the relation ρ = ⌈δ/2⌉ for an interval graph and to determine the center of it.
Data flow processing is a common task of embedded systems which is usually modeled as a pipeline. Errors in a block of this pipeline can be propagated through it thus leading to unexpected and erroneous behaviors. For...
详细信息
Data flow processing is a common task of embedded systems which is usually modeled as a pipeline. Errors in a block of this pipeline can be propagated through it thus leading to unexpected and erroneous behaviors. For safety related applications, this pipeline has to be able to identify and react to failures. The DMOSES model-driven development method uses deterministic UML activities to describe and implement data flow processing. This method ensures deterministic behavior of concurrent processing. Design by Contract defines formal, precise and verifiable interfaces for software components. We propose a development method for safe data flow processing based on the integration of this concept in deterministic UML activities. This integration allows the identification of errors by detection of contracts violation. This paper presents an extension of the DMOSES tool for contracts verification at the model level and their monitoring at runtime.
In an interval graph G = (V,E) the distance between two vertices u, v is defined as the smallest number of edges in a path joining u and v. The eccentricity of a vertex v is the maximum among distances from all other ...
详细信息
In an interval graph G = (V,E) the distance between two vertices u, v is defined as the smallest number of edges in a path joining u and v. The eccentricity of a vertex v is the maximum among distances from all other vertices of V. The diameter (δ) and radius (ρ) of the graph G is respectively the maximum and minimum among all the eccentricities of G. The center of the graph G is the set C(G) of vertices with eccentricity ρ. In this context our aim is to establish the relation ρ = [δ/2] for an interval graph and to determine the center of it.
This paper presents the communication related design considerations of Wireless Sensor Network (WSN) aided Multi-Robot Simultaneous Localization and Mapping (SLAM). In this approach, multiple robots perform WSN-aided ...
详细信息
This paper presents the communication related design considerations of Wireless Sensor Network (WSN) aided Multi-Robot Simultaneous Localization and Mapping (SLAM). In this approach, multiple robots perform WSN-aided cooperative SLAM using only range values to landmarks in the environment by measuring the Received Signal Strength Indicator (RSSI) of the received radio messages, and odometry information. The SLAM algorithm proposed in this study uses the Rao-Blackwellized Particle Filters. In addition, the inherent communication problems in WSNs, and their effects on cooperative SLAM are explained in detail and shown with the results of The Network Simulator (ns-2) simulations.
The functional programs are the recursive functions. Therefore, the paper primarily discuss all the forms having the recursive function. For the data structures, such as the lists, the following forms are available: t...
详细信息
暂无评论