Optimality and Duality on Fractional Multi-objective Programming Under Semilocal E-convexity

In this paper, some necessary and sufficient optimality conditions are obtained for a fractional multiple objective programming involving semilocal E-convex and related functions. Also, some dual results are established under this kind of generalized convex functions. Our results generalize the ones obtained by Preda[J Math Anal Appl, 288（2003） 365-382].

A Primal-Dual Infeasible-Interior-Point Algorithm for Multiple Objective Linear Programming Problems

A primal-dual infeasible interior point algorithm for multiple objective linear programming (MOLP) problems was presented. In contrast to the current MOLP algorithm. moving through the interior of polytope but not confining the iterates within the feasible region in our proposed algorithm result in a solution approach that is quite different and less sensitive to problem size, so providing the potential to dramatically improve the practical computation effectiveness.

New Approach to Solve Cubic Objective Function Programming Problem

In this paper, a cubic objective programming problem (COPP) is defined. Introduced a new modification to solve a cubic objective programming problem. Suggested an algorithm for its solution. Also reported the algorithm of the usual simplex method. Application talks about how the developed algorithm can be used to unravel non-linear. The proposed technique, modification simplex technique, can be used with the constructed numerical examples an illustrative numerical problems are given to demonstrate the algorithms.

An Alternative Approach to the Solution of Multi-Objective Geometric Programming Problems

The aim of this study is to present an alternative approach for solving the multi-objective posynomial geometric programming problems. The proposed approach minimizes the weighted objective function comes from multi-objective geometric programming problem subject to constraints which constructed by using Kuhn-Tucker Conditions. A new nonlinear problem formed by this approach is solved iteratively. The solution of this approach gives the Pareto optimal solution for the multi-objective posynomial geometric programming problem. To demonstrate the performance of this approach, a problem which was solved with a weighted mean method by Ojha and Biswal (2010) is used. The comparison of solutions between two methods shows that similar results are obtained. In this manner, the proposed approach can be used as an alternative of weighted mean method.

OPTIMALITY CONDITIONS AND DUALITY RESULTS FOR NONSMOOTH VECTOR OPTIMIZATION PROBLEMS WITH THE MULTIPLE INTERVAL-VALUED OBJECTIVE FUNCTION

In this paper, both Fritz John and Karush-Kuhn-Tucker necessary optimality conditions are established for a （weakly） LU-efficient solution in the considered nonsmooth multiobjective programming problem with the multiple interval-objective function. Further, the sufficient optimality conditions for a （weakly） LU-efficient solution and several duality results in Mond-Weir sense are proved under assumptions that the functions constituting the considered nondifferentiable multiobjective programming problem with the multiple interval- objective function are convex.

Dynamic Slicing of Object Oriented Programs

Program slice has many applications such as program debugging, testing, maintenance, and complexity measurement. A static slice consists of all statements in program P that may effect the value of variable v at some point p , and a dynamic slice consists only of statements that influence the value of variable occurrence for specific program inputs. In this paper, we concern the problem of dynamic slicing of object oriented programs which, to our knowledge, has not been addressed in the literatures. To solve this problem, we present the dynamic object oriented dependence graph (DODG)which is an arc classified digraph to explicitly represent various dynamic dependence between statement instances for a particular execution of an object oriented program. Based on the DODG, we present a two phase backward algorithm for computing a dynamic slice of an object oriented program.

Short Text Mining for Classifying Educational Objectives and Outcomes

