Distributed Information Networks Research Articles

ПОБУДОВА СИСТЕМ ВИЯВЛЕННЯ ВТОРГНЕНЬ В ІНФОРМАЦІЙНО-ТЕЛЕКОМУНІКАЦІЙНУ МЕРЕЖУ НА ОСНОВІ МЕТОДІВ ІНТЕЛЕКТУАЛЬНОГО РОЗПОДІЛУ ДАНИХ

The article proposes a combinatorial construction of a network attack detection system based on selected methods of data mining and conducts experimental research that confirms the effectiveness of the created detection model to protect the distributed information network. Experiments with a software prototype showed the high quality of detection of network attacks and proved the correctness of the choice of methods of data mining and the applicability of the developed techniques. The state of security of information and telecommunication systems against cyberattacks is analyzed, which allowed to draw conclusions that to ensure the security of cyberspace it is necessary to implement a set of systems and protection mechanisms, namely systems: delimitation of user access; firewall; cryptographic protection of information; virtual private networks; anti-virus protection of ITS elements; detection and prevention of intrusions; authentication, authorization and audit; data loss prevention; security and event management; security management. An analysis of publications of domestic and foreign experts, which summarizes: experience in building attack detection systems, their disadvantages and advantages; of attack and intrusion detection systems based on the use of intelligent systems. Based on the results of the review, proposals were formed on: construction of network attack detection systems on the basis of selected methods of data mining and experimental research, which confirms the effectiveness of the created detection model for the protection of the distributed information network.

A Distributed Intrusion Detection System with Protection from an Internal Intruder

The protection of modern distributed information networks from external and internal intruders continues to be of great importance due to the development of data transmission and processing technology. The article describes a model of data processing in the distributed intrusion detection system (DIDS) and method of using of hidden agents to protect from an internal intruder. The distribution of the functions on data processing between the DIDS local agent and central data processing node is presented. We describe a method of hiding of presence of the agent from the system user while retaining control of it from the part of the operator.

Using Multiple Array Sensing and Non-Invasive Data Capture As a Model For Polypharmacy Error Detection

Developing standards and technology models that will facilitate e-prescribing is one of the key action items in the federal government's plan to build a nationwide electronic health information infrastructure in the United States. E-prescribing has the potential to drive change in the healthcare industry, but the unavailability of diagnostic testing and detection equipment outside of clinical settings makes expanded collection and use of information problematic. Most solutions are provider-based, and limited by organization-wide startup & maintenance costs, and risk-averse data distribution policies. Objective, consumer-provided standardized data can facilitate the use of distributed information networks in polypharmacy detection and avoidance. In this technology review we propose here one promising model for polypharmacy management and integrated diagnostics through the use of breath-based, multiple array sensing and data capture.

Proposed Model for ONCHIT Pre-Case Biosurveillance Using Multiple Array Sensing and Non-Invasive Data Capture

Recent initiatives by the US ONCHIT highlight the need for electronic population health data collection relating to aspects of Public Health Case (PH Case) reporting and Adverse Event (AE) reporting. Proposed solutions to date have been primarily provider-based, limited by organization-wide startup & maintenance costs, and hampered by risk-averse data distribution policies. Little attention has been given to consumer-focused, distributed data collection models, where objective, consumer-provided standardized data can be used prior to case identification to facilitate earlier use of extensible and distributed information networks in biosurveillance. We propose here one promising model for pre-case biosurveillance management, employing the use of breath-based, multiple array sensing and data capture. The conceptual applications employed in this technology set are provided by way of illustration, and may also serve as a transformative model for emerging EMR/EHR requirements.

ElNet: The Greek biodiversity transitional waters information system. An exemplar for the development of distributed information networks in Europe

