Search

Multi-Agent Systems (MAS) have been seen as an attractive area of research for civil engineering professionals to subdivide complex issues. Based on the assignment's history, nearby agents, and objective, the agent intended to take the appropriate action to complete the task. MAS models complex systems, smart grids, and computer networks. MAS has problems with agent coordination, security, and work distribution despite its use. This paper reviews MAS definitions, attributes, applications, issues, and communications. For this reason, MASs have drawn interest from computer science and civil engineering experts to solve complex difficulties by subdividing them into smaller assignments. Agents have individual responsibilities. Each agent selects the best action based on its activity history, interactions with neighbors, and purpose. MAS uses the modeling of complex systems, smart grids, and computer networks. Despite their extensive use, MAS still confronts agent coordination, security, and work distribution challenges. This study examines MAS's definitions, characteristics, applications, issues, communications, and evaluation, as well as the classification of MAS applications and difficulties, plus research references. This paper should be a helpful resource for MAS researchers and practitioners. MAS in controlling smart grids, including energy management, energy marketing, pricing, energy scheduling, reliability, network security, fault handling capability, agent-to-agent communication, SG-electrical cars, SG-building energy systems, and soft grids, have been examined. More than 100 MAS-based smart grid control publications have been reviewed, categorized, and compiled. [ABSTRACT FROM AUTHOR]

Our research objective is to improve the Huffman coding efficiency by adjusting the data using a Poisson distribution, which avoids the undefined entropies too. The scientific value added by our paper consists in the fact of minimizing the average length of the code words, which is greater in the absence of applying the Poisson distribution. Huffman Coding is an error-free compression method, designed to remove the coding redundancy, by yielding the smallest number of code symbols per source symbol, which in practice can be represented by the intensity of an image or the output of a mapping operation. We shall use the images from the PASCAL Visual Object Classes (VOC) to evaluate our methods. In our work we use 10,102 randomly chosen images, such that half of them are for training, while the other half is for testing. The VOC data sets display significant variability regarding object size, orientation, pose, illumination, position and occlusion. The data sets are composed by 20 object classes, respectively: aeroplane, bicycle, bird, boat, bottle, bus, car, motorbike, train, sofa, table, chair, tv/monitor, potted plant, person, cat, cow, dog, horse and sheep. The descriptors of different objects can be compared to give a measurement of their similarity. Image similarity is an important concept in many applications. This paper is focused on the measure of similarity in the computer science domain, more specifically information retrieval and data mining. Our approach uses 64 descriptors for each image belonging to the training and test set, therefore the number of symbols is 64. The data of our information source are different from a finite memory source (Markov), where its output depends on a finite number of previous outputs. When dealing with large volumes of data, an effective approach to increase the Information Retrieval speed is based on using Neural Networks as an artificial intelligent technique. [ABSTRACT FROM AUTHOR]

Statistical information theory is a method for quantifying the amount of stochastic uncertainty in a system. This theory originated in communication theory. The application of information theoretic approaches has been extended to different fields. This paper aims to perform a bibliometric analysis of information theoretic publications listed on the Scopus database. The data of 3701 documents were extracted from the Scopus database. The software used for analysis includes Harzing's Publish or Perish and VOSviewer. Results including publication growth, subject areas, geographical contributions, country co-authorship, most cited publications, keyword co-occurrence analysis, and citation metrics are presented in this paper. Publication growth has been steady since 2003. The United States has the highest number of publications and received more than half of the total citations from all 3701 publications. Most of the publications are in computer science, engineering, and mathematics. The United States, the United Kingdom, and China have the highest collaboration across countries. The focus on information theoretic is slowly shifting from mathematical models to technology-driven applications such as machine learning and robotics. This study highlights the trends and developments of information theoretic publications, which helps researchers to understand the state of the art of information theoretic approaches for future contributions in this research domain. [ABSTRACT FROM AUTHOR]

Presents the special issue in the journal "Parallel Processing Letters," which contains the best papers from the Centre Interantional de Rencontres Mathématiques workshopin October 2001. "Scheduling Issues in Survivality Applications Using Hybrid Fault Models," by A. W. Krings, W. S. Harrison, A. Azadmanesh and M. McQueen"; "Parallel Tabu Search Approaches for Two-Dimensional Cutting," by J. Blazewicz, A. Moret-Salvador and R. Walkowiak"; "Strategies for Workload Balancing in Cluster-Based Image Databases," by F. Drews, K. Ecker, O. Kao and S. Schomann.

