• Title/Summary/Keyword: Constraint Link

Search Result 125, Processing Time 0.023 seconds

A Study on Existing Rubber Elasticity Theories for Stress-Strain Behavior of Rubber-like Networks

  • Meissner, B.
    • Elastomers and Composites
    • /
    • v.38 no.2
    • /
    • pp.157-166
    • /
    • 2003
  • The Edwards-Vilgis slip-link theory and the Kaliske-Heinrich extended tube theory were tested experimentally using published experimental data on networks of natural and isoprene rubber and on polysiloxane networks. All parameters were adjusted to achieve an optimum fit. The data description obtained with the EV theory is not satisfactory and the parameter values tend to lie outside their reasonably expected range. But for the region of low strains, the Kaliske-Heinrich theory offers a satisfactorily accurate data description which is able to serve for practical purposes. Its crosslink term, however, is based on approximations which lead to a questionable prediction and values determined for the exponent in the entanglement term lie outside the range expected by the KH model. Thus, the title question cannot be given a positive answer. Conclusions published earlier that the trapped entanglements contribute both to the crosslink and constraint (entanglement) term are supported by the present data analysis. Experimental equibiaxial data on hydrocarbon networks do not show any maximum on their stretch ratio dependence, contrary to the predictions of molecular theories. The stretch ratio dependences of relative reduced stresses do not sensitively reflect differences in the chemical nature of the chain backbone (hydrocarbon vs. siloxane) and in the crosslinking method (end-linking vs. random crosslinking).

A Study on Stable Grasping Motion Control of Dual-Finger (듀얼-핑거의 안정적 파지 운동 제어에 관한 연구)

  • Um Hyuk;Choi Jong-Hwan;Kim Seung-Soo;Han Hyun-Yong;Yang Soon-Yong;Lee Jin-Gul
    • Transactions of the Korean Society of Machine Tool Engineers
    • /
    • v.14 no.4
    • /
    • pp.81-88
    • /
    • 2005
  • This paper attempts to derive the dynamic model of handling tasks in finger robot which grasps stable and manipulates a rigid object with some dexterity. Firstly, a set of differential equation describing dynamics of the manipulators and object together with geometric constraint of tight area-contacts is formulated by Lagrange's equation. Secondly, the roblems of controlling both the forces of pressing object and the rotation angle of the object under the geometric constraints are discussed. The effect of geometric constraints of area-contacts between the link's end-effector and the object is analyzed and the model based on the differential-algebraic equations is presented. In this paper, the control method for dynamic stable grasping and enhancing dexterity in manipulating things is proposed. It is illustrated by computer simulation and the experiment that the control system gives the performance improvement in the dynamic stable grasping and nimble manipulating of the dual fingers robot with soft tips.

Multiple Finger Expansion for Blind Interference Canceller in the Presence of Subchip-Spaced Multipath Components

  • Quek, Tony Q. S.;Suzuki, Hiroshi;Fukawa, Kazuhiko
    • Journal of Communications and Networks
    • /
    • v.6 no.1
    • /
    • pp.26-34
    • /
    • 2004
  • A blind interference canceller in the presence of subchipspaced multipath channels for direct-sequence code division multiple access (DS-CDMA) down-link system is considered. This technique is based on combining the existing blind interference canceller with a technique that involves assigning subchip-tap spacing to the Rake receiver. The proposed receiver minimizes the receiver’s output energy subject to a constraint in order to mitigate the multiple access interference (MAI) along each multipath component, and then suboptimally combining all the multipath components. Moreover, it is able to mitigate the mismatch problem when subchip-spaced multipath components arrive at the blind interference canceller. It is known that optimal combining techniques perform a decorrelation operation before combining, which requires both knowledge and computational complexity. In the following, we have adopted a simpler but suboptimum approach in the combining of the suppressed signals at the output of our proposed receiver. Computer simulation results verify the effectiveness of the proposed receiver to handle subchip-spaced multipath components and still suppresses MAI significantly.

