نتایج جستجو برای: search designs

تعداد نتایج: 361259  

Journal: :Australasian J. Combinatorics 1993
D. R. Breach

In a 4-(12, 6, 4) design a block is either disjoint from one other block or it has five points in common with one other block. For a 4-(12, 6, 4) design with a pair of blocks of the second type it is shown that· another thirty blocks of the design can be completed in a unique way and these thirty blocks contain a copy of a 3-(10, 4, 1) design.

2014
Thuy Ngoc Le Zhifeng Bao Tok Wang Ling

XML keyword search has attracted a lot of interests with typical search based on lowest common ancestor (LCA). However, in this paper, we show that meaningful answers can be found beyond LCA and should be independent from schema designs of the same data content. Therefore, we propose a new semantics, called CR (Common Relative), which not only can find more answers beyond LCA, but the returned ...

Journal: :journal of applied and computational mechanics 0
farid vakili tahami faculty of mechanical engineering, university of tabriz, tabriz, iran hasan biglari faculty of mechanical engineering, university of tabriz, tabriz, iran morteza raminnea faculty of mechanical engineering, university of tabriz, tabriz, iran

the harmony search algorithm is applied to optimum designs of a functionally graded (fg)-carbon naotubes (cnts)-reinforced pipes conveying fluid subjected to moving load. the structure is modeled by reddy cylindrical shell theory and the motion equations are derived by hamilton's principal. based on differential quadrature method (dqm), the dynamic displacement of system is derived. the le...

Journal: :J. Heuristics 2003
Fulya Altiparmak Berna Dengiz Alice E. Smith

In many computer communications network design problems, such as those faced by hospitals, universities, research centers, and water distribution systems, the topology is fixed because of geographical and physical constraints or the existence of an existing system. When the topology is known, a reasonable approach to design is to select components among discrete alternatives for links and nodes...

Journal: :Australasian J. Combinatorics 1997
Marc Gysin

D-optimal designs are n x n ±l-matrices where n == 2 mod 4 with maximum determinant. D-optimal designs obtained via circulant matrices are equivalent to 2-{ v; kl i k2 i k1 + k2 ~(v 1)} supplementary difference sets, where v = ~. We use cyclotomy to construct D-optimal designs, where v is a prime. We give a generalisation of cyclotomy and extend the cyclotomic techniques which enables use to fi...

Journal: :international journal of advanced design and manufacturing technology 0
zohreh alizadeh elizee abbas babazadeh sayed mohamad sayed hoseini zahra alizadeh elize

this paper defines how a meta heuristic search engine called p.s.o can be used to maximize the objective function of a logistic regression model, describing the relationship between the response variable (product designs' score) and a set of explanatory variables (product design factors). at the first phase the processed data, classified and categorized, by kansie engineering is used as input t...

Journal: :مهندسی سازه 0
احسان کریمی

optimization of structures for minimum weight has become important in the recent designs. in this study, a genetic optimization algorithm for weight minimization of steel frames has been used. the genetic algorithm is an optimization and search technique based on the principles of genetics and natural selection. constraints regarding material strength and serviceability are taken from “aisc cod...

2009
Laura C. DeBrock Krishnaprasad Thirunarayan

This paper describes the design and implementation of the VHDL-93 Hardware Description Browser, which is a tool for the intelligent retrieval of information from VHDL designs. The Browser consists of two UNIX processes: a TCL/TK Graphical User Interface and a Prolog search engine. The GUI elicits queries from the user and submits them to the Prolog search engine via a two-way communication pipe...

Journal: :J. Global Optimization 2005
Manuel Laguna Rafael Martí

Scatter search is an evolutionary method that, unlike genetic algorithms, operates on a small set of solutions and makes only limited use of randomization as a proxy for diversification when searching for a globally optimal solution. The scatter search framework is flexible, allowing the development of alternative implementations with varying degrees of sophistication. In this paper, we test th...

2010
Jennifer Tam Robert W. Reeder Stuart Schechter

Computer operating systems, and now websites that serve as application platforms, are increasingly adopting stricter application security models; they restrict the resources applications can access to those authorized by the user. Users are asked to authorize access to these resources either when the application is installed or when previously-unauthorized resources are required. For example, F...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید