public interface TupleModel
The terminology used here:
MaterializedField
,
but also adds allocation hints.
This abstraction is the physical dual of a VectorContainer
.
The vectors are "owned" by
the associated container. The structure here simply applies additional
metadata and visitor behavior to allow much easier processing that is
possible with the raw container structure.
A key value of this abstraction is the extended TupleSchema
associated with the structure. Unlike a
VectorContainer
, this abstraction keeps the schema in sync
with vectors as columns are added.
Some future version may wish to merge the two concepts. That way, metadata discovered by one operator will be available to another. Complex recursive functions can be replace by a visitor with the recursion handled inside implementations of this interface.
Tuples provide access to columns by both index and name. Both the schema and
model classes follow this convention. Compared with the VectorContainer and
AbstractMapVector
classes, the vector index is a first-class concept:
the column model and schema are guaranteed to reside at the same index relative
to the enclosing tuple. In addition, name access is efficient using a hash
index.
Visitor classes are defined by the "simple" (single batch) and "hyper" (multi-batch) implementations to allow vector implementations to work with the specifics of each type of batch.
| Modifier and Type | Interface and Description |
|---|---|
static interface |
TupleModel.ColumnModel
Common interface to access a column vector, its metadata, and its
tuple definition (for maps.) Provides a visitor interface for common
vector tasks.
|
static interface |
TupleModel.RowSetModel
Tuple-model interface for the top-level row (tuple) structure.
|
| Modifier and Type | Method and Description |
|---|---|
TupleModel.ColumnModel |
column(int index) |
TupleModel.ColumnModel |
column(String name) |
TupleMetadata |
schema() |
int |
size() |
TupleMetadata schema()
int size()
TupleModel.ColumnModel column(int index)
TupleModel.ColumnModel column(String name)
Copyright © 2021 The Apache Software Foundation. All rights reserved.


Reduction
Types of loss reduction.
Contains the following values:
NONE
: Un-reduced weighted losses with the same shape as input.SUM
: Scalar sum of weighted losses.MEAN
: Scalar SUM
divided by sum of weights. DEPRECATED.SUM_OVER_BATCH_SIZE
: Scalar SUM
divided by number of elements in losses.SUM_OVER_NONZERO_WEIGHTS
: Scalar SUM
divided by number of non-zero
weights. DEPRECATED.SUM_BY_NONZERO_WEIGHTS
: Same as SUM_OVER_NONZERO_WEIGHTS
. DEPRECATED.all
@classmethod all(cls)
validate
@classmethod validate( cls, key )


public class DefaultListSelectionModel extends Object implements ListSelectionModel, Cloneable, Serializable
Warning:
Serialized objects of this class will not be compatible with
future Swing releases. The current serialization support is
appropriate for short term storage or RMI between applications running
the same version of Swing. As of 1.4, support for long term storage
of all JavaBeansTM
has been added to the java.beans
package.
Please see XMLEncoder
.
ListSelectionModel
| Modifier and Type | Field and Description |
|---|---|
protected boolean |
leadAnchorNotificationEnabled |
protected EventListenerList |
listenerList |
MULTIPLE_INTERVAL_SELECTION, SINGLE_INTERVAL_SELECTION, SINGLE_SELECTION
| Constructor and Description |
|---|
DefaultListSelectionModel() |
| Modifier and Type | Method and Description |
|---|---|
void |
addListSelectionListener(ListSelectionListener l)
Add a listener to the list that's notified each time a change
to the selection occurs.
|
void |
addSelectionInterval(int index0,
int index1)
Changes the selection to be the set union of the current selection
and the indices between
index0 and index1 inclusive. |
void |
clearSelection()
Change the selection to the empty set.
|
Object |
clone()
Returns a clone of this selection model with the same selection.
|
protected void |
fireValueChanged(boolean isAdjusting)
Notifies listeners that we have ended a series of adjustments.
|
protected void |
fireValueChanged(int firstIndex,
int lastIndex)
Notifies
ListSelectionListeners that the value
of the selection, in the closed interval firstIndex ,
lastIndex , has changed. |
protected void |
fireValueChanged(int firstIndex,
int lastIndex,
boolean isAdjusting) |
int |
getAnchorSelectionIndex()
Return the first index argument from the most recent call to
setSelectionInterval(), addSelectionInterval() or removeSelectionInterval().
|
int |
getLeadSelectionIndex()
Return the second index argument from the most recent call to
setSelectionInterval(), addSelectionInterval() or removeSelectionInterval().
|
<T extends EventListener> |
getListeners(Class<T> listenerType)
Returns an array of all the objects currently registered as
FooListener s
upon this model. |
ListSelectionListener[] |
getListSelectionListeners()
Returns an array of all the list selection listeners
registered on this
DefaultListSelectionModel . |
int |
getMaxSelectionIndex()
Returns the last selected index or -1 if the selection is empty.
|
int |
getMinSelectionIndex()
Returns the first selected index or -1 if the selection is empty.
|
int |
getSelectionMode()
Returns the current selection mode.
|
boolean |
getValueIsAdjusting()
Returns
true if the selection is undergoing a series of changes. |
void |
insertIndexInterval(int index,
int length,
boolean before)
Insert length indices beginning before/after index.
|
boolean |
isLeadAnchorNotificationEnabled()
Returns the value of the
leadAnchorNotificationEnabled flag. |
boolean |
isSelectedIndex(int index)
Returns true if the specified index is selected.
|
boolean |
isSelectionEmpty()
Returns true if no indices are selected.
|
void |
moveLeadSelectionIndex(int leadIndex)
Set the lead selection index, leaving all selection values unchanged.
|
void |
removeIndexInterval(int index0,
int index1)
Remove the indices in the interval index0,index1 (inclusive) from
the selection model.
|
void |
removeListSelectionListener(ListSelectionListener l)
Remove a listener from the list that's notified each time a
change to the selection occurs.
|
void |
removeSelectionInterval(int index0,
int index1)
Changes the selection to be the set difference of the current selection
and the indices between
index0 and index1 inclusive. |
void |
setAnchorSelectionIndex(int anchorIndex)
Set the anchor selection index, leaving all selection values unchanged.
|
void |
setLeadAnchorNotificationEnabled(boolean flag)
Sets the value of the leadAnchorNotificationEnabled flag.
|
void |
setLeadSelectionIndex(int leadIndex)
Sets the lead selection index, ensuring that values between the
anchor and the new lead are either all selected or all deselected.
|
void |
setSelectionInterval(int index0,
int index1)
Changes the selection to be between
index0 and index1
inclusive. |
void |
setSelectionMode(int selectionMode)
Sets the selection mode.
|
void |
setValueIsAdjusting(boolean isAdjusting)
Sets the
valueIsAdjusting property, which indicates whether
or not upcoming selection changes should be considered part of a single
change. |
String |
toString()
Returns a string that displays and identifies this
object's properties.
|
protected EventListenerList listenerList
protected boolean leadAnchorNotificationEnabled
public int getMinSelectionIndex()
getMinSelectionIndex
in interface ListSelectionModel
public int getMaxSelectionIndex()
getMaxSelectionIndex
in interface ListSelectionModel
public boolean getValueIsAdjusting()
true
if the selection is undergoing a series of changes.getValueIsAdjusting
in interface ListSelectionModel
ListSelectionModel.setValueIsAdjusting(boolean)
public int getSelectionMode()
getSelectionMode
in interface ListSelectionModel
ListSelectionModel.setSelectionMode(int)
public void setSelectionMode(int selectionMode)
ListSelectionModel.SINGLE_SELECTION
-
Only one list index can be selected at a time. In this mode,
setSelectionInterval
and addSelectionInterval
are
equivalent, both replacing the current selection with the index
represented by the second argument (the "lead").
ListSelectionModel.SINGLE_INTERVAL_SELECTION
-
Only one contiguous interval can be selected at a time.
In this mode, addSelectionInterval
behaves like
setSelectionInterval
(replacing the current selection),
unless the given interval is immediately adjacent to or overlaps
the existing selection, and can therefore be used to grow it.
ListSelectionModel.MULTIPLE_INTERVAL_SELECTION
-
In this mode, there's no restriction on what can be selected.
setSelectionMode
in interface ListSelectionModel
IllegalArgumentException
- if the selection mode isn't
one of those allowedListSelectionModel.getSelectionMode()
public boolean isSelectedIndex(int index)
isSelectedIndex
in interface ListSelectionModel
public boolean isSelectionEmpty()
isSelectionEmpty
in interface ListSelectionModel
public void addListSelectionListener(ListSelectionListener l)
addListSelectionListener
in interface ListSelectionModel
l
- the ListSelectionListenerListSelectionModel.removeListSelectionListener(javax.swing.event.ListSelectionListener)
,
ListSelectionModel.setSelectionInterval(int, int)
,
ListSelectionModel.addSelectionInterval(int, int)
,
ListSelectionModel.removeSelectionInterval(int, int)
,
ListSelectionModel.clearSelection()
,
ListSelectionModel.insertIndexInterval(int, int, boolean)
,
ListSelectionModel.removeIndexInterval(int, int)
public void removeListSelectionListener(ListSelectionListener l)
removeListSelectionListener
in interface ListSelectionModel
l
- the ListSelectionListenerListSelectionModel.addListSelectionListener(javax.swing.event.ListSelectionListener)
public ListSelectionListener[] getListSelectionListeners()
DefaultListSelectionModel
.ListSelectionListener
s
or an empty
array if no list selection listeners are currently registeredaddListSelectionListener(javax.swing.event.ListSelectionListener)
,
removeListSelectionListener(javax.swing.event.ListSelectionListener)
protected void fireValueChanged(boolean isAdjusting)
protected void fireValueChanged(int firstIndex, int lastIndex)
ListSelectionListeners
that the value
of the selection, in the closed interval firstIndex
,
lastIndex
, has changed.protected void fireValueChanged(int firstIndex, int lastIndex, boolean isAdjusting)
firstIndex
- the first index in the intervallastIndex
- the last index in the intervalisAdjusting
- true if this is the final change in a series of
adjustmentsEventListenerList
public <T extends EventListener> T[] getListeners(Class<T> listenerType)
FooListener
s
upon this model.
FooListener
s
are registered using the addFooListener
method.
You can specify the listenerType
argument
with a class literal, such as FooListener.class
.
For example, you can query a DefaultListSelectionModel
instance m
for its list selection listeners
with the following code:
ListSelectionListener[] lsls = (ListSelectionListener[])(m.getListeners(ListSelectionListener.class));If no such listeners exist, this method returns an empty array.
listenerType
- the type of listeners requested;
this parameter should specify an interface
that descends from java.util.EventListener
FooListener
s
on this model,
or an empty array if no such
listeners have been addedClassCastException
- if listenerType
doesn't
specify a class or interface that implements
java.util.EventListener
getListSelectionListeners()
public void setLeadAnchorNotificationEnabled(boolean flag)
isLeadAnchorNotificationEnabled()
public boolean isLeadAnchorNotificationEnabled()
leadAnchorNotificationEnabled
flag.
When leadAnchorNotificationEnabled
is true the model
generates notification events with bounds that cover all the changes to
the selection plus the changes to the lead and anchor indices.
Setting the flag to false causes a narrowing of the event's bounds to
include only the elements that have been selected or deselected since
the last change. Either way, the model continues to maintain the lead
and anchor variables internally. The default is true.
Note: It is possible for the lead or anchor to be changed without a change to the selection. Notification of these changes is often important, such as when the new lead or anchor needs to be updated in the view. Therefore, caution is urged when changing the default value.
leadAnchorNotificationEnabled
flagsetLeadAnchorNotificationEnabled(boolean)
public void clearSelection()
clearSelection
in interface ListSelectionModel
ListSelectionModel.addListSelectionListener(javax.swing.event.ListSelectionListener)
public void setSelectionInterval(int index0, int index1)
index0
and index1
inclusive. index0
doesn't have to be less than or equal to
index1
.
In SINGLE_SELECTION
selection mode, only the second index
is used.
If this represents a change to the current selection, then each
ListSelectionListener
is notified of the change.
If either index is -1
, this method does nothing and returns
without exception. Otherwise, if either index is less than -1
,
an IndexOutOfBoundsException
is thrown.
setSelectionInterval
in interface ListSelectionModel
index0
- one end of the interval.index1
- other end of the intervalIndexOutOfBoundsException
- if either index is less than -1
(and neither index is -1
)addListSelectionListener(javax.swing.event.ListSelectionListener)
public void addSelectionInterval(int index0, int index1)
index0
and index1
inclusive.
In SINGLE_SELECTION
selection mode, this is equivalent
to calling setSelectionInterval
, and only the second index
is used. In SINGLE_INTERVAL_SELECTION
selection mode, this
method behaves like setSelectionInterval
, unless the given
interval is immediately adjacent to or overlaps the existing selection,
and can therefore be used to grow it.
If this represents a change to the current selection, then each
ListSelectionListener
is notified of the change. Note that
index0
doesn't have to be less than or equal to index1
.
If either index is -1
, this method does nothing and returns
without exception. Otherwise, if either index is less than -1
,
an IndexOutOfBoundsException
is thrown.
addSelectionInterval
in interface ListSelectionModel
index0
- one end of the interval.index1
- other end of the intervalIndexOutOfBoundsException
- if either index is less than -1
(and neither index is -1
)addListSelectionListener(javax.swing.event.ListSelectionListener)
,
setSelectionInterval(int, int)
public void removeSelectionInterval(int index0, int index1)
index0
and index1
inclusive.
index0
doesn't have to be less than or equal to index1
.
In SINGLE_INTERVAL_SELECTION
selection mode, if the removal
would produce two disjoint selections, the removal is extended through
the greater end of the selection. For example, if the selection is
0-10
and you supply indices 5,6
(in any order) the
resulting selection is 0-4
.
If this represents a change to the current selection, then each
ListSelectionListener
is notified of the change.
If either index is -1
, this method does nothing and returns
without exception. Otherwise, if either index is less than -1
,
an IndexOutOfBoundsException
is thrown.
removeSelectionInterval
in interface ListSelectionModel
index0
- one end of the intervalindex1
- other end of the intervalIndexOutOfBoundsException
- if either index is less than -1
(and neither index is -1
)addListSelectionListener(javax.swing.event.ListSelectionListener)
public void insertIndexInterval(int index, int length, boolean before)
insertIndexInterval
in interface ListSelectionModel
public void removeIndexInterval(int index0, int index1)
removeIndexInterval
in interface ListSelectionModel
public void setValueIsAdjusting(boolean isAdjusting)
valueIsAdjusting
property, which indicates whether
or not upcoming selection changes should be considered part of a single
change. The value of this property is used to initialize the
valueIsAdjusting
property of the ListSelectionEvent
s that
are generated.
For example, if the selection is being updated in response to a user
drag, this property can be set to true
when the drag is initiated
and set to false
when the drag is finished. During the drag,
listeners receive events with a valueIsAdjusting
property
set to true
. At the end of the drag, when the change is
finalized, listeners receive an event with the value set to false
.
Listeners can use this pattern if they wish to update only when a change
has been finalized.
Setting this property to true
begins a series of changes that
is to be considered part of a single change. When the property is changed
back to false
, an event is sent out characterizing the entire
selection change (if there was one), with the event's
valueIsAdjusting
property set to false
.
setValueIsAdjusting
in interface ListSelectionModel
isAdjusting
- the new value of the propertyListSelectionModel.getValueIsAdjusting()
,
ListSelectionEvent.getValueIsAdjusting()
public String toString()
public Object clone() throws CloneNotSupportedException
listenerLists
are not duplicated.clone
in class Object
CloneNotSupportedException
- if the selection model does not
both (a) implement the Cloneable interface and (b) define a
clone
method.Cloneable
public int getAnchorSelectionIndex()
public int getLeadSelectionIndex()
public void setAnchorSelectionIndex(int anchorIndex)
setAnchorSelectionIndex
in interface ListSelectionModel
getAnchorSelectionIndex()
,
setLeadSelectionIndex(int)
public void moveLeadSelectionIndex(int leadIndex)
leadIndex
- the new lead selection indexsetAnchorSelectionIndex(int)
,
setLeadSelectionIndex(int)
,
getLeadSelectionIndex()
public void setLeadSelectionIndex(int leadIndex)
If the value at the anchor index is not selected, do the same thing in reverse selecting values in the old range and deslecting values in the new one.
Generate a single event for this change and notify all listeners. For the purposes of generating minimal bounds in this event, do the operation in a single pass; that way the first and last index inside the ListSelectionEvent that is broadcast will refer to cells that actually changed value because of this method. If, instead, this operation were done in two steps the effect on the selection state would be the same but two events would be generated and the bounds around the changed values would be wider, including cells that had been first cleared only to later be set.
This method can be used in the mouseDragged
method
of a UI class to extend a selection.
setLeadSelectionIndex
in interface ListSelectionModel
getLeadSelectionIndex()
,
setAnchorSelectionIndex(int)
Submit a bug or feature
For further API reference and developer documentation, see Java SE Documentation. That documentation contains more detailed, developer-targeted descriptions, with conceptual overviews, definitions of terms, workarounds, and working code examples.
Copyright © 1993, 2015, Oracle and/or its affiliates. All rights reserved.


