Готові списки джерел за темами / STATIC CONSTRAINTS

Зміст

Статті в журналах
Дисертації
Книги
Частини книг
Тези доповідей конференцій
Звіти організацій

Добірка наукової літератури з теми "STATIC CONSTRAINTS"

Автор: Grafiati

Опубліковано: 11 вересня 2023

Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями

Оберіть тип джерела:

Ознайомтеся зі списками актуальних статей, книг, дисертацій, тез та інших наукових джерел на тему "STATIC CONSTRAINTS".

Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.

Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.

Статті в журналах з теми "STATIC CONSTRAINTS"

Eun, Hee-Chang, Eun-Taik Lee, and Heon-Soo Chung. "On the static analysis of constrained structural systems." Canadian Journal of Civil Engineering 31, no. 6 (December 1, 2004): 1119–22. http://dx.doi.org/10.1139/l04-036.

Повний текст джерела

Анотація:

Complete structures might contain so many degrees of freedom that it would be infeasible to perform a structural analysis. The derivation of the equilibrium equations of an entire structure to utilize kinematical compatibility conditions at the interfaces of the substructures requires complicated intermediate processes or numerical schemes for determining multipliers. This study derives an explicit matrix form of the equilibrium equations of structural systems subjected to constraints like compatibility conditions or linear displacement relations. The equation is obtained by minimizing a quadratic form of the variation in unconstrained and constrained displacements with respect to all constrained displacements that satisfy the constraints. And the physical meaning of the constraint forces required to satisfy the constraints is investigated. The validity of the proposed method is illustrated by several applications.Key words: constraints, compatibility, equilibrium equation, generalized inverse.

Стилі APA, Harvard, Vancouver, ISO та ін.

Mrzygłód, M. "Multi-constrained topology optimization using constant criterion surface algorithm." Bulletin of the Polish Academy of Sciences: Technical Sciences 60, no. 2 (October 1, 2012): 229–36. http://dx.doi.org/10.2478/v10175-012-0030-9.

Повний текст джерела

Анотація:

Abstract. This paper sets out to describe a multi-constrained approach to topology optimization of structures. In the optimization, a constant criterion surface algorithm and the multi-constraint procedure is used. The multi-constraint procedure consists of constraints normalization and equivalent design space assembling. The work is illustrated by an example of the L-shaped domain optimization with the horizontal line support and complex loads. The example takes into consideration stress, fatigue and compliance constraints. The separate and simultaneous application of constraints resulted in significant differences in structure topology layouts. The application of a fatigue constraint gave more conservative results when compared to static stress or compliance limitations. The multi-constrained approach allowed effectively lowering the mass of the structure while satisfying all constraints.

Стилі APA, Harvard, Vancouver, ISO та ін.

Christopher Cruz, Arnold, and Ahmad Bani Younes. "Common Frame Dynamics for Conically-Constrained Spacecraft Attitude Control." Sensors 22, no. 24 (December 19, 2022): 10003. http://dx.doi.org/10.3390/s222410003.

Повний текст джерела

Анотація:

Attitude control subjected to pointing constraints is a requirement for most spacecraft missions carrying sensitive on-board equipment. Pointing constraints can be divided into two categories: exclusion zones that are defined for sensitive equipment such as telescopes or cameras that can be damaged from celestial objects, and inclusion zones that are defined for communication hardware and solar arrays. This work derives common frame dynamics that are fully derived for Modified Rodrigues Parameters and introduced to an existing novel technique for constrained spacecraft attitude control, which uses a kinematic steering law and servo sub-system. Lyapunov methods are used to redevelop the steering law and servo sub-system in the common frame for the tracking problem for both static and dynamic conic constraints. A numerical example and comparison between the original frame and the common frame for the static constrained tracking problem are presented under both unbounded and limited torque capabilities. Monte Carlo simulations are performed to validate the convergence of the constrained tracking problem for static conic constraints under small perturbations of the initial conditions. The performance of dynamic conic constraints in the tracking problem is addressed and a numerical example is presented. The result of using common frame dynamics in the constrained problem shows decreased control effort required to rotate the spacecraft.

Стилі APA, Harvard, Vancouver, ISO та ін.

Gosain, Anjana, and Kavita Sachdeva. "Handling Constraints Using Penalty Functions in Materialized View Selection." International Journal of Natural Computing Research 8, no. 2 (April 2019): 1–17. http://dx.doi.org/10.4018/ijncr.2019040101.

Повний текст джерела

Анотація:

Materialized view selection (MVS) plays a vital role for efficiently making decisions in a data warehouse. This problem is NP-hard and constrained optimization problem. The authors have handled both the space and maintenance cost constraint using penalty functions. Three penalty function methods i.e. static, dynamic and adaptive penalty functions have been used for handling constraints and Backtracking Search Optimization algorithm (BSA) has been used for optimizing the total query processing cost. Experiments were conducted comparing the static, dynamic and adaptive penalty functions on varying the space constraint. The adaptive penalty function method yields the best results in terms of minimum query processing cost and achieves the optimality, scalability and feasibility of the problem on varying the lattice dimensions and on increasing the number of user queries. The authors proposed work has been compared with other evolutionary algorithms i.e. PSO and genetic algorithm and yields better results in terms of minimum total query processing cost of the materialized views.

