Search Results

Search found 25727 results on 1030 pages for 'solution'.

Page 675/1030 | < Previous Page | 671 672 673 674 675 676 677 678 679 680 681 682  | Next Page >

• How can I include .pdf files when I publish but not in a search and replace in visual studio?

  - by Mike

  More specifically my problem is if I include a pdf in my project and set its build action to content so it gets copied to the server when I publish, is there a way to exclude it from visual studios search and replace feature. Would a post build action be a solution to this? I just don't want anybody to do a global search and replace in my project and mess up the pdfs... I know I just said a mouth full so let me know if you need clarification. Thanks!!!

  Read the article

• Why does copying a file using FileInfo.CopyTo creates the destination copied file as readonly ?

  - by Puneet Dudeja

  I have two folders in my asp.net web application in which I create new folders programmaticaly. The entire solution is under VSS source control. I was not able to manipulate these two folders programmably. For that, I gave {MACHINE}\ASPNET user account full control over these two folders. Still, the "access denied to the path" error was coming. I saw that these entire folders were marked readonly. I tried to uncheck Readonly from explorer but not successfull, readonly check does not get removed. Also, if I copy files using method, the destinationn copied file becomes readonly. I have also tried File.SetAttributes(path,FileAttributes.Normal); but no success. How can I make the copied file not READONLY ?

  Read the article

• Android Paypal One time Payment

  - by Ameya

  Hi All, Does any one know, or is it possible to do one time payment, with paypal in android ? Consider the senario. Buyer purchases installs free application. Clicks on paypal module and makes in-app payment, purchases feature successfully. Buyer deletes application. All information including the feature purchase enty in database is deleted. Buyer reinstalls the application. Here is the catch, if he wants to use the feature he will have to do a re-purchase. Which I wann to avoid in my application. This is taken care in iPhoen in-app purchase. That is if a buyer has already purchased an feture or in-app item, and if he trys to repurchase it (item has been set to one time payment) , the in-app purchase transaction will succeed without the user actually having to repay for the item. Is there an solution for this can anyone help.

  Read the article

• Using indexes on/through a MySQL view

  - by Peeja

  We've got a MySQL table in which rows are never updated, but instead new rows are added and the old ones marked obsolete. Think Rails' acts_as_paranoid, but for every update. To make working with Rails sane, we've got a view which selects only the rows which are "current". That makes a much better "table" for our ActiveRecord model. The snag: our indexes aren't being used anymore. Queries on the view don't use the underlying tables' indexes. You can't add an index to a view. Without indexes, the app is unbearably slow. The only solution we've come up with is to build a materialized view, but that's a pain in MySQL because they're not natively supported. Is there a better way to do this?

  Read the article

• Push notification does not happening when app is not running - android

  - by iShare

  I am using Urban Airship for Push notification. Its works like a charm but just found that its did not sending push notification when application is not running. How to handle this? I am sure its a common scenario and there will be a solution. I checked many posts in stack overflow but most of them are for iOS. I want for Android AirshipConfigOptions options = AirshipConfigOptions.loadDefaultOptions(this); UAirship.takeOff(this, options); Logger.logLevel = Log.VERBOSE; PushManager.shared().setIntentReceiver(IntentReceiver.class); PushManager.enablePush();

  Read the article

• How do I query/filter a to-many relationship in Core Data

  - by Kris Bixler

  I have Customer, Event and Address objects in my data model. Both Customer and Address have a one-to-many relationship to Event. I can get the distinct list of addresses for a customer's events for by doing this: NSSet *addressSet = [customer valueForKeyPath:@"events.address"]; For the part of the UI I'm working on now, I need to display the address from the most recent event prior to now that has an address. I'm starting to go down the path of creating a NSFetchRequest, setting it's entity, sort descriptors, predicate and then looping through the results, but it seems like a lot of code. Am I missing some obvious way of filtering/sorting on the "events" relationship of the Customer object or is creating the NSFetchRequest the best solution?

  Read the article