1. Transitional waters are ecosystems of special importance for a number of reasons and require effective management. In Greece, biodiversity and environmental data that help to manage these ecosystems do exist, although they are scattered and not easily accessible. An overarching, publicly accessible system combining all kinds of information has not been available until now. 2. The ElNet system was developed to serve these requirements. The system is a functional application consisting of a comprehensive database and an online interface with an interactive map, and search capabilities for biological and environmental data on Greek transitional waters. Nine datasets have already been integrated and are available online. Data and their metadata are documented and checked for quality to allow comparisons and reduce bias in resulting analyses. 3. The data assembled cover a broad geographical and temporal range, allowing large-scale analyses of transitional waters. These in turn produce new scientific knowledge and provide a sound basis of information for scientists, environmental managers and policy-makers. 4. Examination of the data revealed an overall insufficient quality control practice during data acquisition and digitization. A good data management and archive system can significantly improve the quality of data. To encourage scientists to submit their data to a data management centre, a clear data policy document regulating rights and duties could form an incentive for data sharing. 5. Results from a case study carried out on the macrobenthic inventories of the lagoonal systems included in the system demonstrate the potential use of this simple type of information by environmental managers and scientists. 6. The system, still in its initial phase, will be improved by integrating new datasets and developing tools for data retrieval and analyses. The database will be linked to other biodiversity databases to participate in a distributed information network and disseminate the information through other global biodiversity portals.

Sensor fusion in a Six-legged Bio-mimicking Robot

This paper presents the construction of a six-legged bio-mimicking robot. The mechanical design includes the actuation design based on shape memory alloy (SMA) actuators and the locomotive mechanism. The motion control system implements various gaits for the robot to maneuver. The sensors used in the control system include the accelerometer, the compass sensor and the step sensors. We develop a sensor fusion formula to fuse the various sensor signals for enhanced position and velocity estimation. The measurement is useful for distributed information network for future robot team operation.

Multivariate analysis of a simulated prognostics and health management system for military aircraft maintenance

The Air Force logistics operations system is, in general, reactive in nature, with unscheduled aircraft maintenance beginning with a signal for out of tolerance conditions from the aircraft, subsequent fault isolation procedures performed by a maintenance team, and the steps taken to repair or replace the faulty item. The Joint Strike Fighter (JSF) programme has been pursuing an autonomic logistics system (ALS) concept that changes this reactive process into a proactive one, with the employment of technologies such as prognostics and a distributed information network. This paper briefly describes a simulation model of a prognostics and health management (PHM) system employed as part of an ALS for a JSF-type aircraft. The simulation produces a large number of commonly used flight line measures of performance for aircraft availability and mission effectiveness. Multivariate statistical analysis of these outputs provides a means to assess the impact of a PHM system on aircraft productivity.

A common multi-agent testbed for diverse seamless personal information networking applications

This article describes the design and implementation of a unique cooperative agents testbed aimed at addressing diverse applications for the difficult problem of seamless personal information networking (SPIN). The real-world SPIN testbed is aimed at two difficult applications. Namely seamless messaging and intelligent network management. Both applications are agent-driven and share agent behavior, and the messaging agents rely on the network management device diagnostic agents for input. The article introduces both problem areas in a common testbed. The first-generation seamless messaging application is described in detail. User-centric seamless messaging assumes heterogeneous communication environments intended to support today's nomadic users. The prototype is introduced for the management of messages across distributed information networks. Its aim is to intercept, filter, interpret, and deliver multimodal messages, be they voice, fax, video, and/or e-mail messages. A user's personal communication agent is charged with delivering messages to the recipient regardless of their target messaging device-a telephone, pager, desktop, wireless laptop, or wireless phone. Personal communication agents classify and act on incoming messages based on their content. A secretary agent routes and tailors urgent messages appropriately to the device manager agent, which delivers the message to a device on which the user may be roaming or active. What makes the seamless messaging application unique is its approach to treating a message in a universal manner, and its ability to mediate between different messaging environments and devices, and to try to track and find the user.

ISSUES AND EXTENSIONS FOR INFORMATION MATCHMAKING PROTOCOLS

As agents see more use in dynamic, distributed information networks, information sharing facilitators, such as the SHADE matchmaker, and underlying knowledge-based agent communication protocols, such as the Knowledge Query and Manipulation Language, will see increased use. We have created several communities of agents collaborating via KQML and matchmaking within the domains of collaborative engineering and satellite image retrieval. Based on these experiences, matchmaking has proven to be very beneficial for multi-agent systems, but we have also identified a number of issues and extensions that are not only vital to KQML-based matchmaking, but to inter-agent protocols in general. These include representational approaches to advertising complex databases, approaches to error recovery and response timing, maintaining consistency among information providers, scalability, security, persistent requests in information brokering, and the dilemma between explicit vs implicit brokering.

Information mediation in cyberspace: Scalable methods for declarative information networks