{% extends "global/Page.html" %} {% load otree %} {% block title %} Instruction: Players {% endblock %} {% block content %}
This experiment will be consisted of {{Constants.num_rounds}} sessions. In each session, you will be randomly assigned into a group of {{ Constants.players_per_group }}. Each of you will be randomly assigned a fictious character, and you will only be known to others in the group as your character’s name. You will only play one character in each session; however, you may play different characters in different sessions.
All players in the group will face the same prediction task. Each player within the group will take turns to place a bet. In particular, the character Michael always has a special power-- to decide who moves in what order in each group. We will elaborate Michael's special power shortly.
For example, you may play character Michael in session 2, and character Jim in session 3; similarly,throughout session 2, the character Dwight will be played by one participant, and throughout session 3, the character Dwight may be played by another participant.
{% next_button %} {% endblock %}


Cylindrical projection | Polar stereographic | Latitude/longitude - height | Hovmuller
Vectors | Stipple (significance) | Multiple plots on a page | Colour scales
User defined axes | Rotated pole | Unstructured grids | Graphs
Projections | Trajectories | WRF data


fv scripting
What for?
With an fv script, one can automate some of the interactive
procedures in fv. e.g. using an fv script file, one can open a
FITS file, and display the header of the third extension, or
plot X and Y column in the table on the fourth extension, or do
them both.
Writing an fv script
Fv scripting is designed in an object-oriented fashion. But
you don't have to know much about OO to use it. The only thing
you need to know is that you have to create a FITS object first,
and then ask the FITS object to do the things you want it to do.
All the commands need to be saved in an ASCII file with the
".fv" extension.
Creating a FITS object
To create a FITS object, use the command:
FVFile object_name
where object_name is of your choice. The first two things
you need to do after that are:
- object_name setFileName file_name
- object_name setFileMode file_mode
where file_name is the name of the file and
file_mode is an integer flag specifying how to open the
file. The file name can be a simple path on your local machine,
or a URL of a file on a remote host (see File Selection). To access files on
a remote ftp site, you need to write file_name in the
form of
<EMAIL_ADDRESS>If the remote host is an anonymous ftp site, one can replace the
username and password with "anonymous" and one's email
address.
The values and meaning of file_mode are as follows:
- 0: open pre-existing file as read/write
- 1: open pre-existing file as read only
- 2: create a new FITS file
Available actions
The scripting capability is currently rather limited and is deprecated
in preference to a newer, more powerful
interface. Right now, you can only do the following
- object_name setExtension ext_number
- object_name displayTable
- object_name displayImage
- object_name setXColumn column_name
- object_name setYColumn column_name
- object_name setXErrorColumn column_name
- object_name setYErrorColumn column_name
- object_name plotTable # do the above four commands
first (Only setXColumn and setYColumn are required).
Go to About fv.


About
I'm Rohit (b. 1996, Odisha). Coding to me is a way of life. It's not just the work, but a passion that you grow with every day. I've been a self-taught developer for most of my career and been dabbling with code from time to time.
Data Analyst & Software Developer.
I share hardcore interest in tackling with datasets and generate key actionable insights. I keep on learning new technology, skills and tools by building real-life capstone projects.
- Website: https://rohitlearner.github.io/
- City: Mumbai, India
- University: IIT Bombay
- Age: 25
- Degree: Masters
- Domain: Computer Science & Engineering
I've been fortunate to work with successful entrepreneurs and talented people that have assisted me with my journey of becoming a better developer. I love learning and creating innovative solutions for the world, forever striving for flawlessness and the best possible outcome.
Facts
I believe in transforming complicated technical ideas into user-friendly projects before the eyes of the client. I’m constantly ready for new learning opportunities and have plenty of room up to my sleeve for a few performances.
Happy Connections
Projects
Area Of Expertise
Certifications
Skills
Skills are our natural talents and the expertise we develop to perform a task or a job. I'm proud of my life and professional skills which i dedicately developed. Overview of my skills chart comparison are shown below :
Resume
I am data science enthusiast with M.Tech in CSE from IIT Bombay on Algorithm and ML Domain. With more than 10+ projects completion, I am currently exploring the booming field of Data Science and Analytics.
Sumary
Rohit Kumar Singh
Innovative and result-driven Data Analyst with 10+ projects of learning experience designing and developing user-centered key insights from noisy dataset to final, actionable deliverable outcome.
- Mumbai, India
- Computer Science Engineering Post Graduate
-<EMAIL_ADDRESS>Education
Master in Technology : CSE
2019 - 2021
IIT Bombay, Mumbai
Completed master in Algorithm & ML domain and achieved overall CPI of 8.6 including evaluation of 10+ courses and 3 research field.
Served as Graduate Teaching Assistant to pursue knowledge regarding DLD lab, Introduction of Algorithm and Applied Algorithm.
Bachelor in Engineering : Computer Engineering
2014 - 2018
University of Pune, Pune
Awarded with First Class in Distinction scoring 73.03% and completed 40+ courses and 2 bachelor projects.
Spearhead a team of 8+ for innovative design and develop a fully functional dynamic department website.
Professional Experience
Kaggle Kernel Expert
2019 - till date
Part Time, Remote
5 Bronze Medal for Notebook submission in Python by tackling different problem statements.
Achieved Highest Rank of 806 among 133,669 users for contending as Notebooks Expert.
Collaborated for Silver Medal in project to find crucial parameters to get admission into postgraduate college.
Research Experience
Masters Research Graduate
Jan 2020 - July 2021
IIT Bombay, Mumbai
- Showcase the robust nature of RL for variety of Capacitated Facility Location Problem versions based on few bound constraints.
- Enable in solving the problem of automating the CFLP solver with reasonable accuracy within a reasonable time period.
- Conducted 10+ literature survey on various approaches to efficiently solve combinatorial problems.
Bachelor Research Project
Aug 2017 - May 2018
University of Pune, Pune
- Implemented LINGO clustering based on the DCF method for BigData to assign meaningful cluster labels.
- Exploratory Data Mining using Java & JavaSwing to cover 10+ parameters to decipher plane crash behaviour.
- Directed a team of 3 for desirable accuracy along with time and effort feasibility in NetBeans and Microsoft SQL Server 2008.
POSITION OF RESPONSIBILITIES
Interview Co-ordinator
Aug 2019 - December 2019
IIT Bombay, Mumbai
- Coordinated with a team of 250+ members for interviews of 1600+ students.
- Assisted in conducting Pre-placement Talks and Tests for 15+ firms.
ACHIEVEMENTS
- Secured 99.63 % in GATE CSE 2019 among 99,932 candidates.
- Bagged 1 national award and 10th Rank as in team for participation in ABU Robocon India 2017 and 2016.
- Accredited with Certificate of Merit for Top 20 Team within institute in Round 1 of Flipkart GRiD 2.0 Challenge.
Projects & Certifications
I have completed a wide range of projects which enabled me to hold various high level certification and build my portfolio in diverse in-depth domain.
- All
- Data Science
- Software Development
- Web Development
- Certificate
Entertainment Website
Web Portfolio 2 (Discontinued)
College Website
Web Portfolio 3 (Discontinued)
Contact
Location:
Mumbai,India
Email:
<EMAIL_ADDRESS>Call:
Upon Request


