Search

Researchers at the University of Pisa in Italy have developed an algorithm for coding an additive manufacturing file (AMF) to create custom orthopedic insoles using 3D printing technology. The algorithm uses a 3D model of the insole, pressure maps of the patient's feet, and information about the material stiffness to generate the AMF file. The resulting insoles can be customized to restore correct pressure distribution on the foot and can be easily integrated into orthopedic workshops. This method offers advantages over traditional milling machining approaches in terms of time, cost, and flexibility. [Extracted from the article]

A study conducted by the School of Computing Science and Engineering in Changsha, People's Republic of China, has proposed two ensemble models for kidney stone detection in CT images. The first model, StackedEnsembleNet, integrates predictions from four base models to improve accuracy and reliability. The second model, PSOWeightedAvgNet, uses the Particle Swarm Optimization algorithm to assign optimized weights to each model during the ensembling process. Experimental results demonstrate that both models outperform individual base models and offer a promising approach for accurate kidney stone detection. The study contributes to improved diagnosis and treatment outcomes in the field of nephrology. [Extracted from the article]

A recent study conducted at Guangzhou University in China has proposed a new method for detecting early-warning signals of influenza outbreaks. The researchers developed a novel approach using dysregulated dynamic network biomarkers (dysregulated DNBs) to identify these signals before symptoms appear. The study found that the dysregulated DNBs were anchored and few in number, making them essential for early diagnosis in clinical practice. The genes associated with dysregulated DNBs were also found to be significantly enriched in influenza-related pathways. The research was supported by the National Natural Science Foundation of China and has been peer-reviewed. [Extracted from the article]

A report from Changchun Normal University in Jilin, China discusses a study on the optimization of artemisinin, a medication used in malaria therapy. The study proposes an algorithm called the Artemisinin Optimization (AO) algorithm, which draws inspiration from the process of artemisinin therapy for malaria. The algorithm is tested on benchmark function sets and breast cancer pathology image segmentation applications, demonstrating its efficiency and potential in real-world optimization applications. The research concludes by providing access to the source codes for further exploration. [Extracted from the article]

The article looks at the role of 20th-century British computer scientist and mathematician Alan Turing in the development of the computer science field, comparing it to the role played by 19th-century German mathematician Carl Friedrich Gauss in the development of the field of mathematics, on an institutional and political level as well as through their specific intellectual achievements. It notes that Turing's work foreshadowed the multidisciplinary nature of computer science.

This article provides a comprehensive overview of the history of encryption, with a focus on the development of the Data Encryption Standard (DES) and its replacement by the Advanced Encryption Standard (AES). It discusses the efforts of individuals and organizations, such as IBM and the National Bureau of Standards (NBS), in creating encryption algorithms to protect communications and data. The article also mentions the controversy surrounding DES's vulnerability and the selection of Rijndael as the new AES. Additionally, it briefly touches on the encryption of transactions in early ATMs and the role of the NBS in regulating measures. This article is a valuable resource for library patrons conducting research on encryption and the history of ATMs. [Extracted from the article]

The article explores quantum computers, quantum computing and the need to prove the legitimacy of their results. The author notes that there is no way to test their algorithms on conventional computers for validation. The research of Anand Natarajan and John Wright, postdoctoral researchers at the California Institute of Technology (Caltech) is also examined.

A part of a series of four articles that examine the scientific output of different countries in biology, computer science and clean energy is presented. The U.S. leads in the scientific publications of research into clean and alternative energy, with 233,787 papers published from 2005 to 2009. Data from Elsevier's unit, SciVal Analytics showed that China is fast gaining on the U.S. when it comes to information technology publications.

