INTERNATIONAL CONFERENCE ON METHODS AND MODELS IN SCIENCE AND TECHNOLOGY (ICM2ST‐10)
1324(2010); http://dx.doi.org/10.1063/1.3526193View Description Hide Description
In this paper an application of Fuzzy Logic for Automatic Braking system is proposed. Anti‐blocking system (ABS) brake controllers pose unique challenges to the designer: a) For optimal performance, the controller must operate at an unstable equilibrium point, b) Depending on road conditions, the maximum braking torque may vary over a wide range, c) The tire slippage measurement signal, crucial for controller performance, is both highly uncertain and noisy. A digital controller design was chosen which combines a fuzzy logic element and a decision logic network. The controller identifies the current road condition and generates a command braking pressure signal Depending upon the speed and distance of train. This paper describes design criteria, and the decision and rule structure of the control system. The simulation results present the system’s performance depending upon the varying speed and distance of the train.
1324(2010); http://dx.doi.org/10.1063/1.3526262View Description Hide Description
The major hurdle of a city planning council is to handle the traffic jam problem. The number of vehicles on roads increases day by day. Also the number of vehicles is directly proportional to the width of the road (including that of parallel roads). But it is not always possible to make roads or to increase width of the road corresponding to the increase in the number of vehicles. Also we cannot tell a person not to buy a vehicle. So trying to minimise the traffic jam is the only possible way to overcome this hurdle. Here we try to develop a method to avoid traffic jam through a mathematical approach (through fuzzy applications). This method helps to find a suitable route from an origin to a destination with lesser time than other routes.
Analytical and CASE study on Limited Search, ID3, CHAID, C4.5, Improved C4.5 and OVA Decision Tree Algorithms to design Decision Support System1324(2010); http://dx.doi.org/10.1063/1.3526277View Description Hide Description
In this paper we study about classification algorithms for farm DSS. By applying classification algorithms i.e. Limited search, ID3, CHAID, C4.5, Improved C4.5 and One VS all Decision Tree on common data set of crop with specified class, results are obtained. The tool used to derive results is SPINA. The graphical results obtained from tool are compared to suggest best technique to develop farm Decision Support System. This analysis would help to researchers to design effective and fast DSS for farmer to take decision for enhancing their yield.
1324(2010); http://dx.doi.org/10.1063/1.3526174View Description Hide Description
This paper discuss about need for development of the Decision Support System (DSS) software for economic feasibility of projects in Rwanda, Africa. The various economic theories needed and the corresponding formulae to compute payback period, internal rate of return and benefit cost ratio of projects are clearly given in this paper. This paper is also deals with the systems flow chart to fabricate the system in any higher level computing language. The various input requirements from the projects and the output needed for the decision makers are also included in this paper. The data dictionary used for input and output data structure is also explained.
1324(2010); http://dx.doi.org/10.1063/1.3526192View Description Hide Description
In general, a mobile user travels in a predefined path that depends mostly on the user’s characteristics. Thus, tracking the locations of a mobile user is one of the challenges for location management. In this paper, we introduce a movement pattern learning strategy system to track the user’s movements using adaptive fuzzy logic. Our fuzzy inference system extracts patterns from the historical data record of the cell numbers along with the date and time stamp of the users occupying the cell. Implementation of this strategy has been evaluated with the real time user data which proves the efficiency and accuracy of the model. This mechanism not only reduces user location tracking costs, but also significantly decreases the call‐loss rates and average paging delays.
1324(2010); http://dx.doi.org/10.1063/1.3526206View Description Hide Description
Computation of real numbers has been a challenging task for many years. Because of its unique nature of infinity, it is considered as a very good area of research. This paper tries to convey the nature of the real numbers and the difficulty to compute them i.e. to approximate the value and some respective development processes related to the real numbers. While making a general calculation the approximation can go on and on, this still doesn’t give the exact value. Computer system’s memory is finite. Goal is to approximate the real numbers but the problem arises where to stop and which basis they are subjected for approximation on.
1324(2010); http://dx.doi.org/10.1063/1.3526213View Description Hide Description
World Wide Web is the largest source of information. Huge amount of data is present on the Web. There has been a great amount of work on query‐independent summarization of documents. However, due to the success of Web search engines query‐specific document summarization (query result snippets) has become an important problem. In this paper a method to create query specific summaries by identifying the most query‐relevant fragments and combining them using the semantic associations within the document is discussed. In particular, first a structure is added to the documents in the preprocessing stage and converts them to document graphs. The present research work focuses on analytical study of different document clustering and summarization techniques currently the most research is focused on Query‐Independent summarization. The main aim of this research work is to combine the both approaches of document clustering and query dependent summarization. This mainly includes applying different clustering algorithms on a text document. Create a weighted document graph of the resulting graph based on the keywords. And obtain the document graph to get the summary of the document. The performance of the summary using different clustering techniques will be analyzed and the optimal approach will be suggested.
1324(2010); http://dx.doi.org/10.1063/1.3526220View Description Hide Description
Fuzzy approach has been applied to automata theory to obtain fuzzy automaton in the very early age of fuzzy set theory. Fuzzy automaton is the mathematical model, recognizing fuzzy regular languages. Myhill‐Nerode theorem for finite automaton is a very powerful tool for minimizing the number of states in a finite automaton. Interval‐valued fuzzy automaton is one of the generalized fuzzy automata. In this paper, an extension of Myhill‐Nerode theorem for Interval‐valued fuzzy regular language is established. Also, the problem of minimizing the finite automaton with Interval‐valued fuzzy (final) states is explored.
1324(2010); http://dx.doi.org/10.1063/1.3526231View Description Hide Description
In this paper, simulation of Viterbi decoder and Fano decoder for decoding the convolutional codes in AWGN channel is carried out. Graphs are plotted between Viterbi algorithm and Fano algorithm for decoding the convolutional codes of fixed code rate and fixed constraint length. Result shows that performance of Viterbi decoder is better than Fano decoder for the same code rate, constraint length and decoding delay.
1324(2010); http://dx.doi.org/10.1063/1.3526244View Description Hide Description
Search engines on the Internet are used daily to access and find information. While these services are providing an easy way to find information globally, they are also suffering from artificially created false results. This paper describes two techniques that are being used to manipulate the search engines: spam pages (used to achieve higher rankings on the result page) and cloaking (used to feed falsified data into search engines). This paper also describes two proposed methods to fight this kind of misuse, algorithms for both of the formerly mentioned cases of spamdexing.
1324(2010); http://dx.doi.org/10.1063/1.3526254View Description Hide Description
Content‐based image retrieval (CBIR) methods in medical image databases have been designed to support specific tasks, such as retrieval of medical images. These methods cannot be transferred to other medical applications since different imaging modalities require different types of processing. To enable content‐based queries in diverse collections of medical images, the retrieval system must be familiar with the current Image class prior to the query processing. Further, almost all of them deal with the DICOM imaging format. In this paper a novel algorithm based on energy information obtained from wavelet transform for the classification of medical images according to their modalities is described. For this two types of wavelets have been used and have been shown that energy obtained in either case is quite distinct for each of the body part. This technique can be successfully applied to different image formats. The results are shown for JPEG imaging format.
1324(2010); http://dx.doi.org/10.1063/1.3526261View Description Hide Description
This paper surveys many variants of concurrency control algorithms in database systems. We classify the different alternatives under locking, time‐stamp, optimistic algorithms. Though the performance of different concurrency control algorithms have been explored extensively for database management systems but to the best of author’s knowledge, the relative variants of different protocols used for concurrency control algorithms have not been reported yet.
1324(2010); http://dx.doi.org/10.1063/1.3526264View Description Hide Description
Polymorphism means one thing exists in many forms of its own with each form having different implementation of its own. Polymorphism can be compile time or runtime. It is concern of lifetime of object. The lifetime can be determined at compile time or runtime. The compiler has a such knowledge to determine static analysis of source code.
1324(2010); http://dx.doi.org/10.1063/1.3526265View Description Hide Description
This paper describe the relationship between C++ templates and partial evaluation. In C++, templates were designed to support generic programming, but not deliberately provided the ability to perform compile‐time computations and code generation. These features are completely deliberate, and as a result their syntax is ill at ease. After a review, these features in terms of partial evaluation, a much simpler syntax can be achieved. In C++, it may be regarded as a two‐level language in which types are first‐class values. Template instantiation resembles an offline partial assessor. In this paper, we explain groundwork in the direction of a single mechanism based on Partial Evaluation which unifies generic programming, compile‐time computation and code generation. The language Catat is introduced to demonstrate these ideas.
1324(2010); http://dx.doi.org/10.1063/1.3526266View Description Hide Description
Logarithmic function has been designed on basis of multiplicative normalization and then its testing is been done using tetraMAX. It is observed that 7050 possible faults can be there in the design and tetraMAX ATPG can provide test coverage of 99.29%. Using design compiler .db file is generated which is used for functional verification of the design with respect to RTL design. Compare points are shown by cone views of the design.
1324(2010); http://dx.doi.org/10.1063/1.3526267View Description Hide Description
We investigate the end state of gravitational collapse of Husain space‐time in higher dimensional space‐times. Both naked singularities and black holes are shown to be developing as final outcome of the collapse. Earlier work is generalized to higher dimensional space‐times to allow a study of the effect of number of dimensions on the possible final outcome of the collapse in terms of a black hole or a naked singularity. No restriction is adopted on the number of dimensions. These results might be important in the light of the recent proposal that there may exist extra dimensions in the universe.
1324(2010); http://dx.doi.org/10.1063/1.3526268View Description Hide Description
The necessity of modeling lies in the nature of technology and its advancement. The modeling minimizes time and cost of the process involved. The mathematical model provides an insight into the behavior of the physical system that reduces the problem to its essential characteristics. The floating admittance matrix (FAM) approach is an elegant method of mathematical modeling of electronic devices and circuits.
1324(2010); http://dx.doi.org/10.1063/1.3526269View Description Hide Description
A Mobile Ad Hoc Network (MANET) is a temporary network set up by a wireless mobile computers moving arbitrary in the places that have no network infrastructure. These nodes maintain connectivity in a decentralized manner. Since the nodes communicate with each other, they cooperate by forwarding data packets to other nodes in the network. Thus the nodes find a path to the destination node using routing protocols.
However, due to security vulnerabilities of the routing protocols, mobile ad‐hoc networks are unprotected to attacks of the malicious nodes. One of these attacks is the Black Hole Attack against network integrity absorbing all data packets in the network. Since the data packets do not reach the destination node on account of this attack, data loss will occur.
In this paper, we simulated the black hole attack in various mobile ad‐hoc network scenarios using AODV routing protocol of MANET and have tried to find a effect if number of nodes are increased with increase in malicious nodes.
1324(2010); http://dx.doi.org/10.1063/1.3526270View Description Hide Description
Packet technologies were designed to work in asynchronous mode, where the oscillators in the equipment are free running. Although this allows the underlying infrastructure to operate, many applications exist that require frequency synchronization. Also, the ability to distribute synchronization from center to edge of network declines as infrastructure evolves toward a packet‐based architecture. Synchronous Ethernet (SyncE) is a key development of the evolution of Ethernet into a carrier grade technology suitable for the WAN environment where frequency synchronization is required. The time of the day distribution in synchronized network at the physical layer enables many useful propositions in packet handling policies and other network management aspects.