The evolution of smart contracts in recent years inspired a crucial question: do smart contract evaluation protocols provide the required level of privacy when executing contracts on the blockchain? The Hawk (IEEE S&P '16) paper introduces a way to solve the problem of privacy in smart contracts by evaluating the contracts off-chain, albeit with the trust assumption of a manager. To avoid the partially trusted manager altogether, a novel approach named zkHawk (IEEE BRAINS '21) explains how we can evaluate the contracts privately off-chain using a multi-party computation (MPC) protocol instead of trusting said manager. This paper dives deeper into the detailed construction of a variant of the zkHawk protocol titled V-zkHawk using formal proofs to construct the said protocol and model its security in the universal composability (UC) framework (FOCS '01). The V-zkHawk protocol discussed here does not support immediate closure, i.e., all the parties (n) have to send a message to inform the blockchain that the contract has been executed with corruption allowed for up to t parties, where t < n . In the most quintessential sense, the V-zkHawk is a variant because the outcome of the protocol is similar (i.e., execution of smart contract via an MPC function evaluation) to zkHawk, but we modify key aspects of the protocol, essentially creating a small trade-off (removing immediate closure) to provide UC (stronger) security. The V-zkHawk protocol leverages joint Schnorr signature schemes, encryption schemes, Non-Interactive Zero-Knowledge Proofs (NIZKs), and commitment schemes with Common Reference String (CRS) assumptions, MPC function evaluations, and assumes the existence of asynchronous, authenticated broadcast channels. We achieve malicious security in a dishonest majority setting in the UC framework. [ABSTRACT FROM AUTHOR]

The launch of a Computer Science curriculum specification in upper secondary schools in Ireland in 2018 was a landmark and a historic development in Irish education. Addressing the historical policy decisions adopted towards establishing the specification, this paper presents an analysis of developments from the 1970s as revealed in key policies and other documents. Positioning the policy change within the context of influences, context of policy text production and within the context of practices, the paper presents an overview of the Irish Computer Science specification. Alongside the background to the evolution in computer science education over the period, the article takes into account the national and cultural contexts and narrates the journey travelled to arrive at this pivotal position. Developments in a global context are presented in comparison with curricula in other countries and some similarities and differences identified. The article uncovers consequences of the specification for the national curriculum, key skills integration and computer science teacher preparation. The article provides an important analysis of the policy trajectory of computer science in Ireland based on a visibly relevant corpus of documents tracing the different stages of this policy and comparing it to similar experiences implemented in other European countries. [ABSTRACT FROM AUTHOR]

This paper considers relatively long‐term possibilities for the future relationship between humans and superintelligent robots (SRs). The great technological developments in fields such as artificial intelligence (AI), robotics and computer science have made it quite likely that we will see the advent of SRs towards the end of this century (or somewhat later). If SRs have a higher moral and legal status than typical adult human beings based on their greater psychological capacities, then they should also be entitled to human rights. However, even though SRs might be entitled to stronger moral and legal rights for this reason, it might nonetheless be necessary to limit their (otherwise justified) claims to avoid causing human beings to become extinct or endangered. The paper provides an argument in support of SRs' claims to human rights but also warns about the socio‐political, moral and legal implications of taking such a step. [ABSTRACT FROM AUTHOR]

Many network/graph structures are continuously monitored by various sensors that are placed at a subset of nodes and edges. The multidimensional data collected from these sensors over time create large-scale graph data in which the data points are highly dependent. Monitoring large-scale attributed networks with thousands of nodes and heterogeneous sensor data to detect anomalies and unusual events is a complex and computationally expensive process. This paper introduces a new generic approach inspired by state-space models for network anomaly detection that can utilize the information from the network topology, the node attributes (sensor data), and the anomaly propagation sets in an integrated manner to analyze the entire network all at once. This article presents how heterogeneous network sensor data can be analyzed to locate the sources of anomalies as well as the anomalous regions in a network, which can be impacted by one or multiple anomalies at any time instance. Experimental results demonstrate the superior performance of our proposed framework in detecting anomalies in attributed graphs. Summary of Contribution: With the increasing availability of large-scale network sensors and rapid advances in artificial intelligence methods, fundamentally new analytical tools are needed that can integrate data collected from sensors across the networks for decision making while taking into account the stochastic and topological dependencies between nodes, sensors, and anomalies. This paper develops a framework to intelligently and efficiently analyze complex and highly dependent data collected from disparate sensors across large-scale network/graph structures to detect anomalies and abnormal behavior in real time. Unlike general purpose (often black-box) machine learning models, this paper proposes a unique framework for network/graph structures that incorporates the complexities of networks and interdependencies between network entities and sensors. Because of the multidisciplinary nature of the paper that involves optimization, machine learning, and system monitoring and control, it can help researchers in both operations research and computer science domains to develop new network-specific computing tools and machine learning frameworks to efficiently manage large-scale network data. [ABSTRACT FROM AUTHOR]

In 1991, Wei proved a duality theorem that established an interesting connection between the generalized Hamming weights of a linear code and those of its dual code. Wei’s duality theorem has since been extensively studied from different perspectives and extended to other settings. In this paper, we re-examine Wei’s duality theorem and its various extensions, henceforth referred to as Wei-type duality theorems, from a new Galois connection perspective. Our approach is based on the observation that the generalized Hamming weights and the dimension/length profiles of a linear code form a Galois connection. The central result of this paper is a general Wei-type duality theorem for two Galois connections between finite subsets of $\mathbb {Z}$ , from which all the known Wei-type duality theorems can be recovered. As corollaries of our central result, we prove new Wei-type duality theorems for $w$ -demi-matroids defined over finite sets and $w$ -demi-polymatroids defined over modules with a composition series, which further allows us to unify and generalize all the known Wei-type duality theorems established for codes endowed with various metrics. [ABSTRACT FROM AUTHOR]

For fixed integers $n$ and $b\geq k$ , let $A(b,k,n)$ the largest size of a subset of $\{1,2,\ldots,b\}^{n}$ such that, for any $k$ distinct elements in the set, there is a coordinate where they all differ. Bounding $A(b,k,n)$ is a problem of relevant interest in information theory and computer science, relating to the zero-error capacity with list decoding and to the study of $(b, k)$ -hash families of functions. It is known that, for fixed $b$ and $k$ , $A(b,k,n)$ grows exponentially in $n$. In this paper, we determine new exponential upper bounds for different values of $b$ and $k$. A first bound on $A(b,k,n)$ for general $b$ and $k$ was derived by Fredman and Komlós in the ’80s and improved for certain $b\neq k$ by Körner and Marton and by Arikan. Only very recently better bounds were derived for general $b$ and $k$ by Guruswami and Riazanov, while stronger results for small values of $b=k$ were obtained by Arikan, by Dalai, Guruswami and Radhakrishnan, and by Costa and Dalai. In this paper, we strengthen the bounds for some specific values of $b$ and $k$. Our contribution is a new computational method for obtaining upper bounds on the values of a quadratic form defined over discrete probability distributions in arbitrary dimensions, which emerged as a central ingredient in recent works. The proposed method reduces an infinite-dimensional problem to a finite one, which we manage to further simplify by means of a series of optimality conditions. [ABSTRACT FROM AUTHOR]

The challenges of Reproducibility and Replicability (R & R) in computer science experiments have become a focus of attention in the last decade, as efforts to adhere to good research practices have increased. However, experiments using Deep Learning (DL) remain difficult to reproduce due to the complexity of the techniques used. Challenges such as estimating poverty indicators (e.g., wealth index levels) from remote sensing imagery, requiring the use of huge volumes of data across different geographic locations, would be impossible without the use of DL technology. To test the reproducibility of DL experiments, we report a review of the reproducibility of three DL experiments which analyze visual indicators from satellite and street imagery. For each experiment, we identify the challenges found in the data sets, methods and workflows used. As a result of this assessment we propose a checklist incorporating relevant FAIR principles to screen an experiment for its reproducibility. Based on the lessons learned from this study, we recommend a set of actions aimed to improve the reproducibility of such experiments and reduce the likelihood of wasted effort. We believe that the target audience is broad, from researchers seeking to reproduce an experiment, authors reporting an experiment, or reviewers seeking to assess the work of others. Plain Language Summary: This paper aims to help researchers understand the challenges of reproducing Deep Learning (DL) publications, mitigate reproducibility gaps, and make their own work more reproducible. We build on the work of others and add recommendations organized by (a) the quality of the data set (and associated metadata), (b) the DL methodology, (c) the implementation methodology, and the infrastructure used. To our knowledge, this is the first initiative of its kind to address the problem of reproducibility in remote sensing imagery and DL problems for real‐world tasks. We hope this paper lowers the barrier to entry for the DL community to improve research. Following the lifecycle mantra: reproduce!, then replicate! With the goal of improving reproducibility! Key Points: We discuss the reproducibility challenges faced in research by Deep Learning approaches using Big DataWe provide advice for pre‐screening papers (before experiments) to avoid poorly invested effortWe present a recipe with a set of mitigation strategies to address common errors users (researchers, authors, reviewers) may encounter [ABSTRACT FROM AUTHOR]

Contributions: The underrepresentation of women in computer science (CS) majors has long been a focus of attention in many academic documents, the majority of them from the United States and Europe. There is, however, a lack of information about educational interventions (EIs) for women in computing in Latin America. The contribution of this article is to cover this gap and describe what researchers in Latin American countries have been publishing about the recruitment and retention of women in the CS field. Background: Many EIs targeting female students at different educational levels—K-12, undergraduate, and graduate—have been undertaken to increase the participation of women in computing in Latin America. However, descriptions of these activities rarely are included in international academic databases. Research Questions: This literature mapping addresses two main research questions (RQ) about the topic of women in computing in academic publications in Latin American countries: RQ1) what are the characteristics of the publications about women in computing in Latin America? and RQ2) what are the published interventions to recruit and retain women in computing in Latin America? To answer RQ1, six subquestions were created covering year, language, country of origin, document type, and professional track. Furthermore, for RQ2, two subquestions were created involving educational level and the use of software development with a female theme. Methodology: This investigation used the systematic literature mapping process. To achieve a broad coverage of papers, the following sources were included: Scopus, Web of Science, Google Scholar, EBSCO, the proceedings of the Latin American Women in Computing Conference (LAWCC), and those of the Women in Technology (WIT) workshop colocated with the annual conference of the Brazilian Computer Society (SBC). The included papers were published in the last decade (2010–2020) and written in English, Portuguese, or Spanish. Findings: The literature mapping encompasses 197 academic documents, 48.2% of which were written in Portuguese, 28.7% in English, and 23.1% in Spanish. The papers originated from 15 of the 20 Latin American countries. Brazil and Costa Rica have the highest number of publications overall. The documents describe initiatives to increase the participation of women in computing majors that cover the entire educational spectrum, from K-12 to graduate programs, but papers targeting populations in higher education have started to appear recently. [ABSTRACT FROM AUTHOR]