Click inside the nested circles to change the counting behavior. Click outside the largest circle to cycle p.
See this short description for what the animation represents.


Forest of the Lost [ap57], forest, in Imperia, peasants: 145
Last updated Turn #127
Forest of the Lost [ap57], forest, in Imperia, peasants: 145
------------------------------------------------------------------------
11: It has begun to rain.
12: Wild men [gz3e], savages, number: 42, arrived from the east.
14: Wild men [gz3e], savages, number: 42, went west.
14: Stack of nazgul [hb6r], nazgul, arrived from the west.
14: Stack of nazgul [is3t], nazgul, number: 2, arrived from the south.
16: Stack of nazgul [hb6r], nazgul, went east.
16: Stack of nazgul [is3t], nazgul, number: 2, went east.
17: Stack of nazgul [fi1q], nazgul, number: 3, arrived from the east.
19: Stack of nazgul [fi1q], nazgul, number: 3, went west.
19: It has become quite foggy.
30: The population grows by one peasant.
Routes leaving Forest of the Lost:
North, to Ocean [ao57], The Inner Sea, 2 days
East, forest, to Forest of the Lost [ap58], 8 days
South, forest, to Forest of the Lost [aq57], 8 days
West, forest, to Forest of the Lost [ap56], 8 days
Inner locations:
Cairn Hills [ac9u], graveyard, 1 day, owner:
Spirit [gq8y], spirits, number: 6
It is raining.
The province is blanketed in fog.
No one can be seen through the fog.


