Tag: problem

Complexity of Scheduling Problem with Ordering Dependent Scheduling Time

I have a problem that’s as follows:

Single machine, n jobs, and initial processing times P_i. We’re also given a directed weighted graph with weights w_{ij}. The difference in this problem is that after scheduling job k, we reduce the processing times for all neighbors of k by the corresponding edge weight (e.g. if l is a neighbor of k, then processing time of l decreases by w_{kl}).

Goal is to minimize makespan. There are no release dates or preemption.

Is there any work done on this problem? In particular, I’m wondering about the computational complexity. There is some related literature I found on position-dependent processing times (e.g. this) but I haven’t found anything with a general graph structure that I described.

server host key usage problem

I have my server host key(private key) in Openssl format that i want to use for server authentication. I prefer to use the trust model that client local database should associates each host name with the corresponding public host key. Since openssl format key is not supported in openssh architecture, i am looking a solution that should convert my openssl format private key to openssh format private key. Appreciate any help to resolve this problem

how to drag and drop word by word and drop into each edit text place of same activity ..plz help i am facing problem [on hold]

@Override public boolean onDrag(View v, DragEvent event) {     int action = event.getAction();     switch (action) {          case DragEvent.ACTION_DRAG_STARTED:             // dx = v.getX()-event.getX();           //  dy = v.getY()-event.getY();                if (event.getClipDescription().hasMimeType(ClipDescription.MIMETYPE_TEXT_PLAIN)) {             //    v.setX(event.getX()+ dx);             //    v.setY(event.getY() + dy);                 return true;             }             return false;          case DragEvent.ACTION_DRAG_ENTERED:             v.invalidate();             return true;          case DragEvent.ACTION_DRAG_LOCATION:              return true;          case DragEvent.ACTION_DRAG_EXITED:             v.invalidate();             return true;          case DragEvent.ACTION_DROP:              ClipData.Item item = event.getClipData().getItemAt(0);             // Gets the text data from the item.             String dragData = item.getText().toString();             // Displays a message containing the dragged data.             Toast.makeText(this, "Dragged data is " + dragData, Toast.LENGTH_SHORT).show();             v.invalidate();              View vw = (View) event.getLocalState();              ViewGroup owner = (ViewGroup) vw.getParent();             owner.removeView(vw); //remove the dragged view             ConstraintLayout constraintLayout = (ConstraintLayout) v;             constraintLayout.addView(vw);              vw.setVisibility(View.VISIBLE);//finally set Visibility to VISIBLE             //Returns true. DragEvent.getResult() will return true.             return true;           case DragEvent.ACTION_DRAG_ENDED:             v.invalidate();              if (event.getResult())                 Toast.makeText(this, "The drop was handled.", Toast.LENGTH_SHORT).show();             else                 Toast.makeText(this, "The drop didn't work.", Toast.LENGTH_SHORT).show();             return true;         // An unknown action type was received.         default:             Log.e("DragDrop Example", "Unknown action type received by OnDragListener.");             break;     }     return false; }

Any problem if i didn’t travel with the agency who applied for my Visa, and travel on my own

I have applied for a schengen visa along with family through a travel agency and got it as 3 months multiple as the trip itinerary required a multiple one. Later the agency cancelled that entire trip due to some problems and refunded us. Now i am planning to visit Europe as a solo trip (almost same countries in travel agency’s itinerary including visa issued country) and my doubt is about changed date’s, itinerary, flight details and hotel bookings. Will there any problem? Should i follow agency’s itinerary when travelling? (Like point of entry, Number of days in a country)

Strange problem with rotation missile | unity3d – c#

I have a vertical missile with launcher that should find closest target and fire it’s rocket to hitting target!

I use complete code of this 12min tutorial for launching my rocket, and the different between mine and its about the direction of rocket, mine is vertical and its horizontal!

homingMissile.velocity = transform.forward * missileVelocity; Quaternion targetRotation = Quaternion.LookRotation(target.position - transform.position); homingMissile.MoveRotation(Quaternion.RotateTowards(transform.rotation, targetRotation, turn));

After running the code, the rotation of my rocket change from (0,0,0) to (-8 .3,-4.7,0)!!!! and just change a little while hit target and explosion do.

In fact my rocket move to target in right path, but in wrong rotation!, in STRANGE!

Standby Rocket Standby Rocket

Moving to Target Moving to Target

Problem with offline repository downloaded through apt-mirror

I created an offline repository through apt-mirror using the package sources from Linux Mint 19.1 Cinnamon (64-bit). The download completed with no errors, yet when I run “sudo apt update” on an offline computer (same OS), I receive the following errors:

Download is performed unsandboxed as root as file ‘/media/leon/REPO/packages.linuxmint.com/dists/tessa/InRelease’ couldn’t be accessed by user ‘_apt’. – pkgAcquire::Run (13: Permission denied)Failed to obtain store:/var/lib/apt/lists/partial/_media_leon_REPO_archive.ubuntu.com_ubuntu_dists_bionic_main_dep11_Components-amd64.yml Cannot open file /var/lib/apt/lists/partial/_media_leon_REPO_archive.ubuntu.com_ubuntu_dists_bionic_main_dep11_Components-amd64.yml – open (13: Permission denied)Failed to obtain store:/var/lib/apt/lists/partial/_media_leon_REPO_archive.ubuntu.com_ubuntu_dists_bionic-updates_main_dep11_Components-amd64.yml Cannot open file /var/lib/apt/lists/partial/_media_leon_REPO_archive.ubuntu.com_ubuntu_dists_bionic-updates_main_dep11_Components-amd64.yml – open (13: Permission denied)Failed to obtain store:/var/lib/apt/lists/partial/_media_leon_REPO_archive.ubuntu.com_ubuntu_dists_bionic-backports_universe_dep11_Components-amd64.yml Cannot open file /var/lib/apt/lists/partial/_media_leon_REPO_archive.ubuntu.com_ubuntu_dists_bionic-backports_universe_dep11_Components-amd64.yml – open (13: Permission denied)Failed to obtain store:/var/lib/apt/lists/partial/_media_leon_REPO_security.ubuntu.com_ubuntu_dists_bionic-security_main_dep11_Components-amd64.yml Cannot open file /var/lib/apt/lists/partial/_media_leon_REPO_security.ubuntu.com_ubuntu_dists_bionic-security_main_dep11_Components-amd64.yml – open (13: Permission denied)Some index files could not be downloaded, have been omitted, or old ones used instead.

I scouted the Internet for answers and everybody suggests that the issue is because apt has no permissions for the folder and its contents, but it is owned by the _apt user and the root group, yet APT complains that it cannot access those files. I don’t understand what’s going on. Please help. Thanks in advance.

Does there exist an undecidable problem such that the answer is YES for exactly one input to a UTM, and NO for all others?

Suppose I have a universal Turing Machine (UTM) which accepts some input in binary. Is there a computational problem such that the answer to the problem is YES (accepting) for exactly one input (and hence NO for all others), but determining which input is the accepting one is undecidable? Or is there a fundamental reason this cannot happen? Or is determining if this problem exists undecidable?

I assume this is equivalent to asking: is there a property of TMs such that this property is true for exactly one TM and not true for all others such that determining which TM this is true for is undecidable?

Does there exist an undecidable problem such that the answer is YES for exactly one input to a UTM, and NO for all others?

Suppose I have a universal Turing Machine (UTM) which accepts some input in binary. Is there a computational problem such that the answer to the problem is YES (accepting) for exactly one input (and hence NO for all others), but determining which input is the accepting one is undecidable? Or is there a fundamental reason this cannot happen? Or is determining if this problem exists undecidable?

I assume this is equivalent to asking: is there a property of TMs such that this property is true for exactly one TM and not true for all others such that determining which TM this is true for is undecidable?