Стилі APA, Harvard, Vancouver, ISO та ін.

SCHIEX, THOMAS, and GÉRARD VERFAILLIE. "NOGOOD RECORDING FOR STATIC AND DYNAMIC CONSTRAINT SATISFACTION PROBLEMS." International Journal on Artificial Intelligence Tools 03, no. 02 (June 1994): 187–207. http://dx.doi.org/10.1142/s0218213094000108.

Повний текст джерела

Анотація:

Many AI synthesis problems such as planning, scheduling or design may be encoded in a constraint satisfaction problems (CSP). A CSP is typically defined as the problem of finding any consistent labeling for a fixed set of variables satisfying all given constraints between these variables. However, for many real tasks, the set of constraints to consider may evolve because of the environment or because of user interactions. The notion of dynamic CSP (DCSP) [DD88] has been proposed to represent such evolutions. The problem we consider here is the solution maintenance problem in a DCSP. Naively applying usual satisfaction algorithms to this problem results in redundant search and inefficiency. A general approach to suppress redundancies in case of both restrictions and relaxations is to concisely represent the frontier of the solution space and justifications of this frontier in terms of set of constraints. This paper proposes a new class of constraint recording algorithms called nogood recording that may be used for solving both dynamic CSPs and usual CSP (called static CSPs here). It offers an interesting compromise, polynomially bounded in space, between an ATMS-like (Assumption-based Truth Maintenance System) approach, that would give a precise and exhaustive description of the frontier, and the usual constraint satisfaction algorithms (that discover a new frontier at each execution). We first introduce the principles used for nogood generation and then examine various recording schemes, on top of different tree search algorithms, characterizing the tradeoffs between the amount of recorded constraints and the pruning achieved. We then present experimental results and comparisons with various existing techniques for solving static or dynamic CSP.

Стилі APA, Harvard, Vancouver, ISO та ін.

Bernal, Dionisio, Martin D. Ulriksen, and Esmaeil Memarzadeh. "Static constraints in direct model updating." Mechanical Systems and Signal Processing 163 (January 2022): 108170. http://dx.doi.org/10.1016/j.ymssp.2021.108170.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Olender, Kurt M., and Leon J. Osterweil. "Interprocedural static analysis of sequencing constraints." ACM Transactions on Software Engineering and Methodology (TOSEM) 1, no. 1 (January 2, 1992): 21–52. http://dx.doi.org/10.1145/125489.122822.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Pan, Peng, Michael A. Peshkin, J. Edward Colgate, and Kevin M. Lynch. "Static Single-Arm Force Generation With Kinematic Constraints." Journal of Neurophysiology 93, no. 5 (May 2005): 2752–65. http://dx.doi.org/10.1152/jn.00799.2004.

Повний текст джерела

Анотація:

Smooth, frictionless, kinematic constraints on the motion of a grasped object reduce the motion freedoms at the hand, but add force freedoms, that is, force directions that do not affect the motion of the object. We are studying how subjects make use of these force freedoms in static and dynamic manipulation tasks. In this study, subjects were asked to use their right hand to hold stationary a manipulandum being pulled with constant force along a low-friction linear rail. To accomplish this task, subjects had to apply an equal and opposite force along the rail, but subjects were free to apply a force against the constraint, orthogonal to the pulling force. Although constraint forces increase the magnitude of the total force vector at the hand and have no effect on the task, we found that subjects applied significant constraint forces in a consistent manner dependent on the arm and constraint configurations. We show that these results can be interpreted in terms of an objective function describing how subjects choose a particular hand force from an infinite set of hand forces that accomplish the task. Without assuming any particular form for the objective function, the data show that its level sets are convex and scale invariant (i.e., the level set shapes are independent of the hand-force magnitude). We derive the level sets, or “isocost” contours, of subjects' objective functions directly from the experimental data.

Стилі APA, Harvard, Vancouver, ISO та ін.

Duan, Qingjuan, Quanli Zhao, and Tianle Wang. "Consistent Solution Strategy for Static Equilibrium Workspace and Trajectory Planning of Under-Constrained Cable-Driven Parallel and Planar Hybrid Robots." Machines 10, no. 10 (October 10, 2022): 920. http://dx.doi.org/10.3390/machines10100920.

Повний текст джерела

Анотація:

