scholarly journals MODY – calculation of ordered structures by symmetry-adapted functions

Open Physics ◽  
2016 ◽  
Vol 14 (1) ◽  
pp. 559-569 ◽  
Author(s):  
Franciszek Białas ◽  
Lucjan Pytlik ◽  
Wiesława Sikora
Keyword(s):  
Computer Program ◽  
Linear Combination ◽  
Ordered Structures ◽  
Different Types ◽  
Symmetry Adapted Functions ◽  
Structure Ordering

AbstractIn this paper we focus on the new version of computer program MODY for calculations of symmetryadapted functions based on the theory of groups and representations. The choice of such a functional frame of coordinates for description of ordered structures leads to a minimal number of parameters which must be used for presentation of such structures and investigations of their properties. The aim of this work is to find those parameters, which are coefficients of a linear combination of calculated functions, leading to construction of different types of structure ordering with a given symmetry. A spreadsheet script for simplification of this work has been created and attached to the program.

scholarly journals THE COMPARISON OF TREE QUALITIES

1965 ◽  
Vol 41 (2) ◽  
pp. 215-221
Author(s):  
P. L. Northcott
Keyword(s):  
Computer Program ◽  
Linear Combination ◽  
Digital Computer ◽  
Weighted Average ◽  
Statistical Procedure ◽  
Weighted Sum ◽  
Average Quality ◽  
The Individual

The need to compare individuals is discussed briefly. It is suggested that the composite quality of an individual is best defined as the weighted sum of a number of measurable characteristics of the individual. A statistical procedure for comparison of weighted average quality is derived from application of the principle of the linear combination of variables. A digital computer program is available.

scholarly journals Three-point linkage analysis in crosses of allogamous plant species

1998 ◽  
Vol 72 (2) ◽  
pp. 111-121 ◽  
Author(s):  
M. S. RIDOUT ◽  
S. TONG ◽  
C. J. VOWDEN ◽  
K. R. TOBUTT
Keyword(s):  
Linkage Analysis ◽  
Computer Program ◽  
Plant Species ◽  
General Type ◽  
Diploid Plant ◽  
Systematic Account ◽  
Alternative Approach ◽  
Different Types ◽  
The Many ◽  
Map Function

Ritter & Salamini (1996) presented a systematic account of two-point linkage analysis in allogamous diploid plant species. Vowden et al. (1995) described an alternative approach that is implemented in a computer program LINKEM. This paper describes how the latter approach has been extended to three-point linkage analysis, and implemented in a new program LINK3EM that is available from the authors. The essence of the approach is for the computer program to derive the appropriate form of analysis for a specific cross from its ‘knowledge’ of the most general type of cross that can arise. This avoids the need for programming specific codes for the many different types of cross that can arise. The program allows different locus orderings and parental phases to be compared. The Haldane or Kosambi map functions can be specified, although it is also possible to estimate all three pairwise recombination fractions without any assumed map function.

Cluster analyses of metal-organic fragments using the dSNAP software

2009 ◽  
Vol 65 (6) ◽  
pp. 707-714
Author(s):  
Anna Collins ◽  
Chick C. Wilson ◽  
Christopher J. Gilmore
Keyword(s):  
Metal Complex ◽  
Computer Program ◽  
Cambridge Structural Database ◽  
Clustering Method ◽  
Cluster Analyses ◽  
Organic Systems ◽  
Different Types ◽  
Metal Organic ◽  
Structural Database

The dSNAP computer program has been used to classify searches of the Cambridge Structural Database for two ligands: —O—CH2—CH2—O— and N(CH2CH2O—)3 commonly found in metal-organic systems. The clustering method used is based on total geometries (i.e. all the lengths and angles involving all the atoms in the search fragment, whether bonded or not) and proved capable of distinguishing in a wholly automatic, objective way between different types of metal complex purely on the basis of the geometry of the ligand and the relative positions of the O atoms to the metals.

SELF-PLAYING-BASED OPENING BOOK TUNING

2006 ◽  
Vol 02 (02) ◽  
pp. 183-194 ◽  
Author(s):  
JUN NAGASHIMA ◽  
TSUYOSHI HASHIMOTO ◽  
HIROYUKI IIDA
Keyword(s):  
Computer Program ◽  
The Self ◽  
Different Types ◽  
Strength Improvement

This paper proposes a method to tune an opening book based on self-playing games. In this method, many self-playing games are performed from various positions that are contained in the book. The book is well tuned for the target computer program that it may lure the opponent to play into its own hands. We produced some different types of books through the self-playing based tuning to perform a tournament. The tournament results indicate a remarkable playing strength improvement compared to the program with the original book. The proposed idea was implemented in our computer shogi program TACOS, which won the latest Computer Olympiad.

scholarly journals EXERCISE OF MACHINE LEARNING USING SOME PYTHON TOOLS AND TECHNIQUES

2018 ◽  
Vol 6 ◽  
pp. 1062-1070
Author(s):  
Ertan Mustafa Geldiev ◽  
Nayden Valkov Nenkov ◽  
Mariana Mateeva Petrova
Keyword(s):  
Machine Learning ◽  
Prediction Model ◽  
Computer Program ◽  
Predictive Analytics ◽  
Search Model ◽  
Accurate Model ◽  
Different Types ◽  
The Right ◽  
Tools And Techniques ◽  
Complex Computer

