--- layout: default ---
Network Working Group G. Zorn Request for Comments: 2619 B. Aboba Category: Standards Track Microsoft June 1999 RADIUS Authentication Server MIB Status of this Memo This document specifies an Internet standards track protocol for the Internet community, and requests discussion and suggestions for improvements. Please refer to the current edition of the "Internet Official Protocol Standards" (STD 1) for the standardization state and status of this protocol. Distribution of this memo is unlimited. Copyright Notice Copyright (C) The Internet Society (1999). All Rights Reserved. Abstract This memo defines a set of extensions which instrument RADIUS authentication server functions. These extensions represent a portion of the Management Information Base (MIB) for use with network management protocols in the Internet community. Using these extensions IP-based management stations can manage RADIUS authentication servers. 1. Introduction This memo defines a portion of the Management Information Base (MIB) for use with network management protocols in the Internet community. In particular, it describes managed objects used for managing RADIUS authentication servers. RADIUS authentication servers are today widely deployed by dialup Internet Service Providers, in order to provide authentication services. As a result, the effective management of RADIUS authentication servers is of considerable importance. Zorn & Aboba Standards Track [Page 1] RFC 2619 RADIUS Authentication Server MIB June 1999 2. The SNMP Management Framework The SNMP Management Framework presently consists of five major components: o An overall architecture, described in RFC 2571 [1]. o Mechanisms for describing and naming objects and events for the purpose of management. The first version of this Structure of Management Information (SMI) is called SMIv1 and described in STD 16, RFC 1155 [2], STD 16, RFC 1212 [3] and RFC 1215 [4]. The second version, called SMIv2, is described in STD 58, RFC 2578 [5], RFC 2579 [6] and RFC 2580 [7]. o Message protocols for transferring management information. The first version of the SNMP message protocol is called SNMPv1 and described in STD 15, RFC 1157 [8]. A second version of the SNMP message protocol, which is not an Internet standards track protocol, is called SNMPv2c and described in RFC 1901 [9] and RFC 1906 [10]. The third version of the message protocol is called SNMPv3 and described in RFC 1906 [10], RFC 2572 [11] and RFC 2574 [12]. o Protocol operations for accessing management information. The first set of protocol operations and associated PDU formats is described in STD 15, RFC 1157 [8]. A second set of protocol operations and associated PDU formats is described in RFC 1905 [13]. o A set of fundamental applications described in RFC 2573 [14] and the view-based access control mechanism described in RFC 2575 [15]. Managed objects are accessed via a virtual information store, termed the Management Information Base or MIB. Objects in the MIB are defined using the mechanisms defined in the SMI. This memo specifies a MIB module that is compliant to the SMIv2. A MIB conforming to the SMIv1 can be produced through the appropriate translations. The resulting translated MIB must be semantically equivalent, except where objects or events are omitted because no translation is possible (use of Counter64). Some machine readable information in SMIv2 will be converted into textual descriptions in SMIv1 during the translation process. However, this loss of machine readable information is not considered to change the semantics of the MIB. Zorn & Aboba Standards Track [Page 2] RFC 2619 RADIUS Authentication Server MIB June 1999 3. Overview The RADIUS authentication protocol, described in [16], distinguishes between the client function and the server function. In RADIUS authentication, clients send Access-Requests, and servers reply with Access-Accepts, Access-Rejects, and Access-Challenges. Typically NAS devices implement the client function, and thus would be expected to implement the RADIUS authentication client MIB, while RADIUS authentication servers implement the server function, and thus would be expected to implement the RADIUS authentication server MIB. However, it is possible for a RADIUS authentication entity to perform both client and server functions. For example, a RADIUS proxy may act as a server to one or more RADIUS authentication clients, while simultaneously acting as an authentication client to one or more authentication servers. In such situations, it is expected that RADIUS entities combining client and server functionality will support both the client and server MIBs. 3.1. Selected objects This MIB module contains fourteen scalars as well as a single table: (1) the RADIUS Authentication Client Table contains one row for each RADIUS authentication client that the server shares a secret with. Each entry in the RADIUS Authentication Client Table includes twelve columns presenting a view of the activity of the RADIUS authentication server. 4.  CONTACT-INFO " Bernard Aboba Microsoft Zorn & Aboba Standards Track [Page 3] RFC 2619 RADIUS Authentication Server MIB June 1999 One Microsoft Way Redmond, WA 98052 US Phone: +1<PHONE_NUMBER> EMail<EMAIL_ADDRESS>DESCRIPTION "The MIB module for entities implementing the server side of the Remote Access Dialin User Service (RADIUS) authentication protocol." REVISION "9906110000Z" -- 11 Jun 1999 DESCRIPTION "Initial version as published in RFC 2619" ::= { radiusAuthentication 1 } radiusMIB OBJECT-IDENTITY STATUS current DESCRIPTION "The OID assigned to RADIUS MIB work by the IANA." ::= { mib-2 67 } radiusAuthentication OBJECT IDENTIFIER ::= {radiusMIB 1} radiusAuthServMIBObjects OBJECT IDENTIFIER ::= { radiusAuthServMIB 1 } radiusAuthServ OBJECT IDENTIFIER ::= { radiusAuthServMIBObjects 1 } radiusAuthServIdent OBJECT-TYPE SYNTAX SnmpAdminString MAX-ACCESS read-only STATUS current DESCRIPTION "The implementation identification string for the RADIUS authentication server software in use on the system, for example; `FNS-2.1'" ::= {radiusAuthServ 1} radiusAuthServUpTime OBJECT-TYPE SYNTAX TimeTicks MAX-ACCESS read-only STATUS current DESCRIPTION "If the server has a persistent state (e.g., a process), this value will be the time elapsed (in hundredths of a seco) since the server process was started. For software without persistent state, this value will be zero." ::= {radiusAuthServ 2} Zorn & Aboba Standards Track [Page 4] RFC 2619 RADIUS Authentication Server MIB June 1999 radiusAuthServResetTime OBJECT-TYPE SYNTAX TimeTicks MAX-ACCESS read-only STATUS current DESCRIPTION "If the server has a persistent state (e.g., a process) and supports a `reset' operation (e.g., can be told to re-read configuration files), this value will be the time elapsed (in hundredths of a second) since the server was `reset.' For software that does not have persistence or does not support a `reset' operation, this value will be zero." ::= {radiusAuthServ 3} radiusAuthServConfigReset OBJECT-TYPE SYNTAX INTEGER { other(1), reset(2), initializing(3), running(4)} MAX-ACCESS read-write STATUS current DESCRIPTION "Status/action object to reinitialize any persistent server state. When set to reset(2), any persistent server state (such as a process) is reinitialized as if the server had just been started. This value will never be returned by a read operation. When read, one of the following values will be returned: other(1) - server in some unknown state; initializing(3) - server (re)initializing; running(4) - server currently running." ::= {radiusAuthServ 4} -- New Stats proposed by Dale E. Reed Jr<EMAIL_ADDRESS>radiusAuthServTotalAccessRequests OBJECT-TYPE SYNTAX Counter32 MAX-ACCESS read-only STATUS current DESCRIPTION "The number of packets received on the authentication port." ::= { radiusAuthServ 5} radiusAuthServTotalInvalidRequests OBJECT-TYPE SYNTAX Counter32 MAX-ACCESS read-only STATUS current Zorn & Aboba Standards Track [Page 5] RFC 2619 RADIUS Authentication Server MIB June 1999 DESCRIPTION "The number of RADIUS Access-Request packets received from unknown addresses." ::= { radiusAuthServ 6 } radiusAuthServTotalDupAccessRequests OBJECT-TYPE SYNTAX Counter32 MAX-ACCESS read-only STATUS current DESCRIPTION "The number of duplicate RADIUS Access-Request packets received." ::= { radiusAuthServ 7 } radiusAuthServTotalAccessAccepts OBJECT-TYPE SYNTAX Counter32 MAX-ACCESS read-only STATUS current DESCRIPTION "The number of RADIUS Access-Accept packets sent." ::= { radiusAuthServ 8 } radiusAuthServTotalAccessRejects OBJECT-TYPE SYNTAX Counter32 MAX-ACCESS read-only STATUS current DESCRIPTION "The number of RADIUS Access-Reject packets sent." ::= { radiusAuthServ 9 } radiusAuthServTotalAccessChallenges OBJECT-TYPE SYNTAX Counter32 MAX-ACCESS read-only STATUS current DESCRIPTION "The number of RADIUS Access-Challenge packets sent." ::= { radiusAuthServ 10 } radiusAuthServTotalMalformedAccessRequests OBJECT-TYPE SYNTAX Counter32 MAX-ACCESS read-only STATUS current DESCRIPTION "The number of malformed RADIUS Access-Request packets received. Bad authenticators and unknown types are not included as malformed Access-Requests." ::= { radiusAuthServ 11 } Zorn & Aboba Standards Track [Page 6] RFC 2619 RADIUS Authentication Server MIB June 1999 radiusAuthServTotalBadAuthenticators OBJECT-TYPE SYNTAX Counter32 MAX-ACCESS read-only STATUS current DESCRIPTION "The number of RADIUS Authentication-Request packets which contained invalid Signature attributes received." ::= { radiusAuthServ 12 } radiusAuthServTotalPacketsDropped OBJECT-TYPE SYNTAX Counter32 MAX-ACCESS read-only STATUS current DESCRIPTION "The number of incoming packets silently discarded for some reason other than malformed, bad authenticators or unknown types." ::= { radiusAuthServ 13 } radiusAuthServTotalUnknownTypes OBJECT-TYPE SYNTAX Counter32 MAX-ACCESS read-only STATUS current DESCRIPTION "The number of RADIUS packets of unknown type which were received." ::= { radiusAuthServ 14 } -- End of new radiusAuthClientTable OBJECT-TYPE SYNTAX SEQUENCE OF RadiusAuthClientEntry MAX-ACCESS not-accessible STATUS current DESCRIPTION "The (conceptual) table listing the RADIUS authentication clients with which the server shares a secret." ::= { radiusAuthServ 15 } radiusAuthClientEntry OBJECT-TYPE SYNTAX RadiusAuthClientEntry MAX-ACCESS not-accessible STATUS current DESCRIPTION "An entry (conceptual row) representing a RADIUS authentication client with which the server shares a secret." Zorn & Aboba Standards Track [Page 7] RFC 2619 RADIUS Authentication Server MIB June 1999 INDEX { radiusAuthClientIndex } ::= { radiusAuthClientTable 1 } RadiusAuthClientEntry ::= SEQUENCE { radiusAuthClientIndex Integer32, radiusAuthClientAddress IpAddress, radiusAuthClientID SnmpAdminString, radiusAuthServAccessRequests Counter32, radiusAuthServDupAccessRequests Counter32, radiusAuthServAccessAccepts Counter32, radiusAuthServAccessRejects Counter32, radiusAuthServAccessChallenges Counter32, radiusAuthServMalformedAccessRequests Counter32, radiusAuthServBadAuthenticators Counter32, radiusAuthServPacketsDropped Counter32, radiusAuthServUnknownTypes Counter32 } radiusAuthClientIndex OBJECT-TYPE SYNTAX Integer32 (1..2147483647) MAX-ACCESS not-accessible STATUS current DESCRIPTION "A number uniquely identifying each RADIUS authentication client with which this server communicates." ::= { radiusAuthClientEntry 1 } radiusAuthClientAddress OBJECT-TYPE SYNTAX IpAddress MAX-ACCESS read-only STATUS current DESCRIPTION "The NAS-IP-Address of the RADIUS authentication client referred to in this table entry." ::= { radiusAuthClientEntry 2 } radiusAuthClientID OBJECT-TYPE SYNTAX SnmpAdminString MAX-ACCESS read-only STATUS current DESCRIPTION "The NAS-Identifier of the RADIUS authentication client referred to in this table entry. This is not necessarily the same as sysName in MIB II." ::= { radiusAuthClientEntry 3 } -- Server Counters Zorn & Aboba Standards Track [Page 8] RFC 2619 RADIUS Authentication Server MIB June 1999 -- -- Responses = AccessAccepts + AccessRejects + AccessChallenges -- -- Requests - DupRequests - BadAuthenticators - MalformedRequests - -- UnknownTypes - PacketsDropped - Responses = Pending -- -- Requests - DupRequests - BadAuthenticators - MalformedRequests - -- UnknownTypes - PacketsDropped = entries logged radiusAuthServAccessRequests OBJECT-TYPE SYNTAX Counter32 MAX-ACCESS read-only STATUS current DESCRIPTION "The number of packets received on the authentication port from this client." ::= { radiusAuthClientEntry 4 } radiusAuthServDupAccessRequests OBJECT-TYPE SYNTAX Counter32 MAX-ACCESS read-only STATUS current DESCRIPTION "The number of duplicate RADIUS Access-Request packets received from this client." ::= { radiusAuthClientEntry 5 } radiusAuthServAccessAccepts OBJECT-TYPE SYNTAX Counter32 MAX-ACCESS read-only STATUS current DESCRIPTION "The number of RADIUS Access-Accept packets sent to this client." ::= { radiusAuthClientEntry 6 } radiusAuthServAccessRejects OBJECT-TYPE SYNTAX Counter32 MAX-ACCESS read-only STATUS current DESCRIPTION "The number of RADIUS Access-Reject packets sent to this client." ::= { radiusAuthClientEntry 7 } radiusAuthServAccessChallenges OBJECT-TYPE SYNTAX Counter32 MAX-ACCESS read-only Zorn & Aboba Standards Track [Page 9] RFC 2619 RADIUS Authentication Server MIB June 1999 STATUS current DESCRIPTION "The number of RADIUS Access-Challenge packets sent to this client." ::= { radiusAuthClientEntry 8 } radiusAuthServMalformedAccessRequests OBJECT-TYPE SYNTAX Counter32 MAX-ACCESS read-only STATUS current DESCRIPTION "The number of malformed RADIUS Access-Request packets received from this client. Bad authenticators and unknown types are not included as malformed Access-Requests." ::= { radiusAuthClientEntry 9 } radiusAuthServBadAuthenticators OBJECT-TYPE SYNTAX Counter32 MAX-ACCESS read-only STATUS current DESCRIPTION "The number of RADIUS Authentication-Request packets which contained invalid Signature attributes received from this client." ::= { radiusAuthClientEntry 10 } radiusAuthServPacketsDropped OBJECT-TYPE SYNTAX Counter32 MAX-ACCESS read-only STATUS current DESCRIPTION "The number of incoming packets from this client silently discarded for some reason other than malformed, bad authenticators or unknown types." ::= { radiusAuthClientEntry 11 } radiusAuthServUnknownTypes OBJECT-TYPE SYNTAX Counter32 MAX-ACCESS read-only STATUS current DESCRIPTION "The number of RADIUS packets of unknown type which were received from this client." ::= { radiusAuthClientEntry 12 } Zorn & Aboba Standards Track [Page 10] RFC 2619 RADIUS Authentication Server MIB June 1999 -- conformance information radiusAuthServMIBConformance OBJECT IDENTIFIER ::= { radiusAuthServMIB 2 } radiusAuthServMIBCompliances OBJECT IDENTIFIER ::= { radiusAuthServMIBConformance 1 } radiusAuthServMIBGroups OBJECT IDENTIFIER ::= { radiusAuthServMIBConformance 2 } -- compliance statements radiusAuthServMIBCompliance MODULE-COMPLIANCE STATUS current DESCRIPTION "The compliance statement for authentication servers implementing the RADIUS Authentication Server MIB." MODULE -- this module MANDATORY-GROUPS { radiusAuthServMIBGroup } OBJECT radiusAuthServConfigReset WRITE-SYNTAX INTEGER { reset(2) } DESCRIPTION "The only SETable value is 'reset' (2)." ::= { radiusAuthServMIBCompliances 1 } -- units of conformance radiusAuthServMIBGroup OBJECT-GROUP OBJECTS {radiusAuthServIdent, radiusAuthServUpTime, radiusAuthServResetTime, radiusAuthServConfigReset, radiusAuthServTotalAccessRequests, radiusAuthServTotalInvalidRequests, radiusAuthServTotalDupAccessRequests, radiusAuthServTotalAccessAccepts, radiusAuthServTotalAccessRejects, radiusAuthServTotalAccessChallenges, radiusAuthServTotalMalformedAccessRequests, radiusAuthServTotalBadAuthenticators, radiusAuthServTotalPacketsDropped, radiusAuthServTotalUnknownTypes, radiusAuthClientAddress, radiusAuthClientID, radiusAuthServAccessRequests, radiusAuthServDupAccessRequests, radiusAuthServAccessAccepts, Zorn & Aboba Standards Track [Page 11] RFC 2619 RADIUS Authentication Server MIB June 1999 radiusAuthServAccessRejects, radiusAuthServAccessChallenges, radiusAuthServMalformedAccessRequests, radiusAuthServBadAuthenticators, radiusAuthServPacketsDropped, radiusAuthServUnknownTypes } STATUS current DESCRIPTION "The collection of objects providing management of a RADIUS Authentication Server." ::= { radiusAuthServMIBGroups 1 } END 5. References [1] Harrington, D., Presuhn, R., and B. Wijnen, "An Architecture for Describing SNMP Management Frameworks", RFC 2571, April 1999. [2] Rose, M., and K. McCloghrie, "Structure and Identification of Management Information for TCP/IP-based Internets", STD 16, RFC 1155, May 1990. [3] Rose, M., and K. McCloghrie, "Concise MIB Definitions", STD 16, RFC 1212, March 1991. [4] Rose, M., "A Convention for Defining Traps for use with the SNMP", RFC 1215, March 1991. [5] McCloghrie, K., Perkins, D., Schoenwaelder, J., Case, J., Rose, M. and S. Waldbusser, "Structure of Management Information Version 2 (SMIv2)", STD 58, RFC 2578, April 1999. [6] McCloghrie, K., Perkins, D., Schoenwaelder, J., Case, J., Rose, M. and S. Waldbusser, "Textual Conventions for SMIv2", STD 58, RFC 2579, April 1999. [7] McCloghrie, K., Perkins, D., Schoenwaelder, J., Case, J., Rose, M. and S. Waldbusser, "Conformance Statements for SMIv2", STD 58, RFC 2580, April 1999. [8] Case, J., Fedor, M., Schoffstall, M., and J. Davin, "Simple Network Management Protocol", STD 15, RFC 1157, May 1990. [9] Case, J., McCloghrie, K., Rose, M., and S. Waldbusser, "Introduction to Community-based SNMPv2", RFC 1901, January 1996. Zorn & Aboba Standards Track [Page 12] RFC 2619 RADIUS Authentication Server MIB June 1999 [10] Case, J., McCloghrie, K., Rose, M., and S. Waldbusser, "Transport Mappings for Version 2 of the Simple Network Management Protocol (SNMPv2)", RFC 1906, January 1996. [11] Case, J., Harrington D., Presuhn R., and B. Wijnen, "Message Processing and Dispatching for the Simple Network Management Protocol (SNMP)", RFC 2572, April 1999. [12] Blumenthal, U., and B. Wijnen, "User-based Security Model for Version 3 of the Simple Network Management Protocol (SNMPv3)", RFC 2574, April 1999. [13] Case, J., McCloghrie, K., Rose, M., and S. Waldbusser, "Protocol Operations for Version 2 of the Simple Network Management Protocol (SNMPv2)", RFC 1905, January 1996. [14] Levi, D., Meyer, P., and B. Stewart, "SNMP Applications", RFC 2573, April 1999. [15] Wijnen, B., Presuhn, R., and K. McCloghrie, "View-based Access Control Model for the Simple Network Management Protocol (SNMP)", RFC 2575, April 1999. [16] Rigney, C., Rubens, A., Simpson W. and S. Willens, "Remote Authentication Dial In User Service (RADIUS)", RFC 2138, April 1997. 6. Security Considerations There are a number of management objects defined in this MIB that have a MAX-ACCESS clause of read-write and/or read-create. Such objects may be considered sensitive or vulnerable in some network environments. The support for SET operations in a non-secure environment without proper protection can have a negative effect on network operations. There are a number of managed objects in this MIB that may contain sensitive information. These are: radiusAuthClientAddress This can be used to determine the address of the RADIUS authentication client with which the server is communicating. This information could be useful in impersonating the client. radiusAuthClientID This can be used to determine the client ID of the authentication client with which the server is communicating. This information could be useful in Zorn & Aboba Standards Track [Page 13] RFC 2619 RADIUS Authentication Server MIB June 1999 impersonating the client. It is thus important to control even GET access to these objects and possibly to even encrypt the values of these object when sending them over the network via SNMP. Not all versions of SNMP provide features for such a secure environment. SNMPv1 by itself is not a secure environment. Even if the network itself is secure (for example by using IPSec), there is no control as to who on the secure network is allowed to access and GET/SET (read/change/create/delete) the objects in this MIB. It is recommended that the implementers consider the security features as provided by the SNMPv3 framework. Specifically, the use of the User-based Security Model RFC 2574 [12] and the View-based Access Control Model RFC 2575 [15] is recommended. Using these security features, customer/users can give access to the objects only to those principals (users) that have legitimate rights to GET or SET (change/create/delete) them. 7. Acknowledgments The authors acknowledge the contributions of the RADIUS Working Group in the development of this MIB. Thanks to Narendra Gidwani of Microsoft, Allan C. Rubens of MERIT, Carl Rigney of Livingston and Peter Heitman of American Internet Corporation for useful discussions of this problem space. 8. Authors' Addresses Bernard Aboba Microsoft Corporation One Microsoft Way Redmond, WA 98052 Phone:<PHONE_NUMBER> EMail<EMAIL_ADDRESS>Glen Zorn Microsoft Corporation One Microsoft Way Redmond, WA 98052 Phone:<PHONE_NUMBER> EMail<EMAIL_ADDRESS>9. Intellectural Property Statement Zorn & Aboba Standards Track [Page 14] RFC 2619 RADIUS Authentication Server MIB June 1999 The IETF takes no position regarding the validity or scope of any intellectual property or other rights that might be claimed to pertain to the implementation or use of the technology described in this document or the extent to which any license under such rights might or might not be available; neither does it represent that it has made any effort to identify any such rights. Information on the IETF's procedures with respect to rights in standards-track and standards- related documentation can be found in BCP-11. Copies of claims of rights made available for publication and any assurances of licenses to be made available, or the result of an attempt made to obtain a general license or permission for the use of such proprietary rights by implementors or users of this specification can be obtained from the IETF Secretariat. The IETF invites any interested party to bring to its attention any copyrights, patents or patent applications, or other proprietary rights which may cover technology that may be required to practice this standard. Please address the information to the IETF Executive Director. Zorn & Aboba Standards Track [Page 15] RFC 2619 RADIUS Authentication Server MIB June 1999 10. Full Copyright Statement Copyright (C) The Internet Society (1999). All Rights Reserved. This document and translations of it may be copied and furnished to others, and derivative works that comment on or otherwise explain it or assist in its implmentation may be prepared, copied, published and distributed, in whole or in part, without restriction of any kind, provided that the above copyright notice and this paragraph are included on all such copies and derivative works. However, this document itself may not be modified in any way, such as by removing the copyright notice or references to the Internet Society or other Internet organizations, except as needed for the purpose of developing Internet standards in which case the procedures for copyrights defined in the Internet Standards process must be followed, or as required to translate it into languages other than English. The limited permissions granted above are perpetual and will not be revoked by the Internet Society or its successors or assigns.  Acknowledgement Funding for the RFC Editor function is currently provided by the Internet Society. Zorn & Aboba Standards Track [Page 16]


Combinatorial entropy behaviour leads to range selective binding in ligand-receptor interactions, Nature Communications, 11 (2020) , 4836
On the design of precision nanomedicines, Science Advances, 6 (2020) , eaat0919
Computational design of probes to detect bacterial genomes by multivalent binding, PNAS, 117 (2020) , 8719–8726
On the interpretation of kinetics and thermodynamics probed by single-molecule experiments, Colloid and Polymer Science, 298 (2020) , 819-827
An evaluation of contact models for particle-scale simulation of clay, E3S Web of Conferences, 92 (2019), 14001 , 1-6, ISSN: 2555-0403
Precise generation of selective surface-confined glycoprotein recognition sites, ACS Applied Bio Materials, 2 (2019), 2617-2623, ISSN: 2576-6422
Understanding the Self-Assembly of DNA-Coated Colloids via Theory and Simulations, Frontiers of Nanoscience, 13 (2019), 87-123
Nonequilibrium uptake kinetics of molecular cargo into hollow hydrogels tuned by electrosteric interactions, ACS Nano 13 (2019), 2, 1603-1616
Interaction of proteins with polyelectrolytes: comparison of theory to experiment, Langmuir 35 (2019), 16 , 5373-5391, ISSN: 0743-7463
Competitive adsorption of multiple proteins to nanoparticles: the Vroman effect revisited, Molecular Physics 116 (2018), 21, 3154-3163, ISSN: 0026-8976
Nanoparticle organization controls their potency as universal gluesfor gels, Nano Letters, 18 (2018), 6, 3530-3537, ISSN: 1530-6984
Catalysis by metallic nanoparticles in solution: thermosensitive microgels as nanoreactors, Zeitschrift fur Physikalische Chemie, 232 (2018), 5, 773-803, ISSN: 0942-9352
Theory, simulations and the design of functionalized nanoparticles for biomedical applications: A Soft Matter Perspective, npj Computational Materials, 3 (2017), 48, ISSN: 2057-3960
Catalyzed Bimolecular Reactions in Responsive Nanoreactors, ACS Catalysis, 7 (2017), 9 ,5604-5611, ISSN: 2155-5435
Linear polysialoside outperforms dendritic analogs for inhibition of influenza virus infection in vitro and in vivo, Biomaterials, 138 (2017) , 23-34, ISSN: 1878-5905
Exploiting receptor competition to enhance nanoparticle binding selectivity, Physical Review Letters 118 (2017), 6, 068001, ISSN: 1079-7114
Reaction rate of a composite core–shell nanoreactor with multiple nanocatalysts, Physical Chemistry Chemical Physics, 18 (2016), 30, 20758-20767, ISSN: 1463-9084
Thermosensitive Cu 2 O–PNIPAM core–shell nanoreactors with tunable photocatalytic activity, Journal of Materials Chemistry A, 4 (2016), 24, 9677-9684, ISSN: 2050-7496
Communication: Simple approach for calculating the binding free energy of a multivalent particle, Journal of Chemical Physics, 144 (2016), 161101 , ISSN: 1089-7690
Theory and simulation of DNA-Coated colloids: a guide for rational design, Physical Chemistry Chemical Physics, 18 (2016), 9, 6373-6393, ISSN: 1463-9084
Dr. Stefano Angioletti-Uberti
Senior Lecturer, Theory and Simulations of Materials
Department of Materials
Imperial College London


404 Rewrite Error Page
404 Rewrite Error Page
The page '#{errorBean.page}' was not found!
index page


lrzip
A large file compression program.
See also `lrunzip`, `lrztar`, `lrzuntar`.
More information: home page
- Compress a file with LZMA - slow compression, fast decompression:
lrzip filename
- Compress a file with BZIP2 - good middle ground for compression/speed:
lrzip -b filename
- Compress with ZPAQ - extreme compression, but very slow:
lrzip -z filename
- Compress with LZO - light compression, extremely fast decompression:
lrzip -l filename
- Compress a file and password protect/encrypt it:
lrzip -e filename
- Override the number of processor threads to use:
lrzip -p 8 filename


Item.
Causation – something caused by another thing (human industrial and consumption activity and global average temperature rises, as opposed to natural causes of those temperature rises) is a much higher bar to scale. This requires many independent and repeatable studies, perhaps coming at the problem from different directions.in-context


Simulation Worker¶
-
delphin_6_automation.backend.simulation_worker.
create_submit_file
(sim_id: str, simulation_folder: str, computation_time: int, restart=False) → str[source]¶ Create a submit file for the DTU HPC queue system.
-
delphin_6_automation.backend.simulation_worker.
get_average_computation_time
(sim_id: str) → int[source]¶ Get the average time for this type of construction (2D or 1D)
Parameters: sim_id – Delphin entry id from database Returns: Average simulation time in minutes
-
delphin_6_automation.backend.simulation_worker.
github_updates
()[source]¶ - if general_interactions.get_github_version() != general_interactions.get_git_revision_hash():
- logger.info(‘New version of Delphin 6 Automation is available on Github!!’) return False
- else:
- return True
-
delphin_6_automation.backend.simulation_worker.
hpc_worker
(id_: str, folder='H:/ribuild')[source]¶ Solves a Delphin project through DTU HPC
-
delphin_6_automation.backend.simulation_worker.
local_worker
(id_: str) → Optional[bool][source]¶ Simulation worker. Supposed to be used with main simulation loop.
Parameters: id – Database entry ID from simulation queue Returns: True on success otherwise False
-
delphin_6_automation.backend.simulation_worker.
simulation_worker
(sim_location: str, folder='H:/ribuild') → None[source]¶ Solves Delphin projects in the database until interrupted
-
delphin_6_automation.backend.simulation_worker.
solve_delphin
(file: str, delphin_exe='C:/Program Files/IBK/Delphin 6.0/DelphinSolver.exe', verbosity_level=1) → bool[source]¶ Solves a delphin file locally
-
delphin_6_automation.backend.simulation_worker.
submit_job
(submit_file: str, sim_id: str) → None[source]¶ Submits a job (submit file) to the DTU HPC queue.
-
delphin_6_automation.backend.simulation_worker.
wait_until_finished
(sim_id: str, estimated_run_time: int, simulation_folder: str)[source]¶ Look for summary file. If it is created, continue. If it is not created and the estimated time runs out. Then submit a new job continuing the simulation from where it ended.


--- title: Convergence Diagnostic for Multiple Imputation author: admin date: '2019-11-15' categories: - MSc Thesis tags: - Convergence - MICE - ShinyMICE slug: convergence-diagnostic-for-multiple-imputation linktitle: 2019 11 15 Convergence Diagnostic for Multiple Imputation lastmod: '2019-11-15T16:01:41+01:00' type: "post" # menu: # example: # name: posts # weight: 1 ---
This file describes how convergence diagnostic \(\widehat{R}\) is computed in the simulation study I ran for my Research Report. \(\widehat{R}\) is also called ‘potential scale reduction factor’ or ‘Gelman-Rubin statistic’. It tells us how much the variance of an estimate could be shrunken down if we would have run infinitely many iterations.
It’s easiest to show how \(\widehat{R}\) is computed by applying it on a simple example. Load the nhanes data and impute the variables with missingness.
# load required packages/functions
library(magrittr)
library(mice)
## Loading required package: lattice
##
## Attaching package: 'mice'
## The following objects are masked from 'package:base':
##
## cbind, rbind
source("C:/Users/User/Desktop/shinyMice/Simulation/Functions/Convergence.R")
source("C:/Users/User/Desktop/shinyMice/Simulation/Functions/Convergence_supplement.R")
# set parameters
maxit <- 10
n.var <- 3
# run imputation
imp <- mice(nhanes[,-1], maxit = maxit, print = F)
We are going to compute \(\widehat{R}\) values per imputed variable. As recommended by Vehtari et al. (2019), we compute split-half, rank-normalized \(\widehat{R}\) values for the bulk and the tails of the distribution. For the latter, we need to fold the imputation chains before splitting them in half and rank-normalizing them. Then, \(\widehat{R}\) is computed for both (bulk and tails). The highest of these two \(\widehat{R}\) values is extracted. This is performed for each of the imputed variables, and only the maximum \(\widehat{R}\) value across variables is reported.
The rhat_function function is the wrapper that performs all of this. Within the function, we call 4 other functions (explaination below): fold_sims(), split_chains(), z_scale(), and get.rhat().
# show the contents of the function
rhat_function
## function (imp, maxit, n.var = 4, moment = "mean")
## {
## rhat <- numeric(length = n.var)
## names(rhat) <- attr(imp$chainMean, "dimnames")[[1]]
## if (moment == "mean") {
## sims <- imp$chainMean
## }
## else if (moment == "variance") {
## sims <- imp$chainVar
## }
## for (v in 1:n.var) {
## rhat_bulk <- sims[v, , ] %>% split_chains() %>% z_scale() %>%
## get.rhat(maxit = maxit)
## rhat_tail <- sims[v, , ] %>% fold_sims() %>% split_chains() %>%
## z_scale() %>% get.rhat(maxit = maxit)
## rhat[v] <- max(rhat_bulk, rhat_tail)
## }
## return(rhat)
## }
The first function inside rhat_function is split_chains(). This ‘chops’ the chains in two, to assess trending within chains.
# show the contents of the function
split_chains
## function (sims)
## {
## niter <- dim(sims)[1]
## if (niter < 4)
## return(sims)
## half <- niter/2
## cbind(sims[1:floor(half), ], sims[ceiling(half + 1):niter,
## ])
## }
Then the halved chains are rank-normalized.
# show the contents of the function
z_scale
## function (x)
## {
## S <- length(x)
## r <- rank(x, ties.method = "average")
## z <- qnorm((r - 1/2)/S)
## if (!is.null(dim(x))) {
## z <- array(z, dim = dim(x), dimnames = dimnames(x))
## }
## z
## }
To detect non-convergence in the tails, \(\widehat{R}\) is also computed on the folded chains (which are also split and rank-normalized).
# show the contents of the function
fold_sims
## function (sims)
## {
## abs(sims - median(sims))
## }
Only then do we get to the actual \(\widehat{R}\) function. In the get.rhat function, the following equations are applied:
"In the equations below, \(N\) is the number of draws per chain, \(M\) is the number of chains, and \(S = MN\) is the total number of draws from all chains. For each scalar summary of interest \(\theta\), we compute \(B\) and \(W\), the between- and within-chain variances:
\[\begin{align*} B =\frac{N}{M-1} \sum_{m=1}^{M}\left(\bar{\theta}^{(\cdot m)}-\bar{\theta}^{(\cdot \cdot)}\right)^{2}, \text { where } \bar{\theta}^{(\cdot m)}=\frac{1}{N} \sum_{n=1}^{N} \theta^{(n m)}, \text { and } \bar{\theta}^{(\cdot \cdot)}=\frac{1}{M} \sum_{m=1}^{M} \bar{\theta}^{(\cdot m)} \\ W =\frac{1}{M} \sum_{m=1}^{M} s_{j}^{2}, \text { where } s_{m}^{2}=\frac{1}{N-1} \sum_{n=1}^{N}\left(\theta^{(n m)}-\bar{\theta}^{(\cdot m)}\right)^{2}". \text{ Vehtari et al., 2019, p. 5} \end{align*}\]
The between and within chain variances are computed from the chain means of the mids object, that underwent the previous transformations (folding, splitting, rank-normalizing). The average of the chain means per imputation \(m\) is \(\bar{\theta}^{(\cdot m)}\). The average of these \(m\) values is \(\bar{\theta}^{(\cdot \cdot)}\). \(N\) is the number of iterations (‘maxit’). So we compute \(B\) as maxit * var(apply(sims, 2, mean))
. And \(W\) is computed as mean(apply(sims, 2, var))
.
To get \(\widehat{R}\) we need to compute the weighted average of \(B\) and \(W\), \(\widehat{\operatorname{var}}^{+}\), and evaluate this against the within chain variance W. The weighted average is is computed as follows:
\[\begin{equation*} \widehat{\operatorname{var}}^{+}(\theta | y)=\frac{N-1}{N} W+\frac{1}{N} B, \end{equation*}\]
Then finally, potential scale reduction factor \(\widehat{R}\) is obtained as:
\[\begin{equation*} \widehat{R}=\sqrt{\frac{\widehat{\operatorname{var}}^{+}(\theta | y)}{W}}. \end{equation*}\]
\(\widehat{R}\) is computed for each variable with the function ‘get.rhat()’.
# show the contents of the function
get.rhat
## function (sims, maxit = maxit)
## {
## var_between <- maxit * var(apply(sims, 2, mean))
## var_within <- mean(apply(sims, 2, var))
## rhat <- sqrt((var_between/var_within + maxit - 1)/maxit)
## return(rhat)
## }
Now we know what’s happening, let’s apply it.
rhat_function(imp, maxit, n.var = n.var)
## bmi hyp chl
## 1.101684 1.058439 1.155748
This \(\widehat{R}\) value is nice and high, but I also got values below one. Which is theoretically impossible.


About Me
The Rundown
Bio
I have a great passion for coding and web developement. I created the Central Florida Developers Network website in order to bring the developer community together. I am currently exploring different techniques with React.js and a variety of databases such as MongoDB and Firebase/Firestore. I plan on doing a series of videos, with projects, on the subject. I have apps deployed on Heroku, Github, Netlify and Google's Firebase. Please see my Portfolio page to check out some of my work.
SKILLS SUMMARY: HTML5, CSS3, JavaScript, React.js, MySQL, MongoDB, Node.js, GraphQL, Responsive Design, Heroku, Github, User Authentication and Firebase/Firestore.
Degrees & Certifications: B.A. Economics, UCF Full Stack Web Development Certification, Comptia Net+ and A+
Overseas Experience: Afghanistan, Liberia, India
Convergys
Manager Microsoft Account
I have been with Convergys for the last 5 years. I recently built the Microsoft account and continue to manage 50 employees on the account. I took a brief leave to work overseas.
Khandoor Media
Full Stack Developer
This is the umbrella that I pursue my web developement interests under.
Developer Tutor
Mentor
I think it is always important to help those that you can and those who are in need.


Next: Contacting servers, Previous: Network, Up: Network [Contents][Index]
There are three fundamental values that control how Polipo speaks to
clients. The variable proxyAddress
, defines the IP address on
which Polipo will listen; by default, its value is the loopback
address "<IP_ADDRESS>"
, meaning that Polipo will listen on the
IPv4 loopback interface (the local host) only. By setting this
variable to a global IP address or to one of the special values
"::"
or "<IP_ADDRESS>"
, it is possible to allow Polipo to
serve remote clients. This is likely to be a security hole unless you
set allowedClients
to a reasonable value (see Access control).
Note that the type of address that you specify for proxyAddress
will determine whether Polipo listens to IPv4 or IPv6. Currently, the
only way to have Polipo listen to both protocols is to specify the
IPv6 unspecified address ("::"
) for proxyAddress
.
The variable proxyPort
, by default 8123, defines the TCP port
on which Polipo will listen.
The variable proxyName
, which defaults to the host name of the
machine on which Polipo is running, defines the name of the
proxy. This can be an arbitrary string that should be unique among
all instances of Polipo that you are running. Polipo uses it in error
messages and optionally for detecting proxy loops (by using the
‘Via’ HTTP header, see Censoring headers). Finally, the
displayName
variable specifies the name used in user-visible
error messages (default “Polipo”).
| • Access control: | Deciding who can connect. |
Next: Contacting servers, Previous: Network, Up: Network [Contents][Index]


{% extends "base.html" %} {% block title %}Account activation complete{% endblock %} {% block page_title %}Account activation complete{% endblock %} {% block content %}
Congratulations, your account has been activated.
Login and start having fun!


Vaibhav Ahuja
Hey, I am Vaibhav Ahuja, currently working as a SWE at United Health Group, GGN. I graduated in 2019 with a bachelors degree in Electrical Engineering from Delhi Technological University. I am interested in Mathematics, and like solving algorithmic problems. This blog is to document my learnings, ideas, projects, and about any stuff that excites me.
- iot/ Controlling home lamp using internet
- project/ Effective Testing Strategy for preventing Community Spread of COVID-19
- algo/ Range Queries
- project/ Secura - store passwords securely
- algo/ Educational DP contest 🚧
- List of div2C Problems
- Cryptocurrency explained
- iot/ The P10 Display.
- project/ Sarcastic or not? (1/2)
Powered by Jekyll


transitionMatrix.estimators subpackage¶
Submodules¶
transitionMatrix.estimators.aalen_johansen_estimator module¶
-
class
transitionMatrix.estimators.aalen_johansen_estimator.
AalenJohansenEstimator
(cohort_intervals=None, states=None)¶ Bases:
transitionMatrix.estimators.DurationEstimator
Class for implementing the Aalen-Johansen estimator for the transition matrix
-
fit
(data, labels=None)¶ - Parameters
data (dataframe) – The data to use for the estimation provided in a pandas data frame in long format, with one row per observed transition. The data frame must contain the following columns: – ID: A unique entity identification number – FROM: State from where a transition occurs – TO: State to which a transition occurs – TIME Time when a transition occurs
labels (a dictionary for relabeling column names) –
constraint possible transitions (absorbing states) (TODO) –
censored data (TODO) –
partial dates (TODO) –
covariance calculation (TODO) –
confidence intervals (TODO) –
- Returns
etm.values (estimated empirical transition matrix throughout the observed interval.)
This is a three dimensional array object (From State, To State, Timepoint)
observation_times (a list of observation times)
etm.observation_times
TODO Store counts as well as frequencies
TODO Optional Binning of close observation times
Notes
The input data MUST be sorted in ascending time order
-
transitionMatrix.estimators.cohort_estimator module¶
-
class
transitionMatrix.estimators.cohort_estimator.
CohortEstimator
(cohort_intervals=None, states=None, ci=None)¶ Bases:
transitionMatrix.estimators.BaseEstimator
Class for implementing a Cohort estimator for the transition matrix under the assumption of time homogeneity
-
fit
(data, labels=None)¶ - Parameters
data (array-like) – The data to use for the estimation
labels (a dictionary for relabeling column names) –
- Returns
matrix (estimated transition matrix)
confint_lower (lower confidence interval)
confint_upper (upper confidence interval)
Notes
-
transitionMatrix.estimators.kaplan_meier_estimator module¶
-
class
transitionMatrix.estimators.kaplan_meier_estimator.
KaplanMeierEstimator
(cohort_intervals=None, states=None)¶
transitionMatrix.estimators.simple_estimator module¶
-
class
transitionMatrix.estimators.simple_estimator.
SimpleEstimator
(cohort_intervals=None, states=None, ci=None)¶ Bases:
transitionMatrix.estimators.BaseEstimator
Class for implementing a simple estimator suitable for single period transitions
-
fit
(data)¶ - Parameters
data (array-like) – The data to use for the estimation
- Returns
matrix (estimated transition matrix)
confint_lower (lower confidence interval)
confint_upper (upper confidence interval)
Notes
-
Module contents¶
-
class
transitionMatrix.estimators.
BaseEstimator
¶ Bases:
object
Base class for implementing any transition matrix estimator
Offers basic methods common to all estimators
-
get_matrix_set
()¶
-
print
(select='Frequencies', period=None)¶ Pretty print the estimated matrices :return:
-
summary
(k=0)¶ Pretty-print a summary of estimation results (values and confidence intervals)
-
-
class
transitionMatrix.estimators.
DurationEstimator
(cohort_intervals=None, states=None)¶ Bases:
transitionMatrix.estimators.BaseEstimator
Base class for implementing any duration based transition matrix estimator
Offers methods common to all duration based estimators Two subclasses: - Time homogeneous estimator (constant transition rates) - Time inhomogeneous estimator (variable transition probabilities) Aalen-Johansen
T(s, t) = T(0, t) (transition from start=0) Compute transition_times(k) T^ij(t) numpy(i,j,k)
Transitions at cohort intervals Approximate numpy(i,j, k_index : largest k-value that is less than t(boundary))


The goal of WesCell is to faciliate and acceralte the process of analyzing sample cells for Wesleyan students. This package is created for people without background knowledge of coding in hope that it will streamline the data manipulation and analysis process.
You can install the released version of WesCell with the following code:
if (!require(devtools)){ install.packages("devtools") } devtools::install_github("qqcher/WesCell")
This is a basic example which shows how to import your raw RT-qPCR csv file:
library(WesCell) result <- analyze.qPCR("your raw RT-qPCR csv file")
The result is in a list form. To convert the list into a dataframe and clean the dataframe, use the following code:
result_df <- list.to.df(result) result_df <- clean.data(result_df)
After the previous two steps, your data should be ready for further analysis. Following are some of the tests you can run:
## Willcoxon Test Wilcoxon <- df.wilcoxon.test(result_df,"Primer","inflammatory.factor","exp.data","cell.line") ## 3sub Unique Average sub_average <- df.3sub.unique.av(df,"Primer","inflammatory.factor","Sample","exp.data","cell.line") ## T-test T_test <- df.t.test(df,"Primer","inflammatory.factor","exp.data","cell.line")
Authors@R:
person(given = "Camille",
family = "Chossis",
role = c("aut", "cre"),
email =<EMAIL_ADDRESS>comment = c(ORCID = "https://orcid.org/0000-0003-4931-9015"))
person(given = "Cher",
family = "Qin",
role = c("aut", "cre"),
email =<EMAIL_ADDRESS>Description: Steamline RT-qPCR raw data analysis.
License: MIT + file LICENSE
Encoding: UTF-8
LazyData: true
Roxygen: list(markdown = TRUE)
RoxygenNote: 7.1.1
Imports:
utils,
stats
Suggests:
knitr,
rmarkdown
VignetteBuilder: knitr


Pedestrian killed in hit-and-run crash in Makakilo
by HNN StaffMAKAKILO, Hawaii (HawaiiNewsNow) - Honolulu police are investigating a deadly hit-and-run crash in Makakilo late Wednesday.
It happened at about 6:50 p.m.
According to police, a 39-year-old pedestrian was crossing Makakilo Drive, south of Palailai Street, when she was struck by what witnesses described as a dark-colored truck.
Police said the driver fled the scene.
The woman was rushed to the hospital, where she later died.
She was not in a marked crosswalk, authorities said.
The truck is described as having white letterings and utility compartments on the side.
This is the 46th traffic death on Oahu this year compared to 56 in 2018.
This comes just a day after a fatal hit-and-run crash involving a pedestrian on Maui. Police have not yet located the vehicle involved.
Copyright 2019 Hawaii News Now. All rights reserved.


Pugazhendhi sees scope for Sasikala’s ‘smooth re-entry’ into AIADMK
‘Dhinakaran-led AMMK will be subsumed by ruling party’
by Special CorrespondentExpelled AMMK leader V. Pugazhendhi on Sunday sought to link his decision to rejoin the AIADMK with the “smooth re-entry” of late Chief Minister Jayalalithaa’s jailed aide V.K. Sasikala into the ruling party.
At a press conference, Mr. Pugazhendhi side-stepped questions on whether he had consulted with Ms. Sasikala about his decision to re-join the AIADMK. “Having been part of the AIADMK for more than 30 years, Ms. Sasikala will take a decision [on rejoining the party] herself,” he said, adding, “As a friend, I will extend my help on a humanitarian basis.”
The T.T.V. Dhinakaran-led AMMK will be subsumed by the AIADMK, he said.
Mr. Pugazhendhi praised Chief Minister Edappadi K. Palaniswami as the “hero of Tamil Nadu”. With the return of AMMK cadre to the AIADMK, the ruling party will romp home with a massive victory in the forthcoming civic polls, he said.


Psalms 119:144
The righteousness of thy testimonies is everlasting: give me understanding, and I shall live.


Hi there,
I am running an emoncms/emonHub installation on a Raspberry Pi which is receiving data from an emonTX and an emonTH.
Additionally the Pi is posting other data directly into emoncms. Now I would like to display this data on my emonGLCD. Also displaying emonTX data after processing in emoncms would be very interesting.
I've read in an other thread that this is a planned feature for emonHub in the future - for now it can be done by adding a "hack" to emonHub.
@pb66: Paul, could you explain what I have to do to send out an emoncms feed value, let say, every 20 seconds?
Thank you very much
Matthias
Re: How to send feed data from emoncms to emonGLCD?
In the not so distant future I hope emonHub will have the ability to route data from one source to another directly, but for the moment the easiest route is to "fetch" a value(s) from emoncms.
To "fetch" multiple feed values in a single request
so the idea is to "fetch" the feed values from emoncms and send them out over the RFM network much the same way the "PacketGen hack" works.
Using Emonhub with the emoncms PacketGen module
Won't need to install packetgen, but will still need to import urllib2, you will also need to import struct.
The main bit that needs changing is the 2 "packet" lines
packet = urllib2.urlopen("http://localhost/emoncms/packetgen/rfpacket.json?apikey=APIKEY").read()
packet = packet[1:-1]
The first one will need to be changed to "fetch" the feed values by id number. This will return float values that need to be converted to byte values for transmission. The second line will need some experimenting probably but you can try replacing it with something like, which should unpack each float into 4 byte values
I haven't tested this at all so may need some debugging (who am I kidding? it almost definitely will need debugging) there's certainly enough there to get the gist at least.
The pit fall of using a url request is that if there is no response it can block emonhub from continuing until it times out,
You may want to re think how the data arrives at the emonGLCD, if you have 3 sources time, hack and emonth/tx it will weigh heavily on the glcd sketch, so you may want to amalgamate payloads by getting all data from emoncms.
If you squeeze it all into one payload you could use the existing timer rather than adding the packetgen one.
Sending a time update to emonGLCD from emonHub
I'm not really the guy to help you with the glcd sketch but I'm happy to help with the emonhub end of things.
Paul
Re: How to send feed data from emoncms to emonGLCD?
What are the value ranges of the emoncms values (min, max and decimal precision)? the payload size can be reduced by not using 4 byte floats.
Re: How to send feed data from emoncms to emonGLCD?
Hey Paul,
thank you very much for your detailed description.
Although Python is really new to me (I am familiar with microcontrollers and C) I got it working finally ;-)
I followed your advice to get all data, which is to be displayed on emonGLCD, from emoncms feeds. So I am using the _send_time() function to send out all necessary data.
Here is how my _send_time() functions looks like now:
""" Send time and feed data to emonGLCD """
packet = urllib2.urlopen("http://localhost/emoncms/feed/fetch.json?ids=12,22,27&apikey=my_read_api_key").read()
self._log.info(self.name + " broadcasting feed values: " + packet)
packet = packet.translate(None, '"[]')
sendstr = "%02d,%02d,%02d,%02d," % (now.day, now.hour, now.minute, now.second)
packet = packet.split(',')
for value in packet:
bytes = struct.unpack('BBBB', struct.pack('<i', int((float(value) + 0.05) * 10)))
for byte in bytes:
sendstr = sendstr + "%d," % int(byte)
sendstr = sendstr + "s"
self._ser.write(sendstr)
I add 4 bytes for date/time information at the beginning, then send out the feed values multiplied by 10 (and rounded to get one decimal place precision).
On the emonGLCD side I receive the data with this structure:
typedef struct { uint8_t day, hour, minute, seconds; int32_t data1, data2, data3; } PayloadHub;
Thank you very much for pointing me in the right direction - I really appreciate it!
Best regards,
Matthias
Re: How to send feed data from emoncms to emonGLCD?
Fantastic, thanks for sharing your solution. Constructing the string as you go makes far more sense than appending to a list, I prefer your way. May I ask what the translate line is for ? (I'm not a programmer so forgive me if it's obvious)
Paul
Re: How to send feed data from emoncms to emonGLCD?
The translate function is for removing some unwanted characters from the string.
From emoncms you get something like this: ["2195","5.424","1"]
To use it with the split function, I remove the brackets and the quote signs to get this: 2195,5.424,1
Matthias
Re: How to send feed data from emoncms to emonGLCD?
Ah, yes of course! I did raise a question about the format of the returned data a while back on git https://github.com/emoncms/emoncms/issues/273 , but that's quite a effective way of "trimming off the fat"
Paul
Re: How to send feed data from emoncms to emonGLCD?
Hi, I'm using packet gen such described here https://github.com/emoncms/emoncms/blob/low-write/docs/emonhubmod.md#usi... .
I send to emonglcd the outer temperature readed from emoncms, all is ok, but if the temperature is under 0 I receive a strange value, how to decode negative value?


You will be given a multiple choice question. Answer correctly and your score goes up. Answer incorrectly and you lose 10 seconds off the timer.


Sign In
Sign Up
Email
Confirm Email
Password
Sign Up
Sign Up
Sign In
Email
Password
Forgot Password
Sign In


WITNESS LIST Appropriations-S/C on General Government Committee February 8, 1999-8:00A Budget On: Artalejo, Leo (West Texas Regional Poison Center) Baker, Thomas (Texas Veterans Commission) Bier, Samuel (Veterans) Brieden, John (Texas Veterans Commission) Buerschinger, Charlie (Texas Veterans Commission) Chambers, Fred (Veterans) DeLuna, Carlos (Veterans) Duncan, James (Texas Veterans Commission) Edwards, Kimberly (Texas Public Finance Authority) Ellis, Michael (South East Texas Poison Center) Gardner, Glen (Texas VFW) Goerke, James (Advisory Commission on State Emergency Communications) Greene, Stonell (Dallas County Veteran's Service Officer) Harris, Ron (Advisory Commission on State Emergency Communications) Harrison, Tom (Texas Ethics Commission) Hernandez, Jose (Texas Bond Review Board) Horwitz, Rita (Pension Review Board) Kerr, John (Texas Public Finance Authority) Nier, James (Texas Veterans Commission) Odell, Herb (Texas Veterans Commission) Purcell, Carolyn (Department of Information Resources) Rich, Laurie (Office of State and Federal Relations) Roberts, Wayne (Governor's Office of Budget and Planning) Santana, Domingo (Veterans) Shivers, Shari (Pension Review Board) Spence, Carey (Advisory Commission on State Emergency Communications)


IRunes
Home
Albums
Logout
Create Track
Name:
Link:
Price:
Overwrite If Title Exists
Use Existing If Title Exists
Make New If Title Exists
CopyRight
Ⓒ
Sanity Design Studios. All rights reserved.


cloudmesh-storage.cloudmesh.storage.command.storage
¶
Module Contents¶
Classes¶
-
class
cloudmesh-storage.cloudmesh.storage.command.storage.
StorageCommand
¶ Bases:
cloudmesh.shell.command.PluginCommand
-
do_storage
(self, args, arguments)¶ - Usage:
storage run storage clean storage monitor [–storage=SERVICES] [–status=all | –status=STATUS] [–output=output] [–clear] storage create dir DIRECTORY [–storage=SERVICE] [–parallel=N] [–run] storage get SOURCE DESTINATION [–recursive] [–storage=SERVICE] [–parallel=N] [–run] storage put SOURCE DESTINATION [–recursive] [–storage=SERVICE] [–parallel=N] [–run] storage list [–storage=SERVICE] [SOURCE] [–recursive] [–parallel=N] [–output=OUTPUT] [–dryrun] [–run] storage delete SOURCE [–storage=SERVICE] [–parallel=N] [–dryrun] [–run] storage search DIRECTORY FILENAME [–recursive] [–storage=SERVICE] [–parallel=N] [–output=OUTPUT] [–run] storage sync SOURCE DESTINATION [–name=NAME] [–async] [–storage=SERVICE] storage sync status [–name=NAME] [–storage=SERVICE] storage config list [–output=OUTPUT] storage copy –source=SOURCE:SOURCE_FILE_DIR –target=TARGET:TARGET_FILE_DIR [–run] storage cc –source=SOURCE:SOURCE_FILE_DIR –target=TARGET:TARGET_FILE_DIR
This command does some useful things.
- Arguments:
SOURCE SOURCE can be a directory or file DESTINATION DESTINATION can be a directory or file DIRECTORY DIRECTORY refers to a folder on the cloud service SOURCE:SOURCE_FILE_DIR source provider name: file or directory name TARGET:SOURCE_FILE_DIR destination provider name
- Options:
- --storage=SERVICE
specify the cloud service name like aws or azure or box or google
- Description:
commands used to upload, download, list files on different cloud storage services.
- storage run
Execute the actions in database that are in waiting status.
> storage monitor [–storage=SERVICE] > [–status=all | –status=STATUS] > [–output=output] > [–clear]
Monitor the actions in database and refresh every 5 seconds.
> storage put SOURCE DESTINATION [–recursive] [–storage=SERVICE] > [–parallel=N]
Uploads the file specified in the filename to specified cloud from the SOURCEDIR.
> storage get SOURCE DESTINATION [–recursive] [–storage=SERVICE] > [–parallel=N]
Downloads the file specified in the filename from the specified cloud to the DESTDIR.
- storage delete SOURCE [–parallel=N] [–dryrun]
Deletes the file specified in the filename from the specified cloud.
> storage list [SOURCE] [–recursive] [–parallel=N] > [–output=OUTPUT] [–dryrun]
lists all the files from the container name specified on the specified cloud.
- storage create dir DIRECTORY [–storage=SERVICE] [–parallel=N]
creates a folder with the directory name specified on the specified cloud.
> storage search DIRECTORY FILENAME [–recursive] > [–storage=SERVICE] > [–parallel=N] > [–output=OUTPUT]
searches for the source in all the folders on the specified cloud.
- sync SOURCE DESTINATION
- puts the content of source to the destination.
- If –recursive is specified this is done recursively from
the source
If –async is specified, this is done asynchronously If a name is specified, the process can also be monitored
with the status command by name.
If the name is not specified all date is monitored.
- sync status
The status for the asynchronous sync can be seen with this command
- config list
Lists the configures storage services in the yaml file
- storage copy SOURCE DESTINATION
Copies files from source storage to destination storage. The syntax of SOURCE and DESTINATION is: SOURCE - awss3:source.txt DESTINATION - azure:target.txt
Description of the copy command:
Command enables to Copy files between different cloud service providers, list and delete them. This command accepts aws , google and local as the SOURCE and TARGET provider.
cms storage copy –source=SERVICE:SOURCE –target=DEST:TARGET
Command copies files or directories from Source provider to Target Provider.
- cms storage slist –source=SERVICE:SOURCE
Command lists all the files present in SOURCE provider’s in the given SOURCE_FILE_DIR location This command accepts aws or google as the SOURCE provider
- cms storage sdelete –source=SERVICE:SOURCE
Command deletes the file or directory from the SOURCE provider’s SOURCE_FILE_DIR location
Examples: > cms storage_service copy –source=local:test1.txt > –target=aws:uploadtest1.txt
cms storage_service list –source=google:test cms storage_service delete –source=aws:uploadtest1.txt
cms storage put test_file1.txt aws_test_file1.txt cms storage put ./recur_dir recur_dir_aws/ –recursive cms storage put ./recur_dir recur_dir_aws/
cms storage get aws_test_file1.txt aws_file1.txt cms storage get recur_dir_aws from_aws_dir cms storage get recur_dir_aws from_aws_dir –recursive
cms storage list cms storage list –recursive cms storage list aws:recur_dir_aws –recursively
cms storage delete aws:aws_test_file1.txt
cms storage search recur_dir_aws recur_file1.txt
- Example:
set storage=aws storage put SOURCE DESTINATION –recursive
is the same as storage –storage=aws put SOURCE DESTINATION –recursive
storage copy aws:source.txt oracle:target.txt
-


Using an array for a path value to get retries, with map in play. See 1069
Check console for messages


Copilots Travel Map
👋 Hello Copilot 👩✈!
This is a visualization of all the countries that copilots around the world traveled to.
Click on the countries you visited to contribute!
Copilots have visited {{.TotalCountries}} {{if eq .TotalCountries 1}}country{{else}}countries{{end}} so far!
The visualization is inspired from @karimdouieb/world-tile-grid-map.


wmtsa: Wavelet Methods for Time Series Analysis
Software to book Wavelet Methods for Time Series Analysis,
Donald B. Percival and Andrew T. Walden, Cambridge University
Press, 2000.
| Version: |
2.0-3 |
| Depends: |
R (≥ 3.0.2) |
| Imports: |
splus2R (≥ 1.2-0), ifultools (≥ 2.0-0), MASS, graphics, methods |
| Published: |
2017-12-06 |
| Author: |
William Constantine [cre, aut],
Donald Percival [aut] |
| Maintainer: |
William Constantine <wlbconstan at gmail.com> |
| License: |
GPL-2 |
| NeedsCompilation: |
no |
| Materials: |
README |
| In views: |
TimeSeries |
| CRAN checks: |
wmtsa results |
Downloads:
Reverse dependencies:
Linking:
Please use the canonical form
https://CRAN.R-project.org/package=wmtsa
to link to this page.


abstract fun stop(): Unit
Stops the underlying BLE scan. Depending on a ProximityObserver configuration, it may make an additional network calls such as analytics data.


The Philippines National Halal Laboratory and Halal Science Center is the premier institution under the Department of Science and Technology Regional Office 12 in the Republic of the Philippines.
The PNHLHSC is manned and managed by competent and dedicated Muslim Ranking Officials, scientists and employees that ensures authenticity of results from tests and analysis of Products and maintain integrity and discipline to sustain customers’ trusts and confidence for the certified by the PNHCL Halal Products made by Filipino Manufacturers and exported from the Philippines to the global markets.
The PNHLHSC is equipped with state of the art laboratory equipment indispensable to determine the genuineness of Halal Products and can guarantee that its certified Halal Products of the manufacturers being supplied to the local and international consumers are authentic and free from adulteration and critical ingredients.
The PNHLHSC is the main source of science and technology on Halal that can assist Halal patrons, practitioner, scientists and technologists including researchers and the academe and those that vested their interest upon Halal for their economic prosperity and physical wellness and improvements.
By 2020, The Philippine National Halal Centre and Laboratory will be the main passport of Halal Industry Products for both local and international consumers and the source of Halal knowledge for scientists, researchers and practitioners
The Philippine National Halal Centre and Laboratory is mandated to coordinate science and technology on Halal and ensure that the results therefrom will be utilized for the maximum benefits of the producers and consumers of Halal Products


| Carrot jam with ginger |
| Tomato jelly |
| Bitter Orange Marmalade |
| Mango marmalade |
| Red plum jam |
| Fig jam |
| Tamarind marmalade |
| Peanut Butter |
| Walnut jamoncillo |
| Tarugos |
| Cocada |
| Prawns peanuts |
| Peanut Mazapan |
| Glories |
| Alegrias de amaranto |
| Borrachitos |
| Cheesecake and condensed milk |
| Apple pie with puff pastry |
| Chocolate pudding with strawberry |
| Crunchy bonbons |
| Heart cake with condensed milk and lemon |
| Chocolate muffins with nuts |
| Meat roll with bacon |
| Meatloaf Sandwich |
| Cheese pumps |
| Wrapped barbecue sausage |


This example shows how to work with HTML responses using the infinity plugin. For this demonstration, we don't have any of the usual paging parameters ({first}, {page} or {count}), so the page is really infinite.


Define how transactions with multiple labels should show up in analytics.
Labels with a higher dominance value are considered exclusively and "absorb"
other labels on the same transaction with a lower dominance value.
If multiple labels on a transaction have the same dominance value, they form
a new combined label type.


<EMAIL_ADDRESS>+(000) 123 234 22
A
ndragogy
Toggle navigation
Home
Gallery
About Us
Short Codes
Web Icons
Typography
Mail Us
Mail
us
Name
Email
Subject
© 2017 Andragogy. All Rights Reserved | Design by


Scott Van Pelt and Ryen Russillo discuss Kevin Durant's epic scoring run as well as whether the NBA has a tanking problem. Plus, they chat with Matt Hasselbeck and Bill Self.
Rate the audio:


Indiana
I'm a Junkie-Monkey!
Registered: Oct 2001
Location: Incommincado Tyler Durden says: Do we really need another women?
Posts: 3087 |
We shall all have to wait for season six, so what? You're not alone in that.
However, there will be no cliffhanger this year. Wheeeee. Cool.
__________________
"Now I'm cleaning up and I'm moving on, going straight and choosing life. I'm looking forward to it already.  The washing machine, the car, the compact disc and electric tin opener, good health, low cholesterol, dental insurance, mortgage, starter home, leisure wear, luggage, three piece suite, DIY, game shows, junk food, children, walks in the park, nine to five, good at golf, washing the car, choice of sweaters, family Christmas, indexed pension, tax exemption clearing gutters, getting by, looking ahead, the day you die."
Report this post to a moderator | ? + *
|


So far my only project is this website.


Confirm that you would like to create a reservation for {{name}} with party of {{partySize}} on {{date}} at {{time}}.


MEN IN BLACK A film review by Mark R. Leeper
Capsule: MEN IN BLACK is a smart, funny tabloid-paranoia comedy about the hard-boiled G-men who keep a lid the government's biggest secret. That is the "fact" that not just one but many alien races visit the Earth--mostly New York City--and use it as an interstellar border-town and duty-free shop. Humor and (impressive) special effects rarely mix this well on the screen. Rating: +2 (-4 to +4), 7 (0 to 10)
Steven Spielberg's Amblin Entertainment has turned a dubious premise into a delightful science fiction comedy. Taking much the same premise as TV's DARK SKIES, but handling it very differently, MEN IN BLACK tells the story of special, super-secret government agents charged with the responsibility for keeping the secret that at any given time there are about 1500 space aliens running around on Earth, natives of hundreds of different inhabited worlds. Most are friendly, but of course wherever there are lots of aliens there will always be a few rotten apples who want to vaporize the planet Earth for the greater glory of someone with a name like Zordalg. New York cop James Edwards (played by Will Smith) knows nothing of this, of course. He just knows that something is strange when he runs down a felon with funny eyes. This feat earns him a candidacy for some unspecified government job that turns out to be joining the Men in Black. Once chosen he is re- dubbed Agent J working with the experienced and cagey Agent K (Tommy Lee Jones).
Ed Solomon's script, based on the comic book by Lowell Cunningham, is a barrage of funny lines and scenes of just how strange things can be dealing with aliens. But all that is about the background for the real plot. The actual story gets very little screentime comparatively. The film is short as it is at 98 minutes and most of that time is taken up with the background. The actual story deals with two alien races fighting over the fate of a galaxy. One race is represented by an old Jewish man controlled by good-guy aliens. The other is an evil giant bug who possesses the body of the redneck Edgar. Vincent D'Onofrio plays the possessed Edgar, but like most people would be the first time behind the wheel of an 18-wheel truck, the creature just cannot get the hang of the controls. D'Onofrio is usually a serious actor, as he was in THE WHOLE WIDE WORLD, but here he shows a real genius for physical comedy. He manages to walk his human body around, but not one body part moves naturally. Because so much of the film is taken up with introduction to the premise this feels like the first film of series or perhaps a pilot for a film series. And if public enthusiasm remains high, sequels of some form seem inevitable. Director Barry Sonnenfeld is best known for directing the two Addams Family films and GET SHORTY. His Addams Family series was cut short by the death of Raoul Julia, but he now has another chance in much the same vein with MEN IN BLACK.
 It combines with good special effects and Rick Baker makeup and effects. In sum, MEN IN BLACK may well be one of the best films of this summer's fly-weight class. I give it a +2 on the -4 to +4 scale.
Mark R. Leeper<EMAIL_ADDRESS>Copyright 1997 Mark R. Leeper
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


--- layout: post status: publish published: true title: SQL2K and WinServer 2003 author: display_name: Tomas Restrepo login: tomasr email<EMAIL_ADDRESS>url: http://winterdom.com/ author_login: tomasr author_email<EMAIL_ADDRESS>author_url: http://winterdom.com/ wordpress_id: 837 wordpress_url: http://winterdom.com/2003/04/sql2kandwinserver2003 date: '2003-04-14 04:01:48 +0000' date_gmt: '2003-04-14 04:01:48 +0000' categories: - Tools tags: [] comments: - id: 560 author: kvr author_email<EMAIL_ADDRESS>author_url: '' date: '2003-04-15 03:47:29 +0000' date_gmt: '2003-04-15 03:47:29 +0000' content: |
Installed sql 2000 on w2k3 ent, got a message saying sp3 was needed. Installing sp3 did not
work until i started sql server and tried again.
Cheers,
Keesjan
It worked for me. I did get some error messages when installing SQL2K. I clicked through them, applied SP3 and all was good.
- id: 562 author: Tomas Restrepo author_email<EMAIL_ADDRESS>author_url: http://www.winterdom.com/weblog date: '2003-04-14 05:00:36 +0000' date_gmt: '2003-04-14 05:00:36 +0000' content: |Humm... I'm getting an error when the SQL2K installation is registering the sql services...
- id: 563 author: Ron Green author_email<EMAIL_ADDRESS>author_url: '' date: '2003-04-14 05:49:20 +0000' date_gmt: '2003-04-14 05:49:20 +0000' content: |I got the same message but just hit continue and it installed fine. Got the same message when I installed the SP's and did the same thing.
- id: 564 author: Vic author_email<EMAIL_ADDRESS>author_url: http://www.bluethings.net date: '2003-05-16 15:54:24 +0000' date_gmt: '2003-05-16 15:54:24 +0000' content: |stumbled upon this site when i was trying to figure out how to install sql server on win2k3 server. just thought i'd leave a note of thanks....
- id: 565 author: gerry author_email<EMAIL_ADDRESS>author_url: '' date: '2003-07-03 06:00:26 +0000' date_gmt: '2003-07-03 06:00:26 +0000' content: |How did you manage to continue, I hit the continue button and nothing happens, this is win2003 datacenter with sql 2000 EE.
---I know it's possible to run SQL Server 2000 with Windows Server 2003, but you need a service pack.
That's fine. But how the heck are you supposed to do it if SQL2K won't install so you can apply SP3 to it? I tried for a couple of hours yesterday and failed miserably.
Do I need a slipstream SQL2K-with-sp3-already-included installation, or what?


BookShelf
For the mind that never rests with books in check
The Book you desire
Choose a Book
Undeniable Attraction
Wealth of Nations
Fifty Shades of Grey
To Kill a Mockingbird
1984
Harry Potter and the Philosopher
The Lord of The Rings
The Great Gatsby
Pride and Prejudice
The Diary of a young Girl
The Book Thief
Lupin
Little Women
Fahrenheit 451
Jane Eyre
Gone with the Wind
Romeo and Juliet
Genre
Choose Genre
Romance
History
Fantasy
Kids
Select Definitive Genre
Select Definitive Genre
Fifyt Shades of Grey
The Lord of the Rings
1984
Proceed
Your Order is:
book
genre
definitive
Total
Delivery will cost sh. 200
Add Book!!
Checkout
Home Delivery
Place Order
USER
LOGIN
Terms & Conditions
LOGIN
Forget passwords?


Running the full width of the river, this fish weir is believed to have been built by Cherokee Indians in the early 1800s. In 1993, it was described as being constructed of stones and several 30-foot-long timbers.


"DOTHAN "two wells, a famous pasture-ground where Joseph found his brethren watching their flocks. Here, at the suggestion of Judah, they sold him to the Ishmaelite merchants (Genesis 37:17). It is mentioned on monuments in B.C. 1600. It was the residence of Elisha (2 Kings 6:13), and the scene of a remarkable vision of chariots and horses of fire surrounding the mountain on which the city stood. It is identified with the modern Tell-Dothan, on the south side of the plain of Jezreel, about 12 miles north of Samaria, among the hills of Gilboa. The “two wells” are still in existence, one of which bears the name of the “pit of Joseph” (Jubb Yusuf).
"DOTHAN "two wells, a famous pasture-ground where Joseph found his brethren watching their flocks. Here, at the suggestion of Judah, they sold him to the Ishmaelite merchants (Genesis 37:17). It is mentioned on monuments in B.C. 1600.
It was the residence of Elisha (2 Kings 6:13), and the scene of a remarkable vision of chariots and horses of fire surrounding the mountain on which the city stood. It is identified with the modern Tell-Dothan, on the south side of the plain of Jezreel, about 12 miles north of Samaria, among the hills of Gilboa. The “two wells” are still in existence, one of which bears the name of the “pit of Joseph” (Jubb Yusuf).


{% extends "appbuilder/base.html" %} {% block content %}
{{_("In this area you can also list, add, edit, delete and export bapco's codes. Functionalities and permissions are based on you role. ")}}
Engineering Code{{_("In this area you can also list, add, edit, delete and export bapco's codes. Functionalities and permissions are based on you role. ")}}
Vendor Code{{_("Generate unique code for Bapco")}}
Udate


|
Variant
|
Donor-cell scheme for the Euler hydrodynamics equations. More...
#include <hydro4x2.hpp>
Public Member Functions | |
| Hydro4x2 () | |
| Constructor. | |
| ~Hydro4x2 () | |
| Destructor. | |
| void | writeState (std::string directory) |
| Writes solution at given time to a text file. More... | |
| void | writeState () |
| Writes solution at given time to the output file. More... | |
| void | advection (const SDShared &sds, const std::map< std::string, Quantity< real > * > &quantityMap) |
| Solves mass/transport equation on given subdomain. More... | |
| void | source (const SDShared &sds, const std::map< std::string, Quantity< real > * > &quantityMap) |
| void | updateBoundary (const SDShared &sds, const std::map< std::string, Quantity< real > *> &quantityMap) |
| Public Member Functions inherited from Engine | |
| Engine () | |
| Constructor. | |
| ~Engine () | |
| Destructor. | |
| int | main (int argc, char **argv) |
| Main function of program, calls init and start function of the inherited engine. | |
| void | setOptions (real T, real CFL) |
| Set scheme options : final time and Courant-Friedrichs-Levy condition. More... | |
| void | updateDomainUxmax () |
| void | updateDomainUymax () |
Additional Inherited Members | |
| Protected Attributes inherited from Engine | |
| std::string | _initpath |
| std::string | _outputpath |
| int | _testFlag |
| int | _dryFlag |
| real | _T |
| real | _CFL |
| Timer | _timer |
| int | _MPI_rank |
| std::vector< real > | _SDS_uxmax |
| std::vector< real > | _SDS_uymax |
| real | _SDD_uxmax |
| real | _SDD_uymax |
| real | _Domain_uxmax |
| real | _Domain_uymax |
| unsigned int | _nIterations |
Donor-cell scheme for the Euler hydrodynamics equations.
| void Hydro4x2::advection | ( | const SDShared & | sds, |
| const std::map< std::string, Quantity< real > * > & | quantityMap | ||
| ) |
Solves mass/transport equation on given subdomain.
This function computes one iteration in time of the transport equation on a given subdomain on shared memory. Solving on a "small" portion of the global domain such as a SDS leaves control to the user on how the computations are done (parallel threads, geometrical shape of the computed domain, etc.)
| void Hydro4x2::writeState | ( | std::string | directory | ) |
Writes solution at given time to a text file.
| directory | folder path where output files will be written |
| void Hydro4x2::writeState | ( | ) |
Writes solution at given time to the output file.
Call right after iteration of the scheme without parameter to write current state


"Billy Elliot"
The coal miners may be in the midst of a tense strike in the northern English mining town of Durham, but young Billy Elliot still has to take the boxing lessons his father insists on. Billy would rather dance than fight, so when Mrs. Wilkinson's all girl ballet class has to share the gym space with the boxers, he sheds his gloves for ballet slippers in "Billy Elliot."
The simplistic script by first-timer Lee Hall runs a routine path with its inspirational story about going after what you love to do regardless of the odds and obstacles. Young Billy has a natural desire to dance and, with the help of the obligatory muse Mrs. Wilkinson (Julie Walters, "Educating Rita"), overcomes every obstacle - principally the prejudice his father has toward dancers, who must be poofters.
Most everything is handled in this perfunctory manner. Mrs. Wilkinson is intro'd as a dance dynamo and teacher - tough on the outside, but extremely compassionate inside. She pushes Billy to develop his talent and love for dance, encouraging him to apply to the Royal Ballet School in London. Mrs. Wilkinson then drops out of the movie, not even mentioned again, except for a brief coda when Billy goes off to fame and fortune.
Another problem, maybe with the script or maybe with the film's budget, is the sparseness of the supporting cast. Billy is a likable kid, but the movie only shows him having one friend, an obviously closeted Michael (Stuart Wells) whom likes to dress up in his mother's clothes. Michael heavy-handedly represents the "gay" lifestyle, but the kid doesn't dance, so I don't get it. The short shrift given to such background considerations gives the film a shallowness that the energetic performance by Jamie Bell as Billy can't overcome. Gary Lewis, as Billy's dad, also has a considerable presence, but is hamstrung by the banal development of his character's abrupt change of heart.
There is a good deal of visual imagination provided by the camera of Brian Tufano ("Trainspotting") with tightly shot, energetic dance numbers and tense movement when the action joins the coal mine strikers.  She continues to drag her stick as if along a picket fence, without so much as a glance at the heavily armored cops guarding the strike.
Jamie Bell's Billy is fun to watch as he tramps around in combinations of step dancing, tap, ballet and plain old foot stompin'. There's a lot of energy in his performance, making him the reason for seeing the film. The music selected, especially the nicely used overture from "Swan Lake," complements the story and the dance. Unfortunately, the earthy language negates the inspirational aspect of the yarn that might appeal to younger auds and frequent use of the "F" word may be a turn off. A silly epilogue that features the premier dance of an older Billy doesn't help. I give it a C.
For more Reeling reviews visit www.reelingreviews.com
<EMAIL_ADDRESS><EMAIL_ADDRESS>The review above was posted to the
rec.arts.movies.reviews newsgroup (de.rec.film.kritiken for German reviews).
The Internet Movie Database accepts no responsibility for the contents of the
review and has no editorial control. Unless stated otherwise, the copyright
belongs to the author.
Please direct comments/criticisms of the review to relevant newsgroups.
Broken URLs inthe reviews are the responsibility of the author.
The formatting of the review is likely to differ from the original due
to ASCII to HTML conversion.
Related links: index of all rec.arts.movies.reviews reviews


Home
Documentation
Demos
Tests
Github
DocEditable
Undo/Redo
Undo/Redo
As you add and remove marked ranges
, Type something here, the highlight this entire line and press Italic


| Package | Description |
|---|---|
| org.drip.analytics.cashflow |
Unit/Composite Cash Flow Periods.
|
| org.drip.param.creator |
Market Curves Surfaces Quotes Builder
|
| org.drip.param.market |
Curves Surfaces Quotes Fixings Container
|
| org.drip.product.credit |
Credit Products - Components and Baskets
|
| org.drip.product.definition |
Fixed Income Components/Baskets Definitions
|
| org.drip.service.product |
Product Horizon PnL Attribution Decomposition
|
| org.drip.service.template |
Curve Construction Product Builder Templates
|
| org.drip.state.boot |
Bootable Discount, Credit, Volatility States
|
| org.drip.state.creator |
Scenario State Curve/Surface Builders
|
| org.drip.state.credit |
Credit Latent State Curve Representation
|
| org.drip.state.nonlinear |
Nonlinear (i.e., Boot) Latent State Construction
|
| Modifier and Type | Method and Description |
|---|---|
static LossQuadratureMetrics |
LossQuadratureMetrics.MakeDefaultPeriod(int iStartDate,
int iEndDate,
double dblAccrualDCF,
double dblEffectiveNotional,
double dblEffectiveRecovery,
MergedDiscountForwardCurve dc,
CreditCurve cc,
int iDefaultLag)
Create an Instance of the LossPeriodCurveFactors using the Period's Dates and Curves to generate the
Curve Measures
|
static LossQuadratureMetrics |
LossQuadratureMetrics.MakeDefaultPeriod(int iStartDate,
int iEndDate,
double dblAccrualDCF,
double dblEffectiveNotional,
MergedDiscountForwardCurve dc,
CreditCurve cc,
int iDefaultLag)
Create a LossPeriodCurveFactors Instance from the Period Dates and the Curve Measures
|
| Modifier and Type | Method and Description |
|---|---|
static CurveSurfaceQuoteContainer |
MarketParamsBuilder.Create(MergedDiscountForwardCurve dcFunding,
ForwardCurve fc,
GovvieCurve gc,
CreditCurve cc,
java.lang.String strComponentCode,
ProductQuote compQuote,
CaseInsensitiveTreeMap<ProductQuote> mTSYQuotes,
LatentStateFixingsContainer lsfc)
Create a Market Parameters instance with the funding discount curve, the forward discount curve, the
govvie curve, the credit curve, the component quote, the map of treasury benchmark quotes, and the
Latent State Fixings Instance.
|
static CurveSurfaceQuoteContainer |
MarketParamsBuilder.Create(MergedDiscountForwardCurve dcFunding,
GovvieCurve gc,
CreditCurve cc,
java.lang.String strComponentCode,
ProductQuote compQuote,
CaseInsensitiveTreeMap<ProductQuote> mTSYQuotes,
LatentStateFixingsContainer lsfc)
Create a Market Parameters Instance with the Funding Curve, the Govvie Curve, the Credit Curve, the
component quote, the map of treasury benchmark quotes, and the Latent State Fixings Container
|
static CurveSurfaceQuoteContainer |
MarketParamsBuilder.Credit(MergedDiscountForwardCurve dcFunding,
CreditCurve cc)
Create a Market Parameters Instance with the Funding Curve and the credit curve
|
| Modifier and Type | Method and Description |
|---|---|
CreditCurve |
CreditCurveScenarioContainer.base()
Return the base credit curve
|
CreditCurve |
CreditCurveScenarioContainer.bumpDown()
Return the bump Down credit curve
|
CreditCurve |
CreditCurveScenarioContainer.bumpRecoveryDown()
Return the recovery bump Down credit curve
|
CreditCurve |
CreditCurveScenarioContainer.bumpRecoveryUp()
Return the recovery bump up credit curve
|
CreditCurve |
CreditCurveScenarioContainer.bumpUp()
Return the bump up credit curve
|
CreditCurve |
CurveSurfaceQuoteContainer.creditState(EntityCDSLabel creditLabel)
Retrieve the Credit Latent State from the Label
|
CreditCurve |
CurveSurfaceQuoteContainer.recoveryState(EntityRecoveryLabel recoveryLabel)
Retrieve the Recovery Latent State from the Label
|
| Modifier and Type | Method and Description |
|---|---|
CaseInsensitiveTreeMap<CreditCurve> |
CreditCurveScenarioContainer.custom()
Return the Custom credit curve map
|
CaseInsensitiveTreeMap<CreditCurve> |
CreditCurveScenarioContainer.tenorBumpDown()
Return the tenor bump Down credit curve map
|
CaseInsensitiveTreeMap<CreditCurve> |
CreditCurveScenarioContainer.tenorBumpUp()
Return the tenor bump up credit curve map
|
| Modifier and Type | Method and Description |
|---|---|
boolean |
CurveSurfaceQuoteContainer.setCreditState(CreditCurve cc)
(Re)-set the Credit State
|
boolean |
CurveSurfaceQuoteContainer.setRecoveryState(CreditCurve rc)
(Re)-set the Recovery State for the specified Recovery Latent State Label
|
| Modifier and Type | Field and Description |
|---|---|
CreditCurve |
CDSComponent.SpreadCalibOP._ccCalib |
| Modifier and Type | Method and Description |
|---|---|
double |
CDSComponent.recovery(int iDate,
CreditCurve cc) |
double |
BondComponent.recovery(int iDate,
CreditCurve cc) |
double |
CDSComponent.recovery(int iDateStart,
int iDateEnd,
CreditCurve cc) |
double |
BondComponent.recovery(int iStartDate,
int iEndDate,
CreditCurve cc) |
| Constructor and Description |
|---|
SpreadCalibOP(double dblCalibResult,
CreditCurve ccCalib) |
| Modifier and Type | Method and Description |
|---|---|
abstract double |
CreditComponent.recovery(int iDate,
CreditCurve cc)
Get the recovery of the credit component for the given date
|
abstract double |
CreditComponent.recovery(int iDate1,
int iDate2,
CreditCurve cc)
Get the time-weighted recovery of the credit component between the given dates
|
| Modifier and Type | Method and Description |
|---|---|
static PositionChangeComponents |
CreditIndexAPI.HorizonChangeAttribution(DiscountCurve dcFirst,
CreditCurve ccFirst,
DiscountCurve dcSecond,
CreditCurve ccSecond,
java.lang.String strFullCreditIndexName)
Generate the CDS Horizon Change Attribution
|
| Modifier and Type | Method and Description |
|---|---|
static CreditCurve |
LatentMarketStateBuilder.CreditCurve(JulianDate dtSpot,
CreditDefaultSwap[] aCDS,
double[] adblQuote,
java.lang.String strMeasure,
MergedDiscountForwardCurve dc)
Construct a Credit Curve from the specified Calibration CDS Instruments
|
static CreditCurve |
LatentMarketStateBuilder.CreditCurve(JulianDate dtSpot,
java.lang.String strCredit,
java.lang.String[] astrMaturityTenor,
double[] adblCoupon,
double[] adblQuote,
java.lang.String strMeasure,
MergedDiscountForwardCurve dc)
Construct a Credit Curve from Overnight Exchange/OTC Market Instruments
|
| Modifier and Type | Method and Description |
|---|---|
static CaseInsensitiveTreeMap<CreditCurve> |
LatentMarketStateBuilder.BumpedCreditCurve(JulianDate dtSpot,
java.lang.String strCredit,
java.lang.String[] astrMaturityTenor,
double[] adblCoupon,
double[] adblQuote,
java.lang.String strMeasure,
MergedDiscountForwardCurve dc,
double dblBump,
boolean bIsProportional)
Construct a Tenor + Parallel Map of Bumped Credit Curves from Overnight Exchange/OTC Market Instruments
|
| Modifier and Type | Method and Description |
|---|---|
static CreditCurve |
CreditCurveScenario.Standard(java.lang.String strName,
ValuationParams valParams,
CalibratableComponent[] aCalibInst,
double[] adblCalibQuote,
java.lang.String[] astrCalibMeasure,
double dblRecovery,
boolean bFlat,
MergedDiscountForwardCurve dc,
GovvieCurve gc,
LatentStateFixingsContainer lsfc,
ValuationCustomizationParams vcp,
CalibrationParams cp)
Calibrate a Credit Curve
|
static CreditCurve[] |
CreditCurveScenario.Tenor(java.lang.String strName,
ValuationParams valParams,
CalibratableComponent[] aCalibInst,
double[] adblCalibQuote,
java.lang.String[] astrCalibMeasure,
double dblRecovery,
boolean bFlat,
double dblBump,
MergedDiscountForwardCurve dc,
GovvieCurve gc,
LatentStateFixingsContainer lsfc,
ValuationCustomizationParams vcp)
Create an array of tenor bumped credit curves
|
| Modifier and Type | Method and Description |
|---|---|
static CaseInsensitiveTreeMap<CreditCurve> |
CreditCurveScenario.TenorMap(java.lang.String strName,
ValuationParams valParams,
CalibratableComponent[] aCalibInst,
double[] adblCalibQuote,
java.lang.String[] astrCalibMeasure,
double dblRecovery,
boolean bFlat,
double dblBump,
MergedDiscountForwardCurve dc,
GovvieCurve gc,
LatentStateFixingsContainer lsfc,
ValuationCustomizationParams vcp)
Create an tenor named map of tenor bumped credit curves
|
| Modifier and Type | Method and Description |
|---|---|
static CreditCurve |
ScenarioCreditCurveBuilder.Custom(java.lang.String strName,
JulianDate dtSpot,
CalibratableComponent[] aCalibInst,
MergedDiscountForwardCurve dc,
double[] adblCalibQuote,
java.lang.String[] astrCalibMeasure,
double dblRecovery,
boolean bFlat)
Calibrate the base credit curve from the input credit instruments, measures, and the quotes
|
static CreditCurve |
ScenarioCreditCurveBuilder.Custom(java.lang.String strName,
JulianDate dtSpot,
CalibratableComponent[] aCalibInst,
MergedDiscountForwardCurve dc,
double[] adblCalibQuote,
java.lang.String[] astrCalibMeasure,
double dblRecovery,
boolean bFlat,
CalibrationParams cp)
Calibrate the base credit curve from the input credit instruments, measures, and the quotes
|
| Modifier and Type | Class and Description |
|---|---|
class |
ExplicitBootCreditCurve
ExplicitBootCreditCurve exposes the functionality associated with the bootstrapped Credit Curve.
|
| Modifier and Type | Method and Description |
|---|---|
abstract CreditCurve |
CreditCurve.flatCurve(double dblFlatNodeValue,
boolean bSingleNode,
double dblRecovery)
Create a flat hazard curve from the inputs
|
| Modifier and Type | Class and Description |
|---|---|
class |
ForwardHazardCreditCurve
ForwardHazardCreditCurve manages the Survival Latent State, using the Hazard Rate as the State Response
Representation.
|
| Modifier and Type | Method and Description |
|---|---|
CreditCurve |
ForwardHazardCreditCurve.customTweakManifestMeasure(java.lang.String strManifestMeasure,
ManifestMeasureTweak mmtp) |
CreditCurve |
ForwardHazardCreditCurve.flatCurve(double dblFlatNodeValue,
boolean bSingleNode,
double dblRecovery) |


The [deceptive] power of visual explanation
July 22, 2019
Quite recently, I came across Jay Alammar’s, rather beautiful blog post, “A Visual Intro to NumPy & Data Representation”.
Before reading this, whenever I had to think about an array:
In [1]: import numpy as np
In [2]: data = np.array([1, 2, 3])
In [3]: data
Out[3]: array([1, 2, 3])
I used to create a mental picture somewhat like this:
┌────┬────┬────┐
data = │ 1 │ 2 │ 3 │
└────┴────┴────┘
But Jay, on the other hand, uses a vertical stack for representing the same array.
At the first glance, and owing to the beautiful graphics Jay has created, it makes perfect sense.
Now, if you had only seen this image, and I ask you the dimensions of data
,
what would your answer be?
The mathematician inside you barks (3, 1)
.
But, to my surprise, this wasn’t the answer:
In [4]: data.shape
Out[4]: (3,)
(3, )
eh? wondering, what would a (3, 1)
array look like?
In [5]: data.reshape((3, 1))
Out[5]:
array([[1],
[2],
[3]])
Hmm, This begs the question: what is the difference between an array of shape
(R, )
and (R, 1)
. A little bit of research landed me at this answer on
StackOverflow. Let’s see:
The best way to think about NumPy arrays is that they consist of two parts, a data buffer which is just a block of raw elements, and a view which describes how to interpret the data buffer.
For example, if we create an array of 12 integers:
>>> a = numpy.arange(12)
>>> a
array([ 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11])
Then
a
consists of a data buffer, arranged something like this:
┌────┬────┬────┬────┬────┬────┬────┬────┬────┬────┬────┬────┐
│ 0 │ 1 │ 2 │ 3 │ 4 │ 5 │ 6 │ 7 │ 8 │ 9 │ 10 │ 11 │
└────┴────┴────┴────┴────┴────┴────┴────┴────┴────┴────┴────┘
and a view which describes how to interpret the data:
>>> a.flags
C_CONTIGUOUS : True
F_CONTIGUOUS : True
OWNDATA : True
WRITEABLE : True
ALIGNED : True
UPDATEIFCOPY : False
>>> a.dtype
dtype('int64')
>>> a.itemsize
8
>>> a.strides
(8,)
>>> a.shape
(12,)
Here the shape
(12,)
means the array is indexed by a single index which runs from 0 to 11. Conceptually, if we label this single indexi
, the arraya
looks like this:i= 0 1 2 3 4 5 6 7 8 9 10 11 ┌────┬────┬────┬────┬────┬────┬────┬────┬────┬────┬────┬────┐ │ 0 │ 1 │ 2 │ 3 │ 4 │ 5 │ 6 │ 7 │ 8 │ 9 │ 10 │ 11 │ └────┴────┴────┴────┴────┴────┴────┴────┴────┴────┴────┴────┘
If we reshape an array, this doesn’t change the data buffer. Instead, it creates a new view that describes a different way to interpret the data. So after:
>>> b = a.reshape((3, 4))
the array
b
has the same data buffer asa
, but now it is indexed by two indices which run from 0 to 2 and 0 to 3 respectively. If we label the two indicesi
andj
, the arrayb
looks like this:
i= 0 0 0 0 1 1 1 1 2 2 2 2
j= 0 1 2 3 0 1 2 3 0 1 2 3
┌────┬────┬────┬────┬────┬────┬────┬────┬────┬────┬────┬────┐
│ 0 │ 1 │ 2 │ 3 │ 4 │ 5 │ 6 │ 7 │ 8 │ 9 │ 10 │ 11 │
└────┴────┴────┴────┴────┴────┴────┴────┴────┴────┴────┴────┘
So, if were to actually have a (3, 1)
matrix, we would have the exact same
stack representation as a (3, )
matrix, thus creating the confusion.
So, what about the horizontal representation?
An argument can be made that the horizontal representation can be misinterpreted
as a (1, 3)
matrix, our brains are so accustomed to seeing it as 1-D array,
that it is almost never the case (at least with folks who have worked with
Python before).
Of course, it all makes perfect sense now, but it did take me a while to figure out what exactly was going under the hood here.
Visual
Explanation of Fourier Series - Decomposition of a square wave into a sum of
infinite sinusoids. From this
answer on math.stackexchange.com
I also realized that while it is hugely helpful to visualize something when learning about it, but one should always take the visual representation with a grain of salt. As we can see, they are not entirely accurate.
For now, I’m sticking to my prior way of picturing a 1-D array as a horizontal list to avoid the confusion. I shall update the blog if I find anything otherwise.
My point is not that Jay’s drawings are flawed, but how susceptible we are to visual deceptions. In this case, it was relatively easier to figure out, because it was code, which forces one to pay attention to each and every detail, however minor it may be.
After all, human brain, prone to so many biases, taking shortcuts for nearly every decision we make (thus leaving room for sanity) isn’t anywhere near as perfect as it thinks it is.


My first website
Redesigned website
Drum machine
Animation
Bringing up baby
Trendgraphic
Busy life
Vidino
Back to top


keyboard-request
Section: Environments, Tables, and Troff Macros (7)Updated: 2009-07-09
Index Return to Main Contents
NAME
keyboard-request - event signalling console press of Alt-UpArrowSYNOPSIS
keyboard-request [ENV]...DESCRIPTION
The keyboard-request event is generated by the Upstart init(8) daemon when the keyboard request key combination (typically Alt-UpArrow) is pressed on the console.The support for this event depends on your kernel configuration. Suggested use for this event includes spawning a new login console when pressed, or for secure attention key support.
This event is not handled in the default Upstart configuration.
EXAMPLE
A task to be run on the keyboard request might use:
-
start on keyboard-request
SEE ALSO
control-alt-delete(7) init(8)
Index
This document was created by man2html, using the manual pages.
Time: 05:34:15 GMT, December 24, 2015


Before Change
// boston = load_boston()
// If using multiple instances, they are normally sent to SMAC through the scenario object as
// filenames/folder names, which can be loaded from inside the target algorithm
instances = os.listdir(INSTANCE_PATH)
instances = [[INSTANCE_PATH+i] for i in instances]
sample_X, sample_y = load_data_from_file(instances[0][0], delimiter=" ")
logger = logging.getLogger("RF-example")
logging.basicConfig(level=logging.INFO)
After Change
// Example call of the function with default values
// It returns: Status, Cost, Runtime, Additional Infos
def_value = smac.get_tae_runner().run(cs.get_default_configuration(), 1)[1]
print("Value for default configuration: %.2f" % def_value)
// Start optimization
try:


The Alliance: Treason
Corruption, betrayal, sadness, despair.. Your homeland is taken over by your previous most trusted ally Germany and since then, no one is able to live in a peaceful life ever again. Someone has to do something and regain you're homeland once more and become stronger.
You are a lonewolf - soldier who trusts no one but yourself, ever since the invasion by Germany. Not only has Germany taken control, but they have also captured everyone as hostage, including your familiy. You will stand up, fight and take back your homeland with the help of others. You will soon learn that if you want to acomplish something, you have to give up something that has equal or greater value.
"It could have been more Interactive but i love it"
- Otaku
8 / 10
"This game can compete against the Call Of Duty franchise"
- New Generation of gaming
98 / 100
"Great game-story that helps you appreciate history."
- Gameplay geek
10/10