• Reading web-service information from assembly app.config file

  - by Benjamin Ortuzar

  I have a plugin architecture solution written in .NET C# 3.5, where each plug-in is an assembly loaded by the main project. Each plug-in connects to a different web-service, so I would like to have the configuration of that plugin in its own plugin.dll.config file instead of having it in the app.config of the main project. I have been looking around and I saw that i could load from each class its own config file: // Get the application configuration file. System.Configuration.Configuration config = ConfigurationManager.OpenMappedExeConfiguration(fileMap,userLevel) I see how that would help me get the basic settings from the appSettings section, but I cant see a way to read the web-service information stored in the plugin.dll.config file. Any help on how to approach this situation is very welcome.

  Read the article

• How to update the following rows after the sum of the previous rows reach a threshold? MySQL

  - by Paulo Faria

  I want to update the following rows after the sum of the previous rows reach a defined threshold. I'm using MySQL, and trying to think of a way to solve this using SQL only. Here's an example. Having the threshold 100. Iterating through the rows, when the sum of the previous rows amount = 100, set the following rows to checked. Before the operation: | id | amount | checked | | 1 | 50 | false | | 2 | 50 | false | | 3 | 20 | false | | 4 | 30 | false | After the operation: | id | amount | checked | | 1 | 50 | false | | 2 | 50 | false | <- threshold reached (50 + 50 = 100) | 3 | 20 | true* | | 4 | 30 | true* | Is it possible to do it with just a SQL query? Do I need a stored procedure? How could I implement it using either solution?

  Read the article

• Is there an easy way to setup the android emulator to access the LAN of the host machine ?

  - by Longfield

  I would like to access a web service provided by one of the machines on my LAN from the android emulator. If the service was running on the same machine where the emulator is running (called host), I could add a network redirection and access the 10.0.2.2 (host loopback interface in the emulator) with the correct port. However it is running on another machine on the LAN. I guess I could add another redirection on the host additionally to the above one (would have to fight with iptables though ... ), but does a more simple solution exist ?

  Read the article

• Mac OSX: Passing a link to file from user process to kernel module.

  - by Inso Reiges

  Hello, I need to pass a link to file from a user process to the OSX kernel driver. By link i mean anything that uniquely identifies a file on the local filesystem. I need that link to do I/O on that file in kernel. The most obvious solution seems to pass a file name and use a VFS vnode lookup. However i noticed, that Apple Disk Images helper process passes a raw data array for image-path property to driver when attaching a disk image file: <2f 56 6f 6c 75 6d 65 73 2f 73 74 6f 72 61 67 65 2f 74 65 73 74 32 2e 64 6d 67> What is that diskimages-helper passes to the kernel driver? Some serialized type perhaps? If yes, what type is it and how can i use it?

  Read the article

• What is the difference between causal models and directed graphical models?

  - by Neil G

  What is the difference between causal models and directed graphical models? or: What is the difference between causal relationships and directed probabilistic relationships? or, even better: What would you put in the interface of a DirectedProbabilisticModel class, and what in a CausalModel class? Would one inherit from the other? Collaborative solution: interface DirectedModel { map<Node, double> InferredProbabilities(map<Node, double> observed_probabilities, set<Node> nodes_of_interest) } interface CausalModel: DirectedModel { bool NodesDependent(set<Node> nodes, map<Node, double> context) map<Node, double> InferredProbabilities(map<Node, double> observed_probabilities, map<Node, double> externally_forced_probabilities, set<Node> nodes_of_interest) }

  Read the article

• Google Translate set default language

  - by tdurham

  Maybe this has an obvious solution that I'm overlooking, but I can't seem to find the correct parameter to put in to make this happen. Using the Google Translate widget on a site, I need to set the default language that the user sees when entering the site, even though the site is english. function googleTranslateElementInit() { new google.translate.TranslateElement({ pageLanguage: 'en' }, 'google_translate_element'); } I've tried adding: defaultLanguage: 'fr' and tried: targetLanguage: 'fr' I did find some nice jQuery solutions, but didn't want to bypass this if it was an easy fix. Thanks in advance.

  Read the article

• Why are difference lists more efficient than regular concatenation?

  - by Craig Innes

  I am currently working my way through the Learn you a haskell book online, and have come to a chapter where the author is explaining that some list concatenations can be ineffiecient: For example ((((a ++ b) ++ c) ++ d) ++ e) ++ f Is supposedly inefficient. The solution the author comes up with is to use 'difference lists' defined as newtype DiffList a = DiffList {getDiffList :: [a] -> [a] } instance Monoid (DiffList a) where mempty = DiffList (\xs -> [] ++ xs) (DiffList f) `mappend` (DiffList g) = DiffList (\xs -> f (g xs)) I am struggling to understand why DiffList is more computationally efficient than a simple concatenation in some cases. Could someone explain to me in simple terms why the above example is so inefficient, and in what way the DiffList solves this problem?

  Read the article