One of the goals of predictive analytics training using Python tools is to create a "Model" from classified examples that classifies new examples from a Dataset. The purpose of different strategies and experiments is to create a more accurate prediction model. The goals we set out in the study are to achieve successive steps to find an accurate model for a dataset and preserving it for its subsequent use using the python instruments. Once we have found the right model, we save it and load it later, to classify if we have "phishing" in our case. In the case that the path we reach to the discovery of the search model, we can ask ourselves how much we can automate everything and whether a computer program can be written to automatically go through the unified steps and to find the right model? Due to the fact that the steps for finding the exact model are often unified and repetitive for different types of data, we have offered a hypothetical algorithm that could write a complex computer program searching for a model, for example when we have a classification task. This algorithm is rather directional and does not claim to be all-encompassing. The research explores some features of Python Scientific Python Packages like Numpy, Pandas, Matplotlib, Scipy and scycit-learn to create a more accurate model. The Dataset used for the research was downloaded free from the UCI Machine Learning Repository (UCI Machine Learning Repository, 2017).

scholarly journals K-SVD: Dictionary Developing Algorithms for Sparse Representation of Signal

2019 ◽  
Vol 8 (3) ◽  
pp. 284-287
Keyword(s):  
Sparse Representation ◽  
Linear Combination ◽  
Different Types ◽  
Future Work

The sparse representation of signal is more interested in recent days. It contains overcomplete dictionaries that provides the signal atom. All signals of sparse explained with the help of linear combination of atom. Our proposed system mainly worked on different types of pursuit algorithm that decompose signal with respect to given dictionary D. In K-SVD algorithm description with the help of K-means algorithm. In analytical manner we developed all the algorithm with the help of calculation of dictionary D and it also apply to various method to get updated data. After correction of data we developed K-SVD algorithm which is adaptable. It also work in future work.

A Discussion of Objective Functions in Structure-Control Simultaneous Optimum Design

1993 ◽  
Author(s):  
Takuzo Iwatsubo ◽  
Shozo Kawamura ◽  
Kazuhiko Adachi
Keyword(s):  
Quadratic Form ◽  
Objective Function ◽  
Linear Combination ◽  
Cantilever Beam ◽  
Optimum Design ◽  
Feedback Gain ◽  
Objective Functions ◽  
Structure Control ◽  
Different Types ◽  
Control Objective

Abstract The effect of the objective functions on the results of the structure-control simultaneous optimum design is discussed, comparing the optimum designs obtained by minimizing several different types of objective functions. These objective functions are defined as a linear combination of the structural and the control objective functions. One of the objective functions is a structural weight, another is a feedback gain norm and the others are transient characteristics values which are expressed as the quadratic form. A flexible cantilever beam is designed in the numerical example, and the results indicate that the usefulness of the structure-control simultaneous optimum design depends on the objective function for the example.

scholarly journals Resource leveling in construction projects with activity splitting and resource constraints: a simulated annealing optimization

2019 ◽  
Vol 46 (2) ◽  
pp. 81-86 ◽  
Author(s):  
S. Madeh Piryonesi ◽  
Mehran Nasseri ◽  
Abdollah Ramezani
Keyword(s):  
Simulated Annealing ◽  
Resource Management ◽  
Computer Program ◽  
Resource Utilization ◽  
Construction Projects ◽  
Resource Constraints ◽  
Construction Project ◽  
Resource Leveling ◽  
Different Types ◽  
Management Techniques

Overtime and over-budget construction projects are not pleasant to any stakeholder. Stakeholders want construction projects to be completed without delay and excessive cost. It is possible to meet these objectives by using resource management techniques such as resource leveling. Due to the limitation of resources and different types of them in a construction project, optimizing the resource utilization is crucial. In this paper, a meta-heuristic simulated annealing resource leveling model is presented. The novelty of this model lies not only in the type of modeling and optimization but also in its assumptions. Our model simultaneously allows activities to split and considers a limitation in resource availabilities. The developed model was implemented in a computer program. Then, it was applied to an example from the literature of resource leveling. The model successfully solved the problem. The results of our model are compared with those already available in the literature.

Overlapping Rights

2017 ◽  
Author(s):  
Estelle Derclaye
Keyword(s):  
Intellectual Property ◽  
Computer Program ◽  
Single Type ◽  
Different Types ◽  
Artistic Work

Intellectual property (IP) overlaps can arise as a result of two or more different types of endeavor (eg, an artistic work created at the outset to be registered a trademark) or as a result of two or more IP rights protecting a single type of endeavor (eg, patent and copyright protecting the same computer program). This chapter categorizes and reviews the several IP overlaps that exist and the principles and rules that apply to them, mainly from a European (EU) perspective, with a comparative outlook where possible. It proposes solutions to the twin problems of regime clashes and overprotection that many overlaps pose, and concludes with a forecast for the direction of the topic.

The Effect of Locus of Control and Sequence Control on Computerized Information Retrieval and Retention

1989 ◽  
Vol 5 (4) ◽  
pp. 459-471 ◽  
Author(s):  
Susan H. Gray
Keyword(s):  
Information Retrieval ◽  
Locus Of Control ◽  
Computer Program ◽  
Grade Point Average ◽  
Grade Point ◽  
Correct Information ◽  
Different Types ◽  
Computer Based ◽  
Based Instruction ◽  
Student Control

This study contributes to the debate over how much control over instruction should be given to different types of learners and how much control should be left to the computer program in computer-based instruction. The effect of locus of control and student control over branching on ability to locate the answers contained in computer screens to a paper-and-pencil list of questions and the ability to retain learned information is explored. Student control conditions were branching for review only and total branching control to any topic in the sequence. Results using two-way analyses of variance indicated that students with high internality scores and computer sequence control over only review retrieved the most correct information. Students with control over only review retained the most correct information, regardless of locus of control scores. Students with higher internality scores also scored better on one of the software's two internal performance scores. Grade-point average was also positively correlated with accuracy of retrieval and retention.

Sign in / Sign up

Export Citation Format

Share Document