OPTIMAL UTILIZATION OF SERVICE FACILITY FOR A k-OUT-OF-n SYSTEM WITH REPAIR BY EXTENDING SERVICE TO EXTERNAL CUSTOMERS IN A RETRIAL QUEUE

In this paper, we study a k-out-of-n system with single server who provides service to external customers also. The system consists of two parts:(i) a main queue consisting of customers (failed components of the k-out-of-n system) and (ii) a pool (of finite capacity M) of external customers together with an orbit for external customers who find the pool full. An external customer who finds the pool full on arrival, joins the orbit with probability and with probability 1− leaves the system forever. An orbital customer, who finds the pool full, at an epoch of repeated attempt, returns to orbit with probability (< 1) and with probability 1 − leaves the system forever. We compute the steady state system size probability. Several performance measures are computed, numerical illustrations are provided.

Expanding Concept of Sale the Taxation Dilemma

School of Legal Studies, Cochin University of Science & Technology

The power of taxation under the indian constitution

The Power Of Taxation Under The lndian Constitution, the subject of the present thesis has a wide ambit covering the entire federal field end deep constitutional significance traversing many of the principles like pith and substance, colourability, severebility etc. However, considerations of time, space and areas already investigated have indicated that the present study may be confined to the fundamental constitutional limitations end the federal problem. Thus the effect of fundamental rights, the commerce clause, immunity of instrumentalitis and the principle limiting the power of legislative delegation on the power of taxation has been studied. The distribution of taxes between the Union and units of the Indian federation leans so much over to the former and that part of this study has been directed to discover what devices can help the units to gain economic viability

Optimal Design of a Surface Mounted Permanent-Magnet BLDC Motor for Spacecraft Applications

This paper presents the optimal design of a surface mounted permanent-magnet (PM) Brushless direct-current (BLDC) motor meant for spacecraft applications. The spacecraft applications requires the choice of a motor with high torque density, minimum cogging torque, better positional stability and high torque to inertia ratio. Performance of two types of machine configurations viz Slotted PMBLDC and Slotless PMBLDC with Halbach array are compared with the help of analytical and finite element (FE) methods. It is found that unlike a Slotted PMBLDC motor, the Slotless type with Halbach array develops zero cogging torque without reduction in the developed torque. Moreover, the machine being coreless provides high torque to inertia ratio and zero magnetic stiction

Impact of Quality on Ethics and Social Responsibility in Marketing, in Industries in Kerala in the present Indian Scenario

The paper ‘Impact of Quality on Ethics and Social Responsibility in Marketing in Industries in Kerala in the present Indian scenario’ highlights the observations, based on a descriptive research carried out in five leading industries in Kerala, in the private and public sector. Ethics and social responsibilities, practiced in these industries, are reflected in the results of the survey conducted on specific queries like awareness of products/services provided by them, total understanding of the requirements of the customer, open discussion on technical matters, accountability of employees to the society and social needs, consumer ethics vis a vis business ethics etc. Team working goes a long way, in building relations, which in turn, results in a progressive and effective marketing strategy. This assumes paramount importance, considering the severe competition we are facing in the light of liberalization, privatization and globalization, which encompasses the globe. The prediction of India becoming a lead nation, along with USA, China and Japan, in this decade, can get fructified only if we follow a very high standards of ethics and social responsibility, in all domains including marketing. Organizations like TRW.Rane, Sundaram Fasteners, TVS Motors, in Chennai are a few among others in India, who have achieved the highest distinction in quality viz Deming Prize, and these demonstrate their commitment to quality, society and humanity at large. Cost effectiveness, without jeopardizing quality has become the need of the hour and MRTP has become history. This trait is being brought out through the survey and the results speak for themselves. Unethical practices like switch and bait, not only brings shame to the organization, and country but also results in the company getting wiped out from the market. Adherence to standards like ISO 14000 helps to maintain the minimum level of social responsibility and environmental friendliness. Like quality audit, safety audit etc, social audit is being insisted in all progressive countries to ensure that the organization comply with the minimum statutory requirements. The paper also touches upon Corporate Social Responsibility practiced in the industries and this becomes crystal clear through their commitment to improve the community. Green Marketing lays a lot of importance on the three Rs of environmentalism viz Reduce, Reuse and Recycle. The objective of any business is to achieve optimal profit and this is possible only by reducing the cost as well as waste. In this context, management tools like brainstorming, suggestion schemes, benchmarking etc becomes helpful. These characteristics are brought out through the analysis of survey results. The conclusions drawn throw a lot of information on the desirable practices with respect to Ethics and Social Responsibility in Marketing