We present the global deep video representation learning to video-based person reidentification (re-ID) that aggregates local 3-D features across the entire video extent. Existing methods typically extract frame-wise deep features from 2-D convolutional networks (ConvNets) which are pooled temporally to produce the video-level representations. However, 2-D ConvNets lose temporal priors immediately after the convolutions, and a separate temporal pooling is limited in capturing human motion in short sequences. In this paper, we present global video representation learning, to be complementary to 3-D ConvNets as a novel layer to capture the appearance and motion dynamics in full-length videos. Nevertheless, encoding each video frame in its entirety and computing aggregate global representations across all frames is tremendously challenging due to the occlusions and misalignments. To resolve this, our proposed network is further augmented with the 3-D part alignment to learn local features through the soft-attention module. These attended features are statistically aggregated to yield identity-discriminative representations. Our global 3-D features are demonstrated to achieve the state-of-the-art results on three benchmark data sets: MARS, Imagery Library for Intelligent Detection Systems-Video Re-identification, and PRID2011. [ABSTRACT FROM AUTHOR]

It is proved in this paper that the existence of suitable multiple Lyapunov functions is a necessary and sufficient condition for a discrete-time nonlinear switching system, with given switches digraph, to be globally asymptotically stable. The same result is provided for the input-to-state stability. The less is the number of edges in the switches digraph, the less is the number of inequalities that are involved in the provided necessary and sufficient Lyapunov conditions. [ABSTRACT FROM AUTHOR]

Purpose – Illustrate supported by Beer’s Viable System Model and four vignettes the relevance of self-organisation, recursive structures, self-reference and reflexivity in policy processes. The paper aims to discuss these issues. Design/methodology/approach – First, the concepts of self-organisation, recursive structures, self-reference and reflexivity are briefly discussed to ground policy processes in good cybernetics. Then, with the support of four vignettes, the idea of good cybernetics in policies processes is illustrated. Findings – The cybernetics of policy processes is often ignored. Research limitations/implications – If the purpose of this paper were to influence policy makers it would be necessary to further the empirical base of the four vignettes and clarify desirable forums to ground the relevance of self-organisation, recursive structures, self-reference and reflexivity in policy processes. Practical implications – Beer’s recursive structures, self-reference and reflexivity have much to contribute to the betterment of policy processes and the amelioration of the unbearable social and organisational costs of many current policies. Originality/value – The application of concepts such as self-organisation, recursive structures, self-reference and reflexivity adds to the understanding of policy processes. [ABSTRACT FROM AUTHOR]

Many methods for resolving collisions in hashing techniques have been proposed. They are classified into two main categories: open addressing and chaining. In this paper, other methods are presented that are intermediate between the two categories. The basic idea of our methods is the use of one or more predictors reserved per cell instead of a link field as in the chaining method. The predictors are used to maintain loose synonym chains. After describing the methods, the efficiencies are estimated theoretically and verified experimentally. In comparison with the chaining method, we prove that our methods significantly reduce the average number of probes necessary to retrieve a key without expending extra space. [ABSTRACT FROM AUTHOR]

System R, an experimental database system, was constructed to demonstrate that the usability advantages of the relational data model can be realized in a system with the complete function and high performance required for everyday production use. This paper describes the three principal phases of the System R project and discusses some of the lessons learned from System R about the design of relational systems and database systems in general. [ABSTRACT FROM AUTHOR]

This article focuses on a calendar of events related to computer science meetings. Impact of Computerization on Social Science Research to be held on 14-18 September 1981 in Grenoble, France; ASIS Annual Meeting to be held on 25-30 October 1981 in Washington D.C.; Workshop on Statistical Database Management to be held on 2-4 December 1981 in San Francisco Bay Area, California; Three sessions on Computer Modeling of Linguistic Theory in conjunction with the Annual Meeting of the Linguistic Society of America to be held in 28-30 December 1981 in New York City; AAAS Annual Meeting to be held on 3-8 January 1982 in Washington D.C.

The article presents information on recent developments related to the Association for Computing Machinery (ACM). The ACM Nominating Committee is preparing to nominate candidates for Regional Representatives to Council from the North Central, Northeast, Pacific, and South Central regions. The elected representatives--one from each region--will serve a three-year term effective July 1, 1981. Bernard A. Gailer, professor of Computer and Communication Sciences and Associate Director of the Computing Center at the University of Michigan, is this year's recipient of the ACM Distinguished Service Award, given to an individual each year in recognition of long-term service to the computing community and to ACM. Robert M. Metcalfe, President, 3Com Corp. of Menlo Park, California, is the recipient of the 1980 ACM Grace Murray Hopper Award, given to recognize computing achievements by persons before their 30th birthday. Joyce Currie Little has been elected chairman of the ACM Nominating Committee by its members for a one-year term ending June 30, 1981.

The article presents a list of open computer science meetings that are held on a not-for-profit basis. Some of the events included in the list are: "National Conference on Computer Related Crime," "Conference and Workshop on Model Acceptance," "Fifth Conference on Local Computer Networks," "1980 Annual Meeting and Conference of the Museum Computer Network," "Texas Association for Educational Data Systems 1980 Annual Convention," "Federal Office Automation Conference," "Computer Related Crime: Training Workshop for Prevention, Detection, Investigation, and Prosecution," "International Congress on Logic, Informatics, Law," "Twelfth Annual Pittsburgh Conference on Modeling and Simulation," "Seventh Conference of the Canadian Man-Computer Communications Society," "Conference on Human Aided Optimization," "4th Symposium on Computational Statistics," "National Artificial Intelligence Conference," "National Meeting of American Chemical Society," and "Data Processing in Chemistry."

This article presents a list of various upcoming events and conventions related to the field of computer science. Some of the events, listed here, are sponsored and cooperated by the Association for Computing Machinery. The convention titled "Computers in Cardiology" is reported to be held during September 26-28, 1979, in Geneva, Switzerland. The SIGUCC User Services Conference VII will, reportedly, be held in Los Angeles, California, during September 30-October 3, 1979. A symposium under the title "Dynamics and Modeling of Reactive Systems," reportedly, will be held at the University of Wisconsin in Madison, Wisconsin, during October 22-24, 1979. The Conference on Application Development Systems is scheduled to be held in Santa Clara, California, during March 9-11, 1980. The 5th Workshop on Computer Architecture for Non-Numeric Processing will be held in Pacific Grove, California, during March 11-14, 1980. The Symposium on Research and Development in Information Retrieval will be held in Cambridge, England, during June 23-27, 1980.

The article presents information on forthcoming events related to the field of computer science. The 17th Annual Southeast Regional ACM Conference will be held in Orlando, Florida on August 9-11, 1979. The 12th Annual Small College Computing Symposium will be held at Saint Cloud State University, Saint Cloud, Minnesota on April 20-21, 1979. The Association for Systems Management Annual Conference will be held in St. Louis, Missouri on April 25-28, 1979. The Symposium on Mathematical Programming with Data Perturbations will be held at George Washington University, Washington D.C. on May 24-25, 1979.

Hierarchical programming is being increasingly recognized as helpful in the construction of large programs. Users of hierarchical techniques claim or predict substantial increases in productivity and in the reliability of the programs produced. In this paper we describe a formal method for hierarchical program specification, implementation, and proof. We apply this method to a significant list processing problem and also discuss a number of extensions to current programming languages that ease hierarchical program design and proof. [ABSTRACT FROM AUTHOR]

A data abstraction can be naturally specified using algebraic axioms. The virtue of these axioms is that they permit a representation-independent formal specification of a data type. An example is given which shows how to employ algebraic axioms at successive levels of implementation. The major thrust of the paper is twofold. First, it is shown how the use of algebraic axiomatizations can simplify the process of proving the correctness of an implementation of an abstract data type. Second, semi-automatic tools are described which can be used both to automate such proofs of correctness and to derive an immediate implementation from the axioms. This implementation allows for limited testing of programs at design time, before a conventional implementation is accomplished. [ABSTRACT FROM AUTHOR]

