Search

An important tool for proving the safety of dynamical systems is the notion of a barrier certificate. In this paper, we prove that every robustly safe ordinary differential equation has a barrier certificate. Moreover, we show a construction of such a barrier certificate based on a set of states that is reachable in finite time. [ABSTRACT FROM AUTHOR]

Although hash function learning algorithms have achieved great success in recent years, most existing hash models are off-line, which are not suitable for processing sequential or online data. To address this problem, this paper proposes an online hash model to accommodate data coming in stream for online learning. Specifically, a new loss function is proposed to measure the similarity loss between a pair of data samples in hamming space. Then, a structured hash model is derived and optimized in a passive-aggressive way. Theoretical analysis on the upper bound of the cumulative loss for the proposed online hash model is provided. Furthermore, we extend our online hashing (OH) from a single model to a multimodel OH that trains multiple models so as to retain diverse OH models in order to avoid biased update. The competitive efficiency and effectiveness of the proposed online hash models are verified through extensive experiments on several large-scale data sets as compared with related hashing methods. [ABSTRACT FROM AUTHOR]

The author looks at how computer science will transform the humanities. According to the author, algorithmic thinking is transforming both the descriptive sciences and the humanities, bringing them all closer to the mathematical core of computer science. The author discusses the continually increasing reliance on computation, the replacement of paper library collections with online databases and the use of online resources by students writing papers.

This article discusses a research study conducted by the Department of Computer Science and Engineering on brain cancer. The researchers focused on designing and building a system that uses Convolutional Neural Network (CNN) models to detect brain tumors. The system utilizes digital image processing and deep learning techniques to automatically diagnose and identify diseases and abnormalities. The proposed algorithm was applied using MATLAB and achieved a high level of accuracy in tumor segmentation. The study concludes that incorporating a classification method based on CNN improves accuracy and reduces calculation time. [Extracted from the article]

The article examines how high school computer science enrollment impacts students college major choices and future earnings, highlighting disparities among demographic groups and advocating for targeted efforts to enhance participation in CS coursework.

A recent study conducted at the School of Computer Science and Engineering in Shaanxi, China, focused on the development of a medical dialogue generation system. The researchers aimed to improve the efficiency of clinical consultations and reduce the burden on doctors by creating a model that can automatically generate responses. The study utilized external knowledge and large-scale pre-training models to enhance the accuracy of the dialogue generation. Experimental data showed that the proposed model outperformed traditional methods in terms of response effectiveness and accuracy. For more information, the full research article can be accessed through the provided link. [Extracted from the article]

A recent study conducted by researchers at Beijing Jiaotong University in China explores the impact of teleworkers' psychology on their job performance and how they relieve negative emotions through enterprise social media (ESM). The study surveyed 835 teleworkers from various industries in China and found that family-to-work conflict and social isolation contribute to emotional exhaustion, which in turn negatively affects job performance. However, the study also found that the use of ESM can reduce family-to-work conflict and social isolation, thereby alleviating emotional exhaustion. The research provides practical suggestions for managers and teleworkers to improve job performance while working from home. [Extracted from the article]

This article presents information about contributions of Alan Turing in the field of computer science. Turing was a brilliant mathematician who showed that computers could not completely prove mathematical assertions. This connection between computers and mathematics was later used to develop a mathematical foundation for computer science, comparable to mathematical foundations for physics and other sciences. Born in 1912, Turing was accepted by Cambridge University, Cambridge, England in 1930 to study mathematics, and became a Fellow in 1934 at the age of 22, completing a dissertation that extended the group theory models of Von Neumann. After its beginning with Turing's pioneering paper in 1936, computer science emerged as a mature discipline in the 1960s, when universities nationwide started offering it as an undergraduate program of study. The new discipline of computer science viewed computation as information processing, a transformation of input to output--where the input is completely defined before the start of computation, and the output provides a solution to the problem at hand.

The article describes several achievements in the field of theoretical computer science (TCS) and computer research in Latin America. It discusses several areas of research that were developed by regional conferences including LATIN, LAGOS, and Latincrypt. The article discusses research including graph theory, pattern matching and information retrieval, and algorithms.

According to their explanation, the majority of current Lifelong Learning (LL) research revolves around a single AI agent learning tasks sequentially, a method that inherently presents slow progress. In their paper, Itti and Ge introduce their creation, SKILL (Shared Knowledge Lifelong Learning), a powerful tool designed to enable AI systems to learn and master 102 diverse tasks. [Extracted from the article]

