FOIL Request Stats
This chart represents the aggregate data of all
requests opened on OpenRecords, along with the status of all requests.
{{ report_filter_form.agency.label(for="agency-filter") }}
{% if current_user.is_agency %}
This allows the graph to be filtered by the number of requests assigned to a specific agency.
{{ report_filter_form.agency(id="agency-filter", class="input-block-level") }}
{{ report_filter_form.user.label(for="agency-user-filter") }}
{% endif %}
This allows the graph to be filtered by the requests assigned to specific users.
{{ report_filter_form.user(id="agency-user-filter", class="input-block-level") }}Agency Reports
FOIL Request Acknowledgement Status
Monthly FOIL Metrics
This report contains metrics and raw data for:
- Requests received for the given month
- Total requests remaining from the given month
- Requests that were received and closed in the same given month
- Total requests closed in the given month
- Total requests closed since the creation of the portal
- Total requests that remain Open/Pending
- Number of inquiries received in the given month regarding requests


Thi setting tells OneDev how to transform commit message for displaying.
Search For expects a
Java pattern
to match in the commit message, for instance, you may match JIRA issue key with
([A-Z]{2,}-\d+), and specify
Replace With as
$1 to replace JIRA issue
keys with issue links. Here
$n represents nth capturing group in the pattern


Employee Information Managment
First Name:
Last Name:
Employee Number:
Title:
Last Review Score:
Salary:
Reset the form!


Welcome to my web page. Here you'll find all sorts of things about me.
You can find information on my books here as well.


Hello! Welcome to our app! Please log in to view navigational links.
Once logged in, click the links above to move throughout the site.
- Home takes you back here
- Your Page takes you to your page, where you can post messages, and get your URL for sharing your page (Note: you can visit other user pages if you have their URL)
- About Our Team tells you a little bit about us
- Chart lets you view a fun chart relating happiness to freedom
- Map is an interactive map where you can place map markers for other users to see
- Site Community is a list of all active users on the site
- Message Feed shows all messages that have been posted to the site
- Site Stats diaplays some statistics about the site
- Logout will log you out of the site
This site is designed to help people find other people to hang out with! We hope to help you make some super meaningful connections, and make the world a better place in the process!


My PhD dissertation topic involved datamining Mozilla and KDE, two large Open Source communities. Through analysis of Git version control history, email mailing lists, and source code files, this parsed information was stored in the graph database Neo4j. Using Social Technical Congruence (STC) as a core starting point, three algorithms were developed to help developers better understand the social and technical structure of software development. The field of Social Technical Congruence (Cataldo et al. 2006) attempts to understand and model the synergies between technical development and communication. It is able to identify gaps in the communication structure based on shared technical dependencies of developers to help minimize future bugs and keep up with changes. Three novel algorithms were developed to help developers:
The three algorithms were implemented in a program and website called Jamii. The program provides all backend processing of data from source code version control and email mailing lists as well as visualization. The Jamii website was then tested against the same two communities. Two surveys examining Mozilla and KDE were performed that gathered qualitative and quantitative data. The first survey gathered demographic and perceptual differences in socialization between beginner and veteran members. The second survey investigated the perceived usefulness of the website as well as the potential for improving the socialization process.


When you are building some construction site, what is one of the first things you need to plan and organize your building? It's a blueprint of course. The programming language, Ruby has its own blueprint plan and we call it a Class. Each Class can have objects created from the Class blueprint . With each created, or instantiated Class, it has its own data (think of this as nouns in a sentence) and its own methods (or verbs in a sentence). Say we want to build a Class blueprint for NFL Players.
Here is how we create a class (lines 1 through 13 are creating the NFLPlayer class). Notice the name and the initialize method. Whenever we create/initialize an NFLPlayer from the blueprint, we need to send it the name and the positing of the player. Example given I want to create an object (or "player") using the NFLPlayer blueprint. I want to create a franchise_quaterback object so I would write it like this: franchise_quarterback = NFLPlayer.new("Peyton Manning", "Quarterback")
Please see the code image example on the right.
The attr_accessor :name, :position
is just a fancy way of saving that I can read or get the name of each NFLPLayer but I can also write or set the name of each NFLPlayer as well. A good example case of this would be Chad Johnson, a former NFL player. When he started in the NFL his official name was "Chad Johnson". However he decided to change his name to "Ocho CInco". With the attr_accessor :name
, we are able to write or set a different name than what he began his NFLPlayer with. By the way, attr is just attribute, which is a fancy way of saying data and variables.
You may have notice the @ symbol before the @name = name
@position = position
The @ just means that the variable used is an instance variable. When we create something from a Class, we are creating an instance of that Class. An instance variable means that all created objects of that NFLPlayer class will share the same variables of name and position. This means that all NFLPlayers must have a name and a position.


Position coordinates are measured in pixels starting from top-left corner of your primary monitor. Active position coordinates are used when the game is active and inactive coordinates when the game is alt-tabbed. Use the same numbers for both fields if you don't want to move the overlay when the game is alt-tabbed. To have the overlay positioned in secondary monitor right to your primary monitor increase the width, to move the overlay to left monitor relative to your primary monitor decrease the width to negative value. Lets have a look at the following example:
Overlay width is always 765 pixels and height normally is 200 pixels but may be extended up to 245 pixels to show additional message. Given that all 3 monitors have the resolution of 1920 x 1080 pixels then to position overlays like shown in the image the coordinates would be following.
- 1. Left: 0, Top: 0
- 2. Left: 3075 (2 x 1920 - 765), Top: 835 (1080 - 245)
- 3. Left: -1920 (0 - 1920), Top: 835 (1080 - 245)


1.6.0 / 2016-10-03
- Populate
RegExp.keys
when using the tokensToRegExp
method (making it consistent with the main export)
- Allow a
delimiter
option to be passed in with parse
- Updated TypeScript definition with
Keys
and Options
updated
1.5.3 / 2016-06-15
- Add
\\
to the ignore character group to avoid backtracking on mismatched parens
1.5.2 / 2016-06-15
- Escape
\\
in string segments of regexp
1.5.1 / 2016-06-08
- Add
index.d.ts
to NPM package
1.5.0 / 2016-05-20
- Handle partial token segments (better)
- Allow compile to handle asterisk token segments
1.4.0 / 2016-05-18
- Handle RegExp unions in path matching groups
1.3.0 / 2016-05-08
- Clarify README language and named parameter token support
- Support advanced Closure Compiler with type annotations
- Add pretty paths options to compiled function output
- Add TypeScript definition to project
- Improved prefix handling with non-complete segment parameters (E.g.
/:foo?-bar
)
1.2.1 / 2015-08-17
- Encode values before validation with path compilation function
- More examples of using compilation in README
1.2.0 / 2015-05-20
- Add support for matching an asterisk (
*
) as an unnamed match everything group ((.*)
)
1.1.1 / 2015-05-11
- Expose methods for working with path tokens
1.1.0 / 2015-05-09
- Expose the parser implementation to consumers
- Implement a compiler function to generate valid strings
- Huge refactor of tests to be more DRY and cover new parse and compile functions
- Use chai in tests
- Add .editorconfig
1.0.3 / 2015-01-17
- Optimised function runtime
- Added
files
to package.json
1.0.2 / 2014-12-17
- Use
Array.isArray
shim
- Remove ES5 incompatible code
- Fixed repository path
- Added new readme badges
1.0.1 / 2014-08-27
- Ensure installation works correctly on 0.8
1.0.0 / 2014-08-17
0.2.5 / 2014-08-07
- Allow keys parameter to be omitted
0.2.4 / 2014-08-02
- Code coverage badge
- Updated readme
- Attach keys to the generated regexp
0.2.3 / 2014-07-09
0.2.2 / 2014-07-06
- A passed in trailing slash in non-strict mode will become optional
- In non-end mode, the optional trailing slash will only match at the end
0.2.1 / 2014-06-11
- Fixed a major capturing group regexp regression
0.2.0 / 2014-06-09
- Improved support for arrays
- Improved support for regexps
- Better support for non-ending strict mode matches with a trailing slash
- Travis CI support
- Block using regexp special characters in the path
- Removed support for the asterisk to match all
- New support for parameter suffixes -
*
, +
and ?
- Updated readme
- Provide delimiter information with keys array
0.1.2 / 2014-03-10
- Move testing dependencies to
devDependencies
0.1.1 / 2014-03-10
- Match entire substring with
options.end
- Properly handle ending and non-ending matches
0.1.0 / 2014-03-06
0.0.2 / 2013-02-10
- Update to match current express
- Add .license property to component.json


