International Journal of New Practices in Management and Engineering
Not a member yet
136 research outputs found
Sort by
A Novel Channel Estimation Technique in MIMO-OFDM Mobile Communication Systems
4G Wireless communication systems have the inherent capability to foster the multimedia services in terms of bandwidth and data rate. These systems have very high integrity compared to the conventional wireless communication systems. It can fully support extended multimedia services with High Definition quality, audio and video files. Wireless internet and other broad band services provided superior quality signal transmission and reception. The degree of freedom enjoyed by the technology in terms of scalability and reliability is highly commendable. Any basic wireless transmitter sends information by varying the phase of the signal. In the receiver end, the desired signal can be decoded by appropriate decoding algorithm. The degradation occurs at the conventional receivers due to lack of Channel State Information. The efficiency of 4G system purely relies on the performance of receiver and is purely dependent on the synchronization of estimated instantaneous channel. In any wireless terminal, channel state information provides the in and around status of the channel. It provides the following parameters of the propagating signal (ie) Scattering, Fading and Attenuation. The dynamic estimation of channel state information can be obtained through Enhanced Least Squares channel estimation algorithm. It is based on Multi Carrier Filter Bank Transmission system. This kind of dynamic estimation can be done with a set of well-known sequence of coded unique bits .For a transmitter the information propagation is initiated in the form of frame bursts. It enhances the throughput of the system to the required level
Mining Of Deep Web Interfaces Using Multi Stage Web Crawler
As deep web develops at an exceptionally high speed, there has been expanded interest in procedures that help productively find deep-web interfaces. Nonetheless, because of the huge volume of web assets and the dynamic idea of deep web, accomplishing wide inclusion and high proficiency is a difficult issue. In this venture propose a three-stage framework, for proficient reaping deep web interfaces. In the main stage, web crawler performs website based looking for focus pages with the assistance of web indexes, trying not to visit an enormous number of pages. To accomplish more exact outcomes for an engaged slither, Web Crawler positions websites to organize profoundly applicable ones for a given subject. In the second stage the proposed framework opens the web pages inside in application with the assistance of Jsoup API and preprocess it. At that point it plays out the word include of inquiry in web pages. In the third stage the proposed framework performs recurrence investigation dependent on TF and IDF. It additionally utilizes a blend of TF*IDF for positioning web pages. To kill inclination on visiting some exceptionally applicable connections in shrouded web registries, In this paper we propose plan a connection tree information structure to accomplish more extensive inclusion for a website. Venture trial results on a bunch of delegate areas show the deftness and exactness of our proposed crawler framework, which proficiently recovers deep-web interfaces from enormous scope destinations and accomplishes higher reap rates than different crawlers utilizing gullible Bayes calculation
Void Node Detection and Packet Re-routing in Underwater Wireless Sensor Network
Underwater wireless sensor networks (UWSNs) have been appeared as an encouraging innovation to screen and investigate the seas in lieu of customary undersea wire line instruments. All things considered, the information social occasion of UWSNs is still seriously restricted in light of the acoustic channel correspondence attributes. One approach to improve the information assortment in UWSNs is through the plan of directing conventions thinking about the special attributes of the underwater acoustic correspondence and the exceptionally unique organization geography. In this paper, we propose the GEDAR steering convention for UWSNs. GEDAR is an anycast, geographic and deft steering convention that courses information parcels from sensor hubs to numerous sonobuoys (sinks) at the ocean's surface. At the point when the hub is in a correspondence void area, GEDAR changes to the recuperation mode strategy which depends on geography control through the profundity change of the void hubs, rather than the customary methodologies utilizing control messages to find and keep up steering ways along void locales. Reproduction results show that GEDAR altogether improves the organization execution when contrasted and the pattern arrangements, even in hard and troublesome versatile situations of inadequate and extremely thick networks and for high organization traffic loads
Scale Space Based Object-Oriented Shadow Detection and Removal from Urban High-Resolution Remote Sensing Images
This task mostly center to get the high resolution color remote sensing image, and furthermore attempted to eliminate the concealed district in the both metropolitan and country region. A portion of the current activities are included to recognize the concealed district and afterward dispense with that area, yet it has a few disadvantages. The discovery of the edges will be influenced generally by the utilization of the outside boundaries. The edge location cycle can be more useful in the recognition of the articles with the goal that the items can be utilized for additional handling. In this cycle we have execute the Scale Space algorithm is utilized to identify the shadow area and concentrate the component from the shadow district. Scale Space is least complex in area base image segmentation strategies. The idea of Scale Space algorithm is check the neighboring pixels of the underlying seed focuses. At that point decide if those neighboring pixels are added to the seed focuses or not. In the Scale Space limit algorithm Pixels are set in the area dependent on their properties or the properties of the close by pixel esteems. At that point the pixel containing the comparable properties is gathered and afterward the enormous quantities of pixels are circulated all through the image
Malware Detection Using Remedimorbus Application
As a huge number of new malware tests rise each day, traditional malware recognition strategies are not sufficient. Static examination strategies, for example, report signature, fail to recognize obscure projects. Dynamic examination techniques have low execution and over the top bogus positive charge. A discovery method that could adjust to the quickly changing malware condition is required. The paper introduced a spic and span malware identification approach the utilization of machine picking up information on. This paper proposes an answer where some of the gadget contemplating calculations are chosen. Utilizing the chose abilities, an incorporated methodology has been progressed with the picked calculations so the grouping and identification expense may improve contrasted with static and dynamic approach. The analyzed malwares equipped with various algorithms and capacities is utilized for higher order and discovery result. The final product got during utilizing calculations like Random woodland, Decision tree and Adaboost demonstrates a precision of 99.35% the use of the Random backwoods, 98.96% the use of Decision tree and 98.54% utilizing Adaboost. Looking at the static and dynamic strategy, this incorporated technique gives higher exactness
A Study on Single Valued Neutrosophic Graphs: Dominance
To create the single valued neutrosophic graph G=(A,B), we take a crisp graph G=(V,E) and replace its vertex and edge sets with single valued neutrosophic sets. The single valued neutrosophic graph G=(A,B) has a dominating set and dominant number, which we define in this work. We also note certain constraints on the dominating number of G=(A,B
Neural Network Based Hurdle Avoidance System for Smart Vehicles
The structure of a self-ruling vehicle dependent on neural sophisticated network for route in obscure condition is proposed. The vehicle is equipped with an IR sensor for obstacle separation estimation, a GPS collector for goal data and heading position, L298 H-connect for driving the engines which runs the wheels; all interfaced to a controller unit. The smaller scale controller forms the data gained from the sensor and GPS to produce robot movement through neural based network. The neural network running inside the small scale controller is a multi-layer feed-forward network with back-engendering blunder calculation. The network is prepared disconnected with tangent-sigmoid and positive direct estimate as enactment work for neurons and is executed progressively with piecewise straight guess of tangent-sigmoid capacity. The programming of the miniaturized scale controller is finished by PIC C Compiler and the neural network is actualized utilizing MATLAB programming. Results have shown that up to twenty neurons can be actualized in shrouded layer with this method. The vehicle is tried with differing goal places in open air situations containing fixed as well as moving obstructions and is found to arrive at the set targets effectively and its yield exactness is about equivalent to that of the normal precision
Enhanced QoS and QoE Support through Energy Efficient Handover Algorithm for UMTS Architectures
Spectrum inefficiency is a significant issue because of the increasingly more solicitation of transmission capacity by the end clients. Accomplishing high transmission rates and elevated levels of Quality of Service (QoS) speaks to in any case an open issue. Long haul Evolution (LTE) has been proposed as the reason for the fourth era versatile cell systems (4G) that points of the LTE standard are higher client bit rates, lower delays, expanded range proficiency, diminished expense, and operational effortlessness. In any case, this innovation is as yet being worked on and a few open issues must be still explored, for example, obstruction coordination, and power utilization, assets the board and handover procedures. The point of this work is to ensure the decrease of intensity utilization utilizing another handover calculation dependent on green arrangement. Also, the proposed conspire ensures the minimization of superfluous handovers. In any case, the issue in this technique is doesn't mulls over of the impact of green strategies in high force hubs. Along these lines, in the proposed framework the impact of high force hubs are thought of. This situation is expanded more than one full scale cell and various kinds of low force hubs, for example, pico-cell and microcells. In this situation, the force sparing is broke down during the handover strategies. Think about these issues; another strategy is proposed called Dynamic base Station arranging (DBSP) for accomplishing vitality productivity. The fundamental idea is to kill a BS individually that will insignificantly influence the system by utilizing a recently presented thought of system sway, which considers the extra burden increases brought to its neighboring BSs. So as to additionally diminish the flagging and execution overhead over the air and back take, utilize the estimated estimations of system sway as their choice measurements. A trial result shows that the proposed strategy accomplishes high vitality proficiency under different situations. In this work the presentation of an UMTS organize situation is assessed by utilizing different estimations of the priority bits of the CBR application
Hybrid Design and RF Planning for 4G networks using Cell Prioritization Scheme
This article includes hands-on recreation practice on arranging of RF connect with the assistance of Atoll arranging programming device. The primary goal of this task is to structure and plan a RF coordinate with obstruction free correspondence, Optimum inclusion, no forgot about zone in the arranged inclusion guide and extension and reuse of site recurrence &network structure. Using the accessible restricted data transfer capacity vitally in order to take into account millions out of an immense zone with great quality, inclusion, and without obstruction utilizing ATOLL arranging device. Insightful re-utilization of site area later on organize structure will set aside cash for the administrator. Handover component is critical in cell arrange in light of the cell engineering utilized to expand range usage. One approach to improve the phone organize execution is to utilize productive handover prioritization plans, which have a typical trademark lessening the call dropping likelihood to the detriment of expanded call blocking likelihood. Effective prioritization conspire obliges various new calls while ensures the nature of administration (QOS) of Hand over call. This thought depends on the neighboring cells have a covering (the territory served by more than one cell) inclusion zone. Moreover cell cover and burden adjusting plan is proposed to improve the GSM cell limit utilizing a Software advancement pack (SDK). Limit improvement is accomplished by adjusting the heap in neighboring cell prioritization plans when client is exchanging between the cells
Watermark Decoding Technique using Machine Learning for Intellectual Property Protection
The Watermarking is an Intellectual Property (IP) Protection method. It can ensure Field-Programmable Gate Array (FPGA) IPs from encroachment. The IP security of equipment and programming structures is the most significant prerequisite for some FPGA licensed innovation merchants. Advanced watermarking has become a creative innovation for IP assurance as of late. This paper proposes the Publicly Verifiable Watermarking plan for licensed innovation insurance in FPGA structure. The Zero-Knowledge Verification Protocol and Data Matrix strategy are utilized in this watermarking location method. The time stepping is likewise utilized with the zero-information check convention and it can versatility oppose the delicate data spillage and implanting assaults, and is along these lines hearty to the cheating from the prover, verifier, or outsider. The encryption keys are additionally utilized with the information lattice technique and it can restrict the watermark, and make the watermark vigorous against assaults. In this proposed zero-information technique zero rate asset, timing and watermarking overhead can be accomplished. The proposed zero-information watermarking plan causes zero overhead. In this proposed information lattice technique signal-rich-workmanship code picture, can be portrayed. The proposed information network watermarking plan encodes the copyright confirmation data. The zero-information confirmation convention and information grid technique proposed in this paper is executed by MATLAB R2014a in which C programming language is utilized in it and ModelSim 10.5b in which VHDL coding is utilized in it, are running on a PC. The combination instrument Xilinx ISE 14.5 is likewise used to confirm and actualize the watermarking plan