Search Results: 1 - 10 of 100 matches for " "
All listed articles are free for downloading (OA Articles)
Page 1 /100
Display every page Item
Pseudonymous Privacy Preserving Buyer-Seller Watermarking Protocol
Neelesh Mehra,Madhu Shandilya
International Journal of Computer Science Issues , 2011,
Abstract: A buyer-seller watermarking protocol utilize watermarking along with cryptography for copyright and copy protection for the seller and meanwhile it also preserve buyers rights for privacy. Up to now many secure BSW protocol has been suggested but the common problem with all of them is that in all of them is the buyers involvement in generation of some cryptographic key or watermark or digital signature what happened if buyer is not capable or is a layman and does not understand what cryptography and watermarking means. In this paper we proposed the use of open access identification concept for this buyer has to get registered with some trusted third party which after registration provide an open access ID which is unique. This not only provide anonymity to buyer but the seller can also provide some benefit to his loyal customers. In our scheme non of the watermark or cryptographic key is generated by buyer so a layman buyer can also use it. It also enables a seller to successfully identify a malicious seller from a pirated copy, while preventing the seller from framing an innocent buyer and provide anonymity to buyer.
Group buying with bundle discounts: computing efficient, stable and fair solutions  [PDF]
Lorenzo Coviello,Massimo Franceschetti
Computer Science , 2015,
Abstract: We model a market in which nonstrategic vendors sell items of different types and offer bundles at discounted prices triggered by demand volumes. Each buyer acts strategically in order to maximize her utility, given by the difference between product valuation and price paid. Buyers report their valuations in terms of reserve prices on sets of items, and might be willing to pay prices different than the market price in order to subsidize other buyers and to trigger discounts. The resulting price discrimination can be interpreted as a redistribution of the total discount. We consider a notion of stability that looks at unilateral deviations, and show that efficient allocations - the ones maximizing the social welfare - can be stabilized by prices that enjoy desirable properties of rationality and fairness. These dictate that buyers pay higher prices only to subsidize others who contribute to the activation of the desired discounts, and that they pay premiums over the discounted price proportionally to their surplus - the difference between their current utility and the utility of their best alternative. Therefore, the resulting price discrimination appears to be desirable to buyers. Building on this existence result, and letting N, M and c be the numbers of buyers, vendors and product types, we propose a O(N^2+NM^c) algorithm that, given an efficient allocation, computes prices that are rational and fair and that stabilize the market. The algorithm first determines the redistribution of the discount between groups of buyers with an equal product choice, and then computes single buyers' prices. Our results show that if a desirable form of price discrimination is implemented then social efficiency and stability can coexists in a market presenting subtle externalities, and computing individual prices from market prices is tractable.
A note about rappels and uniform discounts Nota sobre los rappels y los descuentos uniformes  [cached]
Antonio Maga?a,Francesc Carreras,Manel Rajadell
Intangible Capital , 2009, DOI: 10.3926/ic.146
Abstract: We consider commercial discounts for buying based on rappels. If a uniform type discount is taken, then an unwanted paradox appears: the “buyer trick”. To avoid this paradox, two proposals are presented. Both of them observe the basic principle “to a greater order, a greater discount”. The first one is that of continuous discounts. The second consists of following a table of graded discounts. Consideramos los descuentos comerciales por compras basados en rappels. Si se plantea un descuento de tipo uniforme aparece una paradoja no deseada: el “truco del comprador”. Para eludirla se proponen dos variantes que respetan el principio básico de “a mayor pedido, mayor descuento”. La primera es la de los descuentos continuos. La segunda, la de los descuentos graduales.
Higgs mechanism and renormalization group flow: are they compatible?  [PDF]
Michael Duetsch
Physics , 2015,
Abstract: Usually the Lagrangian of a model for massive vector bosons is derived in a geometric way by the Higgs mechanism. We investigate whether this geometric structure is maintained under the renormalization group (RG) flow. Using the framework of Epstein-Glaser renormalization, we find that the answer is 'no', if the renormalization mass scale(s) are chosen in a way corresponding to the minimal subtraction scheme. This result is derived for the $U(1)$-Higgs model to 1-loop order. On the other hand we give a model-independent proof that physical consistency, which is a weak form of BRST-invariance of the time-ordered products, is stable under the RG-flow.
Compatible Poisson-Lie structures on the loop group of $SL_{2}$  [PDF]
B. Enriquez,V. N. Rubtsov
Mathematics , 1995, DOI: 10.1007/BF01815525
Abstract: We define a 1-parameter family of $r$-matrices on the loop algebra of $sl_{2}$, defining compatible Poisson structures on the associated loop group, which degenerate into the rational and trigonometric structures, and study the Manin triples associated to them.
Renormalization group flow and parallel transport with non-metric compatible connections  [PDF]
Brian P. Dolan,Alex Lewis
Physics , 1999, DOI: 10.1016/S0370-2693(99)00792-3
Abstract: A family of connections on the space of couplings for a renormalizable field theory is defined. The connections are obtained from a Levi-Civita connection, for a metric which is a generalisation of the Zamolodchikov metric in two dimensions, by adding a family of tensors which are solutions of the renormalization group equation for the operator product expansion co-efficients. The connections are torsion free, but not metric compatible in general. The renormalization group flows of N=2 supersymmetric Yang-Mills theory in four dimensions and the O(N)-model in three dimensions, in the large $N$ limit, are analysed in terms of parallel transport under these connections.
Every smooth p-adic Lie group admits a compatible analytic structure  [PDF]
Helge Glockner
Mathematics , 2003,
Abstract: We show that every finite-dimensional p-adic Lie group of class C^k admits a C^k-compatible analytic Lie group structure.
Survey on buyer coalition mechanisms
L. Boongasame
Applied Mathematical Sciences , 2013,
Abstract: This paper surveys and analyzes the state of the art of buyer coalitionmechanisms, paying attention to single item and bundle of items aspects.From the exits buyer coalition schemes, the solution concepts of theirmechanisms are concerned with are related to both cooperative andnon-cooperative game theory. Finally, we conclude by discussing thefuture directions of buyer coalition mechanisms.
Zoran Babi?,Tunjo Peri?,Sead Re?i?
Human : Research in Rehabilitation , 2012,
Abstract: Vendor selection is a very significant business problem for ensuring the competitiveness on the market. That is why companies pay great attention to this problem. To solve the vendor selection problems can be applied to a number of quantitative methods. Depending on the goals of the company the vendor selection can be a mono-criterion or multi-criterion programming problem. This paper deals with the problem of vendor selection and determining procurement quotas from selected vendors under conditions where vendors offer discounts to the total order value within a specified period where the buyer buys more products from the vendors. The total value of procurement costs in a given period is taken as an optimization criterion. In this paper the specific flour purchase problem is solved for a company that manufactures bakery products.
Privacy-protected Multimodal Biometric-based Group Authentication Scheme for ATM
B. Shanthini,S. Swamynathan
Information Technology Journal , 2013,
Abstract: Biometrics based authentication is a potential candidate to replace token-based authentication especially in Automatic Teller Machines (ATMs). The financial sector has used ATMs as a means to make payments and to offer financial services for its clients. But, security is a major issue in accessing these machines in particular for authenticating a group of users who have joint account in the financial institutions. So, in this study, a simple but efficient group authentication mechanism is proposed in which multimodal biometric is used for authenticating the group of customers instead of the existing practice of using multi ATM cards. Privacy and revocability are the main concern while using biometrics. So the biometric used are not stored as such instead a cancelable form, generated by genetic operator is stored and by that way privacy is protected and also revocability is ensured.
Page 1 /100
Display every page Item

Copyright © 2008-2017 Open Access Library. All rights reserved.