Event Location:
Consorzio Universitario di Pordenone
Via Prasecco, 3/a
Pordenone, Friuli, Italy
Abstract:
Data science can be hard to grasp, complex and big, but making data science easy to understand and bringing it closer to all who want to tackle this new emerging field is an important task in world of data. Exploring, extracting and finding hidden gems from data using statistical and mathematical methods, computer science and several different technologies is essentially what data science is doing. In practice this means, data science is an iterative process of harvesting data, managing and cleaning the data, performing analysis and and at the end interpreting, visualizing and using information that will bring insights to end-user, business people and making decisions much easier. We will focus on answering 5 simple questions. 1) is this weird? 2) is A better than B, respectively? 3) how much / many of this is needed? 4) this belong to group A? 5) what is next? Session we will look into technologies that can be tackled using SQL Server 2016 and ML Azure.
Speaker(s): Tomaž Kaštrun,
Abstract:
Text mining is becoming more and more popular. Everybody would like to understand data from blogs, Web sites, and social media. Microsoft SQL Server in versions 2012 and 2014 enhances full-text search support that was substantially available in previous editions. Semantic Search, a new component in Full-Text Search, can help you understanding the meaning of documents. The Term Extraction and Term Lookup components from SQL Server Integration Services also help with text analysis. Free statistical package / language R is also useful for the text mining tasks. Azure ML is adding additional techniques to the big picture. However, the question arises: is all this enough? This presentation unveils the good and the bad side of text mining with the tools mentioned.
Speaker(s): Dejan Sarka,
Abstract:
Data quality and data consistency today are big concerns for people working with databases. Data Quality Services (DQS) is a feature introduced in SQL Server 2012, that aims to give users and IT professionals a simple and flexible solution to these problems. It allows to perform cleansing operation on bad data such as: correction, standardization, completion and de-duplication. In this session we'll introduce the main concepts of DQS, and its components. We'll see how to create and build a Knowledge Base, how to implement a Data Quality Project, how to define and manage a Domain. Starting from real world example, we'll learn how to perform Data Cleansing and Matching and how to define business rules to verify and mantain data integrity. For those who are working with SQL Server versions prior to 2012, we'll show some tasks and techniques to implement data quality, exploiting other SQL Server's suite tools, although DQS is not yet available.
Speaker(s): Andrea Martorana Tusa,
Abstract:
Let’s face it: Best Practices are too many to really know them all and choose which ones should be applied first. Does your telephone ring all the time? Do your users ask for that “quick report” that instead takes ages and keeps changing every time you think it’s done? Have you ever thought that in dire times avoiding Worst Practices could be a good starting point and you can leave fine tuning for a better future? If the answer is “yes”, then this session is for you: we will discover together how not to torture a SQL Server instance and we will see how to avoid making choices that in the long run could turn out to be not as smart as they looked initially.
Speaker(s): Gianluca Sartori,
Abstract:
La prima apparizione dei ColumnStore Indexes risale a SQL Server 2012 e, nel corso degli anni, l'aggiunta di numerose funzionalità quali indici aggiornabili e continuo incremento delle performance li hanno resi una scelta appetibile in ambito Enterprise sia per carichi di lavoro DWH che OLTP. Il recente Service Pack 1 di SQL Server 2016, inoltre, estende l'adozione dei CI con le dovute limitazioni in termini di risorse a tutte le edizioni, Express compresa. In questa sessione verranno introdotti i Columnstore Indexes, concentrandosi sulle differenze rispetto ai tradizionali B-Tree, su come utilizzarli al meglio e sulle attenzioni da prestare nel passaggio tra le varie versioni ed edizioni di SQL Server.
Speaker(s): Francesco Milano,
Abstract:
When you need to extract data from the database you are writing, more or less complex, T-SQL code. Often simplistic and procedural approach reflects what you have in your mind, however this could have a negatively impact about performance because the database engine might think otherwise. Fortunately T-SQL, as a declarative language, allows us to ask the "what" and delegate to the engine the "how". Everything works best as long as you respect a few simple rules and you may use special constructs. In this session, with few slides and a lot of real-case scenarios, you can see the advantages of writing the query for high performance, even when they are written by that "someone else" called ORM.
Speaker(s): Emanuele Zanchettin,
Abstract:
SQL Server transaction log is one of the most critical components of the database and in the same time one of the most misunderstood. While being neglected it can easily become a bottleneck for our system. Are you interested in learning how to avoid issues with the transaction log and streamline its work? In these sessions we will explore how to optimize it, configure it and keep it under control.
Speaker(s): Miroslav Dimitrov,
Abstract:
Un modello dei dati relazionale si avvale di indici di varia natura per elevare il grado di efficienza delle queries. Ma lo strumento che l'Engine utilizza per individuare se e quali indici possano soddisfare al meglio una query è l'insieme delle statistiche allestite sulle tabelle e sugli indici. Questa sessione prova ad illustrare il legame tra le due entità e il modo in cui l'ottimizzatore può trarre vantaggio o essere "ingannato".
Speaker(s): Gilberto Zampatti,
Abstract:
Azure Analysis Services (Azure AS) was released in Public Preview and it gives us possibilities to create full-managed Cloud BI solution without using on-premise servers or VMs, installing and configuring any software. Now, we have full set of PAAS and SAAS services like Azure SQL DWH, Azure AS and Power BI for creating our BI solutions. In this session I will introduce Azure AS and how we can use it together with other Azure services for creating complete BI solution in the cloud.
Speaker(s): Sergiy Lunyakin,
Abstract:
Dopo una breve introduzione rivolta a chi non avesse ancora approcciato questa nuova feature di SQL Server 2016 si procederà all'analisi delle tecniche per fare della adeguata manutenzione in scenari critici in cui la tabella storica è destinata a crescere in modo (quasi) esponenziale.
Speaker(s): Pasquale Ceglie,
Abstract:
In questa sessione vedremo come preparare la "cassetta degli attrezzi" per effettuare il performance tuning delle query, quali sono gli approcci più efficaci per identificare ed isolare le query più problematiche ed esamineremo le cause più comuni e le relative soluzioni per velocizzare il nostro SQL Server.
Speaker(s): Danilo Dominici,
Abstract:
What are these DATA Scientists up to? How can we see their statistical model in our day to day familiar tool like Microsoft SQL Server? You now have answers to these questions and thanks to Microsoft for integrating R Revolution within new SQL Server 2016. We all now have the opportunity to use R packages and see the results within SQL 2016. In this session, you will definitely take away a breakthrough concept of Advanced R Analytics within SQL 2016 and get ready to kick your creative horse, and go beyond your imagination on how you can build advanced analytics and impress your employers/customers.
Speaker(s): Dr. Subramani Paramasivam,
Abstract:
In order to ascertain the abilities of cloud computing platform, let us overview what is available offered on Microsoft Azure. Microsoft Azure has the ability to move, store and analyze data within the cloud. It is essential to evaluate multiple opportunities and options with Microsoft Azure data insights. In this session let us talk about strategies on data storage, data partitioning and availability options with Azure. A tour on how best these Azure components can help you achieve success for your Big Data platform.
Speaker(s): Satya Jayanty,
Abstract:
Anche il mondo dei database relazionali risente della cultura DevOps. Sarebbe strano il contrario, possiamo fare unit test, possiamo metterlo in scenari di continuous integration, possiamo automatizzare i processi sfruttando sia piattaforme as a service che on premises. In questa sessione proveremo ad implementare una soluzione completa, con tanto di deploy su diversi ambienti, fino alla produzione, il tutto seguendo pratiche DevOps ed utilizzando VSTS ed i suoi plugin. Un walkthrough verso il delivery automatizzato.
Speaker(s): Alessandro Alpi,
Abstract:
SQL Server 2016 e Azure SQL Database hanno introdotto svariate nuove funzionalità legate alla sicurezza. In questa sessione faremo brevemente il punto sulle varie tecnologie disponibili per poi entrare più in dettaglio nelle nuove funzionalità di Data Masking, Row Level Security e Always Encrypted con l'ausilio di dimostrazioni pratiche.
Speaker(s): Gianluca Hotz,
Abstract:
In questa sessione esploreremo la Plan Cache, la zona in cui SQL Server memorizza i piani di esecuzione. Si parlerà di come viene gestita e delle tecniche che permettono di scoprire quali sono i piani di esecuzione in cache, da quanto tempo risiedono lì, quante volte sono stati utilizzati e se contengono operatori sub-ottimali come scansioni, operazioni di ordinamento eseguite nel tempdb e altri tipi di warning. Sapere quello che è successo permetterà di sapere cosa è necessario ottimizzare.
Speaker(s): Sergio Govoni,
Abstract:
Optimizing Dax
Speaker(s): Marco Pozzan,
Abstract:
What's new on SQL Azure?
Speaker(s): Marco Parenzan,
This is a list of speakers from the XML Guidebook records. The details and URLs were valid at the time of the event.
LinkedIn: https://www.linkedin.com/in/slunyakin
Contact: https://slunyakin.wordpress.com
Sergiy Lunyakin (MCSA, MCSE, MCTS) is a Big Data Architect at SoftServe, Inc. He has extensive experience in designing and developing Big Data Analytics, Data Warehouse, and BI solutions, using both on-premises and cloud products. In 2016, Sergiy became Microsoft Data Platform MVP and has since maintained his MVP status. Sharing knowledge is another one of his passions. He regularly speaks at international conferences such as SQLSaturday, SQLDay, SQLNexus, and SQLBits. He also runs the Lviv SQL Server User Group in Ukraine and organizes SQLSaturday Lviv.
LinkedIn: http://it.linkedin.com/pub/emanuele-zanchettin/18/921/34/
Emanuele Zanchettin, after studying in Computer Engineering, began his career with DB2 in the banking sector in 1998. After a few years and a change of scope of application, he encountered Access and Oracle with which he subsequently worked for several years in data access tuning and database design for new application features. Since 2007 he has also launched into the SQLServer world 2K, 2005, 2008* and 201* and more importantly, since 2011, into Azure SQL Database (SQL Azure). In order to have a greater capacity for assessment and familiarity with the various technologies that the market offers, he has deepened his knowledge to include MySQL and DocumentDB. Today Emanuele is mainly involved in IT projects and database management.
Danilo Dominici, lavora con SQL Server sin dalla versione 6.5. Si occupa principalmente di progettazione, implementazione ed ottimizzazione architetturale, monitoring e performance tuning. Alterna le attivit#224; di consulenza a quelle di formatore, speaker ed autore. Microsoft Certified Trainer dal 2000 e SQL Server MVP dal 2014, #232; anche co-leader del PASS Global Italian Virtual Chapter, lo user group quot;virtualequot; in lingua italiana dedicato a SQL Server.
LinkedIn: http://www.linkedin.com/in/sgovoni
Contact: https://mvp.microsoft.com/it-it/PublicProfile/4029181?fullName=Sergio%20Govoni
Since 1999 Sergio Govoni has been a software developer; in 2000 he got a degree in Computer Science at "Università degli Studi" in Ferrara (Italy). He has worked for over 18 years in Centro Software, a software house that produces the best ERP for manufacturing companies that are export oriented. Now, he manages the development product team and he is constantly involved on several team projects, where he focues his attention on the architecture and the mission-critical technical details. Since 2016 he is the vice president of the UGISS (www.ugiss.org). For the provided help to technical communities and for sharing his own experience, since 2010 he has received the Microsoft Data Platform MVP award.
Time ago (a lot of time ago…) an excellent IT pro brought me with him and became my Mentor in the IT wonderland…it was a world full of mainframes… I met the Relational theory when there were no commercial RDBMS, and I was spellbound by that “magic”. When Microsoft appeared in the IT market, I felt finally which trek I had to follow. I’m still walking on such road, and in my rucksack I’ve ben putting some other stuff (like SharePoint, for example). My sole regret: I’ve left the College to consecrate all my time to my job; curiously, since then, I’ve never stop learning…
Andrea Martorana Tusa is a Business Intelligence Team Manager at Würth Phoenix, the IT and consulting company of the Würth-Group. He is awarded as MVP in the Data Platform category Former BI Specialist at Widex, a Danish manufacturing company, and BI Developer in the IT department of an Italian banking group. 20+ years of experience working with data. He is focused on the entire BI stack: database development, data warehousing, data analysis, reporting, etc. Andrea is a usual speaker at many events: SQLSaturdays, conferences in Europe and PASS Summit, and for PASS Virtual Groups. Andrea is an author for sqlshack.com, sqlservercentral.com, and UGISS (User Group Italiano SQL Server).
LinkedIn: https://uk.linkedin.com/sqlmaster
Contact: http://www.sqlserver-qa.net
My experience surrounded with high focus on the data platform with a track record of defining strategy, designing and delivering digital transformation migrations with major enhancements to current working methods. Worked in a capacity of Head of Data Engineering, Enterprise Data Architect and Solutions Key career accomplishment recognition as an industry expert technical excellence from the Microsoft as Data Platform Most Valuable Professional (MVP) recognition since the year 2006 (13 years as MVP and counting), which recognizes exceptional technical community leaders worldwide who actively deliver, present share their extraordinary contributions, high quality, and real-world expertise. Twitter pod (http://twitter.com/sqlmast
Contact: http://blogs.solidq.com/dsarka/Home.aspx
Dejan Sarka, MCT and Data Platform MVP, is an independent trainer and consultant that focuses on development of database and business intelligence applications. Besides projects, he spends about half of his time on training and mentoring. He is the founder of the Slovenian SQL Server and .NET Users Group. Dejan Sarka is the main author or co-author of eighteen books about databases and SQL Server. Dejan Sarka has also developed many courses and seminars for Microsoft, Radacad, SolidQ, and Pluralsight.
LinkedIn: http://www.linkedin.com/in/sgovoni
Contact: https://mvp.microsoft.com/it-it/PublicProfile/4029181?fullName=Sergio%20Govoni
Since 1999 Sergio Govoni has been a software developer; in 2000 he got a degree in Computer Science at "Università degli Studi" in Ferrara (Italy). He has worked for over 18 years in Centro Software, a software house that produces the best ERP for manufacturing companies that are export oriented. Now, he manages the development product team and he is constantly involved on several team projects, where he focues his attention on the architecture and the mission-critical technical details. Since 2016 he is the vice president of the UGISS (www.ugiss.org). For the provided help to technical communities and for sharing his own experience, since 2010 he has received the Microsoft Data Platform MVP award.
LinkedIn: http://uk.linkedin.com/in/dageop
Contact: http://www.yoursqlman.com/index.php/blogs
Dr.SubraMANI Paramasivam is a Microsoft MVP, PhD, Microsoft Certified Trainer and Head of Data AI at DAGEOP Ltd having 21 years of DB, BI, Analytics and AI experience. Mani has also spoken in various events like MS IGNITE, PASS Summit, MS Inspire, SQLBITS, Power Platform Summit, Global AI Bootcamp, Data BI Summit, SQLRelay, Power BI World Tour, Data Platform Summit, INSIDESQL UK, Global AI Nights, SQLServerGeeks Summit, MCT Global Summits, Data Day Events and various user group events. Mani also believes in Empowering Every Person in the planet and spreads the awareness on Global challenges via www.EmpoweringEveryPerson.com. He is also a co-owner of 1 Global AI Meetup and 3 Power BI PUG PASS local / user groups.
LinkedIn: https://www.linkedin.com/in/slunyakin
Contact: https://slunyakin.wordpress.com
Sergiy Lunyakin (MCSA, MCSE, MCTS) is a Big Data Architect at SoftServe, Inc. He has extensive experience in designing and developing Big Data Analytics, Data Warehouse, and BI solutions, using both on-premises and cloud products. In 2016, Sergiy became Microsoft Data Platform MVP and has since maintained his MVP status. Sharing knowledge is another one of his passions. He regularly speaks at international conferences such as SQLSaturday, SQLDay, SQLNexus, and SQLBits. He also runs the Lviv SQL Server User Group in Ukraine and organizes SQLSaturday Lviv.
LinkedIn: http://it.linkedin.com/pub/gianluca-sartori/23/50b/a12
Contact: http://spaghettidba.com
Gianluca Sartori is a Data Platform MVP, independent consultant and performance tuning specialist. He has been working in the software industry since 1999 and has been working with SQL Server ever since. He also works as a SQL Server trainer and in his spare time he writes technical articles and participates the SQL Server forums. Gianluca enjoys presenting SQL Server topics at conferences in Europe and in Italy in particular. He is currently working as lead DBA at a famous Formula 1 team.
LinkedIn: https://it.linkedin.com/in/suxstellino
Contact: http://suxstellino.wordpress.com/
Alessandro lavora nell#39;IT dal 2000. La passione per l#39;informatica nasce ad 11 anni partendo dal C64 ed oggi #232; CTO di Engage IT Services srl dove si occupa della gestione del team di sviluppo e del contatto tecnico con i clienti. Nel team si occupa anche dell#39;amministrazione e del ciclo di vita dei database. E’ MVP SQL Server dal 2008, #232; anche Microsoft Certified Professional, ed oltre ad essere speaker a diversi eventi Microsoft, segue due blog e risponde sui forum di StackOverflow e MSDN
Contact: http://blogs.solidq.com/dsarka/Home.aspx
Dejan Sarka, MCT and Data Platform MVP, is an independent trainer and consultant that focuses on development of database and business intelligence applications. Besides projects, he spends about half of his time on training and mentoring. He is the founder of the Slovenian SQL Server and .NET Users Group. Dejan Sarka is the main author or co-author of eighteen books about databases and SQL Server. Dejan Sarka has also developed many courses and seminars for Microsoft, Radacad, SolidQ, and Pluralsight.
LinkedIn: https://it.linkedin.com/in/pasqualeceglie
MCSE - Data Management and Analytics
LinkedIn: https://it.linkedin.com/in/fmilano
I've been working with Microsoft technologies since 2000, and I'm specialized in .NET Framework and SQL Server platform. I focus primarily on back-end development, integration solutions, relational model design and implementation. Starting from 2011 I'm also member of UGISS (Italian SQL Server User Group) and speaker at main italian SQL Server conferences and workshops.
LinkedIn: https://www.linkedin.com/in/abenedetti
Contact: http://blogs.technet.com/b/andrea_benedetti_blog/
Andrea Benedetti è Architect SQL Server BI nella divisione Servizi di Microsoft Italia dove ha la responsabilità dei progetti enterprise su tutta la data platform. SQL Server MVP dal 2004 a fine 2011, lavora con SQL Server fin dalla versione 6.5, è intervenuto come relatore in numerosi workshop, conferenze, seminari e roadshow. Appassionato di alpinismo (in solitaria) cura un blog in italiano. Scrive su Twitter come @anbenedetti.
LinkedIn: http://it.linkedin.com/in/ghotz
Contact: http://www.ghotz.com
Gianluca Hotz is an independent consultant, trainer, speaker and Mentor specialized in architecture, database design, high availability, capacity planning, performance tuning, system integration and migrations for Microsoft SQL Server. He has been working as a consultant in the IT field since 1993 and with SQL Server since 1996. He is among the original founders of ugiss.org, where he served as vice-president from 2001 to 2016 and he is now serving as president, for his contribution to the community he has been a SQL Server MVP since 1998.
LinkedIn: http://www.linkedin.com/tomaz.kastrun
Contact: http://www.tomaztsql.wordpress.com
Tomaž Kaštrun is BI developer and data analyst. His main focus are data mining, T-SQL development, programming and query optimization. He has been working with SQL server since version 2000. He is Microsoft Certified Professional, Microsoft MVP for data platform and Microsoft trainer.
LinkedIn: https://it.linkedin.com/in/marcoparenzan
Contact: https://www.linkedin.com/in/marcoparenzan/
Marco Parenzan is an independent Cloud and IoT Architect and .NET Developer. He has been awarded as a MVP on Microsoft Azure since 2014. He is a speaker in major community events in Italy about Azure and .NET development. He is a community lead for 1nn0va, an official Microsoft community in Pordenone, Italy. He has written a book on Azure in 2016. He loves developing retrogames and reading comix. Marco Parenzan è professionista per le architetture Cloud e IoT e lo sviluppo in .NET. Ha ricevuto il titolo di MVP su Microsoft Azure dal 2014. È uno speaker in Italia su Azure e lo sviluppo di .NET. E' un community lead per 1nn0va, una community ufficiale Microsoft a Pordenone, in Italia. Ha scritto un libro su Azure nel 2016.
LinkedIn: https://bg.linkedin.com/in/dimitrovmiroslav
Contact: http://www.sqlshack.com/author/miroslav-dimitrov/
Miroslav Dimitrov is a Senior Big Data and Analytics Engineer at DXC Technology, regular speaker at various events and Microsoft Certified Trainer. He is MCSE: Data Platform for SQL Server and MCITP on SQL 2008. In the last years he had worked on great variety of customers' environments and involved in complex transitions and transformation projects as well as developing private and public cloud solutions. Miroslav is also leading database courses at Sofia University.
LinkedIn: https://it.linkedin.com/in/marcopozzan
Contact: http://www.marcopozzan.it
Consultant and trainer in business intelligence, analytics and data mining on Methode . Teacher for ITS courses of data warehouse at the University of Pordenone.
The following is a list of sponsors that helped fund the event.


With the assistance of the magnificent javascript library called "jQuery", select the button to fade the below image.


REX Virtual Machine Documentation
Syscalls
The syscall instruction is provided by the CPU, however what it means is totally implementation defined.
Due to this, REX programs will have huge problems while running on different implementations, to solve this problem
the standard defines certain system calls which need to be present in every implementation.
The following system calls are to be defined in every implementation which conforms to the REX standard.
SYSCALL_PUTCH - Print an 8-bit ASCII character pushed to stack to stdout or any other graphics device assumed to be stdout
SYSCALL_PUTS - Print an unformatted string to program's stdout or any other graphics device which is assumed to be stdout.
SYSCALL_PUTI/SYSCALL_PUTF - Print an integer/float pushed to stack to stdout or any other graphics device assumed to be stdout
SYSCALL_GETC - Get a character from stdin or an input device assumed to be stdin.
SYSCALL_ATOI - Convert string which is pointed by the last value pushed to stack, and push the converted value to stack.
SYSCALL_ALLOC - Allocate one page. The size of one segment is implementation defined. All implementations are required to define a constant "R3_SEGMENT_SIZE"
SYSCALL_DISPATCH - Dispatch a background job, whose instruction pointer is pushed to stack.
SYSCALL_LOADDYANMIC - Load a dynamic library and push it's handle.
SYSCALL_OPENSTREAM - Opens a stream, whose name is pushed to stack, and then pushes the file handle to stack.
SYSCALL_SEEKSTREAM - Sets pointer in stream. The arguments are in the following order:
push [handle]
push [offset]
push [origin] - SEEK_SET (Beginning of file), SEEK_CUR (Current position), SEEK_END (EOF)
SYSCALL_READSTREAM/SYSCALL_WRITESTREAM - Reads/Writes to/from stream. The arguments are in the following order
push [handle]
push [buffer address]
push [size]
SYSCALL_TELLSTREAM - Pushes current pointer of a stream whose handle is pushed to stack
SYSCALL_CLOSESTREAM - Closes an open stream whose handle is pushed to stack
Non standard syscalls
SYSCALL_GETCPUCLOCK - Returns current CPU time (pushes to stack).
SYSCALL_GETCLOCKSPERSEC - Return how many CPU clocks are equivalent to 1 second (pushes to stack)
SYSCALL_GETARGS - Return address of the string which contains program arguments.


{% extends "base.html" %} {% load static %} {% block header %}
These plots below should help show you the relationships between your features, or independent variables, and the selected target


We have done many outreach activities. Our team (along with FRC Team 2410) hosted an FLL Rumble. We had a booth at a NASCAR Race, Sporting KC game, and we will be attending Maker Faire.


You need to be the organization manager to migrate projects out of the organization.
Follow these steps to migrate projects:
The top navigation bar displays Connected as: theOrganizationYouMigratedTo.


Scope for the entire app runtime.
Generic network response for any type data T.
(extensions in package com.whatstoday.core.extensions)
Entity represents when a user adds a character to favorite, containing the different
info required for display on screen.
The data access object for the CharacterFavorite class.
Repository module for handling character favorite data operations CharacterFavoriteDao.
Marvel API character network response item.
Marvel API character thumbnail network response.
Class that contributes to the object graph CoreComponent.
Core component that all module's components depend on.
Class that contributes to the object graph CoreComponent.
Marvel API data network response format.
Scope for a feature module.
Helper class to transforms a specific input to desired object output, implementing for that
all operations required to transform.
Marvel room database storing the different requested information like: characters, comics, etc...
Repository module for handling marvel API network operations MarvelService.
Representation interface of the Marvel API endpoints.
Class that contributes to the object graph CoreComponent.
Different states for any network request.
This annotation allows us to open some classes for mocking purposes while they are final in
release builds.
Annotate a class with OpenForTesting if you want it to be extendable in debug builds.
(extensions in package com.whatstoday.core.extensions)
Utils for application theme configuration.
Class that contributes to the object graph CoreComponent.


Imperial Mountains [an66], mountain, in Imperia, wilderness
Last updated Turn #128
Imperial Mountains [an66], mountain, in Imperia, wilderness
------------------------------------------------------------------------
17: Stack of nazgul [gp0w], nazgul, number: 2, arrived from the south.
19: Stack of nazgul [gp0w], nazgul, number: 2, went east.
30: It has become quite windy.
Routes leaving Imperial Mountains:
North, forest, to New Forest [am66], 8 days
East, mountain, to Imperial Mountains [an67], 10 days
South, mountain, to Imperial Mountains [ao66], 10 days
West, swamp, to Mosquito Fens [an65], 14 days
It is windy.
Seen here:
Stack of nazgul [fs0j], nazgul, number: 5
Stack of giants [ag2i], giants, number: 10
Hidden Inner location:
Ruins [ad5z], ruins, hidden, 1 day, owner:


--- layout: post status: publish published: true title: Live-blogging from Zambrano's rehab start in Peoria. author: display_name: Corey Fineran login: Corey email<EMAIL_ADDRESS>url: '' author_login: Corey author_email<EMAIL_ADDRESS>wordpress_id: 1256 wordpress_url: http://ivyenvy.com/?p=1256 date: '2009-08-20 14:58:26 +0000' date_gmt: '2009-08-20 20:58:26 +0000' categories: - Minor Leagues - Starting Pitching - Live Blogging tags: - Carlos Zambrano - Mark Grace - Peoria Chiefs - Ryan Flaherty - Michael Brenly - Clinton Lumberkings - O'Brien Field - Joe Girardi - Rafael Palmiero comments: - id: 372 author: beth author_email<EMAIL_ADDRESS>author_url: http://bettyround.etsy.com date: '2009-08-21 07:27:07 +0000' date_gmt: '2009-08-21 13:27:07 +0000' content: you and brenly's thighs.... - id: 373 author: Andy author_email<EMAIL_ADDRESS>author_url: http://ivyenvy.com date: '2009-08-21 07:35:50 +0000' date_gmt: '2009-08-21 13:35:50 +0000' content: Thanks for the updates! It will be good to get Zambrano back. - id: 375 author: Kurt author_email<EMAIL_ADDRESS>author_url: http:// date: '2009-08-21 10:22:26 +0000' date_gmt: '2009-08-21 16:22:26 +0000' content: Did you happen to ask that guy how much Albert charges for lawn service? If he's reasonable I might give him a call.  When you get there, the first thing you do is look to see if the wind is blowing out.\r\n\r\nJake - by the way, if you could ask The Hundley to get in contact with me, I'd appreciate it<EMAIL_ADDRESS>you from around these parts, too?" ---
3:19:15 PM: About to make the 90 mile trip to Peoria. Heading down with fellow #Cubs fan and friend of the blog, Ian.
5:44:24 PM: 10th row is really 5th row. Right on top of the away dugout. I'm sure the guys in green can admit Peoria smells better than Clinton.
5:56:22 PM: Since Kurt couldn't come, in honor of him, the first Ivy Envy flyer I handed out was to a dude wearing a "Pujols mows my lawn" shirt.
6:03:24 PM: If the radar gun is as accurate as the thermometer it could be interesting. It says 85 degrees. Can't be over 75.
6:03:51 PM: First pitch from Peoria. #cubs
6:05:53 PM: No speed on the radar. Wonder if that is intentional.
6:08:24 PM: 1-2-3 inning for Zambrano. 2 groundouts and a solid flyout to right. #cubs
6:10:44 PM: It's really too bad the Midwest League has DH. #cubs
6:12:49 PM: Flaherty comes to the plate to an Eminem song. Double to straight away center. 2 feet from going out.
6:17:20 PM: Zambrano is tossing warm up pitches at about 45mph between innings. #cubs
6:20:40 PM: Zambrano covered 1st for an out. A nimble man, he is not.
6:21:55 PM: 2 k's for Zambrano in the 2nd. #cubs
6:25:19 PM: It's really hard to gauge Zambrano's velocity without radar. He hasn't shown any indication of back pain. #cubs
6:28:43 PM: Bad angle on velocity. Amazing angle on judging check swings.
6:31:58 PM: My obsession with Michael Brenly's thighs continue. Tree trunks, I tell you.
6:42:42 PM: 3rd inning. Zambrano gives up single, double. Runners on 2nd and 3rd with one out. 2 k's to end the inning.
6:44:06 PM: Girl in front of us hit by rifled foul ball. Helped away by medics.
6:51:00 PM: Nice to see a game in Peoria. Came here when I was a kid and saw Mark Grace, Joe Girardi...and I think I saw Palmiero, not sure.
6:55:51 PM: Unwventful 3rd for Zambrano. 3 hits over 4 innings. Still doesn't look like he's letting loose on his fastball. #cubs
6:57:05 PM: Uneventful 4th. I need to be better texter.
7:09:07 PM: Zambrano gave up 1 hit in the 5th. No idea on pitch count. Another foul ball injury. Virtually no screen at this place.
7:12:26 PM: Zambrano is done for the night. 5IP, 4 hits, 0 runs. #cubs
7:19:16 PM: O'Brien Field is nice. View from the outfield berm is nice.
7:23:15 PM: Archer replaces Zambrano.
7:31:57 PM: Raining in Peoria...calling it a night


--- layout: archive title: Zulip Chat Archive permalink: /stream/113488-general/topic/lean.20installation.html ---
@Patrick Massot I was fortunate to have my operating system crash last week so that I could try your one-line installation of Lean. It worked beautifully. Many thanks. In fact, it worked so well that I decided to follow your further instructions to set up a Lean project with a local copy of mathlib, rather than using on a global copy, as I have done all along. The instructions again worked exactly as advertised.
I have two small notes. The first is that, because I had already installed VSCode through the Ubuntu package manager (which in 18.04 is snap
rather than apt
), I ended up with two copies of VSCode. (I used apt remove
to remove one.) Second, if I understand correctly, the appropriate way to update mathlib in my project is now to use leanpkg upgrade
and then mathlib-update
. It might be helpful to say that in project.md
.
Thanks again for the excellent installation procedure and documentation!
@Jeremy Avigad Just for the record: it is update-mathlib
...
Concerning the apt
vs other pkg managers issue: maybe we should use a different way to test whether VSCode is already installed.
Thanks Jeremy! Indeed https://github.com/leanprover-community/mathlib-tools/blob/master/scripts/install_debian.sh currently doesn't test at all whether VScode is installed. It assumes that everybody uses apt
or doesn't want automatic installation of anything. It seems Ubuntu created a mess with snap
. But I'll add a simple test anyway.
Thanks. I won't defend Ubuntu. More often than not, I use apt
from a terminal instead of snap
. For example, snap
doesn't seem to know about texlive
.
In my experience lots of the snaps are just plain broken too, e.g. the vscode one
https://github.com/leanprover-community/mathlib-tools/pull/3
{% endraw %}Last updated: Apr 24 2020 at 19:02 UTC


A quick summary of the quality of your surfing activities and different metrics to give you a complete idea about the information contained in the websites you visit. We want to help you determine whether you are accessing authentic information overall, from webpages which have been created and updated regularly so you can ensure that the source of the information you consume is authentic and give you the opportunity to fine-tune and improve the way you surf the internet.


Home
About Us
Contact Us
Products and Services
Register
Username *
Password *
Confirm Password *
*Please choose different Username
Register
Reset


you can learn Javascript without HTML and css but for DOM maniplution it is useful to know HTML and CSS! Tadeh on Github.
Just Another paragraph
Please fill in this form


Each gallery item has a slide component and a thumbnail component, you can override them with your own components, This is useful if you want to create custom layout, styles and functionality, then the gallery can act as a slider
Stepper Example
Rich Gallery Example
Here is another example that adds extra information to the thumbnails and custom buttons to the slides.


Save
{{ message }}
{{ time }}
List of words to ignore
All publications containing these words will be deleted from your feed
{{ item }}


Football: Chelsea win battle to sign Australian women's football icon Kerr
LONDON: Australian striker Sam Kerr will test herself at the top level of European football after impressing in her homeland and the United States as she joined Chelsea on Wednesday (Nov 13).
The 26-year-old Matildas captain - who scored five times in this year's World Cup as the Australians reached the last 16 - signed a two-and-a-half-year contract with the Women's Super League club.
Kerr, who has been a mainstay at Perth Glory since 2014 while also playing for Chicago Red Stars in the United States, will be available for selection from January.
According to a report in the Sydney Morning Herald last week it is believed Kerr also attracted interest from Lyon, Bayern Munich and Real Madrid --will earn worth more than £467,000 (US$600,000) a year, not including potential bonuses.
However, Kerr - the all-time leading scorer in the Australian and American leagues - said she felt Chelsea were a team that had laid a solid base for winning silverware.
"The WSL is the best league in Europe," she said.
"I want team success and I don't want it to come easy.
"I feel Chelsea have been building something special over the years and I want to be a part of that - I want to lift some trophies."
Chelsea manager Emma Hayes said Kerr's decision showed that they were a marquee club.
"The fact she chose Chelsea when she could have gone to any club in the world is a testament to the players and the staff here," said Hayes.
"Sam has proved time and time again in the NWSL (National Women's Soccer League in the USA) that she is a prolific goalscorer.
"She's won the golden boot many times and she's a player that can make things happen, but she's also a fantastic team player.
"She saw this as the best place for her to grow and take the next step in her career. That's a wonderful compliment to us all."
Kerr, who has twice been shortlisted for FIFA Player of the Year and is one of the sport's biggest names, made her debut for Perth Glory at 15 and spent four years at the club before moving to Sydney FC.
She returned in 2014 for a second stint.
Known for her pace, agility and heading ability, as well as her trademark backflip goal celebrations, she has also played in the United States since 2013, first at Western New York Flash, then Sky Blue FC in New Jersey and Chicago.
Kerr is the ninth player from Australia to play in England, following the likes of Emily Gielnik (Liverpool), Tanya Oxtoby (Doncaster Belles) and Caitlin Friend (Notts County).


« CSS « CSS Reference « CSS Reference:Mozilla Extensions
The :-moz-placeholder
pseudo-class represents any form element displaying placeholder text. This allows web developers and theme designers to customize the appearance of placeholder text, which is a light grey color by default. This may not work well if you've changed the background color of your form fields to be a similar color, for example, so you can use this pseudo-class to change the placeholder text color.
This example styles the placeholder text by making it green.
<!doctype html> <html> <head> <title>Placeholder demo</title> <style type="text/css"> input:-moz-placeholder { color: green; } </style> </head> <body> <input id="test" placeholder="Placeholder text!"> </body> </html>


Deep neural networks have shown to give highly accurate results across problems in machine learning. However, this accuracy comes at a price which manifests in the form of high data requirements. To alleviate the problem of low amounts of data, techniques such as data augmentation, transfer learning and one-shot learning are used
In this article we introduce and explain one-shot learning using siamese networks and triplet loss. We will look at what siamese networks are and what kind of loss functions are used. We will examine the advantages of siamese networks over state-of-the-art classifiers with the example of MNIST data. We will then further explore triplet loss and how to select ‘useful’ triplets for training siamese networks. Continuing with the example of MNIST, we shall examine the advantages of triplet loss and the different triplet selection methods.
One shot learning is a classification technique used to train neural networks using only one or a few training samples. Apart from the advantage of requiring fewer samples than usual classification algorithms, it allows for increasing the number of classes without having to change the architecture of the model.
In one shot learning, we aim to create a distance metric or a similarity function which brings samples of the same class closer to each other and those of different classes farther from each other. Therefore, we can judge which class a test sample belongs to be measuring the distance of the sample from the different classes.
Siamese networks can be used for learning the distance metric for one-shot learning. In a siamese network, we try to create embeddings of the samples such that the distance between samples of the same class is lower and between those of different classes is higher. A siamese network consists of two exact same neural networks with identical weights. We then pass a sample each into both the networks, calculate the loss and then depending on whether they are from the same class or different classes, we update the weights of both the networks. Since both the networks are identical, their weights will still remain the same after backpropagation.
In siamese networks, a loss is calculated between the embeddings of both the networks. This automatically triggers the question as to what loss can be used for such networks. Two popular losses used in siamese networks are:
The contrastive loss
Essentially, siamese networks try to create an embedding of the inputs such that inputs of the same class cluster together. The margin ‘m’ decides the distance between different clusters. Furthermore, the distance function can be any distance metric (for example euclidean distance).
Figure 1 and Figure 2 show the 2-dimensional embeddings learned by training siamese networks with contrastive loss for 30 epochs. As you can see in Figure 1 above, using contrastive loss the embeddings of training inputs of the same class converge very close to each other. However, we see that is not the case for the test samples. We can see in Figure 2, that the embeddings do not cluster properly and that there are many overlaps. This hints to an evidence of overfitting when we use contrastive loss. Hence we use another type of loss - triplet loss.
As seen earlier, Contrastive loss does not generalize well as it forces samples belonging to the same class to collapse to a single point. Triple loss ameliorates this problem by enforcing the following constraint:
Embeddings of samples belonging to the same class must be closer to each other than embeddings of samples belonging to different classes.
Triplet Loss is defined over triplets of samples in the dataset. Every triplet has 3 samples, each of which falls into a distinct category out of the ones given below:
Formally, the triplet loss can be defined as: \[Triplet \, loss = max( d(a,p) - d(a,n) + m, 0)\] where,
Just like contrastive loss, m is a hyperparameter which dictates the distance between the clusters of two different classes.
Let us consider the MNIST dataset again. While training, our aim is to minimize the triplet loss. Hence, the d(a,p) term which signifies the distance between the embeddings of two samples of the same class is pushed towards zero. Therefore, if the anchor is of class ‘5’, another image of the class ’5’ would be chosen and distance between their embeddings would be reduced. For the negative sample, an image belonging to a class other than ‘5’ would be selected. Let us assume the class of the negative image is ‘6’. Since there is a negative sign in front of the d(a,n) term, minimizing the loss would increase this term. Therefore the distance between the embeddings of the ‘5’ class anchor and ‘6’ class negative sample will increase. Furthermore, to bring the loss to 0, d(a,n) must be increased until it is greater than the sum of the margin and d(a,p).
For training, the anchor, positive sample and the negative sample are each given as an input to three networks that are identical in structure and weights. These networks output the embedding of these 3 samples and these embeddings are used to compute the triplet loss. The loss is accumulated over all triplets formed by a batch of N samples and after the loss has been computed for all triplets, the gradients are back-propagated.
As triplet loss just aims to have a positive sample closer to anchor than the negative sample, it does not force all samples of the same class to collapse to a single point. This is illustrated in the Figures 5 and 6 below. As can be seen, it performs much better on the test set and also generalises well compared to contrastive loss.
The embeddings of the samples after each epoch for both train and test data can be seen in the visualization below. We can see that in the first few epochs the clusters become smaller. This can be attributed to the fact that triplet loss minimizes the distance between samples of same class. We can also see that the distance between clusters of different classes increase during the initial epochs. This is because triplet loss forces the samples from opposite classes to be farther away from each other than samples from same class. Finally we observe that after 20 epochs the clusters do not change significantly.
Epoch Number = 1
The triplet loss has only one hyperparameter - the margin. It represents the distances between two clusters of samples of different classes. The greater the margin, the greater the inter-cluster distance. The effect of changing the margin can be visualized by changing the margin parameter and seeing the output in Figure 9 and 10. For this visualization we train siamese networks with triplet loss for 30 epochs for values of margin ranging from 1 to 20.
Margin = 1
For the above visualizations, we have used the L2-squared distance as the distance metric. However, any distance metric can be used. The effect of using different distance functions on the learned embeddings can be seen using the visualization below. Figures 11 and 12 show the embeddings learned after each epoch using L2 distance metric. Figure 13 and 14 show the embeddings learned after each epoch for L1 distance metric. Using the L2 distance has an added advantage that the margin is more interpretable, as it represents the absolute distance. Overall, the distance metrics of L1, L2 and L2-squared all perform well.
Epoch Number = 1
Epoch Number = 1
Although triplet loss might seem to be a panacea, it does have its own cons. A major con of triplet loss is its scalability with respect to dataset size. As the size of datasets increase, the number of possible triplets also increases cubically. For example, for a batch of N samples there are O(N3) possible triplets. This makes training over all the triplets of large datasets impractical.
This problem can be alleviated if one smartly chooses the triplets for training. Ideally one would like to select a triplet which has the anchor, the hardest positive and the hardest negative, where hardest positive = argmaxp(d(a,p)) and hardest negative = argminn(d(a,n)). However, for a large dataset, it might be infeasible to compute argmax and argmin. Further, selecting the hardest samples might also result in poor training due to sample mislabelling and presence of outliers.
The very definition of triplet loss classifies each triplet in three different categories. This classification of triplets can be used to select triplets for training. The three categories are as follows:
The easy triplets already satisfy the constraint of triplet loss and do not contribute while training. Using easy triplets, leads to slower convergence and wasted computational resources. Hence one should avoid easy triplets while training. Selecting the hardest negatives can in practice lead to bad local minima early on in training, specifically, it can result in a collapsed model
Now that we know which triplets to select, we need to define a strategy to select these triplets before each epoch. The procedure for selecting useful triplets is known as triplet mining. It can be divided into two broad categories:
In this paper, we exlpain how one can use siamese networks for one-shot learning. We also explain the advantages of using triplet loss over contrastive loss. Further, we include visualizations that helps one understand how the value of margin and the distance metric affect the embedding learned using siamese networks with triplet loss. Finally, we also explain how one should select triplets and perform triplet mining for optimizing the training phase of siamese networks.
Some other useful material can be found at


Loader for CoffeeScript as a Node.js library.
exports[key] = val for key, val of require './coffee-script'


SKATEBOARD
Deck
Truck
Bearings
Wheels
Griptape
CLOTHINGS
Tops
Bottom
Footwear
Headwear
ACCESSORIES
Backpacks
Other
CUSTOMER SERVICES
Hotline
FAQ
Search


This is the implementation of a flooding based bundle router.
In the implementation an internal BundleList is maintaned in which all bundles are kept until their expiration time. This prevents the main daemon logic from opportunistically deleting bundles when they've been transmitted.
Whenever a new link arrives, we add a wildcard route to the table. Then when a bundle arrives, we can stick it on the all_bundles list and just call the base class route_bundle function. The core base class logic then makes sure that a copy of the bundle is forwarded exactly once to each neighbor.For more information please see the route command.
Note: At present this will forward a bundle back to the node from which it arrived.


CSS Positioning
Posted Sunday May 25th, 2014
A hard thing to understand. Let's make it easy.
Here are three balloons stacked in a grey bin.
The balloons have default positions of static.
These pretty balloons ain't moving.
#green-balloon
{ position:static; }
Now let's make the position of the green balloon absolute.
#green-balloon
{ position:absolute; }
Wait a minute! What just happened?
We "pulled" the green balloon out of the flow.
We can literally position it absolutely anywhere – even on top of
or underneath other balloons in the bin.
This brings us to the relative position.
Guess which div on this page has been relative the entire time we've been playing with balloons?
#grey-bin
{ position:relative; }
That's right, the grey bin! The bin that is holding our balloons must have a position of relative or absolute for any of this balloon floating nonsense to work. Why? Because this "limits the scope of absolutely positioned child elements" – in plain English, it forces our balloons to be contained within it. Otherwise, when we position our green balloon to be absolute, it would go flying to its closest non-static parent, which may be an unintended div in your webpage, or the page itself!
Fixed positioning is a bit easier to explain.
Check out the header of this page (hint: it has the words "TECHNICAL THINGS IN A TECHNICAL BLOG" in it).
The position of this div is fixed, meaning the header is stuck there forever and ever. Go ahead, scroll. Yep...still there.
If you would like to know how elements interact when positioned, or prefer an explanation without balloons and bins, check out css-tricks.com.


Bank Account App
Current balance
£0
Overdraft
£0
Overdraft Limit
£500
£
£
Change Overdraft Limit:
-
+


http://www.susangranger.com/
Susan Granger's review of "DR. DOLITTLE 2" (20th Century-Fox)
When I took a seven year-old and a ten year-old to see Eddie Murphy, once again, play Dr. John Dolittle, they loved it. And why not?  The story begins in Dr. Dolittle's San Francisco clinic where, after hours, he conducts a group therapy session for strays, assuring them, "Every dog can find a family and be someone's best friend." But his healer-who-talks-with-animals routine is interrupted by a summons to meet the Mafia-connected Mr. Beaver (voiced by Richard C. Sarafian). It seems the little critters need his help to save their forest that's being threatened by an evil logger (Jeffrey Jones) and his lawyer (Kevin Pollak). So Mrs. Dolittle (Kristen Wilson), a lawyer, gets an injunction, pleading that the forest is home to the last Pacific Western bear, an endangered species. The catch is that Dolittle must play match-maker for the bear, named Ava (voiced by Lisa Kudrow), pairing her with Archie (voiced by Steve Zahn), a circus-trained bear, who has no desire to live in the wild. "Winnie the Who?" Dolittle cajoles, appealing to his vanity. "You'll be famous!" But once Archie gets a look at Ava, he changes his tune to "I Will Survive" and tries to win her affections from a rival Kodiak bear. Written by Larry Levin and directed by Steve Carr, Dolittle's survival-training with Archie provides plenty of laughs, as does the subsequent world-wide Animal Strike. There's also a dreary romantic subplot involving Dolittle's petulant 16 year-old daughter (Raven-Symone) and her pizza-delivery boy-friend (Lil' Zane). On the Granger Movie Gauge of 1 to 10, "Dr. Dolittle 2" is a sweet-natured 6. It's an amiable, big-screen sit-com that's not hard to bear.
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


Was browsing builds whilst thinking about my next character and I noticed there isn't a Wizard/PM/Assassin build despite there being a certain synergy between them Of course it won't be a great caster or fighter but any thoughts on how it could be built effectively?
Currently I'm thinking elf for that pale but deadly look Start with STR 10 DEX 18 CON 12 INT 16 WIS 08 CHA 10 Pre-epic Wizard 8/PM 4 /Assassin 8 Feats: Spell Penetration, Greater Spell Penetration, Extend Spell, Spell Focus: Illusion, Greater Spell Focus: Illusion, WF:Rapier, IC:Rapier, Craft Wand
Any thoughts on should DEX or INT be concentrated on and on the final balance of levels between the 3 classes? _________________ Teaching men a lesson in combat etiquette.
Wiz 10 PM 16 Assassin 14 is my first instinct.. after that I'm growing a tad foggy in me young age.
-DaMouse
ta, that seems sensible ATM I think I've come up with a character who is going to be all around mediocre. Heres a slight rework concentrating on buffing rather than trying to be a real caster.
Race: Elf STR 10 DEX 18/24 CON 12 INT 16/20 WIS 08 CHA 10
Feats: Knockdown, Weapon Finesse, WF:Shortsword, TWF, Ambidextrous, IKD, ITWF, Extend Spell*, Craft Wand* Epic Feats: IC:Shortsword, Epic Prowess, EWF:Shortsword, Blindfighting, Armourskin, ESF:Hide#, ESF:Move Silently, ESF:Set Traps, Energy Resistance:Sonic@, Epic Warding@ *Wizard Bonus Feat #Assassin Bonus Feat @Palemaster Bonus Feat _________________ Teaching men a lesson in combat etiquette.
*sigh* well I've decided there wasn't as much synergy as I hoped for ends up mediocre fighter, mediocre buffer, and due to lack of skill points not a particularly good Assassin I'm beginning to see why nobody else has created a build with this class combo _________________ Teaching men a lesson in combat etiquette.
What if you thought about it like a shifter buils and focused on a form like tensor's transformation? you get the + to attack. Do the bufs stack with bulls, cats, etc?
I'm not sure how it would work with Tenser's Transformation I presume the bonuses from Tensers to STR and that from Bulls Strength would stack up to +12 I'll keep playing around with the idea and I'm grateful for suggestions I've actually got a story for this 1, just the build I'm lacking _________________ Teaching men a lesson in combat etiquette.


Status for Canvas Course Manager
Current url:
Build Version:
Points of Integration
- Canvas: The Canvas API is used by this
application to make calls that fetch sections information, look up
courses, etc. If you would like to assure that Canvas is available
then the API console is available at Here
- ESB: The ESB is used in this application to
retrieve information regarding instructor roles. The API used is
called Instructor. If a user requires access to the API, permission
will have to be granted to Instructor explicitly. An API console is
available at Here
- MPathways: MPathways (or PeopleSoft) must be
available for the ESB call to be processed as the ESB relies on
MPathways to retrieve information regarding Instructor Roles in a
course.
- Friend: There is a WebService available that
will check if a friend account exists. The WebService also has the
ability to add friends with the proper information.


Module: NonRecordable
- Included in:
- ReadOnlyBuffer
- Defined in:
- lib/buffer/non_recordable.rb
Overview
NonRecordable module is included in Buffer subclasses which can not be recorded via record method. These buffers cannot be undone or redone.
Instance Method Summary (collapse)
- - (Boolean) can_redo?
- - (Boolean) can_undo?
- - (Object) record(method, *args)
- - (Object) redo
- - (Object) undo
Instance Method Details
- (Boolean) can_redo?
9 10 11 |
# File 'lib/buffer/non_recordable.rb', line 9 def can_redo? false end |
- (Boolean) can_undo?
5 6 7 |
# File 'lib/buffer/non_recordable.rb', line 5 def can_undo? false end |
- (Object) record(method, *args)
13 14 15 |
# File 'lib/buffer/non_recordable.rb', line 13 def record(method, *args) # nop end |
- (Object) redo
21 22 23 |
# File 'lib/buffer/non_recordable.rb', line 21 def redo # nop end |
- (Object) undo
17 18 19 |
# File 'lib/buffer/non_recordable.rb', line 17 def undo # nop end |


Bill of Materials
Create
Flattened Component List
Tree List
Combine components by name
Save as CSV
Print
* Model has been changed. BOM may not be up to date. *
×


Greetings everybody and welcome to VolgaCTF 2017 Quals!
To take part in the competition, you should sign up with an email address, your team's name (Latin characters only) and a logo. Warning! You will not be able to change your team's name once registered so please be careful in order not to take other team's name by accident. The number of team members is not limited.
Please specify a valid email address to get a verification email. It will be impossible to change the email address after you confirm your participation by clicking the link in the verification email.
Besides, we kindly ask you to specify your country in the registration form - we are collecting this information for statistical purposes.
Teams from Russia are also asked to fill in an institution field.
The contest starts on March 24 at 19:00 SAMT/15:00 UTC and lasts 48 hours. Flags match /VolgaCTF{[\x20-\x7F]+}/
unless stated otherwise. Check the News page at times - there might be some important pieces of information about the competition. We will answer your questions and make other announcements in Telegram public chat. Technical support is also provided by email<EMAIL_ADDRESS>Competitors are forbidden to perform destructive actions against competition infrastructure (*.volgactf.ru
and *.volgactf.org
) and to prevent other teams from playing. A team violating the rules will be disqualified.
While conversing in Telegram public chat, you are expected to be respectful to each other and to restrain from using swear words. Exchanging flags is strictly prohibited. A person asking for, or trading their flags will be expelled from the chat.
We reserve the right to amend these regulations at any time.
VolgaCTF 2017 Finals (attack-defence) will be held on September 11-15 in Samara, Russia.
In 2017 we have the following quotas for VolgaCTF 2017 Finals:
We are going to invite top teams (according to VolgaCTF 2017 Quals scoreboard) on the condition that these teams have specified institution of higher education in their profile. If there appears to be several teams coming from the same educational establishment in the list, we will invite the one having the highest rank among those teams.
The board may change these quotas on technical grounds. Also, we may invite up to 3 guest teams by means of additional quota.
Invitations will be sent to emails specified in teams’ profiles. It is crucial that the team eligible for participation in VolgaCTF 2017 Finals confirms its participation by Aug 1.
The preliminary list of the teams invited to VolgaCTF 2017 Finals will be published on the competition website no later than 14 days after VolgaCTF 2017 Quals is finished.
Please note that a team will be excluded from this list:
Should any team be excluded from the preliminary list, the next one of the same quota (according to VolgaCTF 2017 Quals scoreboard) will be invited.
Last but not least, we have a limit to the number of participants per team, that is up to 7 members in each team.
We reserve the right to amend these regulations at any time.
Tasks and services are devised in collaboration with the Institute of Informatics, Mathematics and Electronics of Samara University.


Verifiable Claims
Some claims will need to be attested to by recognized Authorities, Trusted Parties etc.
- name
- Address
- Date of Birth
- Passport Number/Country
- Passport
- Nationality
- Residency Status
- Is over 13, 18, 21
- Photo of user
- Email address
- Social Media Account Verification (Verified Checkmark)
- Mobile Number
- Insurance
- Temporary Security Authorisaions
- Tickets
- Accreditations: Credits, Diplomas, Degrees etc - Extension of Open Badges.
- Prescriptions
- Deeds
- Invoices/Purchase Orders
- Bank Records - Verifiable Records
- Car Rental / Temporary Control (limited in scope - time / location)
- Lock Opening certain doors… etc
- QR Codes - Most DID Apps use QR Codes
- NFC - This is another mechanism which could be used
- Paymail - I will focus on this aspect for the purposes of this hackathon.
- Why the requester is asking for that data.
- The restrictions of use/storage of that data. Ie a licence from the user,
- The amount of time that user can have access to that data.
- Also what data is needed, piece by piece.
- What is optional?
Process of Requesting Verifiable Claims
The Request Data Post
With details of the who is requesting the data, including the authority chain of the requester if appropriate.
The BitCoin blockchain acts as ourOn-Chain Credential Repository
A verifiable claim is a qualification, achievement, quality, or piece of information about an entity's background such as a name, government ID, payment provider, home address, or university degree. Such a claim describes a quality or qualities, property or properties of an entity which establish its existence and uniqueness. The use cases outlined here are provided in order to make progress toward possible future standardization and interoperability of both low- and high-stakes claims with the goals of storing, transmitting, and receiving digitally verifiable proof of attributes such as qualifications and achievements. The use cases in this document focus on concrete scenarios that the technology defined by the group should address.Excerpt from https://www.w3.org/TR/vc-use-cases/


How Are Ruby and JavaScrip Different
This blog post is going to go over how Ruby and JavaScript handle OOP programing in different ways. The difference can seam really large when you go from Ruby to JavaScript, so I'm going to compare them against each other and you will see there differences but will also see that fundamentally they allow for very similar OOP principles, most importanly the concept of encapsulation of properties and methods and inheritance.
In The Red corner, Ruby...
Ruby is object0-orientated programming language that handles classes in a very classical way; if you know java or c++ then the way manner in which Ruby handles inheritence and the decloration of classes will be easy to grasp. I will now declear a class in Ruby and create an instance of it:
class Character
def initialize(first, last, has_hat, shirt_color)
@first_name = first
@last_name = last
@wears_hat = has_hat
@shirt_color = shirt_color
end
def spew_info
puts "This characters name is #{#first_name} #{@last_name}, and their shirt color is<EMAIL_ADDRESS>end
end # end of class definition
kyle = Character.new("Kyle", "Broflovski", true, "Orange")
kyle.spew_info
=> This characters name is Kyle Broflovski, and their shirt color is Orange.
Here we can see a class with a name of Character being declared with instance variables and one instance method.
So here we can see that during the initialize method of MainCharacter that super calles the initialize method of Character, setting up all the inherited instance vars. Then it assignes a new instance variable and declears a new method called say_catch_phrase. This is all cool and neat, but how would we do this in JavaScript?
In The Yellow Corner, JavaScript...
JavaScript follows OOP principles, but to get technical it is a Prototype-based language, which I could try to explain, but I think that seeing it in action is a better way to understand this. We will now create the same Classes that we had in Ruby in JavaScript:
function Character(first, last, hasHat, shirtColor) {
this.firstName = first;
this.lastName = last;
this.wearsHat = hasHat;
this.shirtColor = shirtColor;
this.spewInfo = function() {
console.log("This Characters name is " + this.firstName + " " + this.lastName + ", and their shirt color is " + this.shirtColor);
};
};
var kyle = new Character("Kyle", "Broflovski", true, "Orange");
kyle.spewInfo;
=> This characters name is Kyle Broflovski, and their shirt color is Orange.
So here we can see the Javascript version and it looks weird, I know. But, what we have made is a constructor function. This gives us the functionality of a class, but here is where it gets interesting. With constructor functions you can add/remove attributes and methods at run-time, meaning after you've declared it; in Ruby you have to declare all attributes and methods in the class decloration. The ability to add/remove methods or attributes in JavaScript is due to the prototype-based part of the language; when you create an instance of a "class", we would say in JS, that you're actually cloning the prototype; if you had a clone machine and cloned an apple, the original apple would be prototype, clone would be the clone, and you would be free to modify the clone with out affecting the prototype. Here we will give an example of this.
var kyle = new Character("Kyle", "Broflovski", true, "Orange");
kyle.spewInfo;
=> This characters name is Kyle Broflovski, and their shirt color is Orange.
kyle.spewRandomJibberish = function() {
console.log("Hothagow othagold othagare yothagou?")
};
kyle.father = "Gerald";
kyle.spewRandomJibberish();
=> Hothagow othagold othagare yothagou?
kyle.father;
=> Gerald
This ability means that Javacript is alot less constrictive with how you choose to impliment OOP in your programs. It also gives a lot of ambiguity to how implement OOP in JavaScript, because of the way it seporates itself from the rigid class-based structure of other languages; I think JavaScript is super confusing because it seams like it doesn't know what it wants to be. Now let's create the Main Character "class" that inherits from Character:
- Things That We Learned:
-
- JavaScript is a Prototype-based Language
- There is no formal way to create a class in JavaScript
- You can add/remove attributes and methods at run-time in JavaScript
- JavaScript is Silly


Go is a systems programming language intended to be a general-purpose systems language, like C++. These are some notes on Go for experienced C++ programmers.
For a more general introduction to Go, see the Go tutorial and Effective Go.
For a detailed description of the Go language, see the Go spec.
const
or volatile
qualifiers.
nil
for invalid pointers, where C++ uses
NULL
or simply 0
.
The declaration syntax is reversed compared to C++. You write the name followed by the type. Unlike in C++, the syntax for a type does not match the way in which the variable is used. Type declarations may be read easily from left to right.
Go C++ var v1 int; // int v1; var v2 string; // const std::string v2; (approximately) var v3 [10]int; // int v3[10]; var v4 []int; // int* v4; (approximately) var v5 struct { f int }; // struct { int f; } v5; var v6 *int; // int* v6; (but no pointer arithmetic) var v7 map[string]int; // unordered_map<string, int>* v7; (approximately) var v8 func(a int) int; // int (*v8)(int a);
Declarations generally take the form of a keyword followed by the name
of the object being declared. The keyword is one of var
,
func
,
const
, or type
. Method declarations are a minor
exception in that
the receiver appears before the name of the object being declared; see
the discussion of interfaces.
You can also use a keyword followed by a series of declarations in parentheses.
var ( i int; m float )
When declaring a function, you must either provide a name for each parameter or not provide a name for any parameter; you can't omit some names and provide others. You may group several names with the same type:
func f(i, j, k int, s, t string);
A variable may be initialized when it is declared. When this is done, specifying the type is permitted but not required. When the type is not specified, the type of the variable is the type of the initialization expression.
var v = *p;
See also the discussion of constants, below. If a variable is not initialized explicitly, the type must be specified. In that case it will be implicitly initialized to the type's zero value (0, nil, etc.). There are no uninitialized variables in Go.
Within a function, a short declaration syntax is available with
:=
.
v1 := v2;
This is equivalent to
var v1 = v2;
Go permits multiple assignments, which are done in parallel.
i, j = j, i; // Swap i and j.
Functions may have multiple return values, indicated by a list in parentheses. The returned values can be stored by assignment to a list of variables.
func f() (i int, j int); v1, v2 = f();
Go treats semicolons as separators, not terminators. Moreover,
semicolons may be omitted after the closing parenthesis of a declaration
block or after a closing brace that is not part of an expression
(e.g., var s struct {}
or { x++ }
).
Semicolons are never required at the
top level of a file (between global declarations). However, they are
always permitted at
the end of a statement, so you can continue using them as in C++.
When using a pointer to a struct, you use .
instead
of ->
.
Thus syntactically speaking a structure and a pointer to a structure
are used in the same way.
type myStruct struct { i int } var v9 myStruct; // v9 has structure type var p9 *myStruct; // p9 is a pointer to a structure f(v9.i, p9.i)
Go does not require parentheses around the condition of a if
statement, or the expressions of a for
statement, or the value of a
switch
statement. On the other hand, it does require curly braces
around the body of an if
or for
statement.
if a < b { f() } // Valid if (a < b) { f() } // Valid (condition is a parenthesized expression) if (a < b) f(); // INVALID for i = 0; i < 10; i++ {} // Valid for (i = 0; i < 10; i++) {} // INVALID
Go does not have a while
statement nor does it have a
do/while
statement. The for
statement may be used with a single condition,
which makes it equivalent to a while
statement. Omitting the
condition entirely is an endless loop.
Go permits break
and continue
to specify a label.
The label must
refer to a for
, switch
, or select
statement.
In a switch
statement, case
labels do not fall
through. You can
make them fall through using the fallthrough
keyword. This applies
even to adjacent cases.
switch i { case 0: // empty case body case 1: f() // f is not called when i == 0! }
But a case
can have multiple values.
switch i { case 0, 1: f() // f is called if i == 0 || i == 1. }
The values in a case
need not be constants—or even integers;
any type
that supports the equality comparison operator, such as strings or
pointers, can be used—and if the switch
value is omitted it defaults to true
.
switch { case i < 0: f1() case i == 0: f2() case i > 0: f3() }
The ++
and --
operators may only be used in
statements, not in expressions.
You cannot write c = *p++
. *p++
is parsed as
(*p)++
.
The defer
statement may be used to call a function after
the function containing the defer
statement returns.
fd := open("filename"); defer close(fd); // fd will be closed when this function returns.
In Go constants may be untyped. This applies even to constants
named with a const
declaration, if no
type is given in the declaration and the initializer expression uses only
untyped constants.
A value derived from an untyped constant becomes typed when it
is used within a context that
requires a typed value. This permits constants to be used relatively
freely without requiring general implicit type conversion.
var a uint; f(a + 1) // untyped numeric constant "1" becomes typed as uint
The language does not impose any limits on the size of an untyped numeric constant or constant expression. A limit is only applied when a constant is used where a type is required.
const huge = 1 << 100; f(huge >> 98)
Go does not support enums. Instead, you can use the special name
iota
in a single const
declaration to get a
series of increasing
value. When an initialization expression is omitted for a const
,
it reuses the preceding expression.
const ( red = iota; // red == 0 blue; // blue == 1 green // green == 2 )
A slice is conceptually a struct with three fields: a
pointer to an array, a length, and a capacity.
Slices support
the []
operator to access elements of the underlying array.
The builtin
len
function returns the
length of the slice. The builtin cap
function returns the
capacity.
Given an array, or another slice, a new slice is created via
a[I:J]
. This
creates a new slice which refers to a
, starts at
index I
, and ends before index
J
. It has length J - I
.
The new slice refers to the same array
to which a
refers. That is, changes made using the new slice may be seen using
a
. The
capacity of the new slice is simply the capacity of a
minus
I
. The capacity
of an array is the length of the array. You may also assign an array pointer
to a variable of slice type; given var s []int; var a[10] int
,
the assignment s = &a
is equivalent to
s = a[0:len(a)]
.
What this means is that Go uses slices for some cases where C++ uses pointers.
If you create a value of type [100]byte
(an array of 100 bytes,
perhaps a
buffer) and you want to pass it to a function without copying it, you should
declare the function parameter to have type []byte
, and pass the
address
of the array. Unlike in C++, it is not
necessary to pass the length of the buffer; it is efficiently accessible via
len
.
The slice syntax may also be used with a string. It returns a new string, whose value is a substring of the original string. Because strings are immutable, string slices can be implemented without allocating new storage for the slices's contents.
Go has a builtin function new
which takes a type and
allocates space
on the heap. The allocated space will be zero-initialized for the type.
For example, new(int)
allocates a new int on the heap,
initializes it with the value 0
,
and returns its address, which has type *int
.
Unlike in C++, new
is a function, not an operator;
new int
is a syntax error.
Map and channel values must be allocated using the builtin function
make
.
A variable declared with map or channel type without an initializer will be
automatically initialized to nil
.
Calling make(map[int]int)
returns a newly allocated value of
type map[int]int
.
Note that make
returns a value, not a pointer. This is
consistent with
the fact that map and channel values are passed by reference. Calling
make
with
a map type takes an optional argument which is the expected capacity of the
map. Calling make
with a channel type takes an optional
argument which sets the
buffering capacity of the channel; the default is 0 (unbuffered).
The make
function may also be used to allocate a slice.
In this case it
allocates memory for the underlying array and returns a slice referring to it.
There is one required argument, which is the number of elements in the slice.
A second, optional, argument is the capacity of the slice. For example,
make([]int, 10, 20)
. This is identical to
new([20]int)[0:10]
. Since
Go uses garbage collection, the newly allocated array will be discarded
sometime after there are no references to the returned slice.
Where C++ provides classes, subclasses and templates, Go provides interfaces.  However, in Go, any type which provides the methods named in the interface may be treated as an implementation of the interface. No explicitly declared inheritance is required. The implementation of the interface is entirely separate from the interface itself.
A method looks like an ordinary function definition, except that it
has a receiver. The receiver is similar to
the this
pointer in a C++ class method.
type myType struct { i int } func (p *myType) get() int { return p.i }
This declares a method get
associated with myType
.
The receiver is named p
in the body of the function.
Methods are defined on named types. If you convert the value to a different type, the new value will have the methods of the new type, not the old type.
You may define methods on a builtin type by declaring a new named type derived from it. The new type is distinct from the builtin type.
type myInteger int func (p myInteger) get() int { return int(p) } // Conversion required. func f(i int) { } var v myInteger // f(v) is invalid. // f(int(v)) is valid; int(v) has no defined methods.
Given this interface:
type myInterface interface { get() int; set(i int); }
we can make myType
satisfy the interface by adding
func (p *myType) set(i int) { p.i = i }
Now any function which takes myInterface
as a parameter
will accept a
variable of type *myType
.
func getAndSet(x myInterface) {} func f1() { var p myType; getAndSet(&p); }
In other words, if we view myInterface
as a C++ pure abstract
base
class, defining set
and get
for
*myType
made *myType
automatically
inherit from myInterface
. A type may satisfy multiple interfaces.
An anonymous field may be used to implement something much like a C++ child class.
type myChildType struct { myType; j int } func (p *myChildType) get() int { p.j++; return p.myType.get() }
This effectively implements myChildType
as a child of
myType
.
func f2() { var p myChildType; getAndSet(&p) }
The set
method is effectively inherited from
myChildType
, because
methods associated with the anonymous field are promoted to become methods
of the enclosing type. In this case, because myChildType
has an
anonymous field of type myType
, the methods of
myType
also become methods of myChildType
.
In this example, the get
method was
overridden, and the set
method was inherited.
This is not precisely the same as a child class in C++. When a method of an anonymous field is called, its receiver is the field, not the surrounding struct. In other words, methods on anonymous fields are not virtual functions. When you want the equivalent of a virtual function, use an interface.
A variable which has an interface type may be converted to have a
different interface type using a special construct called a type assertion.
This is implemented dynamically
at runtime, like C++ dynamic_cast
. Unlike
dynamic_cast
, there does
not need to be any declared relationship between the two interfaces.
type myPrintInterface interface { print(); } func f3(x myInterface) { x.(myPrintInterface).print() // type assertion to myPrintInterface }
The conversion to myPrintInterface
is entirely dynamic.
It will
work as long as the underlying type of x (the dynamic type) defines
a print
method.
Because the conversion is dynamic, it may be used to implement generic programming similar to templates in C++. This is done by manipulating values of the minimal interface.
type Any interface { }
Containers may be written in terms of Any
, but the caller
must unbox using a type assertion to recover
values of the contained type. As the typing is dynamic rather
than static, there is no equivalent of the way that a C++ template may
inline the relevant operations. The operations are fully type-checked
at runtime, but all operations will involve a function call.
type iterator interface { get() Any; set(v Any); increment(); equal(arg *iterator) bool; }
Go permits starting a new thread of execution (a goroutine)
using the go
statement. The go
statement runs a function in a
different, newly created, goroutine.
All goroutines in a single program share the same address space.
Internally, goroutines act like coroutines that are multiplexed among multiple operating system threads. You do not have to worry about these details.
func server(i int) { for { print(i); sys.sleep(10) } } go server(1); go server(2);
(Note that the for
statement in the server
function is equivalent to a C++ while (true)
loop.)
Goroutines are (intended to be) cheap.

Channels are used to communicate between goroutines. Any value may be
sent over a channel. Channels are (intended to be) efficient and
cheap. To send a value on a channel, use <-
as a binary
operator. To
receive a value on a channel, use <-
as a unary operator.
When calling
functions, channels are passed by reference.
The Go library provides mutexes, but you can also use a single goroutine with a shared channel. Here is an example of using a manager function to control access to a single value.
type cmd struct { get bool; val int } func manager(ch chan cmd) { var val int = 0; for { c := <- ch if c.get { c.val = val; ch <- c } else { val = c.val } } }
In that example the same channel is used for input and output. This is incorrect if there are multiple goroutines communicating with the manager at once: a goroutine waiting for a response from the manager might receive a request from another goroutine instead. A solution is to pass in a channel.
type cmd2 struct { get bool; val int; ch <- chan int; } func manager2(ch chan cmd2) { var val int = 0; for { c := <- ch if c.get { c.ch <- val } else { val = c.val } } }
To use manager2
, given a channel to it:
func f4(ch <- chan cmd2) int { myCh := make(chan int); c := cmd2{ true, 0, myCh }; // Composite literal syntax. ch <- c; return <-myCh; }


Plaque unveiled outside Stourbridge nightclub where Ryan Passey was stabbed - with VIDEO and PICTURES
The family of a teenage knife victim have unveiled a plaque outside the Stourbridge nightclub where he was stabbed, in a moving ceremony attended by dozens of supporters.
by Marion BrennanRyan Passey's parents say they hope it will make young club-goers think twice before carrying a knife.
Ryan was 24 when he was fatally stabbed in Chicago's nightclub in Stourbridge town centre in August 2017. Kobe Murray, 19, from Dudley, stood trial for his murder but was cleared by a jury at Birmingham Crown court last year.
Under a photograph of a smiling Ryan, the plaque reads: "When you think of me, smile, share my stories, remember all the happy times, and know that I will live forever in your hearts. Enjoy your life, like I did."
WATCH the video:
Addressing the crowd, John Passey recalled his nephew's "zest for life, laughter and sometimes downright cheekiness".
Bouquets of flowers were laid and candles lit at the spot which has become a shrine in the two years since Ryan's death.
His family continues to fight to get the law changed to allow for more grounds to appeal against acquittals in serious criminal cases.
See also:
- Families unite against knife crime in Stourbridge
- New bar planned for Stourbridge nightclub where Ryan Passey was stabbed
- Hundreds of bikers turn out for second Justice for Ryan ride
Ryan's mother, Gillian Taylor, 53, said the family was overwhelmed by the turn-out on Saturday, which "shows how much he was loved".
She said she avoids the venue, outside the Ryemarket shopping centre on the High Street, because its memories distress her.
"It's been over two years and I still struggle every day," she revealed. "I get up and go to work but it's only because I've got him in my head, saying 'Come on Mom, pull yourself together'.
"Ryan couldn't pass anyone without saying hello, he was so nice.  He was my only son but we come from a big family so the knock-on effect has been huge."
Speaking of the plaque, she said: "People forget what happened, and looking at this will remind them and wake them up. If we can stop someone else getting stabbed that's all I can hope for."
Ryan's stepfather Philip Taylor added: "We can't afford to get complacent."
Chicago’s shut in February last year after more than 3,500 people signed a petition calling for its closure but it is due to reopen soon under a new name, Soda Lounge.
However the owners have agreed to implement stringent security measures and to omit a dedicated dance floor.
Jason Connon, from the Justice for Ryan campaign, said the criminal justice system was seriously failing the victims of knife crime and their families.
The campaigners have raised their concerns in meetings with the former Home Secretary Sajid Javid and chair of the All-Party Parliamentary Group for miscarriages of justice Barry Sheerman.
They have also met senior prosecutors and the West Midlands' Assistant Chief Constable Jayne Meir who have all voiced sympathy for group's work.
A fighting fund pays for the legal fees and funds the work of private detectives still investigating Ryan's death.
Mr Connon said: "We are next planning to meet with the Ministry of Justice and hope to get a further meeting with the new Home Secretary once a new Government is elected. We will never stop fighting for Ryan."
In September, the family joined the relatives of Reagan Asbury, knifed to death after a boxing event in in Walsall last year, and James Brindley, fatally stabbed in Aldridge, in 2017, took part in a march as part of a Tackling Knife Crime Together event.
Ryan's father Adrian Passey said: "We're still hoping we'll have our day back in court and justice will be served for Ryan, which he deserves."


| Figure 1 |
The Naqu Prefecture. |
| Figure 2 |
The location map of 2470 meteorological stations in China. |
| Figure 3 |
The spatial distribution of mean annual precipitation in Naq ... |
| Figure 4 |
( a) shows the longitudinal profile of the gradient directio ... |
| Figure 5 |
The annual movement law of the center point of the 500 mm pr ... |
| Figure 6 |
The spectrum graph of the spatial displacement of the 500 mm ... |
| Figure 7 |
Catastrophe analysis of the center point of the 500 mm preci ... |
| Figure 8 |
Catastrophe analysis of the center point of the 500 mm preci ... |
| Figure 9 |
Spatial characteristics of annual average accumulated temper ... |
| Figure 10 |
The longitudinal profile of the gradient direction of the mu ... |
| Figure 11 |
The annual movement law of the longitude ( a) and latitude ( ... |
| Figure 12 |
The spectrum graph of the spatial displacement of the 2000 ° ... |
| Figure 13 |
Catastrophe analysis of the center point of the 2000 °C accu ... |
| Figure 14 |
Catastrophe analysis of the center point of the 2000 °C accu ... |
| Figure 15 |
Division of hydrothermal conditions suitability of vegetatio ... |