Packet Output and Input Configuration in a Multicasting Session Using Network Coding

  • Marquez, Jose;Gutierrez, Ismael;Valle, Sebastian;Falco, Melanis
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.13 no.2
    • /
    • pp.686-710
    • /
    • 2019
  • This work proposes a model to solve the problem of Network Coding over a one-session multicast network. The model is based on a system of restrictions that defines the packet flows received in the sink nodes as functions of the outgoing flows from the source node. A multicast network graph is used to derive a directed labeled line graph (DLLG). The successive powers of the DLLG adjacency matrix to the convergence in the null matrix permits the construction of the jump matrix Source-Sinks. In its reduced form, this shows the dependency of the incoming flows in the sink nodes as a function of the outgoing flows in the source node. The emerging packets for each outgoing link from the source node are marked with a tag that is a linear combination of variables that corresponds to powers of two. Restrictions are built based on the dependence of the outgoing and incoming flows and the packet tags as variables. The linear independence of the incoming flows to the sink nodes is mandatory. The method is novel because the solution is independent of the Galois field size where the packet contents are defined.

An Efficient Channel Search Method for Transmitting Massive Multimedia Data (대용량 멀티미디어 데이터 전송을 위한 효율적인 채널 검색 방법)

  • Chung, Kyung Taek;Go, Sung Hyun
    • Smart Media Journal
    • /
    • v.9 no.4
    • /
    • pp.170-175
    • /
    • 2020
  • It is important to select the most appropriate channel for efficient transmission of massive multimedia data between smart devices in wireless sensor network. In the fixed channel method, sensor nodes can restrict usefulness of frequency and may be a major constraint to support frequency at various environments. In this paper, we propose a modified efficient channel search algorithm that determines available channel and tolerance of interference of links between two nodes. From the results of computer simulation, the proposed method shows that the link of channel can be set efficiently than the other methods even if the number of interference links increases and the beacon packet waiting time caused by interference is reduced remarkably.

Improvement on Coupling Technique Between COMSOL and PHREEQC for the Reactive Transport Simulation

  • Dong Hyuk Lee;Hong Jang;Hyun Ho Cho;Jeonghwan Hwang;Jung-Woo Kim
    • Journal of Nuclear Fuel Cycle and Waste Technology(JNFCWT)
    • /
    • v.21 no.1
    • /
    • pp.175-182
    • /
    • 2023
  • APro, a modularized process-based total system performance assessment framework, was developed at the Korea Atomic Energy Research Institute (KAERI) to simulate radionuclide transport considering coupled thermal-hydraulic-mechanical-chemical processes occurring in a geological disposal system. For reactive transport simulation considering geochemical reactions, COMSOL and PHREEQC are coupled with MATLAB in APro using an operator splitting scheme. Conventionally, coupling is performed within a MATLAB interface so that COMSOL stops the calculation to deliver the solution to PHREEQC and restarts to continue the simulation after receiving the solution from PHREEQC at every time step. This is inefficient when the solution is frequently interchanged because restarting the simulation in COMSOL requires an unnecessary setup process. To overcome this issue, a coupling scheme that calls PHREEQC inside COMSOL was developed. In this technique, PHREEQC is called through the "MATLAB function" feature, and PHREEQC results are updated using the COMSOL "Pointwise Constraint" feature. For the one-dimensional advection-reaction-dispersion problem, the proposed coupling technique was verified by comparison with the conventional coupling technique, and it improved the computation time for all test cases. Specifically, the more frequent the link between COMSOL and PHREEQC, the more pronounced was the performance improvement using the proposed technique.

Design of spectrum spreading technique applied to DVB-S2

  • Kim, Pan-Soo;Chang, Dae-Ig;Lee, Ho-Jin
    • Journal of Satellite, Information and Communications
    • /
    • v.2 no.2
    • /
    • pp.22-28
    • /
    • 2007
  • Spectrum spreading, in its general form, can be conceived as an artificial expansion of the signal bandwidth with respect to the minimum Nyquist band required to transmit the desired information. Spreading can be functional to several objectives, including resilience to interference and jammers and reduction of power spectral density levels. In the paper, signal spreading is manly used for increasing the received energy, thus satisfying link budget constraints, for terminals with low aperture antennas, without increasing the transmitted EIRP. As a matter of fact, in many mobile scenarios, even when MODCOD configurations with very low spectral efficiency (i.e. QPSK-1/4) in DVB-S2 standard, are used, the link budget cannot be closed. Spectrum spreading has been recently proposed as a technique to improve system performance without introducing additional MODCOD configurations under the constraint of fixed power spectrum density level at the transmitter side. To this aim, the design of spectrum spreading techniques shall keep into consideration requirements such as spectrum mask, physical layer performance, link budget, hardware reuse, robustness, complexity, and backward compliance with existing commercial equipments. The proposed implementation allows to fully reuse the standard DVB-S2 circuitry and is inserted as an 'inner layer' in the standard DVB-S2 chain.

  • PDF

