Academic literature on the topic 'Maximum Length Constraint'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Maximum Length Constraint.'
Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.
You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.
Journal articles on the topic "Maximum Length Constraint"
1
Rosnes, Eirik, and Øyvind Ytrehus. "On maximum length convolutional codes under a trellis complexity constraint." Journal of Complexity 20, no. 2-3 (2004): 372–403. http://dx.doi.org/10.1016/j.jco.2003.08.018.
Full text
2
Yanai, Toshimasa, and James G. Hay. "Combinations of Cycle Rate and Length for Minimizing the Muscle Power Requirement in Human Running." Journal of Applied Biomechanics 20, no. 1 (2004): 51–70. http://dx.doi.org/10.1123/jab.20.1.51.
Full textAbstract:
The purpose of this study was to test the hypothesis that, in human running at a given speed, runners select the combination of cycle rate (CR) and cycle length (CL) that minimizes the power generated by the muscles. A 2-D model of a runner consisting of a trunk and two legs was defined. A force actuator controlled the length of each leg, and a torque actuator controlled the amplitude and frequency of the backward and forward swing of each leg. The sum of the powers generated by the actuators was determined for a range of CRs at each of a series of speeds. The CR and CL vs. speed relationships selected for the model were derived from a series of CR and CL combinations that required the least power at each speed. Two constraints were imposed: the maximum amplitude of the forward and backward swing of the legs (±50°) and the minimum ground contact time needed to maintain steady-state running (0.12 sec). The CR vs. speed and CL vs. speed relationships derived on the basis of a minimum power strategy showed a pattern similar to those reported for longitudinal (within-subjects) analyses of human running. The anatomical constraint set a limit on the maximum CL attainable at a given speed, and the temporal constraint made CL decrease at high speeds. It was concluded that the process for selecting CL-CR combinations for human running has characteristics similar to the process for solving a constrained optimization problem.
3
Song, Xianmin, Pengfei Tao, Ligang Chen, and Dianhai Wang. "Offset Optimization Based on Queue Length Constraint for Saturated Arterial Intersections." Discrete Dynamics in Nature and Society 2012 (2012): 1–13. http://dx.doi.org/10.1155/2012/907639.
Full textAbstract:
Offset optimization is of critical importance to the traffic control system, especially when spillovers appear. In order to avoid vehicle queue spillovers, an arterial offset optimization model was presented in saturated arterial intersections based on minimizing the queue length over the whole duration of the saturated traffic environment. The paper uses the shockwave theory to analyze the queue evolution process of the intersection approach under the saturated traffic environment. Then through establishing and analyzing a function relationship between offset and the maximum queue length per cycle, a mapping model of offset and maximum queue length was established in the saturated condition. The validity and sensitivity of this model were tested by the VISSIM simulation environment. Finally, results showed that when volumes ratios are 0.525–0.6, adjusting offset reasonably under the saturated condition could decrease the queue length and effectively improve the vehicle operating efficiency.
4
Yun, Ruide, Yangsheng Zhu, Zhiwei Liu, Jianmei Huang, Xiaojun Yan, and Mingjing Qi. "An Electrostatic Self-Excited Resonator with Pre-Tension/Pre-Compression Constraint for Active Rotation Control." Micromachines 12, no. 6 (2021): 650. http://dx.doi.org/10.3390/mi12060650.
Full textAbstract:
We report a novel electrostatic self-excited resonator driven by DC voltage that achieves variable velocity-position characteristics via applying the pre-tension/pre-compression constraint. The resonator consists of a simply supported micro-beam, two plate electrodes, and two adjustable constraint bases, and it can be under pre-compression or pre-tension constraint by adjusting the distance L between two constraint bases (when beam length l > L, the resonator is under pre-compression and when l < L, it is under pre-tension). The oscillating velocity of the beam reaches the maximum value in the position around electrodes under the pre-compression constraint and reaches the maximum value in the middle position between two electrodes under the pre-tension condition. By changing the constraint of the microbeam, the position of the maximum velocity output of the oscillating beam can be controlled. The electrostatic self-excited resonator with a simple constraint structure under DC voltage has great potential in the field of propulsion of micro-robots, such as active rotation control of flapping wings.
5
Klimov, Aleksandr, Anton Gunbin, Dmitry Osipov, and Pavel Burdyak. "Method for calculating the maximum number of railway cars in a cut." MATEC Web of Conferences 216 (2018): 02011. http://dx.doi.org/10.1051/matecconf/201821602011.
Full textAbstract:
A shunting process in hump yards has a number of technical and technological constraints, one of which is the maximum permissible number of cars in a cut. This constraint increases the number of cuts, time of shunting, operating costs of car handling operations in a railways network, while reducing the safety level of classification. The purpose of the paper is to maximize the handling capacity of hump yards by reasonably increasing the permissible length of cuts. The current methods of calculation do not take into account some features of classification operations with long cuts of cars. The proposed method is based on probability calculations and simulation modeling of the shunting process in hump yards. The authors identified the critical factors limiting the maximum permissible number of cars in a cut and developed a method to determine this limitation.
6
Bergman, D., A. A. Cire, and W. Van Hoeve. "MDD Propagation for Sequence Constraints." Journal of Artificial Intelligence Research 50 (July 28, 2014): 697–722. http://dx.doi.org/10.1613/jair.4199.
Full textAbstract:
We study propagation for the Sequence constraint in the context of constraint programming based on limited-width MDDs. Our first contribution is proving that establishing MDD-consistency for Sequence is NP-hard. Yet, we also show that this task is fixed parameter tractable with respect to the length of the sub-sequences. In addition, we propose a partial filtering algorithm that relies on a specific decomposition of the constraint and a novel extension of MDD filtering to node domains. We experimentally evaluate the performance of our proposed filtering algorithm, and demonstrate that the strength of the MDD propagation increases as the maximum width is increased. In particular, MDD propagation can outperform conventional domain propagation for Sequence by reducing the search tree size and solving time by several orders of magnitude. Similar improvements are observed with respect to the current best MDD approach that applies the decomposition of Sequence into Among constraints.
7
Bethge, M., D. Rotermund, and K. Pawelzik. "Optimal Short-Term Population Coding: When Fisher Information Fails." Neural Computation 14, no. 10 (2002): 2317–51. http://dx.doi.org/10.1162/08997660260293247.
Full textAbstract:
Efficient coding has been proposed as a first principle explaining neuronal response properties in the central nervous system. The shape of optimal codes, however, strongly depends on the natural limitations of the particular physical system. Here we investigate how optimal neuronal encoding strategies are influenced by the finite number of neurons N (place constraint), the limited decoding time window length T (time constraint), the maximum neuronal firing rate fmax (power constraint), and the maximal average rate fmax (energy constraint). While Fisher information provides a general lower bound for the mean squared error of unbiased signal reconstruction, its use to characterize the coding precision is limited. Analyzing simple examples, we illustrate some typical pitfalls and thereby show that Fisher information provides a valid measure for the precision of a code only if the dynamic range (fmin T, fmax T) is sufficiently large. In particular, we demonstrate that the optimal width of gaussian tuning curves depends on the available decoding time T. Within the broader class of unimodal tuning functions, it turns out that the shape of a Fisher-optimal coding scheme is not unique. We solve this ambiguity by taking the minimum mean square error into account, which leads to flat tuning curves. The tuning width, however, remains to be determined by energy constraints rather than by the principle of efficient coding.
8
Kaznatcheev, Artem, David Cohen, and Peter Jeavons. "Representing Fitness Landscapes by Valued Constraints to Understand the Complexity of Local Search." Journal of Artificial Intelligence Research 69 (November 29, 2020): 1077–102. http://dx.doi.org/10.1613/jair.1.12156.
Full textAbstract:
Local search is widely used to solve combinatorial optimisation problems and to model biological evolution, but the performance of local search algorithms on different kinds of fitness landscapes is poorly understood. Here we consider how fitness landscapes can be represented using valued constraints, and investigate what the structure of such representations reveals about the complexity of local search.
 First, we show that for fitness landscapes representable by binary Boolean valued constraints there is a minimal necessary constraint graph that can be easily computed. Second, we consider landscapes as equivalent if they allow the same (improving) local search moves; we show that a minimal constraint graph still exists, but is NP-hard to compute.
 We then develop several techniques to bound the length of any sequence of local search moves. We show that such a bound can be obtained from the numerical values of the constraints in the representation, and show how this bound may be tightened by considering equivalent representations. In the binary Boolean case, we prove that a degree 2 or treestructured constraint graph gives a quadratic bound on the number of improving moves made by any local search; hence, any landscape that can be represented by such a model will be tractable for any form of local search.
 Finally, we build two families of examples to show that the conditions in our tractability results are essential. With domain size three, even just a path of binary constraints can model a landscape with an exponentially long sequence of improving moves. With a treewidth-two constraint graph, even with a maximum degree of three, binary Boolean constraints can model a landscape with an exponentially long sequence of improving moves.
