feasible constraints 中文意思是什麼

feasible constraints 解釋
可行約束
  • feasible : adj. 1. 可實行的，行得通的。2. 可能（有）的，有理的。3. 可用的，適宜的。adv. -sibly ,-ness n.
  • constraints : 變動極限
  1. According to previous work suggesting that event interest, risk constraint, and financial constraint will affect potential attendees ’ desire to attend and their sense that it is feasible to attend, this paper makes use of the confirmatory study to establish the theory construct, and confirms it in the empirical study. the significance in theory and its implication for. 2008 beijing olympic games are proposed finally. main conclusions of this paper are : event interest and constraints fully mediated the effects of motives and background on respondents ’ sense that it was feasible for them to attend. financial constraint did affect desire to attend. the desire to socialize and eustress had direct and positive effects on interest in the event and the desire to attend the event. results suggest the value of segmented sport event marketing that appeals to both travel and fan motives. in the last, this paper, according to the results of this research and the holding experiences of the successive olympic games, from the angle of special tourism events marketing, puts forward some olympics tourism strategies, for example destination branding marketing strategy, and emphasizes some advertent problems in olympic tourism marketing works, aims to pose some rational propositions for the operation of olympics tourism marketing

    以往的研究表明事件吸引力、風險限制因素、財務限制因素都會影響潛在參與者渴望參與的程度以及對于參與可實行性的感知，基於此，本文採用驗證性研究方法，首先建立理論架構，然後在實證研究中加以驗證，並提出了研究的理論意義及對2008年北京奧運會的現實意義和啟示。本文得出的主要研究結論包括:事件吸引力和人們對于限制因素的感知程度作為中間變量完全削弱了旅遊動機和潛在參與者背景對于參與奧運會旅遊可實行性的影響;財務方面的限制因素會影響人們參與奧運會的渴望程度;渴望社交和追求勵志性對事件吸引力和人們渴望參與奧運會的程度有一個直接和積極的作用和影響。研究結果還表明作為奧運會舉辦方，應該認識到體育事件市場細分的重要性。
  2. To solve the inaccuracy problem caused by the two existing methods ( average end - area method and prismoidal method ) used for the calculation of roadway earthwork volume, this paper puts forward a new concept of the 3 - dimensional algorithm that takes all the roadway geometric design procedures as a kind of geometrical operation between the ground model ( original terrain model ) and the roadway model ( designed model ) under certain constraints, and then presents a complete 3 - dimensional algorithm of roadway earthwork volume as well as its executable computer program. the algorithm benefits from the re - triangulation technique of constrained delaunay triangulation ( cdt ), which can yield a true volume value theoretically. through a number of practical tests covering varied intervals between adjacent cross sections, it is proven to possess a higher accuracy compared with that of traditional methods. all the work involved in this paper indicates that the 3 - dimensional calculation of roadway earthwork volume is feasible, more accurate and should have further application in practice

    針對目前廣泛使用的道路土方量計算方法平均斷面法和稜柱體法計算不準確的缺點，提出了三維土方量計算演算法的概念.該演算法以帶約束的狄羅尼三角化（ cdt ）為技術核心，認為所有道路幾何設計過程都是地面模型和道路（設計）模型進行幾何運算的結果.基於此，本文設計出相應的演算法步驟，同時完成了相應的軟體開發，使得該三維演算法能和傳統的方法進行對比.此外，結合工程實例，採用了不同的道路橫斷面間距對三維計算方法和傳統方法的誤差進行比較、分析.結果證明三維演算法具有更好的精度，該演算法可用於道路、場地平整等工程土方量計算
  3. The method uses both linearly constraints and quadratic pattern constraints to control the beam pattern, which is used in arbitrary array synthesis. it is simple effective and feasible

    此演算法同時應用了線性約束和二次約束來控制波束特徵，適用於任意陣列的綜合，演算法簡單，計算效率高。
  4. Then we propose the problems that will be discussed in the following papers. also, we introduce the theory in the field of feasible region for semi - infinite programming, and concluded that in some area around the feasible points, feasible region can be expressed by finite inequality constraints, this results gives a base to the following algorithms

    接著介紹了半無限規劃可行域的結構和穩定點的穩定性，指出了關于可行域結構理論研究的現狀，並指出在一定的條件下，在可行點的局部鄰域內，可行域可以有有限個不等式約束來表示，這為第二、三章半無限規劃問題的演算法提供了理論基礎。
  5. Nonlinear programming which is considered to be recreation of the finite dimension optimization classical theory is a very important and active branch of opsearch. characteristic of nonlinear programming lies in : allowance of complex constraints on the optimization it studies, deep analysis of optimality and duality, emphasis on summarizing theorem and establishment of feasible algorithm

    非線性規劃是運籌學數學理論中特別重要而又活躍的一個分支，可認為它是有限維最優化經典理論的再創造，其特徵主要在於：所研究的最優化問題允許復雜的約束，對最優性、對偶性諸方面進行深入的分析，並強調進行理論概括和提出可行的演算法。
  6. Then with analysis of the quitting channel of vc in the present capital market of china. the paper points out that quitting obstacles has become the main factor that constraints the development of vc. the paper not only puts forward three creative quitting way, also, gives feasible proposal on construct effective quitting mechanism

    之後，對我國當前資本市場下的風險投資退出方式做出現實分析，指出退出不暢成為制約風險投資發展的主要因素，在此，提出管理層收購、風險投資項目內部組合、風險投資與上市公司戰略聯合三種創新退出方式，並對建立有效的退出機製作出可行性建議。
  7. By introducing the concepts of constraints measure and feasible degree, the extent to which the decision variables subject to the inequality constraints and equality constraints is described and then the self - adaptive penalty function is constructed, whose values are adaptively changed with the constraints feasible degree

    該策略通過引入約束可行測度、可行度等概念來描述決策變量服從于不等式約束和等式約束的程度，並以此構造處理約束條件的自適應懲罰函數，懲罰值隨著約束可行度的變化而動態自適應地改變。
  8. Realignment of existing hospital services is hardly feasible due to constraints imposed by the existing structural frame and infrastructural provisions of the buildings

    礙于現時威院的建築架構和醫院大樓的基礎設施所限，我們無法重整醫院現有服務。
  9. The character of the constraints ( i. e., the feasible domain of the constraints ) is analysed in this paper. an important conclusion is that the feasible domain of frequency constraints is no convex, while the others are convex. therefore, the frequency constraint is the key constraint for the existence of the solution

    對結構優化設計的約束的性質（即約束的可行域）進行了分析，得出了固頻約束的可行域是非凸集，其餘約束的可行域是凸集，固頻約束是決定優化解是否存在的關鍵約束等有益結論； 3
  10. This main study of paper centralizes on following aspect : 1. based on shortest path heuristic and greedy algorithms, using path similarity principle and genetic operations, provides a heuristic algorithms in finding multiple feasible paths for multiple constraints ( k - sph ). 2

    基於最短路徑（ sph ）和greedy演算法，使用路徑相似性原：理和遺傳演算法的變異操作，提出了尋找滿足1個或2個約束條件的多路徑啟發式演算法（稱為k - sph演算法） 。
分享友人
分享到 Line

分享到臉書