|
||||||||||
| PREV NEXT | FRAMES NO FRAMES |
| Packages that use javax.servlet.jsp.tagext | |
| javax.servlet.jsp | |
| javax.servlet.jsp.tagext |
Classes in javax.servlet.jsp.tagext used by javax.servlet.jsp| BodyContent
|
A JspWriter subclass that can be used to process body evaluations so they can re-extracted later on. |
Classes in javax.servlet.jsp.tagext used by javax.servlet.jsp.tagext| BodyContent
|
A JspWriter subclass that can be used to process body evaluations so they can re-extracted later on. BodyTag
|
The BodyTag interface extends Tag by defining additional methods that let a Tag handler access its body. Tag
|
The Tag interface defines the basic protocol between a Tag handler and JSP page implementation class. TagAttributeInfo
|
Information on Tag Attributes; this class is instantiated from the Tag Library Descriptor file (TLD). TagData
|
Tag instance attribute(s)/value(s); often this data is fully static in the case where none of the attributes have runtime expresssions as their values. TagExtraInfo
|
Extra Tag Information for a Custom Tag; this class is mentioned in the Tag Library Descriptor file (TLD). TagInfo
|
Tag information for a tag in a Tag Library; this class is instantiated from the Tag Library Descriptor file (TLD). TagLibraryInfo
|
Information on the Tag Library; this class is instantiated from the Tag Library Descriptor file (TLD). TagSupport
|
Actions in a Tag Library are defined through subclasses of Tag. VariableInfo
|
Information on the scripting variables that are created/modified by a tag (at run-time); this information is provided by TagExtraInfo classes and it is used by the translation phase of JSP. |
|
||||||||||
| PREV NEXT | FRAMES NO FRAMES |


Susan Granger's review of "DON'T SAY A WORD" (20th Century-Fox)
In this child-snatching suspense story, Michael Douglas plays Dr. Nathan Conrad, a successful Manhattan psychiatrist whose eight year-old daughter Jessie (Skye McCole Bartusiak) is kidnapped on Thanksgiving by Koster, a European jewel thief (Sean Bean). To get her back, the doctor most promise not to call the police. He is then given seven hours to unlock the mind of a new patient, a deeply disturbed woman, Elisabeth Burrows (Brittany Murphy), referred to him by a colleague (Oliver Platt), and extract a six-digit number that's the key to locating a rare red diamond worth $10 million that Koster and her father, his ex-partner, stole a decade ago. But Elisabeth cryptically insists, "I'll never tell...any of you." Adapted by Anthony Peckham and Patrick Smith Kelly ("True Crime") from Andrew Klavan's novel and directed with visual flair by Gary Fleder ("Kiss the Girls"), this is a tension-filled, if predictable, thriller, juggling four different scenarios: a) the doctor's desperate attempts to draw the number out of Elisabeth, b) flashbacks to the childhood trauma that has kept her in various psychiatric institutions for years, c) the crooks' interaction with the doctor's bedridden wife (Famke Janssen), immobilized after a skiing accident, and d) the involvement of a tough NYPD detective (Jennifer Esposito) in a seemingly unrelated murder that eventually leads to Jessie's captors. Problem is: you know from the getgo how it's going to turn out - and none of the actors are trying anything new. Douglas faced similar nightmarish predicaments in "The Game" and "Fatal Attraction," while Brittany Murphy honed her quirky/crazy character in "Girl, Interrupted." On the Granger Movie Gauge of 1 to 10, "Don't Say a Word" is a disturbing, diverting 6, escapist entertainment that really shouldn't be dissected.
========== X-RAMR-ID: 29639 X-Language: en X-RT-ReviewID: 252372 X-RT-TitleID: 1110073 X-RT-SourceID: 742 X-RT-AuthorID: 1274 X-RT-RatingText: 6/10
The review above was posted to the
rec.arts.movies.reviews newsgroup (de.rec.film.kritiken for German reviews).
The Internet Movie Database accepts no responsibility for the contents of the
review and has no editorial control. Unless stated otherwise, the copyright
belongs to the author.
Please direct comments/criticisms of the review to relevant newsgroups.
Broken URLs inthe reviews are the responsibility of the author.
The formatting of the review is likely to differ from the original due
to ASCII to HTML conversion.
Related links: index of all rec.arts.movies.reviews reviews


top
|
up
|
prev
|
next
RecursiveMutex Struct
Definition at line
189
of
ConditionVariable.cpp
Member Variables
int32_t
id
top
|
up
|
prev
|
next


{% if saved_searches %}
We'll email you when we find new items for these searches:
{% for search_phrase, search_alerts in saved_searches.items() %}You currently have no saved search alerts. To create an alert, start by doign a search below.
{% endif %}


