Boolean Logic in Workflows?

Is it possible to perform any boolean logic in a Podcast Producer workflow? I'd like to set up a workflow that can potentially take in .flv files and pipe them through ffmpeg using the pcastaction shell command. I need to be able to check the file extension and if it's .flv then run the shell command, otherwise carry on normally.
Thanks,
Jason

It's not possible to do branching or conditional logic directly in the Xgrid tasks. But, for the scenario you described, you could write a shell task that determines if the input file is Flash video and then pre-process with ffmpeg, or return immediately if not.

Similar Messages

  • How to do IF THEN  ELSE logic in Workflow?

    I need to do "if then else" logic in Workflow. The key part of the probem is that there are several "else" (elsif) possibilities, so I can't use a Boolean or Yes/No as a return result code. When I use a function, I can't see a way to "check" the value before it passes to a next process. HELP!

    Whether you are using a function as your comparator or the Standard WF Compare Operators, this can be done. I will explain two scenarios, one with your own written functions as the comparator and the other using the standard Compare Text function.
    Create a PL/SQL procedure that returns a boolean. In this procedure you would pull two attributes from the workflow, the test case and the value you want to compare to. You would check to see if they are equal and return true, otherwise false. I do not know what you are trying to compare in your if statement, but whatever it is, if its true, return true, otherwise false.
    Now in the workflow, you would put a couple of these in your process diagram representing each if statement. Set the two (or more) attributes in the Node Attributes tab of each function node to the values you want to compare. For the first node, have the <true> transition go to whatever you want done and then to an END node. Have the <default> or <false> transition point to the next function node you have. Do the same for each one except at the last one, its only transition would be <default> and that would go to END. This way if the first function resolves true, it will do whatever should be done and then skip the rest of the conditions. If its false, it will go to the next conditional. The last one will be gotten to only if every other conditional was false that would be your final else statement.
    To do this with the Compare Text option, have the same set up in your workflow diagram exception have the <EQUALS> be your true path and the <DEFAULT> transition go to the next compare text node.
    -->O-{default}->O-{default}->O->default
         |                 |                 |             |
        true           true            true           |
         |                 |                 |             |
      doWork     doWork     doWork      else
         |                 |                 |             |
          ---------------->---------------->------------|
                                                          |
                                                      end

  • Can Visual Composer make decisions based on boolean logic?

    I need to know if I can use Visual Composer to manipulate data results based on boolean logic.  Basically, if a  month is less than the current month, I want a formula to dispay A instead of B. Can this be done? 
    Can I also say, if current month is greater than this month then hide values, else show values?

    In that case you don't need VC. I would then directly do that with BEx Query Designer and the use of a formula and boolean operators there. Here is the help of how you can achieve that:
    http://help.sap.com/saphelp_nw04/helpdata/en/23/17f13a2f160f28e10000000a114084/content.htm
    Once you created sthe query this way, you can use the BEx Analyzer to embed it in Excel, and then use Information Broadcasting to schedule the calculations.
    Of course if your requirements change and displayint that data in VC is good enough, then you can still go as mentioned in my answers above

  • Compound boolean logic scripting

    Greetings!  I would like to pick everyone's brains for how one might implement compound boolean logic scripting in LabVIEW ... specifically LabVIEW-RT.
    My application is an in-vehicle data acquistion and logging setup.  The app is setup so that the user provides a configuration file which is the list of channels (GPS, DAQ, CAN) that they wish to record...so this means there isn't any hard coded variable but an array of clusters built from the configuration file.
    A mode of operation is a 'trigger' mode, which means the logger doesn't record anything until a trigger has occured.  Currently the user provides a simple comparator (0=lessthan, 1=equalto, 2=greaterthan, else=none), and the trigger value.
    The users want to be able do compound conditions like PARAMETER <= x OR Parameter >= y ... possiblly even between 2 different data points like PARAMETER_A <= x AND PARAMETER_B >=y.
    Any comment, hints, tips, suggestions ?
    Thanks!
    Jason Stallard

    Jason,
    It's interesting how often the problem of text-based scripting to drive LV pops up.
    I had a problem with similar properties: given a set of data and an
    arbitrary set of rules, substitute data into each rule and see if it
    evaluates to true or false.  This is used to provide directions
    from engineers to operators on how to perform failure analysis and
    recovery, without the engineer needing to be present.
    The problem that I ran into turns out to not be in evaluating the data
    and rules, but in parsing the arbitrary input equation.  There
    just isn't any general way inherent to LV to parse an arbitrary text
    language into an intermediate form (like a postfix expression or an
    abstract syntax tree).  A relative lack of recursion makes it a
    little more painful as well.
    I can't release my code, but it essentially had three parts:
    1.  In a given rule in infix form (variableA<7, for instance),
    perform macro replacement.  Essentially, substitute values for
    variable names, perform file lookups, etc.
    2.  Transform the substituted infix equation into a much easier to
    deal with postfix equation.  (Thanks to Mike Porter for this
    suggestion as well).  This step can be non-trivial.  I'm
    currently building an editor that will build equations more easily,
    sparing my engineers much pain.
    3.  Evaluate the postfix equation for a single true/false
    result.  This algorithm should be available in many books, but I
    adapted the one from an earlier version of this book:
    http://www.amazon.com/gp/product/0201702975/qid=11​37608429/sr=2-3/ref=pd_bbs_b_2_3/103-3337903-13870​46?s=books&v=glance&n=283155
    It also contains a short description of a stack-based parser that's fairly easy to implement for step 2.
    Anyway, there's my 2 cents.  Maybe someday I'll find time to write
    that LV based parser generator to "simplify" all of this   Good
    luck!
    Joe Z.

  • Implies Boolean Logic

    Hi guys,
    just a bit stuck on something.
    In my programs i've been using a shift register and a not-implies boolean function to perform an action once only, when a value changed from false to true
    in boolean logic how would I spot a change so that a true to false change will provide true, but other states false?
    any help very much appreciated - got a bit of a hangover and my brain isn't flying at full-mast!
    cheers!

    Since the state of (one true/one false) has a different output depending on the motor running or not, you need a shift register to store the motor state. Only if both are equal, the state should change.
    The attached codelet shows one possibility.
    (edit: replaced booleans with counters in image. Thanks tst)Message Edited by altenbach on 04-03-2005 02:14 PM
    LabVIEW Champion . Do more with less code and in less time .
    Attachments:
    Motor1.gif ‏3 KB

  • Creating Boolean Logic formulas within Cell Editor

    Good afternoon,
    Does anyone know if boolean logic works within the cell editor?  I want to create boolean logic to choose a different help cell based on a condition.

    Hi,
    Check these help.sap links
    http://help.sap.com/saphelp_nw04/helpdata/en/23/17f13a2f160f28e10000000a114084/content.htm
    http://help.sap.com/saphelp_nw04/helpdata/en/c1/759b3c4d4d8d15e10000000a114084/content.htm
    Regards,
    DST

  • Boolean Logic in the Page

    Hi!
    I have a beginners problem that seems very trivial, but I can simply not find the solution. How do you do boolean logic in a JSF page. I want to be able to hide some buttons depending on some data in the bean, but I do not know how to do that. I guess what I am after is the equivalent of the Struts <logic:equal> and <logic:notEqual> tags.
    Regards,
    Magnus

    Use rendered attribute.
    For example:
    <h:commandButton value="Edit" action="edit" rendered="#{MyBean.editable}" />
    In this example, editable should be a bean property with type Boolean and public getter.
    Generally, you can use any expression based on JSF EL (JavaServer Faces Expression Language).
    For example:
    <h:commandButton value="Create" action="createUser" rendered="#{MyBean.userName == null }" />

  • Logic for workflow

    Hi All,
    Kindly help me out with the logic building for this scenario:
    There is a customized workflow attached with Purchase Requisition approval. This workflow has an Org structure based on departments. The approver is determined based on admin id or the workflow initiator.
    Issue is : if the same user has to create a PR for different department, he/she will have to login with the admin's id for that department.
    Requirement : Same user should be able to create PRs for any department.
    So, is there a way of adding this condition with minimum change ?

    Hi Ameekar
    As I understand it, your problem is that the current agent determination process is to select the appropriate approver based on the particular department creating the requsition.
    One solution might be to change the agent determination for the approval task to select the approver based on an Organizational Unit rather than by department.
    Org units are sort of free standing HR groupings.  You can create an Org unit.  Assign people to the Org unit and then designate that org unit as the agent for the approval task.  Thus in your case you could create an org unit of Approvers then assign multiple people to it and requsitions would be routed to the org unit for approval regardless of Department.
    Some things to consider:
    1. Everybody in the org unit will see the task in their worklist - first one to open it reserves it and others cannot work on it unless it's replaced back into the worklist
    2. It's nice for when people go on vacation, automatically takes care of the workload by allowing others to execute workitems
    3. It has the ability to deal with part time people.  When you assign a person to an org unit you can specifiy their hours of availability or the percentage of their time involvement - system automatically takes this into consideration.
    Hope this helps,
    Brent

  • Boolean logic

    Hey, whats the best way to represent a minus and divide in in java for a boolean equation? Say i have x-y, i sub a matrix of values in {(0,0),(1,0),(0,1),(1,1)} and i want o return their logical boolean result. So if i do it for plus i use the OR gate, and multiplication uses the AND gate.
    Do i simply reverse the result for a plus?
    Podger

    haha tis alright figured it out

  • VI crashes when completing boolean logic

    Hi guys,
    I'm an amatuer trying to do some basic parallel port control through labview. I've designed this big state machine, but whenever I complete the logic Labview will crash upon saving or running the vi.
    I've attached the broken vi. Go to the top right of the block diagram and connect the open OR gate to something. Even a true constant causes a crash. Is the logic simply too big and bloated to handle? What can I do to fix it? Is a while loop+feedback nodes for registers the correct way to implement digital logic?
    Sorry if this seems silly. I only just started using labview.
    Attachments:
    keypad logic.vi ‏13 KB

    Seiko809 wrote:
     I've designed this big state machine, ...
    You still have not explained what the program is supposed to do. I am pretty sure that 80% of the current code is not necessary and the entire thing could be done much simpler.
    I am also not sure why you call it a state machine (and it is not "big" either).
    Just glancing at Lynn's image above, many things make absolutely no sense and just clutter and complicate the diagram.
    Find the following constructs. All boolean operations where one input is a diagram constant can be eliminated and replace with a plain wire or possibly an invert.
    "A .AND. TRUE" is simply "A" (a wire!)
    "A .OR. FALSE" is simply "A" (a wire!)
    "A .XOR. TRUE" is simply ".NOT. A"
    "(A .OR. FALSE) _AND_ (.NOT. (A .AND. FALSE))" is simply "A" (a wire!)
    Instead of inverting a FALSE constant, you could simply use a TRUE constant.
    For example, the code operating in the lower shift register can be reduced to a single "invert". Of course all the currently remaining feedback nodes currently give an invariant constant. Obviously, you must have had much more in mind so either their inputs need to be hooked up somewhere useful or they should be deleted.
    So, please describe in a few words what kind of outputs you expect based on the changing values of the four boolean input value. I am sure we can point you to an almost atomic solution.
    Seiko809 wrote:
    Sorry if this seems silly. I only just started using labview.
    Virtually all your problems are algorithmic and would be an problem in any programming language. The problems have nothing to do with LabVIEW per se.
    LabVIEW Champion . Do more with less code and in less time .

  • Audition + Logic Pro workflow?

    Hello...new to the forum.
    Like many here, I am a prodigal son returning to the fold (former cool edit user who went the logic route and is now coming back home after "seeing the light"). Just curious to know if there are people here who employ both Logic pro and Audition in their daily workflow and how exactly they do it. Is there a way to use Audition as a plugin in Logic? My ideal workflow would be one where I CREATE my music in Logic (MIDI and all), RECORD my vocals in Logic, EDIT the vocals in Audition (noise reduction, normalization, some FX), MIX in Logic and MASTER in Audition. Any insights into this would be greatly appreciated.

    Logic's 'export' functionality is amongst the most flawed there is but you could be lucky with FCP xml or even OMF but it sounds to me the simplest thing would be to bounce your vocal takes down to a single wav file (starting from the beginning of the track) and just edit that wav file in Audition and then reopen your Logic session.
    Remember that no fx or midi would be converted between the daws so all fx & midi would need to be rendered.
    When you have finished mixing then master your final stereo track in Audition
    Done.

  • ADF with BEPL--Complex logic and workflow

    Hi,
    We have big complex requirement of building applicaiton with complex workflow for huge user base. We are thinkng of useing ADF for application logic and BEPL for complex workflow.
    What all are pros and cons if we go ADF and BEPL.
    Thanks.

    Thanks Shay for reply.
    We are looking at pro's and con's for uesing ADF with Oracle workflow and ADF with BPEL.
    Also if we use Oracle workflow, we will get the work flow notifications in worklist. We can display worklist in home page of the user. If we use BPEL, how to get the BPEL notifications to be displayed in home page(Immediate page after used logged into application) of user.
    Thanks.
    Edited by: user636903 on Aug 17, 2009 9:30 PM

  • Evaluating an arbitrary length boolean logic expression

    Is it possible to have labview evaluate a boolean expression of arbitrary length and complexity, which would be input by the user. Storage format of the expression isn't necessarily important. Use of the attached vi might provide some help for evaluating the expressions.
    Attachments:
    Test_Comparator.vi ‏28 KB

    There are a couple of ways to go about this. You may want to look into the Mathmatics&#0187Formula&#0187Advanced Formula Parsing pallet for some useful VIs.
    One way to do it would be to parse a string for expresions and perform the oppertation specified. Attached is a first step in doing this. Note that it returns an array of results...the code for anding and oring still needs to be added.
    Hope this helps,
    Amaury Rolin
    NI Applications Engineer
    Attachments:
    multi_compare.llb ‏41 KB

  • Does my boolean logic make sense?

    Hello. I am currently working on a linked list assignment, but for some reason my boolean doesn't seem to do what I want it to do. can someone take a look to see why I am getting a black screen?
    public boolean addEmployee(Employee newEmployee) //if there is fresh meat coming, returns true. I think something's wrong here
          EmployeeNode previous = search(newEmployee);
          EmployeeNode present= setPresent(previous);
          EmployeeNode add = new EmployeeNode();
              boolean freshMeat = false;
              add.data = new Employee(newEmployee);
              while((present!=null)&&(present.data.compareTo(newEmployee)<0))
              {     previous = present;
                   add.link = present;
                   present = add;
                    System.out.println("present is: "+present.data);
                    System.out.println("previous is: "+previous.data);
                   freshMeat = true;
              return freshMeat;
       }if I remove the while loop and the condition, it will display everything that I am adding to it:
    public boolean addEmployee(Employee newEmployee) //if there is fresh meat coming, returns true. I think something's wrong here
          EmployeeNode previous = search(newEmployee);
          EmployeeNode present= setPresent(previous);
          EmployeeNode add = new EmployeeNode();
              boolean freshMeat = false;
              add.data = new Employee(newEmployee);
              previous = present;
              add.link = present;
              present = add;
              System.out.println("present is:" + present.data);
              freshMeat = true;
              return freshMeat;
       }why can't I have my previous.data display if i type it into SOPLN?

    I did a couple of linkedlist assignments not long ago, of which one is employee related.
    I thought that the method names are a bit ambigous to me, and it will definitely help if you can outline your algo.
    Putting your while condition to words, i have, if (current node exists) AND (newEmployee is "bigger" than the employee data in the current node) perform loop content. I am not sure if that is what you want.
    Furthermore, I am not sure if you are traversing forward or backward, or if you are traversing your list at all in your while loop.
    if your add.link refers to to next node in the list, shouldn't you do something like
    previous = present;
    present = add.link;
    ....again, it will greatly help if you are provide more info on what exactly are you trying to do.

  • Trouble with boolean logic

    //StringBuffer underscoreBufferWord = new StringBuffer ()
    //StringBuffer stringBufferWord = new StringBuffer()
    //I have also tried ; if (underscoreBufferWord == stringBufferWord)
    I cannot get the logic to return true and print "you did it" It always skips to else.
    if (underscoreBufferWord.equals(stringBufferWord))
    System.out.println("You did it");
    result = 1;
    else
    if (numOfWrongGuesses == 7)
    result = 0;
    System.out.println("You lose");
    Thank you for you comments

    Okay, I can see where it's not as obvious as I might have made it out to be.
    You'll notice two main sections: Methods that SB defines or overrides, and Methods inherited from class java.lang.Object.
    The fact that equals appears in the latter, rather than the former, tells you that it uses Object's equals, which returns true if and only if obj == this.
    For SB to have content-comparing semantics, it would have to override equals, which means equals would appear with the rest of the SB-specific methods. It would probably (though not necessarily) also inlude an explanation of what it does.

Maybe you are looking for