Keywords: Data Modeling; Epidemic; Epidemiology; Information Technology; Risk and Prevention EN Data Modeling Epidemic Epidemiology Information Technology Risk and Prevention 1337 1337 1 07/03/23 20230707 NES 230707 2023 JUL 9 (NewsRx) -- By a News Reporter-Staff News Editor at Medical Letter on the CDC & FDA -- A new study on data modeling is now available. According to the news editors, the research concluded: "Conclusions show that existing vocabularies and ontologies provide significant coverage of the concepts underlying epidemic use cases, but there remain gaps in the coverage. This paper surveys vocabularies and ontologies relevant to the task of achieving epidemic-related data interoperability. [Extracted from the article]

The article focuses on the death of Edmund C. Berkeley, principal founder of the Association for Computing Machinery (ACM), and the preservation of Berkeley's records and papers at the Charles Babbage Institute (CBI) in the University of Minnesota. The records date from the 1940s and contain correspondence, memoranda and subject files on the ethical use of computers, education in computing and computer programming languages. The author described the aim of the CBI to preserve valuable historical records and collections relating to computer organizations and professionals.

The article presents news briefs related to the Association for Computing Machinery (ACM). Focusing on 1985 regional representatives election results, it states that regional representatives have been elected to serve from July 1, 1985, to June 30, 1988. Herbert Maisel has been appointed chairman of the Ad hoc Committee on Inter-society Liaison. Maisel is also a Council Member-at-Large and the chairman of the External Activities Board. The Berlin Continuing Engineering Education Program is offering its fall series of seminars on industrial electronics and robotics in Berlin. At its March 13, 1985 meeting the Executive Committee of the ACM approved joint membership agreements with the "Beigisch Instituut voor Regeltechniek en Automatizering" (BIRA). These agreements will take effect from July 1, 1985. Members of the BIRA are accepted as voting Members of ACM. It also notes that the technical contributions appearing in the ACM journals are normally original papers that have not been published elsewhere. Widely disseminated conference proceedings and newsletters are a form of publication, although they are usually only semi archival and are often unrefered.

The article provides a perspective on the use of algorithms in maintaining maximum flow through computing networks. Offers a critique of various max-flow theorems and algorithms. Discusses prior research into max-flow applications. Mentions the hope for future breakthroughs in developing scalable max-flow algorithms.

An introduction to an article published in the journal is presented about the topic of pattern matching, particularly the Burrows-Wheeler Transform (BWT).

The article discusses an algorithm designed to compute maximum flow and minimum-cost flows. It builds on the works of prior researchers to propose new theorems and provides formulas and graphs to illustrate these theorems and schemes.

The article examines the rise of ubiquitous computing. Describes the proliferation of smart phones, mobile computing devices and immersive technologies that produce "anywhere and everywhere data" and how such devices are becoming increasing entwined. Describes the local, temporal and contextual nature of generated data. Applies the post-cognitive framework from social science to information science in order to describe how information is transformed through interactions between media sources. Discusses how the various devices should complement each other as ubiquitous analytics works to leverage the shared data.

The article discusses the community that developed during the decade of the 1970's that fostered the growth of research into artificial intelligence. It details the slow progress of AI researchers in developing the field. It mentions the importance of military backing in aid of AI research, including funding acquired through Advanced Research Projects Agency (ARPA) to places like MIT and Stanford University. It outlines the continued struggle for broader funding. It describes the growth of AI organizations, increased conference attendance, class enrollment in universities, and the growing number of published articles throughout the 1970's as evidence of the growing support for this field in the academic and computer science communities.

Discusses a proposed reorganization of the Computer Systems Department of the Association for Computing Machinery. Information that the department has been divided into two sub-departments: Computer Architecture and Measurement, and Performance Evaluation; Functions and roles of the departments; Information on the steps taken by the association for the publication of valuable papers related to the field of computer science in the periodical "Communications of the ACM."