This paper presents a consistent solution strategy for static equilibrium workspaces of different types of under-constrained robots. Considering the constraint conditions of cable force and taking the least squares error of the static equilibrium equation as the objective, the convex optimization solution is carried out, and the static equilibrium working space of the under-constrained system is obtained. A consistent solution strategy is applied to solve the static equilibrium workspaces of the cable-driven parallel and planar hybrid robots. The dynamic models are presented and introducing parameters that are applied to make the system stable for point-to-point movements. Based on this model, the traditional polynomial-based point-to-point trajectory planning algorithm is improved by adding unconstrained parameters to the kinematic law function. The constraints of the dynamics model are incorporated into the trajectory planning process to achieve point-to-point trajectory planning for the under-constrained cable-driven robots. Finally, under-constrained cable-driven parallel robots with three cables and planar hybrid robot with two cables are taken as examples to carry out numerical simulation. The final results show that the point-to-point trajectory planning algorithm introducing parameters is effective and feasible and can provide theoretical guidance for the design of subsequent under-constrained robots.

Стилі APA, Harvard, Vancouver, ISO та ін.

Wang, Ren, Jingxiang Gao, Nanshan Zheng, Zengke Li, Yifei Yao, Long Zhao, and Yifan Wang. "Research on Accelerating Single-Frequency Precise Point Positioning Convergence with Atmospheric Constraint." Applied Sciences 9, no. 24 (December 10, 2019): 5407. http://dx.doi.org/10.3390/app9245407.

Повний текст джерела

Анотація:

An increasing number of researchers have conducted in-depth research on the advantages of low-cost single-frequency (SF) receivers, which can effectively use ionospheric information when compared to dual-frequency ionospheric-free combination. However, SF observations are bound to increase the unknown parameters and prolong the convergence time. It is desirable if the convergence time can be reduced by external information constraints, for example atmospheric constraints, which include ionosphere- or troposphere constraints. In this study, ionospheric delay constraints, tropospheric delay constraints, and their dual constraints were considered. Additionally, a total of 18,720 test experiments were performed. First, the nearest-neighbor extrapolation (NENE), bilinear- (BILI), bicubic- (BICU), and Junkins weighted-interpolation (JUNK) method of Global Ionospheric Map (GIM) grid products were analyzed. The statistically verified BILI in the percentage of convergence time, average convergence time, and computation time consumption of them shows a good advantage. Next, the influences of global troposphere- and ionosphere-constrained on the convergence time of SF Precise Point Positioning (PPP) were analyzed. It is verified that the ionosphere-constrained (TIC2) has significant influence on the convergence time in the horizontal and vertical components, while the troposphere-constrained (TIC1) has better effect on the convergence time in the vertical components within some thresholds. Of course, the dual constraint (TIC3) has the shortest average convergence time, which is at least 46.5% shorter in static mode and 5.4% in kinematic mode than standard SF PPP (TIC0).

Стилі APA, Harvard, Vancouver, ISO та ін.

Більше джерел

Дисертації з теми "STATIC CONSTRAINTS"

Marlowe, Laura C. "A Static Scheduler for critical timing constraints." Thesis, Monterey, California. Naval Postgraduate School, 1988. http://hdl.handle.net/10945/23406.

Повний текст джерела

Анотація:

Approved for public release; distribution is unlimited
The Computer Aided Prototyping System (CAPS) and the Prototype System Description Language (PSDL) represent a pioneering effort in the field of software development. The implementation of CAPS will enable software engineers to automatically validate design specifications and functional requirements early in the design of a software system through the development and execution of a prototype of the system under construction. Execution of the prototype is controlled by an Execution Support System (ESS) within the framework of CAPS. One of the critical elements of the ESS is the Static Scheduler which extracts critical timing constraints and precedence information about operators from the PSDL source that describes the prototype. The Static Scheduler then uses this information to determine whether a feasible schedule can be built, and if it can, constructs the schedule for operator execution within the prototype.
http://archive.org/details/staticschedulerf00marl
Lieutenant Commander, United States Navy

Стилі APA, Harvard, Vancouver, ISO та ін.

Bhavnagarwala, Azeez Jenúddin. "Voltage scaling constraints for static CMOS logic and memory cirucits." Diss., Georgia Institute of Technology, 2001. http://hdl.handle.net/1853/15401.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Abbas, Abdullah. "Static analysis of semantic web queries with ShEx schema constraints." Thesis, Université Grenoble Alpes (ComUE), 2017. http://www.theses.fr/2017GREAM064/document.

Повний текст джерела

Анотація:

La disponibilité de gros volumes de données structurées selon le modèle Resource Description Framework (RDF) est en constante augmentation. Cette situation implique un intérêt scientifique et un besoin important de rechercher de nouvelles méthodes d’analyse et de compilation de requêtes pour tirer le meilleur parti de l’extraction de données RDF. SPARQL est le plus utilisé et le mieux supporté des langages de requêtes sur des données RDF. En parallèle des langages de requêtes, les langages de définition de schéma d’expression de contraintes sur des jeux de données RDF ont également évolués. Les Shape Expressions (ShEx) sont de plus en plus utilisées pour valider des données RDF et pour indiquer les motifs de graphes attendus. Les schémas sont importants pour les tâches d’analyse statique telles que l’optimisation ou l’injection de requêtes. Notre intention est d’examiner les moyens et méthodologies d’analyse statique et d’optimisation de requêtes associés à des contraintes de schéma.Notre contribution se divise en deux grandes parties. Dans la première, nous considérons le problème de l’injection de requêtes SPARQL en présence de contraintes ShEx. Nous proposons une procédure rigoureuse et complète pour le problème de l’injection de requêtes avec ShEx, en prenant en charge plusieurs fragments de SPARQL. Plus particulièrement, notre procédure gère les patterns de requêtes OPTIONAL, qui s’avèrent former un important fonctionnalité à étudier avec les schémas. Nous fournissons ensuite les limites de complexité de notre problème en considération des fragments gérés. Nous proposons également une méthode alternative pour l’injection de requêtes SPARQL avec ShEx. Celle-ci réduit le problème à une satisfiabilité de Logique de Premier Ordre, qui permet de considérer une extension du fragment SPARQL traité par la première méthode. Il s’agit de la première étude traitant l’injection de requêtes SPARQL en présence de contraintes ShEx.Dans la seconde partie de nos contributions, nous proposons une méthode d’analyse pour optimiser l’évaluation de requêtes SPARQL groupées, sur des graphes RDF, en tirant avantage des contraintes ShEx. Notre optimisation s’appuie sur le calcul et l’assignation de rangs aux triple patterns d’une requête, permettant de déterminer leur ordre d’exécution. La présence de jointures intermédiaires entre ces patterns est la raison pour laquelle l’ordonnancement est important pour gagner en efficicacité. Nous définissons un ensemble de schémas ShEx bien- formulés, qui possède d’intéressantes caractéristiques pour l’optimisation de requêtes SPARQL. Nous développons ensuite notre méthode d’optimisation par l’exploitation d’informations extraites d’un schéma ShEx. Enfin, nous rendons compte des résultats des évaluations effectuées, montrant les avantages de l’application de notre optimisation face à l’état de l’art des systèmes d’évaluation de requêtes
Data structured in the Resource Description Framework (RDF) are increasingly available in large volumes. This leads to a major need and research interest in novel methods for query analysis and compilation for making the most of RDF data extraction. SPARQL is the widely used and well supported standard query language for RDF data. In parallel to query language evolutions, schema languages for expressing constraints on RDF datasets also evolve. Shape Expressions (ShEx) are increasingly used to validate RDF data, and to communicate expected graph patterns. Schemas in general are important for static analysis tasks such as query optimisation and containment. Our purpose is to investigate the means and methodologies for SPARQL query static analysis and optimisation in the presence of ShEx schema constraints.Our contribution is mainly divided into two parts. In the first part we consider the problem of SPARQL query containment in the presence of ShEx constraints. We propose a sound and complete procedure for the problem of containment with ShEx, considering several SPARQL fragments. Particularly our procedure considers OPTIONAL query patterns, that turns out to be an important feature to be studied with schemas. We provide complexity bounds for the containment problem with respect to the language fragments considered. We also propose alternative method for SPARQL query containment with ShEx by reduction into First Order Logic satisfiability, which allows for considering SPARQL fragment extension in comparison to the first method. This is the first work addressing SPARQL query containment in the presence of ShEx constraints.In the second part of our contribution we propose an analysis method to optimise the evaluation of conjunctive SPARQL queries, on RDF graphs, by taking advantage of ShEx constraints. The optimisation is based on computing and assigning ranks to query triple patterns, dictating their order of execution. The presence of intermediate joins between the query triple patterns is the reason why ordering is important in increasing efficiency. We define a set of well-formed ShEx schemas, that possess interesting characteristics for SPARQL query optimisation. We then develop our optimisation method by exploiting information extracted from a ShEx schema. We finally report on evaluation results performed showing the advantages of applying our optimisation on the top of an existing state-of-the-art query evaluation system

Стилі APA, Harvard, Vancouver, ISO та ін.

Grayland, Andrews. "Automated static symmetry breaking in constraint satisfaction problems." Thesis, University of St Andrews, 2011. http://hdl.handle.net/10023/1718.

Повний текст джерела

Анотація:

Variable symmetries in constraint satisfaction problems can be broken by adding lexicographic ordering constraints. Existing general methods of generating such sets of ordering constraints can produce a huge number of additional constraints. This adds an unacceptable overhead to the solving process. Methods exist by which this large set of constraints can be reduced to a much smaller set automatically, but their application is also prohibitively costly. In contrast, this thesis takes a bottom up approach to generating symmetry breaking constraints. This will involve examining some commonly-occurring families of mathematical groups and deriving a general formula to produce a minimal set of ordering constraints which are sufficient to break all of the symmetry that each group describes. In some cases it is known that there exists no manageable sized sets of constraints to break all symmetries. One example of this occurs with matrix row and column symmetries. In such cases, incomplete symmetry breaking has been used to great effect. Double lex is a commonly used incomplete symmetry breaking technique for row and column symmetries. This thesis also describes another similar method which compares favourably to double lex. The general formulae investigated are used as building blocks to generate small sets of ordering constraints for more complex groups, constructed by combining smaller groups. Through the utilisation of graph automorphism tools and the groups and permutations software GAP we provide a method of defining variable symmetries in a problem as a group. Where this group can be described as the product of smaller groups, with known general formulae, we can construct a minimal set of ordering constraints for that problem automatically. In summary, this thesis provides the theoretical background necessary to apply efficient static symmetry breaking to constraint satisfaction problems. It also goes further, describing how this process can be automated to remove the necessity of having an expert CP practitioner, thus opening the field to a larger number of potential users.