#include <stSlimTree.h>
Classes | |
| struct | tSlimHeader |
Public Types | |
| enum | tChooseMethod { cmBIASED, cmRANDOM, cmMINDIST, cmMINOCCUPANCY, cmMINGDIST } |
| enum | tCorrectMethod { crmOFF, crmFATFACTOR } |
| enum | tSplitMethod { smRANDOM, smMINMAX, smSPANNINGTREE } |
| typedef struct stSlimTree::tSlimHeader | stSlimHeader |
| typedef stResult< ObjectType > | tResult |
| typedef stGenericPriorityQueue< ObjectType > | tGenericPriorityQueue |
| typedef stGenericEntry< ObjectType > | tGenericEntry |
| typedef stGenericPriorityHeap< ObjectType > | tPGenericHeap |
| typedef stSlimMemLeafNode< ObjectType > | tMemLeafNode |
| Public Types inherited from stMetricTree< ObjectType, EvaluatorType > | |
| typedef ObjectType | tObject |
| typedef EvaluatorType | tMetricEvaluator |
| typedef stResult< ObjectType > | tResult |
| Public Types inherited from stMetricAccessMethod< ObjectType, EvaluatorType > | |
| enum | stCommonQueryHintType { QHT_NONE = 0 } |
| typedef ObjectType | tObject |
| typedef EvaluatorType | tMetricEvaluator |
| typedef stResult< ObjectType > | tResult |
Public Member Functions | |
| stSlimTree (stPageManager *pageman) | |
| stSlimTree (stPageManager *pageman, EvaluatorType *metricEval) | |
| virtual | ~stSlimTree () |
| virtual bool | Add (ObjectType *newObj) |
| virtual stCount | GetHeight () |
| virtual long | GetNumberOfObjects () |
| virtual stCount | GetMaxOccupation () |
| void | SetMaxOccupation (stCount newValue) |
| virtual double | GetMinOccupation () |
| virtual void | SetMinOccupation (double min) |
| virtual long | GetNodeCount () |
| long | GetIndexNodeCount () |
| long | GetIndexNodeCount (stPageID pageID) |
| stDistance | GetDistanceLimit () |
| stDistance | GetGreaterEstimatedDistance () |
| stDistance | GetGreaterDistance () |
| void | SetSplitMethod (enum tSplitMethod method) |
| int | GetSplitMethod () |
| void | SetChooseMethod (enum tChooseMethod method) |
| int | GetChooseMethod () |
| stSize | GetUserDataSize () |
| bool | WriteUserData (const stByte *userData, stSize size) |
| bool | ReadUserData (stByte *userData, stSize size) |
| tResult * | RangeQuery (ObjectType *sample, stDistance range) |
| tResult * | ReversedRangeQuery (ObjectType *sample, stDistance range) |
| tResult * | LocalNearestQuery (ObjectType *sample, stCount k, bool tie=false) |
| tResult * | ListNearestQuery (ObjectType *sample, stCount k, bool tie=false) |
| tResult * | NearestQuery (ObjectType *sample, stCount k, bool tie=false) |
| tResult * | FarthestQuery (ObjectType *sample, stCount k, bool tie=false) |
| tResult * | PointQuery (ObjectType *sample) |
| tResult * | IncrementalListNearestQuery (ObjectType *sample, stCount k, bool tie=false) |
| tResult * | IncrementalNearestQuery (ObjectType *sample, stCount k, bool tie=false) |
| void | InitializeIncrementalNearestQuery (ObjectType *sample, stCount k, tResult *result, tPGenericHeap *globalQueue) |
| void | InitializeIncrementalNearestQuery (ObjectType *sample, stCount k, tResult *result, tGenericPriorityQueue *globalQueue) |
| void | IncrementalNearestQuery (ObjectType *sample, stCount k, tResult *result, tPGenericHeap *globalQueue) |
| void | IncrementalNearestQuery (ObjectType *sample, stCount k, tResult *result, tGenericPriorityQueue *globalQueue) |
| tResult * | KAndRangeQuery (ObjectType *sample, stDistance range, stCount k, bool tie=false) |
| tResult * | KOrRangeQuery (ObjectType *sample, stDistance range, stCount k, bool tie=false) |
| tResult * | SimpleKOrRangeQuery (ObjectType *sample, double fractalDimension, stDistance radiusKOrRange, stCount k, bool tie=false) |
| tResult * | RingQuery (ObjectType *sample, stDistance inRange, stDistance outRange) |
| tResult * | KRingQuery (ObjectType *sample, stDistance inRange, stDistance outRange, stCount k, bool tie=false) |
| tResult * | LocalKRingQuery (ObjectType *sample, stDistance inRange, stDistance outRange, stCount k, bool tie=false) |
| tResult * | LazyRangeQuery (ObjectType *sample, stDistance range, stCount k, bool tie=false) |
| tResult * | AproximateNearestQuery (ObjectType *sample, stCount k, bool tie=false) |
| double | GetFatFactor () |
| void | MAMViewSetOutputDir (const char *dir) |
| void | MAMViewInit () |
| void | MAMViewDumpTree () |
| virtual stTreeInfoResult * | GetTreeInfo () |
| virtual void | Optimize () |
| Public Member Functions inherited from stMetricTree< ObjectType, EvaluatorType > | |
| stMetricTree (stPageManager *pageman) | |
| stMetricTree (stPageManager *pageman, EvaluatorType *metricEval) | |
| virtual | ~stMetricTree () |
| stPageManager * | GetPageManager () |
| Public Member Functions inherited from stMetricAccessMethod< ObjectType, EvaluatorType > | |
| virtual | ~stMetricAccessMethod () |
| virtual bool | Delete (tObject *obj) |
| EvaluatorType * | GetMetricEvaluator () |
| virtual stQueryHint * | CreateQueryHint (int type) |
Additional Inherited Members | |
| Protected Member Functions inherited from stMetricAccessMethod< ObjectType, EvaluatorType > | |
| stMetricAccessMethod (EvaluatorType *eval) | |
| Protected Attributes inherited from stMetricTree< ObjectType, EvaluatorType > | |
| stPageManager * | myPageManager |
| Protected Attributes inherited from stMetricAccessMethod< ObjectType, EvaluatorType > | |
| tMetricEvaluator * | myMetricEvaluator |
This class defines all behavior of the SlimTree. Probably most of the atributes will be stored in the header page of the used stPageManager (stDiskPageManager or stMemoryPageManager).
First implementation is based on original code by Agma Traina, Bernard Seeger and Caetano Traina
Main modifications from original code are intent to turn it an object oriented compliant code.
Definition at line 682 of file stSlimTree.h.
| typedef struct stSlimTree::tSlimHeader stSlimTree< ObjectType, EvaluatorType >::stSlimHeader |
This structure defines the SlimTree header structure. This type was left public to allow the creation of debug tools.
| typedef stGenericEntry< ObjectType > stSlimTree< ObjectType, EvaluatorType >::tGenericEntry |
This type is used by the priority key.
Definition at line 832 of file stSlimTree.h.
| typedef stGenericPriorityQueue< ObjectType > stSlimTree< ObjectType, EvaluatorType >::tGenericPriorityQueue |
This type is used by the priority key.
Definition at line 827 of file stSlimTree.h.
| typedef stSlimMemLeafNode< ObjectType > stSlimTree< ObjectType, EvaluatorType >::tMemLeafNode |
Memory leaf node used by Slim-Down.
Definition at line 842 of file stSlimTree.h.
| typedef stGenericPriorityHeap< ObjectType > stSlimTree< ObjectType, EvaluatorType >::tPGenericHeap |
This type is used by the priority key.
Definition at line 837 of file stSlimTree.h.
| typedef stResult<ObjectType> stSlimTree< ObjectType, EvaluatorType >::tResult |
This is the class that abstracs an result set.
Definition at line 822 of file stSlimTree.h.
| enum stSlimTree::tChooseMethod |
These constants are used to define the choose sub tree method.
| Enumerator | |
|---|---|
| cmBIASED |
Choose the first of the qualifying nodes. |
| cmRANDOM |
Randomly choose one of the qualifying nodes. |
| cmMINDIST |
Choose the node that has the minimum distance from the new object and the representative (center) of the node. |
| cmMINOCCUPANCY |
Choose the node that has the minimum occupancy among the qualifying ones. This is the default method due to its better performance. |
| cmMINGDIST |
Unknown.
|
Definition at line 746 of file stSlimTree.h.
| enum stSlimTree::tCorrectMethod |
These constants are used to define the correction method.
| Enumerator | |
|---|---|
| crmOFF |
No correction. |
| crmFATFACTOR |
Use Fat Factor. |
Definition at line 777 of file stSlimTree.h.
| enum stSlimTree::tSplitMethod |
These constants are used to define the split method.
Definition at line 792 of file stSlimTree.h.
| stSlimTree< ObjectType, EvaluatorType >::stSlimTree | ( | stPageManager * | pageman | ) |
Creates a new metric tree using a given page manager. This instance will not claim the ownership of the given page manager. It means that the application must dispose the page manager when it is no loger necessary.
| pageman | The bage manager to be used by this metric tree. |
| stSlimTree< ObjectType, EvaluatorType >::stSlimTree | ( | stPageManager * | pageman, |
| EvaluatorType * | metricEval | ||
| ) |
Creates a new metric tree using a given page manager. This instance will not claim the ownership of the given page manager. It means that the application must dispose the page manager when it is no loger necessary.
| pageman | The bage manager to be used by this metric tree. |
| metricEval | The shared metric evaluator be used by this metric tree. |
|
virtual |
Dispose all used resources, ie, it is the destructor method.
|
virtual |
This method adds an object to the metric tree.
| obj | The object to be added. |
Reimplemented from stMetricAccessMethod< ObjectType, EvaluatorType >.
| tResult* stSlimTree< ObjectType, EvaluatorType >::AproximateNearestQuery | ( | ObjectType * | sample, |
| stCount | k, | ||
| bool | tie = false |
||
| ) |
This method will perform a aproximate K-Nearest Neighbor query
| sample | The sample object. |
| k | The number of neighbors. |
| tie | The tie list. Default false. |
| tResult* stSlimTree< ObjectType, EvaluatorType >::FarthestQuery | ( | ObjectType * | sample, |
| stCount | k, | ||
| bool | tie = false |
||
| ) |
This method will perform a K-Farthest Neighbor query using a global priority queue based on chained list to "enhance" its performance. We believe that the use of a priority queue during the search in the index nodes will force the radius to converge faster than the normal farthest query.
This implementation may replace the original implementation if it proves to be better.
| sample | The sample object. |
| k | The number of neighbors. |
| tie | The tie list. Default false. |
|
inline |
Returns the Choose Method name.
Definition at line 992 of file stSlimTree.h.
References stSlimTree< ObjectType, EvaluatorType >::tSlimHeader::ChooseMethod.
|
virtual |
Returns the limit distance between 2 objects in the tree. That is . In other words, there is no distance greater than this.
This value may be the greatest distance between objects but may return greater values due to implementation optmizations.
Reimplemented from stMetricTree< ObjectType, EvaluatorType >.
| double stSlimTree< ObjectType, EvaluatorType >::GetFatFactor | ( | ) |
Calculates the FatFactor of this tree.
| stDistance stSlimTree< ObjectType, EvaluatorType >::GetGreaterDistance | ( | ) |
Returns the greatest distance between 2 objects in the leaf level of the tree.
| stDistance stSlimTree< ObjectType, EvaluatorType >::GetGreaterEstimatedDistance | ( | ) |
Returns the greatest estimated distance between 2 objects in the second level of the tree.
|
inlinevirtual |
Returns the height of the tree.
Reimplemented from stMetricTree< ObjectType, EvaluatorType >.
Definition at line 881 of file stSlimTree.h.
References stSlimTree< ObjectType, EvaluatorType >::tSlimHeader::Height.
| long stSlimTree< ObjectType, EvaluatorType >::GetIndexNodeCount | ( | ) |
| long stSlimTree< ObjectType, EvaluatorType >::GetIndexNodeCount | ( | stPageID | pageID | ) |
|
inlinevirtual |
Returns the MaxOccupation of the nodes.
Reimplemented from stMetricTree< ObjectType, EvaluatorType >.
Definition at line 895 of file stSlimTree.h.
References stSlimTree< ObjectType, EvaluatorType >::tSlimHeader::MaxOccupation.
|
inlinevirtual |
Returns the MinOccupation of the nodes.
Reimplemented from stMetricTree< ObjectType, EvaluatorType >.
Definition at line 911 of file stSlimTree.h.
References stSlimTree< ObjectType, EvaluatorType >::tSlimHeader::MinOccupation.
|
inlinevirtual |
Returns the number of nodes of this tree.
Reimplemented from stMetricTree< ObjectType, EvaluatorType >.
Definition at line 925 of file stSlimTree.h.
References stSlimTree< ObjectType, EvaluatorType >::tSlimHeader::NodeCount.
|
inlinevirtual |
Returns the number of objetcs of this tree.
Reimplemented from stMetricTree< ObjectType, EvaluatorType >.
Definition at line 888 of file stSlimTree.h.
References stSlimTree< ObjectType, EvaluatorType >::tSlimHeader::ObjectCount.
|
inline |
Returns the current split method.
Definition at line 974 of file stSlimTree.h.
References stSlimTree< ObjectType, EvaluatorType >::tSlimHeader::SplitMethod.
|
virtual |
This method returns information about the tree like FatFactor, mean object size and others.
Reimplemented from stMetricTree< ObjectType, EvaluatorType >.
|
inline |
Gets the maximum user data size available in this tree.
Definition at line 1015 of file stSlimTree.h.
| tResult* stSlimTree< ObjectType, EvaluatorType >::IncrementalListNearestQuery | ( | ObjectType * | sample, |
| stCount | k, | ||
| bool | tie = false |
||
| ) |
This method will inicializate the parameters to perform a K-Nearest Neighbor query using a global priority queue based on a dynamic link list.
This method is based on Hjaltson and Samet (ACM TODS-2000). It is possible to get k+1 object after retrieve the k's objects.
| sample | The sample object. |
| k | The number of neighbors. |
| tie | The tie list. Default false. |
| tResult* stSlimTree< ObjectType, EvaluatorType >::IncrementalNearestQuery | ( | ObjectType * | sample, |
| stCount | k, | ||
| bool | tie = false |
||
| ) |
This method will inicializate the parameters to perform a K-Nearest Neighbor query using a global priority queue based on a dynamic heap to "enhance" its performance.
This method is based on Hjaltson and Samet (ACM TODS-2000). It is possible to get k+1 object after retrieve the k's objects.
| sample | The sample object. |
| k | The number of neighbors. |
| tie | The tie list. Default false. |
| void stSlimTree< ObjectType, EvaluatorType >::IncrementalNearestQuery | ( | ObjectType * | sample, |
| stCount | k, | ||
| tResult * | result, | ||
| tPGenericHeap * | globalQueue | ||
| ) |
This method will perform a K-Nearest Neighbor query using a global priority queue based on a dynamic heap to "enhance" its performance.
This method is based on Hjaltson and Samet (ACM TODS-2000). It is possible to get k+1 object after retrieve the k's objects.
This is possible because the global priority is not delete and the subtrees are not pruned.
| sample | The sample object. |
| k | The number of neighbors. |
| The | result. |
| globalQueue | a queue to be managed. |
| void stSlimTree< ObjectType, EvaluatorType >::IncrementalNearestQuery | ( | ObjectType * | sample, |
| stCount | k, | ||
| tResult * | result, | ||
| tGenericPriorityQueue * | globalQueue | ||
| ) |
This method will perform a K-Nearest Neighbor query using a global priority queue based on a dynamic list.
This method is based on Hjaltson and Samet (ACM TODS-2000). It is possible to get k+1 object after retrieve the k's objects.
This is possible because the global priority is not delete and the subtrees are not pruned.
| sample | The sample object. |
| k | The number of neighbors. |
| The | result. |
| globalQueue | a queue to be managed. |
| void stSlimTree< ObjectType, EvaluatorType >::InitializeIncrementalNearestQuery | ( | ObjectType * | sample, |
| stCount | k, | ||
| tResult * | result, | ||
| tPGenericHeap * | globalQueue | ||
| ) |
This method will inicializate the parameters to perform a K-Nearest Neighbor query using a global priority queue based on a dynamic heap to "enhance" its performance.
This method is based on Hjaltson and Samet (ACM TODS-2000). It is possible to get k+1 object after retrieve the k's objects.
This is possible because the global priority is not delete and the subtrees are not pruned.
| sample | The sample object. |
| k | The number of neighbors. |
| The | result. |
| globalQueue | a queue to be managed. |
| void stSlimTree< ObjectType, EvaluatorType >::InitializeIncrementalNearestQuery | ( | ObjectType * | sample, |
| stCount | k, | ||
| tResult * | result, | ||
| tGenericPriorityQueue * | globalQueue | ||
| ) |
This method will inicializate the parameters to perform a K-Nearest Neighbor query using a global priority queue based on a dynamic list.
This method is based on Hjaltson and Samet (ACM TODS-2000). It is possible to get k+1 object after retrieve the k's objects.
This is possible because the global priority is not delete and the subtrees are not pruned.
| sample | The sample object. |
| k | The number of neighbors. |
| The | result. |
| globalQueue | a queue to be managed. |
|
virtual |
This method will perform a range query with a limited number of results.
This query is a combination of the standard Range Query and the standard K-Nearest Neighbor Query. All objects which matches both conditions will be included in the result. The K-Nearest Neighbor Query is implemented with a local priority queue.
| sample | The sample object. |
| range | The range of the results. |
| k | The maximum number of results. |
| tie | The tie list. This parameter is optional. Default false; |
Reimplemented from stMetricAccessMethod< ObjectType, EvaluatorType >.
|
virtual |
This method will perform range query with a limited number of results.
This query is a combination of the standard range query and the standard K-Nearest Neighbor Query. All objects which matches with one of two conditions will be included in the result. The K-Nearest Neighbor Query is implemented with a local priority queue.
| sample | The sample object. |
| range | The range of the results. |
| k | The maximum number of results. |
| tie | The tie list. This parameter is optional. Default false; |
Reimplemented from stMetricAccessMethod< ObjectType, EvaluatorType >.
|
virtual |
This method will perform a ring query with K-Nearest Neighbor query. The result will be a set of pairs object/distance.
| sample | The sample object. |
| inRange | The outter range of the results. |
| outRange | The inner range of the results. |
| k | The number of nearest neighbor. |
| tie | The tie list. This parameter is optional. Default false; |
Reimplemented from stMetricAccessMethod< ObjectType, EvaluatorType >.
| tResult* stSlimTree< ObjectType, EvaluatorType >::LazyRangeQuery | ( | ObjectType * | sample, |
| stDistance | range, | ||
| stCount | k, | ||
| bool | tie = false |
||
| ) |
This method will perform a range query with a limited number of results.
A lazy range query recovers the k elements within a radius, independently if the k elements are the k nearest elements of query object.
| sample | The sample object. |
| range | The range of the results. |
| k | The maximum number of results. |
| tie | The tie list. This parameter is optional. Default false; |
| tResult* stSlimTree< ObjectType, EvaluatorType >::ListNearestQuery | ( | ObjectType * | sample, |
| stCount | k, | ||
| bool | tie = false |
||
| ) |
This method will perform a K-Nearest Neighbor query using a link list. We believe that the use of a priority queue during the search in the index nodes will force the radius to converge faster than the normal nearest query.
| sample | The sample object. |
| k | The number of neighbors. |
| tie | The tie list. Default false. |
| tResult* stSlimTree< ObjectType, EvaluatorType >::LocalKRingQuery | ( | ObjectType * | sample, |
| stDistance | inRange, | ||
| stDistance | outRange, | ||
| stCount | k, | ||
| bool | tie = false |
||
| ) |
This method will perform a ring query with K-Nearest Neighbor query based on a local chained list. The result will be a set of pairs object/distance.
| sample | The sample object. |
| inRange | The outter range of the results. |
| outRange | The inner range of the results. |
| k | The number of nearest neighbor. |
| tie | The tie list. This parameter is optional. Default false; |
| tResult* stSlimTree< ObjectType, EvaluatorType >::LocalNearestQuery | ( | ObjectType * | sample, |
| stCount | k, | ||
| bool | tie = false |
||
| ) |
This method will perform a K-Nearest Neighbor query using a priority queue to "enhance" its performance. We believe that the use of a priority queue during the search in the index nodes will force the radius to converge faster than the normal nearest query.
| sample | The sample object. |
| k | The number of neighbors. |
| tie | The tie list. Default false. |
| void stSlimTree< ObjectType, EvaluatorType >::MAMViewDumpTree | ( | ) |
Creates a dump of the tree which can be viewed by MAMViewer.
| void stSlimTree< ObjectType, EvaluatorType >::MAMViewInit | ( | ) |
Initializes the MAMView module. It will restart he
| dir | The directory name. |
|
inline |
Sets the visualization output directory.
| dir | The directory name. |
Definition at line 1452 of file stSlimTree.h.
References stMAMViewExtractor< ObjectType, EvaluatorType >::SetOutputDir().
|
virtual |
This method will perform a K-Nearest Neighbor query using a global priority queue based on chained list to "enhance" its performance. We believe that the use of a priority queue during the search in the index nodes will force the radius to converge faster than the normal nearest query.
This implementation may replace the original implementation if it proves to be better.
| sample | The sample object. |
| k | The number of neighbors. |
| tie | The tie list. Default false. |
Reimplemented from stMetricAccessMethod< ObjectType, EvaluatorType >.
|
virtual |
Optimizes the structure of this tree by executing the Slim-Down algorithm.
The Slim-Down algorithm can only be performed when the tree has at least 3 levels. Fortunately, this
Reimplemented from stMetricAccessMethod< ObjectType, EvaluatorType >.
|
virtual |
This method will return the object in the tree that has the distance 0 to the query object. In other words, the query object itself.
If there are more elements that has distance 0 to the query object, this method will return the first found.
The object pointed by sample will not be destroyed by this method.
| sample | The sample object. |
Reimplemented from stMetricAccessMethod< ObjectType, EvaluatorType >.
|
virtual |
This method will perform a range query. The result will be a set of pairs object/distance.
| sample | The sample object. |
| range | The range of the results. |
Reimplemented from stMetricAccessMethod< ObjectType, EvaluatorType >.
|
inline |
Reads an additional user data.
This feature allows users to write additional information in to the free area of the header page. The available space will deppends on the size of the header page (see the page manager documentation for more details).
| userData | A pointer to the user data. |
| size | The size of the user data. |
Definition at line 1055 of file stSlimTree.h.
| tResult* stSlimTree< ObjectType, EvaluatorType >::ReversedRangeQuery | ( | ObjectType * | sample, |
| stDistance | range | ||
| ) |
This method will perform a reverse of range query. The result will be a set of pairs object/distance.
| sample | The sample object. |
| range | The range of the results. All object that are greater than the range distance will be included in the result set. |
|
virtual |
This method will perform a ring query. The result will be a set of pairs object/distance.
| sample | The sample object. |
| inRange | The outter range of the results. |
| outRange | The inner range of the results. |
Reimplemented from stMetricAccessMethod< ObjectType, EvaluatorType >.
|
inline |
Sets the Choose Method name.
| method | Choose method name. |
Definition at line 984 of file stSlimTree.h.
References stSlimTree< ObjectType, EvaluatorType >::tSlimHeader::ChooseMethod.
|
inline |
Returns the MaxOccupation of the nodes.
Definition at line 902 of file stSlimTree.h.
References stSlimTree< ObjectType, EvaluatorType >::tSlimHeader::MaxOccupation.
|
inlinevirtual |
Set the MinOccupation of the nodes.
Definition at line 918 of file stSlimTree.h.
References stSlimTree< ObjectType, EvaluatorType >::tSlimHeader::MinOccupation.
|
inline |
Sets the tree split method.
| method | Method name. |
Definition at line 966 of file stSlimTree.h.
References stSlimTree< ObjectType, EvaluatorType >::tSlimHeader::SplitMethod.
| tResult* stSlimTree< ObjectType, EvaluatorType >::SimpleKOrRangeQuery | ( | ObjectType * | sample, |
| double | fractalDimension, | ||
| stDistance | radiusKOrRange, | ||
| stCount | k, | ||
| bool | tie = false |
||
| ) |
This method will perform the disjunctive complex similarity query between range and k-nearest neighbor operator. However, in this method, this is done through of range queries.
This query is a combination of the standard range query and the standard K-Nearest Neighbor Query. All objects which matches with one of two conditions will be included in the result. The K-Nearest Neighbor Query is implemented with a global priority queue.
| sample | The sample object. |
| fractalDimension | The fractal dimension of the data set. |
| nroObjects | The total number of objects of the data set. |
| radiusKOrRange | Th radius of the range operator. |
| k | The maximum number of results. |
| tie | The tie list. This parameter is optional. Default false; |
|
inline |
Writes an additional user data.
This feature allows users to write additional information in to the free area of the header page. The available space will deppends on the size of the header page (see the page manager documentation for more details).
| userData | A pointer to the user data. |
| size | The size of the user data. |
Definition at line 1035 of file stSlimTree.h.