In computer science, and especially in computer vision, the contour of an object is used to describe its features; thus, the shape descriptor plays an indispensable role in target detection and recognition. Further, Fourier is an important mathematical description method, and the Fourier transform of a shape contour has symmetry. This paper will demonstrate the symmetry of shape contour in the frequency domain. In recent years, increasing numbers of shape descriptors have come to the fore, but many descriptors ignore the details of shape. It is found that the most fundamental reason affecting the performance of shape descriptors is structural restraints, especially feature structure restraint. Therefore, in this paper, the restraint of feature structure that intrinsically deteriorates recognition performance is shown, and a fast shape recognition method via the Bone Point Segment (BPS) restraint reduction is proposed. An approach using the inner distance to find bone shapes and segment the shape contour by these bones is proposed. Then, Fourier transform is performed on each segment to form the shape feature. Finally, the restraints of the shape feature are reduced in order to build a more effective shape feature. What is commendable is that its discriminability and robustness is strong, the process is simple, and matching speed is fast. More importantly, the experiment results show that the shape descriptor has higher recognition accuracy and the matching speed runs up to more than 1000 times faster than the existing description methods like CBW and TCD. More importantly, it is worth noting that the recognition accuracy approaches 100% in the self-build dataset. [ABSTRACT FROM AUTHOR]