Стилі APA, Harvard, Vancouver, ISO та ін.

Niedert, Michael D. "Static-task scheduling incorporating precedence constraints and deadlines in a heterogeneous-computing environment." Thesis, Monterey, Calif. : Springfield, Va. : Naval Postgraduate School ; Available from National Technical Information Service, 2000. http://handle.dtic.mil/100.2/ADA380969.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Kafle, Bishoksan. "Modeling assembly program with constraints. A contribution to WCET problem." Master's thesis, Faculdade de Ciências e Tecnologia, 2012. http://hdl.handle.net/10362/7968.

Повний текст джерела

Анотація:

Dissertação para obtenção do Grau de Mestre em Lógica Computacional
Model checking with program slicing has been successfully applied to compute Worst Case Execution Time (WCET) of a program running in a given hardware. This method lacks path feasibility analysis and suffers from the following problems: The model checker (MC) explores exponential number of program paths irrespective of their feasibility. This limits the scalability of this method to multiple path programs. And the witness trace returned by the MC corresponding to WCET may not be feasible (executable). This may result in a solution which is not tight i.e., it overestimates the actual WCET. This thesis complements the above method with path feasibility analysis and addresses these problems. To achieve this: we first validate the witness trace returned by the MC and generate test data if it is executable. For this we generate constraints over a trace and solve a constraint satisfaction problem. Experiment shows that 33% of these traces (obtained while computing WCET on standard WCET benchmark programs) are infeasible. Second, we use constraint solving technique to compute approximate WCET solely based on the program (without taking into account the hardware characteristics), and suggest some feasible and probable worst case paths which can produce WCET. Each of these paths forms an input to the MC. The more precise WCET then can be computed on these paths using the above method. The maximum of all these is the WCET. In addition this, we provide a mechanism to compute an upper bound of over approximation for WCET computed using model checking method. This effort of combining constraint solving technique with model checking takes advantages of their strengths and makes WCET computation scalable and amenable to hardware changes. We use our technique to compute WCET on standard benchmark programs from M¨alardalen University and compare our results with results from model checking method.

Стилі APA, Harvard, Vancouver, ISO та ін.

Nelson, Andrew P. "Funqual: User-Defined, Statically-Checked Call Graph Constraints in C++." DigitalCommons@CalPoly, 2018. https://digitalcommons.calpoly.edu/theses/1848.

Повний текст джерела

Анотація:

Static analysis tools can aid programmers by reporting potential programming mistakes prior to the execution of a program. Funqual is a static analysis tool that reads C++17 code ``in the wild'' and checks that the function call graph follows a set of rules which can be defined by the user. This sort of analysis can help the programmer to avoid errors such as accidentally calling blocking functions in time-sensitive contexts or accidentally allocating memory in heap-sensitive environments. To accomplish this, we create a type system whereby functions can be given user-defined type qualifiers and where users can define their own restrictions on the call graph based on these type qualifiers. We demonstrate that this tool, when used with hand-crafted rules, can catch certain types of errors which commonly occur in the wild. We claim that this tool can be used in a production setting to catch certain kinds of errors in code before that code is even run.

Стилі APA, Harvard, Vancouver, ISO та ін.

Lu, Tingting. "Effects of Multimedia on Motivation, Learning and Performance: The Role of Prior Experience and Task Constraints." The Ohio State University, 2008. http://rave.ohiolink.edu/etdc/view?acc_num=osu1218660147.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Ungwattanapanit, Tanut [Verfasser], Horst [Akademischer Betreuer] Baier, Horst [Gutachter] Baier, and Kai-Uwe [Gutachter] Bletzinger. "Optimization of Steered-Fibers Composite Stiffened Panels including Postbuckling Constraints handled via Equivalent Static Loads / Tanut Ungwattanapanit ; Gutachter: Horst Baier, Kai-Uwe Bletzinger ; Betreuer: Horst Baier." München : Universitätsbibliothek der TU München, 2017. http://d-nb.info/1152384082/34.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Saglam, Hueseyin. "A toolkit for static analysis of constraint logic programs." Thesis, University of Bristol, 1998. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.262739.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Більше джерел

Книги з теми "STATIC CONSTRAINTS"