Devenish CEO named 2019 EY Entrepreneur Of The Year
by Jack QuannThe head of agri-tech company Devenish, Richard Kennedy, has been named as the 2019 EY Entrepreneur Of The Year.
The announcement was made at the annual awards ceremony in Dublin's Citywest Hotel on Thursday night.
The event was attended by business leaders and Finance Minister Paschal Donohoe.
Collectively, this year's 24 finalists employ more than 13,000 people and have revenues of €1.2bn.
Devenish is a global agri-tech company specialising in animal nutrition, operating in more than 40 countries.
Headquartered in Belfast, it supplies high-quality nutritional products for the agriculture and aquaculture industries.
Devenish has grown from 23 employees in 1997, to more than 500 today.
Last year, the firm also received €118m in funding from the European Investment Bank (EIB) to help to build and develop the business.
Alongside being named as the overall winner, Mr Kennedy was also named EY International Entrepreneur Of The Year.
Elsewhere, Triona Mullane received the award for EY Emerging Entrepreneur Of The Year.
Her company, mAdme Technologies, allows some of the world's largest mobile operators to better engage with their customers - and is active on over 200 million mobile phones globally.
And the founder of Supermac's, Pat McDonagh, was named EY Industry Entrepreneur Of The Year.
He is also behind the Só Hotel Group and six motorway and national route service stations.
A Special Award was presented to Joe Schmidt for his contribution to life on the island of Ireland through vision, innovation and commitment to excellence.
Chaired by the 2006 EY Entrepreneur Of The Year Anne Heraty, this year's judging panel included previous winners Michael Carey, Mark Roden, Evelyn O'Toole, Dr Edmond Harty, Joe Hogan, Jerry Kennelly, Brendan Mooney, Harry Hughes and Denis O'Brien.
The EY Entrepreneur Of The Year programme is a global recognition programme run in 145 cities in more than 60 countries.
Now in its 22nd year, it works to recognise, promote and build a supportive community around Ireland's high-growth entrepreneurs and is considered one of the strongest programmes globally.