The article focuses on origami expert Erik Demaine. Demaine was not a typical teenager. He went to college at the age of 12, and by 14, he was a graduation student at the University of Waterloo in Waterloo, Ontario. The work he did there sounds whimsical — making paper stars, angelfish and swans — but Demaine was confronting a thorny problem. Namely, which shapes can be made simply by folding a piece of paper, as many times as you like, then snipping off a corner and unfolding it. The answer, Demaine discovered, after two years of calculations and crumpled paper, is any shape you can think of. It is theoretically possible to create any two-dimensional straight-sided shape, from a triangle to the New York City skyline, with a single scissors cut. That elegant theorem, completed in 1998, helped launch computational origami, a hybrid discipline — part computer science, part mathematics — that explores complex geometry concepts inspired by the Japanese art of paper folding. Computational origami has helped engineers figure out how to unfold a telescope lens in outer space without damaging it, and determine the safest way to stow an airbag within a steering column.

The article discusses the role of the man as an Information-Processing System. The International Federation for Information Processing (IFIP) will conduct a session regarding technological innovations in data processing. Computer system design which has been patterned on man as recently been moving away from totally central control system design concepts headed for decentralized control concepts. Chairman of the session will be Isaac L. Auerbach which is also the president of IFIP. The plans of this computer organization will make a big progress in information technology.

The article reports that in 2013 Melody M. Madriad, Maryam Mousavizadeh and Ana Mae Kristine U. Hubilla were winners of the Association for Information Science & Technology International Information Issues Special Interest Group's International Paper Contest and that Monica Garfield, Alan Dennis and Eden Litt were winners of the association's Social Informatics Special Interest Group's Best Social Informatics Papers awards.

In online convex optimization, adaptive algorithms, which can utilize the second-order information of the loss function’s (sub)gradient, have shown improvements over standard gradient methods. This paper presents a framework Follow the Bregman Divergence Leader that unifies various existing adaptive algorithms from which new insights are revealed. Under the proposed framework, two simple adaptive online algorithms with improvable performance guarantee are derived. Furthermore, a general equation derived from a matrix analysis generalizes the adaptive learning to nonlinear case with kernel trick. [ABSTRACT FROM AUTHOR]

Purpose - The purpose of this paper is to introduce a scalable group key exchange (GKE) protocol with provable security, which is used to establish a confidential channel. Design/methodology/approach - The protocol in this paper uses line structure, rather than formal ring structure or tree structure, to reduce the amount of calculation and communication. Findings - In the protocol, every participant just need send two messages. The security can be proved under the Decisional Diffie-Hellman (DDH) problem. Originality/value - Using the protocol provides an efficient and secure method to allow group users to share a common key. [ABSTRACT FROM AUTHOR]

The article discusses about the dependence of human beings on complex automated systems. At work, at home, at play, on the streets, in sickness and in health, human beings are ever more dependent on computers and networks for support, even survival. If this is continued, human beings will not have the knowledge and skill to weather a major crash. Liberation from intellectual toil carries certain risks, since capacities can atrophy from disuse. Thus, one should render to computer what is the computer's, and to the human being what is the human being's. Everything has limitations. Commenting on the one-person-one-vote principle in a democracy, Bertrand Russell observed that in a population of n, a person has a 1/n share in the government of the community, but at the same time only a 1/n share in the governance of oneself. This does not argue against democracy, but in favor of parsimony in granting government jurisdiction over issues that could be handled by the individual. Similarly, care should be exercised in assigning tasks to the computer. No formula for such an allocation is at hand. There is no substitute for eternal vigilance.

The article presents information on conferences and meetings related to the field of information technology. The Symposium on Small Computers in the Arts is scheduled to be held from October 15, 1982 to October 17, 1982 in Philadelphia, Pennsylvania. The Tenth Annual Conference of the Mid-South Association for Educational Data Systems is scheduled to be held from February 24, 1983 to February 26, 1983 in the U.S. The Annual Colloquium on Trees in Algebra and Programming is scheduled to be held from March 9, 1983 to March 11, 1983 in Italy. The Fourth Canadian Symposium on Instructional Technology is scheduled to be held from October 19, 1983 to October 21, 1983 in Canada.

The article offers news briefs related to the Association for Computing Machinery (ACM). The ACM Council approved a new annual Doctoral Dissertation Award which will be eligible for doctoral theses in computer science and related fields. David Gries, an American scientist, was chosen to participate in a Distinguished Scholar Exchange Program with the People's Republic of China. A Chapter Officers Training workshop to be held on February 8, 1982 is offered by the ACM Committee.