Stochastic processes (SPs) appear in a wide field, such as ecology, biology, chemistry, and computer science. In transport dynamics, deviations from Brownian motion leading to anomalous diffusion (AnDi) are found, including transport mechanisms, cellular organization, signaling, and more. For various reasons, identifying AnDi is still challenging; for example, (i) a system can have different physical processes running simultaneously, (ii) the analysis of the mean-squared displacements (MSDs) of the diffusing particles is used to distinguish between normal diffusion and AnDi. However, MSD calculations are not very informative because different models can yield curves with the same scaling exponent. Recently, proposals have suggested several new approaches. The majority of these are based on the machine learning (ML) revolution. This paper is based on ML algorithms known as the convolutional neural network to classify SPs. To do this, we generated the dataset from published paper codes for 12 SPs. We use a pre-trained model, the ResNet-50, to automatically classify the dataset. Accuracy of 99% has been achieved by running the ResNet-50 model on the dataset. We also show the comparison of the Resnet18 and GoogleNet models with the ResNet-50 model. The ResNet-50 model outperforms these models in terms of classification accuracy. [ABSTRACT FROM AUTHOR]

Name disambiguation is a key and also a very tough problem in many online systems such as social search and academic search. Despite considerable research, a critical issue that has not been systematically studied is disambiguation on the fly — to complete the disambiguation in the real-time. This is very challenging, as the disambiguation algorithm must be accurate, efficient, and error tolerance. In this paper, we propose a novel framework — CONNA — to train a matching component and a decision component jointly via reinforcement learning. The matching component is responsible for finding the top matched candidate for the given paper, and the decision component is responsible for deciding on assigning the top matched person or creating a new person. The two components are intertwined and can be bootstrapped via jointly training. Empirically, we evaluate CONNA on two name disambiguation datasets. Experimental results show that the proposed framework can achieve a 1.21-19.84 percent improvement on F1-score using joint training of the matching and the decision components. The proposed CONNA has been successfully deployed on AMiner — a large online academic search system. [ABSTRACT FROM AUTHOR]

The large number of scientific publications around the world is increasing at a rate of approximately 4%–5% per year. This fact has resulted in the need for tools that deal with relevant and high-quality publications. To address this necessity, search and reference management tools that include some recommendation algorithms have been developed. However, many of these solutions are proprietary tools and the full potential of recommender systems is rarely exploited. There are some solutions which provide recommendations for specific domains, by using ad-hoc resources. Furthermore, some other systems do not consider any personalization strategy to generate the recommendations. This paper presents ArZiGo , a web-based full prototype system for the search, management, and recommendation of scientific articles, which feeds on the Semantic Scholar Open Research Corpus, a corpus that is growing continually with more than 190M papers from all fields of science so far. ArZiGo combines different recommendation approaches within a hybrid system, in a configurable way, to recommend those papers that best suit the preferences of the users. A group of 30 human experts has participated in the evaluation of 500 recommendations in 10 research areas, 7 of which belong to the area of Computer Science and 3 to the area of Medicine, obtaining quite satisfactory results. Besides the appropriateness of the articles recommended, the execution time of the implemented algorithms has also been analyzed. • A web system for the search, management, and recommendation of scientific articles. • A hybrid and multidisciplinary scientific article recommendation system. • A modular and scalable recommendation system. • Use of the Semantic Scholar Open Research Corpus as a corpus of articles. [ABSTRACT FROM AUTHOR]

This document is a foreword for a special issue of the journal Microsystem Technologies. The special issue features selected papers from the 11th International Conference on Computing, Communication and Sensor Network (CCSN) held in September 2022 at Utkal University in Bhubaneswar, Odisha, India. The conference covered various interdisciplinary areas such as computing, communication, sensor networks, and circuit designs. The papers included in this special issue have undergone a rigorous review process and were selected for publication. The foreword expresses the hope that readers will find the papers informative. [Extracted from the article]

There is widespread debate on whether to anonymize author identities in peer review. The key argument for anonymization is to mitigate bias, whereas arguments against anonymization posit various uses of author identities in the review process. The Innovations in Theoretical Computer Science (ITCS) 2023 conference adopted a middle ground by initially anonymizing the author identities from reviewers, revealing them after the reviewer had submitted their initial reviews, and allowing the reviewer to change their review subsequently. We present an analysis of the reviews pertaining to the identification and use of author identities. Our key findings are: (I) A majority of reviewers self-report not knowing and being unable to guess the authors' identities for the papers they were reviewing. (II) After the initial submission of reviews, 7.1% of reviews changed their overall merit score and 3.8% changed their self-reported reviewer expertise. (III) There is a very weak and statistically insignificant correlation of the rank of authors' affiliations with the change in overall merit; there is a weak but statistically significant correlation with respect to change in reviewer expertise. We also conducted an anonymous survey to obtain opinions from reviewers and authors. The main findings from the 200 survey responses are: (i) A vast majority of participants favor anonymizing author identities in some form. (ii) The "middle-ground" initiative of ITCS 2023 was appreciated. (iii) Detecting conflicts of interest is a challenge that needs to be addressed if author identities are anonymized. Overall, these findings support anonymization of author identities in some form (e.g., as was done in ITCS 2023), as long as there is a robust and efficient way to check conflicts of interest. [ABSTRACT FROM AUTHOR]

An important development in geometric algebra in recent years is the new system known as point geometry, which treats points as direct objects of operations and considerably simplifies the process of geometric reasoning. In this paper, we provide a complete formal description of the point geometry theory architecture and give a rigorous and reliable formal verification of the point geometry theory based on the theorem prover Coq. Simultaneously, a series of tactics are also designed to assist in the proof of geometric propositions. Based on the theoretical architecture and proof tactics, a universal and scalable interactive point geometry machine proof system, PointGeo, is built. In this system, any arbitrary point-geometry-solvable geometric statement may be proven, along with readable information about the solution's procedure. Additionally, users may augment the rule base by adding trustworthy rules as needed for certain issues. The implementation of the system expands the library of Coq resources on geometric algebra, which will become a significant research foundation for the fields of geometric algebra, computer science, mathematics education, and other related fields. [ABSTRACT FROM AUTHOR]