Marlowe, Laura C. A Static Scheduler for critical timing constraints. Monterey, Calif: Naval Postgraduate School, 1988.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Marriages & families: Changes, choices, and constraints. 7th ed. Upper Saddle River, N.J: Pearson/Prentice Hall, 2011.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Benokraitis, Nijole V. Marriages and families: Changes, choices, and constraints. 5th ed. Upper Saddle River, NJ: Pearson, 2003.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Marriages and families: Changes, choices, and constraints. 2nd ed. Upper Saddle River, N.J: Prentice Hall, 1996.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Marriages and families: Changes, choices and constraints. 3rd ed. Upper Saddle River, NJ: Prentice Hall, 1999.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Benokraitis, Nijole V. Marriages and families: Changes, choices, and constraints. Englewood Cliffs, N.J: Prentice Hall, 1993.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Benokraitis, Nijole V. Marriages and families: Changes, choices, and constraints. 6th ed. Upper Saddle River, N.J: Pearson Education, 2007.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Marriages and families: Changes, choices, and constraints. 4th ed. Upper Saddle River, N.J: Prentice Hall, 2002.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Sonority constraints on prosodic structure. New York: Garland Pub., 1994.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Tomkovicz, James J. Criminal procedure: Constitutional constraints upon investigation and proof. 7th ed. New Providence, NJ: LexisNexis, 2012.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Більше джерел

Частини книг з теми "STATIC CONSTRAINTS"

Bakhirkin, Alexey, and David Monniaux. "Extending Constraint-Only Representation of Polyhedra with Boolean Constraints." In Static Analysis, 127–45. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-99725-4_10.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Rehof, Jakob, and Torben Æ. Mogensen. "Tractable constraints in finite semilattices." In Static Analysis, 285–300. Berlin, Heidelberg: Springer Berlin Heidelberg, 1996. http://dx.doi.org/10.1007/3-540-61739-6_48.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

van Houtum, Geert-Jan, and Bram Kranenburg. "Static Repair Priorities." In Spare Parts Inventory Control under System Availability Constraints, 185–208. Boston, MA: Springer US, 2015. http://dx.doi.org/10.1007/978-1-4899-7609-3_8.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Jackson, Daniel. "Enforcing Design Constraints with Object Logic." In Static Analysis, 1–21. Berlin, Heidelberg: Springer Berlin Heidelberg, 2000. http://dx.doi.org/10.1007/978-3-540-45099-3_1.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Liu, Yanhong A., Ning Li, and Scott D. Stoller. "Solving Regular Tree Grammar Based Constraints." In Static Analysis, 213–33. Berlin, Heidelberg: Springer Berlin Heidelberg, 2001. http://dx.doi.org/10.1007/3-540-47764-0_13.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Glynn, Kevin, Peter J. Stuckey, and Martin Sulzmann. "Effective Strictness Analysis with HORN Constraints." In Static Analysis, 73–92. Berlin, Heidelberg: Springer Berlin Heidelberg, 2001. http://dx.doi.org/10.1007/3-540-47764-0_5.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Fähndrich, Manuel, and Alexander Aiken. "Program analysis using mixed term and set constraints." In Static Analysis, 114–26. Berlin, Heidelberg: Springer Berlin Heidelberg, 1997. http://dx.doi.org/10.1007/bfb0032737.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Wolper, Pierre, and Bernard Boigelot. "An automata-theoretic approach to Presburger arithmetic constraints." In Static Analysis, 21–32. Berlin, Heidelberg: Springer Berlin Heidelberg, 1995. http://dx.doi.org/10.1007/3-540-60360-3_30.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Larouci, C., J. P. Ferrieux, L. Gerbaud, and J. Roudet. "Optimization under Constraints of Static Converters." In Optimization and Inverse Problems in Electromagnetism, 295–302. Dordrecht: Springer Netherlands, 2003. http://dx.doi.org/10.1007/978-94-017-2494-4_30.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Ruggieri, Salvatore, and Fred Mesnard. "Typing Linear Constraints for Moding CLP( ${\cal R}$ ) Programs." In Static Analysis, 128–43. Berlin, Heidelberg: Springer Berlin Heidelberg, 2008. http://dx.doi.org/10.1007/978-3-540-69166-2_9.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Тези доповідей конференцій з теми "STATIC CONSTRAINTS"

Ferris, John B. "Capturing Planer Tire Enveloping Properties Using Static Constraint Modes." In ASME 2006 International Mechanical Engineering Congress and Exposition. ASMEDC, 2006. http://dx.doi.org/10.1115/imece2006-15260.

Повний текст джерела

Анотація:

This work establishes a new method for predicting the deformed shape of a tire with unilateral geometric constraints imposed by the road surface. Specifically, a method is developed for determining the static constraint mode that captures the planer enveloping properties of a tire for uneven road surfaces. This new method uses a recursive algorithm for determining which geometric constraints are active. A simple planer tire model, described by a linear ring on an elastic foundation, is used to demonstrate the method. The result of this method is a set of active geometric constraints on the tire and the static constraint modes that compose the deflection of the tire along its circumference. The success of the method is demonstrated by an example. This work forms the basis for developing nonlinear dynamic tire models that accurately account for active, unilateral, geometric constraints on the tire.