An end-to-end discussion, from logical architecture to implementation, of issues and design decisions in declarative information networks is presented. A declarative information network is defined to be a dynamic and decentralized structure where value-added services are declared and applied as mediators in a scalable and controlled manner. A primary result is the need to adopt dynamically linked ontologies as the semantic basis for knowledge sharing in scalable networks. It is shown that data mining techniques provide a promising basis upon which to explore and develop this result. Our prototype system, entitled Mystique, is described in terms of KQML, distributed object management, and distributed agent execution. An example shows how we map our architecture into the World Wide Web (WWW) and transform the appearance of the WWW into an intelligently integrated and multi-subject distributed information network.

Optimal file allocation and report assignment in distributed information networks

Distributed database systems is a current design practice in database architecture. These systems are used by corporations that are served by a network of computers. In this research, we model the problem of allocation of copies of files and the assignment of reports to sites in a distributed computer network. This is a 0-1 integer programming problem, and we present optimal and heuristic solution procedures in this article

Multiple copy file allocation and placement in a distributed information network

The problem of minimizing query, update and storage costs in a distributed information network in which one or more m sites may receive a copy of one or more of m different files is studied in this work. The problem is known to be NP complete. Cost efficiency considerations further dictate that for each query emanating site there be exactly one designated responder site. A model to solve the problem is formulated. Two heuristics based on the problem structure are proposed and their performance relative to each other and to an optimal procedure is reported for problems with up to four files and up to eight sites.

Design and administration of distributed and hierarchical information networks under partial orderings

In this paper, we extend previous results [1] in the protection and administration of information networks under partial orderings. We summarize previous results, and extend them to cover hierarchical networks. We consider distributed hierarchical administration, show a hierarchical network, and demonstrate a provably secure communications technique in which partial orderings are used to control flow, traffic analysis is minimized, local compromise does not cause global compromise, and distributed hierarchical administration works. We show means by which trusted and untrusted computing bases may be connected to form provably secure distributed information networks under partial orderings, and a risk analysis technique which takes advantage of the POset structure to reduce the complexity of analysis for these networks. We summarize results and propose further extensions of this work.

The role of automated subject switching in a distributed information network

This article discusses some of the forces at work within today's online database environment which could lead to the emergence of a distributed information network. Several important modules in such a network are identified, including an automated subject switching module. Switching options include: exact matching, equivalency matchings and word‐ and phrase‐stem matching. Research investigations, critical issues, and preliminary findings with regard to switching options and strategies are reported. It is anticipated that one of the primary benefits from automated subject switching will be much greater utlization of the online STI resource.

Optimal allocation of resources in distributed information networks

The problems of file allocation and capacity assignment in a fixed topology distributed computer network are examined. These two aspects of the design are tightly coupled by means of an average message delay constraint. The objective is to allocate copies of information files to network nodes and capacities to network links so that a minimum cost is achieved subject to network delay and file availability constraints. A model for solving the problem is formulated and the resulting optimization problem is shown to fall into a class of nonlinear integer programming problems. Deterministic techniques for solving this class of problems are computationally cumbersome, even for small size problems. A new heuristic algorithm is developed, which is based on a decomposition technique that greatly reduces the computational complexity of the problem. Numerical results for a variety of network configurations indicate that the heuristic algorithm, while not theoretically convergent, yields practicable low cost solutions with substantial savings in computer processing time and storage requirements. Moreover, it is shown that this algorithm is capable of solving realistic network problems whose solutions using deterministic techniques are computationally intractable.

Optimal allocation of resources in distributed information networks

The problems of file allocation and capacity assignment in a fixed topology distributed computer network are examined. These two aspects of the design are tightly coupled through an average message delay constraint. The objective is to allocate copies of information files to network nodes and capacities to network links so that a minimum cost is achieved subject to network delay and file availability constraints. A model for solving the problem is formulated and the resulting optimization problem is shown to fall into a class of non-linear integer programming problems. Deterministic techniques for solving this class of problems are computationally cumbersome even for small sized problems. A new heuristic algorithm is developed, based on a decomposition technique which greatly reduces the computational complexity of the problem. Numerical results for a variety of network configurations indicate that the heuristic algorithm, while not theoretically convergent, yields practicable low cost solutions with substantial savings in computer processing time and storage requirements. Moreover, it is shown that this algorithm is capable of solving realistic network problems whose solution using deterministic techniques is computationally intractable.