In this research, two distinct areas of number theory and its use in computer science are combined. In this article, an investigation was conducted on the implementation of solutions to linear congruence problems. Linear congruence is a concept implying that two integers a and b are congruent modulo m (denoted as ab (?mod = m)), if the difference between them is exactly proportional to m. The study is important in the field of number theory and computer science which brings many benefits and efficient solutions to various problems. Therefore, the study investigates the application of linear congruence through illustrative examples, to apply number theory in finding the ISBN number, in converting decimal numbers to binary, octal, and hexadecimal, and its application in encoding and decoding messages from the field of cryptography. This section of the paper can make it easier for mathematicians to apply problems involving linear congruences, especially for those who need basic expertise in number theory. The findings of the study show that the compatibility of the book ISBN format can be checked through linear congruence. Additionally, these findings demonstrate your understanding of how to convert decimal values to binary, octal, and hexadecimal using linear congruence in a fairly comprehensive manner. Additionally, because the idea of a linear congruence system is employed in the encoding and decoding of codes for network security and other purposes, the findings of this study may be helpful to researchers working in the field of cryptography. [ABSTRACT FROM AUTHOR]

The characterisation of geometric shapes produces their concise description and is, therefore, important for subsequent analyses, for example in Computer Vision, Machine Learning, or shape matching. A new method for extracting characterisation vectors of 2D geometric shapes is proposed in this paper. The shape of interest, embedded into a raster space, is swept several times by sweep-lines having different slopes. The interior shape's points, being in the middle of its boundary and laying on the actual sweep-line, are identified at each stage of the sweeping process. The midpoints are then connected iteratively into chains. The chains are filtered, vectorised, and normalised. The obtained polylines from the vectorisation step are used to design the shape's characterisation vector for further application-specific analyses. The proposed method was verified on numerous shapes, where single- and multi-threaded implementations were compared. Finally, characterisation vectors, among which some were rotated and scaled, were determined for these shapes. The proposed method demonstrated a good rotation- and scaling-invariant identification of equal shapes. [ABSTRACT FROM AUTHOR]

In this paper we establish the complexity map for the Group Activity Selection Problem (GASP), along with two of its prominent variants called sGASP and gGASP, focusing on the case when the number of types of agents is the parameter. In all these problems, one is given a set of agents (each with their own preferences) and a set of activities, and the aim is to assign agents to activities in a way which satisfies certain global as well as preference-based conditions. Our positive results, consisting of one fixed-parameter algorithm and one XP algorithm, rely on a combination of novel Subset Sum machinery (which may be of general interest) and identifying certain compression steps that allow us to focus on solutions with a simpler, well-defined structure (in particular, they are "acyclic"). These algorithms are complemented by matching lower bounds, which among others close a gap to a recently obtained tractability result of Gupta et al. (in: Algorithmic game theory—10th international symposium, SAGT 2017, vol 10504 of lecture notes in computer science, Springer, 2017). In this direction, the techniques used to establish W[1]-hardness of sGASP are of particular interest: as an intermediate step, we use Sidon sequences to show the W[1]-hardness of a highly restricted variant of multi-dimensional Subset Sum, which may find applications in other settings as well. [ABSTRACT FROM AUTHOR]

The global coal industry, as an important basic industry, has strongly supported the stable and rapid development of the international economy and society. Although the level of automation in the context of coal mining has reached a very high degree, coal mine accidents such as roof collapse, side falling accidents, gas outburst potential, etc. continue to take place. Therefore, lots of intelligent systems are installed into collieries. For example, intelligent safety analysis technology represented by deep learning has been widely implemented in coal mine safety. The intelligent coal mining applications are always computing resource sensitive. They are usually deployed in the cloud centres that are located on the ground. As we all know, coal mining applications such as coal mine safety requires a comprehensive consideration of the mining, transportation, ventilation, hydrology, geology and other integrated factors. The transmission of all detecting data about these factors especially for multimedia from the underground face to the cloud computing centre is time-consuming. However, coal mine accidents always happen in a short span of time. This long transmission time is unacceptable for coal mine safety. In this paper, we propose a novel edge computing based intelligent processing architecture that integrates Internet of Things (IoT), fifth generation (5G), and Edge computing technologies for the coal mining intelligent system. Experiments are conducted on a deep learning based video fire prediction algorithm to prove the effectiveness of the architecture [ABSTRACT FROM AUTHOR]

The notion of fuzzy graph (FG) is widely used in many problems arising from partial or incomplete descriptions of the real world and in particular from fields such as engineering, economics, computer science, social disciplines, or medical diagnostics, and has been used in many fields of pure mathematics as well as in several areas of applied sciences such as decision making, statistics and networking. In this paper we will deal with the graph of the picture fuzzy(symmetric) set using the notion of domination in picture fuzzy graph (PFG) as a generalization of both the concept of fuzzy graph domination and intuitionistic fuzzy graph (IFG) domination. The concepts of domination theory (DT) and double domination theory (DDT) of a PFG are introduced, studied and concretely applied to the real case of an election competition to determine the minimum number of citizens a politician should meet in person in order to win the election. The choice of fuzzification (symmetric) and defuzzification (anti-symmetric) methods depends on the specific application and the type of fuzzy sets being used, whether they are symmetric or anti-symmetric. There are various methods for each process, such as centroid, max-min, and weighted average methods for defuzzification. Finally, in the last section, drawing from the application example, the features and benefits of PFGs with respect to fuzzy graphs and intuitionistic fuzzy graphs are compared and discussed. [ABSTRACT FROM AUTHOR]