Стилі APA, Harvard, Vancouver, ISO та ін.

Held, Stephan, Dirk Muller, Daniel Rotter, Vera Traub, and Jens Vygen. "Global routing with inherent static timing constraints." In 2015 IEEE/ACM International Conference on Computer-Aided Design (ICCAD). IEEE, 2015. http://dx.doi.org/10.1109/iccad.2015.7372556.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Dsouza, Ashvin. "Static analysis of deadends in SVA constraints." In 2010 IEEE International High Level Design Validation and Test Workshop (HLDVT). IEEE, 2010. http://dx.doi.org/10.1109/hldvt.2010.5496656.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Ciraci, Selim, Pim van den Broek, and Mehmet Aksit. "Graph-based verification of static program constraints." In the 2010 ACM Symposium. New York, New York, USA: ACM Press, 2010. http://dx.doi.org/10.1145/1774088.1774561.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Huang, Shiqiang, Xiaoguang Gao, and Jia Ren. "Static Bayesian Network Parameter Learning Using Constraints." In 2011 International Workshop on Multi-Platform/Multi-Sensor Remote Sensing and Mapping (M2RSM). IEEE, 2011. http://dx.doi.org/10.1109/m2rsm.2011.5697401.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Bo, Yang, Chunhe Xia, Yang Luo, and Qing Tang. "Static Compliance Checking beyond Separation of Duty Constraints." In 2014 Ninth International Conference on P2P, Parallel, Grid, Cloud and Internet Computing (3PGCIC). IEEE, 2014. http://dx.doi.org/10.1109/3pgcic.2014.53.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Nadi, Sarah, Thorsten Berger, Christian Kästner, and Krzysztof Czarnecki. "Mining configuration constraints: static analyses and empirical results." In ICSE '14: 36th International Conference on Software Engineering. New York, NY, USA: ACM, 2014. http://dx.doi.org/10.1145/2568225.2568283.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Peng Pan, K. M. Lynch, M. A. Peshkin, and J. E. Colgate. "Static single-arm force generation with kinematic constraints." In IEEE International Conference on Robotics and Automation, 2004. Proceedings. ICRA '04. 2004. IEEE, 2004. http://dx.doi.org/10.1109/robot.2004.1307484.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Karpel, M., B. Moulin, and M. Love. "Modal-based structural optimization with static aeroelastic and stress constraints." In 37th Structure, Structural Dynamics and Materials Conference. Reston, Virigina: American Institute of Aeronautics and Astronautics, 1996. http://dx.doi.org/10.2514/6.1996-1479.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Derler, Patricia, and Stefan Resmerita. "Flexible Static Scheduling of Software with Logical Execution Time Constraints." In 2010 IEEE 10th International Conference on Computer and Information Technology (CIT). IEEE, 2010. http://dx.doi.org/10.1109/cit.2010.301.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Звіти організацій з теми "STATIC CONSTRAINTS"

Cusbert, Tom. The Effect of Credit Constraints on Housing Prices: (Further) Evidence from a Survey Experiment. Reserve Bank of Australia, January 2023. http://dx.doi.org/10.47688/rdp2023-01.

Повний текст джерела

Анотація:

The response of housing prices to financing conditions is determined by the effect on the marginal buyer, not the average household. I use heterogeneous willingness to pay (WTP) data from a stated preference experiment in Fuster and Zafar (2021) to estimate the effects of changes in mortgage rates and collateral constraints on housing prices by analysing the structure of housing demand curves. This work builds on their research, which focused on average changes in WTP. Relaxing down payment constraints has a large average effect on WTP, but the effect on price is less than half as large. Financially constrained households tend to respond more to relaxed constraints, but those households often have WTPs that are too low to affect market prices. Changing the mortgage rate has the same average effect on WTPs and on market prices, because there is no systematic relationship between a household's response to mortgage rates and their location on the demand curve. I use a heterogeneous user cost model of individual WTPs to understand how household heterogeneity determines the structure of overall housing demand. An empirical model using observable household characteristics allows the experimental findings to be applied to other household survey data to simulate the effects of credit conditions. The simulated effects of easing collateral constraints in Australia are fairly stable over the past 20 years, and show a similar pattern to the US results.

Стилі APA, Harvard, Vancouver, ISO та ін.

Mahmoudi, Mona, and Guillermo Sapiro. Constrained Localization in Static and Dynamic Sensor Networks (PREPRINT). Fort Belvoir, VA: Defense Technical Information Center, January 2006. http://dx.doi.org/10.21236/ada478415.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Woodford, Michael. Information-Constrained State-Dependent Pricing. Cambridge, MA: National Bureau of Economic Research, December 2008. http://dx.doi.org/10.3386/w14620.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Miller, Kyle, and Andrew Lohn. Onboard AI: Constraints and Limitations. Center for Security and Emerging Technology, August 2023. http://dx.doi.org/10.51593/2022ca008.

