Automated Infrastructure Management (AIM) systems are enterprise systems that provision a large n... more Automated Infrastructure Management (AIM) systems are enterprise systems that provision a large number and variety of network infrastructure resources, including premises, organizational entities, and most importantly, all the telecommunication and connectivity assets. In 2016 the International Standards Organization released the ISO/IEC 18598 specifications that provide standardization and sensible guidelines for exposing data and features of AIM systems in order to facilitate integration with these systems. CommScope, the primary contributor in defining these standards, has implemented these specifications for their imVision system [1]. This paper elaborates primarily on the ISO-recommended infrastructure elements and how to design the resource models that represent them. It also discusses the layered architecture used to build CommScope's imVision AIM system, and briefly describes a possible integration scenario between two AIM systems. Additionally, this article intends to s...
As line-of-business software systems take shape and evolve over time within an organization, so d... more As line-of-business software systems take shape and evolve over time within an organization, so does the need for such systems to interact with each other and exchange data, making it imperative to design flexible, scalable integration architectures and frameworks to support a robust and well-performing enterprise system. System integration is a multi-faceted undertaking, ranging from low-level data sharing (Shared Repository or File Sharing), to point-to-point communications (Remote Procedure Invocation via Service Orientation), to decoupled data exchange architectures (Messaging). It is common to build entire integration subsystems responsible not only for exchanging information between systems (commands and notifications) but also for potentially more complex business logic orchestration across the entire enterprise (Message Broker). This paper is contemplating a practical data notification and synchronization integration solution that allows multiple enterprise domains to share ...
Proceedings. Twenty-Third Annual International Computer Software and Applications Conference (Cat. No.99CB37032)
This paper describes a graphical user interface propelled by a simulation engine for performance ... more This paper describes a graphical user interface propelled by a simulation engine for performance analysis of a channel assignment model for high-volume cellular networks. It also discusses some experimental results.
IJCNN'99. International Joint Conference on Neural Networks. Proceedings (Cat. No.99CH36339)
ABSTRACT The main weakness of fractal image compression is its long encoding time needed to searc... more ABSTRACT The main weakness of fractal image compression is its long encoding time needed to search the entire domain pool to find the best domain-range mapping. To solve the problem, some solutions were proposed but most of them do not employ neural networks (only the use of Kohonen SOM for clustering was reported). The paper proposes a new method based on Karhunen-Loeve transform (PCA networks), which attempts to use neural networks' well-known adaptability in order to find a good feature vector for a block. Performance regarding network generality, quantization of the transform coefficients, comparison with DCT and kd-tree search, was explored. Results prove that the proposed method slightly outperforms state-of-the-art methods
As larger and more complex line-of-business (LoB) software systems emerge and grow within an orga... more As larger and more complex line-of-business (LoB) software systems emerge and grow within an organization so does the need for such systems to interact with each other and exchange data, making it imperative to design flexible, scalable integration architectures and frameworks to support a robust and well-performing enterprise system. System integration is a multi-faceted undertaking, ranging from low-level data sharing (Shared Repository or File Sharing), to point-to-point communications (Remote Procedure Invocation via Service Orientation), to decoupled data exchange architectures (Messaging). It is not uncommon to build entire integration subsystems responsible not only for exchanging information between systems (commands and notifications) but also for potentially more complex business logic orchestration across the entire enterprise (Message Broker). Moreover, implementing large integration solutions carries a considerable amount of risk so it is imperative that such solutions ...
Abstract. We define a cellular assignment graph to model the channel assignment problem in a cell... more Abstract. We define a cellular assignment graph to model the channel assignment problem in a cellular network where overlapping cell segments are included in the model. Our main result is the Capacity-Demand Theorem which shows a channel assignment function is always possible unless there is a connected subregion of cells and overlap segments containing more channel requests then the total capacity of all transceivers within or on the boundary of the subregion and covering any part of the subregion with an overlapping segment. We further describe the simplicity and regularity of our proposed cellular assignment graphs and their accessibility for simulation and theoretical investigation without artifacts from the overall geographical region boundaries.
IJCNN'99. International Joint Conference on Neural Networks. Proceedings (Cat. No.99CH36339), 1999
Analyses and compares several improvements to the backpropagation method for weights adjustments ... more Analyses and compares several improvements to the backpropagation method for weights adjustments for a feedforward network. The networks' behavior is simulated on five specific applications. The paper also presents a method using a variable step and its superiority is proved by simulation
Analyses and compares several improvements to the backpropagation method for weights adjustments ... more Analyses and compares several improvements to the backpropagation method for weights adjustments for a feedforward network. The networks' behavior is simulated on five specific applications. The paper also presents a method using a variable step and its superiority is proved by simulation
We define a cellular assignment graph to model the channel assignment problem in a cellular netwo... more We define a cellular assignment graph to model the channel assignment problem in a cellular network where overlapping cell segments are included in the model. Our main result is the Capacity-Demand Theorem which shows a channel assignment function is always possible unless there is a connected subregion of cells and overlap segments containing more channel requests then the total capacity of all transceivers within or on the boundary of the subregion and covering any part of the subregion with an overlapping segment. We further describe the simplicity and regularity of our proposed cellular assignment graphs and their accessibility for simulation and theoretical investigation without artifacts from the overall geographical region boundaries.
We define a cellular assignment graph to model the channel assignment problem in a cellular netwo... more We define a cellular assignment graph to model the channel assignment problem in a cellular network where overlapping cell segments are included in the model. Our main result is the Capacity-Demand Theorem which shows a channel assignment function is always possible unless there is a connected subregion of cells and overlap segments containing more channel requests then the total capacity of all transceivers within or on the boundary of the subregion and covering any part of the subregion with an overlapping segment. We further describe the simplicity and regularity of our proposed cellular assignment graphs and their accessibility for simulation and theoretical investigation without artifacts from the overall geographical region boundaries.
Proceedings 7th International Conference on Computer Communications and Networks (Cat. No.98EX226), 1998
Infinite planar cellular networks are embedded on a torus to obtain a symmetric regular finite ne... more Infinite planar cellular networks are embedded on a torus to obtain a symmetric regular finite network sample region for performance analysis. We show that a “hexagonal wrap” toroidal embedding preserves translational and rotational symmetry on all three axes of a hexagonal lattice and is preferable to a “Cartesian wrap” embedding. Hexagonal tilings and embeddings are obtained for all rhombic tile sizes. Certain tilings are shown to provide modular based neighbor addressing schemes that simplify distributed channel assignment algorithms. Hierarchical “hexagons within a hexagon” tilings are illustrated with the large hexagon exhibiting the sample repeat and comprising a multiplicity of channel frequency repeat small hexagonal the clusters. The symmetric hexagonal sample region repeat embeddings are noted to be useful for probabilistic analysis of high utilization channel assignment performance both theoretically and by simulation
IJCNN'99. International Joint Conference on Neural Networks. Proceedings (Cat. No.99CH36339), 1999
The main aim of this short paper is to propose a new branch prediction approach called by us "neu... more The main aim of this short paper is to propose a new branch prediction approach called by us "neural branch prediction". We developed a first neural predictor model based on a simple neural learning algorithm, known as Learning Vector Quantization algorithm. Based on a trace driven simulation method we investigated the influences of the learning step and training processes. Also we compared the neural predictor with a powerful classical predictor and we establish that they result in close performances. Therefore, we conclude that in the nearest future it might be necessary to model and simulate other more powerful neural adaptive predictors, based on more complex neural networks architectures or even time series concepts, in order to obtain better prediction accuracies compared with the previous known schemes.
The main weakness of fractal image compression is its long encoding time needed to search the ent... more The main weakness of fractal image compression is its long encoding time needed to search the entire domain pool to find the best domain-range mapping. To solve the problem, some solutions were proposed but most of them do not employ neural networks (only the use of Kohonen SOM for clustering was reported). The paper proposes a new method based on Karhunen-Loeve transform (PCA networks), which attempts to use neural networks' well-known adaptability in order to find a good feature vector for a block. Performance regarding network generality, quantization of the transform coefficients, comparison with DCT and kd-tree search, was explored. Results prove that the proposed method slightly outperforms state-of-the-art methods
Journal of Graph Algorithms and Applications, 2002
... (1) Given these parameters, one can place origin repeat points on the infinite triangular lat... more ... (1) Given these parameters, one can place origin repeat points on the infinite triangular lattice, as shown in Figure 2, for i = 3 and j = 1. By connecting the repeat points as depicted in the figure, we obtain a rhombic tiling of the infinite triangular lattice. ...
Analyses and compares several improvements to the backpropagation method for weights adjustments ... more Analyses and compares several improvements to the backpropagation method for weights adjustments for a feedforward network. The networks' behavior is simulated on five specific applications. The paper also presents a method using a variable step and its superiority is proved by simulation
Automated Infrastructure Management (AIM) systems are enterprise systems that provision a large n... more Automated Infrastructure Management (AIM) systems are enterprise systems that provision a large number and variety of network infrastructure resources, including premises, organizational entities, and most importantly, all the telecommunication and connectivity assets. In 2016 the International Standards Organization released the ISO/IEC 18598 specifications that provide standardization and sensible guidelines for exposing data and features of AIM systems in order to facilitate integration with these systems. CommScope, the primary contributor in defining these standards, has implemented these specifications for their imVision system [1]. This paper elaborates primarily on the ISO-recommended infrastructure elements and how to design the resource models that represent them. It also discusses the layered architecture used to build CommScope's imVision AIM system, and briefly describes a possible integration scenario between two AIM systems. Additionally, this article intends to s...
As line-of-business software systems take shape and evolve over time within an organization, so d... more As line-of-business software systems take shape and evolve over time within an organization, so does the need for such systems to interact with each other and exchange data, making it imperative to design flexible, scalable integration architectures and frameworks to support a robust and well-performing enterprise system. System integration is a multi-faceted undertaking, ranging from low-level data sharing (Shared Repository or File Sharing), to point-to-point communications (Remote Procedure Invocation via Service Orientation), to decoupled data exchange architectures (Messaging). It is common to build entire integration subsystems responsible not only for exchanging information between systems (commands and notifications) but also for potentially more complex business logic orchestration across the entire enterprise (Message Broker). This paper is contemplating a practical data notification and synchronization integration solution that allows multiple enterprise domains to share ...
Proceedings. Twenty-Third Annual International Computer Software and Applications Conference (Cat. No.99CB37032)
This paper describes a graphical user interface propelled by a simulation engine for performance ... more This paper describes a graphical user interface propelled by a simulation engine for performance analysis of a channel assignment model for high-volume cellular networks. It also discusses some experimental results.
IJCNN'99. International Joint Conference on Neural Networks. Proceedings (Cat. No.99CH36339)
ABSTRACT The main weakness of fractal image compression is its long encoding time needed to searc... more ABSTRACT The main weakness of fractal image compression is its long encoding time needed to search the entire domain pool to find the best domain-range mapping. To solve the problem, some solutions were proposed but most of them do not employ neural networks (only the use of Kohonen SOM for clustering was reported). The paper proposes a new method based on Karhunen-Loeve transform (PCA networks), which attempts to use neural networks' well-known adaptability in order to find a good feature vector for a block. Performance regarding network generality, quantization of the transform coefficients, comparison with DCT and kd-tree search, was explored. Results prove that the proposed method slightly outperforms state-of-the-art methods
As larger and more complex line-of-business (LoB) software systems emerge and grow within an orga... more As larger and more complex line-of-business (LoB) software systems emerge and grow within an organization so does the need for such systems to interact with each other and exchange data, making it imperative to design flexible, scalable integration architectures and frameworks to support a robust and well-performing enterprise system. System integration is a multi-faceted undertaking, ranging from low-level data sharing (Shared Repository or File Sharing), to point-to-point communications (Remote Procedure Invocation via Service Orientation), to decoupled data exchange architectures (Messaging). It is not uncommon to build entire integration subsystems responsible not only for exchanging information between systems (commands and notifications) but also for potentially more complex business logic orchestration across the entire enterprise (Message Broker). Moreover, implementing large integration solutions carries a considerable amount of risk so it is imperative that such solutions ...
Abstract. We define a cellular assignment graph to model the channel assignment problem in a cell... more Abstract. We define a cellular assignment graph to model the channel assignment problem in a cellular network where overlapping cell segments are included in the model. Our main result is the Capacity-Demand Theorem which shows a channel assignment function is always possible unless there is a connected subregion of cells and overlap segments containing more channel requests then the total capacity of all transceivers within or on the boundary of the subregion and covering any part of the subregion with an overlapping segment. We further describe the simplicity and regularity of our proposed cellular assignment graphs and their accessibility for simulation and theoretical investigation without artifacts from the overall geographical region boundaries.
IJCNN'99. International Joint Conference on Neural Networks. Proceedings (Cat. No.99CH36339), 1999
Analyses and compares several improvements to the backpropagation method for weights adjustments ... more Analyses and compares several improvements to the backpropagation method for weights adjustments for a feedforward network. The networks' behavior is simulated on five specific applications. The paper also presents a method using a variable step and its superiority is proved by simulation
Analyses and compares several improvements to the backpropagation method for weights adjustments ... more Analyses and compares several improvements to the backpropagation method for weights adjustments for a feedforward network. The networks' behavior is simulated on five specific applications. The paper also presents a method using a variable step and its superiority is proved by simulation
We define a cellular assignment graph to model the channel assignment problem in a cellular netwo... more We define a cellular assignment graph to model the channel assignment problem in a cellular network where overlapping cell segments are included in the model. Our main result is the Capacity-Demand Theorem which shows a channel assignment function is always possible unless there is a connected subregion of cells and overlap segments containing more channel requests then the total capacity of all transceivers within or on the boundary of the subregion and covering any part of the subregion with an overlapping segment. We further describe the simplicity and regularity of our proposed cellular assignment graphs and their accessibility for simulation and theoretical investigation without artifacts from the overall geographical region boundaries.
We define a cellular assignment graph to model the channel assignment problem in a cellular netwo... more We define a cellular assignment graph to model the channel assignment problem in a cellular network where overlapping cell segments are included in the model. Our main result is the Capacity-Demand Theorem which shows a channel assignment function is always possible unless there is a connected subregion of cells and overlap segments containing more channel requests then the total capacity of all transceivers within or on the boundary of the subregion and covering any part of the subregion with an overlapping segment. We further describe the simplicity and regularity of our proposed cellular assignment graphs and their accessibility for simulation and theoretical investigation without artifacts from the overall geographical region boundaries.
Proceedings 7th International Conference on Computer Communications and Networks (Cat. No.98EX226), 1998
Infinite planar cellular networks are embedded on a torus to obtain a symmetric regular finite ne... more Infinite planar cellular networks are embedded on a torus to obtain a symmetric regular finite network sample region for performance analysis. We show that a “hexagonal wrap” toroidal embedding preserves translational and rotational symmetry on all three axes of a hexagonal lattice and is preferable to a “Cartesian wrap” embedding. Hexagonal tilings and embeddings are obtained for all rhombic tile sizes. Certain tilings are shown to provide modular based neighbor addressing schemes that simplify distributed channel assignment algorithms. Hierarchical “hexagons within a hexagon” tilings are illustrated with the large hexagon exhibiting the sample repeat and comprising a multiplicity of channel frequency repeat small hexagonal the clusters. The symmetric hexagonal sample region repeat embeddings are noted to be useful for probabilistic analysis of high utilization channel assignment performance both theoretically and by simulation
IJCNN'99. International Joint Conference on Neural Networks. Proceedings (Cat. No.99CH36339), 1999
The main aim of this short paper is to propose a new branch prediction approach called by us "neu... more The main aim of this short paper is to propose a new branch prediction approach called by us "neural branch prediction". We developed a first neural predictor model based on a simple neural learning algorithm, known as Learning Vector Quantization algorithm. Based on a trace driven simulation method we investigated the influences of the learning step and training processes. Also we compared the neural predictor with a powerful classical predictor and we establish that they result in close performances. Therefore, we conclude that in the nearest future it might be necessary to model and simulate other more powerful neural adaptive predictors, based on more complex neural networks architectures or even time series concepts, in order to obtain better prediction accuracies compared with the previous known schemes.
The main weakness of fractal image compression is its long encoding time needed to search the ent... more The main weakness of fractal image compression is its long encoding time needed to search the entire domain pool to find the best domain-range mapping. To solve the problem, some solutions were proposed but most of them do not employ neural networks (only the use of Kohonen SOM for clustering was reported). The paper proposes a new method based on Karhunen-Loeve transform (PCA networks), which attempts to use neural networks' well-known adaptability in order to find a good feature vector for a block. Performance regarding network generality, quantization of the transform coefficients, comparison with DCT and kd-tree search, was explored. Results prove that the proposed method slightly outperforms state-of-the-art methods
Journal of Graph Algorithms and Applications, 2002
... (1) Given these parameters, one can place origin repeat points on the infinite triangular lat... more ... (1) Given these parameters, one can place origin repeat points on the infinite triangular lattice, as shown in Figure 2, for i = 3 and j = 1. By connecting the repeat points as depicted in the figure, we obtain a rhombic tiling of the infinite triangular lattice. ...
Analyses and compares several improvements to the backpropagation method for weights adjustments ... more Analyses and compares several improvements to the backpropagation method for weights adjustments for a feedforward network. The networks' behavior is simulated on five specific applications. The paper also presents a method using a variable step and its superiority is proved by simulation
Uploads
Papers by Mihaela Iridon