A calendar of professional activities by the Association for Computing Machinery (ACM) in 1981 is presented. The ACM will conduct its International Workshop on Chinese Library Automation in February 1981 in Taipei, Taiwan. The association's 16th Annual Western Regional Conference will take place in San Francisco, California from March 25-27, 1981. Saint Louis, Missouri will host the ACM Annual Computer Science Conference from February 24-26, 1981. The association will also conduct its Thirteenth Annual ACM Symposium on Theory of Computing in Milwaukee, Wisconsin in May 1981.

This article reflects on the author’s experiences as a black woman in the field of computing science. Topics include her educational experience in computing science, her personal communities’ support of her throughout her education, and how her experiences lead to her Science Everywhere project which encourages learners to think about STEM in all aspects of their daily lives.

The 5th International Workshop on Web Quality (WebQuality 2015) was held in conjunction with the 24rd International World Wide Web Conference in Florence, Italy on the 18th May 2015. This report briefly summarizes the workshop. [ABSTRACT FROM AUTHOR]

In dynamic optimization problems (DOPs), as the environment changes through time, the optima also dynamically change. How to adapt to the dynamic environment and quickly find the optima in all environments is a challenging issue in solving DOPs. Usually, a new environment is strongly relevant to its previous environment. If we know how it changes from the previous environment to the new one, then we can transfer the information of the previous environment, e.g., past solutions, to get new promising information of the new environment, e.g., new high-quality solutions. Thus, in this paper, we propose a neural network (NN)-based information transfer method, named NNIT, to learn the transfer model of environment changes by NN and then use the learned model to reuse the past solutions. When the environment changes, NNIT first collects the solutions from both the previous environment and the new environment and then uses an NN to learn the transfer model from these solutions. After that, the NN is used to transfer the past solutions to new promising solutions for assisting the optimization in the new environment. The proposed NNIT can be incorporated into population-based evolutionary algorithms (EAs) to solve DOPs. Several typical state-of-the-art EAs for DOPs are selected for comprehensive study and evaluated using the widely used moving peaks benchmark. The experimental results show that the proposed NNIT is promising and can accelerate algorithm convergence. [ABSTRACT FROM AUTHOR]

In recent decades, the development of social computing systems has realized the efficient information exchange between large groups of people. Nowadays, social computing systems are rather complex platforms supported by not only traditional sociology theory but also computer science and big data based applications. With the increase of the social computing systems' complexities, serious issues of social digital security and privacy have shown up since, in recent years, more and more social data leakage incidents are happening. This fact is due to reasons on many different aspects since there are many sources threatening the security and privacy of the social data in such a complex social computing system. In this paper, we improve the traditional social data protection schemes by combining the information fragmentation concepts with the distributed system architectures to build a novel social data protection scheme. We use social photo protection as the fundamental scenario and deploy our novel scheme to illustrate the improvement on the protection level with the protection analysis in detail. A security analysis of practically realizing such a scheme is also evaluated in this paper. [ABSTRACT FROM AUTHOR]

The article discusses the notion of Activity-Centric Computing (ACC) in relation to application-centric computing. Topics include the history of ACC systems in relation to research and development, the relation of ACC to conceptual models, and the relation of ACC to collaborative work and film or resource management.

In this paper, a new radix-2/8 fast Fourier transform (FFT) algorithm is proposed for computing the discrete Fourier transform of an arbitrary length N = q × 2m, where q is an odd integer. It reduces substantially the operations such as data transfer, address generation, and twiddle factor evaluation or access to the lookup table, which contribute significantly to the execution time of FFT algorithms. It is shown that the arithmetic complexity (multiplications+additions) of the proposed algorithm is, in most cases, the same as that of the existing split-radix FFT algorithm. The basic idea behind the proposed algorithm is the use of a mixture of radix-2 and radix-8 index maps. The algorithm is expressed in a simple matrix form, thereby facilitating an easy implementation of the algorithm, and allowing for an extension to the multidimensional case. For the structural complexity, the important properties of the Cooley-Tukey approach such as the use of the butterfly scheme and in-place computation are preserved by the proposed algorithm. [ABSTRACT FROM AUTHOR]