Optimal Sub-Pixel arrangements and coding for ultra-high resolution three-dimensional OLED displays

Information display technology is a rapidly growing research and development field. Using state-of-the-art technology, optical resolution can be increased dramatically by organic light-emitting diode - since the light emitting layer is very thin, under 100nm. The main question is what pixel size is achievable technologically? The next generation of display will considers three-dimensional image display. In 2D , one is considering vertical and horizontal resolutions. In 3D or holographic images, there is another dimension – depth. The major requirement is the high resolution horizontal dimension in order to sustain the third dimension using special lenticular glass or barrier masks, separate views for each eye. The high-resolution 3D display offers hundreds of more different views of objects or landscape. OLEDs have potential to be a key technology for information displays in the future. The display technology presented in this work promises to bring into use bright colour 3D flat panel displays in a unique way. Unlike the conventional TFT matrix, OLED displays have constant brightness and colour, independent from the viewing angle i.e. the observer's position in front of the screen. A sandwich (just 0.1 micron thick) of organic thin films between two conductors makes an OLE Display device. These special materials are named electroluminescent organic semi-conductors (or organic photoconductors (OPC )). When electrical current is applied, a bright light is emitted (electrophosphorescence) from the formed Organic Light-Emitting Diode. Usually for OLED an ITO layer is used as a transparent electrode. Such types of displays were the first for volume manufacture and only a few products are available in the market at present. The key challenges that OLED technology faces in the application areas are: producing high-quality white light achieving low manufacturing costs increasing efficiency and lifetime at high brightness. Looking towards the future, by combining OLED with specially constructed surface lenses and proper image management software it will be possible to achieve 3D images.

Optimal control theory for a unitary operation under dissipative evolution

We show that optimizing a quantum gate for an open quantum system requires the time evolution of only three states irrespective of the dimension of Hilbert space. This represents a significant reduction in computational resources compared to the complete basis of Liouville space that is commonly believed necessary for this task. The reduction is based on two observations: the target is not a general dynamical map but a unitary operation; and the time evolution of two properly chosen states is sufficient to distinguish any two unitaries. We illustrate gate optimization employing a reduced set of states for a controlled phasegate with trapped atoms as qubit carriers and a iSWAP gate with superconducting qubits.

Efficient Characterisation and Optimal Control of Open Quantum Systems - Mathematical Foundations and Physical Applications

Since no physical system can ever be completely isolated from its environment, the study of open quantum systems is pivotal to reliably and accurately control complex quantum systems. In practice, reliability of the control field needs to be confirmed via certification of the target evolution while accuracy requires the derivation of high-fidelity control schemes in the presence of decoherence. In the first part of this thesis an algebraic framework is presented that allows to determine the minimal requirements on the unique characterisation of arbitrary unitary gates in open quantum systems, independent on the particular physical implementation of the employed quantum device. To this end, a set of theorems is devised that can be used to assess whether a given set of input states on a quantum channel is sufficient to judge whether a desired unitary gate is realised. This allows to determine the minimal input for such a task, which proves to be, quite remarkably, independent of system size. These results allow to elucidate the fundamental limits regarding certification and tomography of open quantum systems. The combination of these insights with state-of-the-art Monte Carlo process certification techniques permits a significant improvement of the scaling when certifying arbitrary unitary gates. This improvement is not only restricted to quantum information devices where the basic information carrier is the qubit but it also extends to systems where the fundamental informational entities can be of arbitary dimensionality, the so-called qudits. The second part of this thesis concerns the impact of these findings from the point of view of Optimal Control Theory (OCT). OCT for quantum systems utilises concepts from engineering such as feedback and optimisation to engineer constructive and destructive interferences in order to steer a physical process in a desired direction. It turns out that the aforementioned mathematical findings allow to deduce novel optimisation functionals that significantly reduce not only the required memory for numerical control algorithms but also the total CPU time required to obtain a certain fidelity for the optimised process. The thesis concludes by discussing two problems of fundamental interest in quantum information processing from the point of view of optimal control - the preparation of pure states and the implementation of unitary gates in open quantum systems. For both cases specific physical examples are considered: for the former the vibrational cooling of molecules via optical pumping and for the latter a superconducting phase qudit implementation. In particular, it is illustrated how features of the environment can be exploited to reach the desired targets.