SNATCH (director/writer: Guy Ritchie; cinematographer: Tim Maurice-Jones; editor: Jon Harris; cast: Benicio Del Toro (Franky Four Fingers), Dennis Farina (Avi), Jason Flemyng (Darren),Vinnie Jones (Bullet Tooth Tony), Brad Pitt (Mickey O'Neil), Rade Sherbedgia (Boris the Blade), Jason Statham (Turkish), Stephen Graham (Tommy), Alan Ford (Brick Top), Ade (Tyrone), Lennie James (Sol), Robbie Gee (Vinny), Adam Fogerty (Gorgeous George), Mike Reid (Doug the Head), Sorcha Cusack (Mrs. O'Neil-Mickey's mother), Andy Beckwith (Errol); Runtime: 105; Screen Gems; 2000-UK/USA)
Reviewed by Dennis Schwartz
Guy Ritchie has cleaned up some of the mess he made in this encore to his surprise box-office cult hit "Lock, Stock and Two Smoking Barrels," but has made the same kind of empty, semiserious/comedy/crime caper, with many of the same actors from that film. But, this time the story holds together better and is much more amusing, thanks in a large part to the ensemble cast who come and go in the film with seamless fluidity.
It's a film filled with an assortment of colorful Runyonesque characters from the underworld of crime, or illegal bare-knuckle boxing matches, or from the outcasts of society. They are shady Jews speaking in broken Yiddish, who are diamond thieves; black con artists running petty scams; members of a gypsy caravan who engage in various hustles; and Brits with heavy cockney accents who are either thugs or wannabe thugs. Everyone is after some easy money. This film, like the director's other one, has no strong role for a woman.
The main plot is about a series of mishaps over a stolen diamond that somehow brings together a varied mix of characters who are after it or are inadvertently drawn into its disappearance, but the plot is really irrelevant, it plays as a McGuffin--this is strictly a character driven film, with all the characters being either lively in a cartoonish way, undeveloped, or forgettable.
Thieves posing as Hasidics, heist a valuable, flawless 84-carat stone diamond from an Antwerp jeweler and split-up after the job, leaving the diamond with the exquisitely well-tailored Jewish gangster Franky Four Fingers (Benicio Del Toro). He places the diamond in a briefcase handcuffed to his wrist and calls his diamond dealer relative Avi (Farina) in New York, telling him he has landed in London and has spoken to Doug the Head (Reid), who is a wannabe Jew and a fence for jewels.
The double-cross begins when one of the thieves, before they split, tells Franky to see the Russian, Boris the Blade (Sherbedgia), while in London, and he will get him a gun. The thief then calls his relative Boris and tells him to rob the diamond from Franky.
Boris gives the gun for free to Franky, but asks a favor of him, to place a bet with a bookie on a boxing match. He then arranges for black pawnshop owner Sol (Lennie James) to rob the bookie and get the briefcase to him. Sol brings along for the job two inept partners, Vinny (Robbie Gee) and Tyrone (Ade).
The movie will spin-off in different directions, telling each groups' story, until it all comes together in the last reel and plays itself out. The film is narrated by the main protagonist, the somewhat likable Turkish (Jason Statham), who with his clueless pal Tommy (Stephen Graham) own an amusement arcade and are boxing promoters, and are not above being small-time crooks.
Turkish wants a newer caravan instead of the wreck he currently has to be his business office and sends Tommy to buy one, but Tommy gets his fighter beat up in the gypsy camp he went to buy the caravan. To replace their fighter for an upcoming fight, Tommy gets the one who put his boxer out of commmission, the hustler who sold them the broken-down caravan, Mickey (Pitt), an Irish gypsy with an indeciferable brogue, a body filled with tattoos, and a beautiful knock-out punch. He is told to take a dive in a bare-knuckles boxing match arranged by Brick Top (Alan Ford), a notorious gang leader. If he doesn't take the dive, they're all in trouble with the sadistic Brick Top.
Avi, when he finds out from Doug that Franky is going to a boxing match and can't be located, flies over to London and hires Bullet Tooth Tony (former soccer star Vinnie Jones) to find Franky.
The film is played mostly for the comedy and it throws everything it thinks is crazy into the comic mix, even a shaggy dog story. The language used has many expletives and is often hard to understand because of the heavy accents. The violence is brutal but cartoonish, as the film is styled much like a comic book. Guy Ritchie's wife Madonna sings "Lucky Star." The rest of this heavily induced homage to musical video films, has a soundtrack that ranges from Massive Attack to Oasis.
Ford's menacing psychotic performance, stood out as the film's most memorable one. Pitt's self-effacing comedy was the performance I best enjoyed, as it gave the film a sparkling light touch; while, Dennis Farina, also, was pleasingly comical and added some light touches to this cartoonish film.
The only slow down in the film is in the opening moments, when the large cast of characters is introduced. Other than that, the film moves at high speed, with all kinds of film gimmicks, from jump cuts to multi use of graphics. This is a film that thrives on controlled chaos as its signature theme. I would call it another dumb cult picture the director has made, one that suffers because there is no one in this film to care about.
REVIEWED ON 3/18/2001 GRADE: C+
Dennis Schwartz: "Ozus' World Movie Reviews"
http://www.sover.net/~ozus
<EMAIL_ADDRESS>© ALL RIGHTS RESERVED DENNIS SCHWARTZ
The review above was posted to the
rec.arts.movies.reviews newsgroup (de.rec.film.kritiken for German reviews).
The Internet Movie Database accepts no responsibility for the contents of the
review and has no editorial control. Unless stated otherwise, the copyright
belongs to the author.
Please direct comments/criticisms of the review to relevant newsgroups.
Broken URLs inthe reviews are the responsibility of the author.
The formatting of the review is likely to differ from the original due
to ASCII to HTML conversion.
Related links: index of all rec.arts.movies.reviews reviews


{% extends 'layout_simple.html' %} {% block content %}
Assuming computers just do what you tell them... we probably made a mistake somewhere.
We will start working on a fix asap.
{% if sentry_event_id %}
Error reference:
{{ sentry_event_id }}


Your browser does not support frames. Try
Internet Explorer 3.0 or later
or
Netscape Navigator 2.0 or later
.


SMP_DISCOVER
Section: SMP_UTILS (8)Updated: January 2008
Index Return to Main Contents
NAME
smp_discover - invoke DISCOVER SMP functionSYNOPSIS
smp_discover [--brief] [--help] [--hex] [--ignore] [--interface=PARAMS] [--list] [--multiple] [--num=NUM] [--phy=ID] [--raw] [--sa=SAS_ADDR] [--verbose] [--version] SMP_DEVICE[,N]DESCRIPTION
Sends a SAS Management Protocol (SMP) DISCOVER request function to a SMP target and decodes or outputs the response. The SMP target is identified by the SMP_DEVICE and the SAS_ADDR. Depending on the interface, the SAS_ADDR may be deduced from the SMP_DEVICE. With one interface there is one SMP_DEVICE per machine so the SMP_DEVICE,N syntax is needed to differentiate between HBAs if there are multiple present.
OPTIONS
Mandatory arguments to long options are mandatory for short options as well.- -b, --brief
- reduce the decoded response output. If used twice will exit if there is no attached device (after outputting that). When used with --multiple, unattached phys are not listed; when used twice, trims attached phys output.
- -h, --help
- output the usage message then exit.
- -H, --hex
- output the response in hexadecimal.
- -i, --ignore
- sets the Ignore Zone Group bit in the SMP Discover request.
- -I, --interface=PARAMS
- interface specific parameters. In this case "interface" refers to the path through the operating system to the SMP initiator. See the smp_utils man page for more information.
- -l, --list
- list attributes in "name=value" form, one entry per line.
- -m, --multiple
- loops over multiple phys within SMP target (typically an expander) and does a DISCOVER request and outputs a one line summary. Phy 0 is queried first, then phy 1, continuing until an error occurs. If --brief is given then there is no output for phys that indicate there is no attached device; when used twice additionally trims the output line of attached phys.
- -n, --num=NUM
- number of phys to fetch, starting at --phy=ID when the --multiple option is given. The default value is 0 which is interpreted as "the rest" (i.e. until a "phy does not exist" function result is received). This option is ignored in the absence of the --multiple option.
- -p, --phy=ID
- phy identifier. ID is a value between 0 and 127. Default is 0.
- -r, --raw
- send the response to stdout in binary. All error messages are sent to stderr.
- -s, --sa=SAS_ADDR
- specifies the SAS address of the SMP target device. Typically this is an expander. This option may not be needed if the SMP_DEVICE has the target's SAS address within it. The SAS_ADDR is in decimal but most SAS addresses are shown in hexadecimal. To give a number in hexadecimal either prefix it with '0x' or put a trailing 'h' on it.
- -v, --verbose
- increase the verbosity of the output. Can be used multiple times
- -V, --version
- print the version string and then exit.
SINGLE LINE FORMAT
The --multiple option causes SMP DISCOVER responses to be compressed to a header followed by one line per phy. To save space SAS addresses are shown in hex without a '0x' prefix or 'h' suffix. The header line gives the SAS address of the SMP target itself and assumes it is an expander.Each line starts with " phy <n>:" where <n> is the phy identifier (and they are origin zero). That is followed by the routing attribute represented by a single letter which is either "D" for direct routing, "S" to subtractive routing or "T" for table routing. Then comes the negotiated physical link rate which is either "disabled", "reset problem" or "spinup hold". Other states are mapped to "attached". This includes enabled phys with nothing connected which appear as "attached:[0000000000000000:00]".
Information shown between the brackets is for the attached device. Phys that are connected display something like: "attached:[5000c50000520a2a:01 " where the first number is the attached SAS address (in hex) and the second number is the attached device's phy identifier. If the attached device type is other than an end device then one of these abbreviations is output: "exp" (for expander), "fex" (for fanout expander) or "res" (for unknown attached device type). If a phy is flagged as "virtual" then the letter "V" appears next. Next are the protocols supported by the attached device which are shown as "i(<list>)" for initiator protocols and/or "t(<list>)" for target protocols. The <list> is made up of "PORT_SEL", "SSP", "STP", "SMP" and "SATA" with "+" used as a separator. For example a SAS host adapter wi11 most likely appear as: "i(SSP+STP+SMP)". This completes the information about the attached phy, hence the closing right bracket.
Finally, if appropriate, the negotiated physical link rate is shown in gigabits per second. Here is an example of a line for expander phy identifier 11 connected to a SATA target (or SATA "device" to use the t13.org term):
phy 11:T:attached:[500605b000000afb:00 t(SATA)] 1.5 Gbps
CONFORMING TO
The SMP DISCOVER function was introduced in SAS-1, with small additions in SAS-1.1 . There have been a large number of additions in SAS-2 .AUTHORS
Written by Douglas Gilbert.REPORTING BUGS
Report bugs to <dgilbert at interlog dot com>.COPYRIGHT
Copyright © 2006-2008 Douglas GilbertThis software is distributed under a FreeBSD license. There is NO warranty; not even for MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
SEE ALSO
smp_utils, smp_discover_list, smp_phy_control
Index
- NAME
- SYNOPSIS
- DESCRIPTION
- OPTIONS
- SINGLE LINE FORMAT
- CONFORMING TO
- AUTHORS
- REPORTING BUGS
- COPYRIGHT
- SEE ALSO
This document was created by man2html, using the manual pages.
Time: 05:34:30 GMT, December 24, 2015


Contact us if you have any questions or if you would like to book a group tour of 10+. We will reply within one business day! All your information will be kept confidential


Tereshin went under the knife last week to have some of the dead tissue — and globs of synthol oil — removed from his massive arms, because you can’t treat your body like the deep fryer at ... (wait for it) ... POPEYES and expect to live a normal, healthy life.
Not surprisingly, the 23 year-old Russian was unsuccessful in his mixed martial arts (MMA) debut, getting wasted by aging actor Oleg Mongol earlier this year in Abakan (watch the video here).


Third party name is required
Link is required
Subscription date from is required
Subscription end date is required
Subscription type is required
{{progress2}}
File too large {{school.logo.size / 1000000|number:1}}MB: max 20M


Train RC Dashboard
Lego Train RC
Date and Time
%DATETIME%
Speed 7
Speed 6
Speed 5
Speed 4
Speed 3
Speed 2
Speed 1
Stop
Speed -7
Speed -6
Speed -5
Speed -4
Speed -3
Speed -2
Speed -1
LogEvents
Download


Density, distribution function, quantile function and random generation for the family of power and reversal power distributions.
| Version: | 0.1.4 |
| Depends: | R (≥ 3.1.0) |
| Imports: | stats, rmutil, gamlss.dist, normalp |
| Published: | 2017-11-23 |
| Author: | Susan Anyosa [aut, cre], Jorge Luis Bazán Guzmán [aut], Artur Lemonte [aut] |
| Maintainer: | Susan Anyosa <susanaliciach at gmail.com> |
| License: | GPL-3 |
| NeedsCompilation: | no |
| CRAN checks: | powdist results |
| Reference manual: | powdist.pdf |
| Package source: | powdist_0.1.4.tar.gz |
| Windows binaries: | r-devel: powdist_0.1.4.zip, r-release: powdist_0.1.4.zip, r-oldrel: powdist_0.1.4.zip |
| OS X binaries: | r-release: powdist_0.1.4.tgz, r-oldrel: powdist_0.1.4.tgz |
| Old sources: | powdist archive |
Please use the canonical form https://CRAN.R-project.org/package=powdist to link to this page.


Amazon, Xiaomi, Samsung fail security test: Ethical hackers breach devices
Team Fluoroacetate, comprising of members Amat Cama and Richard Zhu collected a bounty of $1,45,000 during the first day of the event
by IANSA dual-member team of white-hat hackers by the name of Fluoroacetate, hacked Amazon Echo speakers, Xiaomi Mi9, Samsung and Sony smart TVs at the Pwn2Own hacking contest here.
Team Fluoroacetate, comprising of members Amat Cama and Richard Zhu collected a bounty of $1,45,000 during the first day of the event, after successfully hacking these devices, Android police reported.
The hackers first targeted Sony's X800G smart TV, using a Javascript OOB Read bug to exploit the television's built-in web browser, by doing this the team earned $15,000.
The duo, Cama and Zhu earned $60,000 for taking control of an Amazon Echo device using an integer overflow in JavaScript.
The two Samsung devices that they hacked were the Galaxy S10 smartphone and Q60 smart TV. This victory earned the team $45,000.
Additionally, the duo targeted the Xiaomi phone Mi 9 and earned them a reward of $20,000.
--IANS
wh/rs
(Only the headline and picture of this report may have been reworked by the Business Standard staff; the rest of the content is auto-generated from a syndicated feed.)


animateMePlz lets you animate anything on a website upon scrolling to it. It's incredibly lightweight – only 0.8 kb – while offering dozens of customizations.
Copy and paste a few lines of HTML and you'll have animateMePlz installed in seconds. Thanks to Dan Eder's animate.css, every animation is pure CSS.


ResolverOptions
public class ResolverOptions<Service>
A ResolverOptions instance is returned by a registration function in order to allow additonal configuratiom. (e.g. scopes, etc.)
-
Declaration
Swift
public init(resolver: Resolver, factory: @escaping ResolverFactoryArguments<Service>)
-
Indicates that the registered Service also implements a specific protocol that may be resolved on its own.
Declaration
Swift
public final func implements<Protocol>(_ type: Protocol.Type, name: String? = nil) -> ResolverOptions<Service>
Parameters
type
Type of protocol being registered.
name
Named variant of protocol being registered.
Return Value
ResolverOptions instance that allows further customization of registered Service.
-
Allows easy assignment of injected properties into resolved Service.
Declaration
Swift
public final func resolveProperties(_ block: @escaping ResolverFactoryMutator<Service>) -> ResolverOptions<Service>
Parameters
block
Resolution block.
Return Value
ResolverOptions instance that allows further customization of registered Service.
-
Allows easy assignment of injected properties into resolved Service.
Declaration
Swift
public final func resolveProperties(_ block: @escaping ResolverFactoryMutatorArguments<Service>) -> ResolverOptions<Service>
Parameters
block
Resolution block that also receives resolution arguments.
Return Value
ResolverOptions instance that allows further customization of registered Service.
-
Defines scope in which requested Service may be cached.
Declaration
Swift
public final func scope(_ scope: ResolverScope) -> ResolverOptions<Service>
Parameters
block
Resolution block.
Return Value
ResolverOptions instance that allows further customization of registered Service.


Introduction
Introduction
When it comes to playing game with robots, the list seems ever-growing. Now the time has come to show up control skills and play the most exciting game of all time with robots. SRISTI 2K16 presents ‘Robo Soccer’, where players have to design a manually or wirelessly controlled robot capable of hitting the ball from anywhere of the field to score a goal in the opponents court and also defense for own court.
Problem Statement
Build two manually controlled bots wired or wireless capable of scoring and defending their goalpost. Bots have to play as a team on the arena simultaneously fighting with the bots of the opposite team. Participants should compete the game as per rules and regulations. Vent is divided into rounds. The team with most number of Goals wins.
Arena Specifications
1. Area of Arena will be 2500 X 1500 mm.
2. Goalpost will be placed outside the 2500 mm mark.
3. It has two goal post which are out of the field having dimension 600 X 400 X 300 mm (L*B*H).
NOTE: The arena shown in the figure is only a sample version. Actual Arena may differ slightly in dimensions from the one shown in figure.
Bail Specifications and Movements
1. The diameter of ball (Table tennis Ball) will be 38-40 mm and of negligible weight.
2. A robot cannot hold the ball for more than 5 secs (HINT: Holding a ball means taking full control over the ball by removing all degrees of freedom). The ball cannot be held underneath a robot. 3. The ball must be visible at all times and cannot be grabbed at any time. Opponent must be able to access the ball.
Bot Specifications
1. The dimensions of the body of the bots must not exceed 25*25*25 cm. The bot may have foldable hands. It may not expand at any time during the match beyond 35cm for hitting the ball. Violating this clause will lead to immediate disqualification.
2. The bots should be controlled by a wired or wireless remote control throughout the turn. In case of wireless control, the bots must be able to work on two different frequencies.
3. Neither bots, manual or autonomous bots, must not be made from Lego parts or readymade assembly kits.
4. Only an AC Power supply of 220 V for either bot will provided at the event. The voltage should not exceed 24 volts in DC.
5. Weight of the Robot depends on the Participant’s choice, but should not exceed 2 Kg. Wire should be slack during the course of match. It should be of minimum 4 metres.
Rules
Rules and Regulations
1. Each team can have a maximum of 5 members and can be formed of participants from different Institutions.
2. Each team must be led by one person, the captain, who shall attend to the call by the organizers whenever necessary.
3. At the signal from the on commence and the bot will start from the starting line.
4. Measurement of the bot will be done before the start of event by a panel of referee. It is responsibility of the teams to get their robots reinspected if their robots are modified at any time during the tournament.
5. The robot should not damage the arena by any means, damaging may lead to negative points.
6. A Free Kick will be given to other team in case of fouls during which bots of the team committing the foul will be freezed and ball will be given to the other team.
7. If two fouls are committed by team, a penalty shootout will be given to the opponent team.
8. Teams will have to report at least 15 minutes before the time slot allotted to them at the beginning of the event, failing to do so may result in disqualification.
9. The decision of the event organizers and judges shall be treated final and abiding. Organizers reserve the rights to change the rules at any point of time as they deem fit.
Round1
1. This will be a qualifying round of total duration of 3 minutes.
2. Only one bot is allowed to participate in this round.
3. 6 Balls will be placed at different position along with some obstacles.
4. Each goal will gather 10 points and for every spare 10 seconds, team will be awarded 5 points.
Round2
1. Teams will have to play a football match against other team. Teams will be divided into pools details of which will be provided at the starting of event.
2. Teams will be required to participate with two bots in this round.
3. There will be two half each of duration 5 minutes (Total-10 mins).
4. Time break between 2 halves is 1 minute.
5. If the attacking bot of both teams or the ball is immobile for 5 secs, then the ball will be replaced at starting point.
6. Only one bot of a team can be at its goal post at a time.
7. Timeout of 2 minutes can be taken by each team during the match for once. Any extra timeout and own goal will be considered as a goal by the opposition.
8. In case of Tie, 3 minutes’ extra time will be given. The team to score first goal during the extra time will win the match. If no goal is scored during extra time, winner will be decided by penalty shoot outs during which 2 penalty shoots will be given to each team in turn.
9. During penalty shoots, only the striker bot and goal keeper bot will be placed in arena and the ball will be placed at the centre of the arena. After the first half, goals will be swapped.
10. Points will be given for goals only and team with more goals will be winner.
11. This continues till only two teams are left.
Round3
1. This round has same rules as round 2. • There will be two half each of duration 5 minutes (Total-10 mins). • Time break between 2 halves is 2 minutes. • In case of tie, 3 min extra time will be given. If no goal is scored, winner will be decided by 5 penalty shootout.
Prize
Certificate Policy
1. Certificate of Excellence will be provided to the participants who qualify for the FINALS.
2. Certificate of Participation will be provided to all the participants taking part in the event.
3. The teams which get disqualified due to disobeying any of the rules provided will not be entertained with any kind of certification.
Prize money worth: Rs. 16,000


Kynan Chenai slips, but remains on top
Leads the field along with Jungsher
by Kamesh SrinivasanOlympian Kynan Chenai slipped a bit at the end of the second day, but still led the field in the company of Jungsher Virk, as the two led with 98 out of 100 after four rounds of men’s trap in the 63rd National shotgun championship at the Dr. Karni Singh Range, Tughlakabad, on Thursday.
After three perfect rounds of 25, Kynan had a 23 in the fourth round. In contrast, Jungsher, followed up his two rounds of 24 on the opening day, with two perfect rounds of 25 to jump into the joint lead.
While Anant Shivan Pratap Singh followed with 97, there were eight others on 96, including the former World champion and six-time Asian champion Manavjit Singh Sandhu who shot two rounds of 25.
Yuvraj Kumar Mahajan, Mohd. Saif Sheikh, Aakash Kushwaha, Vibhu Sharma, Manavaditya Singh Rathore, Prithviraj Tondaiman and Zoravar Singh Sandhu were the others on 96. Zoravar had shot two rounds of 25 earlier, and came up with rounds of 23 on Thursday. Prithviraj Tondaiman had rounds of 24 and 23 this day.
The young Vivaan Kapoor was on 95 along with Vishavdev Singh Sidhu.
Among the juniors, Jungsher Virk led with 98, two points ahead of Aakash Kushwaha, Vibhu Sharma and overnight leader Manavaditya Singh Rathore.
The fifth and last round will be held on Friday. The top six will compete in the finals, in the men’s and junior events.


Preparation time
less than 30 mins
Cooking time
10 to 30 mins
Serves
Serves 2
Tangy rhubarb really complements the rich, oily mackerel and a light citrus salad rounds it all off perfectly.
For the chutney, in a heavy-based pan melt the sugar until a golden-brown caramel forms. Remove from the heat and stir in the sultanas, rosemary sprigs, ginger, shallot and rhubarb.
Stir in the cider vinegar and orange juice. Bring back to the boil and cook gently for 8-10 minutes. Season with salt and pepper and set aside to cool.
To make the salad, mix together the orange segments, chicory leaves, pea shoots, celery tops and dill. Dress with rapeseed oil and season with salt and pepper.
For the mackerel, place the mackerel fillets skin-side up on an oven tray. Brush with rapeseed oil and use a blow torch to cook evenly. Turn over and repeat on the other side (alternatively place the fillets under a hot grill). Season with salt and pepper.
Serve a spoonful of chutney with the cooked mackerel fillets and salad. Garnish with ribbons of rhubarb.


Prom Dresses
ADD Prom Dress
Sort Dresses
Welcome to Prom Dresses! A Prom dress catalogue where you can add, rate, view, and comment on our popular dresses!
Dress Name
Image URL
Price
Silhouette
Fit and Flare
Wrap
Fitted
Asymmetrical
Empire Waist
Sheath
Mermaid
Neckline
Sweetheart
Square
One Shoulder
Off the Shoulder
V-Neck
Plunging
Halter
Length
Long
Short
Midi


This project was completed by Professor Bill Barry’s fall 2017 advanced Greek reading class at the University of Puget Sound. The graph shows the architecture of digressions in Herodotus’ Histories Book VI and allows detailed exploration of the structure of the narrative, which is characterized by multi-level digressions on not only historical topics, but also genealogical, mythical, ethnographic, and linguistic concerns.
Herodotus’ Histories, written in the second half of fifth century BCE, chronicles great deeds done by both Greeks and Persians, mainly during the time of the Persian Wars. This text, often credited as one of the first historical texts in the classical tradition, contains a variety of episodes that diverge from the overarching account of the war. Although Herodotus does follow the chronology of the war over the main narrative itself, he chooses, as an author, to explore numerous other themes through side stories known as digressions.
These graphs were built using an open-source SigmaJS plug-in from the Oxford Internet Institute. The two graphs below provide different perspectives on the architecture of digressions in Herodotus' Histories VI. They are each color-coded by level of digressions, and allow you to filter by level of digression as well; the light green nodes are the main narrative, and other colors represent various levels of digression. The buttons on the top and bottom of the graphs will open the graphs in a new tab for more in-depth viewing.


Hi, my name is Thomas Seal and this where I bring my most creative side to life.
What began as a sudden interest in typography (which probably wasn’t very sudden at all) quickly escalated into a fevered obsession with all things graphic design. This combined with my natural love of words and desire to communicate could only lead to me building a website, e voilà!
I created maxwell.life to be a space for me to share my thoughts and ideas, to help me grow creatively and find my voice. This is just a humble beginning, but I’m super excited to finally have a piece of the web to call my own.  This site is still very much a work in progress, so feel free to send me your thoughts about its design too.


Errors!
{% for error in errors %}
{{ error }}
{% endfor %}
Maybe it is an issue you can help us out with?
If the records checked is displaying 0 or none of the years contain data then it means the last data import failed due to an unexpected value in one of the columns.
So far non-date values in the date column have caused this problem to occur. Please check that no such values are present and hopefully it will rectify the import on the next attempt.


The Magazine page allows you to read the Softalk issue by moving forward and backward through pages sequentially, as well as jumping to specific articles, reviews, letters, ads, and more featured in the issue.
You can pick a game featured in the issue to play, but choose wisely. Once you choose a game, other games will no longer be available. In the early 1980s, access to a physical computer stores and higher game prices made purchasing games difficult for some people.
Reading the Magazine
Click the top-right or bottom-right corner of the page to move to the next page
Click the top-left or bottom-left corner of the page to the previous page
Click on the page to zoom in. Click again to zoom back out
If you would rather read the magazine off this site, the download icon at the top of the page will link to a PDF version of the magazine for you to read in the PDF reader of your choice.
To Jump to a Section in the Magazine
Click a game image below the magazine. Each game image has different sections to jump to and read
Click on a link to skip to that page in the magazine
Choosing a Game
Select the Pick This Game button under the game you want to play the Are You Sure? pop-up box appears
Click YES! to choose the game or click NO! to make another selection
Downloading a Game
Follow the instructions for choosing a game
Once you have picked a game, the Download button will appear under the game. Click the Download button. The games .dsk file should appear in your Downloads folder
Click the new link at the top left of the page to go to the Game page and play the game
Are You Sure?
You can only pick and play one game per issue.
Are You Sure?
You can only pick and play one game per issue.
Are You Sure?
You can only pick and play one game per issue.
Hey! This isn't great on mobile!
Technically it will load, but the magazines are hard to read and the games are unplayable without a keyboard. We suggest you come back on a computer browser later. Don't worry the link will still be here!


{% load static %}
{%block styles %} {%endblock %}Some quick example text to build on the card title and make up the bulk of the card's content.
Go somewhereSome quick example text to build on the card title and make up the bulk of the card's content.
Go somewhereSome quick example text to build on the card title and make up the bulk of the card's content.
Go somewhere


75 YEARS OF HISTORY
a lifetime of adventure
a heritage of heroes
For 75 years the Jeep® brand has been indelibly linked to freedom, adventure, authenticity and passion. The brand's unwavering commitment to strength and meaningful engineering has helped forge an extraordinary, uncommon bond between the vehicles and their owners.
Our core values are embodied in every Jeep vehicle's DNA. Jeep vehicle owners have long known that Go Anywhere. Do Anything.® is a way of life, not just a slogan. The Jeep badge stands for more than a brand. In truth, it's a badge of honor.
Explore our legendary lineup, then create your own timeless story.
2000 - Today
The radical 2003 Jeep® Wrangler Rubicon was the most capable vehicle ever produced by the Jeep brand. A new four-door Wrangler variant was launched and took the industry by storm. Wrangler Unlimited opened up the world of capability to people who needed the room and utility of four doors. In 2006, Compass and Patriot were the first Jeep vehicles to reach into the small cross-utility segment.
An All-New redesigned 2011 Grand Cherokee was launched to rave reviews and refreshed in 2013 with many new styling cues and a new 3.0L EcoDiesel engine. The All-New 2014 Cherokee replaced the Liberty, promising to redefine the midsize segment. And in 2015, the Jeep brand entered the small SUV market with the Renegade, once again bringing capability and Jeep brand style to a whole new market.


I’m a freelance writer and reporter based in Washington, D.C.
Over the past half-decade, I’ve covered topics of all sorts in both print and radio — from travel to housing and gentrification, to sports and energy. I also specialize in reporting with data and public records. My work has been featured in a variety of publications, not limited to, but including: the San Francisco Chronicle, the East Bay Express, Oakland Magazine, KQED and others.
In 2018, I earned a master’s degree from the UC Berkeley Graduate School of Journalism.
Twitter: @wordsmithsilva


Login to Your Account
Log in
Forgot password?
or
Log in with:
Facebook
Google
Not a member?
Sign up now


The website is loading.
The loading process is taking more time as expected.
The platform is deployed on Heroku as a free website. So it may take a bit of time to load the full website.
Please, if you are reading this message, refresh this page after some seconds until the platform is fully loaded.


Package readycli
Class Command
java.lang.Object
readycli.Command
- All Implemented Interfaces:
java.io.Serializable
public final class Command
extends java.lang.Object
implements java.io.Serializable
Represents a command to be typed in a command line. The command can be
included in a
If the program is designed to run from a jar file, the usage string can specify to run the program as
Alternatively, the usage string can be an empty string, so that documentation shows only the expected arguments.
If the command is implemented in a CLI, the usage string can be just equal to the name of the command.
The usage string can be an empty string.
CLI
or can be a stand-alone command that represents a
Java class with an executable main() method. In this case the command can be
used to parse command line arguments passed to the main() method.
Command components
A command is mainly composed by:- A usage string: shows how to use the command;
- A description: is used for command documentation; it tells what the command will do when invoked;
- Required arguments: are the arguments necessary for command execution (e.g. the source and the destination file names for a copy command).
- Options: optional parameters or flags that have a changeable default values (e.g. a parameter that indicates the name of a log file, or a flag that tells if the source file must be deleted after a copy)
- Sub-commands: are commands nested in the current one. Invoking a sub-command is equivalent to invoke another independent command with the simple difference that its first level name is the current one.
- Documentation option: is the optional flag that shows the documentation of the command. The documentation option can have more than one alias. An alias for the documentation option is a simple name string that can be typed by the user as first argument of the command to show its documentation.
Usage String
The usage string show how to use the command. For example: given a class my.example.Main with a main() method that implements the command, the usage string is an information for the user that tells how to run the program, showing that the user must run the java command, followed by a class-path and by the canonical name of the class that contains the main method. In this case the usage string can be java -cp MyExample/classes my.example.Main
If the program is designed to run from a jar file, the usage string can specify to run the program as
java -jar myjarfile.jar
Alternatively, the usage string can be an empty string, so that documentation shows only the expected arguments.
If the command is implemented in a CLI, the usage string can be just equal to the name of the command.
The usage string can be an empty string.
Required Arguments
All the required arguments must be typed just as first arguments for the command, in the same order they are specified during command construction and in the documentation.Options
For details about the options seeOption
.
Sub-commands
A sub-command is just a command that can be used by typing its name after the name of the current one. The sub-command will have its own required arguments, options, sub-commands and documentation option.Documentation option
As said above, the documentation option can have one or more aliases, to be typed by the final user of the software. If the developer does not indicate a documentation option alias during the command construction, the command will not have documentation option available. The developer should always indicate one or more documentation option aliases using theCommand.Builder.addDocumentationAlias(String)
method or
Command.Builder.addDocumentationAliases(String...)
method.- Author:
- Salvatore Giampa'
- See Also:
- Serialized Form
-
Nested Class Summary
Nested Classes Modifier and Type Class Description static class
Command.Builder
Class used to build a newcommand
.static class
Command.ExitCause
Specify the cause of the exit from command execution. -
Method Summary
Modifier and Type Method Description static Command.Builder
create(java.lang.String usageString, java.lang.String description, java.lang.String... docAliases)
Creates a new command with the given name, description, usage string and documentation option aliases.
SeeCommand
for more details about usage strings.static Command.Builder
defaultDocs(java.lang.String usageString, java.lang.String description)
Creates a new command with the given name, description, usage string and with the default documentation option aliases, that are '?'Command.ExitCause
execute(java.lang.String arguments)
Executes the command on a list of arguments encoded as a string command-line, asexecute(String, PrintStream, InputStream)
, and uses the standard in/output to interact with the user.Command.ExitCause
execute(java.lang.String[] args)
Executes the command on an array of arguments already tokenized, using the standardI
/O
to interact with the user.Command.ExitCause
execute(java.lang.String[] args, java.io.PrintStream output, java.io.InputStream input)
Executes the command on an array of arguments already tokenized.Command.ExitCause
execute(java.lang.String arguments, java.io.PrintStream output, java.io.InputStream input)
Executes the command on a list of arguments encoded as a string command-line.
This method automatically splits the command-line taking care of single quote ('), double quote (") and escaped characters, as a UNIX-like operative system does, then it passes the result list of arguments to theexecute(List, PrintStream, InputStream)
method
Single quotes (') and double quotes (") characters can be escaped preceding them with a backslash (\) character: \", \'.
The backslash (\) character can be escaped itself in the same way: \\.
Note that: the first token of the passed command-line is parsed as an argument of the command and not as the name of the command itself.Command.ExitCause
execute(java.util.List<java.lang.String> arguments)
Executes the command on a list of arguments already tokenized, using the standardI
/O
to interact with the user.
For more details, please refer toexecute(List, PrintStream, InputStream)
;Command.ExitCause
execute(java.util.List<java.lang.String> arguments, java.io.PrintStream output, java.io.InputStream input)
Executes the command on a list of arguments already tokenized.
Note that: the first token is parsed as an argument of the command and not as the name of the command itself.java.lang.String
getDescription()
Gets the command description.java.util.Set<java.lang.String>
getDocumentationAliases()
java.util.Map<java.lang.String,Option>
getOptions()
Gets a map of all the options of this command.java.util.List<readycli.RequiredArgument>
getRequiredArguments()
Gets the list of all the required arguments of this command.java.util.Map<java.lang.String,Command>
getSubCommands()
Gets a map of all the sub-commands of first level of this command.
-
Method Details
-
create
public static Command.Builder create(java.lang.String usageString, java.lang.String description, java.lang.String... docAliases)Creates a new command with the given name, description, usage string and documentation option aliases.
SeeCommand
for more details about usage strings.- Parameters:
usageString
- the string that specify how to run the commanddescription
- the human-readable description of the commanddocAliases
- the aliases for the documentation option- Returns:
- a new
Command.Builder
- See Also:
Command
,defaultDocs(String, String)
-
defaultDocs
public static Command.Builder defaultDocs(java.lang.String usageString, java.lang.String description)Creates a new command with the given name, description, usage string and with the default documentation option aliases, that are '?', '-h' and '--help'.
SeeCommand
for more details about usage strings.- Parameters:
usageString
- the string that specify how to run the commanddescription
- the human-readable description of the command- Returns:
- a new
Command.Builder
- See Also:
Command
-
getDescription
public java.lang.String getDescription()Gets the command description.- Returns:
- the description as string.
-
getRequiredArguments
public java.util.List<readycli.RequiredArgument> getRequiredArguments()Gets the list of all the required arguments of this command.- Returns:
- an unmodifiable list.
-
getOptions
Gets a map of all the options of this command.- Returns:
- an unmodifiable map that associates the names of the options (keys) to the options themselves (values).
-
getSubCommands
Gets a map of all the sub-commands of first level of this command.- Returns:
- an unmodifiable map that associates the names of the sub-commands (keys) to the sub-commands themselves (values).
-
getDocumentationAliases
public java.util.Set<java.lang.String> getDocumentationAliases() -
execute
Executes the command on a list of arguments encoded as a string command-line, asexecute(String, PrintStream, InputStream)
, and uses the standard in/output to interact with the user.- Parameters:
arguments
- the command-line arguments for this command as a full string- Returns:
- the
exit cause
- See Also:
execute(String, PrintStream, InputStream)
-
execute
public Command.ExitCause execute(java.lang.String arguments, java.io.PrintStream output, java.io.InputStream input)Executes the command on a list of arguments encoded as a string command-line.
This method automatically splits the command-line taking care of single quote ('), double quote (") and escaped characters, as a UNIX-like operative system does, then it passes the result list of arguments to theexecute(List, PrintStream, InputStream)
method
Single quotes (') and double quotes (") characters can be escaped preceding them with a backslash (\) character: \", \'.
The backslash (\) character can be escaped itself in the same way: \\.
Note that: the first token of the passed command-line is parsed as an argument of the command and not as the name of the command itself. If the command-line comprises the name of this command, the caller should separate the name of this command from its arguments before invoking this method.- Parameters:
arguments
- the command-line arguments for this command as a full stringoutput
- the output stream to write messages for the user to.input
- the input stream used to read the user input.- Returns:
- the
exit cause
-
execute
Executes the command on an array of arguments already tokenized, using the standardI
/O
to interact with the user. This method is useful to be invoked on the arguments received by themain()
method.
For more details, please refer toexecute(List, PrintStream, InputStream)
;- Parameters:
args
- the command-line arguments for this command as an array of strings- Returns:
- the
exit cause
-
execute
public Command.ExitCause execute(java.lang.String[] args, java.io.PrintStream output, java.io.InputStream input)Executes the command on an array of arguments already tokenized. This method is useful to be invoked on the arguments received by themain()
method.
For more details, please refer toexecute(List, PrintStream, InputStream)
;- Parameters:
args
- the command-line arguments for this command as an array of stringsoutput
- the output stream to write messages for the user to.input
- the in stream used to read the user in.- Returns:
- the
exit cause
-
execute
Executes the command on a list of arguments already tokenized, using the standardI
/O
to interact with the user.
For more details, please refer toexecute(List, PrintStream, InputStream)
;- Parameters:
arguments
- the list of arguments- Returns:
- the
exit cause
- See Also:
execute(List, PrintStream, InputStream)
-
execute
public Command.ExitCause execute(java.util.List<java.lang.String> arguments, java.io.PrintStream output, java.io.InputStream input)Executes the command on a list of arguments already tokenized.
Note that: the first token is parsed as an argument of the command and not as the name of the command itself. The caller should separate the name of this command from its arguments before invoking this method.- Parameters:
arguments
- the command-line arguments already for this command as a list of stringsoutput
- the output stream to write messages for the user to.input
- the in stream used to read the user in.- Returns:
- the
exit cause
-


4 December 2007
The Ministry of Health in China has reported a new case of human infection with the H5N1 avian influenza virus. The case was confirmed by the national laboratory on 2 December.
The 24-year old male from Jiangsu Province, developed symptoms on 24 November, was hospitalized on 27 November and died on 2 December. There is no initial indication to suggest he had contact with sick birds prior to becoming unwell. Close contacts have been placed under medical observation and all remain well.
Of the 26 cases confirmed to date in China, 17 have been fatal.


An intelligent device that writes in your personal handwriting style, or one from library of others, using your favourite pencil or pen.
Make your mark
Have you ever needed to write out a poster in pencil, but your handwriting is sloppy?
Do your relatives prefer hand written letters, but you don't have the time to write them?
Left your hand written essay till the last night? Unable to write due to an injury or disability?
We have a solution for you.


Team Members
Team Members #1 / 3 Columns
Sara smith
Founder And ceo
Sommer Christian
creative studio head
Jane lupkin
magento developer
Team Members #1 / 4 Columns
Sara smith
Founder And ceo
Sommer Christian
creative studio head
Jane lupkin
magento developer
Jane lupkin
magento developer
Team Members #2 / 3 Columns
Team Members #2 / 4 Columns


Peter Rotomore_vert
WonderTEAM's Managerclose
Peter Roto
Role:
ManagerID:
1Email Address:
<EMAIL_ADDRESS>Number:
8478757196
Gracie Rotomore_vert
WonderTEAM's Internclose
Gracie Roto
Role:
InternID:
2Email Address:
<EMAIL_ADDRESS>Northwestern University
Pete Rotomore_vert
WonderTEAM : Engineerclose
Pete Roto
Role:
EngineerID:
3Email Address:
<EMAIL_ADDRESS>Proto133


One Of Future's Paternity Cases On Hold Because Rapper Can't Be Served
by AllHipHop StaffA woman who claims she gave birth to Future's child claims she cannot find the rapper to serve him with court papers to prove if he's the kid's father or not.
(AllHipHop News) One of the paternity suits filed against Future has been put on hold because the rapper has yet to be served with the legal notice.
However, process servers have been unable to track the hip-hop star down, leaving her case at a standstill.
According to The Blast, a hearing originally scheduled for Thursday was canceled, and now Parker is requesting permission to have Future served in another way in a bid to keep her suit alive.
The judge overseeing the case has yet to rule.
Parker is seeking to establish paternity of her boy, to whom she has given Future's last name, and is also pursuing official child support and custody deals.
Future maintains he only has five baby mamas, including former fiancee Ciara, the mother of his five-year-old son Future Zahir.


Loads and displays images, selectively masks specified background colors, bins pixels by color using either data-dependent or automatically generated color bins, quantitatively measures color similarity among images using one of several distance metrics for comparing pixel color clusters, and clusters images by object color similarity. Uses CIELAB, RGB, or HSV color spaces. Originally written for use with organism coloration (reef fish color diversity, butterfly mimicry, etc), but easily applicable for any image set.
| Version: | 1.0.0 |
| Depends: | R (≥ 3.4.0) |
| Imports: | jpeg, png, stats, clue, spatstat, ape, mgcv, emdist, scatterplot3d, plotly, gplots, abind, magrittr |
| Suggests: | knitr, rmarkdown, testthat |
| Published: | 2018-06-27 |
| Author: | Hannah Weller [aut, cre] |
| Maintainer: | Hannah Weller <hannahiweller at gmail.com> |
| License: | GPL-3 |
| NeedsCompilation: | no |
| Materials: | README NEWS |
| CRAN checks: | colordistance results |
| Reference manual: | colordistance.pdf |
| Vignettes: |
Pixel Binning Methods Color Distance Metrics Color Spaces Introduction CIELab Analyses |
| Package source: | colordistance_1.0.0.tar.gz |
| Windows binaries: | r-devel: colordistance_1.0.0.zip, r-release: colordistance_1.0.0.zip, r-oldrel: colordistance_1.0.0.zip |
| OS X binaries: | r-release: colordistance_1.0.0.tgz, r-oldrel: colordistance_1.0.0.tgz |
| Old sources: | colordistance archive |
| Reverse imports: | countcolors |
Please use the canonical form https://CRAN.R-project.org/package=colordistance to link to this page.


Your email address:
Your email becomes your user name on www.rescuetime.com. This allows you to reach your account from anywhere, and to link any other device to the same account.
Leave this checked if you're already running the full version of RescueTime on this computer.
If you have the full version of RescueTime installed on this computer and this box is not checked, then your time spent in this browser will be logged twice.
Usage patterns can vary widely between weekdays and weekends. Check this box to include weekends in the daily average calculations.
Remove account info from this browser and prevent logging activity?
[cancel]for: or
Pausing RescueTime will stop it from logging your activity for the duration that you specify.
RescueTime Help
The rest of help is here.
Loading...


|
GPGPU-Sim
|
Go to the source code of this file.
Functions | |
| void | qtree_nca (const Router *r, const Flit *f, int in_channel, OutputSet *outputs, bool inject) |
| void | tree4_anca (const Router *r, const Flit *f, int in_channel, OutputSet *outputs, bool inject) |
| void | tree4_nca (const Router *r, const Flit *f, int in_channel, OutputSet *outputs, bool inject) |
| void | fattree_nca (const Router *r, const Flit *f, int in_channel, OutputSet *outputs, bool inject) |
| void | fattree_anca (const Router *r, const Flit *f, int in_channel, OutputSet *outputs, bool inject) |
| int | dor_next_mesh (int cur, int dest, bool descending=false) |
| void | adaptive_xy_yx_mesh (const Router *r, const Flit *f, int in_channel, OutputSet *outputs, bool inject) |
| void | xy_yx_mesh (const Router *r, const Flit *f, int in_channel, OutputSet *outputs, bool inject) |
| void | dor_next_torus (int cur, int dest, int in_port, int *out_port, int *partition, bool balance=false) |
| void | dim_order_mesh (const Router *r, const Flit *f, int in_channel, OutputSet *outputs, bool inject) |
| void | dim_order_ni_mesh (const Router *r, const Flit *f, int in_channel, OutputSet *outputs, bool inject) |
| void | dim_order_pni_mesh (const Router *r, const Flit *f, int in_channel, OutputSet *outputs, bool inject) |
| int | rand_min_intr_mesh (int src, int dest) |
| void | romm_mesh (const Router *r, const Flit *f, int in_channel, OutputSet *outputs, bool inject) |
| void | romm_ni_mesh (const Router *r, const Flit *f, int in_channel, OutputSet *outputs, bool inject) |
| void | min_adapt_mesh (const Router *r, const Flit *f, int in_channel, OutputSet *outputs, bool inject) |
| void | planar_adapt_mesh (const Router *r, const Flit *f, int in_channel, OutputSet *outputs, bool inject) |
| void | valiant_mesh (const Router *r, const Flit *f, int in_channel, OutputSet *outputs, bool inject) |
| void | valiant_torus (const Router *r, const Flit *f, int in_channel, OutputSet *outputs, bool inject) |
| void | valiant_ni_torus (const Router *r, const Flit *f, int in_channel, OutputSet *outputs, bool inject) |
| void | dim_order_torus (const Router *r, const Flit *f, int in_channel, OutputSet *outputs, bool inject) |
| void | dim_order_ni_torus (const Router *r, const Flit *f, int in_channel, OutputSet *outputs, bool inject) |
| void | dim_order_bal_torus (const Router *r, const Flit *f, int in_channel, OutputSet *outputs, bool inject) |
| void | min_adapt_torus (const Router *r, const Flit *f, int in_channel, OutputSet *outputs, bool inject) |
| void | dest_tag_fly (const Router *r, const Flit *f, int in_channel, OutputSet *outputs, bool inject) |
| void | chaos_torus (const Router *r, const Flit *f, int in_channel, OutputSet *outputs, bool inject) |
| void | chaos_mesh (const Router *r, const Flit *f, int in_channel, OutputSet *outputs, bool inject) |
| void | InitializeRoutingMap (const Configuration &config) |
| void adaptive_xy_yx_mesh | ( | const Router * | r, |
| const Flit * | f, | ||
| int | in_channel, | ||
| OutputSet * | outputs, | ||
| bool | inject | ||
| ) |
Definition at line 404 of file routefunc.cpp.
| void chaos_mesh | ( | const Router * | r, |
| const Flit * | f, | ||
| int | in_channel, | ||
| OutputSet * | outputs, | ||
| bool | inject | ||
| ) |
Definition at line 1884 of file routefunc.cpp.
| void chaos_torus | ( | const Router * | r, |
| const Flit * | f, | ||
| int | in_channel, | ||
| OutputSet * | outputs, | ||
| bool | inject | ||
| ) |
Definition at line 1845 of file routefunc.cpp.
| void dest_tag_fly | ( | const Router * | r, |
| const Flit * | f, | ||
| int | in_channel, | ||
| OutputSet * | outputs, | ||
| bool | inject | ||
| ) |
Definition at line 1798 of file routefunc.cpp.
| void dim_order_bal_torus | ( | const Router * | r, |
| const Flit * | f, | ||
| int | in_channel, | ||
| OutputSet * | outputs, | ||
| bool | inject | ||
| ) |
Definition at line 1650 of file routefunc.cpp.
| void dim_order_mesh | ( | const Router * | r, |
| const Flit * | f, | ||
| int | in_channel, | ||
| OutputSet * | outputs, | ||
| bool | inject | ||
| ) |
Definition at line 643 of file routefunc.cpp.
| void dim_order_ni_mesh | ( | const Router * | r, |
| const Flit * | f, | ||
| int | in_channel, | ||
| OutputSet * | outputs, | ||
| bool | inject | ||
| ) |
Definition at line 682 of file routefunc.cpp.
| void dim_order_ni_torus | ( | const Router * | r, |
| const Flit * | f, | ||
| int | in_channel, | ||
| OutputSet * | outputs, | ||
| bool | inject | ||
| ) |
Definition at line 1585 of file routefunc.cpp.
| void dim_order_pni_mesh | ( | const Router * | r, |
| const Flit * | f, | ||
| int | in_channel, | ||
| OutputSet * | outputs, | ||
| bool | inject | ||
| ) |
Definition at line 732 of file routefunc.cpp.
| void dim_order_torus | ( | const Router * | r, |
| const Flit * | f, | ||
| int | in_channel, | ||
| OutputSet * | outputs, | ||
| bool | inject | ||
| ) |
Definition at line 1517 of file routefunc.cpp.
Definition at line 540 of file routefunc.cpp.
| void dor_next_torus | ( | int | cur, |
| int | dest, | ||
| int | in_port, | ||
| int * | out_port, | ||
| int * | partition, | ||
| bool | balance = false |
||
| ) |
Definition at line 573 of file routefunc.cpp.
| void fattree_anca | ( | const Router * | r, |
| const Flit * | f, | ||
| int | in_channel, | ||
| OutputSet * | outputs, | ||
| bool | inject | ||
| ) |
Definition at line 323 of file routefunc.cpp.
| void fattree_nca | ( | const Router * | r, |
| const Flit * | f, | ||
| int | in_channel, | ||
| OutputSet * | outputs, | ||
| bool | inject | ||
| ) |
Definition at line 259 of file routefunc.cpp.
| void InitializeRoutingMap | ( | const Configuration & | config | ) |
Definition at line 1917 of file routefunc.cpp.
| void min_adapt_mesh | ( | const Router * | r, |
| const Flit * | f, | ||
| int | in_channel, | ||
| OutputSet * | outputs, | ||
| bool | inject | ||
| ) |
Definition at line 932 of file routefunc.cpp.
| void min_adapt_torus | ( | const Router * | r, |
| const Flit * | f, | ||
| int | in_channel, | ||
| OutputSet * | outputs, | ||
| bool | inject | ||
| ) |
Definition at line 1718 of file routefunc.cpp.
| void planar_adapt_mesh | ( | const Router * | r, |
| const Flit * | f, | ||
| int | in_channel, | ||
| OutputSet * | outputs, | ||
| bool | inject | ||
| ) |
Definition at line 1032 of file routefunc.cpp.
| void qtree_nca | ( | const Router * | r, |
| const Flit * | f, | ||
| int | in_channel, | ||
| OutputSet * | outputs, | ||
| bool | inject | ||
| ) |
Definition at line 75 of file routefunc.cpp.
Definition at line 789 of file routefunc.cpp.
| void romm_mesh | ( | const Router * | r, |
| const Flit * | f, | ||
| int | in_channel, | ||
| OutputSet * | outputs, | ||
| bool | inject | ||
| ) |
Definition at line 814 of file routefunc.cpp.
| void romm_ni_mesh | ( | const Router * | r, |
| const Flit * | f, | ||
| int | in_channel, | ||
| OutputSet * | outputs, | ||
| bool | inject | ||
| ) |
Definition at line 875 of file routefunc.cpp.
| void tree4_anca | ( | const Router * | r, |
| const Flit * | f, | ||
| int | in_channel, | ||
| OutputSet * | outputs, | ||
| bool | inject | ||
| ) |
Definition at line 126 of file routefunc.cpp.
| void tree4_nca | ( | const Router * | r, |
| const Flit * | f, | ||
| int | in_channel, | ||
| OutputSet * | outputs, | ||
| bool | inject | ||
| ) |
Definition at line 196 of file routefunc.cpp.
| void valiant_mesh | ( | const Router * | r, |
| const Flit * | f, | ||
| int | in_channel, | ||
| OutputSet * | outputs, | ||
| bool | inject | ||
| ) |
Definition at line 1276 of file routefunc.cpp.
| void valiant_ni_torus | ( | const Router * | r, |
| const Flit * | f, | ||
| int | in_channel, | ||
| OutputSet * | outputs, | ||
| bool | inject | ||
| ) |
Definition at line 1415 of file routefunc.cpp.
| void valiant_torus | ( | const Router * | r, |
| const Flit * | f, | ||
| int | in_channel, | ||
| OutputSet * | outputs, | ||
| bool | inject | ||
| ) |
Definition at line 1337 of file routefunc.cpp.
| void xy_yx_mesh | ( | const Router * | r, |
| const Flit * | f, | ||
| int | in_channel, | ||
| OutputSet * | outputs, | ||
| bool | inject | ||
| ) |
Definition at line 476 of file routefunc.cpp.
| int gNumVCs |
Definition at line 59 of file routefunc.cpp.
| int gReadReplyBeginVC |
Definition at line 69 of file routefunc.cpp.
| int gReadReplyEndVC |
Definition at line 69 of file routefunc.cpp.
| int gReadReqBeginVC |
Definition at line 67 of file routefunc.cpp.
| int gReadReqEndVC |
Definition at line 67 of file routefunc.cpp.
| map<string, tRoutingFunction> gRoutingFunctionMap |
Definition at line 55 of file routefunc.cpp.
| int gWriteReplyBeginVC |
Definition at line 70 of file routefunc.cpp.
| int gWriteReplyEndVC |
Definition at line 70 of file routefunc.cpp.
| int gWriteReqBeginVC |
Definition at line 68 of file routefunc.cpp.
| int gWriteReqEndVC |
Definition at line 68 of file routefunc.cpp.


|
|
2018
-
Muresan Horea, Oltean Mihai, Fruit recognition from images using deep learning, Acta Univ. Sapientiae, Informatica Vol. 10, Issue 1, pp. 26-42, 2018. Data can be downloaded from Kaggle or Github.
2017
-
Oltean Mihai, An optical solution for the set splitting problem, Acta Univ. Sapientiae, Informatica Vol. 9, Issue 2, pp. 134-143, 2017.
2010
-
Oltean Mihai, Muntean Oana, An Optical Solution for the SAT Problem, Third International Workshop, OSC 2010, Bertinoro, Italy, November 17-19, 2010, Revised Selected Papers, LNCS 6748, pp 53-62, Springer-Verlag, 2010 [website].
-
L. Stirb, Zs. Marian, Oltean Mihai, An Autonomous Approach to Wheel Changing Problem, Studia Universitatis Babes-Bolyai
Series Informatica, Vol. LV, Issue 1, pp. 41-50, 2010 [Youtube movie].
2009
-
Oltean Mihai, Muntean Oana, Solving the subset sum problem with a light-based computer, Natural Computing, Springer-Verlag, Vol 8, Issue 2, pp. 321-331, 2009
[website].
-
Oltean Mihai, Light-based string matching, Natural Computing, Springer-Verlag, Vol 8. Issue 1, pp. 121-132, 2009.
-
Muntean Oana, Oltean Mihai, Optical solutions for the unbounded subset-sum problem, International Journal of Innovative Computing, Information and Control, Vol. 5, Issue 8, 2159-2167, 2009 [website].
-
Muntean Oana, Oltean Mihai, Optical solutions for linear Diophantine equations, Journal of Optoelectronics and Advanced Materials, Vol. 11, Issue 11, pp. 1728-1734, 2009 [website].
-
Oltean Mihai, Muntean Oana, Evolutionary design of graph-based structures for optical computing, in proceedings of the second workshop on Optical SuperComputing, OSC 2009, LNCS 5882, pp. 56-69, Springer-Verlag, 2009 [website].
-
Oltean Mihai, Diosan Laura,
An autonomous GP-based system for regression and classification
problems
Applied Soft Computing, Vol. 9, Issue 1, pp. 49-60, 2009
-
Diosan Laura, Oltean Mihai,
Evolutionary design of Evolutionary Algorithms
Genetic Programming and Evolvable Machines, Springer, Vol 10, Issue
3, pp. 263-306, 2009
-
Oltean Mihai, Grosan Crina, Diosan Laura, Mihaila Cristina,
Genetic Programming with linear representation: a survey,
International Journal on Artificial Intelligence Tools, World
Scientific, Vol. 19, Issue 2, pp. 197-238, 2009.
-
Oltean Mihai, Unconventional Computing: A Short Introduction, Studia Universitatis Babes-Bolyai
Series Informatica, Vol. LIV, Issue 1, pp. 85-96, 2009.
2008
-
Oltean Mihai, Solving the Hamiltonian path problem with a light-based computer, Natural Computing, Springer-Verlag, Vol 6, Issue 1, pp. 57-70, 2008
[website]
-
Oltean Mihai,
Muntean Oana,
Exact Cover with Light, New Generation Computing,
Springer-Verlag, Vol. 26, Issue 4, pp. 327-344, 2008
[website]
-
Oltean Mihai, Muntean Oana, Solving
NP-Complete Problems with Delayed Signals: An Overview of Current
Research Directions, in proceedings of 1st international
workshop on Optical SuperComputing, LNCS 5172, pp. 115-128,
Springer-Verlag, 2008 [website]
-
Diosan Laura, Oltean Mihai, What Else Is the Evolution of PSO Telling Us?, Journal of Artificial Evolution and Applications
Volume 2008, Article ID 289564, 12 pages, Hindawi Publishing Corporation, 2008.
-
Mihai Oltean, Laura Diosan, An Adaptive GP Strategy for Evolving Digital Circuits, 12th International Conference, KES 2008, Knowledge-Based Intelligent Information and Engineering Systems, Vol. 5179 LNCS pp. 376-383, 2008
2007
-
Muntean Oana, Oltean Mihai, Processing Bank Checks with Genetic
Programming and Histograms, Bio-inspired, Learning, and
Intelligent Systems for Security, BLISS 2007, pp. 102-105, IEEE
Press, 2007.
-
Dioşan, L.,
Oltean, Mihai,
Who's better? PESA or NSGA II?,
The
International Conference on Intelligent Systems Design and
Applications, Workshop on Evolutionary Multiobjective Optimization:
Design and Applications, Brazil, October 22th - 24th, pp.
869-874, IEEE CS Press, 2007.
-
Muntean O., Dioşan, L., Oltean Mihai,
Solving the even-n-parity problems using Best Sub Tree Genetic
Programming Adaptive Hardware Systems 2007, pp. 511-518, IEEE Press, 2007.
-
Muntean Oana, Dioşan, Laura, Oltean Mihai,
Best SubTree Genetic Programming,
GECCO 2007, pp. 1667 - 1673, ACM Press, 2007.
-
Dioşan Laura, Oltean Mihai,
A. Rogozan, J. P. Pecuchet,
Genetically Designed Multiple-Kernels for Improving the SVM
Performance, GECCO 2007, pp. 1873,
2007.
-
Dioşan, L., Oltean Mihai,
Evolving Evolutionary Algorithms using Evolutionary Algorithms,
GECCO 2007, 2442-2449, ACM Press, 2007.
-
Dioşan, L., Oltean Mihai,
Observing the swarm behavior during its evolutionary design,
GECCO 2007, 2667-2674, ACM Press, 2007.
-
Oltean Mihai, Evolving
Evolutionary Algorithms with Patterns, Soft Computing,
Springer-Verlag, Vol. 11, Issue 6, pp. 503-518, 2007.
-
Oltean Mihai, Grosan C.,
Using Traceless Genetic
Programming for Solving Multiobjective Optimization Problems,
Journal of Experimental and Theoretical Artificial Intelligence,
Taylor & Francis, Vol. 19, pp. 227-248, 2007.
-
Diosan L., Oltean Mihai,
Evolving the Update
Strategy of the Particle Swarm Optimisation Algorithms,
International Journal on Artificial Intelligent Tools, Vol. 16,
Issue 1, pp. 87-110, World-Scientific, 2007.
-
Oltean Mihai, Liquid State Genetic
Programming, International
Conference on Adaptive and Natural Computing Algorithms, Warsaw,
Poland, ICANNGA 2007, B.
Beliczynski et al. (Eds.), Part I, LNCS 4431, Springer-Verlag, pp.
220-229, 2007.
(best paper award)
-
Oltean Mihai, A-Brain: a general system for solving data analysis problems, Journal of Experimental and Theoretical Artificial Intelligence, Taylor & Francis, Vol. 19, pp. pages 333-353, 2007.
-
Diosan L,
Oltean Mihai, (et al.), Improving SVM Performance using a
Linear Combination of Kernels, International Conference on Adaptive and
Natural Computing Algorithms, ICANNGA 2007, B. Beliczynski et al.
(Eds.), Part II, LNCS 4432, Springer-Verlag, pp. 218-227, 2007.
2006
-
Oltean Mihai,
A light-based device for solving the
Hamiltonian path problem, Unconventional Computing,
Calude C. (et al.)(Eds), LNCS 4135, pp. 217-227, Springer-Verlag, 2006,
[ppt], [html].
-
Oltean Mihai, Switchable Glass: A possible medium for Evolvable Hardware,
NASA conference on Adaptive Hardware Systems, Stoica A., et al. (Eds), pp 81-87, IEEE CS
Press, 2006.
-
Dioşan, L., Oltean, Mihai,
Evolving crossover operators for function
optimization, European Conference on Genetic Programming,
LNCS, Springer-Verlag, pp. 97-108, 2006 (best
paper nominee).
-
Dioşan, L., Oltean Mihai,
Evolving the structure of the Particle Swarm
Optimization algorithms, European
Conference on Evolutionary Computation in Combinatorial Optimization, LNCS, Springer-Verlag, pp. 25-36, 2006.
-
Oltean Mihai, A-Brain: the multiple problems solver, SAC 2006, pp. 955-959, ACM Press, 2006.
2005
-
Oltean Mihai, Evolving Evolutionary Algorithms using Linear Genetic Programming, Evolutionary Computation, MIT Press, Vol. 13, Issue 3, pp. 387-410, 2005.
-
Grosan C., Oltean Mihai, Adaptive Representation for Single Objective Optimization, Soft Computing, Springer-Verlag, 9(8): 594-605, 2005.
-
Oltean Mihai,
Evolving reversible circuits for the even-parity problem, EvoHOT workshop, Lausanne, Switzerland, Applications of Evolutionary Computing,
Rothlauf, F.; Branke, J.; Cagnoni, S.; Corne, D.W.; Drechsler, R.; Jin, Y.; Machado, P.; Marchiori, E.;
Romero, J.; Smith, G.D.; Squillero, G. (Eds.) LNCS 3449, pp. 225-234, Springer-Verlag,
Berlin, 2005.
-
Dumitrescu D., Grosan C., Oltean Mihai, Evolving Continuous Pareto Regions, Evolutionary Computation Based Multi-Criteria Optimization: Theoretical Advances and Applications, edited by A. Abraham, L. Jain and R. Goldberg, Springer-Verlag, London, pp. 167-199, 2005.
-
Oltean Mihai, Abraham Ajith, Grosan Crina, Koppen M, Multiobjective optimization using adaptive pareto archived evolution strategy, Proceedings - 5th International Conference on Intelligent Systems Design and Applications, ISDA '05, pp. 558-563, IEEE Computer Society Press, 2005.
2004
-
Oltean Mihai, A Practical
Evidence for the No Free Lunch Theorems, BioInspired Approaches to
Advanced Information Technology, BioADIT'04, Lausanne, Switzerland,
29-31 January, edited by A. Ijspeert (et al), pp. 382-388, 2004.
-
Oltean Mihai, Searching for a
Practical Evidence for the No Free Lunch Theorems, BioInspired
Approaches to Advanced Information Technology, BioADIT'04, Lausanne,
Switzerland, 29-31 January, edited by A. Ijspeert (et al), LNCS 3141,
pp. 472-483, Springer-Verlag, Berlin, 2004.
-
Oltean Mihai (et al.),
Evolving Digital Circuits for the Knapsack
Problem, International Conference on Computational Sciences,
E-HARD Workshop, 6-9 June, Krakow, Poland, Edited by M. Bubak, G. D. van Albada, P.Sloot, and J. Dongarra, Vol. III, pp. 1257-1264, Springer-Verlag, Berlin, 2004.
-
Oltean, M., Solving
Even-Parity Problems using Traceless Genetic Programming, IEEE
Congress on Evolutionary Computation, Portland, 19-23 June, edited by G.
Greenwood (et. al), pages 1813-1819, IEEE Press, 2004 [website, source code].
-
Oltean Mihai (et al.),
Encoding Multiple Solutions in a Linear GP
Chromosome, International Conference on Computational Sciences,
E-HARD Workshop, 6-9 June, Krakow, Poland, Edited by M. Bubak, G. D. van Albada, P.Sloot, and J. Dongarra, Vol III, pp. 1281-1288, Springer-Verlag, Berlin, 2004.
-
Oltean Mihai,
Evolving Winning
Strategies for Nim-like Games, World Computer Congress, Student
Forum, 26-29 August,
Toulouse,
France, edited by Mohamed Kaaniche, pp. 353-364, Kluwer Academic
Publisher, 2004.
-
Oltean Mihai, Solving
Classification Problems using Traceless Genetic Programming,
World Computer Congress, The Symposium on Professional Practice in AI,
26-29 August, Toulouse, France, edited by E. Mercier-Laurent, J.
Debenham, pp. 403-412, 2004 [website].
-
Oltean Mihai, Dumitrescu, D.,
Evolving TSP Heuristics using
Multi Expression Programming, International Conference on
Computational Sciences, ICCS'04, 6-9 June, Krakow, Poland, Edited by M. Bubak, G.van Albada,
P. Sloot, and J. Dongarra, Vol II,
pp. 670-673, Springer-Verlag, Berlin, 2004 [website, source code].
-
Oltean Mihai, Dumitrescu, D., A
Permutation based Approach for the 2-D Cutting Stock Problem, First
International Industrial Conference Bionik
2004, 22-23 April, Hanover, Germany, Edited by I. Boblan, and R. Bannasch,
pp. 73-80, 2004.
-
Oltean Mihai,
Improving the
Search by Encoding Multiple Solutions in a Chromosome, contributed
chapter, Evolutionary Machine Design, pages 85-110, Nova Science Publisher, New-York, edited by
Nadia Nedjah (et. al).
-
Oltean Mihai,
Improving Multi Expression Programming: an Ascending
Trail from Sea-level Even-3-parity Problem to Alpine Even-18-Parity
Problem, contributed
chapter, Evolvable Machines: Theory and Practice, edited by
Nadia Nedjah (et. al), pages 229-255, Springer-Verlag, Berlin, 2004 [website, source code].
-
Oltean Mihai, Grosan C., Evolving
Digital Circuits using Multi Expression Programming, NASA/DoD
Conference on Evolvable Hardware, 24-26 June, Seattle, Edited by R.
Zebulum, D. Gwaltney, G. Horbny, D. Keymeulen, J. Lohn, A. Stoica, pages 87-90, IEEE Press, NJ, 2004 [website, source code].
-
Grosan C., Oltean Mihai,
Improving the Performance of
Evolutionary Algorithms for the Multiobjective 0/1 Knapsack Problem
Using Epsilon-Dominance, International Conference on
Computational Sciences, ICCS'04, Edited by M. Bubak, G. D. van Albada,
P. Sloot, and J. Dongarra, Vol II,
pp. 674-677, 6-9 June, Krakow, Poland, 2004.
-
Oltean Mihai, Sas Laura, A Comparison of Genetic Programming and Statistical Methods for
Solving Prediction Problems, International Conference on Computers and Communications, ICCC, pp 310-314, 2004.
-
Oltean Mihai, New Evolutionary Computation Models and their Applications to Machine Learning, PhD thesis, Babes-Bolyai University, scientific adviser: prof. D. Dumitrescu, defended on December 2004.
2003
-
Oltean Mihai, Grosan C., A Comparison of Several Linear
Genetic Programming Techniques, Complex-Systems, Vol. 14, Nr. 4,
pp. 285-313, 2003 [website, source code]
-
Oltean Mihai,
Evolving Evolutionary Algorithms for Function Optimization,
Proceedings of the 5th International Workshop on Frontiers in
Evolutionary Algorithms, The 7th Joint Conference on Information Sciences, September 26-30, 2003,
Research Triangle Park, North Carolina, Edited by Ken Chen (et. al),
pp. 295-298, 2003.
-
Oltean Mihai,
Solving Even-Parity Problems using Multi Expression
Programming, Proceedings of the 5th International Workshop on
Frontiers in Evolutionary Algorithms, The 7th Joint Conference on
Information Sciences, September 26-30, 2003, Research Triangle Park,
North Carolina, Edited by Ken Chen (et. al), pp. 315-318, 2003.
-
Oltean Mihai, Grosan C.,
Evolving Evolutionary Algorithms using Multi
Expression Programming, The 7th
European Conference on Artificial Life, September 14-17, 2003,
Dortmund, Edited by W. Banzhaf (et al),
LNAI 2801, pp.
651-658, Springer-Verlag, Berlin, 2003.source code
-
Oltean Mihai, Grosan C.,
Solving Classification Problems using Infix Form
Genetic Programming, The 5th International Symposium on Intelligent
Data Analysis, August 28-30, 2003, Berlin, Edited by M. Berthold (et al),
LNCS 2810, pp. 242-252, Springer-Verlag, Berlin, 2003.
-
Grosan C., Oltean Mihai, Adaptive Representation for Single Objective
Optimization, First Balkan Conference on Informatics, 17-20 November
2003, Thessalonica, Greece, edited by Y. Manoulopoulus (et al), pp.
345-355.
-
Grosan C., Oltean Mihai, Dumitrescu D., Performance metrics for multiobjective optimization evolutionary algorithms, 11th Conference on applied and industrial mathematics, CAIM, vol. 1, pp 132-135, 2003.
-
Grosan C., Oltean Mihai, Oltean Mihaela, An evolutionary approach to geometrical place problems, Acta Universitatis Apulensis. Mathematics - Informatics, vol. 5, pp. 71-82, 2003.
-
Grosan C., Oltean Mihai, Oltean Mihaela, The role of elitism in multiobjective optimization with evolutionary algorithms, Acta Universitatis Apulensis. Mathematics - Informatics, vol. 5, pp.82-90, 2003.
-
Grosan C., Oltean Mihai, Oltean Mihaela, A new evolutionary algorithm for the multiobjective 0/1 knapsack problem, Acta Universitatis Apulensis. Mathematics - Informatics, vol. 6, pp.233-237, 2003.
2002
-
Oltean Mihai, D. Dumitrescu, Multi Expression Programming, Technical report, UBB.
Books
-
Problems Solved in Pascal, Blue Publishing House, Cluj-Napoca, 150 pages, 1995 (in romanian).
-
Solving problems using Turbo Pascal,
Computer Libris Agora, Cluj-Napoca, 140 pages, 1996 (in romanian).
-
Mathematical games programming,
Blue Publishing House, 150 pages, 1996 (in romanian).
-
C++Builder in applications, Blue
Publishing House, Cluj-Napoca, 400 pages, 1998 (in romanian).
-
Advanced programming in Delphi,
Blue Publishing House, Cluj-Napoca, 350 pages, 1999 (in romanian).
-
Algorithms, Design and Implementation,
Computer Libris Agora, Cluj-Napoca, 300 pages, 2000 (in romanian).
-
Programming with C++Builder, Blue
Publishing House, Cluj-Napoca, 400 pages, 2001 (in romanian).
-
Delphi 7 in 200 Applications, Blue
Publishing House, Cluj-Napoca, 450 pages, 2004 (in romanian).
Papers 1998-2002
-
D. Dumitrescu, Crina Groşan and Mihai Oltean, A New Evolutionary Approach for Multiobjective
Optimization, Studia Universitas Babeş-Bolyai, Informatica, Volume
XLV, No. 1, pp. 51-68, 2000.
-
D. Dumitrescu, M. Oltean, An Evolutionary Algorithm for Theorem Proving in Propositional Logic,
Studia, seria Informatica, Vol
XLIV, Nr. 2, pp. 87-98, 1999. Babes-Bolyai
University, Cluj-Napoca,
-
D. Tatar, M. Oltean, DNA Theorem
Proving, Studia, 1999, seria Informatica, vol. XLIV,
no 2, pp. 62-71, Babes-Bolyai
University, Cluj-Napoca, 1999
-
D. Dumitrescu, M. Oltean, Theorem
proving using Resolution, Proceeding of the Joint Conference on
Mathematics and Computer Science, Oradea 2001,
-
D. Dumitrescu, C. Grosan, M. Oltean,
Genetic Chromodynamics for multimodal and multiobjective optimization,
Proceeding of the Joint Conference on Mathematics and Computer
Science, Oradea 2001,
-
M. Oltean, Prime numbers and
divisibility, Ginfo, Nr 2, Computer Libris Agora, Cluj-Napoca.1999,
(in romanian)
-
M. Oltean, Dynamic programming in
NP-Complete problems, Ginfo, Nr 2, Computer Libris Agora, Cluj-Napoca,
2000, (in romanian).
-
M. Oltean, Word97 macros, Ginfo, Nr 8,
Computer Libris Agora, Cluj-Napoca, 1999.
-
M. Oltean, Dirichletís box principles,
Ginfo, Nr 6, Computer Libris Agora, Cluj-Napoca, 1999, (in romanian)
-
M. Oltean, Games programming using
DirectX, Ginfo, Nr 3, Computer Libris Agora, Cluj-Napoca, 1999, (in
romanian)
-
M. Oltean, C. Grosan, Ordered
configurations, Ginfo, Nr 4, Computer Libris Agora, Cluj-Napoca, 2001,
(in romanian),
-
M. Oltean, Crina Groşan, Evolutionary
algorithms, Ginfo Nr 8, Computer Libris Agora, Cluj-Napoca, 2001 (in
romanian).
-
D. Dumitrescu, C. Grosan, M Oltean,
Simple Multiobjective Evolutionary Algorithm, Seminar on Computer
Science, Babes- Bolyai University, Cluj-Napoca, pp. 1-12, 2001,
-
D. Dumitrescu, Crina Grosan and Mihai
Oltean, Genetic Chromodynamics for Obtaining Continuous Representation
of Pareto Regions, Studia Universitas Babes--Bolyai, Informatica,
Volume XLVI, No. 1, pp. 15-30, 2001
-
M. Oltean, C. Groşan, Expressions
modeling by using evolutionary techniques, Ginfo Nr 2, Computer Libris
Agora, Cluj-Napoca, 2002,
-
D. Dumitrescu, Crina Groşan, Mihai
Oltean, A new evolutionary adaptive representation paradigm, Studia Universitas
Babes-Bolyai, Informatica,
Volume XLVI, No. 2, pp. 19-28, 2001 .
-
Oltean Mihai, Undergraduation thesis: Generarea automata a programelor de calculator, Babes-Bolyai University, scientific adviser: prof. M. Frentiu, defended on July 1999.
|


This component has been created inside the project. It uses the framework to open a simple dialog.
This component has been created inside the project. It uses the framework to open a page (with activation) inside a dialog.
This will open the same dialog as above using the dialoger opener. The advantage is that you don't have to handle the focus.
This component is hosted by Bower and uses a dialog component to pick an image.
This component has been created inside the project. It uses the framework to open a simple modal form that returns data upon clicking OK
This will open the same modal as above using the modaler opener. The advantage is that you don't have to handle the focus.
Opening a dialog inside a dialog will stack them.
An example dialog preventing navigation to occur (other than hard refreshing).
This demonstrate the use of Knockout binding handlers.
This demonstrate the use of Knockout async-click binding handler.


Tory Lanez Earns Highest Charting Debut Of His Career With 'Chixtape 5'
by Yohance Kyles (@HUEYmixwitRILEY)The "Jerry Sprunger" singer has the best-selling R&B project of the week.
(AllHipHop News) Tory Lanez scored his fourth consecutive Top 5 entry on the Billboard 200. Chixtape 5 collected 83,000 first-week units to open at #2 on the chart, the highest debut for the Interscope recording artist.
Lanez's previous three efforts put the Canadian among the five best selling acts for those specific weeks of release: I Told You at #4 in 2016, Memories Don’t Die at #3 in 2018, and Love Me Now? at #4 in 2018.
Post Malone’s Hollywood’s Bleeding (#3), YoungBoy Never Broke Again’s AI YoungBoy 2 (#6), Summer Walker’s Over It (#7), DaBaby’s Kirk (#8), and Kanye West’s Jesus Is King (#10) are also in the Top 10 this week.
Celine Dion captured the #1 spot with the Courage album. The music icon earned 113,000 equivalent album units. This is Dion's first chart-topper in 17 years.


{% extends "layout_bsa.html" %} {% block page_title %} Prepay for NHS prescriptions {% endblock %} {% block content %} {% include "includes/phase_banner_beta.html" %} Prepay for NHS prescriptions When do you want your prepayment to start? You can choose any date between 15 May and 15 July. How do you want to be contacted? Today Another date Day Month Year Mobile phone number Cancel {% endblock %}
Prepay for NHS prescriptions
You can choose any date between 15 May and 15 July.
Cancel


Cerner's Open Source Contributions for Interoperability Developers
Open source and open standards encourage collaboration around innovation that advances the health care industry through improved interoperability. Developers across health care can come together and use open source code to share information, as well as develop and continually improve apps to support better health outcomes for patients.
At Cerner, developing open platforms that support interoperability standards like SMART® and FHIR® is integral to our mission of transforming health care. In addition to implementing these standards in our platforms, we also participate in organizations like HL7 and the Argonaut Project to help shape and develop these standards. Cerner attends and speaks at conferences on interoperability like FHIR DevDays this week in Boston, MA.
In addition to all of this work, we’re continually developing open source projects and work for the benefit of all interoperability developers. As we speak on and support interoperability this week in Boston for FHIR DevDays, we thought it would be great to highlight our current open source interoperability work over the past couple of years.
SMART on FHIR Tutorial
A couple of years ago, Cerner developed a tutorial walking developers through the process of creating their first SMART on FHIR application. With this hands-on tutorial, developers can write and deploy their SMART on FHIR application, running it against Cerner’s code Console and our FHIR Sandbox. Because SMART applications are interoperable with other vendors, the tutorial also walks the developer through running that same app against other sandboxes like the one provided by the SMART Health IT project. Over 700 developers have completed this tutorial as of June, 2018.
You can find the source code for the tutorial at https://github.com/cerner/smart-on-fhir-tutorial
SMART on FHIR Apps in Embedded Browsers
Over the years, Cerner has contributed to several changes to the popular open source JavaScript library (fhir-client.js, maintained by the SMART Health IT organization), used by many SMART app developers for launching and interacting with the FHIR API from their web-based SMART application. Running these types of applications within an embedded IE browser in a Windows application (like Cerner’s PowerChart® EHR) requires a bit of added effort to ensure SMART apps running concurrently do not exhibit critical patient safety issues. Cerner released an open source library, used in conjunction with fhir-client.js, to prevent these issues from happening. Our open source library is in use by SMART app developers running their apps not only within Cerner EHR environments, but also within other EHR vendor environments.
You can find the source code for this project at https://github.com/cerner/fhir-client-cerner-additions
ASCVD Risk Calculator SMART Application
Through collaborative efforts, Cerner and Duke University Health System recognized a need for the development of a more clinically relevant cardiac risk calculator app. To solve for this, together we developed the open source ASCVD Risk Calculator SMART application. Not only is the app freely available to all Cerner clients, but all our work on the app is open source so that other hospitals and health systems can run and modify it to meet their needs.
You can find the ASCVD Risk Calculator source code at https://github.com/cerner/ascvd-risk-calculator
CDS Hooks
CDS Hooks is an emerging standard for interoperable clinical decision support. Similar to our SMART on FHIR tutorial, Cerner wrote an open source, hands-on tutorial that walks a developer through writing their first CDS Service.
Cerner is also the primary developer and maintainer of the CDS Hooks Sandbox, an open source Sandbox used by the CDS Hooks community. The CDS Hooks Sandbox has been proven to be incredibly valuable and helps developers test and demonstrate their CDS Services against any FHIR server of their choosing.
You can find the CDS Hooks Sandbox source code at https://github.com/cds-hooks/sandbox
Bunsen: FHIR and Big Data
Big data can have a great impact on health care when used correctly. Health care organizations are analyzing big data to improve health care in a number of ways, from increasing revenue and improving efficiency to predicting diseases and improving patient care. As technology advance, health care organizations will continue to gather more data and developers will need to find ways to make that data useful and actionable.
Cerner has many years of experience working with big data. To support big data developers, we made Bunsen open source. Bunsen is a project that makes it easy for developers to explore, transform and analyze FHIR data with Apache Spark. In addition, Cerner recently released a tutorial for getting started with Bunsen. You can read more about Bunsen on our blog post here.
You can view the Bunsen source code at https://github.com/cerner/bunsen


Base:
method
ConnectAsync
System.Management.Automation.Runspaces.Pipeline.ConnectAsync()
3 references to ConnectAsync
System.Management.Automation (3)
engine\remoting\client\Job.cs (1)
2848
_remotePipeline.
ConnectAsync
();
engine\remoting\commands\PushRunspaceCommand.cs (1)
1319
cmd.
ConnectAsync
();
engine\remoting\commands\ReceivePSSession.cs (1)
934
_remotePipeline.
ConnectAsync
();


Character Lookup
Resources
Back
go back to previous menu
Bnet API Docs
Item Stats Reference
URL References
Item Colors Reference


class Subdef extends AbstractEntity
Methods
| __construct(EntityManager $em) | from AbstractEntity | |
| string |
getName()
Get subdef name |
|
| setName($name) | ||
| integer |
getHeight()
Get subdef height |
|
| setHeight($height) | ||
| integer |
getWidth()
Get subdef width |
|
| setWidth($width) | ||
| integer |
getFileSize()
Get subdef file size |
|
| setFileSize($fileSize) | ||
| string |
getPlayerType()
Get the player type |
|
| setPlayerType($playerType) | ||
| string |
getMimeType()
Get subdef mime type |
|
| setMimeType($mimetype) | ||
| Permalink |
getPermalink()
Get the permalink related to the subdef |
|
| setPermalink(Permalink $permalink) |
Details
in AbstractEntity at line 21
final public
__construct(EntityManager $em)
at line 29
public string
getName()
Get subdef name
at line 34
public
setName($name)
at line 44
public integer
getHeight()
Get subdef height
at line 49
public
setHeight($height)
at line 59
public integer
getWidth()
Get subdef width
at line 64
public
setWidth($width)
at line 74
public integer
getFileSize()
Get subdef file size
at line 79
public
setFileSize($fileSize)
at line 89
public string
getPlayerType()
Get the player type
at line 94
public
setPlayerType($playerType)
at line 104
public string
getMimeType()
Get subdef mime type
at line 109
public
setMimeType($mimetype)
at line 119
public Permalink
getPermalink()
Get the permalink related to the subdef


Download This Plugin
Back To jQueryScript.Net
jQuery Text Counter Demos
Character Counter
Word Counter
Character Countdown


{{ contrib_direct_and_indirect_tax_html | safe }}
{{ contrib_direct_and_indirect_tax_script | safe }}
{{ annual_growth_direct_indirect_and_total_tax_html | safe }}
{{ annual_growth_direct_indirect_and_total_tax_script | safe }}
{{ tax_to_gdp_contrib_html | safe }}
{{ tax_to_gdp_contrib_script | safe }}
{{ gdp_per_capita_html | safe }}
{{ gdp_per_capita_script | safe }}
{{ gdp_growth_rate_html | safe }}
{{ gdp_growth_rate_script | safe }}
{{ various_taxes_to_revenue_html | safe }}
{{ various_taxes_to_revenue_script | safe }}
{{ various_taxes_to_total_tax_html | safe }}
{{ various_taxes_to_total_tax_script | safe }}
*Above data may not be correct, please refer other sites for data


| DOSE: |
2.5 lines |
insufflated |
Cocaine |
(powder / crystals) |
You know how when you're younger in gradeschool and even through to college you are bombarded by anti-drug programs. With little stuffed penguins telling you to 'B-Cool' and that drugs are bad. C'mon you know who ever thought up a talking, sunglass-wearing penguin was doped up. They introduce you to marijuana the 'gateway drug', evil cocaine and herion. And at that point in your life you're thinking that drugs are the direct path to eternal damnation.
And if you're anything like me there also comes that point in your life where you're tempted by some drug or another and you just shrug your shoulders and say 'sure... I'm curious, why not?'
I've smoked pot for years now and it's like second nature to light up.  But that about sums up my drug experience till the other night. I've seen people do coke before and the thought of it just never appealed to me.
Well there was a line just waiting for me and other people talking about how great it was... I figured if there was ever a time to do it, might as well do it when it's free and laying there.
I know this sounds pretty horrible... but it felt like one of the best decisions of my life. I snorted two lines and about a minute later I was in heaven. This girl handed me the card that they used for the lines and told me to lick it. What a taste. I don't think I'll ever forget it. Next thing I knew my mouth was numb and I was in heaven.
A few minutes later after getting every possible trace of the powder off the table I could someone lit up a blunt. The feeling of smoking was totally different than anything I've ever experienced before. It didn't feel as intense.
I drove this girl home while I was hyped up on it. It was nice to be 'fucked up' but still have a clear head. I think that was my favorite part about coke. After I got back there was another line waiting for me.
Coming down was insane. I was feeling beat and just ....tired.  Which disgusted me.  I don't ever want to crave something like that.... to sound desperate like you're begging.
But all in all... I'm not quite sure how I feel about coke. I am disgusted at myself to think that I love it. But deep down inside I know I do. I'd love to have another line right about now... and I just had a little drip in my nose. Sweet.
See, take a look at what I just wrote. Sick isn't it? How contradictory.
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.


sklearn.datasets
.make_regression¶
-
sklearn.datasets.
make_regression
(n_samples=100, n_features=100, n_informative=10, n_targets=1, bias=0.0, effective_rank=None, tail_strength=0.5, noise=0.0, shuffle=True, coef=False, random_state=None)[source]¶ Generate a random regression problem.
The input set can either be well conditioned (by default) or have a low rank-fat tail singular profile. See
make_low_rank_matrix
for more details.The output is generated by applying a (potentially biased) random linear regression model with
n_informative
nonzero regressors to the previously generated input and some gaussian centered noise with some adjustable scale.Read more in the User Guide.
- Parameters
- n_samplesint, optional (default=100)
The number of samples.
- n_featuresint, optional (default=100)
The number of features.
- n_informativeint, optional (default=10)
The number of informative features, i.e., the number of features used to build the linear model used to generate the output.
- n_targetsint, optional (default=1)
The number of regression targets, i.e., the dimension of the y output vector associated with a sample. By default, the output is a scalar.
- biasfloat, optional (default=0.0)
The bias term in the underlying linear model.
- effective_rankint or None, optional (default=None)
- if not None:
The approximate number of singular vectors required to explain most of the input data by linear combinations. Using this kind of singular spectrum in the input allows the generator to reproduce the correlations often observed in practice.
- if None:
The input set is well conditioned, centered and gaussian with unit variance.
- tail_strengthfloat between 0.0 and 1.0, optional (default=0.5)
The relative importance of the fat noisy tail of the singular values profile if
effective_rank
is not None.- noisefloat, optional (default=0.0)
The standard deviation of the gaussian noise applied to the output.
- shuffleboolean, optional (default=True)
Shuffle the samples and the features.
- coefboolean, optional (default=False)
If True, the coefficients of the underlying linear model are returned.
- random_stateint, RandomState instance or None (default)
Determines random number generation for dataset creation. Pass an int for reproducible output across multiple function calls. See Glossary.
- Returns
- Xarray of shape [n_samples, n_features]
The input samples.
- yarray of shape [n_samples] or [n_samples, n_targets]
The output values.
- coefarray of shape [n_features] or [n_features, n_targets], optional
The coefficient of the underlying linear model. It is returned only if coef is True.