Most of the international accreditation bodies in engineering education(e.g.,ABET)and outcome-based educational systems have based their assess-ments on learning outcomes and program educational objectives.However,map-ping program educational objectives(PEOs)to student outcomes(SOs)is a challenging and time-consuming task,especially for a new program which is applying for ABET-EAC(American Board for Engineering and Technology the American Board for Engineering and Technology—Engineering Accreditation Commission)accreditation.In addition,ABET needs to automatically ensure that the mapping(classification)is reasonable and correct.The classification also plays a vital role in the assessment of students’learning.Since the PEOs are expressed as short text,they do not contain enough semantic meaning and information,and consequently they suffer from high sparseness,multidimensionality and the curse of dimensionality.In this work,a novel associative short text classification tech-nique is proposed to map PEOs to SOs.The datasets are extracted from 152 self-study reports(SSRs)that were produced in operational settings in an engineering program accredited by ABET-EAC.The datasets are processed and transformed into a representational form appropriate for association rule mining.The extracted rules are utilized as delegate classifiers to map PEOs to SOs.The proposed asso-ciative classification of the mapping of PEOs to SOs has shown promising results,which can simplify the classification of short text and avoid many problems caused by enriching short text based on external resources that are not related or relevant to the dataset.

An object oriented multi-robotic graphic simulation environment for programming the welding tasks

An object oriented multi robotic graphic simulation environment is described in this paper. Object oriented programming is used to model the physical objects of the robotic workcell in the form of software objects or classes. The virtual objects are defined to provide the user with a user friendly interface including realistic graphic simulation and clarify the software architecture. The programming method of associating the task object with active object effectively increases the software reusability, maintainability and modifiability. Task level programming is also demonstrated through a multi robot welding task that allows the user to concentrate on the most important aspects of the tasks. The multi thread programming technique is used to simulate the interaction of multiple tasks. Finally, a virtual test is carried out in the graphic simulation environment to observe design and program errors and fix them before downloading the software to the real workcell.

Diagnosing Student Learning Problems in Object Oriented Programming

Students often face difficulties while taking basic programming courses due to several factors. In response, research has presented subjective assessments for diagnosing learning problems to improve the teaching of programming in higher education. In this paper, the authors propose an Object Oriented conceptual map model and organize this approach into three levels： constructing a Concept Effect Propagation Table, constructing Test Item-Concept Relationships and diagnosing Student Learning Problems with Matrix Composition. The authors＇ work is a modification of the approaches of Chert and Bai as well as Chu et al., as the authors use statistical methods, rather than fuzzy sets, for the authors＇ analysis. This paper includes a statistical summary, which has been tested on a small sample of students in King Abdulaziz University, Jeddah, Saudi Arabia, illustrating the learning problems in an Object Oriented course. The experimental results have demonstrated that this approach might aid learning and teaching in an effective way.

Optimal Irrigation Planning and Operation of Multi Objective Reservoir Using Fuzzy Logic

In the present study the MOFLP models have been developed for the optimal cropping pattern planning which maximizes the four objectives such as Net Benefits (NB), Crop Production (CP), Employment Generation (EG) and Manure Utilization (MU) under conflicting situation and also, for maximization of Releases for Irrigation (RI) and Releases for Power (RP) simultaneously under uncertainty by considering the fuzziness in the objective functions. The developed models have been applied using the LINGO 13 (Language for Interactive General Optimization) optimization software to the case study of the Jayakwadi Project Stage-II across Sindhphana River, in the State of Maharashtra India. The various constraints have been taken into consideration like sowing area, affinity to crop, labour availability, manure availability, water availability for optimal cropping pattern planning. Similarly constraints to find the optimal reservoir operating policy are releases for power and turbine capacity, irrigation demand, reservoir storage capacity, reservoir storage continuity. The level of satisfaction for a compromised solution of optimal cropping pattern planning for four conflicting objectives under fuzzy environment is worked out to be λ = 0.68. The MOFLP compromised solution provides NB = 1088.46 (Million Rupees), CP = 241003 (Tons), EG = 23.13 (Million Man days) and MU = 111454.70 (Tons) respectively. The compromised solution for optimal operation of multi objective reservoir yields the level of satisfaction (λ) = 0.533 for maximizing the releases for irrigation and power simultaneously by satisfying the constraint of the system under consideration. The compromised solution provides the optimal releases, i.e. RI = 348.670 Mm3 and RP = 234.285 Mm3 respectively.

