The Story
Since Event Log Subscription doesn't have a module or a .NET class,
interacting with its settings and status has to be done either via UI or
the command line utility, wecutil.exe
I was especially interested in getting the computers runtime status, to
see which machines are failing (and why).
Let’s look at the output generated by wecutil gr
:
As we can see, every server's status is represented by multiple lines,
which rules out easy one-line-at-a-time parsing.
Since Wecutil has no script-friendly output (e.g. CSV), I had to use multiline regex parsing.
This is done by joining the lines using `n
(since PowerShell returns
an array of rows rather than the complete string), using the .NET class
Regex
(System.Text.RegularExpressions.Regex)
and creating a complicated regex pattern to parse by.
My full script also supports remoting (using
Invoke-Command)
and parsing all of the fields into meaningful objects (e.g. extracting
the error messages out of the XML).
The really interseting part is the regex pattern, especially these
parts:
- Nonecapturing groups: Using
(?:)
means the group isn't kept for data extraction - Positive lookbehind: both the beginning and the end of my string
contain line-breaks, so I had to use lookbehind
(?\<=)
or lookahead(?=)
(or both) groups to avoid "competition" for the same line-break between two close matches. - Capturing ALL characters: apperantly,
.
captures every character except\n
(newline) so(?:.|\\n)
will match every character. Although this difference isn't visible when dealing with single line expressions (since you don't encounter line breaks), it's vital when handling multiline ones. - Optional segments: The fields
ErrorMessage
,ErrorTime
andNextRetryTime
only appear whenLastError
isn't 0, so we can't mandate them in the pattern. On the other hand, we do want to capture them when they're present. Surrounding them all with(?:
text)?
will ensure that the entire expression won't fall if they're not present but populate the right capturing groups if they are. - Reaching the real end: The last line isn't terminated with a
newline but rather with End-Of-String, so our string ends with
(?:\n|$)
to match either.
The Script
param(
[string]$computerName,
[parameter(Mandatory=$true)]
[string]$subscriptionName
)
$wecUtil={wecutil gr $args[0]}
$splatTable=@{}
if($computeRName) {$splatTable['ComputerName']=$computerName}
$in = Invoke-Command @splatTable $wecUtil -ArgumentList $subscriptionName
$in2 = ($in -join "`n")
$pattern = '(?<=\n)\t{2}(?!\t)(.+)\n\t{3}RunTimeStatus: (.+)\n\t{3}LastError: (.+)(?:\n\t{3}ErrorMessage: ((?:\n|.)+?)\n\t{3}ErrorTime: (.+)\n\t{3}NextRetryTime: (.+))?(?:\n|$)'
[regex]::Matches($in2,$pattern,'Multiline') | %{
$arr = $_.Groups | select -s 1 -exp value
5| select `
@{Name='Name';Expression={$arr[0]}},
@{Name='RunTimeStatus';Expression={$arr[1]}},
@{Name='LastError';Expression={[int]$arr[2]}},
@{Name='ErrorMessage';Expression={
$msg = ([xml]$arr[3]).WSManFault.Message
if($msg -is [string]) {$msg}
else {$msg.ProviderFault.ProviderError.'#text'}
}},
@{Name='ErrorTime';Expression={[datetime]$arr[4]}},
@{Name='NextRetryTime';Expression={[datetime]$arr[5]}}
}


{% load static i18n i18n_urls %} {% get_current_language as LANGUAGE_CODE %} {% get_language_info for LANGUAGE_CODE as current_language %} {% get_available_languages as LANGUAGES %} {% get_language_info_list for LANGUAGES as languages %}


Account Not Found
If you're a new user or were recently assigned credentials, please wait and try again.


Jarmon User Guide
Jarmon is a browser based graph rendering system.
Contents
- Browser Compatibility
- API documentation
- Release process and tools
- Running automated tests
Browser Compatibility
Jarmon depends upon the Flot
graphing library which makes use of the
HTML5 canvas
element. The canvas element is only supported in certain web browsers.
| Browser | Minimum Supported Version
|
|---|
| Firefox | 3.0
|
| Safari | 3.2
|
| Chrome | 3.0
|
| Opera | 10.1
|
| Internet Explorer | 6 (see caveats below)
|
Internet Explorer Caveats
- Internet Explorer (<= IE8)
- This version of IE does not have native support the HTML canvas (see
Internet Explorer workarounds below)
element.
- Internet Explorer 9
- Due to be released in late 2010 this new version of IE will provide
native canvas support and will be able to render Jarmon graphs as
fast (if not faster) than other browsers.
Internet Explorer Workarounds
- Excanvas
- This is the default IE compatibility workaround. Jarmon bundles the
excanvas library
which translates canvas api calls into VML, but this is much slower
than the native canvas support in other browsers. In the absence of
other workarounds, Jarmon will transparently use the excanvas library.
- Chrome Frame
- Chrome
Frame is an IE plugin developed by Google. Once installed, it
replaces the standard IE rendering module with the more performant
Chrome rendering module.
- When first visiting a Jarmon page using <= IE8, you will be
prompted with an advisory message, explaining the performance penalty of
using the standard excanvas compatibility layer.
- You will be asked whether you want to Install and use Chrome Frame.
You will be presented with the following options:
- Yes
- After you choose this option the message will be hidden and
you will be guided through the steps necessary to install
Chrome Frame after which you can continue to use Jarmon
normally.
- Remind me later
- After you choose this option, the message will be hidden
and you can continue to use Jarmon.
- Your preference will be saved in a cookie and the warning
message will not re-appear for 1 month.
- Never
- After you choose this option, the message will be hidden
and you can continue to use Jarmon.
- Your preference will be saved in a cookie and the warning
message will never re-appear (unless the preference cookie is
deleted or expires).
API Documentation
Jarmon includes comprehensive API
documentation
This API documentation is generated automatically by the release command,
but you can also build it yourself by issuing the
./bin/build apidoc
command from within a Jarmon source tree.
The documentation will be saved in a build subfolder.
Release Process and Tools
Jarmon includes tools to automate source archive releases. First check
out the source code, then issue the
./bin/build -V 10.8 release
command from within the source
tree.
Running automated tests
Jarmon includes unit tests which are used to exercise the library
code, to check for compatibility with various platforms and web client
software and to check for regressions as the library evolves.
The unit tests are designed to be run inside a web browser using the
YUI test harness.
- Generate test data by running the following command
./bin/build testdata
from within the source tree.
- Start a web server to serve the test page. Eg
$ nginx -p . -c docs/examples/nginx.conf.example
- Use a web browser to load
the test page
(
http://localhost:8080/test.html)
Measure code coverage
There are number of tools available to measure the
code coverage of
Javascript unit tests.
One such tool is
JSCoverage. It is very easy to install JSCoverage on a Debian / Ubuntu
system and use it to measure the coverage of the Jarmon unit tests.
sudo aptitude install jscoverage
- install
jscoverage.
jscoverage-server
- run the JSCoverage web server from
the root of the Jarmon source tree.
- Visit
http://localhost:8080/jscoverage.html?test.html to run the unit
tests through the JSCoverage server. The server will automatically
instrument the Jarmon code and present a web interface which reports
how much of the code has been exercised.


Permutation
问题描述 :
A permutation of n elements is a one-to-one function (injection) p: {1,2,…,n} -> {1,2,…,n}. An order of permutation p is the minimal k >= 1, such that for all i=1,2,…,n we have:
That is, p composed with itself k times becomes identity function. For example, the order of the permutation of 3 elements p(1)=3, p(2)=2, p(3)=1 is 2, because p(p(1))=1, p(p(2))=2, p(p(3))=3.
For a given n let us consider permutations of n-elements having the the largest order possible. For example, the maximal order of a permutation of 5 elements is 6. An example of a permutation of 5 elements whose order is 6 is p(1)=4, p(2)=5, p(3)=2, p(4)=1, p(5)=3.
Among all permutations of n elements having the maximal order, we would like to find the earliest one (in a lexycographic order). Being more precise, we say a permutation p of n elements is earlier than a permutation r of n elements, if there is i, such that p(j) = r(j) for all j < i and p(i) < r(i). The earliest permutation of 5 elements having an order 6 is p(1)=2,p(2)=1,p(3)=4,p(4)=5,p(5)=3.
p(p(....p(i)...)) = i
That is, p composed with itself k times becomes identity function. For example, the order of the permutation of 3 elements p(1)=3, p(2)=2, p(3)=1 is 2, because p(p(1))=1, p(p(2))=2, p(p(3))=3.
For a given n let us consider permutations of n-elements having the the largest order possible. For example, the maximal order of a permutation of 5 elements is 6. An example of a permutation of 5 elements whose order is 6 is p(1)=4, p(2)=5, p(3)=2, p(4)=1, p(5)=3.
Among all permutations of n elements having the maximal order, we would like to find the earliest one (in a lexycographic order). Being more precise, we say a permutation p of n elements is earlier than a permutation r of n elements, if there is i, such that p(j) = r(j) for all j < i and p(i) < r(i). The earliest permutation of 5 elements having an order 6 is p(1)=2,p(2)=1,p(3)=4,p(4)=5,p(5)=3.
输入:
There is one positive integer t (1 <= t <= 30) in the first line of the standard input. In the following T lines there are positive integers N1, N2, …, Nt, one per line, 1 <= ni <= 10000.
输出:
There is one positive integer t (1 <= t <= 30) in the first line of the standard input. In the following T lines there are positive integers N1, N2, …, Nt, one per line, 1 <= ni <= 10000.
样例输入:
2 5 14
样例输出:
2 1 4 5 3 2 3 1 5 6 7 4 9 10 11 12 13 14 8
#include<cstdlib> #include<iostream> #include<cstdio> #include<cmath> #include<cstring> #include<algorithm> #include<set> #include<map> #include<list> #include<queue> #include<vector> #define tree int o,int l,int r #define lson o<<1,l,mid #define rson o<<1|1,mid+1,r #define lo o<<1 #define ro o<<1|1 #define ULL unsigned long long #define LL long long #define inf 0x7fffffff #define eps 1e-7 #define N 10001 using namespace std; int m,n,T,t,x,y,u; bool vis[N]; int p[N],pn; vector<int>g[N]; double d[N]; int ans[N]; void init() { for(int i=2; i<N; i++) { if(!vis[i]) { p[pn++]=i; for(int j=i*i; j<N; j+=i) vis[j]=1; } } for(int i=0; i<pn; i++) { for(int j=N-1; j>=p[i]; j--) { double tp=log2(p[i]); for(int k=p[i],num=1; k<=j; k*=p[i],num++) if(d[j]<d[j-k]+tp*num) { d[j]=d[j-k]+tp*num; g[j]=g[j-k]; g[j].push_back(k); } } } } int main() { #ifndef ONLINE_JUDGE freopen("ex.in","r",stdin); #endif init(); scanf("%d",&T); while(T--) { scanf("%d",&n); int sum=0,m=0; for(int i=0; i<g[n].size(); i++) { sum+=g[n][i]; ans[m++]=g[n][i]; } for(int i=sum; i<n; i++) ans[m++]=1; sort(ans,ans+m); int f=0,t=1; for(int i=0; i<m; i++) { for(int j=0; j<ans[i]-1; j++) { if(f)putchar(' '); printf("%d",t+j+1); f=1; } if(f)putchar(' '); printf("%d",t); f=1; t+=ans[i]; } puts(""); } return 0; }
版权声明：本文为博主原创文章，未经博主允许不得转载。
参考：http://blog.csdn.net/sunbaofeng2/article/details/11661859
(adsbygoogle = window.adsbygoogle || []).push({});
你煮一个方便面，把面饼倒扣在一个20寸的盘子上，用面酱和番茄酱和辣根在外围划两道，就是米其林的装逼范了。


Preparation time
less than 30 mins
Cooking time
10 to 30 mins
Serves
Serves 4
Baking fish is an easy way to reduce calories without compromising on flavour. Serve alongside baked tomatoes for a healthy evening meal.
As part of an
Intermittent diet
plan, 1 serving provides 2 of your 6 daily vegetable portions and 248 kcal.
Preheat the oven to 200C/180C Fan/Gas 6.
Put the tomatoes in an ovenproof dish with the beans, garlic, lemon juice and spray with the oil. Season with salt and freshly ground black pepper and mix well. Bake for 10 minutes, or until the tomatoes and beans are tender.
Meanwhile, tear off 4 large sheets of foil and line with non-stick baking paper. Place 2 fish fillets on each piece of baking paper, then scatter over the lemon rind, capers and spring onions, season with salt and freshly ground black pepper. Fold over the paper-lined foil and scrunch the edges together to seal. Place the parcels on a large baking tray.
Place the fish parcels next to the vegetables in the oven and bake for a further 8-10 minutes, or until the flesh flakes easily when pressed in the centre with a knife.
Spoon the vegetables on to four serving plates and top each with two fish fillets. Garnish with the parsley and caperberries and serve.


Annotation start position
Name of the start position. This information might be displayed in the annotation tooltip
Annotation displayed color
Description associated to the annotation. This information might be displayed in the annotation tooltip
Callback when the annotation is clicked
Annotation end position
Name of the end position. This information might be displayed in the annotation tooltip
Annotation Id
Annotation global value. E.g. whole interface energy
Annotation gaps that should be displayed as a dashed line
Name of the original reference. This information might be displayed in the annotation tooltip
Annotation inner region should not be highlighted
Annotation label. This information might be displayed in the annotation tooltip
Annotation name. This information might be displayed in the annotation tooltip
Annotation object is not a real annotation but a selected area from the user
Draw a circle on the start side of blocks
Draw a circle on the end side of blocks
Annotation original reference start position. This information might be displayed in the annotation tooltip
Name of the original reference start position. This information might be displayed in the annotation tooltip
Annotation original reference end position. This information might be displayed in the annotation tooltip
Name of the original reference end position. This information might be displayed in the annotation tooltip
color associated to the resource that dispatched the data
Name of the resource that dispatched the data
Alternative begin position for rects in block displays. It is used to split annotation into multiple rects when gaps are included
Alternative begin position for rects in block displays. It is used to split annotation into multiple rects when gaps are included
Source reference database name
Id of the annotation element (protein or gene) source
Track title. This information might be displayed in the annotation tooltip
Annotation type. This information might be displayed in the annotation tooltip
Annotation local value. E.g. interface residue energy
Generated using TypeDoc
Annotation Element Interface


View Detailed Reports On QR codes and customers
Generate QR codes on the fly
Add shops to the system
Assign QR codes to shops from the comfort of your phone


The Edinburgh Charity Orchestra was formed in 20?? by ???? with the dual purpose of putting on great concerts to raise money for local charities. A chance for Edinburgh's fine musicians to help the community they live in.
We can add more text here, possibly on up coming concerts.
If you would like to support the orchestra (and hence charity), please read on!
We're performing in aid of Waverley Care, who are Scotland’s leading charity providing care and support to people living with HIV or Hepatitis C. As part of their work they also strive to raise awareness of these conditions and their prevention.
We are collaborating with these choirs: Edinburgh University Chamber Choir, St Giles' Cathedral, St Andrew's and St George's West and Greyfriar's Kirk.
Iain McLarty will be conducting us in a programme of orchestral and choral works: Saint-Saens: Symphony No.3 "Organ" (John Kitchen, organ), Holst: Psalm 148, Leighton: Te Deum Laudamus (soloists tbc), Parry: Blest Pair of Sirens and Vaughan Williams: Old Hundredth.
We're looking for sponsorship to help cover the cost of hiring music and paying for rehearsal and concert space. If you'd like to help please get in touch via our contact page. We'd also really value help running the orchestra, if you can offer time we'd love to hear from you.
Our musicians comprise the creme of Edinburgh talent. If you'd like an opportunity to play, please contact us and we'll get back to you.


TUevento.com
HOME
ABOUT
SOCIETIES
CONTACT US
EVENT REGISTERATION PLATFORM
Previous
Next
TECHNICAL
CULTURAL


"Dust in the win"
by blacksasha84— I close my eyes,
only for a moment and the moment's gone...
Dust in the wind,
Everything is dust in the wind... (Kansas)
— I close my eyes,
only for a moment and the moment's gone...
Dust in the wind,
Everything is dust in the wind... (Kansas)


about
portfolios
contacts
I am
About Me
I'm Huey Wen, an entry-level developer who recently obtained a Bachelor's Degree in Computer Science from Sunway University (without any work experience).
I may not be there yet but I'm closer than yesterday!
Portfolios
Stay tune! Work in Progress.
Get in Touch
Email
LinkedIn
Instagram


--- layout: post title: The Bean date: type: post published: false status: draft categories: [] tags: [] meta: _edit_last: '2' author: login: jen email<EMAIL_ADDRESS>display_name: Jennifer Elam first_name: Jen last_name: Elam ---
Has anyone heard how LL BEAN is on a reurgence! Their stuff is trending like your


|
hcash
2.0.0
hcash
|
#include <lobject.h>
Public Attributes | |
| CommonHeader | |
| lu_byte | extra |
| lu_byte | shrlen |
| unsigned int | hash |
| union { | |
| size_t lnglen | |
| struct TString * hnext | |
| } | u |
| TString::CommonHeader |
| lu_byte TString::extra |
| unsigned int TString::hash |
| struct TString* TString::hnext |
| size_t TString::lnglen |
| lu_byte TString::shrlen |
| union { ... } TString::u |


[REVERSING] Discount VMProtect - 465 Pts.
Challenge Description:
Then the challenge gives us this file:
Let’s see what the ELF file does.
It basically asks for a password then checks if it matches to the password embedded inside the executable, which is also probably the flag.
Let’s run gdb on it and do static analysis. Let’s check for functions and how much symbols is left since the file
command says it is stripped.
Hmmm… There is no main and only plt entries remained. Let’s find the entry point and the main then.
The entry point is at 0x400770
.
Then our main address is 0x400c88.
This is the whole main assembly code
Summary of main:
- The program asks for user input and stores it to 0x6026a0, calls 0x400857, then if the first byte from 0x6025a0 is 1, then we got the password.
Let’s check Ghidra if we got the same analysis to it.
We got the same analysis. Great! We noticed also that the 0x400857 is called two times. Let’s see what 0x400857 does.
In Ghidra:
Hmmm… weird, it only returns. Let’s check gdb then.
In GDB:
It looks like this function offers a lot more than just returning. It pushes 0x2361ca to the stack then it XORs it with 0x636465. The value after XORing is 0x40087f then returning. Since 0x40087f is the top of the stack, the code actually jumps to that address instead of going back to main. Let’s check Ghidra what’s inside 0x40087f.
Woah! I think we just stumbled a treasure! However, there’s a lot of code and it looks scary. Second, what’s the deal with this loop? After a lot of headbanging and searching, I found this article about VM protectd binaries. I suggest to give it a read. VM Protected Binaries Article.
TL;DR: A Binary that’s VM protected has its own set of “instructions”, has a function that acts like a processor then reads the instructions, and has its own memory (stack, heap, etc. depending on the design). The 0x40087f is actually the function that executes those instructions. We can also see the values in the switch cases. These are the opcodes of the instructions.
Now that we know what the big loop is, we have to answer the following questions:
a) Where does the binary get the instructions?
b) What does each opcode do?
c) This is the main part of the program therefore the flag is connected to it somewhere and somehow. So where is it?
Let’s answer (a).
Let’s go back at 0x400857 before jumping to 0x40087f
Before the XOR operation, we can see that rdi value is being stored to rbp-0x28:
- rbp-0x28 = rdi
- rbp-0x8 = 0x0
- rbp-0x4 = 0x0
Also, a very important note, those values above appeared in every operation for every opcode inside the big loop. But what is the value of rdi? Going back to main.
Addresses 0x602320 and 0x6020e0 are passed as arguments to 0x400857 function. What’s inside in this address?
Contents: of 0x602320
Contents: of 0x6020e0
We can see many of the bytes are starting in 3 (i.e. 0x32, 0x36, 0x33 etc.) Could this be the instructions? It most likely is but to confirm things let’s go Ghidra and check the decompiled code at 0x40087f.
Basically, what it says: [rbp-0x17] = [rbp-0x28][rbp-0x4]; #access the byte from [rbp-0x28] at offset [rbp-0x4] [rbp-0x4] += 1
Then the value at [rbp-0x17] is being used to check against the cases for opcodes thus the addresses 0x602320 and 0x6020e0 contains the values of instructions. We should also notice that offset lies in [rbp-0x4] therefore this is the instruction pointer.
Takeaways:
[rbp-0x28] is the base address. The value is set in the 0x400857 through rdi which came from the main function
[rbp-0x4] is the instruction pointer.
[rbp-0x8] ??? -> we don’t know this yet.
Let’s answer (b):
Since there are a lot of opcodes, this is the list of each opcode and what they do.
0x30 ->
- it breaks the loop, ending the execution of the instructions
0x31 -> 0x4008cf - 0x400913
- x = data supplied
- gets data from 0x6025a0[x] then pushes it to stack
0x32 -> 0x400918 - 0x400940
- copies the top stack value then pushes that value to the stack
0x33 -> 0x400945 - 0x40097d
- Loads a character from user buffer using top value of stack
- Replaces that top value stack from the loaded character from user buffer
0x35
-
top_stack = (top_stack » 1) (top_stack « 7) - Rotate to right 1 bit
0x34 -> 0x400982 - 0x4009bc
- Changes the instruction pointer value if the top of stack is 0
- let x = supplied value, if top_stack == 0, rbp-0x4 = x
- pop data
0x36
- x = data supplied
- Push x to the stack
0x37
- xors two values from the stack then saves it to the -2 of the stack
- then “pops” the stack, making the new value new top of stack
0x38
- adds two values then saves it to the -2 of the stack
- then “pops” the stack, making the new value new top of stack
0x39
- subtracts two values (2nd top - top) then saves it to the -2 of the stack
- then “pops” the stack, making the new value new top of stack
0x61
- top_stack = neg(top_stack)
0x62
- if (*0x602580 == 0x1b) and ptrace == -1) print (“NOOOOOOOOOO!”), else *0x602580 += 1
- ptrace == -1 checks if debugger is present
0x63 -> 0x400bd2 - 0x400bef
- strcpy(0x6025aa, 0x6020a0)
0x64 -> 0x400bf4 - 0x400c3b
- x = data supplied by bytecode
- y = top stack value
- 0x6025a0[x] = y
- pop data
0x65
- top_stack = 0x6025a0[top_stack]
Takeaways:
- Notice that there is a lot of stack operations yet we don’t know where is the base address of the stack and what points to the top of the stack. Let’s take snippet from Ghidra code.
-We can see that [rbp-0x8] is the offset from the 0x6027a0 and adds 1 to itself whenever it saves a value. (You can also check the other cases. There are cases in which [rbp-0x8] decreases 1 whenever it does an operation)
[rbp-0x28] is the base address. The value is set in the 0x400857 through rdi which came from the main function [rbp-0x4] is the instruction pointer. [rbp-0x8] is the stack pointer 0x6027a0 is the base address of the stack
Finally, let’s answer (c). Where is the flag?
Let’s look at the first set if instructions at address 0x602320:
Instructions 0-2:
- gets data 0x6025a0[80] then push to stack
- then strcpy(0x6025aa, 0x6020a0) and sets 0x6025a0[0] = 1. Remember that this has to be 1 in order to get “Yay” printf in the main function.
Instructions 3-10:
- counts the length of the user input then saves it to 0x6025a0[80]
Instructions 12-1d:
- 0x23 - (length of user input)
- if not the result above 0, set 0x6025a0[0] = 0 (execution jumps directly to 1b)
- set 0x6025a0[80] = 0
Instruction 1f:
- break from the loop. Stop execution.
Hmmm… This set of instruction is not that interesting, except for instruction 2 which copies a gibberish from 0x6020a0 to 0x6025aa.
Nevertheless, we were able to grasp the execution for the first time. Let’s go to instruction set from
Instructions 0 - 12:
- Saves how many characters to the 0x6025a0[80] have been “processed”
- The character of every user input is being processed:
- The processing is in this order :
a) char = char rotates to right 1 (Instruction a)
b) char = char ^ 0x63 (Instruction d)
c) char = char + 0x98 (Instruction 10)
d) char = neg(char) (Instruction 11)
Instruction 13 - 1e
- Compares the processed character to the 0x6025a0[0xa + char counter] (Instructions 13-1a). It means, it compares to every character to the 0x6025aa, the address where the destination address of strcpy during the first instruction set! That’s it! This could be the flag! Let’s get those raw data and reverse the process to each its bytes.
With following reversal process:
The flag is:
X-MAS{VMs_ar3_c00l_aNd_1nt3resting}
NICE! We are able to get flag!
The rest of the instructions were actually just looping back for the rest of the characters to be processed. 1 character mistake actually will make 0x6025a0[0] = 0 (Instructions 1c and 1e)
Thank you for reading this long writeup
Author’s comment:
I’ve learned a lot doing this challenge and the writeup. Thank you reader for putting it up until the end and I hope you’ve also learned something in this writeup.


| DOSE: |
15 mg |
oral |
2C-I |
(capsule) |
Saturday morning.
I begin my day by walking to the video store to rent a video. Upon returning home I go into the small black sunglass pouch on my Ikea shelving unit and retrieve a gel capsule containing what is apparently 25 mg of 2-ci, which I donít believe to be pharmaceutical grade and is likely cut.
I set my stopwatch so I can keep an accurate timeframe throughout the experience. After waiting an hour and a half, I decide that the 2-ci was either fake, or too small a dose to have any effect on me.
I turn on the video I rented specifically for this occasion, which is a sci-fi cartoon called Titan A.E. Half way through the movie I realize I am having minimal introspective analytical thoughts, which I right off as nothing, coincidental, or a placebo effect. I also realize I am doing a great deal of stretching and flexing, which is synonymous with past psychedelic experiences, but still doesnít propel me past the stage of ďam I high?Ē Halfway through the movie I start to roll around and move to a precarious position on the floor. I keep seeing bits of the movie around the television set, in my peripheral vision.
I still donít believe I am feeling the effects of 2-ci and keep telling myself it is either the hangover from the previous night, or psychosomatic. Finally the movie ends and I am in a weird mood. I proceed to my room and check the stopwatch, which is still going and is at four and half hours past when I originally swallowed the capsule. I sit down at my desk and look at the wood grain only to be astounded. The grain is moving around in traditional psychedelic fashion. In fact, everything is moving. The more I look at the wood grain on the table, the more I fall into its trance. The grain transforms into multiple images and characters.
I think to myself ďhow can this be?Ē It has been over 4 hours and I am just beginning to peak right now. I look around the room, becoming transfixed on my guitar. It grows and shrinks and warps.
*I must note that the effects were mostly visual and did not include very deep thoughts or body sensations.
I go into the bathroom and take a shower, meticulously cleaning each part of body and Spend a good five minutes brushing my teeth. As I emerge from the bathroom I am feeling pretty good and I am utterly dumbfounded as to how I can be getting higher, five hours after ingestion.
I receive a phone call and have a hard time talking. I get dressed and go up stairs. I look at my mom and can hardly contain my laughter. Her eyes look so strange. She looks animated, almost like another kind of being. Her eyes look wide and very pronounced. This is the highlight of my trip. I canít shake the image of my momís eyes. I return downstairs.
Music is sounding pretty good and I start to dance around my room. I just feel like being active. I practice doing handstands and do a pretty good job. Now I am feeling great. I learn to control the images I am seeing on my desk an If I concentrate I can see whatever I want. My sociability has increased so I go out with friends. I canít stop laughing. All night I laugh so hard I have other people laughing.
*The amount of 2-ci I ingested was probably just over a threshold dose. My visuals were not strong but definitely there. Many of the effects were very similar to past psychedelics like psilocybin and LSD. I have also done a threshold dose of San Pedro cactus (mescaline and other alkaloids), which is a psychedelic phenethylamine, but can draw no comparison. Although 2-ci is describes as a short-acting psychedelic, I must say that this is the longest onset and high I have ever had and I consider myself very experienced.
All in all, it was an interesting experience. It was fun but lacked a lot of the amazing thoughts and sensations produced by other psychedelics. A higher dose might change that. Throughout the experience there was little to no anxiety. Remember that this is a research chemical with little to no research on long-term effects on the human body and brain. So be safe, be careful and have fun.
Experience Reports are the writings and opinions of the individual authors who submit them.
Some of the activities described are dangerous and/or illegal and none are recommended by Erowid.


|
Instruction-Level Abstraction (ILA)
|
The symbol is the name and ID of an object. Every object has an unique symbol. More...
#include <symbol.h>
Public Member Functions | |
| Symbol () | |
| Default constructor (empty name). | |
| Symbol (const char *str) | |
| Constructor with cstring name. | |
| Symbol (const std::string &str) | |
| Constructor with string name. | |
| Symbol (const Symbol &rhs) | |
| Copy constructor. | |
| ~Symbol () | |
| Default destructor. | |
| const std::string & | str () const |
| Get the name as basic string. | |
| const char * | c_str () const |
| Get the name as c-type string. | |
| const std::string | format_str (const std::string &prefix="", const std::string &suffix="") const |
| Get the symbol as cpp string. | |
| int | to_int () const |
| Convert the name to integer and return. | |
| const size_t & | id () const |
| Get the id. | |
| void | set_name (const std::string &name) |
| Update the name (should not be initialized before). | |
| std::ostream & | Print (std::ostream &out) const |
| Output function. | |
| Symbol & | operator= (const Symbol &rhs) |
| Overload assignment. | |
Friends | |
| std::ostream & | operator<< (std::ostream &out, const Symbol &s) |
| Overload output stream. | |
| bool | operator== (const Symbol &lhs, const Symbol &rhs) |
| Overload comparison ==. | |
| bool | operator< (const Symbol &lhs, const Symbol &rhs) |
| Overload comparison <. | |
The symbol is the name and ID of an object. Every object has an unique symbol.


--- layout: post title: 'Adding @anywhere to Your blog, or How I Pretend Like I'm a Twitter Developer' sourceurl: http://audreywatters.com/2010/04/14/adding-anywhere-to-your-blog-or-how-i-became-a-twitter-developer/ image: http://hackedu.s3.amazonaws.com/wp-contentuploads201004twitter1a.png ---
Today was Twitter's first developers' conference, Chirp. They made a lot of interesting announcements, including the release of some pretty impressive statistics. They've added a developer channel which contains a lot of information for those planning to develop Twitter-based applications.
Following their incredibly easy directions, I've added the new @anywhere feature to this blog.
[DELETED BECAUSE NO LONGER WORKING. THANKS TWITTER.]


{% extends "admin/base_site.html" %} {% block extrastyle %} {{ block.super }} {% endblock %} {% block breadcrumbs %}
{% load staticfiles %} Note that the CSV file must have columns (Name, Email, Department) like in this sample CSV file.


Programmer, Nature Enthuasist, Cyclist
You find yourself looking out into the horizon where water meets sky. Lying there, perched up on the bench, breathing in the breath of the lake. The symbiotic relationship we hold deep to our Earth is the driving force of all things. This drives me to make amazing applications that mimic this principle. User experience is the meeting of human/computer interaction. Making a very important point to ensure centrical seamless usability.


Codehaus XFire
Documentation
Quicklinks
Developers
|
The Codehaus XFire team is proud to announce XFire 1.2.3! XFire is an open source Java SOAP framework built on a high performance, streaming XML model. XFire includes support for web service standards, an easy to use API, Spring integration, JBI support, and plugable bindings for POJOs, JAXB, and XMLBeans.
XFire 1.2.3 incorporates many improvements since 1.2.3:
- Attachments are now auto-deleted unless explicitly requested otherwise
- JAXB WSDL generation fix
- Increased number of allowable open HTTP connections by default
- Fix for a possible threadlock on startup
- Many WSDL2Java fixes
- Upgraded to XBean 2.7
- Many other bug fixes
Many thanks to those who helped build and test this release!
Download Here
Upgrading to 1.2.3 from 1.2.2
- If you are using attachments, please read the section on how to handle attachments saved to exist in the user's guide.
Errata
Issues closed since last release
|
jira.codehaus.org
(29 issues)
|
|
T |
Key |
Summary |
Assignee |
Reporter |
Pr |
Status |
Res |
Created |
Updated |
Due |
|
|
XFIRE-813
|
WS_Addressing is setting MessageId to the same value for every outgoing message.
|
Tomasz Sztelak
|
Matthew
|
|
Resolved
|
FIXED
|
Dec 20, 2006
|
Jan 05, 2007
|
|
|
|
XFIRE-771
|
Schema validation in JAXB does not return validation errors to the client
|
Tomasz Sztelak
|
Alexander Ananiev
|
|
Resolved
|
FIXED
|
Nov 21, 2006
|
Jan 24, 2007
|
|
|
|
XFIRE-759
|
This WSDL fails the Xfire WsGenTask
|
Dan Diephouse
|
James Lorenzen
|
|
Closed
|
FIXED
|
Nov 15, 2006
|
Nov 26, 2006
|
|
|
|
XFIRE-758
|
NPE when generating stubs from WSDL
|
Tomasz Sztelak
|
Neeme Praks
|
|
Closed
|
FIXED
|
Nov 14, 2006
|
Nov 27, 2006
|
|
|
|
XFIRE-746
|
allow wsgen to work with wsdl from https
|
Tomasz Sztelak
|
James Burton
|
|
Resolved
|
FIXED
|
Nov 08, 2006
|
Nov 19, 2006
|
|
|
|
XFIRE-744
|
Adding handlers via annotations
|
Tomasz Sztelak
|
Tomasz Sztelak
|
|
Resolved
|
FIXED
|
Nov 06, 2006
|
Nov 06, 2006
|
|
|
|
XFIRE-743
|
HttpClient only does 2 connections by default
|
Tomasz Sztelak
|
Dan Diephouse
|
|
Resolved
|
FIXED
|
Nov 04, 2006
|
Nov 27, 2006
|
|
|
|
XFIRE-742
|
WsGenTask creates Service Impl with void output parameters and no input parameters. JAXB is the binding mechanism.
|
Dan Diephouse
|
Franz Garsombke
|
|
Closed
|
FIXED
|
Nov 03, 2006
|
Nov 07, 2006
|
|
|
|
XFIRE-729
|
RandomGUID Not Thread Safe
|
Dan Diephouse
|
Frank Tyler
|
|
Closed
|
FIXED
|
Oct 26, 2006
|
Oct 30, 2006
|
|
|
|
XFIRE-723
|
Message cache isn't deleted from outgoing side with attachments enabled
|
Dan Diephouse
|
Dan Diephouse
|
|
Closed
|
FIXED
|
Oct 22, 2006
|
Oct 22, 2006
|
|
|
|
XFIRE-719
|
Client generation takes wrong name for faults
|
Dan Diephouse
|
Frank Grupe
|
|
Closed
|
FIXED
|
Oct 19, 2006
|
Nov 26, 2006
|
|
|
|
XFIRE-713
|
JDOMStreamWriter needs a method to retrieve the Document created.
|
Tomasz Sztelak
|
Martin Bosak
|
|
Resolved
|
FIXED
|
Oct 16, 2006
|
Oct 30, 2006
|
|
|
|
XFIRE-709
|
make annotations classes serializable
|
Dan Diephouse
|
Ryan Heaton
|
|
Closed
|
FIXED
|
Oct 13, 2006
|
Oct 16, 2006
|
|
|
|
XFIRE-707
|
org.codehaus.xfire.aegis.type.basic.BeanType creates duplicate xml elements when using inheritance and overriding properties
|
Dan Diephouse
|
Michael Case
|
|
Closed
|
CANNOT REPRODUCE
|
Oct 12, 2006
|
Nov 26, 2006
|
|
|
|
XFIRE-705
|
NullPointerException when accessing an interface method and the property was not set in the WSDL.
|
Dan Diephouse
|
Pascal Lalonde
|
|
Closed
|
FIXED
|
Oct 12, 2006
|
Nov 26, 2006
|
|
|
|
XFIRE-704
|
inheritance namespace problem with xfire 1.2 or 1.2.2
|
Dan Diephouse
|
rajeev chandrasekaran
|
|
Closed
|
FIXED
|
Oct 11, 2006
|
Nov 14, 2006
|
|
|
|
XFIRE-699
|
XFire 1.2.2 and Spring 2.0 seem to be incompatible
|
Tomasz Sztelak
|
Tom Waterhouse
|
|
Resolved
|
FIXED
|
Oct 09, 2006
|
Nov 19, 2006
|
|
|
|
XFIRE-698
|
DOMInHandler strips whitespace
|
Dan Diephouse
|
Brad Davis
|
|
Closed
|
FIXED
|
Oct 09, 2006
|
Oct 16, 2006
|
|
|
|
XFIRE-694
|
Only first part of the message has namespace declaration
|
Tomasz Sztelak
|
Tomasz Wysocki
|
|
Resolved
|
FIXED
|
Oct 09, 2006
|
Oct 16, 2006
|
|
|
|
XFIRE-688
|
HashMap access in CustomTypeMapping causes Thread-lock issues under high load
|
Dan Diephouse
|
Brice Ruth
|
|
Closed
|
FIXED
|
Oct 03, 2006
|
Nov 07, 2006
|
|
|
|
XFIRE-658
|
Some WSS4J properties not working properly
|
Tomasz Sztelak
|
Bruno Borges
|
|
Resolved
|
FIXED
|
Sep 21, 2006
|
Oct 03, 2006
|
|
|
|
XFIRE-635
|
Parse exception on empty elements of type java.lang.Integer
|
Dan Diephouse
|
Jakub Mendys
|
|
Closed
|
WON'T FIX
|
Sep 08, 2006
|
Oct 30, 2006
|
|
|
|
XFIRE-624
|
The namespace prefix of the soapfault code cannot be change from ns1 when creating the fault code
|
Dan Diephouse
|
David James
|
|
Closed
|
FIXED
|
Sep 05, 2006
|
Nov 27, 2006
|
|
|
|
XFIRE-568
|
JAXB 2.0 with Annotations generates invalid schema imports
|
Dan Diephouse
|
Muhammad Alsebaey
|
|
Closed
|
FIXED
|
Aug 05, 2006
|
Nov 28, 2006
|
|
|
|
XFIRE-507
|
Documentation support for WSDL->Java and Java->WSDL
|
Tomasz Sztelak
|
Stefan Freyr Stefansson
|
|
Resolved
|
FIXED
|
Jun 29, 2006
|
Nov 27, 2006
|
|
|
|
XFIRE-351
|
Exception when enabling DomInHandler
|
Dan Diephouse
|
Andrew Wright
|
|
Closed
|
FIXED
|
Apr 12, 2006
|
Nov 13, 2006
|
|
|
|
XFIRE-311
|
BeanTypeInfo cannot process interface inheritance more than two level
|
Dan Diephouse
|
Flier Lu
|
|
Closed
|
FIXED
|
Mar 16, 2006
|
Oct 16, 2006
|
|
|
|
XFIRE-269
|
Missing wsdl:documentation and wsdl:fault in generates ws-server
|
Tomasz Sztelak
|
Thomas Kämmerer
|
|
Resolved
|
FIXED
|
Feb 17, 2006
|
Nov 27, 2006
|
|
|
|
XFIRE-175
|
If services.xml doesn't exist, the world should move on
|
Dan Diephouse
|
Dan Diephouse
|
|
Closed
|
WON'T FIX
|
Nov 16, 2005
|
Nov 13, 2006
|
|
|