Optimal Unsupervised Learning in Feedforward Neural Networks

We investigate the properties of feedforward neural networks trained with Hebbian learning algorithms. A new unsupervised algorithm is proposed which produces statistically uncorrelated outputs. The algorithm causes the weights of the network to converge to the eigenvectors of the input correlation with largest eigenvalues. The algorithm is closely related to the technique of Self-supervised Backpropagation, as well as other algorithms for unsupervised learning. Applications of the algorithm to texture processing, image coding, and stereo depth edge detection are given. We show that the algorithm can lead to the development of filters qualitatively similar to those found in primate visual cortex.

Sequential Optimal Recovery: A Paradigm for Active Learning

In most classical frameworks for learning from examples, it is assumed that examples are randomly drawn and presented to the learner. In this paper, we consider the possibility of a more active learner who is allowed to choose his/her own examples. Our investigations are carried out in a function approximation setting. In particular, using arguments from optimal recovery (Micchelli and Rivlin, 1976), we develop an adaptive sampling strategy (equivalent to adaptive approximation) for arbitrary approximation schemes. We provide a general formulation of the problem and show how it can be regarded as sequential optimal recovery. We demonstrate the application of this general formulation to two special cases of functions on the real line 1) monotonically increasing functions and 2) functions with bounded derivative. An extensive investigation of the sample complexity of approximating these functions is conducted yielding both theoretical and empirical results on test functions. Our theoretical results (stated insPAC-style), along with the simulations demonstrate the superiority of our active scheme over both passive learning as well as classical optimal recovery. The analysis of active function approximation is conducted in a worst-case setting, in contrast with other Bayesian paradigms obtained from optimal design (Mackay, 1992).

Optimal Methodology for Synchronized Scheduling of Parallel Station Assembly with Air Transportation

We present an optimal methodology for synchronized scheduling of production assembly with air transportation to achieve accurate delivery with minimized cost in consumer electronics supply chain (CESC). This problem was motivated by a major PC manufacturer in consumer electronics industry, where it is required to schedule the delivery requirements to meet the customer needs in different parts of South East Asia. The overall problem is decomposed into two sub-problems which consist of an air transportation allocation problem and an assembly scheduling problem. The air transportation allocation problem is formulated as a Linear Programming Problem with earliness tardiness penalties for job orders. For the assembly scheduling problem, it is basically required to sequence the job orders on the assembly stations to minimize their waiting times before they are shipped by flights to their destinations. Hence the second sub-problem is modelled as a scheduling problem with earliness penalties. The earliness penalties are assumed to be independent of the job orders.

Optimal Traffic Grooming in WDM using Lighttours

Recent developments in optical communications have allowed simpler optical devices to improve network resource utilization. As such, we propose adding a lambda-monitoring device to a wavelength-routing switch (WRS) allowing better performance when traffic is routed and groomed. This device may allow a WRS to aggregate traffic over optical routes without incurring in optical-electrical-optical conversion for the existing traffic. In other words, optical routes can be taken partially to route demands creating a sort of "lighttours". In this paper, we compare the number of OEO conversions needed to route a complete given traffic matrix using either lighttours or lightpaths

On optimal computation of MPLS label binding for multipoint-to-point connections

Most network operators have considered reducing Label Switched Routers (LSR) label spaces (i.e. the number of labels that can be used) as a means of simplifying management of underlaying Virtual Private Networks (VPNs) and, hence, reducing operational expenditure (OPEX). This letter discusses the problem of reducing the label spaces in Multiprotocol Label Switched (MPLS) networks using label merging - better known as MultiPoint-to-Point (MP2P) connections. Because of its origins in IP, MP2P connections have been considered to have tree- shapes with Label Switched Paths (LSP) as branches. Due to this fact, previous works by many authors affirm that the problem of minimizing the label space using MP2P in MPLS - the Merging Problem - cannot be solved optimally with a polynomial algorithm (NP-complete), since it involves a hard- decision problem. However, in this letter, the Merging Problem is analyzed, from the perspective of MPLS, and it is deduced that tree-shapes in MP2P connections are irrelevant. By overriding this tree-shape consideration, it is possible to perform label merging in polynomial time. Based on how MPLS signaling works, this letter proposes an algorithm to compute the minimum number of labels using label merging: the Full Label Merging algorithm. As conclusion, we reclassify the Merging Problem as Polynomial-solvable, instead of NP-complete. In addition, simulation experiments confirm that without the tree-branch selection problem, more labels can be reduced