Exploiting the multiprocessors that have recently become ubiquitous requires high-performance and reliable concurrent systems code, for concurrent data structures, operating system kernels, synchronization libraries, compilers, and so on. However, concurrent programming, which is always challenging, is made much more so by two problems. First, real multiprocessors typically do not provide the sequentially consistent memory that is assumed by most work on semantics and verification. Instead, they have relaxed memory models, varying in subtle ways between processor families, in which different hardware threads may have only loosely consistent views of a shared memory. Second, the public vendor architectures, supposedly specifying what programmers can rely on, are often in ambiguous informal prose (a particularly poor medium for loose specifications), leading to widespread confusion. In this paper we focus on x86 processors. We review several recent Intel and AMD specifications, showing that all contain serious ambiguities, some are arguably too weak to program above, and some are simply unsound with respect to actual hardware. We present a new x86-TSO programmer's model that, to the best of our knowledge, suffers from none of these problems. It is mathematically precise (rigorously defined in HOL4) but can be presented as an intuitive abstract machine which should be widely accessible to working programmers. We illustrate how this can be used to reason about the correctness of a Linux spinlock implementation and describe a general theory of data-race freedom for x86-TSO. This should put x86 multiprocessor system building on a more solid foundation; it should also provide a basis for future work on verification of such systems. [ABSTRACT FROM AUTHOR]

The frequent items problem is to process a stream of items and find all those which occur more than a given fraction of the time. It is one of the most heavily studied problems in mining data streams, dating back to the 1980s. Many other applications rely directly or indirectly on finding the frequent items, and implementations are in use in large-scale industrial systems. In this paper, we describe the most important algorithms for this problem in a common framework. We place the different solutions in their historical context, and describe the connections between them, with the aim of clarifying some of the confusion that has surrounded their properties. To further illustrate the different properties of the algorithms, we provide baseline implementations. This allows us to give empirical evidence that there is considerable variation in the performance of frequent items algorithms. The best methods can be implemented to find frequent items with high accuracy using only tens of kilobytes of memory, at rates of millions of items per second on cheap modern hardware. [ABSTRACT FROM AUTHOR]

The article describes the experience of the authors related to the use of protocol analysis. They adopted protocol analysis when studying how software designers employ available documentation for designing systems from existing components. They used tools for extracting and composing components and for document browsing they developed for their earlier work, along with integral logging capabilities that could be used to record developer actions in a nonintrusive manner. They employed Unix processes as components and a group of four subjects, each with several years' experience using Unix but no experience writing shell scripts. They were allocated two tasks. First task was to produce a simple source code control system that would allow users to store and retrieve particular versions of source code. Second task was to produce a utility to count types of files in a specified path. They gave subjects access to all component utilities available on the system utilities. Extra introductory documentation regarding the use of the editor software and the production of shell scripts was provided on paper

The article presents a list of the top ten most popular papers available on ACM's Refereed Journals and Conference Proceedings digital library for the month of May 2006. Papers include "Architectures for a Temporal Workflow Management System," by Carlo Combi and Giuseppe Pozzi, "An Example Oriented On-line Java Tutorial for University Students," by Jianna J. Zhang and Huy Nguyen, "Evolution of Web Site Design Patterns," by Melody Y. Ivory and Rodrick Megraw, and "Events Not Equal to GUIs," by Stuart Hansen and Timothy Fossum.

The article presents a list of the top ten paper downloads from ACM's Refereed Journals and Conference Proceedings downloaded for the month of February 2006. Papers include "Blogging as Social Activity, or, Would You Let 900 Million People Read Your Diary?" by Bonnie A. Nardi, Diane J. Schiano, and Michelle Gumbrecht, "The Google File System," by Sanjay Ghemawat, Howard Gobioff, and Shun-Tak Leung, and "Low-cost Multi-touch Sensing Through Frustrated Total Internal Reflection," by Jefferson Y. Han.

Many people consider the contemporary time period the "era of computing." Indeed, technological advances in the computing field are leading in exciting new directions. It is their intention here to analyze the field of computing by examining computing research, in order to better understand where the field has been, and to consider where it may be going. The possibility of amalgamation among computing disciplines raises some potentially interesting questions. It is interesting to contrast the findings for the three disciplines. Computer science examines topics related to computer concepts at technical levels of analysis by formulating processes/methods/algorithms largely using mathematically based conceptual analysis; further, it does not rely on reference disciplines. Regarding any potential amalgamation of the fields, whether at the level of the discipline or of the institution, it is important that it be based on both mutual understanding and mutual acceptance. The research findings provide information to address such issues directly.