Повний текст джерела

Анотація:

Artificial intelligence that makes news headlines, such as ChatGPT, typically runs in well-maintained data centers with an abundant supply of compute and power. However, these resources are more limited on many systems in the real world, such as drones, satellites, or ground vehicles. As a result, the AI that can run onboard these devices will often be inferior to state of the art models. That can affect their usability and the need for additional safeguards in high-risk contexts. This issue brief contextualizes these challenges and provides policymakers with recommendations on how to engage with these technologies.

Стилі APA, Harvard, Vancouver, ISO та ін.

Vargas-Riaño, Carmiña Ofelia, and Julian Parra-Polania. Relevance of the collateral constraint form in the analysis of financial crisis interventions. Banco de la República, January 2022. http://dx.doi.org/10.32468/be.1190.

Повний текст джерела

Анотація:

We combine two modifications to the standard (current and total income) collateral constraint that has been commonly used in models that analyze financial crisis interventions. Specifically, we consider an alternative constraint stated in terms of future and disposable income. We find that in this case a state-contingent debt tax (effective during crisis only, as opposed to a macroprudential tax) increases debt capacity and lowers the probability of crisis. This shows one more instance to call the attention of academics and policymakers to the fact that the specific form of the borrowing constraint is crucial in determining the appropriate crisis intervention.

Стилі APA, Harvard, Vancouver, ISO та ін.

Minaburo, A., L. Toutain, and R. Andreasen. Static Context Header Compression (SCHC) for the Constrained Application Protocol (CoAP). RFC Editor, June 2021. http://dx.doi.org/10.17487/rfc8824.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Dayton, David C., Brian G. Southwell, and Vikram Rao. Diversifying Energy Options in a Carbon-Constrained World. RTI Press, October 2021. http://dx.doi.org/10.3768/rtipress.2021.rb.0029.2110.

Повний текст джерела

Анотація:

There is a critical need to reduce the static, calm the hype, and provide a realistic and complete presentation of facts to drive climate change mitigation decisions. Diversifying Energy Options in a Carbon-Constrained World is a new series to be published by RTI Press to provide a wide, cross-disciplinary discussion of carbon mitigation options and strategies to inform national and international research, scientific discussions, and policy debates.

Стилі APA, Harvard, Vancouver, ISO та ін.

Caporuscio, Florie A., Michael C. Cheshire, Dennis L. Newell, and Mary Kate McCarney. Status of LANL investigations of temperature constraints on clay in repository environments. Office of Scientific and Technical Information (OSTI), August 2012. http://dx.doi.org/10.2172/1049356.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Sassani, David, Laura Price, Ralph Rogers, Walter Walkow, Ava Johnson, and Amanda Sanchez. Update to Waste Form Performance Constraints and OWL Status and Inventory Content. Office of Scientific and Technical Information (OSTI), August 2017. http://dx.doi.org/10.2172/1762031.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Wilkowski, G. M., D. Rudland, P. Mincer, B. Metrovich, and D. Rider. ASME-PVP05 Brittle-to-Ductile Fracture Initiation Transition Temperature for Old Linepipe w Surface-Crack. Chantilly, Virginia: Pipeline Research Council International, Inc. (PRCI), January 2005. http://dx.doi.org/10.55274/r0011772.

Повний текст джерела

Анотація:

Much work has been done to assess constraint effects on the crack-driving force for specimens and cracks in pipes. The material's transition temperature where the fracture process changes from ductile tearing to cleavage fracture at crack initiation is affected by the constraint conditions but is a material property that cannot be determined analytically. This paper presents a methodology to account for constraint effects to predict the lowest temperature where ductile fracture initiation occurs and relates that temperature back to Charpy impact data for X60 and lower grades, particularly for older vintage linepipe materials. The method involves a series of transition temperature shifts to account for thickness effects, strain-rate effects, and constraint effects to give a master curve of transition temperatures from Charpy data to through-wall-cracked or surface-cracked pipes (with various a/t values) under quasi-static loading. These transition temperature shifts were based on hundreds of pipe tests and thousands of specimen tests over several decades of work by numerous investigators. This method is being validated by examining 1927 and 1948 vintage linepipe steels. In addition, data have been developed on the 1927 vintage pipe material to assess the effect of the bluntness of a corrosion flaw on the lowest temperature where ductile fracture will still initiate under quasi-static loading. An additional transition temperature shift occurs as a function of the bluntness of the flaw.

Стилі APA, Harvard, Vancouver, ISO та ін.

Ми пропонуємо знижки на всі преміум-плани для авторів, чиї праці увійшли до тематичних добірок літератури. Зв'яжіться з нами, щоб отримати унікальний промокод!