Deoxyribonucleic Acid (DNA) coding technology is a new research field developed by the combination of computer science and molecular biology, that has been gradually applied in the field of image encryption in recent years. Furthermore, sensitivity to initial conditions, pseudo-random properties, and state ergodicity of coupled chaotic maps can help produce good pseudo-random number generators and meet the requirements of an image encryption system well. In this paper, an image encryption algorithm based on high-dimensional coupled chaotic maps and DNA coding is proposed. A pseudo-random sequence is generated by a long short-term memory (LSTM) architecture using the proposed maps and evaluated through a set of statistical tests to show the high performance of the proposed generator. All intensity values of an input image are converted to a binary sequence, which is scrambled globally by the high-dimensional coupled chaotic maps. The DNA operations are performed on the scrambled binary sequences instead of binary operations to increase the algorithm efficiency. Simulation results and performance analyses demonstrate that the proposed encryption scheme is extremely sensitive to small changes in secret keys, provides high security and can resist differential attack. [ABSTRACT FROM AUTHOR]

The field of statistical computing is rapidly developing and evolving. Shifting away from the formerly siloed landscape of mathematics, statistics, and computer science, recent advancements in statistical computing are largely characterized by a fusing of these worlds; namely, programming, software development, and applied statistics are merging in new and exciting ways. There are numerous drivers behind this advancement, including open movement (encompassing development, science, and access), the advent of data science as a field, and collaborative problem-solving, as well as practice-altering advances in subfields such as artificial intelligence, machine learning, and Bayesian estimation. In this paper, we trace this shift in how modern statistical computing is performed, and that which has recently emerged from it. This discussion points to a future of boundless potential for the field. [ABSTRACT FROM AUTHOR]

Covering a graph with cohesive subgraphs is a classical problem in theoretical computer science, for example when the cohesive subgraph model considered is a clique. In this paper, we consider as a model of cohesive subgraph the 2-clubs, which are induced subgraphs of diameter at most 2. We prove new complexity results on the Min 2 - Club Cover problem, a variant recently introduced in the literature which asks to cover the vertices of a graph with a minimum number of 2-clubs. First, we answer an open question on the decision version of Min 2 - Club Cover that asks if it is possible to cover a graph with at most two 2-clubs, and we prove that it is W[1]-hard when parameterized by the distance to a 2-club. Then, we consider the complexity of Min 2 - Club Cover on some graph classes. We prove that Min 2 - Club Cover remains NP-hard on subcubic planar graphs, W[2]-hard on bipartite graphs when parameterized by the number of 2-clubs in a solution, and fixed-parameter tractable on graphs having bounded treewidth. [ABSTRACT FROM AUTHOR]

This paper proposes two novel approaches to measure the similarity of co-cited authors for the task of document clustering, a) paragraph-level content-based author co-citation analysis (PCACA) and b) section-level content-based author co-citation analysis (SCACA), by mining the textual cited reference at the paragraph and the section level within a given scientific publication, respectively. Using over 2000 full-text publications, indexed in the field of Computer and Information Sciences, indexed in PLOS.org, we extract the useful information from a full-text publication such as citing sentences, location of citing sentences, cited first author name, and title of cited. We show that our proposed SCACA method of clustering outperforms existing clustering methods by exhibiting more optimal clusters with minimum graph density and an average degree in SCACA, i.e., 0.327 and 27.143, respectively. Finally, we show that SCACA produces the optimum number of clusters that comprehensively explains sub-disciplines of co-cited author pairs. [ABSTRACT FROM AUTHOR]

Plant phenotyping studies the complex characteristics of plants, with the aim of evaluating and assessing their condition and finding better exemplars. Recently, a new branch emerged in the phenotyping field, namely, high-throughput phenotyping (HTP). Specifically, HTP exploits modern data sampling techniques to gather a high amount of data that can be used to improve the effectiveness of phenotyping. Hence, HTP combines the knowledge derived from the phenotyping domain with computer science, engineering, and data analysis techniques. In this scenario, machine learning (ML) and deep learning (DL) algorithms have been successfully integrated with noninvasive imaging techniques, playing a key role in automation, standardization, and quantitative data analysis. This study aims to systematically review two main areas of interest for HTP: hardware and software. For each of these areas, two influential factors were identified: for hardware, platforms and sensing equipment were analyzed; for software, the focus was on algorithms and new trends. The study was conducted following the PRISMA protocol, which allowed the refinement of the research on a wide selection of papers by extracting a meaningful dataset of 32 articles of interest. The analysis highlighted the diffusion of ground platforms, which were used in about 47% of reviewed methods, and RGB sensors, mainly due to their competitive costs, high compatibility, and versatility. Furthermore, DL-based algorithms accounted for the larger share (about 69%) of reviewed approaches, mainly due to their effectiveness and the focus posed by the scientific community over the last few years. Future research will focus on improving DL models to better handle hardware-generated data. The final aim is to create integrated, user-friendly, and scalable tools that can be directly deployed and used on the field to improve the overall crop yield. [ABSTRACT FROM AUTHOR]

This issue of the Communications Standards Supplement includes updated versions of selected papers from the seventh International Telecommunications Union (ITU) Kaleidoscope Academic Conference. The conference took place in Barcelona, Spain, 9-11 December 2015, as part of the celebration of the ITU's 150th anniversary. The topic of the conference was "Trust in the Information Society", and the event was technically co-sponsored by the Institute of Electrical and Electronics Engineers (IEEE), the IEEE Communication Society, and the Institute of Electronics, Information and Communication Engineers of Japan (IEICE). The conference host was the Universitat Autonoma de Barcelona, Spain. [ABSTRACT FROM AUTHOR]