• Accessing form's resources (resx file) from code

  - by kzen

  If I have a form Frm1.cs that is using some icons, images or other resources, these resources get stored in the form's resx file (Frm1.resx). My simple question is how do I access these resources from code? As a workaround I can store these resources in the Project resource file and they will be available via Properties.Resources.resourcename. However, similar syntax does not work for the resources stored in the form's resource file. While searching for a solution I have come across several references to ResourceManager class but was not able to find a way to use that to access the form's resources...

  Read the article

• Facebook javascript in address bar, possible to replicate?

  - by DoMx

  This is my first experience with stackoverflow and I'm afraid my question asks of a lot for a first. I was looking at this thread: http://stackoverflow.com/questions/2634159/javascrypt-in-the-adress-bar-is-this-malicious and as you will see SLaks has very kindly deobfuscated the javascript and left us with what appears as the Javascript behind the automatic facebook invite code. As I'm fairly new to javascript, I was wondering, what other components were needed to get this code to work? You of course have the functions there and they are called by the obfuscated javascript but how exactly? Would it be possible to replicate this on a page of my own using the information available or is there more to this script I am missing? I am willing to financially assist somebody who could compile a solution for me. Thank you in advance.

  Read the article

• Measuring the performance of classification algorithm

  - by Silver Dragon

  I've got a classification problem in my hand, which I'd like to address with a machine learning algorithm ( Bayes, or Markovian probably, the question is independent on the classifier to be used). Given a number of training instances, I'm looking for a way to measure the performance of an implemented classificator, with taking data overfitting problem into account. That is: given N[1..100] training samples, if I run the training algorithm on every one of the samples, and use this very same samples to measure fitness, it might stuck into a data overfitting problem -the classifier will know the exact answers for the training instances, without having much predictive power, rendering the fitness results useless. An obvious solution would be seperating the hand-tagged samples into training, and test samples; and I'd like to learn about methods selecting the statistically significant samples for training. White papers, book pointers, and PDFs much appreciated!

  Read the article

• Obtain the pathName dinamically for ASP.NET MVC

  - by vikitor

  Hello, I'm looking for a solution that allows me to get the parent page pathname from a partialView invoked. For example I have an Action baa and a controller boo so the javascript to obtain this will be window.location.pathname, and it returns /boo/baa. The thing is that I use a partial view, so when I try to retrieve the pathname via the URL helper, what I obtain is the PartialView one, and what I need is the pathname for the action that invokes it. I want to do this because I want to show certain things of the partial view depending on the pathname of the parent view that invokes it. Is there a way to do this with ASP.NET MVC? Thank you all in advance,

  Read the article

• ModX: Selecting and outputting specific menu items using Wayfinder

  - by Staffan Estberg

  tI've been trying to output specific menu items, also wanting to change the names of some, without satisfying results. The problem is that I have three different menu setups throughout the site - the header split into two sections and the footer divided into a couple of columns. This is what I've tried so far - [[Wayfinder? &startId=0 &level=1 &limit=5 &excludeDocs=49,61,55]] While it works excluding all the other links isn's the most optimal solution as there are 11 in total plus I want to be able to 1. rearrange the order and 2. change the names of two of them. Is this possible at all using the Wayfinder or do I have to create a snippet? Thanks in advance.

  Read the article

• Use LINQ to count the number of combinations existing in two lists

  - by Ben McCormack

  I'm trying to create a LINQ query (or queries) that count the total number of occurences of a combinations of items in one list that exist in a different list. For example, take the following lists: CartItems DiscountItems ========= ============= AAA AAA AAA BBB AAA BBB BBB CCC CCC DDD The result of the query operation should be 2 since I can find two combinations of AAA and BBB (from DiscountItems) within the contents of CartItems. My thinking in approaching the query is to join the lists together to shorten CartItems to only include items from DiscountItems. The solution would be to find the CartItem in the resulting query that occurs the least amount of times, thus indicating how many combinations of items exist in CartItems. How can this be done? Here's the query I already have, but it's not working. query results in an enumeration with 100 items, far more than I expected. Dim query = From cartItem In Cart.CartItems Group Join discountItem In DiscountGroup.DiscountItems On cartItem.SKU Equals discountItem.SKU Into Group Select SKU = cartItem.SKU, CartItems = Group Return query.Min(Function(x) x.CartItems.Sum(Function(y) y.Quantity))

  Read the article