The article presents information about some forthcoming conferences related to computers. Eleventh Annual Conference of the Association of Small Computer Users in Education will be held in Casper, Wyoming, during June 20-22, 1978. Regional Conference on Algebraic Complexity of Computation and Its Applications to Problems in Engineering and Computer Science will be held in Pittsburgh, Pennsylvania, during August 21-25, 1978. Third Symposium on Computational Statistics will be held in Leiden, Netherlands, during August 21-25, 1978. International Conference on Systems Science will be held in Wroclaw, Poland, during September 12-15, 2005. Eighth International Symposium on Fault-Tolerant Computing will be held in Toulouse, France, during June 21-23, 1978. International Conference on the Performance of Computer Installations will be held in Lake Garda, Italy, during June 22-23, 1978. International Conference on Management of Data will be held in Milan, Italy, during June 29-30, 1978. Fifth International Colloquium on Automata, Languages and Programming will be held in Udine, Italy, during July 18-22, 1978.

Recent curricular development in computer science together with student interest in pursuing topics in computer science beyond the usual programming courses have encouraged small liberal arts colleges to expand their offerings. This paper summarizes the results of a survey taken to determine the type of computer science programs being offered in these colleges. The results indicate that over half of these colleges either have no computer science program or offer only programming courses. [ABSTRACT FROM AUTHOR]

This article focuses on an article suggesting systematic discrimination against women and minorities published in February 1977 issue of the journal "Communications of the ACM." The first conclusion states that if women are to be represented in computer science graduate programs and faculties in proportion to their numbers in undergraduate school, then affirmative action programs must be undertaken. This conclusion contrasts starkly with the well-known fact, that most university departments have, under great pressure, been bending over backwards, often admitting women and minorities whose qualifications are probably lower than others. The second conclusion states that if the population of all potential employees is homogeneous in ability and qualification, then the data suggest discrimination in hiring. Moreover, the recruiting programs of so many commercial firms have been so intense that the university has slipped to among the least attractive of many alternatives.

The issue of program control structures has had a history of heated controversy. To put this issue on a solid footing, this paper reviews numerous theoretical results on control structures and explores their practical implications. The classic result of Böhm and Jacopini on the theoretical completeness of if-then-else and while-do is discussed. Several recent ideas on control structures are then explored. These include a review of various other control structures, results on time/space limitations, and theorems relating the relative power of control structures under several notions of equivalence. In conclusion, the impact of theoretical results on the practicing programmer and the importance of one-in, one-out control structures as operational abstractions are discussed. It is argued further that there is insufficient evidence to warrant more than if-then-else, while-do, and their variants. [ABSTRACT FROM AUTHOR]

A calendar of international events related to computing from March to November 1982 is presented. The First Association of Computing Machinery (ACM) Conference on Security, Audit and Control in Office Systems will be held in Saint Louis, Missouri. The Computer Network Performance Symposium will be held in Washington, D.C. The ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing will be held in Ottawa, Ontario.

The article presents news briefs related to computer science. A briefing on the formulation of information policy was held in November 1978. George R. Eggert has been elected 1979 International President of the Data Processing Management Association. A new subcommittee on Professionalism and Malpractice of Computer Specialists was formed by the Committee on Law Relating to Computers of the American Bar Association's Science and Technology Section.

The article presents information on technical program and sessions of the "25th Anniversary Conference" of the Association for Computing Machinery (ACM), which would be held in Boston, from August 14-16, 1972. John J. Donovan would hold Feature session on "Current Research in Computer Science." The following papers would be presented in the paper sessions: "Artificial Intelligence: Theoretical Papers," by George W. Ernst; "Artificial Intelligence: General Paper," by Thomas G. Evans; "Implementation of Medical Information Systems," by Lael Gatewood; "Computer Languages for Interactive Health Services," by Allan H. Levy; and others.

The article presents information about events related to the computer industry. The Association of Computing Machinery (ACM) European Chapters will hold the International Computing Symposium 1973 in Davos, Switzerland. The keynote address at the opening session on Tuesday morning at 9:30 a.m. will he given by ACM President Anthony Ralston. The Seventh Annual Symposium on the Interface between Computer Science and Statistics will be held at Iowa State University, Ames, Iowa, during October 18-19. The Second Annual Computer Science Conference, sponsored by many U.S. and Canadian universities and industrial organizations, will be held at the Detroit Hilton, Detroit, Michigan, during 12-14 February, 1974. The Peoples Republic of China will host a trade show of the U.S. computer products in Peking, during 18-27 September. The host organization will probably be the Import-Export Machine Corp., the Chinese organization responsible for importation of electronic machinery.