9
Arora, H. D., and Anjali Dhiman. "Comparative Study of Generalized Quantitative-Qualitative Inaccuracy Fuzzy Measures for Noiseless Coding Theorem and 1:1 Codes." International Journal of Mathematics and Mathematical Sciences 2015 (2015): 1–6. http://dx.doi.org/10.1155/2015/258675.
Full textAbstract:
In coding theory, we study various properties of codes for application in data compression, cryptography, error correction, and network coding. The study of codes is introduced in Information Theory, electrical engineering, mathematics, and computer sciences for the transmission of data through reliable and efficient methods. We have to consider how coding of messages can be done efficiently so that the maximum number of messages can be sent over a noiseless channel in a given time. Thus, the minimum value of mean codeword length subject to a given constraint on codeword lengths has to be founded. In this paper, we have introduced mean codeword length of orderαand typeβfor 1:1 codes and analyzed the relationship between average codeword length and fuzzy information measures for binary 1:1 codes. Further, noiseless coding theorem associated with fuzzy information measure has been established.
10
Mu, Xiuping, and Qiong Wu. "Synthesis of a complete sagittal gait cycle for a five-link biped robot." Robotica 21, no. 5 (2003): 581–87. http://dx.doi.org/10.1017/s0263574702004903.
Full textAbstract:
This paper presents a method for synthesising the joint profiles for a planar five-link biped walking on flat ground. Both single support and double support phases are considered. The joint profiles have been determined based on constraint equations cast in terms of step length, step period, maximum step height and so on. A special constraint equation is developed to eliminate the destabilising effect of the impact (heel strike) occurring in the system. Other advantages of our joint profiles include system stability during the double support phase and repeatability of gait. The method of formulating compatible trajectories of the hip and swing limb is employed. We demonstrate the advantages of this method over the one of direct formulation of the joint profiles in that it not only significantly simplifies the problem by de-coupling the biped into three subsystems (a trunk and two lower limbs), but also allows the incorporation of certain constraints without drastically increasing the complexity of the constraint equations. The effectiveness of the proposed method is demonstrated using computer simulations. We believe that this research can provide a valuable tool for generating motion patterns of bipedal gait.
Dissertations / Theses on the topic "Maximum Length Constraint"
1
Xia, Jun. "STATISTICAL MODELS AND ANALYSIS OF GROWTH PROCESSES IN BIOLOGICAL TISSUE." 2016. http://scholarworks.gsu.edu/math_diss/39.
Full textAbstract:
The mechanisms that control growth processes in biology tissues have attracted continuous research interest despite their complexity. With the emergence of big data experimental approaches there is an urgent need to develop statistical and computational models to fit the experimental data and that can be used to make predictions to guide future research. In this work we apply statistical methods on growth process of different biological tissues, focusing on development of neuron dendrites and tumor cells.
We first examine the neuron cell growth process, which has implications in neural tissue regenerations, by using a computational model with uniform branching probability and a maximum overall length constraint. One crucial outcome is that we can relate the parameter fits from our model to real data from our experimental collaborators, in order to examine the usefulness of our model under different biological conditions. Our methods can now directly compare branching probabilities of different experimental conditions and provide confidence intervals for these population-level measures. In addition, we have obtained analytical results that show that the underlying probability distribution for this process follows a geometrical progression increase at nearby distances and an approximately geometrical series decrease for far away regions, which can be used to estimate the spatial location of the maximum of the probability distribution. This result is important, since we would expect maximum number of dendrites in this region; this estimate is related to the probability of success for finding a neural target at that distance during a blind search.
We then examined tumor growth processes which have similar evolutional evolution in the sense that they have an initial rapid growth that eventually becomes limited by the resource constraint. For the tumor cells evolution, we found an exponential growth model best describes the experimental data, based on the accuracy and robustness of models. Furthermore, we incorporated this growth rate model into logistic regression models that predict the growth rate of each patient with biomarkers; this formulation can be very useful for clinical trials. Overall, this study aimed to assess the molecular and clinic pathological determinants of breast cancer (BC) growth rate in vivo.
Book chapters on the topic "Maximum Length Constraint"
1
Eremeev, Anton V., Alexander V. Kelmanov, Artem V. Pyatkin, and Igor A. Ziegler. "On Finding Maximum Cardinality Subset of Vectors with a Constraint on Normalized Squared Length of Vectors Sum." In Lecture Notes in Computer Science. Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-73013-4_13.
Full text
2
Lin, Rung-Ren, Wen-Hsiung Kuo, and Kun-Mao Chao. "Finding a Length-Constrained Maximum-Density Path in a Tree." In Algorithms and Computation. Springer Berlin Heidelberg, 2003. http://dx.doi.org/10.1007/978-3-540-24587-2_10.
Full text
3
S., Shiyamala, Vijay Soorya J., Sanjay P. S., and Sathappan K. "Network-on-Chip for Low Power MAP Decoder Using Folded Technique and CORDIC Algorithm for 5G Network." In Design Methodologies and Tools for 5G Network Development and Application. IGI Global, 2021. http://dx.doi.org/10.4018/978-1-7998-4610-9.ch005.
Full textAbstract:
With different constraint length (K), time scale, and code rate, modified MAP (maximum a posteriori) decoder architecture using folding technique, which has a linear life time chart, is developed, and dedicated turbo codes will be placed in a network-on-chip for various wireless applications. Folded techniques mitigated the number of latches used in interleaving and deinterleaving unit by adopting forward and backward resource utilizing method to M-2, where M is the number of rows and end-to-end delay get reduced to 2M. By replacing conventional full adder by high speed adder using 2 x 1 multiplexer to calculate the forward state metrics and reverse state metrics will minimize the power consumption utilization in an effective manner. In s similar way, CORDIC (Coordinated ROtation DIgital Computer) algorithm is used to calculate the LLR value and confer a highly precise value with less computational complexity by means of only shifting and adding methods.
4
"Properties of Random Permutations with Constraints on the Maximum Cycle Length." In Progress in Pure and Applied Discrete Mathematics, Vol. 1: Probabilistic Methods in Discrete Mathematics. De Gruyter, 1993. http://dx.doi.org/10.1515/9783112318980-006.
Full text
5
Zribi, Amin, Sonia Zaibi, Ramesh Pyndiah, and Ammar Bouallègue. "Chase-Like Decoding of Arithmetic Codes with Applications." In Intelligent Computer Vision and Image Processing. IGI Global, 2013. http://dx.doi.org/10.4018/978-1-4666-3906-5.ch003.
Full textAbstract:
Motivated by recent results in Joint Source/Channel (JSC) coding and decoding, this paper addresses the problem of soft input decoding of Arithmetic Codes (AC). A new length-constrained scheme for JSC decoding of these codes is proposed based on the Maximum a posteriori (MAP) sequence estimation criterion. The new decoder, called Chase-like arithmetic decoder is supposed to know the source symbol sequence and the compressed bit-stream lengths. First, Packet Error Rates (PER) in the case of transmission on an Additive White Gaussian Noise (AWGN) channel are investigated. Compared to classical arithmetic decoding, the Chase-like decoder shows significant improvements. Results are provided for Chase-like decoding for image compression and transmission on an AWGN channel. Both lossy and lossless image compression schemes were studied. As a final application, the serial concatenation of an AC with a convolutional code was considered. Iterative decoding, performed between the two decoders showed substantial performance improvement through iterations.
6
Erman, Burak, and James E. Mark. "Overview and Some Fundamental Information." In Structures and Properties of Rubberlike Networks. Oxford University Press, 1997. http://dx.doi.org/10.1093/oso/9780195082371.003.0003.
Full textAbstract:
This chapter is a brief overview of the topics treated in the book. It is aimed, in particular, at providing some qualitative information on rubber elasticity theories and their relationships to experimental studies, and at putting this material into context. The following chapter describes in detail the classical theories of rubber elasticity, that is, the phantom and affine network theories. The network chains in the phantom model are assumed not to experience the effects of the surrounding chains and entanglements, and thus to move as “phantoms.” Although this seems to be a very severe approximation, many experimental results are not in startling disagreement with theories based on this highly idealized assumption. These theories associate the total Helmholtz free energy of a deformed network with the sum of the free energies of the individual chains—an important assumption adopted throughout the book. They treat the single chain in its maximum simplicity, as a Gaussian chain, which is a type of “structureless” chain (where the only chemical constitution specified is the number of bonds in the network chain). In this respect, the classical theories focus on ideal networks and, in fact, are also referred to as “kinetic” theories because of their resemblance to ideal gas theories. Chain flexibility and mobility are the essential features of these models, according to which the network chains can experience all possible conformations or spatial arrangements subject to the network’s connectivity. One of the predictions of the classical theories is that the elastic modulus of the network is independent of strain. This results from the assumption that only the entropy at the chain level contributes to the Helmholtz free energy. Experimental evidence, on the other hand, indicates that the modulus decreases significantly with increasing tension or compression, implicating interchain interactions, such as entanglements of some type or other. This has led to the more modern theories of rubber elasticity, such as the constrained-junction or the slip-link theories, which go beyond the single-chain length scale and introduce additional entropy to the Helmholtz free energy at the subchain level.
Conference papers on the topic "Maximum Length Constraint"
1
Novak, Jiri. "Influence of Constraint on JR Curves and on Maximum Load of Circumferentially Surface-Cracked Pipes." In ASME/JSME 2004 Pressure Vessels and Piping Conference. ASMEDC, 2004. http://dx.doi.org/10.1115/pvp2004-2726.
Full textAbstract:
Assessment of the maximum load of circumferentially surface-cracked pipes is usually performed on the basis of JR curves measured in experimental arrangement with high constraint of plastic flow in the crack tip region, i.e. on the basis of JR curves determined conservatively. For lowering the conservatism, it is necessary to use JR curve corresponding to conditions in the pipe. Correlation between JR curves and parameter B/√a is proposed; here B is biaxiality factor defined by Leevers and Radon and a is (initial) crack length. This parameter depends on geometry only and represents — up to a numerical factor — T-stress normalized by the stress intensity factor KI. Determination of the maximum load of circumferentially surface-cracked pipes is based on JR curves corresponding to the constraint in the pipe and on the Failure Assessment Diagram defined in the R6 method. Size of the effect depends on the pipe and crack geometry (including size) and on mechanical and fracture properties of the material (including constraint dependency of JR curves). Numerical examples use published data concerning properties of steels A533B and HY-100.
2
Codish, Michael, Michael Frank, and Vitaly Lagoon. "The DNA Word Design Problem: A New Constraint Model and New Results." In Twenty-Sixth International Joint Conference on Artificial Intelligence. International Joint Conferences on Artificial Intelligence Organization, 2017. http://dx.doi.org/10.24963/ijcai.2017/82.
Full textAbstract:
A fundamental problem in coding theory concerns the computation of the maximum cardinality of a set S of length n code words over an alphabet of size q, such that every pair of code words has Hamming distance at least d, and the set of additional constraints U on S is satisfied. This problem has application in several areas, one of which is the design of DNA codes where q=4 and the alphabet is {A,C,G,T}. We describe a new constraint model for this problem and demonstrate that it improves on previous solutions (computes better lower bounds) for various instances of the problem. Our approach is based on a clustering of DNA words into small sets of words. Solutions are then obtained as the union of such clusters. Our approach is SAT based: we specify constraints on clusters of DNA words and solve these using a Boolean satisfiability solver.
3
Pajaziti, Arbnor, Ismajl Gojani, Ahmet Shala, and Peter Kopacek. "Optimization of Biped Gait Synthesis Using Fuzzy Neural Network Controller." In ASME 2005 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. ASMEDC, 2005. http://dx.doi.org/10.1115/detc2005-84191.
Full textAbstract:
The Biped Robots have specific dynamical constraints and stability problems, which reduce significantly their motion range. In these conditions, path planning and tracking becomes very important. The joint profiles have been determined based on constraint equations cast in terms of step length and high, step period, maximum step height etc. In this paper Fuzzy Neural Network Controller for Path-Planning and Tracking on incline terrain (up stairs) of a planar five-link Biped Robot is presented. The locomotion control structure is based on integration of kinematics and dynamics model of Biped Robot. The proposed Control Scheme and Fuzzy Neural Algorithm could be useful for building an autonomous non-destructive testing system based on Biped Robot. Structure of Fuzzy Neural Network Controller is optimized using Genetic Algorithm. The effectiveness of the method is demonstrated by simulation example using Matlab software.
4
Trivedi, Deepak, Dustin Dienno, and Christopher D. Rahn. "Optimal, Model-Based Design of Soft Robotic Manipulators." In ASME 2007 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. ASMEDC, 2007. http://dx.doi.org/10.1115/detc2007-35612.
Full textAbstract:
Soft robotic manipulators, unlike their rigid-linked counterparts, deform continuously along their lengths similar to elephant trunks and octopus arms. Their excellent dexterity enables them to navigate through unstructured and cluttered environments and handle fragile objects using whole arm manipulation. Soft robotic manipulator design involves the specification of air muscle actuators and the number, length and configuration of sections that maximize dexterity and load capacity for a given maximum actuation pressure. This paper uses nonlinear models of the actuators and arm structure to optimally design soft robotic manipulators. The manipulator model is based on Cosserat rod theory, accounts for large curvatures, extensions, and shear strains, and is coupled to nonlinear Mooney-Rivlin actuator model. Given a dexterity constraint for each section, a genetic algorithm-based optimizer maximizes the arm load capacity by varying the actuator and section dimensions. The method generates design rules that simplify the optimization process. These rules are then applied to the design of pneumatically and hydraulically actuated soft robotic manipulators, using 100 psi and 1000 psi maximum pressure, respectively.
5
Weström, Jakob, Xiaolong Feng, Hans Andersson, and Stefan Lunderius. "Optimal Spring Balancing Cylinder Design of an Industrial Robot Using Multi-Disciplinary and Multi-Objective Optimization." In ASME 2012 11th Biennial Conference on Engineering Systems Design and Analysis. American Society of Mechanical Engineers, 2012. http://dx.doi.org/10.1115/esda2012-82252.
Full textAbstract:
This article presents an automated approach in optimal design of the spring balancing cylinder of an industrial robot using multi-disciplinary and multi-objective design optimization. Spring balancing cylinder is a mechanical device typically used in industrial robots of high load handling capacity. The objective of use of such device is to effectively balance one of main axes (typically axis-2) subject to the most severe gravitational torque. The spring balancing cylinder consists typically of multiple springs (two or three) co-axially installed inside the cylinder. Design of such balancing device involves about 16 design parameters, including both geometric parameters (free length, wire diameter, spring outer diameter, and number of turns) and parameters defining mounting positions of the device on a robot. Optimal design of such device is to achieve desired balancing, measured by maximum unbalanced static torque of the balanced axis, with minimum weight and volume of the cylinder. More desirably, the trade-off relationship between the maximum static torque measured by a balancing degree index and weight of the balancing cylinder is explored. Design of such balancing device is subject to a number of hard constraints defining fatigue lifetime of the springs and geometric interference between adjacent springs both in radial and axial directions. Solving of this design problem requires use of two different design tools. The first design tool is a robot static design tool. The entire robot statics is modeled. The maximum static torque of the balanced axis is calculated by finding the maximum value of static torques of the axis as function rotational angles of the axis within its limits. The maximum static torque is used as one of the design objectives. The second design tool is a detailed spring dimensioning tool. The overall spring constant and pre-loading force are determined subject to constraints of geometric and fatigue lifetime. The integration of the design tools is accomplished using a commercial software tool modeFrontier. This challenging design problem is formulated into an optimization problem of mixed design variables, multi-objective and multi-constraint nature and solved fully automatically using Multi-Objective Genetic Algorithm (MOGA) implemented in the modeFrontier modeling and optimization environment. The trade-off relationship between the balancing degree and the weight of the springs have been quantitatively explored. Even though some limitations of the developed methodology do exist and need further improvement, it is convinced that the developed approach is ready to be applied in industrial design practice.
6
Ma, D. D., G. D. Xia, W. Wang, X. F. Li, and Y. T. Jia. "Channel Size Optimization for 3D-IC Integrated Interlayer Microchannel Liquid Cooling." In ASME 2016 5th International Conference on Micro/Nanoscale Heat and Mass Transfer. American Society of Mechanical Engineers, 2016. http://dx.doi.org/10.1115/mnhmt2016-6478.
Full textAbstract:
3D-IC is getting increasingly attractive, as it improves speed and frequency, and reduces power consumption, noise and latency. However, three dimension (3D) integration technologies bring a new serious challenge to chip thermal management with the power density increased exponentially. Interlayer microchannel liquid cooling is thought as a promising and scalable solution for cooling high heat flux 3D-IC. In this paper, firstly channel number, channel width and height parameters of rectangular channel are optimized by the method of multi-objective parameter optimization under given overall size of 5mm in length and 5mm in width. The results show the total thermal resistances can reach very small under individual constraint condition of volume flow rates, but the pressure drop is too larger to accept. The minimum thermal resistance structure can be got by multi-objective optimization at various constraint conditions. It is found that the channel height and width increase with increasing of flow rates at pumping power less than 0.1W and pressure drop less than 20kPa. Secondly, the zigzag channels are designed on the basis of the optimized rectangular channel structure. The expansion and contraction ratio as an important parameter is optimized by numerical simulation. The thermal enhancement factor and Nusselt number measure the comprehensive performances of heat transfer. The results show heat transfer characteristic is enhanced with the decreasing of expansion and contraction ratio. Besides, the maximum junction temperature and maximum temperature difference are also reduced. 3D-IC with wave channel of β=3/7 is more promising for interlayer cooling.
7
Jain, Ankur, Syed Alam, Scott Pozder, and Robert E. Jones. "Thermal-Electrical Co-Optimization of Block-Level Floorplanning in 3D Integrated Circuits." In ASME 2009 InterPACK Conference collocated with the ASME 2009 Summer Heat Transfer Conference and the ASME 2009 3rd International Conference on Energy Sustainability. ASMEDC, 2009. http://dx.doi.org/10.1115/interpack2009-89017.
Full textAbstract:
While the stacking of multiple strata to produce 3D integrated circuits improves interconnect length and hence reduces power and latency, it also results in the exacerbation of the thermal management challenge due to the increased power density. There is a need for design tools to understand and optimize the trade-off between electrical and thermal design at the device and block level. This paper presents results from thermal-electrical co-optimization for block-level floorplanning in a multi-die 3D integrated circuit. A method for temperature computation based on linearity of the governing energy equation is presented. This method is shown to be faster and more accurate than previously used resistance-network based approaches and full-scale FEM simulations. This method is combined with previously reported electrical delay models for 3D ICs to simultaneously optimize both the maximum temperature and the interconnect length. Results outline the various trade-offs between thermal and electrical considerations. It is shown that co-optimization of thermal and electrical objectives results in a floorplan that is attractive from both perspectives. Constraints placed by the 3D IC manufacturing process on design are outlined, showing that the cheapest manufacturing options may not result in optimal electrical and thermal design. In particular, the wafer-on-wafer bonding process requires the two die to be identical, which results in a severe design constraint, particularly on the thermal goal due to the overlap of high power density blocks. Results presented in this work highlight the need for thermal and electrical co-design in multistrata microelectronics, and for reconciling manufacturing and design considerations in order to develop practical design tools for 3D integrated circuits.
8
Rosnes, E., and O. Ytrehus. "On trellis complexity constrained convolutional codes of maximum length." In IEEE International Symposium on Information Theory, 2003. Proceedings. IEEE, 2003. http://dx.doi.org/10.1109/isit.2003.1228292.
Full text
9
Hioe, Y., S. Kalyanam, G. Wilkowski, S. Pothana, and J. Martin. "Fracture Toughness Variation With Flaw Depth in Various Specimen Geometries and Role of Constraint in Material Fracture Resistance." In ASME 2017 Pressure Vessels and Piping Conference. American Society of Mechanical Engineers, 2017. http://dx.doi.org/10.1115/pvp2017-65441.
Full textAbstract:
A series of pipe tests with circumferential surface cracks has been conducted along with fracture toughness tests using single-edge notch tension (SENT) specimens having similar crack depths and crack orientations as the surface-cracked pipes. This paper presents observation of measured fracture toughness variation due to the crack depth and discusses the effect of constraint on the material resistance to fracture. Crack-tip-opening displacement (CTOD) measurements were obtained with the use of a dual clip-gauge mounted on both the SENT specimens and center of the surface-cracks in the pipes. CTOD was obtained at both the crack initiation and during the crack growth through the ligament. CTOD is a direct measure of the material toughness in the pipe and SENT tests. CTOD at crack initiation and during crack growth can also be related to the material J-Resistance (J-R) curve. Commonly, the material resistance is assumed to be the same for all circumferential surface-crack geometries in a surface-cracked pipe fracture mechanics analyses. However, based on experimental observations on a series of recently conducted surface-cracked pipe tests, the CTOD at the center of the surface crack at the start of ductile tearing and maximum moment changed with the depth of the surface crack. This is believed to be a constraint effect on plasticity in the ligament which depends on crack depth. The CTOD values at crack initiation were decreasing linearly with crack depth. This linear decrease in CTOD trend with flaw depth was also observed in SENT tests. More importantly, the decrease in CTOD with surface crack depth was significant enough that the failure mode changed from being limit-load to elastic-plastic fracture even in relatively small-diameter TP304 stainless steel pipe tests. This toughness drop explains why the Net-Section-Collapse (limit-load) analysis overpredicted the maximum moment for some crack geometries, and why the deeper surface cracks tore through the pipe thickness at moments below that predicted by the NSC analysis for a through-wall crack of the same circumferential length. An “Apparent NSC Analysis” was developed in a companion paper to account for the changing toughness with crack depth [1]. Finally, this same trend in decreasing toughness with flaw depth is apparent in surface-cracked flat plates [2] and axial surface flaws in pipes [3]. The leak-before-break behavior for axial surface cracks is also not explained by numerical calculations of the crack-driving force when assuming the toughness is constant for all surface cracks and the through-wall cracks, but the change in toughness with surface flaw depth explains this behavior. Previously, axial flaw empirical limit-load solution was developed by Maxey and Kiefner [4], and is consistent with the observations from this paper.
10
Sadeghi-Esfahlani, Shabnam, Hassan Shirvani, Sunday Nwaubani, and Ayoub Shirvani. "Design Attributes for Geometry Optimization Process of Thin Walled Honeycomb Structures." In ASME 2011 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. ASMEDC, 2011. http://dx.doi.org/10.1115/detc2011-47080.
Full textAbstract:
Thin walled cellular structures have the ability to absorb impact energy during crashing thus it is important to enhance the crashing efficiency and optimise the structural reliability. This paper discusses the honeycomb cell configuration optimization procedure. For the design optimization, the response surface method (RSM) is used to formulate the complex design where the energy absorption (EA) representing the structure’s ability of absorbing energy was selected as objective, the Y split side parting length w1, w2, and thickness T1 are defined as three design variables, and the maximum crushing force (Max.F) occurs as constraint. During this distinctive optimization, the (RSM) was combined with detailed geometrically simplified finite element (FE) model using ANSYS/LS-DYNA (pre-processor), LS-DYNA (solver) and LS-Opt (optimiser). RSM combined with (FE)model without user intervention, was the effective tool to optimize non-linear impacted cellular structures. Optimal design achieved through LS-OPT is compared to the validated results for accuracy and effectiveness.