• Best practice -- Content Tracking Remote Data (cURL, file_get_contents, cron, et. al)?

  - by user322787

  I am attempting to build a script that will log data that changes every 1 second. The initial thought was "Just run a php file that does a cURL every second from cron" -- but I have a very strong feeling that this isn't the right way to go about it. Here are my specifications: There are currently 10 sites I need to gather data from and log to a database -- this number will invariably increase over time, so the solution needs to be scalable. Each site has data that it spits out to a URL every second, but only keeps 10 lines on the page, and they can sometimes spit out up to 10 lines each time, so I need to pick up that data every second to ensure I get all the data. As I will also be writing this data to my own DB, there's going to be I/O every second of every day for a considerably long time. Barring magic, what is the most efficient way to achieve this? it might help to know that the data that I am getting every second is very small, under 500bytes.

  Read the article

• Remove items from SWT tables

  - by Dima

  This is more of an answer I'd like to share for the problem I was chasing for some time in RCP application using large SWT tables. The problem is the performance of SWT Table.remove(int start, int end) method. It gives really bad performance - about 50msec per 100 items on my Windows XP. But the real show stopper was on Vista and Windows 7, where deleting 100 items would take up to 5 seconds! Looking into the source code of the Table shows that there are huge amount of windowing events flying around in this call.. That brings the windowing system to its knees. The solution was to hide the damn thing during this call: table.setVisible(false); table.remove(from, to); table.setVisible(true); That does wonders - deleting 500 items on both XP & Windows7 takes ~15msec, which is just an overhead for printing out time stamps I used. nice :)

  Read the article

• How can I find the nearest intersection via the Google Maps API?

  - by dusoft

  How can I find the closest intersection of the street I have coordinates of? For instance, say I have street A running from south to north that is crossed by street X on the north and by street Y on the south. Does the Google Maps API allow for finding coordinates of the nearest crossroad (either X or Y) of street A? I couldn't find it mentioned anywhere. PS: The only solution I am aware of is to guess the lowest number and the highest number of building on the street A and to draw polyline between them. I am not sure about this though.

  Read the article

• Time Complexities of recursive algorithms

  - by Peter

  Whenever I see a recursive solution, or I write recursive code for a problem, it is really difficult for me to figure out the time complexity, in most of the cases I just say its exponential? How is it exponential actually? How people say it is 2^n, when it is n!, when it is n^n or n^k. I have some questions in mind, let say find all permutations of a string (O(n!)) find all sequences which sum up to k in an array (exponential, how exactly do I calculate). Find all subsets of size k whose sum is 0 (will k come somewhere in complexity , it should come right?). Can any1 help me how to calculate the exact complexity of such questions, I am able to wrote code for them , but its hard understanding the exact time complexity.

  Read the article

• Are QR codes guaranteed to work?

  - by Kiz

  Not sure if this will get closed as "not a real question" but I asked this on Superuser and it was closed for that very reason. We are thinking of implementing a QR code which will be sent to a number of users via an email which links through to a webpage. Now I'm aware that you can just Google 'QR codes' and there are a plethora of options that allow you to make a QR code. My question is thus; if we do go with this solution can we guarantee that it would work cross platform? I.e. on Android, iOS, Symbian etc? Once a QR code is generated will it work on ANY app on ANY platform? Thanks and apologies if this is not really a 'programming question' Thanks Kiran

  Read the article

• Sending file over socket

  - by johannix

  I'm have a problem sending data as a file from one end of a socket to the other. What's happening is that both the server and client are trying to read the file so the file never gets sent. I was wondering how to have the client block until the server's completed reading the file sent from the client. I have this working with raw packets using send and recv, but figured this was a cleaner solution... Client: connects to server creating socket connection creates a file on socket and sends data waits for file from server Server: waits for file from client Complete interraction: client sends data to server server sends data to client

  Read the article

< Previous Page | 671 672 673 674 675 676 677 678 679 680 681 682  | Next Page >