SCALAR
String
The String
scalar type represents textual data, represented as UTF-8 character sequences. The String type is most often used by GraphQL to represent free-form human-readable text.
link GraphQL Schema definition
1
scalar String
link Required by
- AccountAn account record
- AssetRepresents an asset in vega
- AuctionEvent
- BuiltinAssetA vega builtin asset, mostly for testing purpose
- BuiltinAssetInputA vega builtin asset, mostly for testing purpose
- BusEvent
- CandleCandle stick representation of trading
- ConditionCondition describes the condition that must be validated by the
- ConditionInputCondition describes the condition that must be validated by the
- ContinuousTradingA mode where Vega tries to execute orders as soon as they are received
- ContinuousTradingInputA mode where Vega try to execute order as soon as they are received
- DepositThe details of a deposit processed by vega
- DiscreteTradingFrequent batch auctions trading mode
- DiscreteTradingInputFrequent batch auctions trading mode
- ERC20An asset originated from an Ethereum ERC20 Token
- ERC20InputAn asset originated from an Ethereum ERC20 Token
- Erc20WithdrawalApprovalAll the data related to the approval of a withdrawal from the network
- Erc20WithdrawalDetailsSpecific details for an erc20 withdrawal
- Erc20WithdrawalDetailsInputERC20 specific details to start a withdrawal
- EthereumEventAn Ethereum oracle
- FeeFactorsThe factors applied to calculate the fees
- FutureA Future product
- FutureProduct
- FutureProductInputFuture product configuration
- InstrumentDescribe something that can be traded on Vega
- InstrumentConfiguration
- InstrumentConfigurationInput
- InstrumentMetadataA set of metadata to associate to an instrument
- LedgerEntry
- LiquidityProviderFeeShareThe equity like share of liquidity fee for each liquidity provider
- LiquidityProvisionThe command to be sent to the chain for a liquidity provision submission
- MarginLevelsMargins for a given a trader
- MarketRepresents a product & associated parameters that can be traded on Vega, has an associated OrderBook and Trade history
- MarketDataLive data of a Market
- MarketDepthMarket Depth is a measure of the number of open buy and sell orders for a security or currency at different prices. The depth of market measure provides an indication of the liquidity and depth for the instrument.
- MarketDepthUpdateMarket Depth Update is a delta to the current market depth which can be used to update the market depth structure to keep it correct
- MarketEvent
- MarketTick
- MarketTimestampstimestamps for when the market changes state
- MutationMutations are similar to GraphQL queries, however they allow a caller to change or mutate data.
- NetworkParameterRepresentation of a network parameter
- NetworkParameterInputRepresentation of a network parameter
- NewAssetA new asset proposal change
- NewAssetInputA new asset to be added into vega
- NewMarket
- NewMarketCommitmentA commitment of liquidity to be made by the party which proposes a market
- NewMarketCommitmentInputA commitment of liquidity to be made by the party which proposes a market
- NewMarketInputAllows creating new markets on the network
- NodeSignatureRepresents a signature for the approval of a resource from a validator
- OracleDataAn oracle data contains the data sent by an oracle
- OracleSpecAn oracle spec describe the oracle data that a product (or a risk model) wants to get from the oracle engine.
- OracleSpecConfigurationAn oracle spec describe the oracle data that an instrument wants to get from the oracle engine.
- OracleSpecConfigurationInputAn oracle spec describe the oracle data that a product (or a risk model) wants to get from the oracle engine.
- OracleSpecToFutureBindingOracleSpecToFutureBinding tells on which property oracle data should be used as settlement price.
- OracleSpecToFutureBindingInputOracleSpecToFutureBindingInput tells on which property oracle data should be used as settlement price.
- OrderAn order in Vega, if active it will be on the OrderBook for the market
- OrderEstimateAn estimate of the fee to be paid by the order
- PartyRepresents a party on Vega, could be an ethereum wallet address in the future
- PeggedOrderCreate an order linked to an index rather than a price
- PeggedOrderInputCreate an order linked to an index rather than a price
- PositionAn individual trader at any point in time is considered net long or net short. This refers to their Open Volume, calculated using FIFO. This volume is signed as either negative for LONG positions and positive for SHORT positions. A single trade may end up "splitting" with some of its volume matched into closed volume and some of its volume remaining as open volume. This is why we don't refer to positions being comprised of trades, rather of volume.
- PreparedAmendOrder
- PreparedCancelOrder
- PreparedLiquidityProvisionA prepared LiquidityProvision command
- PreparedProposal
- PreparedSubmitOrder
- PreparedVote
- PreparedWithdrawal
- PriceLevelRepresents a price on either the buy or sell side and all the orders at that price
- PriceMonitoringBoundsRange of valid prices and the associated price monitoring trigger
- PropertyA property associates a name to a value
- PropertyKeyPropertyKey describes the property key contained in an oracle data.
- PropertyKeyInputPropertyKey describes the property key contained in an oracle data.
- Proposal
- ProposalTerms
- ProposalTermsInputProposal terms input. Only one kind of change is expected. Proposals with no changes or more than one will not be accepted.
- ProposalVoteSide
- QueryQueries allow a caller to read data and filter data via GraphQL.
- RiskFactorA risk factor emitted by the risk model for a given market
- SignatureInputA signature to be bundled with a transaction
- StatisticsStatistics about the node
- SubscriptionSubscriptions allow a caller to receive new information as it is available from the VEGA platform.
- TimeUpdate
- TradeA trade on Vega, the result of two orders being 'matched' in the market
- TradeFeeThe fee paid by the party when a trade occurs
- Vote
- WithdrawalThe details of a withdrawal processed by vega
- __DirectiveA Directive provides a way to describe alternate runtime execution and type validation behavior in a GraphQL document. In some cases, you need to provide options to alter GraphQL's execution behavior in ways field arguments will not suffice, such as conditionally including or skipping a field. Directives provide this by describing additional information to the executor.
- __EnumValueOne possible value for a given Enum. Enum values are unique values, not a placeholder for a string or numeric value. However an Enum value is returned in a JSON response as a string.
- __FieldObject and Interface types are described by a list of Fields, each of which has a name, potentially a list of arguments, and a return type.
- __InputValueArguments provided to Fields or Directives and the input fields of an InputObject are represented as Input Values which describe their type and optionally a default value.
- __TypeThe fundamental unit of any GraphQL Schema is the type. There are many kinds of types in GraphQL as represented by the `__TypeKind` enum. Depending on the kind of a type, certain fields describe information about that type. Scalar types provide no information beyond a name and description, while Enum types provide their values. Object and Interface types provide the fields they describe. Abstract types, Union and Interface, provide the Object types possible at runtime. List and NonNull types compose other types.


1 write to operation
Microsoft.Management.Infrastructure.CimCmdlets (1)
CimCommandBase.cs (1)
649
this.
operation
= value;
4 references to operation
Microsoft.Management.Infrastructure.CimCmdlets (4)
CimCommandBase.cs (4)
582
if (this.
operation
!= null)
584
this.
operation
.Dispose();
641
return this.
operation
;
648
Debug.Assert(this.
operation
== null, "Caller should verify that operation is null");


Outfit Picker is an android app that matches your current clothes and gives you suggestions of what to wear, saving you time every morning. After taking pics of your wardrobe, this smart app will show you combinations of outfits to save you time deciding.
This game was developed in a group of four as a hackathon project for Hack the Valley II. Through this project, we gained a better understanding of Android app development in terms of UI, how a database connects with an app, the activity life cycle, etc.
Check it outA simple game of Quadris consists of Board and Blocks. The player can use commands such as “right”, “left”, “down”, “clockwise”, “counterclockwise” and “drop” to manipulate the block, and this will update the display of the board. The player gains points by canceling out a full row, and the game is over when the board overflows just like in traditional Tetris. However, this game is different from Tetris since it is not real time (i.e. blocks do not fall by themselves)
This game was developed in a group of three as our final project for the course CS246. Through this project, we were able to practice coding in C++ as well as implement design patterns that we learned in class.
Code available upon request


--- layout: post title: 'The Wrath of the Judges: 3rd or 20th Place?' date: 2009-10-26 00:00:35.000000000 -05:00 type: post published: true status: publish categories: - 24 Hours of Lemons tags: [] meta: _edit_last: '2' _thumbnail_id: '171' author: login: fivepointoh email<EMAIL_ADDRESS>display_name: Matt first_name: Matt last_name: Cleaver ---
[caption id="attachment_155" align="alignleft" width="300" caption="A 30 lap BS penalty turned our 3rd place finish into 20th place."][/caption]
Going through the BS line at a Lemons race is always an interesting event. We brought our car out for its second race, the only modifications since the last race being some fresh oil. Since we got zero penalty laps at the last race, we were pretty confident we'd be sitting pretty again.
We were wrong.
The judges decided they were going to test cars for limited slip differentials and look for cheaters. We told them we were pretty sure our car had an LSD, but they wanted to see for themselves. We jacked the rear end in the air, spun a tire, watched the other one turn the opposite direction.
We thought, "Sweet." The judges thought "Cheaters."
They were convinced that there wasn't a BMW 325e equipped with an LSD from the factory. We pleaded with them that there was a limited run of 325es (which had the differential), and that, regardless, that was how we bought our hooptie. They didn't buy it, and gave us a 30 lap penalty.
Needless to say, our dreams of finishing up front were dashed with that decree from the high court.
The race was quite uneventful. We had one penalty early in the race that cost us three laps, but after that it was smooth sailing.
We completed 305 laps, which would have put us in 3rd place, 5 laps behind the race winner. Alas, after our 30 lap penalty, we officially finished in 20th place. What could have been.
Stats:


| ASN.1 Support (Internal) | CoAP ASN.1 Structures, Enums and Functions that are not exposed to applications |
| Application I/O Handling | API functions for Application Input / Output |
| Application I/O Handling (Internal) | Internal API functions for Application Input / Output |
| Asynchronous Messaging | API functions for Async "separate" messages |
| Asynchronous Messaging (Internal) | CoAP Async Structures, Enums and Functions that are not exposed to applications |
| Block (Internal) | Structures, Enums and Functions that are not exposed to applications |
| Block Transfer | API functions for handling PDUs using CoAP BLOCK options |
| Cache Support | API functions for CoAP Caching |
| Cache Support (Internal) | CoAP Cache Structures, Enums and Functions that are not exposed to applications |
| Clock Handling | Default implementation of internal clock |
| Context Handling | API functions for handling PDUs using CoAP Contexts |
| Context Handling (Internal) | CoAP Context Structures, Enums and Functions that are not exposed to applications |
| DTLS Support | API functions for interfacing with DTLS libraries |
| DTLS Support (Internal) | CoAP DTLS Structures, Enums and Functions that are not exposed to applications |
| Encode / Decode API | API functions for endoding/decoding CoAP options |
| Event API | API functions for event delivery from lower-layer library functions |
| Logging Support | API functions for logging support |
| Observe Subscription (Internal) | CoAP Observe Subscription Structures, Enums and Functions that are not exposed to applications |
| Option Filters | API functions for access option filters |
| PDU | API functions for PDUs |
| PDU (Internal) | CoAP PDU Structures, Enums and Functions that are not exposed to applications |
| Pseudo Random Numbers | API functions for gerating pseudo random numbers |
| Rate Control | The transmission parameters for CoAP rate control ("Congestion
Control" in stream-oriented protocols) are defined in https://tools.ietf.org/html/rfc7252#section-4.8 |
| Resource Configuraton | API functions for setting up resources |
| Resource Observation | API functions for interfacing with the observe handling (RFC7641) |
| Resources (Internal) | Structures, Enums and Functions that are not exposed to applications |
| Sessions | API functions for CoAP Sessions |
| Sessions (Internal) | CoAP Session Structures, Enums and Functions that are not exposed to applications |
| String handling support | API functions for handling strings and binary data |
| TCP Support (Internal) | CoAP TCP Structures, Enums and Functions that are not exposed to applications |
| URI Parsing Functions | CoAP PDUs contain normalized URIs with their path and query split into multiple segments |


Sage Ren¶
Mission Statement¶
My name is Sage Ren, a junior from UC Berkeley. I am passionate about the intersection of art and technology, specifically generative art and computer vision. I have a strong understanding of BERT, OCR, Image Processing and Image segmentation, GANs and so forth.
Portfolio¶
Email: sage.shijie.ren (at) gmail.com
Github: https://github.com/umbravenus
Website: (OCR, BERT, Visualization, NLP) https://share.streamlit.io/umbravenus/streamlit/main/first_app.py
Website: (Recommendation Engine, CLIP, Text to Image) https://share.streamlit.io/umbravenus/ml4a-streamlit/main/app.py
App: (iOS Augmented Reality app) https://apps.apple.com/us/app/your-photo-in-ar/id1578206631
Work Experience¶
Company: Ancient World Citation Analysis (UC Berkeley)¶
Duration: Jan 2021 - present¶
Title: Undergraduate Student Researcher¶
Collabrated with peers and converted jupyter notebooks into machine learning web apps: https://share.streamlit.io/umbravenus/streamlit/main/first_app.py
Publised Jupyter book for Ancient World Citation Analysis:
Built Optical Character Recognition Model using Pytesseract.
Optimized Text Summarization and Paraphrasing using BERT model.
Configuring image segmentation tools for Ancient Artifacts.
Result: Helped lab deployed machine learning models, finetuned them, and accelerated the milestones of projects.
Company: Byzantine Ivories Imagebank (UC Berkeley)¶
Duration: June 2021 - present¶
Title: Undergraduate Student Researcher¶
Recruited new members and helped with training.
Led members to create documentation and tutorials.
Automated photoshop workflow with python, saved over half of the time and effort.
Created 3D Models from 2D Images using Photogrammetry techniques.
Result: Created several internal web apps for team efficiency, revolutionized the workflow.
Company: DSA Stroke Classification and Segmentation¶
Duration: Jan 2020 - Present¶
Title: Research Assistant¶
Finetuning image segmentation to layout areas of brain where blood flow is lacking or will be lacking.
Building image classification tool to predict whether or not the patient need surgeries.
Working with 100 scholars and peers with data labelling tool to ease daily workload.
Result: Enabled third-world country with less advanced equipments to use machine leanring to their advantage, patent pending.
Company: MuseFinder, San Diego, California¶
Duration: Jan 2017 - Dec 2019¶
Title: Organizer¶
Hosted events for around 500 artists to create a platform that connects artists together, with the goal of having artworks notarized by blockchain eventually.
Able to gain profits through events and gathered around 200 Interviews and numerous data from artists. The events were put on pause after I went back to school for Data Science.
Teaching Experience¶
Academic Intern for Data 8 Foundational Scholars Fall 2021
Academic Intern for Data 8 Summer 2021
SAT tutor for ACME WITTY 2013
Education¶
University of California, Berkeley¶
B.A in Data Science, Minor in Computer Science, Spring 2023
Awards & Achievements¶
Data Scholars, 2020 - Present
Hera Labs Scholarship for Women in Entrepreneurship, 2018, Seeding Cohort
Partner, Startup Leadership San Diego Chapter, 2017-2018
Personal Projects¶
Text to Music And Art Generator¶
Where the user inputs a keyword, and then we use table manipulation as well as search from API to generate art and music.
https://share.streamlit.io/umbravenus/ml4a-streamlit/main/app.py
Your Photo to AR (an iOS app)¶
A simple AR app that lets you see your photo in an AR setting.
Skills¶
Software Engineering, Software Development, Computer Science, Data Structures, Python, SQL, Linux, Git, Version Control, Optimizing Code, Photoshop, Illustrator, Video Editing, Web Development, HTML, CSS, 3D Modeling, 3D Printing, C++, Machine Learning, Computer Vision.


| JIRA | Summary | Priority | Component | Reporter | Contributor |
|---|
| JIRA | Summary | Priority | Component | Reporter | Contributor |
|---|
| JIRA | Summary | Priority | Component | Reporter | Contributor |
|---|
| JIRA | Summary | Priority | Component | Reporter | Contributor |
|---|---|---|---|---|---|
| PIG-4139 | pig query throws error java.lang.NoSuchFieldException: jobsInProgress on MRv1 | Major | . | Suhas Satish | Suhas Satish |
| PIG-4133 | Need to update the default $HCAT_HOME dir in the PIG script. | Minor | grunt | Manikandan Narayanaswamy | Manikandan Narayanaswamy |
| PIG-4106 | Describe shouldn't trigger execution in batch mode | Major | . | Cheolsoo Park | Cheolsoo Park |
| PIG-4083 | TestAccumuloPigCluster always failed with timeout error | Critical | . | fang fang chen | fang fang chen |
| JIRA | Summary | Priority | Component | Reporter | Contributor |
|---|
| JIRA | Summary | Priority | Component | Reporter | Contributor |
|---|
| JIRA | Summary | Priority | Component | Reporter | Contributor |
|---|


In this suspense thriller Michael Duglas is an all work and no joke business man. Duglas who plays a man with no wife only a housekeeper who's known th family since Duglas' character was a kid. In the movie Duglas watches his father leap to his death on his 48th birthday. Now it's duglas' 48th birthday and his brother wants to do something special for him. Something fun. This present was pretty much a game. The company CRS, is a company that plays with your mind(as a viewer and a character). They manipulate Michael Duglas by messing with his life. Sean Penn who is metioned a lot on the commercials is not at all as big a character as you would expect, but he plays his part to the fullest. This is a must see 4 star movie. Probably a few Academy Award nominations. Best character, best screenplay,and best movie.
--
Jonathon Krakower<EMAIL_ADDRESS>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


{% if request.session.playbackAudio %}
{% endif %}
Choose the response that best matches the audio you just recorded.
{% if request.session.allowTypedResponse %}
If your response doesn't match any in the list, then type in your response in the given space. NOTE: if you enter anything in the custom response space, your selection from the given list will be ignored
{% endif %}
{% for response in responses %}
{{response.responseText}}
{% endfor %}
{% if request.session.allowTypedResponse %}


The following sample demonstrates how to use the Repeater Control with an item render function to build a simple bar graph using the a series of progress
elements. The item render function changes the style of the text when an item has a value of 0.


It is a long established fact that a reader will be distracted by the readable content of a page when looking at its layout
It is a long established fact that a reader will be distracted by the readable content of a page when looking at its layoutIt is a long established fact that a reader will be distracted by the readable content of a page when looking at its layout
It is a long established fact that a reader will be distracted by the readable content of a page when looking at its layoutIt is a long established fact that a reader will be distracted by the readable content of a page when looking at its layout
It is a long established fact that a reader will be distracted by the readable content of a page when looking at its layoutIt is a long established fact that a reader will be distracted by the readable content of a page when looking at its layout
It is a long established fact that a reader will be distracted by the readable content of a page when looking at its layoutIt is a long established fact that a reader will be distracted by the readable content of a page when looking at its layoutIt is a long established fact that a reader will be distracted by the readable content of a page when looking at its layoutIt is a long established fact that a reader will be distracted by the readable content of a page when looking at its layout
It is a long established fact that a reader will be distracted by the readable content of a page when looking at its layoutIt is a long established fact that a reader will be distracted by the readable content of a page when looking at its layout
It is a long established fact that a reader will be distracted by the readable content of a page when looking at its layoutIt is a long established fact that a reader will.
Analista de Sistemas, Web Developer & Técnico de Informática.
Analista de Sistemas, Web Developer & Técnico de Informática.
Analista de Sistemas, Web Developer & Técnico de Informática.
It is a long established fact that a reader will be distracted by the readable content of a page when looking at its layoutIt is a long established fact that a reader will be distracted by the readable content of a page when looking at its layoutIt is a long
It is a long established fact that a reader will be distracted by the readable content of a page when looking at its layoutIt is a long established fact that a reader will be distracted by the readable content of a page when looking at its layoutIt is a long
It is a long established fact that a reader will be distracted by the readable content of a page when looking at its layoutIt is a long established fact that a reader will be distracted by the readable content of a page when looking at its layoutIt is a long It is a long established fact that a reader will be distracted by the readable content of a page when looking at its layoutIt is a long established fact that a reader will be distracted by the readable content of a page when looking at its layoutIt is a long.


The moment of Inertia(I), is a quantity
used to represent a body's tendency to resist angular acceleration. It is sometimes referred
to as the 'rotational equivalent' of mass for linear motion.
It is the sum of the mass
of each article in the body with the square of the distance from the axis of rotation. For a
point mass, it can be represented by the following equation:
$$I=m.d^2 $$
While mass is also an important component in
resisting rotational motion, just as in linear motion,
it also shows a large dependence on
the displacement of each point mass from the axis of rotation.
Other rotational quantities
also have linear equivalents, as shown in the table to the right.
| Rotational Motion | Linear Motion |
|---|---|
| $$L=m{d^2} \omega$$ | $$p=mv$$ |
| $$KE_{rot} =\frac{1}{2}m{{v_t}^2}$$ | $$KE_{trans} =\frac{1}{2}mv^2$$ |
| $$\tau=m{d^2}\alpha$$ | $$F=ma$$ |


The Rain is Recurring
For my final project I decided to extend my original sketch I did on depicting the concepts of male and female rain. I really enjoyed working on that project and I wanted to make it a piece that was more informing for the viewers. To do this I extended the sketch by adding more of a conceptual framework to my art. Instead of just a static sketch, I build a site around it. On my site the viewer can access the stories of rain, which inspired my animation piece. The viewer can also enjoy a time lapse visual of a rainy day in Dinétah (Navajo land). Moreover, there is access to more cultural stories, should the viewer feel even more curious after seeing my piece. I wanted to combine the new skills I have obtained in this class with creating a sketch and building a site to display our work. I think this pieces exemplifies that combination as well as the combination of my education and my culture.
View Project


|
||||||||||
| PREV PACKAGE NEXT PACKAGE | FRAMES NO FRAMES |
hivemind
module.
See:
Description
| Class Summary | |
|---|---|
| AbstractFab | Common code for ClassFabImpl and
InterfaceFabImpl . |
| BuilderClassResolverFacet | BuilderFacet whose value is the
ClassResolver of the contributing module. |
| BuilderErrorHandlerFacet | Exposes the invoking module's ErrorHandler to a service as a
constructor parameter or a property. |
| BuilderErrorLogFacet | Exposes the service's error log
as a constructor parameter or a property. |
| BuilderFacet | Represents one facet of constructing a service implementation instance. |
| BuilderFactory | Implementation of ServiceImplementationFactory that can instantiate
an object and then configure its properties. |
| BuilderFactoryLogic | Created by BuilderFactory for each service to be
created; encapsulates all the direct and indirect parameters used to construct a service. |
| BuilderLogFacet | Facet whose value is the Log instance for the service (which is based on the
service id, not the class name). |
| BuilderMessagesFacet | BuilderFacet whose value is the
Messages for the module containing the service being constructed. |
| BuilderParameter | Parameter object used with BuilderFactory . |
| BuilderPropertyFacet | Implementation of BuilderFacet that stores a value. |
| BuilderServiceIdFacet | BuilderFacet whose value is the service id of the
service being constructed. |
| ClassFabImpl | Implementation of ClassFab . |
| ClassFactoryImpl | Implementation of ClassFactory . |
| ClassObjectProvider | Implementation of ObjectProvider that interprets the locator
as a class name and converts it to a Class object. |
| ConfigurationObjectProvider | Implementation of ObjectProvider mapped to prefix
"configuration:" for accessing configurations. |
| CtClassSource | Wrapper around Javassist's ClassPool and our own
ClassFactoryClassLoader that manages the creation of new
instance of CtClass and converts finished CtClass's into instantiable Classes. |
| DefaultsSymbolSource | Implementation of SymbolSource driven off of an extension point. |
| EagerLoader | Implementation of the hivemind.EagerLoad service, which
is contributed into to hivemind.Startup configuration point. |
| EventLinkerImpl | Implementation of EventLinker . |
| EventRegistration | An event registrtion for a service constructed by
BuilderFactory . |
| FactoryDefault | Default symbol value defined by the
hivemind.FactoryDefaults extension point. |
| HiveMindClassPool | Used to ensure that ClassPool.appendClassPath(javassist.ClassPath) is invoked
with a synchronized lock. |
| InterfaceFabImpl | |
| InterfaceSynthesizerImpl | |
| LoggingInterceptorFactory | An interceptor factory that adds logging capability to a service. |
| LoggingUtils | Collection of static methods used by loggers to log method entry and exit. |
| ObjectInstanceObjectProvider | Implementation of ObjectProvider that instantiates a new
instance of a class. |
| ObjectTranslator | Implementation of the indirect translator. |
| ServiceObjectProvider | An ObjectProvider that provides access to services. |
| ServicePropertyObjectProvider | ObjectProvider implementation
that obtains a named property from a service. |
| ThreadEventNotifierImpl | Implementation of ThreadEventNotifier , available as service
hivemind.ThreadEventNotifier . |
| ThreadLocaleFactory | Specialized factory used to create instances of
ThreadLocaleImpl (i.e., service hivemind.ThreadLocale). |
| ThreadLocaleImpl | |
| ThreadLocalStorageImpl | Implementation of ThreadLocalStorage . |
Implementations of services provided by the hivemind
module.
|
||||||||||
| PREV PACKAGE NEXT PACKAGE | FRAMES NO FRAMES |


Midaq Alley / translated from Arabic by Trevor Le Gassick. – Cairo : The American University in Cairo Press, cop. 1966
God's World : an Anthology of Short Stories / transl. with an introd. by Akef Abadir and Roger Allen. – Minneapolis : Bibl. Islamica, 1973
Mirrors : a novel / transl. from the Arabic by Roger Allen. – Minneapolis : Bibl. Islamica, 1977
Miramar / edited and revised by Maged el Kommos, John Rodenbeck ; translated by Fatma Moussa Mahmoud. – Cairo : The American University in Cairo Press, 1978
Children of Gebelawi / transl. by Philip Stewart. – London : Heinemann, 1981
The Thief and the Dogs / translated by Trevor Le Gassick, M.M. Badawi ; revised by John Rodenbeck. – Cairo : The American University in Cairo Press, 1984
Wedding Song / introduction by Mursi Saad El Din, translated from Arabic by Olive E. Kenny ; edited and revised by Mursi Saad El Din and John Rodenbeck. – Cairo : The American University in Cairo Press, 1984
Autumn Quail / translated by Roger Allen ; revised by John Rodenbeck. – Cairo : The American University in Cairo Press, 1985
The Beginning and the End / edited by Mason Rossiter Smith ; translated by Ramses Awad. – Cairo : The American University in Cairo Press, 1985
The Beggar / translated by Kristin Walker Henry and Nariman Khales Naili al-Warraki. – Cairo : The American University in Cairo Press, 1986
Respected Sir / translated by Rasheed El-Enany. – Cairo : The American University in Cairo Press, 1987
The Search / edited by Magdi Wahba translated by Mohamed Islam. – Cairo : The American University in Cairo Press, cop. 1987
Fountain and Tomb / translated from the Arabic by Soad Sobhy, Essam Fattouh, James Kenneson. – Washington, D.C. : Three Continents Press, 1988
The Day the Leader Was Killed : a novel / translated with an introduction by Malak Hashem. – Cairo : General Egyptian Book Organization, 1989
Palace Walk / translated by William M. Hutchins and Olive E. Kenny. – Cairo : The American University in Cairo Press, 1989
Palace of Desire / translated by William Maynard Hutchins, Lorne M. Kenny, Olive E. Kenny. – London : Doubleday, 1991
The Time and the Place and Other Stories / selected and translated by Denys Johnson-Davies. – New York : Doubleday, 1991
The Journey of Ibn Fattouma / translated by Denys Johnson-Davies. – New York : Doubleday, 1992
Sugar Street / translated by William Maynard Hutchins and Angele Botros Samaan. – New York : Doubleday, 1992
Adrift on the Nile / translated by Frances Liardet. – New York : Doubleday, 1993
The Harafish / translated by Catherine Cobham. – New York : Doubleday, 1994
Arabian Nights and Days / translated by Denys Johnson-Davies. – London : Doubleday, 1995
Children of the Alley / translated by Peter Theroux. – New York : Doubleday, 1996
Echoes of an Autobiography / translated by Denys Johnson-Davies. – New York : Doubleday, 1997
Akhenaten, Dweller in Truth / translated by Tagreid Abu-Hassabo. – New York : Anchor Books, 2000
The Cairo Trilogy / translated by William Maynard Hutchins ... [et al.] ; with an introduction by Sabry Hafez. – New York : Knopf, 2001. – Content: Palace walk ; Palace of desire ; Sugar street
Naguib Mahfouz at Sidi Gaber : Reflections of a Nobel laureate, 1994-2001 : from Conversations with Mohamed Salmawy . – Cairo : The American University in Cairo Press ; Chichester : Wiley, 2001
Khufu's Wisdom / translated by Raymond Stock. – Cairo : The American University in Cairo Press, 2003
Rhadopis of Nubia / translated by Anthony Calderbank. – Cairo : The American University in Cairo Press, 2003
Thebes at War / translated by Humphrey Davies. – Cairo : The American University in Cairo Press, 2003
Voices from the Other World : Ancient Egyptian Tales / translated by Raymond Stock. – Cairo : The American University in Cairo Press ; London : Eurospan, 2003
The Dreams / translated by Raymond Stock. – Cairo : The American University in Cairo Press, 2004
Life's Wisdom : From the Works of the Nobel Laureate / edited by Aleya Serour. – Cairo : American Univ. in Cairo Press, 2006
Dreams of Departure : the Last Dreams Published in the Nobel laureate's Lifetime / translated by Raymond Stock. – Cairo : American Univ. in Cairo Press, 2007
Karnak Café / translated by Roger Allen. – Cairo : American Univ. in Cairo Press, 2007
Morning and Evening Talk / translated by Christina Phillips. – Cairo : American Univ. i Cairo Press, 2007
Cairo Modern / translated by William M. Hutchins. – Cairo : American Univ. in Cairo Press, 2008
The Mirage / translated by Nancy Roberts. – Cairo : American University in Cairo Press, 2009
The Essential Naguib Mahfouz / edited and translated by Denys Johnson-Davies. – Cairo : American University in Cairo Press, 2011
The Coffeehouse / translated by Raymond Stock. – Cairo : American University in Cairo Press, 2010
The Wisdom of Naguib Mahfouz : From the Works of the Nobel Laureate / edited by Aleya Serour. – Cairo : American University in Cairo Press, 2011
Love in the Rain / translated by Nancy Roberts. – Cairo : American University in Cairo Press, 2011
Khan Al-Khalili / translated from the Arabic by Roger Allen. – New York : Anchor Books, 2011
Heart of the night / translated by Aida A. Bamia. – Cairo : American University in Cairo Press, 2011
"The Nobel Prize has given me, for the first time in my life, the feeling that my literature could be appreciated on an international level."
If you have time, you should read more about this incredible writer on his Wikipedia entry.


Human-readable HTML reports of converted fastq.gz (generated from data in the DemultiplexingStats.xml and ConversionStats.xml)


Quiz Board
What is jquery?
Library
Language
What is the js in full?
jquery
javascript
Is c++ a low level langage?
yes
no
Can javascript be used on server side?
yes
no
Is javascript a high or low level language?
high
Low
Submit


chordex
Chordex 1.0
General
This project visualizes the relations between different scientists of the media informatics faculty of the LMU Munich. Chordex was written by Yannick Gladow and Benjamin Sauer in the context of the LMU lecture Information Visualization in the winter semester of 2014/2015.
Technologies
Chordex is based upon the MI publication database and to allow an easier handling of the raw data, the pubdb_to_json_converter written by Alexander Schenker has been used. The website itself was build using Twitter Bootstrap and the graph heavily relies on the Chord Layout of d3js. If you want to extend or base other works on this project, feel free to fork us on GitHub!
How to use
Either use the different sliders at the bottom of the page to adjust the filter settings directly, or click "Redraw Graph" to redraw. If no graph is drawn, you either have to wait a little or there are no relations matching your filter criteria. Hint: Since the earlier years (1994-2000) don't contain a lot of data, there's a good chance, you will not find a lot of information there...
Sorry, no data matches your filter criteria! Please check your filter settings!
The chord diagram
Chord diagrams show relationships among a group of entities. In this example visualizing the PubDb, a database containing the paper-releases of the MI-faculty of the lmu. Use the filters on the right to only display people who (co-)wrote a certain amount of publications and/or worked with at least a specified number of people in a certain year. Single-author publications will be generously ignored.
Filters
Year
1994 2015Publications
1 200Number of collaborations
1 50


Detecting Depression using EEG Signals
Enter the values of corresponding channels of corresponding Band power.
(Alpha & Theta)
Predict
{{ prediction_text }}


1. CAT [삼색이] [은돌이] 2. DOG [우유] [아지] 3. SEVENTEEN Click to view full music video [Ready to love - Seventeen] 4. SINGING [Ready to love - Seventeen]


bioRad aims to provide standardized methods for extracting and reporting biological signals from weather radars. It includes functionality to inspect low‐level radar data, process these data into meaningful biological information on animal speeds and directions at different altitudes in the atmosphere, visualize these biological extractions, and calculate further summary statistics.
To get started, see:
You can install the released version of bioRad from CRAN with:
install.packages("bioRad") # Coming soon!
Alternatively, you can install the latest development version from GitHub with:
devtools::install_github("adokter/bioRad")
Then load the package with:
library(bioRad)
#> Welcome to bioRad version <IP_ADDRESS>60
#> Docker daemon running, Docker functionality enabled.
You only need to install Docker to:
read_pvolfile()
. Docker is not required for reading ODIM radar data.nexrad_to_odim()
.calculate_vp()
.Why? bioRad makes use of a C implementation of the vol2bird algorithm through Docker to do the above. All other bioRad functions will work without a Docker installation.
Installing Docker
check_docker()
.bioRad can read weather radar data (= polar volumes) in the ODIM
format and formats supported by the RSL library, such as NEXRAD data. NEXRAD data (US) are available as open data and on AWS.
Here we read an example polar volume data file with read_pvolfile()
, extract the scan/sweep at elevation angle 3 with get_scan()
, project the data to a plan position indicator with project_as_ppi()
and plot the radial velocity of detected targets with plot()
:
library(tidyverse) # To pipe %>% the steps below
system.file("extdata", "volume.h5", package = "bioRad") %>%
read_pvolfile() %>%
get_scan(3) %>%
project_as_ppi() %>%
plot(param = "VRADH") # VRADH = radial velocity in m/s
Radial velocities towards the radar are negative, while radial velocities away from the radar are positive, so in this plot there is movement from the top right to the bottom left.
Weather radar data can be processed into vertical profiles of biological targets using calculate_vp()
. This type of data is available as open data for over 100 European weather radars.
Once vertical profile data are loaded into bioRad, these can be bound into time series using bind_into_vpts()
. Here we read an example time series, project it on a regular time grid with regularize_vpts()
and plot it with plot()
:
example_vpts %>%
regularize_vpts() %>%
plot()
#> projecting on 300 seconds interval grid...
The gray bars in the plot indicate gaps in the data.
The altitudes in the profile can be integrated with integrate_profile()
resulting in a dataframe with rows for datetimes and columns for quantities. Here we plot the quantity migration traffic rate (column mtr
) with plot()
:
my_vpi <- integrate_profile(example_vpts)
plot(my_vpi, quantity = "mtr") # mtr = migration traffic rate
To know the total number of birds passing over the radar during the full time series, we use the last value of the cumulative migration traffic (column mt
):
my_vpi %>%
pull(mt) %>% # Extract column mt as a vector
last()
#> [1] 173023.8
For more exercises, see this tutorial.
bioRad
in R doing citation(package = "bioRad")
.


{% extends "app/layout.html" %} {% load staticfiles %} {% load bootstrap_components %} {% block content %}
No agricultural data has been entered for this scenario yet.