Manipulasi nude photography’’

Memadukan teknik pemotretan dan teknik pengolahan dengan menggunakan teknik cetak sandwich pada proses finishing menggunakan komputer dengan bantuan program photoshop . Pada saat pemotretan model dilakukan teknik pencahayaan dengan memakai satu dan dua lampu agar diperoleh hasil yang lebih dramatis. Ada karya yang hanya memakai satu lampu dan karya yang lain menggunakan dua lampu, sehingga terdapat variasi pada tata cahayanya. Dengan demikian, penggunaan satu dan dua lampu tersebut merupakan salah satu dalam proses perwujudan karya ini. Selain itu, mengingat karya ini menggunakan tubuh manusia sebagai objek penciptaan, maka fotografer harus juga mengarahkan model tersebut untuk berpose atau mengambil pose sesuai dengan maksud karya ini, sehingga diharapkan ia benar-benar mendukung ekspresi karya nude photography tersebut. Untuk pemotretan tektur dengan menggunakan pencahayaan day light. Arah sinar kebanyakan side light di sebabkan ingin memunculkan kontras dari tekstur tersebut. Pada karya ini menggambarkan tubuh wanita yang gelisah pada diri sehinga sampai merusak kulit tubuh yang indah pada jaman sekarang ini banyak orang-orang yang pada gelisah dengan diri nya, warna kuning yang bertesktur sama warna coklat pada bagian perut nampak kelihatan kontras. Tangan dengan ekspresinya membentuk karakter yang sagat kuwat, bagian dada bagian atas sebagai penyeimbang sehingga foto ini kelihatan padat

LORAWAN GATEWAY PLANNING USING AS923-2 FREQUENCY IN TASIKMALAYA FOR MONITORING ODC

This study aims to design a LoRaWAN network and find out how many gateways are needed to cover the research area and to design an IoT-based monitoring system for ODC devices on the FTTH network based on data at PT. Telkom Witel Tasikmalaya. The method used is a simulation using Atoll software version 3.40 and several calculation stages to predict the parameters of RSSI (Received Signal Strength Indicator) and SINR (Signal to Interference Noise Ratio) in a planning area of ​​358.66 km2. This study using AS923 frequency with a bandwidth of 125 kHz and a Spreading factor of 10. The results obtained are signal strength (RSSI) and signal quality (SINR) parameters. Based on the results of calculations and planning simulations, it produces 20 gateways using SF 10 with an RSSI parameter of -69.53 dBm and a SINR parameter of 20.21 dBm, each gateway can cover 4-5 km2 in the planning area

Uncooperative Congestion Control

Traditionally uncooperative rate control schemes have implied open loop protocols such as UDP, CBR, etc. In this paper we show that closed loop uncooperative rate control schemes also exist and that the current AQM proposals cannot efficiently control their mis-behavior. Moreover, these proposals require that AQM be installed at all routers in the Internet which is not only expensive but requires significant network upgrade

Complementarity Formulation for TCP/IP Networks: Uniqueness of Solution and Relation with Utility Optimization

One of the primary concerns for the network providers in designing or upgrading a network is deciding where to add capacity. This in turn requires uniquely identifying the congestion hot-spots. However, the current models for predicting network behavior are constrained by the fact that they require prior identification of the bottleneck, which is in direct contrast with the objective. In this paper we propose a Non-Linear Complementarity model for TCP/IP networks which can not only identify bottleneck links but also predict steady state link loss probabilities. We also show that full-row rank (where row represents number of links in the topology) of Incidence Matrix is a sufficient condition for all models to locate the bottleneck links. However, in this paper we show that bottleneck links can be uniquely identified with the Non-Linear Complementarity model without any regulations on the Incidence Matrix. Moreover in this paper we also show the relationship between the utility optimization, fixed-point approach and our proposed approach. Specifically we show how these models can be derived from each other

Comparative Study of TCP Compatible Binomial Congestion Control Schemes

Current TCP implementations employ Additive Increase Multiplicative Decrease (AIMD) as the congestion control mechanism. Recently, a new set of schemes called Binomial Congestion Control Schemes (BCCS) were proposed and a section of these schemes is TCP compliant. In this paper we evaluate the performance of these TCP compliant binomial schemes and show through simulations that AIMD performs better than the other BCCS policies in a wide range networking environments. Specifically, we study the performance of these schemes with respect to throughput, fairness, losses, timeouts and self-similarity. We show that the superior performance of AIMD can be attributed to its more conservative attitude in the presence of losses when it reduces its transmission rate much faster than the other schemes. This results in smaller congestion periods thereby reducing the losses and timeouts which in turn increases the throughput and decreases the degree of self-similarity of the traffic. We als