• Eulerian trails are classical and important objects in theoretical computer science field. • Enumeration of Eulerian trails is known to be #P-complete. • Although the existence of an algorithm with linear time per output is known, the existence of a faster algorithm is open. • This paper shows optimal algorithms for Eulerian trails which run in constant time per solution on average. In this paper, we consider enumeration problems for edge-distinct and vertex-distinct Eulerian trails. Two Eulerian trails are said to be edge-distinct if the edge sequences are not identical, and they are said to be vertex-distinct if the vertex sequences are not identical. To solve these problems, we propose optimal enumeration algorithms that run in O (N + m) total time, where N is the number of solutions and m is the number of edges in an input connected graph. The proposed algorithms are based on the reverse search technique introduced by [Avis and Fukuda, DAM 1996], and the push-out amortization technique introduced by [Uno, WADS 2015]. [ABSTRACT FROM AUTHOR]

Agro-business is highly dependent on rice quality and its protection from diseases. There are several prerequisites for the procedures and the strategies that are productive and efficient for expanding the harvest yield. The advancement in computer science has supported various domains; agricultural innovation is one of them. The apparatuses which utilize the strategies of advanced artificial intelligence and machine learning have been featured in this paper. These techniques attain abnormally productive outcomes for the recognition of infections engrossing the images of leaves, fields of harvest, or seeds. In this context, this work presents a survey that focuses on accuracy agribusiness for expanding the conception of rice, which is one of the main harvests on the planet. In this paper, the overview and examination of various papers distributed in the most recent eight years with various methodologies identified with crop diseases identification, the health of seedlings, and quality of grain have been introduced. Experiments are performed for knowledge extraction using Web of Science and Scopus databases to analyze research trends in the domain of rice disease identification using artificial intelligence using global analysis, year-wise and country-wise citations, and so on to support various researchers working in this domain. [ABSTRACT FROM AUTHOR]

In our study, we examine the impact of citation network structures on the ability to discern valuable research topics in Computer Science literature. We use the bibliographic information available in the DBLP database to extract candidate phrases from scientific paper abstracts. Following that, we construct citation networks based on direct citation, co-citation and bibliographic coupling relationships between the papers. The candidate research topics, in the form of keyphrases and n-grammes, are subsequently ranked and filtered by a graph-text ranking algorithm. This selection of the highest ranked potential topics is further evaluated by domain experts and through the Wikipedia knowledge base. The results obtained from these citation networks are complementary, returning valid but non-overlapping output phrases between some pairs of networks. In particular, bibliographic coupling appears to capture more unique information than either direct citation or co-citation. These findings point towards the possible added value in combining bibliographic coupling analysis with other structures. At the same time, combining direct citation and co-citation is put into question. We expect our findings to be utilised in method design for research topic identification. [ABSTRACT FROM AUTHOR]

Fractional programming (FP) refers to a family of optimization problems whose objective function is a ratio of two functions. FP has been studied extensively in economics, management science, information theory, optic and graph theory, communication, and computer science, etc. This paper presents a bibliometric review of the FP-related publications over the past five decades in order to track research outputs and scholarly trends in the field. The reviews are conducted through the Science Citation Index Expanded (SCI-EXPANDED) database of the Web of Science Core Collection (Clarivate Analytics). Based on the bibliometric analysis of 1811 documents, various theme-related research indicators were described, such as the most prominent authors, the most commonly cited papers, journals, institutions, and countries. Three research directions emerged, including Electrical and Electronic Engineering, Telecommunications, and Applied Mathematics. [ABSTRACT FROM AUTHOR]

Linear codes generated by component functions of perfect nonlinear (PN for short) and almost perfect nonlinear (APN for short) functions and the first-order Reed-Muller codes have been an object of intensive study in coding theory. The objective of this paper is to investigate some binary shortened codes of two families of linear codes from APN functions and some $p$ -ary shortened codes associated with PN functions. The weight distributions of these shortened codes and the parameters of their duals are determined. The parameters of these binary codes and $p$ -ary codes are flexible. Many of the codes presented in this paper are optimal or almost optimal. The results of this paper show that the shortening technique is very promising for constructing good codes. [ABSTRACT FROM AUTHOR]

In the 21st century, as part of the fourth industrial revolution, artificial intelligence (AI), is one of the most important and well-known technology. AI also has made it possible to execute human tasks without the need for humans. However, there is one important concern with consciousness. This is because consciousness is one of the most defining qualities between AI and humans. So, this study presents a literature review and bibliometric analysis of artificial and mind consciousness research around the world from 2000 to 2022 in order to provide researchers and scholars around the world with an overview of the results and trends in artificial and mind consciousness research. A textual query on two databases; Scopus (289 papers), and Web of Science (303 papers) using the term "artificial consciousness" OR "mind consciousness" was performed on 10 June 2022 retrieving 509 scholarly papers from 2000 to 2022 related to artificial and mind consciousness studies for in-depth analysis. Bibliometric analysis were performed using Rstudio software version 4.2.0 and biblioshiniy for bibliometrix to visualize and analyze trends of artificial and mind consciousness research. This bibliometric analysis was analyzed the annual scientific publication growth, the most productive authors, most frequent word has been using, most famous journal name, and which countries has highest collaboration with other country. According to the findings of the analysis, there is significant inconsistency in global trends in annual scientific production, with the number of publications increasing and decreasing. Among all countries, United States (USA) contributed the most publications in the field of artificial and mind consciousness research. According to the findings has show the most relevant authors is Kelley TM (Scopus), and Patel AD (WoS). Moreover, the most relevant journals articles in artificial and mind consciousness studies is Procedia Computer Science (Scopus), and Journal Of Consciousness Studies (WoS). The implication of this study is can help new researchers in this field by providing information on relevant publications and authors to consult when conducting research on this topic. Furthermore, this research helps other researchers understand current trends in this area of study. As a result, the justification for doing this study is to provide the first bibliometric analysis and to fill research gaps in bibliometric studies of artificial consciousness and the mind by providing information in the form of a literature review, overview, and guidelines. [ABSTRACT FROM AUTHOR]