The article presents a list of papers, courses and magazines downloaded, in July 2005, from the Association of Computing Machinery's digital library. Some of the papers that were downloaded are: "Architectures for a Temporal Workflow Management System," by Carlo Combi, Giuseppe Pozzi and published in the March 2004 issue of the journal "Proceedings of the 2004 ACM Symposium on Applied Computing"; and "The Google File System," by Sanjay Ghemawat, Howard Gobioff and Shun-Tak Leung and published in the October 2003 issue of the journal "Proceedings of the 19th ACM Symposium on Operating Systems Principles." Some of the courses that were downloaded are: Introduction to the Java Programming Language; UML Fundamentals; Data Modeling; Beginning to Program With the Java Programming Language; Project Management: Initiation and Plan Launch; and Basic Programming in C.

This article investigates the current state of informatics higher education in Europe by utilizing the Informatics Europe Higher Education (IEHE) data portal. First, the article provides a detailed look at the IEHE data portal. Then the article provides a case study comparing informatics higher education at applied sciences universities compared to traditional research universities in five selected European countries using data providing in the portal.

The Dagstuhl Seminar on "Reproducibility of Data-Oriented Experiments in e-Science", held on 24-29 January 2016, focused on the core issues and approaches to reproducibility of experiments from a multidisciplinary point of view, sharing the experience coming from several fields of computer science. In this paper, we discuss, summarize, and adapt the main findings of the seminar to the context of IR evaluation -- both system-oriented and user-oriented -- in order to raise awareness in our community and stimulate the fields towards and increased reproducibility of our experiments. [ABSTRACT FROM AUTHOR]

The University of Jos conducted research on cybersecurity, proposing a proactive and adaptive approach to address evolving cyber-attack techniques and threats. The study highlighted the importance of a holistic cybersecurity service system model to combat the growing complexity of cyberattacks. The research emphasized the need for a responsive cybersecurity solution to ensure end-to-end security for organizations in cyberspace. [Extracted from the article]

Researchers at Chittagong University of Engineering and Technology have developed a new model for detecting eye blink artifacts in Electroencephalogram (EEG) signals. The model, which focuses on feature extraction from regenerated EEG segments (ReEEG) rather than decomposed Independent Components (ICs), showed superior performance in blink detection. Using Support Vector Machine (SVM) as a classifier, the ReEEG-based approach achieved higher accuracy, precision, recall, and f1 scores compared to the traditional IC-based method. This new model is expected to be beneficial for researchers working with EEG signals and eye blink artifacts. [Extracted from the article]

Researchers at Fiji National University have developed a machine learning mobile application to detect early cardiovascular disease (CVD) risk in Fiji. The application aims to address the lack of diagnostic tools in the country and help individuals know their risk levels. The study used a design science approach to create the application, which was found to be effective in predicting CVD risk in Fiji. This research contributes to advancing knowledge in cardiovascular diseases and conditions, offering a potential solution to improve early detection and prevention efforts in the region. [Extracted from the article]

A report from the University of Brasilia discusses the use of gamification in software development to improve software quality. The researchers developed a framework called GSA and conducted three action research cycles to test its effectiveness. The experimental study showed that gamification reduced the number of faults in requirements, although the results were inconclusive due to the projects being in their early stages and the COVID-19 pandemic. The researchers believe that the GSA framework has potential for replication in other companies and software quality improvement contexts. [Extracted from the article]

A recent study conducted by researchers at Washington State University highlights the importance of implantable devices in healthcare. These devices enable continuous monitoring, early disease detection, and informed decision-making, ultimately leading to improved patient care and quality of life. The study emphasizes the significance of material selection and manufacturing methods in the success of these devices, discussing advancements in biocompatibility, reliability, and functionality. It also explores various manufacturing techniques such as microfabrication, 3D printing, and nanofabrication. The study acknowledges challenges in the field, including biocompatibility concerns, privacy and data security issues, and regulatory hurdles. [Extracted from the article]

A new study from the University of Copenhagen in Denmark has developed a generic type system for higher-order PS-calculi. The research builds upon the Higher-Order Psi-calculus framework and presents a type system for termination in HO pi and a type system for non-interference for mobile code. The study has been peer-reviewed and offers new insights into the field of mathematics. For more information, readers can contact Hans Huttel at the University of Copenhagen. [Extracted from the article]