The article presents information about some forthcoming conferences related to the computer industry. The Third Technical Symposium of the Special Interest Group on Computer Science Education of the Association for Computing Machinery (ACM) will be held at the Niel House Hotel in Columbus, Ohio, during February 22-23, 1973. A conference on Principles of Programming Languages, sponsored jointly by the ACM Special Interest Group on Automata and Computability Theory and the ACM Special Interest Group for Programming Languages, will be held at the Copley Plaza Hotel in Boston, Massachusetts, during October 1-3, 1973. A conference on Cognitive Verfahren und Systeme (Artificial Intelligence) will be held in Hamburg, German Federal Republic, during April 11-13, 1973. The Annual Meeting of the American Society for Information Science will be held at the Hilton Hotel, Los Angeles, California, during October 21-25, 1973. The First Annual Symposium of the newly formed ACM Special Interest Group on Measurement and Evaluation will be held in Palo Alto, California, during February 26-28, 1973.

This paper discusses modularization as a mechanism for improving the flexibility and comprehensibility of a system while allowing the shortening of its development time. The effectiveness of a "modularization" is dependent upon the criteria used in dividing the system into modules. A system design problem is presented and both a conventional and unconventional decomposition are described. It is shown that the unconventional decompositions have distinct advantages for the goals outlined. The criteria used in arriving at the decompositions are discussed. The unconventional decomposition, if implemented with the conventional assumption that a module consists of one or more subroutines, will be less efficient in most cases. An alternative approach to implementation which does not have this effect is sketched. [ABSTRACT FROM AUTHOR]

A cellular array is a two-dimensional, checkerboard type interconnection of identical modules (or cells), where each cell contains a few hits of memory and a small amount of combinational logic, and communicates mainly with its immediate neighbors In the array. The chief computational advantage offered by cellular arrays is the improvement in speed achieved by virtue of the possibilities for parallel processing. In this paper it is shown that cellular arrays are inherently well suited for the solution of many graph problems. For example, the adjacency matrix of a graph is easily mapped onto an array; each matrix element is stored in one cell of the array, and typical row and column operations are readily implemented by simple cell logic. A major challenge in the effective use of cellular arrays for the solution of graph problems is the determination of algorithms that exploit the possibilities for parallelism, especially for problems whose solutions appear to be inherently serial. In particular, several parallelized algorithms are presented for the solution of certain spanning tree, distance, and path problems, with direct applications to wire routing, PERT chart analysis, and the analysis of many types of networks. These algorithms exhibit a computation time that in many cases grows at a rate not exceeding log2, n, where n is the number of nodes in the graph. Straight. forward cellular implementations of the well-known serial algorithms for these problems require about n steps, and noncellular implementations require from n2 to n3 steps. [ABSTRACT FROM AUTHOR]

Various kinds of interference between communicating parallel processes have been examined by Dijkstra, Knuth and others. Solutions have been given for the mutual exclusion problem and associated subproblems, in the form of parallel programs, and informal proofs of correctness have been given for these solutions. In this paper a system of parallel processes is regarded as a machine which proceeds from one state S (i.e. a collection of pertinent data values and process configurations) to a next state 5' in accordance with a transition rule S ⇒ S . A set of such rules yields sequences of states, which dictate the system's behavior. The mutual exclusion problem and the associated subproblems are formulated as questions of inclusion between sets of states, or of the existence of certain sequences. A mechanical proof procedure is shown, which will either verify (prove the correctness of) or discredit (prove the incorrectness of) an attempted solution, with respect to any of the interference properties. It is shown how to calculate transition rules from the "partial rules" by which the individual processes operate. The formation of partial rules and the calculation of transition rules are both applicable to hardware processes as well as to software processes, and symmetry between processes is not required. [ABSTRACT FROM AUTHOR]

