Computational content generation increasingly shapes digital games, visual computing, and interactive environments by automating the production of characters, faces, and environments. Alongside these capabilities, such pipelines raise persistent challenges around fairness, social bias, and representational diversity. This article presents an AI-assisted, PRISMA-informed literature review of 37 recent studies that address these social dimensions across character creation, facial modeling, and procedural environment generation. We synthesize technical approaches – including deep learning, reinforcement learning, generative adversarial networks, and optimization – together with behavioral, participatory, and culturally grounded perspectives. To reduce terminological ambiguity, we provide a consolidated cross-domain conceptual framing of fairness , social bias , and diversity in the reviewed work and map recurring operational proxy families to content types. Our analysis highlights substantial variation in how these concepts are defined and evaluated: only a small subset of studies uses explicit parity- or subgroup-performance formulations, whereas many contributions rely on domain-specific gameplay proxies, distributional/perceptual generative proxies, or qualitative and behavioral evaluation, and are infrequently supported by scalable auditing or benchmarking tools. We further differentiate how fairness concerns manifest across game contexts (e.g., outcome parity in competitively oriented procedural scenarios versus representational inclusion in avatar and face pipelines). Finally, we operationalize these proxy families and recurring limitations in three applied use-cases, illustrating where auditing can attach within end-to-end workflows and where methodological gaps remain when integrating representational and outcome-focused perspectives.

Deep learning presents promising solutions for the restoration and preservation of visual arts, including old color photographs or paintings, which are prone to degradation over time, enabling the vibrant imagery to be effectively revived and maintained. In this paper, we propose a methodology for restoring visual arts based on deep learning techniques purely trained on synthetic data, thereby involving the generation of a dataset that incorporates respective defects, the training of a respective defect segmentation model, and the inpainting using predicted segmentation maps. Through qualitative and quantitative analysis, we demonstrate the potential of our approach in addressing the scarcity of ground truth data and effectively restoring old visual arts by synthetic training on specific defects observed in historical artworks.

Today's telecommunication systems are enhanced by a large and steadily growing number of supplementary services, each of which consists of a set of service features. A situation where a combination of these services behaves differently than expected from the single services' behaviors, is called service interaction. This interaction problem is considered as a major obstacle to the introduction of new services into telecommunications networks. We present a survey of the work carried out in this field during the last decade (1988-98). After a brief review of classification criteria that exist for feature interactions so far, we use a perspective called the emergence level view. This perspective pays respect to the fact that the sources for interactions can be of many different kinds, e.g., requirement conflicts or resource contentions. It is used to rationalize the impossibility of coping with the problem with one single approach. We also present a framework of four different criteria in order to classify the approaches dealing with the problem. The general kind of approach taken, a refinement of the well known detection, resolution, and prevention categories, serves as the main classification criterion. It is complemented by the method used, the stage during the feature lifecycle where an approach applies, and the system (network) context. The major results of the different approaches are then presented briefly using this classification framework. We finally draw some conclusions on the applicability of this framework and on possible directions of further research in this field.

The load of common channel signaling networks is being increased through the introduction of new services such as supplementary services or mobile communication services. This may lead to a performance degradation of the signaling network, which affects both the quality of the new services and of the services already offered by the network. In the paper, a generic modeling methodology for the signaling load and the signaling network performance as a result of the various communication services is extended in order to include certain implementation-dependent particularities. The models are obtained by considering the protocol functions of Signaling System No. 7 as specified by the CCITT, as well as the information flows through these functions. With this approach, virtual processor models are derived which can be mapped onto particular implementations. This allows the analysis of signaling networks in a multivendor environment. Using these principles, a signaling network planning tool concept has been developed which provides the distinct loading of hardware and software signaling network resources, and on which hierarchical performance analysis and planning procedures are based. This allows to support the planning of signaling networks according to given service, load, and grade-of-service figures. A simple case study outlines the application of the tool concept to a network supporting Freephone, Credit Card, and ISDN voice services.>

An introductory article covers SS7 protocol, services, reliability, performance, and congestion control. Following the introductory article, the papers are arranged in three sections. The largest section is on performance analysis and congestion control. The papers in the second section address several issues relevant to the network level, including the impact of new services. The last section of this issue contains papers that highlight technical issues for future studies. This section carries a dual purpose: to introduce the preliminary results achieved by the authors and to suggest directions for additional work in this area.>

The authors wish to provide a unification of this issue's papers by providing a clear context for them. Common channel signaling can be defined as the system that enables stored program control exchanges, network databases, and other nodes of a network to exchange messages related to call setup, supervision, and take down (call and connection control information); information needed for distributed application processing (interprocess query and response or user-to-user data); and network management information.>

A very general approach for an approximate analysis of end-to-end delay jitter in asynchronous transfer mode (ATM) networks for bursty input traffic is presented. Since the cell loss requirements within ATM networks are very restrictive, interest is in the tail of the complementary probability distribution function of the end-to-end delay to estimate the cell loss probability at the reassembly buffer. An analytical approach for an isolated network node as well as for a whole reference connection is presented. The approximation results are in good agreement with simulation results and indicate that the end-to-end delay jitter is in the range of the maximum transfer delay of one queuing node, if the bursty input traffic is controlled by adequate traffic control mechanisms.>

This paper reports on the implementation of a local area network (LAN) operating under a new CSMA-CD protocol with dynamic priorities (CSMA-CD-DP). User terminals, host computers, and other servers are connected to a common broad-band channel through N network access stations in a clustered manner. This concept reduces the number of network access stations and enhances the utilization of hardware and software resources greatly. A new protocol has been developed which organizes the decentralized operation of the distributed network access stations and which allows for a number of specific features. In the idle state the channel is operated in the contention mode. After the beginning of a transmission, the channel is operated in a reservation mode. Channel arbitration after a completed transmission is resolved by staggered delays; at any time, each station owns a distinct transmission delay which is changed after every successful transmission by broadcasted acknowledgments. This protocol strictly limits the possibility of collisions and approaches the effectiveness of token and polling protocols with increasing load. Through specific allocations of transmission delays, static priorities or dynamic overload control can be realized easily. The performance of the CSMA-CD-DP protocol has been modeled and analyzed analytically as well as by simulation. Results for normal load and overload reveal high throughput and low transfer times which are basic for a wide range of applications in LAN's.

The prime objective of the present paper is to analyze the throughput characteristics of a multi-processor configuration for packet switching-suggested in the context of an integrated network for circuit and packet switching-and to identify the major parameters on which it depends. The results provide a fundamental insight into how the most relevant system and traffic parameters determine throughput as a function of the number of packet-handling modules. In particular, it is shown that the proposed partitioning of the packet-handling function does indeed permit high throughput before saturation is encountered.

In this paper an approximate method for the analysis of general queuing networks is proposed. The queuing network is of the open network type, havingNsingle server queuing stations with arbitrary interconnections. Customers may enter the network at any queuing station. The interarrival times of the exogenous arrival processes and the service times at the queuing stations are generally distributed. The analysis is based on the method of decomposition where the total network is broken up into subsystems; e.g., queuing stations of the typeGI/G/1or subnets. The subsystems are analyzed individually by assuming renewal arrival and departure processes. All related processes are considered with respect to their first two moments only. An analysis procedure is reported which reduces the total problem to a number of elementary operations which can be performed efficiently with the aid of a computer. Numerical results are reported together with simulation results to demonstrate the accuracy of the new method. The paper concludes with a short discussion of possible extensions of the method.