Iteration Linear Programming Method and Livestock Ration Optimization

Iterative linear programming methods are proposed for optimum balanced animal diet in this paper. According to ＂wooden bucket theory＂ of the nutritional balance, each nutrient in the feeding standard has equal importance. It＇s unreasonable to use common goal programming to attach different weighted value to different nutritional parameters. This paper introduces an effective algorithm to deal with this kind of problem. When the permitting cost of livestock ration is given, we can design a ration formula with linear program-this is the first round. Then, according to the differences between the permitting cost and the formula cost gained in the first round, adjust the feeding standard and the feeding raw materials, and conduct the second round of linear programming for ration formula. If there is still a very big difference between the formula cost and the permitting cost, the third round will be taken, and so on. In this iteration course the formula cost gradually approaches the permitting cost. It is the key that the feeding standard and feeding raw materials are modified in each round. This method ensured the nutritive equilibrium with the formulation of least-cost ration. This is an especially important method when the primary goal of the optimization tool is to improve economic and nutritive efficiency.

APPROACH FOR FUZZY MULTI-ATTRIBUTE DECISION-MAKING WITH FUZZY COMPLEMENTARY PREFERENCE RELATION ON ALTERNATIVES

In presented fuzzy multi-attribute decision-making （FMADM） problems, the information about attribute weights is interval numbers and the decision maker （DM） has fuzzy complementary preference relation on alternatives. Firstly, the decision-making information based on the subjective preference information in the form of the fuzzy complementary judgment matrix is uniform by using a translation function. Then an objective programming model is established. Attribute weights are obtained by solving the model, thus the fuzzy overall values of alternatives are derived by using the additive weighting method. Secondly, the ranking approach of alternatives is proposed based on the degree of similarity between the fuzzy positive ideal solution of alternatives （FPISA） and the fuzzy overall values. The method can sufficiently utilize the objective information of alternatives and meet the subjective requirements of the DM as much as possible. It is easy to be operated and implemented on a computer. Finally, the proposed method is applied to the project evaluation in the venture investment.

Method for uncertain multi-attribute decisionmaking with preference information in the form of interval numbers complementary judgment matrix

The uncertain multi-attribute decision-making problems because of the information about attribute weights being known partly, and the decision maker＇s preference information on alternatives taking the form of interval numbers complementary to the judgment matrix, are investigated. First, the decision-making information, based on the subjective uncertain complementary preference matrix on alternatives is made uniform by using a translation function, and then an objective programming model is established. The attribute weights are obtained by solving the model, thus the overall values of the alternatives are gained by using the additive weighting method. Second, the alternatives are ranked, by using the continuous ordered weighted averaging （C-OWA） operator. A new approach to the uncertain multi-attribute decision-making problems, with uncertain preference information on alternatives is proposed. It is characterized by simple operations and can be easily implemented on a computer. Finally, a practical example is illustrated to show the feasibility and availability of the developed method.

Application of Petri Net to Fault Diagnosis in Satellite

A prototype of fault diagnosis based on Petri net, which is developed for a satellite tele-control subsystem, is introduced in this paper. Its structure is first given with the emphasis on a Petri net modeling tool which is designed using the object oriented method. The prototype is connected to the database with DAO (Date Access Object) technique, and makes the Petri net's firing mechanism and its analyzing methods to be packed up as DLL (Dynamic Link Library) documents. Compared with the rule-based expert system method, the Petri net-based one can store the knowledge in mathematical matrix and make inference more quickly and effectively.

A Compromise Approach to Lexicographic Optimal Solution in Multiple Objective Programming