This paper presents an approach to writing specifications for parts of software systems. The main goal is to provide specifications sufficiently precise and complete that other pieces of software can be written to interact with the piece specified without additional information. The secondary goal is to include in the specification no more information than necessary to meet the first goal. The technique is illustrated by means of a variety of examples from a tutorial system. [ABSTRACT FROM AUTHOR]

In this paper an attempt is made to explore the logical foundations of computer programming by use of techniques which were first applied in the study of geometry and have later been extended to other branches of mathematics. This involves the elucidation of sets of axioms and rules of inference which con be used in proofs of the properties of computer programs. Examples are given of such axioms and rules, and a formal proof of a simple theorem is displayed. Finally, it is argued that important advantages, both theoretical and practical, may follow from a pursuance of these topics. [ABSTRACT FROM AUTHOR]

CODAS, a Customer Oriented Data System, is a user-oriented data retrieval and display system. The command language of the system provides the user with an easy means for specifying data retrieval and display requests. Data is displayed as tables and graphs produced in a format ready for publication. In this paper the statements of the request language and the general system design are described. [ABSTRACT FROM AUTHOR]

In this general paper the role of programming in advanced graduate training is discussed. Subject matter related to programming as well as programming per se is considered. The importance and application of formalism are considered and also the need for good empirical experimentation. A brief outline for a sequence of courses is included, and subject headings that have been obtained from an extensive bibliography are given. A bibliography of programming references is included. [ABSTRACT FROM AUTHOR]

In the main text of the paper [Comm. ACM 9, 12 (Dec. 1966), 864], a FORMAC program was discussed which is capable of calculating various quantities of interest in tensor calculus. This Appendix is intended as an example of the program output. Christoffel symbols calculated for 12 bask orthogonal coordinate systems are listed. [ABSTRACT FROM AUTHOR]

Computer programming deals with an enormous variety of activities and is carried on by people with a great variety of backgrounds. It seems clear that part but not all of this activity h evolving toward a distinct professional field, but that the scope of this emerging profession, and some of its economic, social, and educational characteristics are as yet by no means well defined. In this paper, these issues are examined and some opinions about them are expressed. [ABSTRACT FROM AUTHOR]

The article offers news briefs on issues related to the Association for Computing Machinery (ACM) as of March 1972. Experts who attended a conference to review the report of the ACM Curriculum Committee for Computer Education for Management have agreed that ACM's proposed graduate curriculum programs in information systems are relevant to industry needs. The Columbia River Basin Chapter of the ACM has voted to disband since the chapter has been inactive.

This article presents information on the Association of Computing Machinery's 20th anniversary conference that will be held in Washington in September 2005. Jack Minker, chairman of the technical program committee, revealed that 58 papers had been selected and that the program would stress the historical theme of the meeting--"Past Is Prologue,"--through the scheduled 25 sessions. He noted that there would be 19 formal sessions in which the number of papers had been limited to permit greater discussion and in-depth analysis of the subject. Approximately 80 exhibit booths had been reserved by manufacturers of computer hardware and peripheral equipment as well as a number of the leading software firms. The firms--including IBM, Univac, Control Data, Honeywell, Computer Sciences Corp., Computer Usage and others--will display a number of new product applications at the meeting, it is understood. Of special interest to conferees will be two special presentations relating to the history of computer development.

The article explores Propositional Satisfiability (SAT), described by the authors as a cornerstone of computational complexity theory. Particular focus is given to how it has become a central target problem for solving hard computational problems in practice. Other topics discussed include how initial progress was made in SAT solving in the early 1990s and details on other eras of practical SAT solving.

The article discusses how there appears to be no clear connection between computer scientist Alan Turing's 1936 theories on the Universal Turing Machine (UTM) and the first stored-program electronic computers introduced in the mid-1940s. It notes that Turing's concepts of the Universal Machine were not designed to inform development of physical automatic calculating machines. Turnings relationship with mathematician John von Neumann is also covered.

