213 resultados para Uniformly Convex
Resumo:
Due to its wide applicability, semi-supervised learning is an attractive method for using unlabeled data in classification. In this work, we present a semi-supervised support vector classifier that is designed using quasi-Newton method for nonsmooth convex functions. The proposed algorithm is suitable in dealing with very large number of examples and features. Numerical experiments on various benchmark datasets showed that the proposed algorithm is fast and gives improved generalization performance over the existing methods. Further, a non-linear semi-supervised SVM has been proposed based on a multiple label switching scheme. This non-linear semi-supervised SVM is found to converge faster and it is found to improve generalization performance on several benchmark datasets. (C) 2010 Elsevier Ltd. All rights reserved.
Resumo:
European accounts from the 17th century onwards have referred to the repute and manufacture of “wootz’, a traditional crucible steel made especially in parts of southern India in the former provinces of Golconda, Mysore and Salem. Pliny's Natural History mentions the import of iron and steel from the Seres which have been thought to refer to the ancient southern Indian kingdom of the Cheras. As yet the scale of excavations and surface surveys is too limited to link the literary accounts to archaeometallurgical evidence, although pioneering exploratory investigations have been made by scholars, especially on the pre-industrial production sites of Konasamudram and Gatihosahalli discussed in 18th-19th century European accounts. In 1991–2 during preliminary surveys of ancient base metal mining sites, Srinivasan came across unreported dumps with crucible fragments at Mel-Siruvalur in Tamil Nadu, and Tintini and Machnur in Karnataka and she collected surface specimens from these sites as well as from the known site of Gatihosahalli. She was also given crucible fragments by the Tamil University, Tanjavur, from an excavated megalithic site at Kodumanal, dated to ca 2nd c. Bc, mentioned in Tamil Sangam literature (ca 3rd c. BC-3rd c. AD), and very near Karur, the ancient capital of the Sangam Cheras. Analyses of crucible fragments from the surface collection at Mel-Siruvalur showed several iron prills with a uniform pearlitic structure of high-carbon hypereutectoid steel (∼1–1.5% C) suggesting that the end product was uniformly a high-carbon steel of a structure consistent with those of high-carbon steels used successfully to experimentally replicate the watered steel patterns on ‘Damascus’ swords. Investigations indicate that the process was of carburisation of molten low carbon iron (m.p. 1400° C) in crucibles packed with carbonaceous matter. The fabric of crucibles from all the above mentioned sites appears similar. Preliminary investigations on these crucibles are thus reported to establish their relationship to crucible production of carbon steel and to thereby extend the known horizons of this technology further.
Resumo:
We consider here the higher order effect of moderate longitudinal surface curvature on steady, two-dimensional, incompressible laminar boundary layers. The basic partial differential equations for the problem, derived by the method of matched asymptotic expansions, are found to possess similarity solutions for a family of surface curvatures and pressure gradients. The similarity equations obtained by this anaylsis have been solved numerically on a computer, and show a definite decrease in skin friction when the surface has convex curvature in all cases including zero pressure gradient. Typical velocity profiles and some relevant boundary-layer characteristics are tabulated, and a critical comparison with previous work is given.
Resumo:
Carbon nanotubes produced by the treatment of Mg1−xMxAl2O4 (M = Fe, Co, or Ni; x = 0.1, 0.2, 0.3, or 0.4) spinels with an H2–CH4 mixture at 1070 °C have been investigated systematically. The grains of the oxide-metal composite particles are uniformly covered by a weblike network of carbon nanotube bundles, several tens of micrometers long, made up of single-wall nanotubes with a diameter close to 4 nm. Only the smallest metal particles (<5 nm) are involved in the formation of the nanotubes. A macroscopic characterization method involving surface area measurements and chemical analysis has been developed in order to compare the different nanotube specimens. An increase in the transition metal content of the catalyst yields more carbon nanotubes (up to a metal content of 10.0 wt% or x = 0.3), but causes a decrease in carbon quality. The best compromise is to use 6.7 wt% of metal (x = 0.2) in the catalyst. Co gives superior results with respect to both the quantity and quality of the nanotubes. In the case of Fe, the quality is notably hampered by the formation of Fe3C particles.
Resumo:
Recent studies have shown that changes in solar radiation affect the hydrological cycle more strongly than equivalent CO(2) changes for the same change in global mean surface temperature. Thus, solar radiation management ``geoengineering'' proposals to completely offset global mean temperature increases by reducing the amount of absorbed sunlight might be expected to slow the global water cycle and reduce runoff over land. However, proposed countering of global warming by increasing the albedo of marine clouds would reduce surface solar radiation only over the oceans. Here, for an idealized scenario, we analyze the response of temperature and the hydrological cycle to increased reflection by clouds over the ocean using an atmospheric general circulation model coupled to a mixed layer ocean model. When cloud droplets are reduced in size over all oceans uniformly to offset the temperature increase from a doubling of atmospheric CO(2), the global-mean precipitation and evaporation decreases by about 1.3% but runoff over land increases by 7.5% primarily due to increases over tropical land. In the model, more reflective marine clouds cool the atmospheric column over ocean. The result is a sinking motion over oceans and upward motion over land. We attribute the increased runoff over land to this increased upward motion over land when marine clouds are made more reflective. Our results suggest that, in contrast to other proposals to increase planetary albedo, offsetting mean global warming by reducing marine cloud droplet size does not necessarily lead to a drying, on average, of the continents. However, we note that the changes in precipitation, evaporation and P-E are dominated by small but significant areas, and given the highly idealized nature of this study, a more thorough and broader assessment would be required for proposals of altering marine cloud properties on a large scale.
Resumo:
[1] D. Tse and P. Viswanath, Fundamentals of Wireless Communication.Cambridge University Press, 2006. [2] H. Bolcskei, D. Gesbert, C. B. Papadias, and A.-J. van der Veen, Spacetime Wireless Systems: From Array Processing to MIMO Communications.Cambridge University Press, 2006. [3] Q. H. Spencer, C. B. Peel, A. L. Swindlehurst, and M. Haardt, “An introduction to the multiuser MIMO downlink,” IEEE Commun. Mag.,vol. 42, pp. 60–67, Oct. 2004. [4] K. Kusume, M. Joham,W. Utschick, and G. Bauch, “Efficient tomlinsonharashima precoding for spatial multiplexing on flat MIMO channel,”in Proc. IEEE ICC’2005, May 2005, pp. 2021–2025. [5] R. Fischer, C. Windpassinger, A. Lampe, and J. Huber, “MIMO precoding for decentralized receivers,” in Proc. IEEE ISIT’2002, 2002, p.496. [6] M. Schubert and H. Boche, “Iterative multiuser uplink and downlink beamforming under SINR constraints,” IEEE Trans. Signal Process.,vol. 53, pp. 2324–2334, Jul. 2005. [7] ——, “Solution of multiuser downlink beamforming problem with individual SINR constraints,” IEEE Trans. Veh. Technol., vol. 53, pp.18–28, Jan. 2004. [8] A. Wiesel, Y. C. Eldar, and Shamai, “Linear precoder via conic optimization for fixed MIMO receivers,” IEEE Trans. Signal Process., vol. 52,pp. 161–176, Jan. 2006. [9] N. Jindal, “MIMO broadcast channels with finite rate feed-back,” in Proc. IEEE GLOBECOM’2005, Nov. 2005. [10] R. Hunger, F. Dietrich, M. Joham, and W. Utschick, “Robust transmit zero-forcing filters,” in Proc. ITG Workshop on Smart Antennas, Munich,Mar. 2004, pp. 130–137. [11] M. B. Shenouda and T. N. Davidson, “Linear matrix inequality formulations of robust QoS precoding for broadcast channels,” in Proc.CCECE’2007, Apr. 2007, pp. 324–328. [12] M. Payaro, A. Pascual-Iserte, and M. A. Lagunas, “Robust power allocation designs for multiuser and multiantenna downlink communication systems through convex optimization,” IEEE J. Sel. Areas Commun.,vol. 25, pp. 1392–1401, Sep. 2007. [13] M. Biguesh, S. Shahbazpanahi, and A. B. Gershman, “Robust downlink power control in wireless cellular systems,” EURASIP Jl. Wireless Commun. Networking, vol. 2, pp. 261–272, 2004. [14] B. Bandemer, M. Haardt, and S. Visuri, “Liner MMSE multi-user MIMO downlink precoding for users with multple antennas,” in Proc.PIMRC’06, Sep. 2006, pp. 1–5. [15] J. Zhang, Y. Wu, S. Zhou, and J. Wang, “Joint linear transmitter and receiver design for the downlink of multiuser MIMO systems,” IEEE Commun. Lett., vol. 9, pp. 991–993, Nov. 2005. [16] S. Shi, M. Schubert, and H. Boche, “Downlink MMSE transceiver optimization for multiuser MIMO systems: Duality and sum-mse minimization,”IEEE Trans. Signal Process., vol. 55, pp. 5436–5446, Nov.2007. [17] A. Mezghani, M. Joham, R. Hunger, and W. Utschick, “Transceiver design for multi-user MIMO systems,” in Proc. WSA 2006, Mar. 2006. [18] R. Doostnejad, T. J. Lim, and E. Sousa, “Joint precoding and beamforming design for the downlink in a multiuser MIMO system,” in Proc.WiMob’2005, Aug. 2005, pp. 153–159. [19] N. Vucic, H. Boche, and S. Shi, “Robust transceiver optimization in downlink multiuser MIMO systems with channel uncertainty,” in Proc.IEEE ICC’2008, Beijing, China, May 2008. [20] A. Ben-Tal and A. Nemirovsky, “Selected topics in robust optimization,”Math. Program., vol. 112, pp. 125–158, Feb. 2007. [21] D. Bertsimas and M. Sim, “Tractable approximations to robust conic optimization problems,” Math. Program., vol. 107, pp. 5–36, Jun. 2006. [22] P. Ubaidulla and A. Chockalingam, “Robust Transceiver Design for Multiuser MIMO Downlink,” in Proc. IEEE Globecom’2008, New Orleans, USA, Dec. 2008, to appear. [23] S. Boyd and L. Vandenberghe, Convex Optimization. Cambridge University Press, 2004. [24] G. H. Golub and C. F. V. Loan, Matrix Computations. The John Hopkins University Press, 1996.
Resumo:
We consider a framework in which several service providers offer downlink wireless data access service in a certain area. Each provider serves its end-users through opportunistic secondary spectrum access of licensed spectrum, and needs to pay primary license holders of the spectrum usage based and membership based charges for such secondary spectrum access. In these circumstances, if providers pool their resources and allow end-users to be served by any of the cooperating providers, the total user satisfaction as well as the aggregate revenue earned by providers may increase. We use coalitional game theory to investigate such cooperation among providers, and show that the optimal cooperation schemes can be obtained as solutions of convex optimizations. We next show that under usage based charging scheme, if all providers cooperate, there always exists an operating point that maximizes the aggregate revenue of providers, while presenting each provider a share of the revenue such that no subset of providers has an incentive to leave the coalition. Furthermore, such an operating point can be computed in polynomial time. Finally, we show that when the charging scheme involves membership based charges, the above result holds in important special cases.
Resumo:
An analog minimum-variance unbiased estimator(MVUE) over an asymmetric wireless sensor network is studied.Minimisation of variance is cast into a constrained non-convex optimisation problem. An explicit algorithm that solves the problem is provided. The solution is obtained by decomposing the original problem into a finite number of convex optimisation problems with explicit solutions. These solutions are then juxtaposed together by exploiting further structure in the objective function.
Resumo:
Bid optimization is now becoming quite popular in sponsored search auctions on the Web. Given a keyword and the maximum willingness to pay of each advertiser interested in the keyword, the bid optimizer generates a profile of bids for the advertisers with the objective of maximizing customer retention without compromising the revenue of the search engine. In this paper, we present a bid optimization algorithm that is based on a Nash bargaining model where the first player is the search engine and the second player is a virtual agent representing all the bidders. We make the realistic assumption that each bidder specifies a maximum willingness to pay values and a discrete, finite set of bid values. We show that the Nash bargaining solution for this problem always lies on a certain edge of the convex hull such that one end point of the edge is the vector of maximum willingness to pay of all the bidders. We show that the other endpoint of this edge can be computed as a solution of a linear programming problem. We also show how the solution can be transformed to a bid profile of the advertisers.
Resumo:
Changes in vegetation are taking place due to anthropogenic activities since the colonization of the evergreen forest zone of Western Ghats. The forests of the Western Ghats were contiguous and uniformly rich in endemism within each climatic and physiographic regime. The region continues to be one of the biodiversity hot spots of the world. However unplanned developmental activities are altering the balance of the ecosystem. This study focuses on the floristic structure, composition and diversity of forests with varying degree of human disturbances. Based on the investigations, various strategies for conservation and sustainable utilization of forest resources were proposed.
Resumo:
We consider a joint power control and transmission scheduling problem in wireless networks with average power constraints. While the capacity region of a wireless network is convex, a characterization of this region is a hard problem. We formulate a network utility optimization problem involving time-sharing across different "transmission modes," where each mode corresponds to the set of power levels used in the network. The structure of the optimal solution is a time-sharing across a small set of such modes. We use this structure to develop an efficient heuristic approach to finding a suboptimal solution through column generation iterations. This heuristic approach converges quite fast in simulations, and provides a tool for wireless network planning.
Resumo:
A geometric and non parametric procedure for testing if two finite set of points are linearly separable is proposed. The Linear Separability Test is equivalent to a test that determines if a strictly positive point h > 0 exists in the range of a matrix A (related to the points in the two finite sets). The algorithm proposed in the paper iteratively checks if a strictly positive point exists in a subspace by projecting a strictly positive vector with equal co-ordinates (p), on the subspace. At the end of each iteration, the subspace is reduced to a lower dimensional subspace. The test is completed within r ≤ min(n, d + 1) steps, for both linearly separable and non separable problems (r is the rank of A, n is the number of points and d is the dimension of the space containing the points). The worst case time complexity of the algorithm is O(nr3) and space complexity of the algorithm is O(nd). A small review of some of the prominent algorithms and their time complexities is included. The worst case computational complexity of our algorithm is lower than the worst case computational complexity of Simplex, Perceptron, Support Vector Machine and Convex Hull Algorithms, if d
Resumo:
To realistically simulate the motion of flexible objects such as ropes, strings, snakes, or human hair,one strategy is to discretise the object into a large number of small rigid links connected by rotary or spherical joints. The discretised system is highly redundant and the rotations at the joints (or the motion of the other links) for a desired Cartesian motion of the end of a link cannot be solved uniquely. In this paper, we propose a novel strategy to resolve the redundancy in such hyper-redundant systems.We make use of the classical tractrix curve and its attractive features. For a desired Cartesian motion of the `head'of a link, the `tail' of the link is moved according to a tractrix,and recursively all links of the discretised objects are moved along different tractrix curves. We show that the use of a tractrix curve leads to a more `natural' motion of the entire object since the motion is distributed uniformly along the entire object with the displacements tending to diminish from the `head' to the `tail'. We also show that the computation of the motion of the links can be done in real time since it involves evaluation of simple algebraic, trigonometric and hyperbolic functions. The strategy is illustrated by simulations of a snake, tying of knots with a rope and a solution of the inverse kinematics of a planar hyper-redundant manipulator.
Resumo:
The literature on pricing implicitly assumes an "infinite data" model, in which sources can sustain any data rate indefinitely. We assume a more realistic "finite data" model, in which sources occasionally run out of data; this leads to variable user data rates. Further, we assume that users have contracts with the service provider, specifying the rates at which they can inject traffic into the network. Our objective is to study how prices can be set such that a single link can be shared efficiently and fairly among users in a dynamically changing scenario where a subset of users occasionally has little data to send. User preferences are modelled by concave increasing utility functions. Further, we introduce two additional elements: a convex increasing disutility function and a convex increasing multiplicative congestion-penally function. The disutility function takes the shortfall (contracted rate minus present rate) as its argument, and essentially encourages users to send traffic at their contracted rates, while the congestion-penalty function discourages heavy users from sending excess data when the link is congested. We obtain simple necessary and sufficient conditions on prices for fair and efficient link sharing; moreover, we show that a single price for all users achieves this. We illustrate the ideas using a simple experiment.
Resumo:
Condensation of water droplets during rapid evaporation of a polymer solution, under humid conditions, has been known to generate uniformly porous polymer films. Similar porous films are also formed when a solution of the polymer in THF containing small amounts of water, is allowed to evaporate rapidly under air flow; this suggests that water droplets may be formed during the final stages of film formation. In the presence of added surfactants, the interface of water droplets could become lined with the surfactants and consequently the internal walls of the pores generated, upon removal of the water, could become decorated with the hydrophilic head groups of the surfactant molecules. In a series of carefully designed experiments, we have examined the effect of added surfactants, both anionic and cationic, on the formation of porous PMMA films; the films were prepared by evaporating a solution of the polymer in THF containing controlled amounts of aqueous surfactant solutions. We observed that the average size of the pores decreases with increasing surfactant concentration, while it increases with increasing amounts of added water. The size of the pores and their distribution were examined using AFM and IR imaging methods. Although IR imaging possessed inadequate resolution to confirm the presence of surfactants at the pore surface, exchange of the inorganic counterion, such as the sodium-ion of SDS, with suitable ionic organic dyes permitted the unequivocal demonstration of the presence of the surfactants at the interface by the use of confocal fluorescence microscopy.