The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Relay node placement in wireless sensor networks for constrained environment is a critical task due to various unavoidable constraints. One of the most important constraints is unpredictable obstacles. Handling obstacles during relay node placement is complicated because of complexity involved to estimate the shape and size of obstacles. This paper presents an Obstacle-resistant relay node placement...
In a planar graph G, it is easy to find a tree that contains all the vertices and a few edges of G, such as this subgraph is called a spanning tree of G. We can also find two or three of these types of trees. The dificult question is how many spanning trees can contain this graph? In the literature, several researchers have found an answer to this question by proposing algebraic and combinatorial...
The complexity of the virus detection problem has received much attention from researchers over the past years. Using a grammar-based formalism for polymorphic viruses and based on the recognition problem for a fixed grammar we provide two examples of polymorphic engines, corresponding to bounded length viruses, whose reliable detection problem is NP-complete and PSPACE-complete. Thus, by giving an...
Massive MIMO is a promising technology for the 5G mobile communications system and contributes to the enhancement of multi-user MIMO transmission. However, the user scheduling of multi-user MIMO transmission requires a high computational complexity because the matrix operation is performed to estimate SINR, which is used as a user selection criterion. In this paper, we investigate low complexity multi-user...
Considering the growing demand for railway transportation, especially metros, and the changing social context, regular 24-hour operation is becoming a requirement. The railway is an inherently complicated and complex system and extending the service hours increases the level of difficulty in operating. In order to run all the services safely, punctually and reliably, we have to manage this complexity...
Host Based Intrusion Detection Systems (HIDS) are gaining traction in discovering malicious software inside a host operating system. In this paper, the authors have developed a new cognitive host based anomaly detection system based on supervised AdaBoost machine learning algorithm. Particularly, information fractal dimension based approach is incorporated in the original AdaBoost machine learning...
Achieving cloud security is not a trivial problem and developing and enforcing good cloud security controls is a fundamental requirement if this is to succeed. The very nature of cloud computing can add additional problem layers for cloud security to an already complex problem area. We discuss why this is such an issue, consider what desirable characteristics should be aimed for and propose a novel...
Classification systems based on Fuzzy Logic are of particular importance in the ambit of cognitive systems, due to their ability of managing uncertainty and presenting interpretable knowledge bases by emulating human cognition processes. However, the notion of interpretability is not yet exhaustively defined. In this work, the properties assessing the interpretability of a fuzzy classifier are discussed,...
This paper proposes a cyclic steganographic scheme based on cyclic codes for embedding secret message. This scheme is capable of achieving low complexity and fast embedding time. These are two attractive reasons for this method: first, embedding and secret message extraction can be implemented easily by employing shift registers with feedback connections, and second, because they are rich in coding...
The complexity of a system needs to be understood completely in order to build and run successful systems. Cybernetics Influence Diagram is a qualitative model which has been used in a large program for depiction of the system complexity [11][12][13]. The depiction is qualitative in nature. Generally the subject matter experts (SME) try to understand the complexity of a system by capturing the influences...
We investigate the second order asymptotics (source dispersion) of the successive refinement problem. Similar to the classical definition of a successively refinable source, we say that a source is strongly successively refinable if successive refinement coding can achieve the second order optimum rate (including the dispersion terms) at both decoders. We establish a sufficient condition for strong...
In ownership-based access control frameworks with the possibility of delegating permissions and administrative rights, chains of delegated accesses will form. There are different ways to treat these delegation chains when revoking rights, which give rise to different revocation schemes. One possibility studied in the literature is to revoke rights by issuing negative authorizations, meant to ensure...
Methods of algorithmic information theory can solve the inverse problem, which does not require a priori knowledge of the structure of the observed object and the measurement procedure. Thus not only the numerical parameters of the model, but the structure of model can be derived directly from the primary results of observations. The examples of application of this method in problems of georadar sounding...
This paper proposes a methodology based on system connections to calculate its complexity. There are proposed two study cases: the dining Chinese philosophers problem and the distribution center. Both studies are modeled using the theory of discrete event systems and simulated in different contexts in order to measure their complexities. The obtained results present i) the static complexity as a limiting...
Authorship-identification is an actual research area with different applications. Particularly it is a question if only highly specialised and well equipped entities could identify an author or it could be made by broader community via exploiting text. In order to shed light on this question a very simple and computationally not demanding method for author identification was proposed based on lossless...
As deep learning neural networks (DNNs) advance and increase in computational complexity, particularly in terms of memory cost, it becomes difficult to implement DNNs in fixed-point memory-sparse environments (e.g. integrated circuits in consumer electronics). Thus, the training of DNNs must be reformulated to balance the hardware costs needed to represent the often millions of parameter weights in...
The paper presents analysis and comparison of complexity of selected algorithms of motion estimation used in video compression. With the use of own, highly optimized software implementation the authors explored complexity of the methods applied in the framework of the new High Efficiency Video Compression (HEVC) technology. The influence of many different factors on motion estimation complexity has...
The term metrics is basically a quantitative measure of extent to which given attributes influenced by a system, component or a process. Metrics are required to measure software quality, improve software quality and to predict software quality. There are various approaches available to develop a software metrics like object oriented approach, component based approach, distributed approach. Component...
The development of computational thinking skills through computer programming is a major topic in education, as governments around the world are introducing these skills in the school curriculum. In consequence, educators and students are facing this discipline for the first time. Although there are many technologies that assist teachers and learners in the learning of this competence, there is a...
Planning Poker is a consensus-based technique mostly used for estimating effort or relative size of software development goals. This is applicable to estimate the size ofuser stories, developing releases and iteration plans. It is used generally with Scrum. Planning Poker has a lot of benefits, however, this method is not entirely efficient because the result is always based on the observation of...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.