In this paper we use a compromise approach to identify a lexicographic optimal solution of a multiple objective programming (MOP) problem. With this solution concept, we first find the maximization of each objection function as the ideal value. Then, we construct a lexicographic order for the compromise (differences) between the ideal values and objective functions. Based on the usually lexicographic optimality structure, we discuss some theoretical properties about our approach and derive a constructing algorithm to compute such a lexicographic optimal solution.

Building an E-business System Using Enterprise JavaBeans Architecture

This paper provides an overview of using Enterprise JavaBeans to build an e-business system. First, the authors point out some difficulties during building an e-business sy stem. For example, how can we integrate all kinds of software and hardware i n company quickly and economically Then the authors introduce a representative EJB structure and currently EJB deve loping approaches. A representative EJB structure includes an EJB Server, EJB Co ntainers, EJB Clients and JNDI etc. An EJB Server is similar to CORBA ORB. It pr ovides system services such as original implementing environment, multiprocessin g, workload management, equipment accessing, JTS and JNDI service and making the EJB Container visible. The EJB Container plays the role of interface between th e EJB and others. An EJB Client never accesses Bean directly. There are two kind s of containers. One is session contain, it mainly includes brief, impermanent E JB(thus all statuses will not be saved). The other is entity container which inc luding permanent EJB. The EJB Client uses EJB Beans. First it finds EJB Containe r through JNDI interface. Then it transfers EJB methods using EJB Container. Current, EJB developing approaches include several major aspects such as develop ment, deployment, application programs assembling and management of Enterprise B ean etc. Above all, we should define three classes, Bean class, home interface c lass of Bean and remote interface class of Bean. Then we should create a deploym ent descriptor. This is an XML documentation, which declared the properties of E nterprise Bean and bound the class documentations of Bean(including stub documen tation and skeleton documentation). And then we put these deployments into a jar documentation and define environment properties in the deployer. Next, we shoul d assemble application programs including install Enterprise Beans to server and test the connecting of each ties. The program assembler integrates several Ente rprise Beans with other beans(like Servlet, Applet, Script etc) into an integrat ed application program. It also may integrate several Enterprise Beans into a co mplicated Enterprise Bean. Of cause we also need to manage the Enterprise Bean. In the end, the authors point out several major advantages of using EJB to build e-business system such as simplifying application development and deployment, supporting heterogeneous client and server platforms, leveraging existing skills and assets, delivering a secure, scalable, reliable and manageable environment and providing the freedom to implement using many vendors’ products.

Train Students to Solve the Practical Problem by Building Mathematics Models

It focuses on that students must be developed the ability to solve the practical problem by building the mathematics models and the ability to combine the theory with the practice. It also states that students must be improved the learning interests and practical experience.

CORBA-Based Discrete Event Simulation System

The CORBA technique is an integration of the object-oriented conception and distributed computing technique. It can make the application within distributed heterogeneous environments reusable, portable and interoperable. The architecture of CORBA-based discrete event simulation systems is presented and the interface of distributed simulation objects (DSO) is defined in this paper after the DSO is identified and the synchronization mechanism among DSO is discussed.

Feature-based and objectoriented product information model for welding structure

Product information model for welding structure plays an important role for the integration of welding CAD/CAPP/CAM. However, existing CAD modeling systems are not capable of providing enough information for subsequent manufacturing activities such as CAPP and CAM. A new design approach using feature technique and object oriented programming method is put forward in this paper in order to create the product information model of welding structure. With this approach, the product information model is able to effectively support computer aided welding process planning, fixturing, assembling, path planning of welding robot and other manufacturing activities. The feature classification and representing scheme of welding structure are discussed. A prototype system is developed based on feature and object oriented programming. Its structure and functions are given in detail.

Kinetics of Growth and Weight of Vanadium Gel on Short-Circuited Probes from Various Materials

The article provides results of experiments on research of speed of escalating of vanadium gel on short-circuited probes from various metals, particularly from copper and aluminium it is shown that speed of escalating of gel on probes is influenced with a material of a probe and configuration of probes in a solution.