The article discusses the Association for Computing Machinery, which was founded in 1947 to promote the sharing of research between computer scientists working in the United States. The association was founded after Howard Aiken from the Harvard Computational Laboratory organized a symposium to gather people who were interested in sharing their activities and knowledge about computer science. The popularity of the conference revealed that a method to promote robust communication in the field was required.

An introduction to an article in the journal about the Web debugging application known as BLeak is presented.

An introduction to an article published in the journal about the use of spatial computing in predicting floods is presented.

An introduction to an article published in the journal about the computer systems concept of pivot tracing.

Explicit Model Predictive Control (EMPC) produces control laws defined over a set of polyhedral regions in the state space, and the online computation of EMPC is to find the corresponding control law according to a given state by searching in a lookup table, called point location problem. This paper presents an approach of constructing a hybrid data structure called constructed k-d tree(CKDT), which combines the k-dimensional tree (k-d tree) with the binary search tree (BST) for point location in such polyhedral sets. To maintain a ‘full’ and balanced constructed tree the number of affine control laws is used as the basis for choosing the candidate hyperplanes (HPs) during the main construction process of CKDT, thus increasing offline efficiency by reducing the number of candidate HPs requiring computation. This methodology can be applied to the EMPC of high dimensional problems as the k-d tree – a main part of the CKDT approach - has already been successfully used to solve high dimensional problems in the field of computer science and engineering. The method involves a trade-off between memory storage requirement and online efficiency. A complexity analysis of the approach in the runtime and storage requirements is provided. The advantages of the method are supported by two examples in the paper. [ABSTRACT FROM AUTHOR]

Linear regression (LR) and some of its variants have been widely used for classification problems. Most of these methods assume that during the learning phase, the training samples can be exactly transformed into a strict binary label matrix, which has too little freedom to fit the labels adequately. To address this problem, in this paper, we propose a novel regularized label relaxation LR method, which has the following notable characteristics. First, the proposed method relaxes the strict binary label matrix into a slack variable matrix by introducing a nonnegative label relaxation matrix into LR, which provides more freedom to fit the labels and simultaneously enlarges the margins between different classes as much as possible. Second, the proposed method constructs the class compactness graph based on manifold learning and uses it as the regularization item to avoid the problem of overfitting. The class compactness graph is used to ensure that the samples sharing the same labels can be kept close after they are transformed. Two different algorithms, which are, respectively, based on \ell 2 -norm and \ell 2,1 -norm loss functions are devised. These two algorithms have compact closed-form solutions in each iteration so that they are easily implemented. Extensive experiments show that these two algorithms outperform the state-of-the-art algorithms in terms of the classification accuracy and running time. [ABSTRACT FROM AUTHOR]

The article focuses on a study on brain cancer, topics include the development of an ensemble deep learning technique for detecting MRI brain tumors, and a comparison of its accuracy with other machine learning models. It researchers from the Computer Science Department created an ensemble model that uses VGG-16, ResNet-50, and AlexNet models to classify MRI brain tumor images, achieving an accuracy of 99.16 present and significantly surpassing the accuracy of other methods.

In this paper, ASD is diagnosed using brain magnetic resonance imaging (MRI) enabled deep learning with a hybrid optimization algorithm." Keywords: Andhra Pradesh; India; Asia; Autism; Autism Spectrum Disorders; Developmental Disabilities; Developmental Diseases and Conditions; Health and Medicine; Mental Health; Neurology EN Andhra Pradesh India Asia Autism Autism Spectrum Disorders Developmental Disabilities Developmental Diseases and Conditions Health and Medicine Mental Health Neurology 260 260 1 07/17/23 20230721 NES 230721 2023 JUL 17 (NewsRx) -- By a News Reporter-Staff News Editor at Mental Health Weekly Digest -- Investigators publish new report on Developmental Diseases and Conditions - Autism Spectrum Disorders. [Extracted from the article]