A New Clock Routing Algorithm for High Performance ICs (고성능 집적회로 설계를 위한 새로운 클락 배선)

  • 유광기;정정화
    • Journal of the Korean Institute of Telematics and Electronics C
    • /
    • v.36C no.11
    • /
    • pp.64-74
    • /
    • 1999
  • A new clock skew optimization for clock routing using link-edge insertion is proposed in this paper. It satisfies the given skew bound and prevent the total wire length from increasing. As the clock skew is the major constraint for high speed synchronous ICs, it must be minimized in order to obtain high performance. But clock skew minimization can increase total wire length, therefore clock routing is performed within the given skew bound which can not induce the malfunction. Clock routing under the specified skew bound can decrease total wire length Not only total wire length and delay time minimization algorithm using merging point relocation method but also clock skew reduction algorithm using link-edge insertion technique between two nodes whose delay difference is large is proposed. The proposed algorithm construct a new clock routing topology which is generalized graph model while previous methods uses only tree-structured routing topology. A new cost function is designed in order to select two nodes which constitute link-edge. Using this cost function, delay difference or clock skew is reduced by connecting two nodes whose delay difference is large and distance difference is short. Furthermore, routing topology construction and wire sizing algorithm is developed to reduce clock delay. The proposed algorithm is implemented in C programming language. From the experimental results, we can get the delay reduction under the given skew bound.

  • PDF

Spectrum Hole Utilization in Cognitive Two-way Relaying Networks

  • Gao, Yuan;Zhu, Changping;Tang, Yibin
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.8 no.3
    • /
    • pp.890-910
    • /
    • 2014
  • This paper investigates the spectrum hole utilization of cooperative schemes for the two-way relaying model in order to improve the utilization efficiency of limited spectrum holes in cognitive radio networks with imperfect spectrum sensing. We propose two specific bidirectional secondary data transmission (BSDT) schemes with two-step and three-step two-way relaying models, i.e., two-BSDT and three-BSDT schemes, where the spectrum sensing and the secondary data transmission are jointly designed. In the proposed cooperative schemes, the best two-way relay channel between two secondary users is selected from a group of secondary users serving as cognitive relays and assists the bi-directional communication between the two secondary users without a direct link. The closed-form asymptotic expressions for outage probabilities of the two schemes are derived with a primary user protection constraint over Rayleigh fading channels. Based on the derived outage probabilities, the spectrum hole utilization is calculated to evaluate the percentage of spectrum holes used by the two secondary users for their successful information exchange without channel outage. Numerical results show that the spectrum hole utilization depends on the spectrum sensing overhead and the channel gain from a primary user to secondary users. Additionally, we compare the spectrum hole utilization of the two schemes as the varying of secondary signal to noise ratio, the number of cognitive relays, and symmetric and asymmetric channels.

A Novel Adaptive Routing Algorithm for Delay-Sensitive Service in Multihop LEO Satellite Network

  • Liu, Liang;Zhang, Tao;Lu, Yong
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.8
    • /
    • pp.3551-3567
    • /
    • 2016
  • The Low Earth Orbit satellite network has the unique characteristics of the non-uniform and time-variant traffic load distribution, which often causes severe link congestion and thus results in poor performance for delay-sensitive flows, especially when the network is heavily loaded. To solve this problem, a novel adaptive routing algorithm, referred to as the delay-oriented adaptive routing algorithm (DOAR), is proposed. Different from current reactive schemes, DOAR employs Destination-Sequenced Distance-Vector (DSDV) routing algorithm, which is a proactive scheme. DSDV is extended to a multipath QoS version to generate alternative routes in active with real-time delay metric, which leads to two significant advantages. First, the flows can be timely and accurately detected for route adjustment. Second, it enables fast, flexible, and optimized QoS matching between the alternative routes and adjustment requiring flows and meanwhile avoids delay growth caused by increased hop number and diffused congestion range. In addition, a retrospective route adjustment requesting scheme is designed in DOAR to enlarge the alternative routes set in the severe congestion state in a large area. Simulation result suggests that DOAR performs better than typical adaptive routing algorithms in terms of the throughput and the delay in a variety of traffic intensity.