search for: automatons

I?ve attempted the user Mail with the same password with the same result (binding as my own user was a last-ditch attempt). aaron at aaron-Parallels-Virtual-Platform:/etc/sssd$ ldapsearch -x -H ldap://dc1.ad.automaton.uk -D CN=aaron.jenkins,CN=users,DC=ad,DC=automaton,DC=uk -W - -b CN=aaron.jenkins,CN=users,DC=ad,DC=automaton,DC=uk Enter LDAP Password: # extended LDIF # # LDAPv3 # base

I?ve removed the dn / dnpass. When attempting with new user: $ cat /var/log/dovecot-info.log Nov 27 00:09:29 imap-login: Info: Internal login failure (pid=5553 id=1) (internal failure, 1 successful auths): user=<test.user>, method=PLAIN, rip=10.211.55.29, lip=10.211.55.33, mpid=5558, TLS, session=<rQXRqdIIZwAK0zcd> Nov 27 00:09:29 imap-login: Info: Internal login failure (pid=5559

Hi all, I?m having issues getting Dovecot to work with AD on 2012 R2 in a test environment. Background: AD is running on dc1.ad.automaton.uk<http://dc1.ad.automaton.uk>, the domain is ad.automaton.uk<http://ad.automaton.uk>. The DNS server is running on ad.automaton.uk<http://ad.automaton.uk> and the automaton.uk<http://automaton.uk> DNS is set up correctly in the test

-----BEGIN PGP SIGNED MESSAGE----- Hash: SHA1 On Wed, 26 Nov 2014, Aaron Jenkins wrote: > I?ve attempted the user Mail with the same password with the same result (binding as my own user was a last-ditch attempt). OK, what about the: > As I understand auth_bind_userdn, you do not need > dn/dnpass anyway, because auth_bind_userdn prevents searching for the >

hello, upgrading llvm-gcc4 from 1.9 release to trunk caused the following build failure for me on darwin: build/genattrtab /Users/ebner/dev/opt/llvm-gcc-svn/gcc/config/i386/ i386.md > tmp-attrtab.c genattrtab: Automaton `ppro_load': Insn `ppro_fmov_XF_load' will never be issued genattrtab: Automaton `ppro_load': Insn `ppro_sse_icvt_SF' will never be issued genattrtab:

-----BEGIN PGP SIGNED MESSAGE----- Hash: SHA1 On Tue, 25 Nov 2014, Aaron Jenkins wrote: > I?m having issues getting Dovecot to work with AD on 2012 R2 in a test environment. > ? > Nov 19 09:22:23 auth: Debug: auth client connected (pid=10345) > Nov 19 09:22:23 auth: Debug: client in: AUTH 1 PLAIN service=imap secured session=pkJxdDkISwAK0zcd lip=10.211.55.33 rip=10.211.55.29lport=993

On Tue, 2015-01-06 at 18:51 -0700, Warren Young wrote: > I think we?ll figure out something new to do with computers tomorrow. Certainly by Friday at latest. You seem to forget. Computers were invented to perform repetitive tasks. Computer usage should be serving mankind - not making it more difficult for mankind. -- Regards, Paul. England, EU.

Now that I've learned my way around TableGen just a bit, I'd like to solicit suggestions for improving and enhancing it. Perhaps there are some lexical changes that could improve readability of .td files (e.g., I'm planning to enhance the lexer to allow an apostrophe as a digit group separator in integers, a la C++). Perhaps there are some syntactic enhancements that would make .td

...ot know any alternatives for this. Do you have any tips which one could be an interesting alternative? I used the mentioned state machine for parsing of text, which although has structure, but nothing nice like yml or xml... simple cut and paste from old application. State machines or finite state automatons are perhaps quite good choice for that. Do you have any ideas also for that what can be handy for parsing such more rough things in the future? Thanks, bw, Georg

> I'd love to see a solution where most of the transformations were > specified in TableGen files and: > 1. We, as a result, had an easy way to convert these into a form where > some SMT-solver-based checker could certify correctness. > 2. We, as a result, has an easy way to somehow check soundness, as a > rewrite system, so we'd know it would reach a fixed point

Is this the appropriate place for GSoC conversations? If I understand the proposal correctly, there should be a lexer (written in R) that exposes an API; that API would be used by segregated mini-parsers (Roclets) which do the dirty work of Roxygen -> {html, LaTeX, DocBook, ...} translation. The lexer should ship with a proof-of-concept Roclet. Have I missed anything?

On 07/13/2017 06:40 PM, Daniel Berlin via llvm-dev wrote: > Ah yes, it can only return one instruction and you need two. > > NewGVN could still handle it if instsimplify was changed to return the > right binary operators because it has infrastructure that can handle > insertion. > (it would need a little work). > > > (At this point, InstCombine seems to have become

Compiling a simple automaton created by GNU bison with -O1 or -O2 resulted in the following machine code: 1300 /*-----------------------------. 1301 | yyreduce -- Do a reduction. | 1302 `-----------------------------*/ 1303 yyreduce: 1304 /* yyn is the number of a rule to reduce with. */ 1305 yylen = yyr2[yyn]; 0x0000000000400c14 <rpcalc_parse+628>: mov

On 07 January 2015 @01:37 zulu, Always Learning wrote: > You seem to forget. Computers were invented to perform repetitive tasks. Or maybe, some of us just seem to remember it differently. In my opinion, robots/automatons were invented to perform repetitive tasks; computers were invented to perform logic operations faster and more-reliably than humans.

Has anyone considered making a linkable library of the OpenSSH code so that one could programatically interact with ssh? Or is there some other method to accomplish this? Thanks, -Eric

Hello all, I've seen some discussion that InstCombine is "too general" and that llvm should implement a proper graph rewrite mechanism: Link to llvm-dev discussion about this: http://lists.llvm.org/pipermail/llvm-dev/2017-May/113219.html, Link to review where this came up (and I first heard about it): https://reviews.llvm.org/D37195. I wanted to understand what the current issues

On Sat, Mar 19, 2011 at 1:44 AM, Csaba Raduly <rcsaba at gmail.com> wrote: > Compiling a simple automaton created by GNU bison with -O1 or -O2 > resulted in the following machine code: > > 1300    /*-----------------------------. > 1301    | yyreduce -- Do a reduction.  | > 1302    `-----------------------------*/ > 1303    yyreduce: > 1304      /* yyn is the number

http://dovecot.org/releases/1.1/dovecot-1.1.2.tar.gz http://dovecot.org/releases/1.1/dovecot-1.1.2.tar.gz.sig Development of new features in this release and the upcoming multi-master replication are sponsored by Directi (www.directi.com). Lucene indexing is currently deprecated in favor of the new Solr indexing. I'm even considering removing the Lucene C++ library support, so if you're

http://dovecot.org/releases/1.1/dovecot-1.1.2.tar.gz http://dovecot.org/releases/1.1/dovecot-1.1.2.tar.gz.sig Development of new features in this release and the upcoming multi-master replication are sponsored by Directi (www.directi.com). Lucene indexing is currently deprecated in favor of the new Solr indexing. I'm even considering removing the Lucene C++ library support, so if you're

...AM, Darr247 <darr247 at gmail.com> wrote: > On 07 January 2015 @01:37 zulu, Always Learning wrote: >> >> You seem to forget. Computers were invented to perform repetitive tasks. > > > Or maybe, some of us just seem to remember it differently. > In my opinion, robots/automatons were invented to perform repetitive tasks; > computers were invented to perform logic operations faster and more-reliably > than humans. There's still a very odd mix of art and science involved. This is part of the fun, but still it seems like when everyone has the same problem from the...