Fog computing is defined as the distribution of computing resources between the data devices and the cloud or any other data centre in a distributed computing infrastructure or process. This paper briefly reviews the various definitions, applications, architecture and fog simulators proposed by researchers over the years. In this paper, a comparison table is presented which highlights the key features of simulators available like FogtorchII, iFogSim, Fogbus, MyiFogSim etc. [ABSTRACT FROM AUTHOR]

This study explored the publication pattern of Canadian computer scientists and compared the impact of conference papers and journal articles published by these researchers. It was found that conference proceedings are the preferred venue for scholarly communication, but the impact of conference papers is not comparable to that of journal articles. The potential reasons for the lower impact of conference papers are discussed, and possible approaches to improve the current scholarly communication system in computer science are proposed. [ABSTRACT FROM AUTHOR]

The paper by Feng et al. [[11]] proposes an image encryption algorithm, IEA-IF-DLT, that utilizes plane-level image filtering and discrete logarithmic transformation to achieve a balance between security and efficiency. In the last few decades, the relationship between mathematics and algorithms has become increasingly important and influential in computer science. The scheme utilizes versatile bit-depth management, encrypting the most significant bits of each pixel with the AES-CTR cipher algorithm and embedding additional data in the least significant bit planes of the encrypted pixels using code division multiplexing. [Extracted from the article]

Natural language processing is an important direction in the field of computer science and artificial intelligence. It can realize various theories and methods of effective communication between humans and computers using natural language. Machine learning is a branch of natural language processing research, which is based on a large-scale English-Chinese database. Due to the relatively poor alignment corpus of English and Chinese bilingual sentences containing unknown words, machine translation is unprofessional and unbalanced, which is the problem studied in this paper. The purpose of this paper is to design and implement a length-based system for sentence alignment between English and Chinese bilingual texts. The research content of this paper is mainly divided into the following parts. First, the evaluation function of bilingual sentence alignment is designed, and on this basis, the bilingual sentence alignment algorithm based on the length and the optimal sentence pair sequence search algorithm is designed. In this paper, China National Knowledge Infrastructure (CNKI) is selected as an English-Chinese bilingual candidate website and English-Chinese bilingual web pages are downloaded. After analyzing the downloaded pages, nontext content such as page tags is removed, and bilingual text information is stored so as to establish an English-Chinese bilingual corpus based on segment alignment and retain English-Chinese bilingual keywords in the web pages. Second, extract the dictionary from the software StarDict, analyze the original dictionary format, and turn it into a custom dictionary format, which is convenient and better to use the double-sentence sentence alignment system, which is conducive to expanding the number of dictionaries and increasing the professionalism of vocabulary. Finally, we extract the stems of English words from the established corpus to simplify the complexity of English word processing, reduce the noise caused by the conversion of word parts of speech, and improve the operation efficiency. A bilingual sentence alignment system based on length is implemented. Finally, the system parameters are adjusted for comparative experiments to test the system performance. [ABSTRACT FROM AUTHOR]

Summary: Art painting is a very important major in China's education system. Under the background of the new era, the country vigorously promotes the modernization of education and the development of intelligence. Many subjects of teaching have been more mature and carried out intelligent teaching based on virtual reality technology. But throughout the art painting profession, the research on this aspect is almost blank. The main reason is that there are deep academic barriers between art painting and computer science. Therefore, this paper puts forward the application research of multi‐source information art painting fusion interactive 3D dynamic scene virtual reality technology. This paper deeply analyzes the needs of art painting and its teaching reform and believes that the existing virtual reality technology cannot adapt to the teaching environment of art painting. In view of the possible inaccurate calculation and other problems, this paper puts forward the optimization scheme. The core of the scheme is to use the information integration advantages of multi‐source information fusion to provide more comprehensive and complete object information for 3D modeling of virtual reality technology, so as to improve the imaging quality of virtual reality technology. In order to meet the requirement of high precision, the calculation method is optimized, the calculation steps are simplified, and the sensor selection is optimized again. This paper introduces the design principle and operation steps of the optimization method in detail. In order to further verify the actual effect of this method, comparative analysis method is used to test the comprehensive performance. In order to ensure the test quality, the median filtering algorithm and fuzzy algorithm are compared. Through the analysis and comparison of the data, the optimization method in this paper greatly improves the accuracy of calculation and the comprehensive performance is improved. [ABSTRACT FROM AUTHOR]

Foreign students coming to study in Russia learn the Russian language at all levels, enriching their vocabulary. Besides possessing the lexical minimum of the Russian language, foreign students studying at the preparatory department of the Russian university need to master specialised terminology used in computer science, physics and mathematics. These subjects are included in the list of disciplines of the supplementary general programme, which aims to provide a preparation course for foreign citizens and stateless persons to master professional educational programmes in the Russian language. This article describes the need and conditions for enriching and activating the vocabulary of foreign students, while providing a general description of research methods. It expounds on the structure and content of the computer science course at the pre-university stage of training for foreign citizens. The paper considers the process of teaching foreign studentsthe terminology used in the computer science course. This paper provides a number of examples of new terms as well as exercises related to their acquisition. It is concluded that teaching computer-science vocabulary to foreign students is one of the most important components of teaching information science and expanding the learners’ vocabulary in general. [ABSTRACT FROM AUTHOR]