Search is not available for this dataset
text
stringlengths 0
3.2M
| lang
stringclasses 14
values |
|---|---|
వైసీపీ అసంతృప్తుల టార్గెట్ సజ్జల ఆల్ రౌండర్ ఆరోపణలువారధి నుంచి విరోధి వరకూ.. ఏపీలో వైసీపీ అధికారంలోకి వచ్చిన కొత్తలో సీఎం జగన్ తర్వాత ప్రభుత్వంలో నంబర్ టూ ఎవరనే చర్చ ఎక్కువగా సాగేది. దీనికి సమాధానం రావడానికి ఎంతో కాలం పట్టలేదు. అంతవరకూ జగన్ తర్వాత నంబర్ టూగా వైసీపీ కీలక ఎంపీ విజయసాయిరెడ్డి ఉంటారని భావించిన వారికి ప్రభుత్వ సలహాదారుగా నియమితులైన సజ్జల రామకృష్ణారెడ్డి దూకుడు చూసే సరికి నంబర్ టూ ఎవరనే దానిపై అనుమానపు మేఘాలన్నీ తొలగిపోయాయి. దీంతో ఇప్పుడు సీఎం జగన్ ను కలవాలనుకునే ఎవరైనా సజ్జలతోనే మాట్లాడాలనేంతగా పరిస్ధితి మారిపోయింది. వైసీపీలో సజ్జల పాత్ర వైసీపీ ఆవిర్భావం నుంచి పార్టీలో కీలకంగా వ్యవహరిస్తున్న మాజీ జర్నలిస్టు సజ్జల రామకృష్ణారెడ్డి మొదట్లో ప్రభుత్వ సలహాదారు పాత్రతో పాటు పార్టీ వ్యవహారాలకే పరిమితమైనట్లు కనిపించారు. కానీ పార్టీలో కీలక ఎంపీ విజయసాయిరెడ్డితో విభేధాల నేపధ్యంలో వైసీపీలో తానేమిటో నిరూపించుకోవాల్సిన పరిస్ధితి సజ్జలకు ఎదురైనట్లు చెబుతారు. దీంతో సజ్జల దూకుడు పెంచారు. పార్టీకి అండగా ఉన్న పెద్దలతో పాటు మీడియాతోనూ సన్నిహత సంబంధాలు పెంచుకుంటూ పోయారు. ఆ తర్వాత ప్రభుత్వ వ్యవహారాలపై పట్టు పెంచుకుంటూ వచ్చారు. పార్టీలో ఎలాగో పట్టు ఉండనే ఉంది. దీంతో ఇప్పుటు సజ్జల అటు వైసీపీతో పాటు వైసీపీ ప్రభుత్వంలోనూ కీలక నేతగా చెలామణి అవుతున్నారు. జగన్ తర్వాత నంబర్ టూ వాస్తవానికి వైసీపీలో నంబర్ వన్, నంబర్ టూ అనే నంబర్లు ఎప్పుడూ కనిపించవు. కానీ ప్రభుత్వ సలహాదారుగా ఉన్న సజ్జల రామకృష్ణారెడ్డి ప్రస్తుతం పోషిస్తున్న పాత్ర చూస్తుంటే ఆయనే నంబర్ టూ అనే చర్చ జోరుగా సాగుతోంది. ఎందుకంటే మంత్రులు ప్రెస్ మీట్లు పెట్టాలన్నా, పార్టీలో, ప్రభుత్వంలో పదవులు లభించాలన్నా సజ్జల ఆశీర్వాదం ఉండాల్సిందే. పార్టీలో మీడియాతోనూ సత్సంబంధాలు కొనసాగించడంలో సజ్జల తర్వాతే ఎవరైనా. దీంతో ఇప్పుడు ప్రభుత్వంలో జగన్ ను కలిసేందుకు వెళ్లాలన్నా సజ్జలను కలిశాకే అన్నట్లుగా పరిస్ధితి మారిపోయింది. తాజాగా ఉద్యోగసంఘాలు ప్రభుత్వ పెద్ద అయిన సీఎం జగన్ తో జరపాల్సిన చర్చల్ని సైతం సజ్జలే నిర్వహించారు. దీంతో సర్కార్ లో సజ్జల నంబర్ టూ అనే చర్చ అంతకంతకూ పెరుగుతోంది. ఆల్ రౌండర్ గా సజ్జల ప్రభుత్వం తరఫున రాజకీయ ప్రత్యర్ధుల్ని విమర్శించాలన్నా, ప్రభుత్వ విధానాల్ని ప్రజల్లోకి తీసుకెళ్లాలన్నా, ఆ విధానాలతో ప్రభుత్వానికి చిక్కులు ఎదురైనప్పుడు కౌంటర్లు ఇవ్వాలన్నా ఇప్పుడు సజ్జల పేరే వైసీపీలో వినిపిస్తోంది. విపక్షాలు చేసే విమర్శలకు సైతం ఇప్పుడు సజ్జల స్పందించకుండా మిగతా నేతలు, మంత్రులు, ఎంపీలు స్పందించే పరిస్దితి లేదు. దీంతో సజ్జల అటు మంత్రుల పాత్రను, ఇటు అధికారుల పాత్రలో ఆల్ రౌండర్ అయిపోతున్నారనే ప్రచారం జరుగుతోంది. ఇది సహజంగానే పార్టీలో ఆయన ప్రత్యర్ధులతో పాటు వైసీపీ అసంతృప్త నేతలకు చికాకుగా మారిపోతోంది. దీంతో అదను చూసి వారు సజ్జలపై విమర్శలు ఎక్కుపెడుతున్నారు. సజ్జల సకల మంత్రా అని రఘురామ ప్రశ్న ప్రభుత్వ సలహాదారుగా ఉన్న సజ్జల రామకృష్ణారెడ్డి పోషిస్తున్న పాత్రపై వైసీపీ అసంతృప్త నేతల్లో అసహనం పెరుగుతోంది. తాజాగా వైసీపీ రెబెల్ ఎంపీ రఘురామకృష్ణంరాజు కూడా సజ్జల రామకృష్ణారెడ్డి పోషిస్తున్న పాత్రపై సూటి విమర్శలు చేశారు. ప్రభుత్వంలో ఏం చేయాలన్నా సజ్జలపైనే ఆధారపడుతుండటాన్ని ఆయన తప్పుబట్టారు. అలాగే రేపు మంత్రి అయ్యే అవకాశం కూడా ఉన్న సజ్జల.. ఆ తర్వాత అన్ని శాఖలకూ మంత్రిగా ఉంటారా లేక ఆయన తీసుకున్న శాఖకే మంత్రిగా ఉంటారా అని కూడా రఘురామ ప్రశ్నించారు. దీంతో రఘురామ పోషిస్తున్న ఆల్ రౌండర్ పాత్ర మరోసారి తెరపైకి వచ్చింది. సజ్జలపై డీఎల్ విమర్శలు ఇవాళ వైసీపీపై తిరుగుబాటు బావుటా ఎగురవేసిన మాజీ మంత్రి డీఎల్ రవీంద్రారెడ్డి కూడా సజ్జల రామకృష్ణారెడ్డి పాత్రపై విమర్శలకు దిగారు. రాష్ట్రంలో ఏ శాఖ మంత్రి ఆ శాఖ ప్రెస్ మీట్లు పెట్టడం లేదని , దారిన పోయే వాళ్లంతా మీడియా సమావేశాలు పెడుతున్నారని సజ్జలను ఉద్దేశించి డీఎల్ సంచలన వ్యాఖ్యలు చేశారు. ఇప్పటికే ఇదే అంశాన్ని విపక్షాలతో పాటు వైసీపీలో అసంతప్త నేతలు కూడా పదే పదే లేవనెత్తుతున్న నేపథ్యంలో డీఎల్ వ్యాఖ్యలు ప్రాధాన్యం సంతరించుకున్నాయి. సజ్జల వైఖరిపై రఘురామ తర్వాత బహిరంగ విమర్శలు చేసిన రెండో నేత డీఎల్ రవీంద్రారెడ్డి కావడం మరో విశేషం. వారధి నుంచి విరోధి వరకూ సజ్జల ప్రస్ధానం వైసీపీలో సజ్జల రామకృష్ణారెడ్డికి వారధిగా పేరుంది. అధిష్టానం అయిన సీఎం జగన్ కూ, వైసీపీలో ఆ తర్వాత స్ధాయిల్లో ఉన్న మంత్రులు, ఎమ్మెల్యేలు, ఇతర కీలక నేతలకూ మధ్య వారధిగా సజ్జల వ్యవహరిస్తున్నారు. నేతల గురించి సీఎం జగన్ కు ఫీడ్ బ్యాక్ ఇచ్చేది కూడా ఆయనేనని చెబుతారు. అలాంటి సజ్జలపై ఇప్పుడు వైసీపీ అసంతృప్త నేతలు చేస్తున్న విమర్శలు చూస్తుంటే ఆయన పోషిస్తున్న వారధి పాత్ర కాస్తా విరోధిగా మారిపోతోందని అర్ధమవుతోంది. పార్టీలో అవకాశాలు దక్కనివారు, తమ మాట చెల్లుబాటు కాని వారంతా సజ్జలను ఇప్పుడు టార్గెట్ చేసుకుంటున్నారు. ఇప్పటికే రఘురామ, డీఎల్ వంటివారు సజ్జలపై విమర్శలు చేస్తుండగా.. రాబోయే రోజుల్లో కింది స్ధాయి నేతలు కూడా ఇదే బాట పట్టే అవకాశాలున్నట్లు తెలుస్తోంది. దీనంతటికీ సజ్జల ఏకపక్ష వైఖరే కారణమన్న విమర్శలు వినిపిస్తున్నాయి. | telegu |
अलीगढ़आगरा हाईवे पर पांच साल में भी नहीं हुआ उजाला, जानें क्या रही वजह अलीगढ़, जागरण संवाददाता। शहर से होकर गुजर रहे अलीगढ़आगरा हाईवे पर भाजपा की योगी सरकार में उजाले की उम्मीद पांच साल तक बनी रही। 2017 में जब नई सरकार बनी, तब नगर निगम ने हाईवे पर स्ट्रीट लाइट लगाने की उम्मीद जगाकर टेंडर निकाला था, लेकिन एक भी स्ट्रीट लाइट नहीं लग सकी। अब नया टेंडर निकाला जाएगा। इसमें भी कुछ समय लगेगा। स्ट्रीट लाइट का काम नई सरकार के गठन के बाद ही शुरू हो सकेगा। नगर निगम के लापरवाह रवैये का परिणाम है कि पूर्व में टेंडर निकालने के बाद भी हाईवे को रोशन न कर सका। पिछले साल पोल लगाए गए थे, लेकिन इन पर एलईडी लाइट नहीं लग सकीं। दो पोल तो वाहनों की टक्कर से गिर चुके हैं, जिन्हें पुन: खड़ा नहीं किया गया।सासनी गेट चौराहे से शुरू हो रहा हाईवेसासनीगेट चौराहे से अलीगढ़आगरा हाईवे शुरू हो जाता है। चौराहे से सराय हरनारायण तक नगर निगम की सीमा है। हाईवे पर इसी हिस्से में स्ट्रीट लाइट लगाई जानी हैं। एनएचएआइ द्वारा इस पर सहमति जताई जा चुकी है। बावजूद इसके स्ट्रीट लाइट न लग सकीं। वर्ष 2017 में इसके लिए नगर निगम ने 1.20 करोड़ का टेंडर निकाला था। इसमें डिवाइडर पर पोल लगाने के अलावा एलईडी लाइट की खरीद भी शामिल थी। फिर इस टेंडर को रद कर दिया गया। टेंडर से पाेल हटाकर सिर्फ एलईडी का ठेका ईईएसएल कंपनी को दे दिया गया। इस कंपनी से नगर निगम का करार पहले से था। शहरभर में ईईएसएल द्वारा स्ट्रीट लाइट लगवाई गई हैं। लेकिन, बकाया भुगतान न होने पर कंपनी ने एलईडी की आपूर्ति रोक दी। हाईवे का ठेका लेने से भी इन्कार कर दिया। ऐसी स्थिति में पाेल लगाने के लिए 48 लाख रुपये का टेंडर एक फर्म काे दे दिया गया। पिछले साल हाईव पर 100 पोल लगाए गए, लेकिन इन पर एलईडी न लग सकी।पार्षदों ने किया था हंगामाएलईडी लगाने के लिए करीब 60 लाख रुपये का टेंडर निकाला गया था। तब पार्षदों ने बजट अधिक बताकर आपत्ति जता दी। बोर्ड बैठक में खूब हंगामा हुआ। पार्षदों के विरोध में टेंडर रद करना पड़ा। पुन: ईईएसएल कंपनी से एलईडी लगाने को कहा गया। लेकिन, कंपनी ने सहमति नहीं जताई। तब नया टेंडर निकालने की प्रक्रिया शुरू हुई। लेकिन, आचार संहिता के चलते प्रक्रिया आगे नहीं बढ़ सकी। अब आचार संहिता हटने पर ही एलईडी लग सकेंगी। तब तक नई सरकार का गठन भी हो जाएगा। | hindi |
വള്ളത്തോള് ജയന്തിയും കേരള കലാമണ്ഡലം വാര്ഷികാഘോഷവും ഇന്ന് മുതല് തൃശൂര്: വള്ളത്തോള് ജയന്തിയും മുകുന്ദരാജ അനുസ്മരണവും കേരള കലാമണ്ഡലം വാര്ഷികാഘോഷവും ഇന്നും നാളെയുമായി നടക്കും. ഇന്ന് കലാമണ്ഡലം കൂത്തമ്ബലത്തില് രാവിലെ 9.30ന് നടക്കുന്ന പതാക ഉയര്ത്തല് ചടങ്ങോടെയാണ് ആഘോഷ പരിപാടികള്ക്ക് തുടക്കമാകുക. 10 മണിക്ക് കലാമണ്ഡലം അച്യുതാനന്ദനും സംഘവും അവതരിപ്പിക്കുന്ന മിഴാവില് പഞ്ചാരി മേളം, 11ന് കരിവെള്ളൂര് രത്നകുമാറിന്റെ ശീതങ്കന് തുള്ളല്, വൈകീട്ട് 3ന് വാദ്യരത്നം രാധാകൃഷ്ണനും സംഘവും അവതരിപ്പിക്കുന്ന തായമ്ബക, 4.30 ന് മണക്കുളം മുകുന്ദരാജ അനുസ്മരണ സമ്മേളനം, 6 മണിക്ക് തുള്ളല് നവകം, രാത്രി 7 മണി മുതല് നൃത്ത പരിപാടികള്, 8.30 ന് കൂടിയാട്ടം എന്നിവ നടക്കും. നാളെ വള്ളത്തോള് സമാധിയില് പുഷ്പാര്ച്ചന, വള്ളത്തോള് അനുസ്മരണവും കവി സമ്മേളനവും, പഞ്ചമദ്ദള കേളി എന്നിവയുമുണ്ട്. വൈകീട്ട് 5 മണിക്ക് ചേരുന്ന വാര്ഷിക സമ്മേളനത്തില് കേരള കലാമണ്ഡലം വിദ്യാര്ത്ഥികള്ക്കുള്ള എന്ഡോവ്മെന്റുകള് കെ.ടി.ഡി.സി ചെയര്മാന് പി.കെ ശശി സമ്മാനിക്കും. കലാമണ്ഡലം ഗോപി, പെരുവനം കുട്ടന് മാരാര്, കലാമണ്ഡലം ക്ഷേമാവതി, ആലങ്കോട് ലീലാകൃഷ്ണന്, വൈസ് ചാന്സലര് ഡോ.ടി.കെ നാരായണന്, കലാമണ്ഡലം ഭരണസമിതി അംഗങ്ങളായ ഡോ.എന്.ആര് ഗ്രാമപ്രകാശ്, ടി.കെ വാസു, കലാമണ്ഡലം പ്രഭാകരന്, കെ. രവീന്ദ്രനാഥ്, ഉഷ നങ്ങ്യാര്, കരിയന്നൂര് നാരായണന് നമ്ബൂതിരി, അക്കാഡമിക് കോഓര്ഡിനേറ്റര് കലാമണ്ഡലം വി അച്യുതാനന്ദന് തുടങ്ങിയവര് പങ്കെടുക്കും. തുടര്ന്ന് സംഗീത കച്ചേരി, വാദ്യസമന്വയം, കഥകളി എന്നിവ അരങ്ങേറും. | malyali |
/*
* linux/fs/nfs/inode.c
*
* Copyright (C) 1992 Rick Sladkey
*
* nfs inode and superblock handling functions
*
* Modularised by Alan Cox <[email protected]>, while hacking some
* experimental NFS changes. Modularisation taken straight from SYS5 fs.
*
* Change to nfs_read_super() to permit NFS mounts to multi-homed hosts.
* [email protected]
*
*/
#include <linux/module.h>
#include <linux/init.h>
#include <linux/sched.h>
#include <linux/time.h>
#include <linux/kernel.h>
#include <linux/mm.h>
#include <linux/string.h>
#include <linux/stat.h>
#include <linux/errno.h>
#include <linux/unistd.h>
#include <linux/sunrpc/clnt.h>
#include <linux/sunrpc/stats.h>
#include <linux/sunrpc/metrics.h>
#include <linux/nfs_fs.h>
#include <linux/nfs_mount.h>
#include <linux/nfs4_mount.h>
#include <linux/lockd/bind.h>
#include <linux/seq_file.h>
#include <linux/mount.h>
#include <linux/nfs_idmap.h>
#include <linux/vfs.h>
#include <linux/inet.h>
#include <linux/nfs_xdr.h>
#include <linux/slab.h>
#include <linux/compat.h>
#include <linux/freezer.h>
#include <linux/crc32.h>
#include <asm/uaccess.h>
#include "nfs4_fs.h"
#include "callback.h"
#include "delegation.h"
#include "iostat.h"
#include "internal.h"
#include "fscache.h"
#include "dns_resolve.h"
#include "pnfs.h"
#include "netns.h"
#define NFSDBG_FACILITY NFSDBG_VFS
#define NFS_64_BIT_INODE_NUMBERS_ENABLED 1
/* Default is to see 64-bit inode numbers */
static bool enable_ino64 = NFS_64_BIT_INODE_NUMBERS_ENABLED;
static void nfs_invalidate_inode(struct inode *);
static int nfs_update_inode(struct inode *, struct nfs_fattr *);
static struct kmem_cache * nfs_inode_cachep;
static inline unsigned long
nfs_fattr_to_ino_t(struct nfs_fattr *fattr)
{
return nfs_fileid_to_ino_t(fattr->fileid);
}
/**
* nfs_wait_bit_killable - helper for functions that are sleeping on bit locks
* @word: long word containing the bit lock
*/
int nfs_wait_bit_killable(void *word)
{
if (fatal_signal_pending(current))
return -ERESTARTSYS;
freezable_schedule();
return 0;
}
/**
* nfs_compat_user_ino64 - returns the user-visible inode number
* @fileid: 64-bit fileid
*
* This function returns a 32-bit inode number if the boot parameter
* nfs.enable_ino64 is zero.
*/
u64 nfs_compat_user_ino64(u64 fileid)
{
#ifdef CONFIG_COMPAT
compat_ulong_t ino;
#else
unsigned long ino;
#endif
if (enable_ino64)
return fileid;
ino = fileid;
if (sizeof(ino) < sizeof(fileid))
ino ^= fileid >> (sizeof(fileid)-sizeof(ino)) * 8;
return ino;
}
static void nfs_clear_inode(struct inode *inode)
{
/*
* The following should never happen...
*/
BUG_ON(nfs_have_writebacks(inode));
BUG_ON(!list_empty(&NFS_I(inode)->open_files));
nfs_zap_acl_cache(inode);
nfs_access_zap_cache(inode);
nfs_fscache_release_inode_cookie(inode);
}
void nfs_evict_inode(struct inode *inode)
{
truncate_inode_pages(&inode->i_data, 0);
end_writeback(inode);
nfs_clear_inode(inode);
}
/**
* nfs_sync_mapping - helper to flush all mmapped dirty data to disk
*/
int nfs_sync_mapping(struct address_space *mapping)
{
int ret = 0;
if (mapping->nrpages != 0) {
unmap_mapping_range(mapping, 0, 0, 0);
ret = nfs_wb_all(mapping->host);
}
return ret;
}
/*
* Invalidate the local caches
*/
static void nfs_zap_caches_locked(struct inode *inode)
{
struct nfs_inode *nfsi = NFS_I(inode);
int mode = inode->i_mode;
nfs_inc_stats(inode, NFSIOS_ATTRINVALIDATE);
nfsi->attrtimeo = NFS_MINATTRTIMEO(inode);
nfsi->attrtimeo_timestamp = jiffies;
memset(NFS_I(inode)->cookieverf, 0, sizeof(NFS_I(inode)->cookieverf));
if (S_ISREG(mode) || S_ISDIR(mode) || S_ISLNK(mode))
nfsi->cache_validity |= NFS_INO_INVALID_ATTR|NFS_INO_INVALID_DATA|NFS_INO_INVALID_ACCESS|NFS_INO_INVALID_ACL|NFS_INO_REVAL_PAGECACHE;
else
nfsi->cache_validity |= NFS_INO_INVALID_ATTR|NFS_INO_INVALID_ACCESS|NFS_INO_INVALID_ACL|NFS_INO_REVAL_PAGECACHE;
}
void nfs_zap_caches(struct inode *inode)
{
spin_lock(&inode->i_lock);
nfs_zap_caches_locked(inode);
spin_unlock(&inode->i_lock);
}
void nfs_zap_mapping(struct inode *inode, struct address_space *mapping)
{
if (mapping->nrpages != 0) {
spin_lock(&inode->i_lock);
NFS_I(inode)->cache_validity |= NFS_INO_INVALID_DATA;
spin_unlock(&inode->i_lock);
}
}
void nfs_zap_acl_cache(struct inode *inode)
{
void (*clear_acl_cache)(struct inode *);
clear_acl_cache = NFS_PROTO(inode)->clear_acl_cache;
if (clear_acl_cache != NULL)
clear_acl_cache(inode);
spin_lock(&inode->i_lock);
NFS_I(inode)->cache_validity &= ~NFS_INO_INVALID_ACL;
spin_unlock(&inode->i_lock);
}
void nfs_invalidate_atime(struct inode *inode)
{
spin_lock(&inode->i_lock);
NFS_I(inode)->cache_validity |= NFS_INO_INVALID_ATIME;
spin_unlock(&inode->i_lock);
}
/*
* Invalidate, but do not unhash, the inode.
* NB: must be called with inode->i_lock held!
*/
static void nfs_invalidate_inode(struct inode *inode)
{
set_bit(NFS_INO_STALE, &NFS_I(inode)->flags);
nfs_zap_caches_locked(inode);
}
struct nfs_find_desc {
struct nfs_fh *fh;
struct nfs_fattr *fattr;
};
/*
* In NFSv3 we can have 64bit inode numbers. In order to support
* this, and re-exported directories (also seen in NFSv2)
* we are forced to allow 2 different inodes to have the same
* i_ino.
*/
static int
nfs_find_actor(struct inode *inode, void *opaque)
{
struct nfs_find_desc *desc = (struct nfs_find_desc *)opaque;
struct nfs_fh *fh = desc->fh;
struct nfs_fattr *fattr = desc->fattr;
if (NFS_FILEID(inode) != fattr->fileid)
return 0;
if ((S_IFMT & inode->i_mode) != (S_IFMT & fattr->mode))
return 0;
if (nfs_compare_fh(NFS_FH(inode), fh))
return 0;
if (is_bad_inode(inode) || NFS_STALE(inode))
return 0;
return 1;
}
static int
nfs_init_locked(struct inode *inode, void *opaque)
{
struct nfs_find_desc *desc = (struct nfs_find_desc *)opaque;
struct nfs_fattr *fattr = desc->fattr;
set_nfs_fileid(inode, fattr->fileid);
nfs_copy_fh(NFS_FH(inode), desc->fh);
return 0;
}
/*
* This is our front-end to iget that looks up inodes by file handle
* instead of inode number.
*/
struct inode *
nfs_fhget(struct super_block *sb, struct nfs_fh *fh, struct nfs_fattr *fattr)
{
struct nfs_find_desc desc = {
.fh = fh,
.fattr = fattr
};
struct inode *inode = ERR_PTR(-ENOENT);
unsigned long hash;
nfs_attr_check_mountpoint(sb, fattr);
if (((fattr->valid & NFS_ATTR_FATTR_FILEID) == 0) &&
!nfs_attr_use_mounted_on_fileid(fattr))
goto out_no_inode;
if ((fattr->valid & NFS_ATTR_FATTR_TYPE) == 0)
goto out_no_inode;
hash = nfs_fattr_to_ino_t(fattr);
inode = iget5_locked(sb, hash, nfs_find_actor, nfs_init_locked, &desc);
if (inode == NULL) {
inode = ERR_PTR(-ENOMEM);
goto out_no_inode;
}
if (inode->i_state & I_NEW) {
struct nfs_inode *nfsi = NFS_I(inode);
unsigned long now = jiffies;
/* We set i_ino for the few things that still rely on it,
* such as stat(2) */
inode->i_ino = hash;
/* We can't support update_atime(), since the server will reset it */
inode->i_flags |= S_NOATIME|S_NOCMTIME;
inode->i_mode = fattr->mode;
if ((fattr->valid & NFS_ATTR_FATTR_MODE) == 0
&& nfs_server_capable(inode, NFS_CAP_MODE))
nfsi->cache_validity |= NFS_INO_INVALID_ATTR
| NFS_INO_INVALID_ACCESS
| NFS_INO_INVALID_ACL;
/* Why so? Because we want revalidate for devices/FIFOs, and
* that's precisely what we have in nfs_file_inode_operations.
*/
inode->i_op = NFS_SB(sb)->nfs_client->rpc_ops->file_inode_ops;
if (S_ISREG(inode->i_mode)) {
inode->i_fop = NFS_SB(sb)->nfs_client->rpc_ops->file_ops;
inode->i_data.a_ops = &nfs_file_aops;
inode->i_data.backing_dev_info = &NFS_SB(sb)->backing_dev_info;
} else if (S_ISDIR(inode->i_mode)) {
inode->i_op = NFS_SB(sb)->nfs_client->rpc_ops->dir_inode_ops;
inode->i_fop = &nfs_dir_operations;
inode->i_data.a_ops = &nfs_dir_aops;
if (nfs_server_capable(inode, NFS_CAP_READDIRPLUS))
set_bit(NFS_INO_ADVISE_RDPLUS, &NFS_I(inode)->flags);
/* Deal with crossing mountpoints */
if (fattr->valid & NFS_ATTR_FATTR_MOUNTPOINT ||
fattr->valid & NFS_ATTR_FATTR_V4_REFERRAL) {
if (fattr->valid & NFS_ATTR_FATTR_V4_REFERRAL)
inode->i_op = &nfs_referral_inode_operations;
else
inode->i_op = &nfs_mountpoint_inode_operations;
inode->i_fop = NULL;
inode->i_flags |= S_AUTOMOUNT;
}
} else if (S_ISLNK(inode->i_mode))
inode->i_op = &nfs_symlink_inode_operations;
else
init_special_inode(inode, inode->i_mode, fattr->rdev);
memset(&inode->i_atime, 0, sizeof(inode->i_atime));
memset(&inode->i_mtime, 0, sizeof(inode->i_mtime));
memset(&inode->i_ctime, 0, sizeof(inode->i_ctime));
inode->i_version = 0;
inode->i_size = 0;
clear_nlink(inode);
inode->i_uid = -2;
inode->i_gid = -2;
inode->i_blocks = 0;
memset(nfsi->cookieverf, 0, sizeof(nfsi->cookieverf));
nfsi->read_cache_jiffies = fattr->time_start;
nfsi->attr_gencount = fattr->gencount;
if (fattr->valid & NFS_ATTR_FATTR_ATIME)
inode->i_atime = fattr->atime;
else if (nfs_server_capable(inode, NFS_CAP_ATIME))
nfsi->cache_validity |= NFS_INO_INVALID_ATTR;
if (fattr->valid & NFS_ATTR_FATTR_MTIME)
inode->i_mtime = fattr->mtime;
else if (nfs_server_capable(inode, NFS_CAP_MTIME))
nfsi->cache_validity |= NFS_INO_INVALID_ATTR
| NFS_INO_INVALID_DATA;
if (fattr->valid & NFS_ATTR_FATTR_CTIME)
inode->i_ctime = fattr->ctime;
else if (nfs_server_capable(inode, NFS_CAP_CTIME))
nfsi->cache_validity |= NFS_INO_INVALID_ATTR
| NFS_INO_INVALID_ACCESS
| NFS_INO_INVALID_ACL;
if (fattr->valid & NFS_ATTR_FATTR_CHANGE)
inode->i_version = fattr->change_attr;
else if (nfs_server_capable(inode, NFS_CAP_CHANGE_ATTR))
nfsi->cache_validity |= NFS_INO_INVALID_ATTR
| NFS_INO_INVALID_DATA;
if (fattr->valid & NFS_ATTR_FATTR_SIZE)
inode->i_size = nfs_size_to_loff_t(fattr->size);
else
nfsi->cache_validity |= NFS_INO_INVALID_ATTR
| NFS_INO_INVALID_DATA
| NFS_INO_REVAL_PAGECACHE;
if (fattr->valid & NFS_ATTR_FATTR_NLINK)
set_nlink(inode, fattr->nlink);
else if (nfs_server_capable(inode, NFS_CAP_NLINK))
nfsi->cache_validity |= NFS_INO_INVALID_ATTR;
if (fattr->valid & NFS_ATTR_FATTR_OWNER)
inode->i_uid = fattr->uid;
else if (nfs_server_capable(inode, NFS_CAP_OWNER))
nfsi->cache_validity |= NFS_INO_INVALID_ATTR
| NFS_INO_INVALID_ACCESS
| NFS_INO_INVALID_ACL;
if (fattr->valid & NFS_ATTR_FATTR_GROUP)
inode->i_gid = fattr->gid;
else if (nfs_server_capable(inode, NFS_CAP_OWNER_GROUP))
nfsi->cache_validity |= NFS_INO_INVALID_ATTR
| NFS_INO_INVALID_ACCESS
| NFS_INO_INVALID_ACL;
if (fattr->valid & NFS_ATTR_FATTR_BLOCKS_USED)
inode->i_blocks = fattr->du.nfs2.blocks;
if (fattr->valid & NFS_ATTR_FATTR_SPACE_USED) {
/*
* report the blocks in 512byte units
*/
inode->i_blocks = nfs_calc_block_size(fattr->du.nfs3.used);
}
nfsi->attrtimeo = NFS_MINATTRTIMEO(inode);
nfsi->attrtimeo_timestamp = now;
nfsi->access_cache = RB_ROOT;
nfs_fscache_init_inode_cookie(inode);
unlock_new_inode(inode);
} else
nfs_refresh_inode(inode, fattr);
dprintk("NFS: nfs_fhget(%s/%Ld fh_crc=0x%08x ct=%d)\n",
inode->i_sb->s_id,
(long long)NFS_FILEID(inode),
nfs_display_fhandle_hash(fh),
atomic_read(&inode->i_count));
out:
return inode;
out_no_inode:
dprintk("nfs_fhget: iget failed with error %ld\n", PTR_ERR(inode));
goto out;
}
#define NFS_VALID_ATTRS (ATTR_MODE|ATTR_UID|ATTR_GID|ATTR_SIZE|ATTR_ATIME|ATTR_ATIME_SET|ATTR_MTIME|ATTR_MTIME_SET|ATTR_FILE|ATTR_OPEN)
int
nfs_setattr(struct dentry *dentry, struct iattr *attr)
{
struct inode *inode = dentry->d_inode;
struct nfs_fattr *fattr;
int error = -ENOMEM;
nfs_inc_stats(inode, NFSIOS_VFSSETATTR);
/* skip mode change if it's just for clearing setuid/setgid */
if (attr->ia_valid & (ATTR_KILL_SUID | ATTR_KILL_SGID))
attr->ia_valid &= ~ATTR_MODE;
if (attr->ia_valid & ATTR_SIZE) {
if (!S_ISREG(inode->i_mode) || attr->ia_size == i_size_read(inode))
attr->ia_valid &= ~ATTR_SIZE;
}
/* Optimization: if the end result is no change, don't RPC */
attr->ia_valid &= NFS_VALID_ATTRS;
if ((attr->ia_valid & ~(ATTR_FILE|ATTR_OPEN)) == 0)
return 0;
/* Write all dirty data */
if (S_ISREG(inode->i_mode))
nfs_wb_all(inode);
fattr = nfs_alloc_fattr();
if (fattr == NULL)
goto out;
/*
* Return any delegations if we're going to change ACLs
*/
if ((attr->ia_valid & (ATTR_MODE|ATTR_UID|ATTR_GID)) != 0)
nfs_inode_return_delegation(inode);
error = NFS_PROTO(inode)->setattr(dentry, fattr, attr);
if (error == 0)
nfs_refresh_inode(inode, fattr);
nfs_free_fattr(fattr);
out:
return error;
}
/**
* nfs_vmtruncate - unmap mappings "freed" by truncate() syscall
* @inode: inode of the file used
* @offset: file offset to start truncating
*
* This is a copy of the common vmtruncate, but with the locking
* corrected to take into account the fact that NFS requires
* inode->i_size to be updated under the inode->i_lock.
*/
static int nfs_vmtruncate(struct inode * inode, loff_t offset)
{
loff_t oldsize;
int err;
err = inode_newsize_ok(inode, offset);
if (err)
goto out;
spin_lock(&inode->i_lock);
oldsize = inode->i_size;
i_size_write(inode, offset);
spin_unlock(&inode->i_lock);
truncate_pagecache(inode, oldsize, offset);
out:
return err;
}
/**
* nfs_setattr_update_inode - Update inode metadata after a setattr call.
* @inode: pointer to struct inode
* @attr: pointer to struct iattr
*
* Note: we do this in the *proc.c in order to ensure that
* it works for things like exclusive creates too.
*/
void nfs_setattr_update_inode(struct inode *inode, struct iattr *attr)
{
if ((attr->ia_valid & (ATTR_MODE|ATTR_UID|ATTR_GID)) != 0) {
spin_lock(&inode->i_lock);
if ((attr->ia_valid & ATTR_MODE) != 0) {
int mode = attr->ia_mode & S_IALLUGO;
mode |= inode->i_mode & ~S_IALLUGO;
inode->i_mode = mode;
}
if ((attr->ia_valid & ATTR_UID) != 0)
inode->i_uid = attr->ia_uid;
if ((attr->ia_valid & ATTR_GID) != 0)
inode->i_gid = attr->ia_gid;
NFS_I(inode)->cache_validity |= NFS_INO_INVALID_ACCESS|NFS_INO_INVALID_ACL;
spin_unlock(&inode->i_lock);
}
if ((attr->ia_valid & ATTR_SIZE) != 0) {
nfs_inc_stats(inode, NFSIOS_SETATTRTRUNC);
nfs_vmtruncate(inode, attr->ia_size);
}
}
int nfs_getattr(struct vfsmount *mnt, struct dentry *dentry, struct kstat *stat)
{
struct inode *inode = dentry->d_inode;
int need_atime = NFS_I(inode)->cache_validity & NFS_INO_INVALID_ATIME;
int err;
/* Flush out writes to the server in order to update c/mtime. */
if (S_ISREG(inode->i_mode)) {
err = filemap_write_and_wait(inode->i_mapping);
if (err)
goto out;
}
/*
* We may force a getattr if the user cares about atime.
*
* Note that we only have to check the vfsmount flags here:
* - NFS always sets S_NOATIME by so checking it would give a
* bogus result
* - NFS never sets MS_NOATIME or MS_NODIRATIME so there is
* no point in checking those.
*/
if ((mnt->mnt_flags & MNT_NOATIME) ||
((mnt->mnt_flags & MNT_NODIRATIME) && S_ISDIR(inode->i_mode)))
need_atime = 0;
if (need_atime)
err = __nfs_revalidate_inode(NFS_SERVER(inode), inode);
else
err = nfs_revalidate_inode(NFS_SERVER(inode), inode);
if (!err) {
generic_fillattr(inode, stat);
stat->ino = nfs_compat_user_ino64(NFS_FILEID(inode));
}
out:
return err;
}
static void nfs_init_lock_context(struct nfs_lock_context *l_ctx)
{
atomic_set(&l_ctx->count, 1);
l_ctx->lockowner = current->files;
l_ctx->pid = current->tgid;
INIT_LIST_HEAD(&l_ctx->list);
}
static struct nfs_lock_context *__nfs_find_lock_context(struct nfs_open_context *ctx)
{
struct nfs_lock_context *pos;
list_for_each_entry(pos, &ctx->lock_context.list, list) {
if (pos->lockowner != current->files)
continue;
if (pos->pid != current->tgid)
continue;
atomic_inc(&pos->count);
return pos;
}
return NULL;
}
struct nfs_lock_context *nfs_get_lock_context(struct nfs_open_context *ctx)
{
struct nfs_lock_context *res, *new = NULL;
struct inode *inode = ctx->dentry->d_inode;
spin_lock(&inode->i_lock);
res = __nfs_find_lock_context(ctx);
if (res == NULL) {
spin_unlock(&inode->i_lock);
new = kmalloc(sizeof(*new), GFP_KERNEL);
if (new == NULL)
return NULL;
nfs_init_lock_context(new);
spin_lock(&inode->i_lock);
res = __nfs_find_lock_context(ctx);
if (res == NULL) {
list_add_tail(&new->list, &ctx->lock_context.list);
new->open_context = ctx;
res = new;
new = NULL;
}
}
spin_unlock(&inode->i_lock);
kfree(new);
return res;
}
void nfs_put_lock_context(struct nfs_lock_context *l_ctx)
{
struct nfs_open_context *ctx = l_ctx->open_context;
struct inode *inode = ctx->dentry->d_inode;
if (!atomic_dec_and_lock(&l_ctx->count, &inode->i_lock))
return;
list_del(&l_ctx->list);
spin_unlock(&inode->i_lock);
kfree(l_ctx);
}
/**
* nfs_close_context - Common close_context() routine NFSv2/v3
* @ctx: pointer to context
* @is_sync: is this a synchronous close
*
* always ensure that the attributes are up to date if we're mounted
* with close-to-open semantics
*/
void nfs_close_context(struct nfs_open_context *ctx, int is_sync)
{
struct inode *inode;
struct nfs_server *server;
if (!(ctx->mode & FMODE_WRITE))
return;
if (!is_sync)
return;
inode = ctx->dentry->d_inode;
if (!list_empty(&NFS_I(inode)->open_files))
return;
server = NFS_SERVER(inode);
if (server->flags & NFS_MOUNT_NOCTO)
return;
nfs_revalidate_inode(server, inode);
}
struct nfs_open_context *alloc_nfs_open_context(struct dentry *dentry, fmode_t f_mode)
{
struct nfs_open_context *ctx;
struct rpc_cred *cred = rpc_lookup_cred();
if (IS_ERR(cred))
return ERR_CAST(cred);
ctx = kmalloc(sizeof(*ctx), GFP_KERNEL);
if (!ctx) {
put_rpccred(cred);
return ERR_PTR(-ENOMEM);
}
nfs_sb_active(dentry->d_sb);
ctx->dentry = dget(dentry);
ctx->cred = cred;
ctx->state = NULL;
ctx->mode = f_mode;
ctx->flags = 0;
ctx->error = 0;
nfs_init_lock_context(&ctx->lock_context);
ctx->lock_context.open_context = ctx;
INIT_LIST_HEAD(&ctx->list);
return ctx;
}
struct nfs_open_context *get_nfs_open_context(struct nfs_open_context *ctx)
{
if (ctx != NULL)
atomic_inc(&ctx->lock_context.count);
return ctx;
}
static void __put_nfs_open_context(struct nfs_open_context *ctx, int is_sync)
{
struct inode *inode = ctx->dentry->d_inode;
struct super_block *sb = ctx->dentry->d_sb;
if (!list_empty(&ctx->list)) {
if (!atomic_dec_and_lock(&ctx->lock_context.count, &inode->i_lock))
return;
list_del(&ctx->list);
spin_unlock(&inode->i_lock);
} else if (!atomic_dec_and_test(&ctx->lock_context.count))
return;
if (inode != NULL)
NFS_PROTO(inode)->close_context(ctx, is_sync);
if (ctx->cred != NULL)
put_rpccred(ctx->cred);
dput(ctx->dentry);
nfs_sb_deactive(sb);
kfree(ctx);
}
void put_nfs_open_context(struct nfs_open_context *ctx)
{
__put_nfs_open_context(ctx, 0);
}
/*
* Ensure that mmap has a recent RPC credential for use when writing out
* shared pages
*/
void nfs_file_set_open_context(struct file *filp, struct nfs_open_context *ctx)
{
struct inode *inode = filp->f_path.dentry->d_inode;
struct nfs_inode *nfsi = NFS_I(inode);
filp->private_data = get_nfs_open_context(ctx);
spin_lock(&inode->i_lock);
list_add(&ctx->list, &nfsi->open_files);
spin_unlock(&inode->i_lock);
}
/*
* Given an inode, search for an open context with the desired characteristics
*/
struct nfs_open_context *nfs_find_open_context(struct inode *inode, struct rpc_cred *cred, fmode_t mode)
{
struct nfs_inode *nfsi = NFS_I(inode);
struct nfs_open_context *pos, *ctx = NULL;
spin_lock(&inode->i_lock);
list_for_each_entry(pos, &nfsi->open_files, list) {
if (cred != NULL && pos->cred != cred)
continue;
if ((pos->mode & (FMODE_READ|FMODE_WRITE)) != mode)
continue;
ctx = get_nfs_open_context(pos);
break;
}
spin_unlock(&inode->i_lock);
return ctx;
}
static void nfs_file_clear_open_context(struct file *filp)
{
struct inode *inode = filp->f_path.dentry->d_inode;
struct nfs_open_context *ctx = nfs_file_open_context(filp);
if (ctx) {
filp->private_data = NULL;
spin_lock(&inode->i_lock);
list_move_tail(&ctx->list, &NFS_I(inode)->open_files);
spin_unlock(&inode->i_lock);
__put_nfs_open_context(ctx, filp->f_flags & O_DIRECT ? 0 : 1);
}
}
/*
* These allocate and release file read/write context information.
*/
int nfs_open(struct inode *inode, struct file *filp)
{
struct nfs_open_context *ctx;
ctx = alloc_nfs_open_context(filp->f_path.dentry, filp->f_mode);
if (IS_ERR(ctx))
return PTR_ERR(ctx);
nfs_file_set_open_context(filp, ctx);
put_nfs_open_context(ctx);
nfs_fscache_set_inode_cookie(inode, filp);
return 0;
}
int nfs_release(struct inode *inode, struct file *filp)
{
nfs_file_clear_open_context(filp);
return 0;
}
/*
* This function is called whenever some part of NFS notices that
* the cached attributes have to be refreshed.
*/
int
__nfs_revalidate_inode(struct nfs_server *server, struct inode *inode)
{
int status = -ESTALE;
struct nfs_fattr *fattr = NULL;
struct nfs_inode *nfsi = NFS_I(inode);
dfprintk(PAGECACHE, "NFS: revalidating (%s/%Ld)\n",
inode->i_sb->s_id, (long long)NFS_FILEID(inode));
if (is_bad_inode(inode))
goto out;
if (NFS_STALE(inode))
goto out;
status = -ENOMEM;
fattr = nfs_alloc_fattr();
if (fattr == NULL)
goto out;
nfs_inc_stats(inode, NFSIOS_INODEREVALIDATE);
status = NFS_PROTO(inode)->getattr(server, NFS_FH(inode), fattr);
if (status != 0) {
dfprintk(PAGECACHE, "nfs_revalidate_inode: (%s/%Ld) getattr failed, error=%d\n",
inode->i_sb->s_id,
(long long)NFS_FILEID(inode), status);
if (status == -ESTALE) {
nfs_zap_caches(inode);
if (!S_ISDIR(inode->i_mode))
set_bit(NFS_INO_STALE, &NFS_I(inode)->flags);
}
goto out;
}
status = nfs_refresh_inode(inode, fattr);
if (status) {
dfprintk(PAGECACHE, "nfs_revalidate_inode: (%s/%Ld) refresh failed, error=%d\n",
inode->i_sb->s_id,
(long long)NFS_FILEID(inode), status);
goto out;
}
if (nfsi->cache_validity & NFS_INO_INVALID_ACL)
nfs_zap_acl_cache(inode);
dfprintk(PAGECACHE, "NFS: (%s/%Ld) revalidation complete\n",
inode->i_sb->s_id,
(long long)NFS_FILEID(inode));
out:
nfs_free_fattr(fattr);
return status;
}
int nfs_attribute_timeout(struct inode *inode)
{
struct nfs_inode *nfsi = NFS_I(inode);
return !time_in_range_open(jiffies, nfsi->read_cache_jiffies, nfsi->read_cache_jiffies + nfsi->attrtimeo);
}
static int nfs_attribute_cache_expired(struct inode *inode)
{
if (nfs_have_delegated_attributes(inode))
return 0;
return nfs_attribute_timeout(inode);
}
/**
* nfs_revalidate_inode - Revalidate the inode attributes
* @server - pointer to nfs_server struct
* @inode - pointer to inode struct
*
* Updates inode attribute information by retrieving the data from the server.
*/
int nfs_revalidate_inode(struct nfs_server *server, struct inode *inode)
{
if (!(NFS_I(inode)->cache_validity & NFS_INO_INVALID_ATTR)
&& !nfs_attribute_cache_expired(inode))
return NFS_STALE(inode) ? -ESTALE : 0;
return __nfs_revalidate_inode(server, inode);
}
static int nfs_invalidate_mapping(struct inode *inode, struct address_space *mapping)
{
struct nfs_inode *nfsi = NFS_I(inode);
if (mapping->nrpages != 0) {
int ret = invalidate_inode_pages2(mapping);
if (ret < 0)
return ret;
}
spin_lock(&inode->i_lock);
nfsi->cache_validity &= ~NFS_INO_INVALID_DATA;
if (S_ISDIR(inode->i_mode))
memset(nfsi->cookieverf, 0, sizeof(nfsi->cookieverf));
spin_unlock(&inode->i_lock);
nfs_inc_stats(inode, NFSIOS_DATAINVALIDATE);
nfs_fscache_reset_inode_cookie(inode);
dfprintk(PAGECACHE, "NFS: (%s/%Ld) data cache invalidated\n",
inode->i_sb->s_id, (long long)NFS_FILEID(inode));
return 0;
}
/**
* nfs_revalidate_mapping - Revalidate the pagecache
* @inode - pointer to host inode
* @mapping - pointer to mapping
*/
int nfs_revalidate_mapping(struct inode *inode, struct address_space *mapping)
{
struct nfs_inode *nfsi = NFS_I(inode);
int ret = 0;
if ((nfsi->cache_validity & NFS_INO_REVAL_PAGECACHE)
|| nfs_attribute_cache_expired(inode)
|| NFS_STALE(inode)) {
ret = __nfs_revalidate_inode(NFS_SERVER(inode), inode);
if (ret < 0)
goto out;
}
if (nfsi->cache_validity & NFS_INO_INVALID_DATA)
ret = nfs_invalidate_mapping(inode, mapping);
out:
return ret;
}
static unsigned long nfs_wcc_update_inode(struct inode *inode, struct nfs_fattr *fattr)
{
struct nfs_inode *nfsi = NFS_I(inode);
unsigned long ret = 0;
if ((fattr->valid & NFS_ATTR_FATTR_PRECHANGE)
&& (fattr->valid & NFS_ATTR_FATTR_CHANGE)
&& inode->i_version == fattr->pre_change_attr) {
inode->i_version = fattr->change_attr;
if (S_ISDIR(inode->i_mode))
nfsi->cache_validity |= NFS_INO_INVALID_DATA;
ret |= NFS_INO_INVALID_ATTR;
}
/* If we have atomic WCC data, we may update some attributes */
if ((fattr->valid & NFS_ATTR_FATTR_PRECTIME)
&& (fattr->valid & NFS_ATTR_FATTR_CTIME)
&& timespec_equal(&inode->i_ctime, &fattr->pre_ctime)) {
memcpy(&inode->i_ctime, &fattr->ctime, sizeof(inode->i_ctime));
ret |= NFS_INO_INVALID_ATTR;
}
if ((fattr->valid & NFS_ATTR_FATTR_PREMTIME)
&& (fattr->valid & NFS_ATTR_FATTR_MTIME)
&& timespec_equal(&inode->i_mtime, &fattr->pre_mtime)) {
memcpy(&inode->i_mtime, &fattr->mtime, sizeof(inode->i_mtime));
if (S_ISDIR(inode->i_mode))
nfsi->cache_validity |= NFS_INO_INVALID_DATA;
ret |= NFS_INO_INVALID_ATTR;
}
if ((fattr->valid & NFS_ATTR_FATTR_PRESIZE)
&& (fattr->valid & NFS_ATTR_FATTR_SIZE)
&& i_size_read(inode) == nfs_size_to_loff_t(fattr->pre_size)
&& nfsi->npages == 0) {
i_size_write(inode, nfs_size_to_loff_t(fattr->size));
ret |= NFS_INO_INVALID_ATTR;
}
return ret;
}
/**
* nfs_check_inode_attributes - verify consistency of the inode attribute cache
* @inode - pointer to inode
* @fattr - updated attributes
*
* Verifies the attribute cache. If we have just changed the attributes,
* so that fattr carries weak cache consistency data, then it may
* also update the ctime/mtime/change_attribute.
*/
static int nfs_check_inode_attributes(struct inode *inode, struct nfs_fattr *fattr)
{
struct nfs_inode *nfsi = NFS_I(inode);
loff_t cur_size, new_isize;
unsigned long invalid = 0;
/* Has the inode gone and changed behind our back? */
if ((fattr->valid & NFS_ATTR_FATTR_FILEID) && nfsi->fileid != fattr->fileid)
return -EIO;
if ((fattr->valid & NFS_ATTR_FATTR_TYPE) && (inode->i_mode & S_IFMT) != (fattr->mode & S_IFMT))
return -EIO;
if ((fattr->valid & NFS_ATTR_FATTR_CHANGE) != 0 &&
inode->i_version != fattr->change_attr)
invalid |= NFS_INO_INVALID_ATTR|NFS_INO_REVAL_PAGECACHE;
/* Verify a few of the more important attributes */
if ((fattr->valid & NFS_ATTR_FATTR_MTIME) && !timespec_equal(&inode->i_mtime, &fattr->mtime))
invalid |= NFS_INO_INVALID_ATTR|NFS_INO_REVAL_PAGECACHE;
if (fattr->valid & NFS_ATTR_FATTR_SIZE) {
cur_size = i_size_read(inode);
new_isize = nfs_size_to_loff_t(fattr->size);
if (cur_size != new_isize && nfsi->npages == 0)
invalid |= NFS_INO_INVALID_ATTR|NFS_INO_REVAL_PAGECACHE;
}
/* Have any file permissions changed? */
if ((fattr->valid & NFS_ATTR_FATTR_MODE) && (inode->i_mode & S_IALLUGO) != (fattr->mode & S_IALLUGO))
invalid |= NFS_INO_INVALID_ATTR | NFS_INO_INVALID_ACCESS | NFS_INO_INVALID_ACL;
if ((fattr->valid & NFS_ATTR_FATTR_OWNER) && inode->i_uid != fattr->uid)
invalid |= NFS_INO_INVALID_ATTR | NFS_INO_INVALID_ACCESS | NFS_INO_INVALID_ACL;
if ((fattr->valid & NFS_ATTR_FATTR_GROUP) && inode->i_gid != fattr->gid)
invalid |= NFS_INO_INVALID_ATTR | NFS_INO_INVALID_ACCESS | NFS_INO_INVALID_ACL;
/* Has the link count changed? */
if ((fattr->valid & NFS_ATTR_FATTR_NLINK) && inode->i_nlink != fattr->nlink)
invalid |= NFS_INO_INVALID_ATTR;
if ((fattr->valid & NFS_ATTR_FATTR_ATIME) && !timespec_equal(&inode->i_atime, &fattr->atime))
invalid |= NFS_INO_INVALID_ATIME;
if (invalid != 0)
nfsi->cache_validity |= invalid;
nfsi->read_cache_jiffies = fattr->time_start;
return 0;
}
static int nfs_ctime_need_update(const struct inode *inode, const struct nfs_fattr *fattr)
{
if (!(fattr->valid & NFS_ATTR_FATTR_CTIME))
return 0;
return timespec_compare(&fattr->ctime, &inode->i_ctime) > 0;
}
static int nfs_size_need_update(const struct inode *inode, const struct nfs_fattr *fattr)
{
if (!(fattr->valid & NFS_ATTR_FATTR_SIZE))
return 0;
return nfs_size_to_loff_t(fattr->size) > i_size_read(inode);
}
static atomic_long_t nfs_attr_generation_counter;
static unsigned long nfs_read_attr_generation_counter(void)
{
return atomic_long_read(&nfs_attr_generation_counter);
}
unsigned long nfs_inc_attr_generation_counter(void)
{
return atomic_long_inc_return(&nfs_attr_generation_counter);
}
void nfs_fattr_init(struct nfs_fattr *fattr)
{
fattr->valid = 0;
fattr->time_start = jiffies;
fattr->gencount = nfs_inc_attr_generation_counter();
fattr->owner_name = NULL;
fattr->group_name = NULL;
}
struct nfs_fattr *nfs_alloc_fattr(void)
{
struct nfs_fattr *fattr;
fattr = kmalloc(sizeof(*fattr), GFP_NOFS);
if (fattr != NULL)
nfs_fattr_init(fattr);
return fattr;
}
struct nfs_fh *nfs_alloc_fhandle(void)
{
struct nfs_fh *fh;
fh = kmalloc(sizeof(struct nfs_fh), GFP_NOFS);
if (fh != NULL)
fh->size = 0;
return fh;
}
#ifdef NFS_DEBUG
/*
* _nfs_display_fhandle_hash - calculate the crc32 hash for the filehandle
* in the same way that wireshark does
*
* @fh: file handle
*
* For debugging only.
*/
u32 _nfs_display_fhandle_hash(const struct nfs_fh *fh)
{
/* wireshark uses 32-bit AUTODIN crc and does a bitwise
* not on the result */
return ~crc32(0xFFFFFFFF, &fh->data[0], fh->size);
}
/*
* _nfs_display_fhandle - display an NFS file handle on the console
*
* @fh: file handle to display
* @caption: display caption
*
* For debugging only.
*/
void _nfs_display_fhandle(const struct nfs_fh *fh, const char *caption)
{
unsigned short i;
if (fh == NULL || fh->size == 0) {
printk(KERN_DEFAULT "%s at %p is empty\n", caption, fh);
return;
}
printk(KERN_DEFAULT "%s at %p is %u bytes, crc: 0x%08x:\n",
caption, fh, fh->size, _nfs_display_fhandle_hash(fh));
for (i = 0; i < fh->size; i += 16) {
__be32 *pos = (__be32 *)&fh->data[i];
switch ((fh->size - i - 1) >> 2) {
case 0:
printk(KERN_DEFAULT " %08x\n",
be32_to_cpup(pos));
break;
case 1:
printk(KERN_DEFAULT " %08x %08x\n",
be32_to_cpup(pos), be32_to_cpup(pos + 1));
break;
case 2:
printk(KERN_DEFAULT " %08x %08x %08x\n",
be32_to_cpup(pos), be32_to_cpup(pos + 1),
be32_to_cpup(pos + 2));
break;
default:
printk(KERN_DEFAULT " %08x %08x %08x %08x\n",
be32_to_cpup(pos), be32_to_cpup(pos + 1),
be32_to_cpup(pos + 2), be32_to_cpup(pos + 3));
}
}
}
#endif
/**
* nfs_inode_attrs_need_update - check if the inode attributes need updating
* @inode - pointer to inode
* @fattr - attributes
*
* Attempt to divine whether or not an RPC call reply carrying stale
* attributes got scheduled after another call carrying updated ones.
*
* To do so, the function first assumes that a more recent ctime means
* that the attributes in fattr are newer, however it also attempt to
* catch the case where ctime either didn't change, or went backwards
* (if someone reset the clock on the server) by looking at whether
* or not this RPC call was started after the inode was last updated.
* Note also the check for wraparound of 'attr_gencount'
*
* The function returns 'true' if it thinks the attributes in 'fattr' are
* more recent than the ones cached in the inode.
*
*/
static int nfs_inode_attrs_need_update(const struct inode *inode, const struct nfs_fattr *fattr)
{
const struct nfs_inode *nfsi = NFS_I(inode);
return ((long)fattr->gencount - (long)nfsi->attr_gencount) > 0 ||
nfs_ctime_need_update(inode, fattr) ||
nfs_size_need_update(inode, fattr) ||
((long)nfsi->attr_gencount - (long)nfs_read_attr_generation_counter() > 0);
}
static int nfs_refresh_inode_locked(struct inode *inode, struct nfs_fattr *fattr)
{
if (nfs_inode_attrs_need_update(inode, fattr))
return nfs_update_inode(inode, fattr);
return nfs_check_inode_attributes(inode, fattr);
}
/**
* nfs_refresh_inode - try to update the inode attribute cache
* @inode - pointer to inode
* @fattr - updated attributes
*
* Check that an RPC call that returned attributes has not overlapped with
* other recent updates of the inode metadata, then decide whether it is
* safe to do a full update of the inode attributes, or whether just to
* call nfs_check_inode_attributes.
*/
int nfs_refresh_inode(struct inode *inode, struct nfs_fattr *fattr)
{
int status;
if ((fattr->valid & NFS_ATTR_FATTR) == 0)
return 0;
spin_lock(&inode->i_lock);
status = nfs_refresh_inode_locked(inode, fattr);
spin_unlock(&inode->i_lock);
return status;
}
static int nfs_post_op_update_inode_locked(struct inode *inode, struct nfs_fattr *fattr)
{
struct nfs_inode *nfsi = NFS_I(inode);
nfsi->cache_validity |= NFS_INO_INVALID_ATTR|NFS_INO_REVAL_PAGECACHE;
if (S_ISDIR(inode->i_mode))
nfsi->cache_validity |= NFS_INO_INVALID_DATA;
if ((fattr->valid & NFS_ATTR_FATTR) == 0)
return 0;
return nfs_refresh_inode_locked(inode, fattr);
}
/**
* nfs_post_op_update_inode - try to update the inode attribute cache
* @inode - pointer to inode
* @fattr - updated attributes
*
* After an operation that has changed the inode metadata, mark the
* attribute cache as being invalid, then try to update it.
*
* NB: if the server didn't return any post op attributes, this
* function will force the retrieval of attributes before the next
* NFS request. Thus it should be used only for operations that
* are expected to change one or more attributes, to avoid
* unnecessary NFS requests and trips through nfs_update_inode().
*/
int nfs_post_op_update_inode(struct inode *inode, struct nfs_fattr *fattr)
{
int status;
spin_lock(&inode->i_lock);
status = nfs_post_op_update_inode_locked(inode, fattr);
spin_unlock(&inode->i_lock);
return status;
}
/**
* nfs_post_op_update_inode_force_wcc - try to update the inode attribute cache
* @inode - pointer to inode
* @fattr - updated attributes
*
* After an operation that has changed the inode metadata, mark the
* attribute cache as being invalid, then try to update it. Fake up
* weak cache consistency data, if none exist.
*
* This function is mainly designed to be used by the ->write_done() functions.
*/
int nfs_post_op_update_inode_force_wcc(struct inode *inode, struct nfs_fattr *fattr)
{
int status;
spin_lock(&inode->i_lock);
/* Don't do a WCC update if these attributes are already stale */
if ((fattr->valid & NFS_ATTR_FATTR) == 0 ||
!nfs_inode_attrs_need_update(inode, fattr)) {
fattr->valid &= ~(NFS_ATTR_FATTR_PRECHANGE
| NFS_ATTR_FATTR_PRESIZE
| NFS_ATTR_FATTR_PREMTIME
| NFS_ATTR_FATTR_PRECTIME);
goto out_noforce;
}
if ((fattr->valid & NFS_ATTR_FATTR_CHANGE) != 0 &&
(fattr->valid & NFS_ATTR_FATTR_PRECHANGE) == 0) {
fattr->pre_change_attr = inode->i_version;
fattr->valid |= NFS_ATTR_FATTR_PRECHANGE;
}
if ((fattr->valid & NFS_ATTR_FATTR_CTIME) != 0 &&
(fattr->valid & NFS_ATTR_FATTR_PRECTIME) == 0) {
memcpy(&fattr->pre_ctime, &inode->i_ctime, sizeof(fattr->pre_ctime));
fattr->valid |= NFS_ATTR_FATTR_PRECTIME;
}
if ((fattr->valid & NFS_ATTR_FATTR_MTIME) != 0 &&
(fattr->valid & NFS_ATTR_FATTR_PREMTIME) == 0) {
memcpy(&fattr->pre_mtime, &inode->i_mtime, sizeof(fattr->pre_mtime));
fattr->valid |= NFS_ATTR_FATTR_PREMTIME;
}
if ((fattr->valid & NFS_ATTR_FATTR_SIZE) != 0 &&
(fattr->valid & NFS_ATTR_FATTR_PRESIZE) == 0) {
fattr->pre_size = i_size_read(inode);
fattr->valid |= NFS_ATTR_FATTR_PRESIZE;
}
out_noforce:
status = nfs_post_op_update_inode_locked(inode, fattr);
spin_unlock(&inode->i_lock);
return status;
}
/*
* Many nfs protocol calls return the new file attributes after
* an operation. Here we update the inode to reflect the state
* of the server's inode.
*
* This is a bit tricky because we have to make sure all dirty pages
* have been sent off to the server before calling invalidate_inode_pages.
* To make sure no other process adds more write requests while we try
* our best to flush them, we make them sleep during the attribute refresh.
*
* A very similar scenario holds for the dir cache.
*/
static int nfs_update_inode(struct inode *inode, struct nfs_fattr *fattr)
{
struct nfs_server *server;
struct nfs_inode *nfsi = NFS_I(inode);
loff_t cur_isize, new_isize;
unsigned long invalid = 0;
unsigned long now = jiffies;
unsigned long save_cache_validity;
dfprintk(VFS, "NFS: %s(%s/%ld fh_crc=0x%08x ct=%d info=0x%x)\n",
__func__, inode->i_sb->s_id, inode->i_ino,
nfs_display_fhandle_hash(NFS_FH(inode)),
atomic_read(&inode->i_count), fattr->valid);
if ((fattr->valid & NFS_ATTR_FATTR_FILEID) && nfsi->fileid != fattr->fileid)
goto out_fileid;
/*
* Make sure the inode's type hasn't changed.
*/
if ((fattr->valid & NFS_ATTR_FATTR_TYPE) && (inode->i_mode & S_IFMT) != (fattr->mode & S_IFMT))
goto out_changed;
server = NFS_SERVER(inode);
/* Update the fsid? */
if (S_ISDIR(inode->i_mode) && (fattr->valid & NFS_ATTR_FATTR_FSID) &&
!nfs_fsid_equal(&server->fsid, &fattr->fsid) &&
!IS_AUTOMOUNT(inode))
server->fsid = fattr->fsid;
/*
* Update the read time so we don't revalidate too often.
*/
nfsi->read_cache_jiffies = fattr->time_start;
save_cache_validity = nfsi->cache_validity;
nfsi->cache_validity &= ~(NFS_INO_INVALID_ATTR
| NFS_INO_INVALID_ATIME
| NFS_INO_REVAL_FORCED
| NFS_INO_REVAL_PAGECACHE);
/* Do atomic weak cache consistency updates */
invalid |= nfs_wcc_update_inode(inode, fattr);
/* More cache consistency checks */
if (fattr->valid & NFS_ATTR_FATTR_CHANGE) {
if (inode->i_version != fattr->change_attr) {
dprintk("NFS: change_attr change on server for file %s/%ld\n",
inode->i_sb->s_id, inode->i_ino);
invalid |= NFS_INO_INVALID_ATTR|NFS_INO_INVALID_DATA|NFS_INO_INVALID_ACCESS|NFS_INO_INVALID_ACL;
if (S_ISDIR(inode->i_mode))
nfs_force_lookup_revalidate(inode);
inode->i_version = fattr->change_attr;
}
} else if (server->caps & NFS_CAP_CHANGE_ATTR)
invalid |= save_cache_validity;
if (fattr->valid & NFS_ATTR_FATTR_MTIME) {
/* NFSv2/v3: Check if the mtime agrees */
if (!timespec_equal(&inode->i_mtime, &fattr->mtime)) {
dprintk("NFS: mtime change on server for file %s/%ld\n",
inode->i_sb->s_id, inode->i_ino);
invalid |= NFS_INO_INVALID_ATTR|NFS_INO_INVALID_DATA;
if (S_ISDIR(inode->i_mode))
nfs_force_lookup_revalidate(inode);
memcpy(&inode->i_mtime, &fattr->mtime, sizeof(inode->i_mtime));
}
} else if (server->caps & NFS_CAP_MTIME)
invalid |= save_cache_validity & (NFS_INO_INVALID_ATTR
| NFS_INO_INVALID_DATA
| NFS_INO_REVAL_PAGECACHE
| NFS_INO_REVAL_FORCED);
if (fattr->valid & NFS_ATTR_FATTR_CTIME) {
/* If ctime has changed we should definitely clear access+acl caches */
if (!timespec_equal(&inode->i_ctime, &fattr->ctime)) {
invalid |= NFS_INO_INVALID_ATTR|NFS_INO_INVALID_ACCESS|NFS_INO_INVALID_ACL;
/* and probably clear data for a directory too as utimes can cause
* havoc with our cache.
*/
if (S_ISDIR(inode->i_mode)) {
invalid |= NFS_INO_INVALID_DATA;
nfs_force_lookup_revalidate(inode);
}
memcpy(&inode->i_ctime, &fattr->ctime, sizeof(inode->i_ctime));
}
} else if (server->caps & NFS_CAP_CTIME)
invalid |= save_cache_validity & (NFS_INO_INVALID_ATTR
| NFS_INO_INVALID_ACCESS
| NFS_INO_INVALID_ACL
| NFS_INO_REVAL_FORCED);
/* Check if our cached file size is stale */
if (fattr->valid & NFS_ATTR_FATTR_SIZE) {
new_isize = nfs_size_to_loff_t(fattr->size);
cur_isize = i_size_read(inode);
if (new_isize != cur_isize) {
/* Do we perhaps have any outstanding writes, or has
* the file grown beyond our last write? */
if ((nfsi->npages == 0 && !test_bit(NFS_INO_LAYOUTCOMMIT, &nfsi->flags)) ||
new_isize > cur_isize) {
i_size_write(inode, new_isize);
invalid |= NFS_INO_INVALID_ATTR|NFS_INO_INVALID_DATA;
}
dprintk("NFS: isize change on server for file %s/%ld "
"(%Ld to %Ld)\n",
inode->i_sb->s_id,
inode->i_ino,
(long long)cur_isize,
(long long)new_isize);
}
} else
invalid |= save_cache_validity & (NFS_INO_INVALID_ATTR
| NFS_INO_REVAL_PAGECACHE
| NFS_INO_REVAL_FORCED);
if (fattr->valid & NFS_ATTR_FATTR_ATIME)
memcpy(&inode->i_atime, &fattr->atime, sizeof(inode->i_atime));
else if (server->caps & NFS_CAP_ATIME)
invalid |= save_cache_validity & (NFS_INO_INVALID_ATIME
| NFS_INO_REVAL_FORCED);
if (fattr->valid & NFS_ATTR_FATTR_MODE) {
if ((inode->i_mode & S_IALLUGO) != (fattr->mode & S_IALLUGO)) {
umode_t newmode = inode->i_mode & S_IFMT;
newmode |= fattr->mode & S_IALLUGO;
inode->i_mode = newmode;
invalid |= NFS_INO_INVALID_ATTR|NFS_INO_INVALID_ACCESS|NFS_INO_INVALID_ACL;
}
} else if (server->caps & NFS_CAP_MODE)
invalid |= save_cache_validity & (NFS_INO_INVALID_ATTR
| NFS_INO_INVALID_ACCESS
| NFS_INO_INVALID_ACL
| NFS_INO_REVAL_FORCED);
if (fattr->valid & NFS_ATTR_FATTR_OWNER) {
if (inode->i_uid != fattr->uid) {
invalid |= NFS_INO_INVALID_ATTR|NFS_INO_INVALID_ACCESS|NFS_INO_INVALID_ACL;
inode->i_uid = fattr->uid;
}
} else if (server->caps & NFS_CAP_OWNER)
invalid |= save_cache_validity & (NFS_INO_INVALID_ATTR
| NFS_INO_INVALID_ACCESS
| NFS_INO_INVALID_ACL
| NFS_INO_REVAL_FORCED);
if (fattr->valid & NFS_ATTR_FATTR_GROUP) {
if (inode->i_gid != fattr->gid) {
invalid |= NFS_INO_INVALID_ATTR|NFS_INO_INVALID_ACCESS|NFS_INO_INVALID_ACL;
inode->i_gid = fattr->gid;
}
} else if (server->caps & NFS_CAP_OWNER_GROUP)
invalid |= save_cache_validity & (NFS_INO_INVALID_ATTR
| NFS_INO_INVALID_ACCESS
| NFS_INO_INVALID_ACL
| NFS_INO_REVAL_FORCED);
if (fattr->valid & NFS_ATTR_FATTR_NLINK) {
if (inode->i_nlink != fattr->nlink) {
invalid |= NFS_INO_INVALID_ATTR;
if (S_ISDIR(inode->i_mode))
invalid |= NFS_INO_INVALID_DATA;
set_nlink(inode, fattr->nlink);
}
} else if (server->caps & NFS_CAP_NLINK)
invalid |= save_cache_validity & (NFS_INO_INVALID_ATTR
| NFS_INO_REVAL_FORCED);
if (fattr->valid & NFS_ATTR_FATTR_SPACE_USED) {
/*
* report the blocks in 512byte units
*/
inode->i_blocks = nfs_calc_block_size(fattr->du.nfs3.used);
}
if (fattr->valid & NFS_ATTR_FATTR_BLOCKS_USED)
inode->i_blocks = fattr->du.nfs2.blocks;
/* Update attrtimeo value if we're out of the unstable period */
if (invalid & NFS_INO_INVALID_ATTR) {
nfs_inc_stats(inode, NFSIOS_ATTRINVALIDATE);
nfsi->attrtimeo = NFS_MINATTRTIMEO(inode);
nfsi->attrtimeo_timestamp = now;
nfsi->attr_gencount = nfs_inc_attr_generation_counter();
} else {
if (!time_in_range_open(now, nfsi->attrtimeo_timestamp, nfsi->attrtimeo_timestamp + nfsi->attrtimeo)) {
if ((nfsi->attrtimeo <<= 1) > NFS_MAXATTRTIMEO(inode))
nfsi->attrtimeo = NFS_MAXATTRTIMEO(inode);
nfsi->attrtimeo_timestamp = now;
}
}
/* Don't declare attrcache up to date if there were no attrs! */
if (fattr->valid != 0)
invalid &= ~NFS_INO_INVALID_ATTR;
/* Don't invalidate the data if we were to blame */
if (!(S_ISREG(inode->i_mode) || S_ISDIR(inode->i_mode)
|| S_ISLNK(inode->i_mode)))
invalid &= ~NFS_INO_INVALID_DATA;
if (!nfs_have_delegation(inode, FMODE_READ) ||
(save_cache_validity & NFS_INO_REVAL_FORCED))
nfsi->cache_validity |= invalid;
return 0;
out_changed:
/*
* Big trouble! The inode has become a different object.
*/
printk(KERN_DEBUG "NFS: %s: inode %ld mode changed, %07o to %07o\n",
__func__, inode->i_ino, inode->i_mode, fattr->mode);
out_err:
/*
* No need to worry about unhashing the dentry, as the
* lookup validation will know that the inode is bad.
* (But we fall through to invalidate the caches.)
*/
nfs_invalidate_inode(inode);
return -ESTALE;
out_fileid:
printk(KERN_ERR "NFS: server %s error: fileid changed\n"
"fsid %s: expected fileid 0x%Lx, got 0x%Lx\n",
NFS_SERVER(inode)->nfs_client->cl_hostname, inode->i_sb->s_id,
(long long)nfsi->fileid, (long long)fattr->fileid);
goto out_err;
}
#ifdef CONFIG_NFS_V4
/*
* Clean out any remaining NFSv4 state that might be left over due
* to open() calls that passed nfs_atomic_lookup, but failed to call
* nfs_open().
*/
void nfs4_evict_inode(struct inode *inode)
{
truncate_inode_pages(&inode->i_data, 0);
end_writeback(inode);
pnfs_return_layout(inode);
pnfs_destroy_layout(NFS_I(inode));
/* If we are holding a delegation, return it! */
nfs_inode_return_delegation_noreclaim(inode);
/* First call standard NFS clear_inode() code */
nfs_clear_inode(inode);
}
#endif
struct inode *nfs_alloc_inode(struct super_block *sb)
{
struct nfs_inode *nfsi;
nfsi = (struct nfs_inode *)kmem_cache_alloc(nfs_inode_cachep, GFP_KERNEL);
if (!nfsi)
return NULL;
nfsi->flags = 0UL;
nfsi->cache_validity = 0UL;
#ifdef CONFIG_NFS_V3_ACL
nfsi->acl_access = ERR_PTR(-EAGAIN);
nfsi->acl_default = ERR_PTR(-EAGAIN);
#endif
#ifdef CONFIG_NFS_V4
nfsi->nfs4_acl = NULL;
#endif /* CONFIG_NFS_V4 */
return &nfsi->vfs_inode;
}
static void nfs_i_callback(struct rcu_head *head)
{
struct inode *inode = container_of(head, struct inode, i_rcu);
kmem_cache_free(nfs_inode_cachep, NFS_I(inode));
}
void nfs_destroy_inode(struct inode *inode)
{
call_rcu(&inode->i_rcu, nfs_i_callback);
}
static inline void nfs4_init_once(struct nfs_inode *nfsi)
{
#ifdef CONFIG_NFS_V4
INIT_LIST_HEAD(&nfsi->open_states);
nfsi->delegation = NULL;
nfsi->delegation_state = 0;
init_rwsem(&nfsi->rwsem);
nfsi->layout = NULL;
atomic_set(&nfsi->commits_outstanding, 0);
#endif
}
static void init_once(void *foo)
{
struct nfs_inode *nfsi = (struct nfs_inode *) foo;
inode_init_once(&nfsi->vfs_inode);
INIT_LIST_HEAD(&nfsi->open_files);
INIT_LIST_HEAD(&nfsi->access_cache_entry_lru);
INIT_LIST_HEAD(&nfsi->access_cache_inode_lru);
INIT_LIST_HEAD(&nfsi->commit_list);
nfsi->npages = 0;
nfsi->ncommit = 0;
atomic_set(&nfsi->silly_count, 1);
INIT_HLIST_HEAD(&nfsi->silly_list);
init_waitqueue_head(&nfsi->waitqueue);
nfs4_init_once(nfsi);
}
static int __init nfs_init_inodecache(void)
{
nfs_inode_cachep = kmem_cache_create("nfs_inode_cache",
sizeof(struct nfs_inode),
0, (SLAB_RECLAIM_ACCOUNT|
SLAB_MEM_SPREAD),
init_once);
if (nfs_inode_cachep == NULL)
return -ENOMEM;
return 0;
}
static void nfs_destroy_inodecache(void)
{
kmem_cache_destroy(nfs_inode_cachep);
}
struct workqueue_struct *nfsiod_workqueue;
/*
* start up the nfsiod workqueue
*/
static int nfsiod_start(void)
{
struct workqueue_struct *wq;
dprintk("RPC: creating workqueue nfsiod\n");
wq = alloc_workqueue("nfsiod", WQ_MEM_RECLAIM, 0);
if (wq == NULL)
return -ENOMEM;
nfsiod_workqueue = wq;
return 0;
}
/*
* Destroy the nfsiod workqueue
*/
static void nfsiod_stop(void)
{
struct workqueue_struct *wq;
wq = nfsiod_workqueue;
if (wq == NULL)
return;
nfsiod_workqueue = NULL;
destroy_workqueue(wq);
}
int nfs_net_id;
EXPORT_SYMBOL_GPL(nfs_net_id);
static int nfs_net_init(struct net *net)
{
nfs_clients_init(net);
return nfs_dns_resolver_cache_init(net);
}
static void nfs_net_exit(struct net *net)
{
nfs_dns_resolver_cache_destroy(net);
nfs_cleanup_cb_ident_idr(net);
}
static struct pernet_operations nfs_net_ops = {
.init = nfs_net_init,
.exit = nfs_net_exit,
.id = &nfs_net_id,
.size = sizeof(struct nfs_net),
};
/*
* Initialize NFS
*/
static int __init init_nfs_fs(void)
{
int err;
err = nfs_idmap_init();
if (err < 0)
goto out10;
err = nfs_dns_resolver_init();
if (err < 0)
goto out9;
err = register_pernet_subsys(&nfs_net_ops);
if (err < 0)
goto out8;
err = nfs_fscache_register();
if (err < 0)
goto out7;
err = nfsiod_start();
if (err)
goto out6;
err = nfs_fs_proc_init();
if (err)
goto out5;
err = nfs_init_nfspagecache();
if (err)
goto out4;
err = nfs_init_inodecache();
if (err)
goto out3;
err = nfs_init_readpagecache();
if (err)
goto out2;
err = nfs_init_writepagecache();
if (err)
goto out1;
err = nfs_init_directcache();
if (err)
goto out0;
#ifdef CONFIG_PROC_FS
rpc_proc_register(&init_net, &nfs_rpcstat);
#endif
if ((err = register_nfs_fs()) != 0)
goto out;
return 0;
out:
#ifdef CONFIG_PROC_FS
rpc_proc_unregister(&init_net, "nfs");
#endif
nfs_destroy_directcache();
out0:
nfs_destroy_writepagecache();
out1:
nfs_destroy_readpagecache();
out2:
nfs_destroy_inodecache();
out3:
nfs_destroy_nfspagecache();
out4:
nfs_fs_proc_exit();
out5:
nfsiod_stop();
out6:
nfs_fscache_unregister();
out7:
unregister_pernet_subsys(&nfs_net_ops);
out8:
nfs_dns_resolver_destroy();
out9:
nfs_idmap_quit();
out10:
return err;
}
static void __exit exit_nfs_fs(void)
{
nfs_destroy_directcache();
nfs_destroy_writepagecache();
nfs_destroy_readpagecache();
nfs_destroy_inodecache();
nfs_destroy_nfspagecache();
nfs_fscache_unregister();
unregister_pernet_subsys(&nfs_net_ops);
nfs_dns_resolver_destroy();
nfs_idmap_quit();
#ifdef CONFIG_PROC_FS
rpc_proc_unregister(&init_net, "nfs");
#endif
unregister_nfs_fs();
nfs_fs_proc_exit();
nfsiod_stop();
}
/* Not quite true; I just maintain it */
MODULE_AUTHOR("Olaf Kirch <[email protected]>");
MODULE_LICENSE("GPL");
module_param(enable_ino64, bool, 0644);
module_init(init_nfs_fs)
module_exit(exit_nfs_fs)
| code |
ಸ್ಟೌನಿಂದ ಬಂದ ವಿಷಕಾರಿ ಅನಿಲ ಕುಡಿದು ತಾಯಿ, ನಾಲ್ವರು ಮಕ್ಕಳು ಸಾವು..! by suddionenews January 20, 2022, 6:13 PM 620 Views ನವದೆಹಲಿ: ಮನೆಯಲ್ಲಿಟ್ಟಿದ್ದ ಸ್ಟೌವ್ ನಿಂದ ಹೊರ ಬಂದ ವಿಷಕಾರಿ ಹೊಗೆ ಕುಡಿದು ತಾಯಿ ಮತ್ತು ನಾಲ್ಕು ಜನ ಮಕ್ಕಳು ಸಾವನ್ನಪ್ಪಿರುವ ಘಟನೆ ಶಹದಾರದ ಸೀಮಾಪುರಿ ಪ್ರದೇಶದಲ್ಲಿ ನಡೆದಿದೆ. 30 ವರ್ಷದ ರಾಧಾ ಮತ್ತು ಆಕೆಯ ಮಕ್ಕಳು ದಾರುಣವಾಗಿ ಸಾವನ್ನಪ್ಪಿವೆ. ಮೋಹಿತ್ ಕಾಲಿನಿಯಾ ಮತ್ತು ರಾಧಾ ದಂಪತಿ ಸೀಮಾಪುರಿಯಲ್ಲಿ ವಾಸವಾಗಿದ್ದರು. ಅಪಾರ್ಟ್ಮೆಂಟ್ ನ ಐದನೇ ಮಹಡಿಯಲ್ಲಿ ಇವರ ಮನೆ ಇತ್ತು. ಆ ಮನೆ ತುಂಬಾ ಚಿಕ್ಕದಾಗಿದ್ದರಿಂದ, ಗಾಳಿ ಮನೆಯೊಳಗೆ ಸುಳಿಯುವ ಅವಕಾಶವೇ ಇಲ್ಲದಷ್ಟು ಚಿಕ್ಕದಾಗಿತ್ತು. ಚಳಿ ಇದ್ದ ಕಾರಣ ಸ್ಟೌವ್ ನಲ್ಲಿ ಬೆಂಕಿ ಹೊತ್ತಿಸಿ ಇಡಲಾಗಿತ್ತಂತೆ. ಆದ್ರೆ ಆ ಸ್ಟೌವ್ ನಲ್ಲಿ ವಿಷ ಗಾಳಿ ಬಂದು ಈ ದುರ್ಘಟನೆ ನಡೆದಿದೆ. ವಿಷಯ ತಿಳಿದ ತಕ್ಷಣ ಮನೆಯ ಬಳಿ ಪೊಲೀಸರು ಬಂದಿದ್ದಾರೆ. ಪೊಲೀಸರು ಬಂದಾಗ ತಾಯಿ ಮತ್ತು ಮೂವರು ಮಕ್ಕಳು ಅದಾಗಲೇ ಸಾವನ್ನಪ್ಪಿದ್ದರು. ನಾಲ್ಕನೇಯ ಮಗು ಉಸಿರಾಡುತ್ತಿದ್ದ ಕಾರಣ ಮಗುವನ್ನ ಆಸ್ಪತ್ರೆಗೆ ಸೇರಿಸಲು ಪ್ರಯತ್ನಿಸಿದ್ದಾರೆ. ಆದ್ರೆ ಮಾರ್ಗ ಮಧ್ಯೆಯೇ ಆ ಮಗು ಕೂಡ ಸಾವನ್ನಪ್ಪಿದೆ ಎಂದು ವೈದ್ಯರು ತಿಳಿಸಿದ್ದಾರೆ. | kannad |
சி.பி.எஸ்.இ. 10ம் வகுப்பு ஆங்கில வினாத்தாளில் கேட்கப்பட்ட கேள்வியால் வெடித்த சர்ச்சை சி.பி.எஸ்.இ. பயின்று வரும் 10 மற்றும் 12ம் வகுப்பு மாணவர்களுக்கு இந்த ஆண்டு 2 கட்டங்களாக பொதுத்தேர்வு நடத்தப்பட்டு வருகிறது. 10ம் வகுப்பு பொதுத்தேர்வு நடந்து முடிந்துள்ள நிலையில் பருவ பொதுத்தேர்வு வினாத்தாள்கள் மிகவும் கடினமாக இருந்ததாக மாணவர்கள் கருத்து தெரிவித்துள்ளனர். இந்தநிலையில் மத்திய கல்வி வாரியம் சி.பி.எஸ்.இ. மீது மற்றும் ஒரு பிரச்சினை எழுந்துள்ளது. 10ம் வகுப்பு முதல் பருவ ஆங்கில பொதுத்தேர்வில் கேட்கப்பட்ட ஒரு வினா மாணவர்களை மட்டுமின்றி ஆசிரியர்கள் மற்றும் கல்வியாளர்களை அதிர்ச்சி அடைய செய்துள்ளது. பெண்களுக்கு சம உரிமை வழங்கியதால், குழந்தைகளின் ஒழுக்கம் கெட்டு விட்டது, குழந்தைகள் மீது உள்ள பெற்றோர்களின் கட்டுப்பாடுகள் முற்றிலும் அழிந்து விட்டது. மனைவிக்கு அதிகாரம் அதிகம் கொடுத்துள்ளதால் பிள்ளைகளின் ஒழுக்கம் பாதிக்கப்படுவதாக ஒரு பத்தி கொடுக்கப்பட்டு அதற்கான வினாக்கள் கேட்கப்பட்டு இருந்தன. பாராளுமன்றத்திலும் இது எதிரொலித்தது. காங்கிரஸ் எதிர்க்கட்சி தலைவர் சோனியாகாந்தி இந்த பிரச்சினை குறிப்பிடும்போது, தவறான கேள்வி கேட்டதற்கு மத்திய அரசு மன்னிப்பு கேட்க வேண்டும் என்று குறிப்பிட்டார். மேலும் காங்கிரஸ் வெளிநடப்பு செய்வதாக அவர் தெரிவித்தார். இதைத்தொடர்ந்து காங்கிரஸ் உறுப்பினர்கள் அனைவரும் அவையில் இருந்து வெளியேறினார்கள். | tamil |
لاہور اردو پوائنٹ تازہ ترین اخبار 21 اگست 2016ء خوبرو اداکارہ ثناء جاوید نے کہا ہے کہ میں خود اپنی سب سے بڑی نقاد ہوں روزانہ کی بنیاد پر نہ صرف اپنا احتساب کرتی ہوں بلکہ اپنی اصلاح بھی کرتی ہوںکسی دوسرے کو برا کہنے سے پہلے انسان کو اپنے کردار کا جائزہ لینا چاہیے ایک انٹرویو میں ثناء جاوید نے کہا کہ زندگی بڑے نشیب وفراز تے ہیں لیکن اس دوران خود کو متوازن رکھنا ہی بڑی کامیابی ہے ضروری نہیں کہ غلطی کریں اور اس سے سبق حاصل کریں بلکہ دوسروں کی غلطیوں سے بھی اپنی اصلاح کی جا سکتی ہے اداکارہ نے مزید کہا کہ اس وقت پاکستان کی ٹی وی ڈرامہ اپنے عروج پر ہے اور اسے پوری دنیا میں پذیرائی ملتی ہے جو سب کے لئے خوشی کا باعث ہے | urdu |
Balloon Litter Study Update: Hi all! Thank you so much for your balloon litter reports over the last two years! Our original plan was to collect data for two years (Earth Day 2012 - Earth Day 2014), but we've gotten so much great information, that we want to keep it going. We would appreciate any feedback that you might have to tell us how we can make this site more user friendly or if there is any further information you feel we should be collecting. As we devise a plan to continue, we will keep you updated.
This balloon litter study is supported by Clean Virginia Waterways and the Virginia Aquarium & Marine Science Center. Data collected by citizen scientists during this study will help scientists better understand the sources and impacts of this type of litter. Please choose one of the following options below to enter balloon litter data or to upload photos of balloon litter. For more information about balloon litter please visit the Clean Virginia Waterways website or download this PDF (4.3 MB) Balloons as Litter: A Rising Concern.
Thank you for your participation! If you are interested in supporting this research with a tax-deductible donation, please contact [email protected]. | english |
Here at Hot Tub Installation Guys, we're ready to meet all your requirements when it comes to Hot Tub Installation in Cottonwood, AZ. Our crew of experienced contractors can offer the expert services that you need with the most sophisticated technology available. Our products are of the highest quality and we can conserve your money. Give us a call by dialing 844-244-6380 to get started.
Lowering costs is a valuable part for your task. You still need excellent quality results with Hot Tub Installation in Cottonwood, AZ, and you're able to put your confidence in our staff to conserve your funds while continually giving the very best quality work. We provide the best quality while still costing you less. Our ambition is to ensure you receive the highest quality materials and a finished project that lasts over time. As an example, we are very careful to keep clear of expensive complications, deliver the results efficiently to conserve time, and be sure you get the most effective prices on materials and work. Save time and funds by contacting Hot Tub Installation Guys now. We'll be waiting to accept your call at 844-244-6380.
It is important to be knowledgeable with regards to Hot Tub Installation in Cottonwood, AZ. We won't encourage you to come up with imprudent choices, since we understand exactly what we'll be doing, and we ensure you know exactly what to expect with the work. We will take the unexpected surprises from the situation through providing precise and complete info. Begin by calling 844-244-6380 to discuss your task. We'll explore your concerns once you call us and get you arranged with an appointment. We consistently appear at the arranged hour, all set to work together with you.
Many good reasons exist to consider Hot Tub Installation Guys regarding Hot Tub Installation in Cottonwood, AZ. Our equipment are of the very best quality, our cash saving solutions are realistic and powerful, and our client satisfaction scores will not be topped. We have the expertise you will want to meet all your objectives. If you need Hot Tub Installation in Cottonwood, call Hot Tub Installation Guys by dialing 844-244-6380, and we are going to be beyond pleased to help. | english |
ಒಂದು ಲೋಕಸಭಾ ಮತ್ತು 56 ವಿಧಾನಸಭಾ ಸ್ಥಾನಗಳಿಗೆ ನ.3 ಮತ್ತು 7ರಂದು ಉಪಚುನಾವಣೆ ಹೊಸದಿಲ್ಲಿ,ಸೆ.29: ಬಿಹಾರದ ಒಂದು ಲೋಕಸಭಾ ಮತ್ತು 10 ರಾಜ್ಯಗಳಲ್ಲಿ ಹರಡಿಕೊಂಡಿರುವ 56 ವಿಧಾನಸಭಾ ಸ್ಥಾನಗಳಿಗೆ ನ.3 ಮತ್ತು ನ.7ರಂದು ಉಪಚುನಾವಣೆ ನಡೆಯಲಿದೆ ಎಂದು ಚುನಾವಣಾ ಆಯೋಗವು ಮಂಗಳವಾರ ಪ್ರಕಟಿಸಿದೆ. ಕರ್ನಾಟಕ, ಛತ್ತೀಸ್ಗಡ, ಗುಜರಾತ್, ಜಾರ್ಖಂಡ್, ಮಧ್ಯಪ್ರದೇಶ, ಮಣಿಪುರ, ನಾಗಾಲ್ಯಾಂಡ್, ಒಡಿಶಾ, ತೆಲಂಗಾಣ ಮತ್ತು ಉತ್ತರ ಪ್ರದೇಶ ವಿಧಾನಸಭಾ ಸ್ಥಾನಗಳಿಗೆ ಉಪಚುನಾವಣೆಗಳು ನಡೆಯಲಿರುವ ರಾಜ್ಯಗಳಾಗಿವೆ. ಮತಎಣಿಕೆ ನ.10ರಂದು ನಡೆಯಲಿದೆ. ನ.3ರಂದು 54 ವಿಧಾನಸಭಾ ಕ್ಷೇತ್ರಗಳಲ್ಲಿ ಉಪಚುನಾವಣೆ ನಡೆಯಲಿದೆ. ಬಿಹಾರದ ಒಂದು ಲೋಕಸಭಾ ಕ್ಷೇತ್ರ ಮತ್ತು ಮಣಿಪುರದ ಎರಡು ವಿಧಾನಸಭಾ ಕ್ಷೇತ್ರಗಳಿಗೆ ಉಪಚುನಾವಣೆ ನ.7ರಂದು ನಡೆಯಲಿದೆ ಎಂದು ಆಯೋಗವು ತಿಳಿಸಿದೆ. ಹವಾಮಾನ ಸ್ಥಿತಿಗಳು, ಭದ್ರತಾ ಪಡೆಗಳ ರವಾನೆ, ಕೊರೋನ ವೈರಸ್ ಸಾಂಕ್ರಾಮಿಕ ಇತ್ಯಾದಿಗಳಂತಹ ವಿವಿಧ ಅಂಶಗಳನ್ನು ಪರಿಗಣನೆಗೆ ತೆದುಕೊಂಡ ಬಳಿಕ ಉಪ ಚುನಾವಣೆಗಳನ್ನು ನಡೆಸಲು ನಿರ್ಧರಿಸಲಾಗಿದೆ ಎಂದು ಅದು ಹೇಳಿಕೆಯಲ್ಲಿ ತಿಳಿಸಿದೆ. ಮಧ್ಯಪ್ರದೇಶವು ಉಪಚುನಾವಣೆಗಳು ನಡೆಯುವ ಗರಿಷ್ಠ 22ವಿಧಾನಸಭಾ ಕ್ಷೇತ್ರಗಳನ್ನು ಹೊಂದಿದೆ. ಈ ಪೈಕಿ ಹೆಚ್ಚಿನವು ಜ್ಯೋತಿರಾದಿತ್ಯ ಸಿಂಧಿಯಾ ಬಣವು ಕಾಂಗ್ರೆಸ್ ನಿಂದ ಬಿಜೆಪಿಗೆ ನಿಷ್ಠೆ ಬದಲಿಸಿದ ಬಳಿಕ ತೆರವಾಗಿದ್ದವು. ಗುಜರಾತಿನಲ್ಲಿ ಎಂಟು ಮತ್ತು ಉತ್ತರ ಪ್ರದೇಶದಲ್ಲಿ ಏಳು ವಿಧಾನಸಭಾ ಸ್ಥಾನಗಳಿಗೆ ಉಪಚುನಾವಣೆಗಳು ನಡೆಯಲಿವೆ. ನಾಲ್ಕು ರಾಜ್ಯಗಳಲ್ಲಿ ಉಪಚುನಾವಣೆ ಸದ್ಯಕ್ಕಿಲ್ಲ ಉಪಚುನಾವಣೆಗಳ ಘೋಷಣೆಗೆ ಮುನ್ನ ಮಂಗಳವಾರ ಹೊರಡಿಸಿದ ಪ್ರತ್ಯೇಕ ಹೇಳಿಕೆಯಲ್ಲಿ ಆಯೋಗವು, ಆಯಾ ರಾಜ್ಯಗಳ ನಿರ್ದಿಷ್ಟ ಕೋರಿಕೆಯ ಮೇರೆಗೆ ಕೇರಳ 2, ತಮಿಳುನಾಡು 2, ಅಸ್ಸಾಂ 2 ಮತ್ತು ಪಶ್ಚಿಮ ಬಂಗಾಳ1ಗಳಲ್ಲಿ ತೆರವಾಗಿರುವ ಒಟ್ಟು ಏಳು ವಿಧಾನಸಭಾ ಸ್ಥಾನಗಳಿಗೆ ಈ ಹಂತದಲ್ಲಿ ಉಪಚುನಾವಣೆ ನಡೆಸದಿರಲು ನಿರ್ಧರಿಸಿರುವುದಾಗಿ ತಿಳಿಸಿದೆ. ಉಪಚುನಾವಣೆಗಳನ್ನು ನಡೆಸಲು ಸದ್ಯಕ್ಕೆ ಕಷ್ಟವಾಗುತ್ತದೆ ಎಂದು ಈ ರಾಜ್ಯಗಳ ಮುಖ್ಯ ಕಾರ್ಯದರ್ಶಿಗಳು ಆಯೋಗಕ್ಕೆ ತಿಳಿಸಿದ್ದರು. ಇತ್ತೀಚಿಗೆ ತೆರವಾಗಿರುವ ಲೋಕಸಭಾ ಮತ್ತು ವಿಧಾನಸಭಾ ಸ್ಥಾನಗಳಿಗೆ ಸಂಬಂಧಿಸಿದಂತೆ ಆಯಾ ರಾಜ್ಯಗಳಿಂದ ಅಗತ್ಯ ಮಾಹಿತಿಗಳನ್ನು ಪಡೆದುಕೊಂಡ ಬಳಿಕ ಆಯೋಗವು ಉಪಚುನಾವಣೆ ನಿರ್ಧಾರವನ್ನು ಕೈಗೊಳ್ಳಲಿದೆ. ಆಯೋಗವು ಕಳೆದ ವಾರ ಬಿಹಾರ ವಿಧಾನಸಭಾ ಚುನಾವಣೆಗಳ ವೇಳಾಪಟ್ಟಿಯನ್ನು ಪ್ರಕಟಿಸಿದ್ದು,ಅ.28,ನ.3 ಮತ್ತು ನ,7ರಂದು ಮತದಾನ ನಡೆಯಲಿದೆ. ಮತ ಎಣಿಕೆ ನ.10ರಂದು ನಡೆಯಲಿದೆ. | kannad |
iPad को टक्कर देने जल्द आ रहा Realme Pad Mini, इन तगड़े फीचर्स से होगा लैस स्मार्टफोन मार्केट में अपनी धाक जमाने के बाद रियलमी Pad Mini पर काम कर रहा है। अब खबर है कि जल्द ही ये पैड भारत में लॉन्च होने वाला है और इसे भारतीय मानक ब्यूरो BIS की वेबसाइट पर देखा गया है। एक रिपोर्ट में कहा गया है कि यह टैबलेट नए रियलमी पैड का भारतीय वर्जन है और इसका मॉडल नंबर RMP2105 है। दिलचस्प बात यह है कि इसी टैबलेट ने थाईलैंड में गीकबेंच पर भी अपनी जगह बनाई है। Realme Pad Mini उर्फ नए Realme Pad India वेरिएंट के बारे में MySmartPrice की एक रिपोर्ट बताती है कि मॉडल नंबर RMP2105 के साथ एक Realme टैबलेट को BIS सर्टिफिकेशन वेबसाइट पर देखा गया है, जिससे संकेत मिलता है कि इसे जल्द ही भारत में लॉन्च किया जाएगा। रिपोर्ट में टिपस्टर योगेश बराड़ का हवाला दिया गया, जिन्होंने यह भी दावा किया कि यह टैबलेट यूनिसोक SoC द्वारा संचालित होगा और Android 11 पर चलेगा। दिसंबर में वापस, समान मॉडल नंबर RMP2105 के साथ एक Realme टैबलेट को इसके कुछ प्रमुख स्पेसिफिकेशन के साथ गीकबेंच पर देखा गया था। उस समय यह माना गया था कि टैबलेट Realme Pad का एक नया मॉडल था जिसे सितंबर में भारत में लॉन्च किया गया था और इसका मॉडल नंबर RMP2102 था। इसके अलावा, गीकबेंच लिस्टिंग ने सुझाव दिया कि रीयलमी पैड, जिसे अब रीयलमी पैड मिनी के रूप में डब किया गया है, को ऑक्टाकोर यूनिसोक प्रोसेसर के साथ 3 जीबी रैम के साथ लिस्ट किया गया था। दिलचस्प बात यह है कि कथित तौर पर समान मॉडल नंबर वाला एक Realme टैबलेट भी EEC और कैमरा FV5 डेटाबेस पर देखा गया था। डेटाबेस लिस्टिंग से पता चलता है कि अपकमिंग Realme Pad के कथित Realme Pad Mini नए भारत संस्करण में f1.78 अपर्चर और 27.9mm फोकल लेंथ वाले लेंस के साथ जोड़े गए 8मेगापिक्सल का रियर सेंसर होगा। टैबलेट को f1.8 अपर्चर लेंस के साथ 5मेगापिक्सल सेंसर पैक करने के लिए तैयार किया गया है जिसमें सेल्फी और वीडियो कॉल के लिए 27.7 मिमी फोकल लंबाई है। अफवाह वाले Realme Pad Mini के बारे में दूसरा विकास टिपस्टर मुकुल शर्मा से आया है। शर्मा के एक ट्वीट के अनुसार, समान रियलमी आरएमपी2105 मॉडल नंबर वाले टैबलेट ने एनबीटीसी सर्टिफिकेशन में जगह बना ली है, जिससे यह संकेत मिलता है कि यह एलटीई के साथ जल्द ही अपनी शुरुआत करेगा। For Hindustan : हिन्दुस्तान ईसमाचार पत्र के लिए क्लिक करें epaper.livehindustan.com | hindi |
ಮೋದಿಯನ್ನು ಎದುರಿಸುವ ಪ್ರಬಲ ನಾಯಕನ ಆಯ್ಕೆಗೆ ಪ್ರಶಾಂತ್ ಕಿಶೋರ್ ಸಹಾಯ ಮಾಡಬಹುದು ಸಂಜಯ್ ರಾವತ್ 2024ರ ಲೋಕಸಭಾ ಚುನಾವಣೆಗೆ ವರ್ಷಗಳು ಬಾಕಿಯಿದ್ದರೂ, ಭಾರತೀಯ ರಾಜಕೀಯ ವಲಯದಲ್ಲಿ ಚುನಾವಣೆ ಎದುರಿಸುವ ತಯಾರಿಗಳು ಭರ್ಜರಿಯಾಗಿ ನಡೆಯುತ್ತಿವೆ. ಪ್ರತಿಪಕ್ಷಗಳು ಚುನಾವಣಾ ತಂತ್ರಜ್ಞ ಪ್ರಶಾಂತ್ ಕಿಶೋರ್ ಜೊತೆ ಸತತವಾಗಿ ನಡೆಸುತ್ತಾ ಬಂದಿರುವ ಸಭೆಗಳು ಈ ಕೆಲವು ಊಹಾಪೋಹಗಳಿಗೆ ಕಾರಣವಾಗಿದೆ. ಶಿವಸೇನೆ ಕೂಡಾ ರಾಷ್ಟ್ರ ರಾಜಕಾರಣದಲ್ಲಿ ಕಾಂಗ್ರೆಸ್ನ ಸಾಧ್ಯತೆಗಳ ಕುರಿತು ಗಂಭೀರ ಗಮನ ಹರಿಸುತ್ತಿದೆ. ಈ ನಡುವೆಪ್ರಧಾನಿ ಮೋದಿ ನೇತೃತ್ವದ ಬಿಜೆಪಿಯನ್ನು ಎದುರಿಸಲು ಅಷ್ಟೇ ಪ್ರಭಾವಿ ನಾಯಕರ ನೇತೃತ್ವದ ಅವಶ್ಯಕತೆ ಇದೆ ಎಂದು ಶಿವಸೇನೆ ಮುಖಂಡ ಸಂಜಯ್ ರಾವತ್ ಹೇಳಿದ್ದಾರೆ. ನರೇಂದ್ರ ಮೋದಿಯವರೊಂದಿಗೆ ಸ್ಪರ್ಧಿಸಲು ಪ್ರತಿಪಕ್ಷಗಳಿಗೆ ಅವರಷ್ಟೇ ವರ್ಚಸ್ಸಿನ ನಾಯಕರಿಲ್ಲ. ಆದರೆ ಪ್ರತಿಪಕ್ಷಗಳು ಪ್ರಭಾವಿ ನಾಯಕನನ್ನು ಆರಿಸುವವರೆಗೂ ಚುನಾವಣೆಯಲ್ಲಿ ಬಿಜೆಪಿಗೆ ಪ್ರಬಲ ಪೈಪೋಟಿ ಒಡ್ಡಲು ಸಾಧ್ಯವಿಲ್ಲ ಎಂದು ರಾವತ್ ಅಭಿಪ್ರಾಯಪಟ್ಟಿದ್ದಾರೆ. ಪ್ರಧಾನಿ ನರೇಂದ್ರ ಮೋದಿಯವರಿಗೆ ಹೋಲಿಸಿದರೆ ಎನ್ಸಿಪಿ ಮುಖ್ಯಸ್ಥ ಶರದ್ ಪವಾರ್ ಅತ್ಯುತ್ತಮ ಅಭ್ಯರ್ಥಿ. ಅಂತೆಯೇ ಹಲವು ನಾಯಕರು ಪಶ್ಚಿಮ ಬಂಗಾಳ ಸಿಎಂ ಮಮತಾ ಬ್ಯಾನರ್ಜಿ ಅವರ ಹೆಸರೂ ಹೇಳುತ್ತಿದ್ದಾರೆ. ಅದಾಗ್ಯೂ, ಸದ್ಯ ಪ್ರತಿಪಕ್ಷಗಳ ಬಳಿ 2024ರ ಚುನಾವಣೆ ಎದುರಿಸಲು ದೊಡ್ಡ ವರ್ಚಸ್ಸಿನ ಅದೇ ವೇಳೆ ಅವಿರೋಧ ಆಯ್ಕೆಯಾಗುವಂತಹ ನಾಯಕರಿಲ್ಲ ಎಂದು ಹೇಳಿದ್ದಾರೆ. ಇದು ಹೀಗೆಯೇ ಮುಂದುವರೆದರೆ 2024ರಲ್ಲೂ ಮೋದಿ ನೇತೃತ್ವದ ಬಿಜೆಪಿಯನ್ನು ಸೋಲಿಸುವುದು ಕಷ್ಟವಾಗುತ್ತದೆ. ಎಲ್ಲಾ ವಿರೋಧ ಪಕ್ಷಗಳನ್ನು ಒಟ್ಟುಗೂಡಿಸುವುದು ಮತ್ತು 2024 ರ ಸಾರ್ವತ್ರಿಕ ಚುನಾವಣೆಯಲ್ಲಿ ಬಿಜೆಪಿಯನ್ನು ಎದುರಿಸಲು ಒಬ್ಬ ಪ್ರಭಾವಿ ವರ್ಚಸ್ಸಿನ ನಾಯಕನ ಮೇಲೆ ಒಮ್ಮತವನ್ನು ರೂಪಿಸುವುದು ಕಷ್ಟವಾಗಿದೆ.ಯಾಕೆಂದರೆ ಪ್ರತಿ ವಿರೋಧ ಪಕ್ಷವು ತನ್ನದೇ ನಾಯಕರನ್ನು ಪ್ರಧಾನಿ ಅಭ್ಯರ್ಥಿಯಾಗಿ ಬಿಂಬಿಸಲು ಇಚ್ಛಿಸುತ್ತದೆ ಎಂದು ಅವರು ಹೇಳಿದ್ದಾರೆ. ತುರ್ತು ಪರಿಸ್ಥಿತಿ ನಂತರದ ಚುನಾವಣೆಗಳಲ್ಲಿ ಆಗಿನ ಪ್ರಧಾನಿ ಇಂದಿರಾ ಗಾಂಧಿ ವಿರುದ್ಧ ಜಯ ಸಾಧಿಸಲು ಜೆಪಿ ನಾರಾಯಣ್, ಹಾಗೂ ರಾಜೀವ್ ಗಾಂಧಿ ವಿರುದ್ಧ ವಿ.ಪಿ.ಸಿಂಗ್ ರಂತಹ ಪ್ರಭಾವಿ ನಾಯಕರು ಸೆಣಸಿದ್ದರು. ಬಳಿಕ ಪ್ರಧಾನಿ ಮನಮೋಹನ್ ಸಿಂಗ್, ಸೋನಿಯಾಗಾಂಧಿ ವಿರುದ್ಧ ನರೇಂದ್ರ ಮೋದಿ ಅಂತಹ ಸವಾಲು ಒಡ್ಡಿದ್ದರು. ಅಂತಹ ಪ್ರಭಾವಿ ವರ್ಚಸ್ಸುಳ್ಳ ನಾಯಕರು ನಮಗೆ ಬೇಕು. ಇದಕ್ಕೆ ಶರದ್ ಪವಾರ್ ಅವರೇ ಸರಿಯಾದ ಆಯ್ಕೆ ಎಂದು ರಾವತ್ ಹೇಳಿದ್ದಾರೆ. ಇದೇ ವೇಳೆ ರಾಹುಲ್ ಗಾಂಧಿ ಕುರಿತು ಮಾತನಾಡಿದ ಸಂಜಯ್ ರಾವತ್, ರಾಹುಲ್ ಗಾಂಧಿ ಕಾಂಗ್ರೆಸ್ ಪಕ್ಷದ ದೊಡ್ಡ ಮುಖಂಡರಾಗಿದ್ದಾರೆ. ಆದರೆ ಅವರಿಗಿಂತ ಹಿರಿಯ ಮತ್ತು ಪ್ರಭಾವಿ ಮುಖಂಡರೂ ಕಾಂಗ್ರೆಸ್ ಪಕ್ಷದಲ್ಲಿದ್ದಾರೆ. ಕಾಂಗ್ರೆಸ್ನಲ್ಲಿ ನಾಯಕತ್ವದ ಬಗ್ಗೆ ಬಿಕ್ಕಟ್ಟು ಇದೆ. ಅದಕ್ಕಾಗಿಯೇ ಕಾಂಗ್ರೆಸ್ ಗೆ ಇನ್ನೂ ಅಧ್ಯಕ್ಷ ಸ್ಥಾನಕ್ಕೆ ಯಾರನ್ನೂ ಆಯ್ಕೆ ಮಾಡಲು ಸಾಧ್ಯವಾಗಿಲ್ಲ ಎಂದು ಹೇಳಿದ್ದಾರೆ. ಪ್ರಶಾಂತ್ಕಿಶೋರ್ಮೇಲೆ ಭರವಸೆ! ರಾಜಕೀಯ ಮತ್ತು ಚುನಾವಣಾ ತಂತ್ರಜ್ಞ ಪ್ರಶಾಂತ್ ಕಿಶೋರ್ ಅವರ ಕುರಿತು ಉಲ್ಲೇಖಿಸಿದ ಸಂಜಯ್ ರಾವತ್, ಪ್ರಶಾಂತ್ ಕಿಶೋರ್ ಬಂಗಾಳದಲ್ಲಿ ಉತ್ತಮ ಕೆಲಸ ಮಾಡಿದ್ದಾರೆ ಎಂದು ತೃಣಮೂಲ ಕಾಂಗ್ರೆಸ್ ಹೇಳಿಕೊಂಡಿದೆ. ತೃಣಮೂಲ ಕಾಂಗ್ರೆಸ್ ಮತ್ತು ಪ್ರಶಾಂತ್ ಕಿಶೋರ್ ನಡುವೆ ಒಪ್ಪಂದವೂ ನಡೆದಿತ್ತು. ಪ್ರಶಾಂತ್ ಕಿಶೋರ್ ಮಹಾರಾಷ್ಟ್ರದಲ್ಲಿ ನಮ್ಮೊಂದಿಗೂ ಕೆಲಸ ಮಾಡಿದ್ದರು. ಬಹುಶಃ ಮುಂದಿನ ಪ್ರಧಾನಿ ಅಭ್ಯರ್ಥಿ ಆಯ್ಕೆಯಲ್ಲಿ ಪ್ರತಿಪಕ್ಷಗಳಿಗೆ ಪ್ರಶಾಂತ್ ಕಿಶೋರ್ ನೆರವಾಗಬಹುದು ಎಂದು ಹೇಳಿದ್ದಾರೆ. The post ಮೋದಿಯನ್ನು ಎದುರಿಸುವ ಪ್ರಬಲ ನಾಯಕನ ಆಯ್ಕೆಗೆ ಪ್ರಶಾಂತ್ ಕಿಶೋರ್ ಸಹಾಯ ಮಾಡಬಹುದು ಸಂಜಯ್ ರಾವತ್ appeared first on Pratidhvani. | kannad |
Mine: an excavation made in the earth to extract minerals. Mining: the . revolutionary discovery comes along and changes the process of mining profoundly.
Mar 17, 2010 The Act vests control of all properties and minerals in Nigeria in the an exploration or mining lease based on a competitive bidding process.
The mining of minerals in Nigeria accounts for only 0.3% of its GDP, due to the influence of its corporation that was formed in 1950 and held a monopoly on the mining, processing, and sales of coal, lignite, and coke products until 1999.
Mar 20, 2012 What constitutes a mineral resource and an ore? Most minerals must be processed before they are used. . walls of the tunnels by drilling and blasting, with the excavated ores being hauled to the surface from processing.
Highlighting the different types of mining De Beers is involved in. involve four stages: exposing diamonds, holding back the sea, excavation and processing.
Feb 7, 2014 Everything you need to know about tin mining and processing. Asia countries, such as Malaysia, Thailand, Indonesia, Bolivia and Nigeria.
APPROPRIATENESS OF CONSTRUCTION TECHNOLOGY IN NIGERIA in sand-digging and soil excavation in Ado-OdoOta Local Government Area, affected in the course of mining and . the process of ordering the use of physical,.
Pillar of strength: Downstream processing and minerals development are both part of .. legislation that would outline excavation and processing requirements.
Oct 4, 2017 low-tech, labour-intensive excavation and processing of minerals. .. aim to tackle child labour in mining in Madagascar, Nigeria, Colombia.
Keywords: Nigeria, GIS, Mining-cadastre, Licence, Mining, Exploration, Quarry, . system was introduced, and in the process, mineral titles were revalidated. . as well as non-mining related activities such as land excavation and studies of.
Process for Revocation when Mineral title holder failsto pay fees. . ENACTEDby the National Assembly ofthe Federal Republic of Nigeria=- . . •. -:~. .,..•. ,In: . . 1i:,,. b not engage in drilling, excavation or other sub surface techniques; ."
Find Out More About Our Mining and Excavation Buoyancy Products & Get In Touch with reduced in air weight, thereby enabling smaller handling systems.
Tantalum minerals with over 70 diverse chemical compositions have been recognized. be processed for the tantalum standards and is sold on that starting point. The minerals are concentrated by substantial means at or near the excavation Uganda, Democratic Republic of Congo, Nigeria, South Africa, and Burundi.
Dec 1, 2015 According to the Nigerian Minerals and Mining Act, the entire property in the holder to engage in drilling, excavation or other sub-surface technique. granted based on an open and transparent competitive bidding process.
Jul 17, 2018 ARQ will partner with EME Mine Nigeria Limited the Companys “EMEMine” to manage the day to day running of excavation and mining activities at the St the way for the continuation of the accounting and audit process.
34 of 1999 and re-enacts the Nigerian Minerals and Mining Act 2007 for the purposes of regulating Process for revocation when mineral titleholder fails to pay fees. b not engage in drilling, excavation or other sub-surface techniques;. | english |
[' \n \n [ਕਿਸੇ ਕੰਮ ਨੂੰ ਉਪ-ਕੰਮਾਂ ਵਿੱਚ ਵੰਡੋ। ਫਿਰ ਹਰੇਕ ਉਪ-ਕੰਮ ਲਈ ਦਿੱਤੀ ਗਈ ਸੂਚੀ ਵਿੱਚੋਂ ਇੱਕ ਟੂਲ ਚੁਣੋ ਅਤੇ ਸਮਝਾਓ ਕਿ ਤੁਸੀਂ ਉਪ-ਕੰਮ ਨੂੰ ਉਪ-ਕੰਮ ਨਾਲ ਕਿਵੇਂ ਹੱਲ ਕਰੋਗੇ।ਟੂਲ। \\n ਹੇਠਾਂ ਦਿੱਤੇ ਫਾਰਮੈਟ ਵਿੱਚ ਜਵਾਬ ਦਿਓਃ \\n-ਸਬ-ਟਾਸਕ ਦਾ ਵੇਰਵਾ \\n-ਟੂਲ ਦਾ ਨਾਮ \\n\\nਟਾਸਕਃ \'ਬਿੱਲੀਆਂ\' ਨਾਲ ਸਬੰਧਤ ਸਭ ਤੋਂ ਵੱਧ 2 ਸਭ ਤੋਂ ਢੁਕਵੇਂ ਨਤੀਜੇ ਇੱਕ ਨਾਲ ਲੱਭੋ।ਆਮ ਇੰਟਰਨੈੱਟ ਸਰਚ ਇੰਜਣ ਅਤੇ ਇੱਕ ਸਟਾਕ ਫੋਟੋ ਸਾਈਟ। \\n ਟੂਲਃ ਗੂਗਲ ਸਰਚ, ਸਟਾਕ ਫੋਟੋ ਸਾਈਟ API "] ', "ਕਿਸੇ ਕੰਮ ਨੂੰ ਉਪ-ਕੰਮਾਂ ਵਿੱਚ ਵੰਡੋ। ਫਿਰ ਦਿੱਤੀ ਗਈ ਸੂਚੀ ਵਿੱਚੋਂ ਹਰੇਕ ਉਪ-ਕੰਮ ਲਈ ਇੱਕ ਟੂਲ ਚੁਣੋ ਅਤੇ ਸਮਝਾਓ ਕਿ ਤੁਸੀਂ ਟੂਲ ਨਾਲ ਉਪ-ਕੰਮ ਨੂੰ ਕਿਵੇਂ ਹੱਲ ਕਰੋਗੇ।ਹੇਠ ਦਿੱਤੇ ਫਾਰਮੈਟ ਵਿੱਚ ਉੱਤਰ ਦਿਓਃ-ਸਬ-ਟਾਸਕ ਵੇਰਵਾ-ਟੂਲ ਨਾਮ ਟਾਸਕਃ ਇੱਕ ਆਮ ਇੰਟਰਨੈੱਟ ਨਾਲ 'ਬਿੱਲੀਆਂ' ਨਾਲ ਸਬੰਧਤ ਸਭ ਤੋਂ ਵੱਧ 2 ਸਭ ਤੋਂ ਢੁਕਵੇਂ ਨਤੀਜੇ ਲੱਭੋ।ਸਰਚ ਇੰਜਣ ਅਤੇ ਇੱਕ ਸਟਾਕ ਫੋਟੋ ਸਾਈਟ। ਟੂਲਃ ਗੂਗਲ ਸਰਚ, ਸਟਾਕ ਫੋਟੋ ਸਾਈਟ ਏਪੀਆਈ \n "] | punjabi |
আগামীকাল থেকে শুরু হচ্ছে সেনা কমান্ডারদের সম্মেলন নিজস্ব সংবাদদাতা : সেনা কমান্ডারদের সম্মেলন আগামীকাল থেকে শুরু হতে চলেছে দিল্লিতে ২২ এপ্রিল তা শেষ হবে রবিবার প্রতিরক্ষা মন্ত্রক নিশ্চিত করেছে খবরটি অনুষ্ঠানে সভাপতিত্ব করবেন সেনাপ্রধান জেনারেল এম এম নারাভানে এই মাসের শেষের দিকে সেনাপ্রধান হিসাবে তাঁর মেয়াদ শেষ হওয়ার কারণে এটি জেনারেল নারাভানের সভাপতিত্বে শেষ সেনা কমান্ডারদের সম্মেলন হতে চলেছে এটি এপ্রিল এবং অক্টোবরে অনুষ্ঠিত হওয়া একটি শীর্ষস্তরের দ্বিবার্ষিক ইভেন্ট এটি ধারণাগতস্তরের আলোচনার জন্য একটি প্রাতিষ্ঠানিক প্ল্যাটফর্ম, যা ভারতীয় সেনাবাহিনীর জন্য ধারণাগতস্তরের আলোচনার জন্য, গুরুত্বপূর্ণ নীতিগত সিদ্ধান্ত নেওয়ার জন্য গুরুত্বপূর্ণ সম্মেলনের সময়, ভারতীয় সেনাবাহিনীর ঊর্ধ্বতন নেতৃত্ব সীমান্তে অপারেশনাল পরিস্থিতি পর্যালোচনা করবে, সংঘর্ষের সমগ্র বর্ণালীতে হুমকির মূল্যায়ন করবে এবং সক্ষমতা বিকাশ এবং অপারেশনাল প্রস্তুতির পরিকল্পনার উপর আরও ফোকাস করার জন্য সক্ষমতা শূন্যতার বিশ্লেষণ করবেপ্রতিরক্ষা মন্ত্রক আরও বলেছে যে সীমান্ত এলাকায় অবকাঠামো উন্নয়ন, স্বদেশীকরণের মাধ্যমে আধুনিকীকরণ, নিশ প্রযুক্তির অন্তর্ভুক্তি এবং রাশিয়াইউক্রেন যুদ্ধের যে কোনও প্রভাবের মূল্যায়নের বিষয়েও আলোচনা আসন্ন সম্মেলনের সময় অনুষ্ঠিত হওয়ার কথা রয়েছে পূর্ব লাদাখের কিছু ঘর্ষণ পয়েন্টে চীনের সাথে দীর্ঘস্থায়ী সামরিক স্থবিরতার পরিপ্রেক্ষিতে কমান্ডাররা ৩৪০০ কিলোমিটার দীর্ঘ প্রকৃত নিয়ন্ত্রণ রেখা LAC বরাবর ভারতের সামরিক প্রস্তুতির একটি বিস্তৃত পর্যালোচনা করবে বলে জানা গিয়েছে জম্মু ও কাশ্মীরে সন্ত্রাসবিরোধী অভিযানের পাশাপাশি কেন্দ্রশাসিত অঞ্চলের সামগ্রিক পরিস্থিতিও সম্মেলনে ব্যাপকভাবে আলোচনা করা হবে বলে কর্মকর্তারা জানিয়েছেন প্রতিরক্ষা মন্ত্রী রাজনাথ সিং সিনিয়র সেনা কমান্ডারদের সাথে মতবিনিময় করবেন এবং ২১ এপ্রিল সম্মেলনে ভাষণ দেবেন বলে মনে করা হচ্ছে আরও খবরঃ https:anmnews.inHomeGetNewsDetails?p90673 https:anmnews.inHomeGetNewsDetails?p90676 Share on Facebook Share on Whatsapp Share on Tweet | bengali |
Shoaib Akhtar : షోయాబ్ అక్తర్కు అవమానం.. లైవ్ షో నుంచి వెళ్లిపొమ్మన్న హోస్ట్.. ఎందుకంటే? ఇస్లామాబాద్ : Shoaib Akhtar రావల్పిండి ఎక్స్ప్రెస్గా పేరొందిన ఒకప్పటి పాకిస్తాన్ మాజీ పేసర్ షోయబ్ అక్తర్కు తీవ్ర అవమానం ఎదురైంది. ప్రభుత్వ యాజమాన్యంలో నడుస్తున్న పీటీవీ స్పోర్ట్స్లో క్రికెట్ చర్చ జరుగుతుండగా.. సెట్ నుంచి వెళ్లిపోవాలని షో హోస్ట్ చెప్పాడు. దాంతో చొక్కాకున్న మైక్ను తీసేసి అక్తర్ వెళ్లిపోయాడు. ఈ అవమానంతో క్రికెట్ విశ్లేషకుడిగా కొనసాగనని స్పష్టం చేశారు. పీటీవీ షో నిర్వాహకుల తీరుపై నెటిజెన్లు మండిపడుతున్నారు. పాక్ స్పీడ్స్టర్గా సేవలందించిన అక్తర్ను అవమానించిన షో హోస్ట్ క్షమాపణలు చెప్పాలని వారు డిమాండ్ చేస్తున్నారు. టీ 20 ప్రపంచ కప్లో న్యూజిలాండ్పై పాకిస్తాన్ విజయం సాధించిన తర్వాత పీటీవీ స్పోర్ట్స్ నిర్వహించిన షోకు డాక్టర్ నౌమాన్ నియాజ్ హోస్ట్గా వ్యవహరించాడు. ఈ సందర్భంగా అక్తర్, నౌమాన్ మధ్య వేడివేడి చర్చ జరిగింది. తన వాదన నచ్చనట్లయితే సెట్ నుంచి బయటకు వెళ్లిపోవచ్చునని అక్తర్తో నౌమాన్ చెప్పాడు. అక్తర్ సమాధానం కోసం ఎదురుచూడకుండా తన పనిలో నిమగ్నమైపోయాడు. దాంతో షోయాబ్ అక్తర్ మారు మాట్లాడకుండా మైక్ తీసి టేబుల్పై పెట్టి వెళ్లిపోయాడు. తనతో చెడుగా ప్రవర్తించడం, సెట్ నుంచి వెళ్లిపోవాలని చెప్పడాన్ని అవమానంగా భావించి బయటకెళ్లిపోయానని షోయాబ్ అక్తర్ ట్వీట్ చేశారు. ఈ షోలో పాల్గొన్న సర్ వివియన్ రిచర్డ్స్, డేవిడ్ గోవర్, రషీద్ లతీఫ్, ఉమర్ గుల్, ఆకిబ్ జావేద్, పాకిస్తాన్ మహిళల జట్టు కెప్టెన్ సనా మీర్ వంటి ప్రముఖులు ఈ సంఘటనతో విచారం వ్యక్తం చేసినట్లుగా వీడియోల్లో స్పష్టంగా కనిపిస్తున్నది. ఈ వీడియోలు సోషల్ మీడియాలో వైరల్గా మారాయి. కాగా, షోయాబ్ అక్తర్కు మెజారిటీ నెటిజెన్లు మద్దతుగా నిలిచారు. దీనికి బాధ్యత వహించి డాక్టర్ నౌమాన్ నియాజ్ క్షమాపణలు చెప్పాలని నెటిజెన్లు డిమాండ్ చేస్తున్నారు. ఇవి కూడా చదవండి.. మడగాస్కర్ అడవుల్లో బుల్లి ఊసరవెల్లి రామ్దేవ్ బాబాకు ఢిల్లీ కోర్టు సమన్లు బ్రిటన్లో కొత్త ఫుడ్ ట్రెండ్ 5 : 2 .. వెజిటేరియన్ వైపు మొగ్గు పాకిస్తాన్కు సౌదీ అరేబియా చేయూత.. 300 కోట్ల ఆర్థిక సాయం ప్రకటన ఆఫ్ఘనిస్తాన్లోనే ఇంకా 450 మంది అమెరికన్లు.. పెంటగాన్ వెల్లడి పంజాబ్ రాజకీయాల్లో మళ్లీ చురుగ్గా కెప్టెన్ ఈ పండు రోజూ తింటే హార్ట్ అటాక్ రాదంట..! ఆక్స్ఫర్డ్ పరిశోధకుల వెల్లడి తాజా వార్తల కోసం నమస్తే తెలంగాణ ఫేస్బుక్ , ట్విటర్, టెలిగ్రామ్ ను ఫాలో అవండి.. | telegu |
انڈر 19 ورلڈ کپ کا چوتھا اور خری کوارٹر فائنل ڈھاکا میں پاکستان اور ویسٹ انڈیز کے درمیان کھیلا جائے گا فتح کی صورت میں سیمی فائنل میں پاکستان کا مقابلہ روایتی حریف بھارت سے ہو گا انڈر 19 ورلڈکپ گروپ بی میں پاکستان نے افغانستان کینیڈا اور سری لنکا کو شکست دی اور گروپ میں ناقابل شکست اور ٹاپ پر رہا گروپ سی میں ویسٹ انڈیز نے فجی اور زمبابوے کو شکست دی جبکہ انگلینڈ سے ہار گیا زمبابوے کے خلاف کیریبیئن ٹیم نے متنازعہ انداز میں فتح پائی ویسٹ انڈین بولر نے ڈیلیوری پھینکنے کے بجائے زمبابوے کے اخری بیٹسمین کو رن اوٹ کر دیا گیارہویں انڈرنائنٹین ورلڈکپ میں تین ایشین ٹیمیں سیمی فائنل میں پہنچ چکی ہیں پاکستان کی فتح کے نتیجے میں چاروں سیمی فائنلسٹ ٹیمیں ایشین ہوں گی اور پاکستان کا مقابلہ روایتی حریف بھارت سے نو فروری کو ہو گا دوسرا سیمی فائنل گیارہ فروری کو سری لنکا اور بنگلہ دیش کے درمیان کھیلا جائے گا | urdu |
મેષ અને મિથુનનો દિવસ સારો રહેશે, જાણો અન્ય રાશિઓ વિશે, જાણો તમારું આજનું રાશિફળ મેષ રાશિફળ: ભાગ્યની દૃષ્ટિએ આજનો દિવસ તમારા માટે સારો રહેશે, પરંતુ કાર્યસ્થળમાં વરિષ્ઠ અધિકારી સાથે અણબનાવની સ્થિતિમાં પણ મૌન રહેવું અને તમારા ગુસ્સાને કાબૂમાં રાખવું તમારા માટે સારું રહેશે. નિયંત્રણ તમે મિત્રો સાથે પાર્ટીનું આયોજન કરી શકો છો. વિવાહિત જીવનમાં અંધાધૂંધી રહેશે, પરંતુ તમારે તમારા જીવનસાથીની ભાવનાઓને સમજવી પડશે અને ચૂપચાપ કામ કરવું પડશે. સંતાન તરફથી તમને સારા સમાચાર મળી શકે છે, જેના કારણે તમારા પરિવારનું નામ રોશન થશે. પરિવારમાં કોઈ સભ્યના લગ્નની પુષ્ટિ થવાથી પારિવારિક વાતાવરણ ખુશનુમા રહેશે. વૃષભ રાશિફળ: આજનો દિવસ તમારા માટે મિશ્રિત રહેશે. નાના વેપારીઓએ વધુ મહેનત કરવી પડશે, તો જ તેઓ સફળતા પ્રાપ્ત કરી શકશે. જો તમે કેટલીક નવી યોજનાઓ શોધી રહ્યા છો, તો અચાનક નાણાકીય લાભ થઈ શકે છે. સરકારી નોકરીઓ સાથે જોડાયેલા લોકોએ કામમાં ધ્યાન આપવું પડશે, નહીં તો અધિકારીઓ સામે ગુસ્સે થવું પડી શકે છે. સાંજના સમયે તમને સામાજિક સંબંધોથી લાભ મળશે, કારણ કે તેમાં તમને થોડી પ્રમોશન મળી શકે છે. મિથુન રાશિફળ: આજનો દિવસ તમારા માટે લાભદાયી રહેશે. ધંધો કરતા લોકોને છૂટાછવાયા નફાની તકો મળતી રહેશે, પરંતુ તેઓએ તે અધિકારીઓને ઓળખવા પડશે, તો જ તેઓ તેમની પાસેથી નફો મેળવી શકશે. જો તમે નાનો ધંધો કરો છો, તો તમે તેમાં કોઈ અનુભવી વ્યક્તિની સલાહ લો તો સારું રહેશે. તમે તમારા મિત્રો અને પરિવાર સાથે મજાકમજાકમાં તમારો સમય પસાર કરશો. જો ભાઈબહેન સાથેના સંબંધોમાં કોઈ તિરાડ ચાલી રહી છે, તો તમારે તેને સુધારવી પડશે. પરિવારના નાના બાળકો તમારી પાસેથી કંઈક માંગ કરી શકે છે, જે તમારે પૂરી કરવી પડશે. કર્ક રાશિફળ: સામાજિક ક્ષેત્ર સાથે સંકળાયેલા લોકો માટે આજનો દિવસ સફળ રહેશે અને તમારી વિશ્વસનીયતા ચારે બાજુ ફેલાઈ જશે. તમે કોઈ મિત્ર સાથે થોડો સમય એકલા વિતાવશો. ધ્યાનમાં રાખો કે તમારે જૂની વસ્તુઓ લાવવાની જરૂર નથી, નહીં તો વિવાદ થઈ શકે છે. પરિવારમાં કોઈ વરિષ્ઠ સભ્યની તબિયત અચાનક બગડવાથી તમે પરેશાન રહેશો. તમને તમારા કામનો લાભ મળશે. વિદ્યાર્થીઓએ શિક્ષણમાં આવી રહેલી સમસ્યાઓ વિશે વરિષ્ઠો સાથે વાત કરવી પડશે, તો જ તેઓ સફળ થશે. સિંહ રાશિફળ : આજનો દિવસ તમારા માટે સામાન્ય રહેવાનો છે. કોઈ કાયદાકીય કામમાં બેદરકારીને કારણે તમારે ભાગવું પડી શકે છે. જો જીવનસાથીને પહેલાથી કોઈ રોગ છે તો આજે તેમની પરેશાની વધી શકે છે. કાર્યસ્થળ પર તમારા કેટલાક નવા દુશ્મનો પણ આવશે, જે તમને પરેશાન કરવાનો પૂરો પ્રયાસ કરશે. સામાજિક જવાબદારીઓ વધશે. બિનજરૂરી ખર્ચના કારણે તમે પરેશાન રહેશો. કન્યા રાશિફળ: સ્વાસ્થ્યની દૃષ્ટિએ આજનો દિવસ તમારા માટે મિશ્રિત રહેશે, તેથી તમારે તમારા સ્વાસ્થ્ય પ્રત્યે સચેત રહેવું પડશે. જો પરિવારમાં કોઈ પ્રતિકૂળ પરિસ્થિતિ ઊભી થાય તો તમારે ધીરજ રાખવી પડશે. પરિવારના તમામ સભ્યો તમારા વર્તનથી પરેશાન રહેશે. તમે તમારા માતાપિતાને યાત્રા પર લઈ જઈ શકો છો, જેનાથી તેમનું મન પ્રસન્ન રહેશે. તમે તમારા બાળપણના મિત્રને મળીને ખુશ થશો જેની તમે લાંબા સમયથી રાહ જોઈ રહ્યા છો. કોઈ વાત સાંભળીને તમારું મન અસ્વસ્થ થઈ જશે, પરંતુ તમે કોઈને કંઈ કહેશો નહીં. તુલા રાશિ : આજનો દિવસ તમારી મહત્વકાંક્ષાઓની પૂર્તિનો દિવસ રહેશે. કાર્યસ્થળ પર તમારું પદ અને પ્રતિષ્ઠા વધશે. જો તમે તમારા મિત્રો સાથે ફરવા જવાનું વિચારી રહ્યા છો, તો પેરેન્ટ્સ સાથે ચર્ચા કરીને ત્યાં જવું વધુ સારું રહેશે. જો તમારે વ્યાપાર સંબંધિત કોઈ વ્યક્તિ સાથે સલાહ લેવી હોય તો ચોક્કસ કરો. જો તમને સમયસર યોગ્ય ઉકેલ નહીં મળે તો તમારા મનમાં અશાંતિ રહેશે. જે લોકો નવી નોકરી શોધી રહ્યા છે તેમને સારી તક મળી શકે છે. તમારી કોઈપણ ઈચ્છાઓ પૂર્ણ થવાથી તમારું મન પ્રસન્ન રહેશે. વૃશ્ચિક રાશિફળ: આજે તમે કંઇક વિશેષ કરવાની ઇચ્છામાં રહેશો. સામાજિક ક્ષેત્રે કામ કરતા લોકોને કેટલાક ધાર્મિક કાર્યક્રમો અથવા સાંસ્કૃતિક કાર્યક્રમોમાં ભાગ લેવાની તક મળશે. જો તમે તમારા પૈસાનું રોકાણ કરવા જઈ રહ્યા છો, તો તમે સટ્ટાબાજી વગેરેમાં રોકાણ કરીને નફો મેળવશો. તમારા ભાઈઓ સાથે ચાલી રહેલા વાદવિવાદથી તમારું મન પરેશાન રહેશે. બાળક તરફથી તમને અચાનક કોઈ માહિતી મળી શકે છે. ધનુ રાશિફળ: આજનો દિવસ તમને અચાનક લાભ આપનારો રહેશે. કાર્યસ્થળમાં તમને અટવાયેલા પૈસા મળશે. રોજિંદા કામકાજમાં કોઈ સંકોચ ન રાખવો જોઈએ. આજે તમારા પરિવારના સભ્યો તમારા માટે મુશ્કેલી ઉભી કરી શકે છે. બાળકોના શિક્ષણમાં આવી રહેલી સમસ્યાઓ વિશે તમે તેમના શિક્ષકો સાથે વાત કરી શકો છો. તમારે માતાના વિચારો સાંભળવા અને સમજવાના છે, તો જ તમે તેમને કંઈક કહી શકશો, નહીં તો તેમનું મન ઉદાસ થઈ શકે છે. જો તમે કેટલાક નવા લોકો સાથે મિત્રતા રાખો છો, તો તેઓ તમારા વ્યવસાય માટે કેટલીક સારી માહિતી લાવી શકે છે. મકર રાશિફળ: આજનો દિવસ તમારા માટે અનુકૂળ રહેશે. કાર્યક્ષેત્રમાં તમારી પ્રતિષ્ઠા ચારે તરફ ફેલાશે અને તમારા દ્વારા આપવામાં આવેલા સૂચનો આવકાર્ય રહેશે, જેના કારણે તમારું મન પણ પ્રસન્ન રહેશે. તમારા ઘરે અચાનક મહેમાન આવવાને કારણે તમારા પૈસા ખર્ચ વધી શકે છે. શક્તિમાં વધારો થશે અને તમારા શત્રુઓનું મનોબળ તૂટી જશે. વિવાહિત જીવનમાં સુમેળ રહેશે. તમારે કેટલાક વધુ નવા પ્રયત્નો કરવા પડશે, તો જ તમે સફળતા પ્રાપ્ત કરી શકશો. જે લોકો રાજનીતિમાં હાથ અજમાવી રહ્યા છે, તેમને કોઈપણ પક્ષ સાથે જોડાણ કરવાની તક મળશે. કુંભ રાશિ : આજનો દિવસ તમારા માટે નવી સંપત્તિના સંકેતો દર્શાવે છે. જો તમે જમીન, વાહન, મકાન, દુકાન વગેરે ખરીદવા માંગો છો તો તમારી મનોકામના પૂર્ણ થશે. તમારે તમારા મનમાં સંતોષ જાળવી રાખવો પડશે. તમે ઘર માટે જરૂરી વસ્તુઓ પણ ખરીદી શકો છો. તમે તમારા જીવનસાથી માટે ભેટ લાવી શકો છો, આ તમારા બંને વચ્ચેનો પ્રેમ ગાઢ બનાવશે. જો તમે વ્યવસાયમાં થોડો ફેરફાર કરવા માંગો છો, તો તેના માટે દિવસ સારો રહેશે. તમારે સાસરિયાઓને પૈસા ઉધાર આપવાનું ટાળવું પડશે, નહીં તો તે તમારા પરસ્પર સંબંધોમાં તિરાડ પેદા કરી શકે છે. મીન રાશિફળઃ આજનો દિવસ તમારા માટે સફળ રહેશે. જો વિદ્યાર્થીઓએ કોઈપણ સ્પર્ધામાં ભાગ લીધો હોય, તો તેઓ તેમાં વિજય મેળવી શકે છે. નોકરી સાથે જોડાયેલા વિદ્યાર્થીઓને પણ કોઈ વિશેષ સિદ્ધિ મળી શકે છે. જો બાળકના ભવિષ્ય સાથે જોડાયેલી કેટલીક સમસ્યાઓ હતી, તો તમે પરિવારના સભ્યો સાથે બેસીને તેનો ઉકેલ પણ મેળવી શકશો. જે લોકો લાંબા સમયથી નોકરી માટે પ્રયત્નશીલ છે, તેઓને આજે કેટલીક સારી માહિતી સાંભળવા મળી શકે છે. તમારે તમારા પિતાના સ્વાસ્થ્ય પ્રત્યે સચેત રહેવું પડશે. ડૉક્ટરની સલાહ અવશ્ય લો, નહીંતર લાંબી બીમારી થઈ શકે છે. | gujurati |
कार से 18 पेटी देसी शराब बरामद, सपा प्रत्याशी समेत चार पर रिपोर्ट नवाबगंज। विधानसभा चुनाव में मतदाताओं को बांटने के लिए ले कार से ले जाई जा रही 18 पेटी देसी शराब समेत पुलिस ने दो लोगों को गिरफ्तार किया है, जबकि चालक मौका पाकर भाग गया। पुलिस ने कार और शराब को अपने कब्जे में ले लिया है। मामले में पुलिस ने सपा प्रत्याशी भगवत सरन गंगवार, शराब दुकान के सेल्समैन विपिन कुमार, सर्वेश समेत चार के खिलाफ रिपोर्ट दर्ज की है। शनिवार शाम पुलिस को सूचना मिली कि कस्बे में बाईपास मार्ग पर स्थित देसी शराब की दुकान से एक कार में अवैध तरीके से शराब ले जाई जा रही है। पुलिस ने मौके पर पहुंचकर कार समेत दो युवकों को पकड़ लिया, जबकि चालक भाग गया। तलाशी में कार से देसी शराब की 18 पेटियां बरामद हुईं। पुलिस कार समेत दोनों युवकों को पकड़कर थाने ले गई। सूचना पर रिटर्निंग ऑफिसर राजीव शुक्ला ने थाने पहुंचकर पुलिस को जांच कर कार्रवाई के आदेश दिए। नवाबगंज इंस्पेक्टर अशोक कुमार कंबोज ने बताया कि 18 पेटी देसी शराब समेत दो लोगों को हिरासत में लेकर पूछताछ की जा रही है। जांच के बाद आगे की कार्रवाई की जाएगी। मामले में पुलिस ने सपा प्रत्याशी भगवत सरन गंगवार, शराब भट्ठी के सेल्समैन विपिन कुमार, सर्वेश समेत चार के खिलाफ रिपोर्ट दर्ज की है। | hindi |
पलक तिवारी ने शेयर की ग्लैमरस फोटोज, सलमान की Ex गर्लफ्रेंड ने किया कमेंट, देखें VIRAL पोस्ट एक्ट्रेस श्वेता तिवारी Shweta Tiwari की बेटी अपने स्टाइल और फैशन से लोगों का खूब दिल जीत रही हैं. पलक तिवारी Palak Tiwari के एक से बढ़कर एक स्टनिंग फोटोज फैंस को खूब पसंद आते हैं. सोशल मीडिया पर भी उनकी लेटेस्ट फोटो वायरल हो रही हैं. पलक तिवारी ने हाल ही में इंस्टाग्राम पर फोटो शेयर की हैं, जिसपर फैंस के खूब कमेंट्स आ रहे हैं. पीच कलर की शॉर्ट बॉडीकॉन ड्रेस के साथ व्हाइट ब्लेजर पहने पलक तिवारी ने अपनी ग्लैमरस तस्वीरें शेयर की हैं. अपनी इन तस्वीरों को शेयर करते हुए पलक ने कैप्शन में लिखा है, अ विंटर रोज. बेहद खूबसूरत हैं अनु मलिक की छोटी बेटी, फोटोज देख आप भी हो जाएंगे फैनखुले बालों और लाइट मेकअप के साथ पलक तिवारी ने अपनी खूबसूरत अदाओं से लोगों का दिल जीत लिया है. पलक तिवारी ने इस फोटो में फ्लोरल इयरिंग पहना हुआ है, जो उन्हें बेहद सूट कर रहा है. क्या आप जानते हैं इन इयरिंग की कीमत कितनी है? ये Bouquet Enamel Danglers इयरिंग ऑनलाइन उपलब्ध हैं, इनकी कीमत 1900 रुपये है.पलक के इस ग्लैम लुक को फैंस का बेशुमार प्यार मिल रहा है. फैंस उन्हें क्वीन, स्टनिंग, गॉर्जियस जैसे कॉम्पलिमेंट्स दे रहे हैं. पलक को सबसे खास कमेंट मिला संगीता बिजलानी से. उन्होंने पलक की तस्वीर पर कमेंट करते हुए लिखा बेहद प्यारी. इतना ही नहीं, पलक तिवारी की इस फोटो पर हजारों लाइक्स भी आ चुके हैं. PICS: इस डॉक्टर की खूबसूरती की कायल हुई दुनिया, मिला Miss Pakistan Universal 2022 का ताज जब पलक का सॉन्ग बिजली रिलीज हुआ था, तो उनकी पॉपुलैरिटी में चार चांद लग गए. पलक जल्द ही बॉलीवुड डेब्यू भी करने वाली हैं. यह गाना लोगों द्वारा खूब पसंद किया था. बता दें कि पलक तिवारी का पिछले दिनों एक वीडियो सॉन्ग रिलीज हुआ था, जिसमें वह वरुण धवन के साथ डांस करती हुई नजर आ रही थीं. अटकलें आने लगीं कि पलक जल्द वरुण धवन संग फिल्म या म्यूजिक वीडियो में नजर आने वाली हैं. लेकिन अभी ऑफिशियल तरीके से इस बात का कोई खुलासा नहीं हुआ है. Wedding Album: मलयाली के बाद बंगाली लुक में भी बेहद सुंदर लगीं मौनी रॉय, देखें शादी की सभी तस्वीरें पलक तिवारी सोशल मीडिया पर काफी एक्टिव रहती हैं और अपनी लाइफ से जुड़ी बातें शेयर करती रहती हैं. इतना ही नहीं, पलक इंस्टाग्राम पर ब्यूटी टिप्स भी शेयर करती रहती हैं. Heel पहनने से हो सकती है कई गंभीर Health Problems, जानिए इससे होने वाली दिक्कतें | hindi |
module.exports = function(portNumber){
/**
* Module dependencies.
*/
var app = require('../app');
var debug = require('debug')('lcsta:server');
var http = require('http');
/**
* Get port from environment and store in Express.
*/
var port = normalizePort(process.env.PORT || (portNumber || '3000'));
app.set('port', port);
/**
* Create HTTP server.
*/
var server = http.createServer(app);
/**
* Listen on provided port, on all network interfaces.
*/
server.listen(port);
server.on('error', onError);
server.on('listening', onListening);
/**
* Normalize a port into a number, string, or false.
*/
function normalizePort(val) {
var port = parseInt(val, 10);
if (isNaN(port)) {
// named pipe
return val;
}
if (port >= 0) {
// port number
return port;
}
return false;
}
/**
* Event listener for HTTP server "error" event.
*/
function onError(error) {
if (error.syscall !== 'listen') {
throw error;
}
var bind = typeof port === 'string'
? 'Pipe ' + port
: 'Port ' + port
// handle specific listen errors with friendly messages
switch (error.code) {
case 'EACCES':
console.error(bind + ' requires elevated privileges');
process.exit(1);
break;
case 'EADDRINUSE':
console.error(bind + ' is already in use');
process.exit(1);
break;
default:
throw error;
}
}
/**
* Event listener for HTTP server "listening" event.
*/
function onListening() {
var addr = server.address();
var bind = typeof addr === 'string'
? 'pipe ' + addr
: 'port ' + addr.port;
debug('Listening on ' + bind);
}
}; | code |
लॉन्चिंग से पहले कंटेनर से लूटे 1 करोड़ के 5G मोबाइल, जानिए एक Mobile की कीमत अलवर. अलवर जिले की मालाखेड़ा Malakheda थाना पुलिस ने बड़ी कार्रवाई करते हुए मोबाइल चोर गैंग Mobile thief gang के तीन शातिर बदमाशों को गिरफ्तार किया है. पुलिस ने उनके पास से एक करोड़ रुपये से अधिक की कीमत के 227 नए एंड्रॉइड मोबाइल फोन Android mobile phone, तीन देसी कट्टे और एक दर्जन जिंदा कारतूस बरामद किये हैं. गैंग से बरामद किये गये सभी मोबाइल 5जी के हैं. इन्हें अभी लॉन्च भी नहीं किया गया है. इससे पहले ही आरोपियों ने उनको लूट Loot लिया. वे इन्हें सस्ते दामों में बेचने की फिराक में थे. आरोपियों ने ये मोबाइल चलते हुए कंटेनर से उड़ाये थे. सभी आरोपी काफी शातिर किस्म के हैं. पुलिस उनसे पूछताछ में जुटी है.पुलिस अधीक्षक तेजस्विनी गौतम ने बताया कि बदमाशों ने ये मोबाइल जयपुरमुंबई हाईवे पर चलते हुए कंटेनर से लूटे थे. इन मोबाइलों की बाजार में कीमत करीब एक करोड़ के आसपास है. पुलिस बदमाशों से पूछताछ कर रही है. इन बदमाशों से कई बड़ी घटनाओं के खुलासे होने की उम्मीद है.बदमाशों ने कार को भगाने का प्रयास कियाएसपी ने बताया कि मालाखेड़ा थाना पुलिस को मंगलवार रात को इस गैंग के लोगों के आने की मुखबिर से सूचना मिली थी. इस पर पुलिस ने हल्दीना चौराहे पर देर रात वाहनों की जांच पड़ताल शुरू की. इस दौरान अलवर की तरफ से पुलिस को एक कार आती हुई नजर आई. पुलिस ने बैरिकेडिंग लगाकर कार को रोकने का इशारा किया. लेकिन कार चालक गाड़ी को बैक करके वापस ले जाने लगा. इस पर पुलिस ने उसको घेर लिया.हरियाणा और राजस्थान के रहने वाले हैं बदमाशपुलिस ने कार में बैठे सभी लोगों को बाहर निकाला. उसमें 3 लोग बैठे हुए थे. कार की तलाशी में पुलिस को उसमें विभिन्न कंपनियों के 227 5G मोबाइल, 3 देसी कट्टे और 12 जिंदा कारतूस मिले. इस पर पुलिस ने साजिद उर्फ काला निवासी डूडोली हरियाणा, अनीश और जब्बार निवासी जयपुर को गिरफ्तार कर लिया. बदमाशों से बरामद किये गये मोबाइल्स की कीमत करीब एक करोड़ के आसपास है.कई अन्य बड़ी घटनाओं का खुलासा हो सकता हैपूछताछ में सामने आया कि बदमाशों ने ये मोबाइल जयपुरमुंबई हाईवे पर चलते हुए एक कंटेनर से लूटे थे. इस घटना के दौरान उनके तीन अन्य साथ मोहम्मद, आसिफ व अब्बास थे. पुलिस बदमाशों का पुराना रिकॉर्ड तलाश रही है. इसके अलावा इनके अन्य साथियों को भी गिरफ्तार करने की योजना तैयार की गई है. पुलिस ने कहा कि उनसे पूछताछ में कई अन्य बड़ी घटनाओं के खुलासा हो सकता है.जल्दी पैसे कमाने के लालच में करते हैं वारदातइन मोबाइल्स को बदमाश किन लोगों को बेचने वाले थे उसके बारे में भी तफ्तीश की जा रही है. पुलिस ने बताया कि तीनों ही बदमाश बड़े ही शातिर किस्म के हैं. कम समय में जल्दी पैसे कमाने के लालच में यह लोग ऐसी वारदातों को अंजाम देते हैं. इससे पहले भी ये लोग कई घटनाओं को अंजाम दे चुके हैं. सभी कम उम्र के युवा हैं. | hindi |
ಪೂರ್ಣಾವಧಿ ಅಧಿಕಾರ ಮಾಡಲು ಬಿಎಸ್ವೈಗೆ ಅವಕಾಶ ಕೊಡಬೇಕಿತ್ತು ಎಂಬಿ ಪಾಟೀಲ್ ಬಿಎಸ್ವೈ ರಾಜ್ಯ ಕಂಡ ವಿಶೇಷ ರಾಜಕಾರಣಿ. ಮಾಜಿ ಸಿಎಂ ಯಡಿಯೂರಪ್ಪನವರ ಬಗ್ಗೆ ವಿಶೇಷ ಗೌರವ ಇದೆ. ಬಿಜೆಪಿಯಲ್ಲಿ ಬಿಎಸ್ವೈ ಮಾಸ್ ಲೀಡರ್. ಎಲ್ಲಾ ಸಮುದಾಯಗಳು ಈಗ ಯಡಿಯೂರಪ್ಪ ಬೆಂಬಲಕ್ಕೆ ನಿಂತಿದ್ದಾರೆ. ಬೆಂಗಳೂರು: ಸ್ವಕ್ಷೇತ್ರವನ್ನು ಮಗನಿಗೆ ಬಿಟ್ಟುಕೊಡುವ ಬಗ್ಗೆ ಬಿಎಸ್ ಯಡಿಯೂರಪ್ಪ BS Yediyurappa ಹೇಳಿಕೆ ನೀಡಿರುವ ವಿಚಾರಕ್ಕೆ ಸಂಬಂಧಿಸಿ ಟಿವಿ9ಗೆ ಪ್ರತಿಕ್ರಿಯೆ ನೀಡಿರುವ ಕೆಪಿಸಿಸಿ ಪ್ರಚಾರ ಸಮಿತಿ ಅಧ್ಯಕ್ಷ ಎಂ.ಬಿ.ಪಾಟೀಲ್ MB Patil, ರಾಜ್ಯದಲ್ಲಿ ಹೋರಾಟ ಮಾಡಿ ಯಡಿಯೂರಪ್ಪ ಬಿಜೆಪಿ ಅಧಿಕಾರಕ್ಕೆ ತಂದಿದ್ದಾರೆ. ಅಧಿಕಾರಕ್ಕೆ ಬಂದ ಬಳಿಕ ಬಿಎಸ್ವೈನ ಮೂಲೆಗುಂಪು ಮಾಡಿದ್ದಾರೆ. ಪೂರ್ಣಾವಧಿ ಅಧಿಕಾರ ಮಾಡಲು ಬಿಎಸ್ವೈಗೆ ಅವಕಾಶ ಕೊಡಬೇಕಿತ್ತು. ದಕ್ಷಿಣ ಭಾರತದಲ್ಲಿ ಬಿಜೆಪಿ ಅಧಿಕಾರಕ್ಕೆ ಬರಲು ಬಿಎಸ್ವೈ ಕಾರಣ. ಕೆಳ ಮಟ್ಟದಿಂದ ಹೋರಾಟ ಮಾಡಿ ಪಕ್ಷ ಸಂಘಟನೆ ಮಾಡಿದ್ದಾರೆ ಎಂದು ಹೇಳಿದರು. ಬಿಎಸ್ವೈ ರಾಜ್ಯ ಕಂಡ ವಿಶೇಷ ರಾಜಕಾರಣಿ. ಮಾಜಿ ಸಿಎಂ ಯಡಿಯೂರಪ್ಪನವರ ಬಗ್ಗೆ ವಿಶೇಷ ಗೌರವ ಇದೆ. ಬಿಜೆಪಿಯಲ್ಲಿ ಬಿಎಸ್ವೈ ಮಾಸ್ ಲೀಡರ್. ಎಲ್ಲಾ ಸಮುದಾಯಗಳು ಈಗ ಯಡಿಯೂರಪ್ಪ ಬೆಂಬಲಕ್ಕೆ ನಿಂತಿದ್ದಾರೆ ಎಂದು ಎಂಬಿ ಪಾಟೀಲ್ ಹೇಳಿದರು. ರಾಜ್ಯದಲ್ಲಿ ಮತದಾರರಿಗೆ ಉಡುಗೊರೆ ಹಂಚುವ ಕಾರ್ಯವನ್ನು ಪಕ್ಷಗಳು ಈಗಾಗಲೇ ಆರಂಭಿಸಿವೆ ಕಾಂಗ್ರೆಸ್ನಲ್ಲಿ ವ್ಯಕ್ತಿ ಪೂಜೆ ನಡೆಯಲ್ಲ, ಪಕ್ಷ ಪೂಜೆಯಾಗಬೇಕು ಎಂದು ಮಾತನಾಡಿದ ಪಾಟೀಲ್, ವ್ಯಕ್ತಿ ಆಗಲಿ, ಶಾಲಾಕಾಲೇಜು ಅಥವಾ ಸಂಸ್ಥೆಗಳು ಆಗಿರಲಿ, 50 ವರ್ಷ ಅಥವಾ 75 ವರ್ಷ ಆದಾಗ ಇಂತಹ ಆಚರಣೆ ಮಾಡುತ್ತಾರೆ. ಸಿದ್ದರಾಮಯ್ಯ 5 ವರ್ಷ ಉತ್ತಮ ಆಡಳಿತ ನೀಡಿದ್ದಾರೆ. ಸಿದ್ದರಾಮಯ್ಯ 75ನೇ ಹುಟ್ಟುಹಬ್ಬ ಆಗಿರುವ ಹಿನ್ನೆಲೆ ಕಾರ್ಯಕ್ರಮ ನಡೆಯುತ್ತಿದೆ. ರಾಜ್ಯದಲ್ಲಿ ಸ್ವಂತ ಬಲದಲ್ಲಿ ಕಾಂಗ್ರೆಸ್ ಪಕ್ಷ ಅಧಿಕಾರಕ್ಕೆ ಬರಬೇಕು. ಹೀಗಾಗಿ ನಾವೇನೇ ಆಸೆಪಟ್ಟರೂ ಹೈಕಮಾಂಡ್ ನಿರ್ಧಾರಕೈಗೊಳ್ಳುತ್ತದೆ ಎಂದು ತಿಳಿಸಿದರು. Yasin Malik: ನ್ಯಾಯಯುತ ವಿಚಾರಣೆಗೆ ಒತ್ತಾಯಿಸಿ ತಿಹಾರ್ ಜೈಲಿನಲ್ಲಿ ಯಾಸಿನ್ ಮಲಿಕ್ ಉಪವಾಸ ಸತ್ಯಾಗ್ರಹ | kannad |
ತಮ್ಮ ಬಗ್ಗೆ ಬಂದ ಊಹಾಪೋಹಗಳಿಗೆ ಸ್ಪಷ್ಟನೆ ಕೊಟ್ಟ ರೋಹಿತ್ ಶರ್ಮಾ ಮುಂಬೈ: ಹಿಟ್ ಮ್ಯಾನ್ ರೋಹಿತ್ ಶರ್ಮಾ ಗಾಯದ ಕಾರಣದಿಂದ ಆಸ್ಟ್ರೇಲಿಯಾ ವಿರುದ್ಧದ ಸೀಮಿತ ಓವರ್ ಗಳ ಪಂದ್ಯದಿಂದ ಹೊರ ನಡೆದಿರುವುದು, ಐಪಿಎಲ್ ನಲ್ಲಿ ಆಡಿರುವುದು ಸಾಕಷ್ಟು ಅನುಮಾನ ಹುಟ್ಟು ಹಾಕಿತ್ತು. ಇದೀಗ ಅವರ ಗಾಯದ ಬಗ್ಗೆ ಅವರೇ ಸ್ಪಷ್ಟನೆ ಕೊಟ್ಟಿದ್ದಾರೆ. ಸ್ವಲ್ಪ ಸಮಸ್ಯೆ ಇರುವುದು ನಿಜ. ಅದಕ್ಕೆ ಪರಿಹಾರ ಪಡೆಯುತ್ತಿದ್ದೇನೆ. ಜನ ಏನು ಹೇಳ್ತಿದ್ದಾರೆ, ನನಗೆ ಏನಾಗುತ್ತಿದೆ ಎಂದು ನನಗೆ ಗೊತ್ತಿಲ್ಲ. ನಾನು ನಿರಂತರವಾಗಿ ಬಿಸಿಸಿಐ ಮತ್ತು ಮುಂಬೈ ಇಂಡಿಯನ್ಸ್ ಜತೆ ಸಂಪರ್ಕದಲ್ಲಿದ್ದೆ. ಐಪಿಎಲ್ ಚುಟುಕು ಕ್ರಿಕೆಟ್ ಆಗಿದ್ದರಿಂದ ಆಡಲು ತೀರ್ಮಾನಿಸಿ ಆಡಿದೆ. ಆದರೆ ಬಿಳಿ ಚೆಂಡಿನಲ್ಲಿ ಆಡಲು ಇನ್ನೂ ಸ್ವಲ್ಪ ಸಮಯ ಬೇಕಾಗುತ್ತದೆ. ಸುದೀರ್ಘ ಮಾದರಿಯ ಆಟಕ್ಕೆ ಮರಳುವ ಮೊದಲು ಸಂಪೂರ್ಣ ಫಿಟ್ ಆಗಿರಬೇಕು. ಅದಕ್ಕಾಗಿ ಬೆಂಗಳೂರಿನ ಎನ್ ಸಿಎನಲ್ಲಿ ಪುನಶ್ಚೇತನ ಕಾರ್ಯದಲ್ಲಿ ತೊಡಗಿಸಿಕೊಂಡಿದ್ದೇನೆ ಎಂದು ರೋಹಿತ್ ಹೇಳಿಕೊಂಡಿದ್ದಾರೆ. | kannad |
## INDICATION:
man with atrial fibrillation referred for assessment
of pulmonary vein anatomy prior to pulmonary vein isolation procedure.
## BODY SURFACE AREA (M2):
2.22
Hemodynamic Measurements
Measurement Result
Systemic Blood Pressure (mmHg) 137/59
Heart Rate (bpm) 57
## TECHNOLOGISTS:
, RT
Nursing support: , RN
## EGFR:
48ml/min1.73m2 based on creatinine 1.5 mg/dl on
Total Gd-DTPA (Magnevist ) contrast: 20 ml (0.1mmol/kg)
Injection site: Right antecubital vein
## 1) STRUCTURE:
Axial dual-inversion T1-weighted images of the myocardium were
obtained without spectral fat saturation pre-pulses in 5-mm contiguous slices.
2) Function: Breath-hold cine SSFP images were acquired in the left
ventricular 2-chamber, 4-chamber, horizontal long axis, short axis slices (8-
mm slices with 2-mm gaps), sagittal and coronal orientations of the left
ventricular outflow tract, and aortic valve short axis orientations. Breath-
hold real time SSFP images were acquired in the left ventricular 2-chamber, 4-
chamber, and mid-papillary short axis slices.
3) Pulmonary Vein MRA: First pass angiography of the pulmonary veins (PV) was
obtained after administration of a bolus of gadopentetate dimeglumine 0.1
mmol/kg (20 ml Magnevist solution). Multiplanar reconstructions of the
pulmonary veins were generated and assessed on a workstation.
4) LGE: Late gadolinium enhancement (LGE) images were obtained using a 3D
free-breathing ECG-gated segmented inversion-recovery TFE acquisition in the
axial plane 20 minutes after injection of a total of 0.1 mmol/kg gadopentetate
dimeglumine (20ml Magnevist solution) with spectral fat saturation pre-
pulses.
## FINDINGS:
Structure and Function
The pericardial thickness was normal. There were no pericardial or pleural
effusions. The origins of the left main and right coronary arteries were
identified in their customary positions. The indexed diameters of the
ascending and descending thoracic aorta were normal. The main pulmonary
artery diameter index was normal. The left atrial AP dimension was moderately
increased. The right and left atrial lengths in the 4-chamber view were
mildly increased. The coronary sinus diameter was normal.
The left ventricular end-diastolic dimension index was normal. The end-
diastolic volume index was normal. The calculated left ventricular ejection
fraction was normal at 61% with normal regional systolic function. The LVEF
may be slightly underestimated due to technical issues associated with
arrhythmia compensation. The anteroseptal and inferolateral wall thicknesses
were normal. The left ventricular mass index was normal. The right
ventricular end-diastolic volume index was normal. The calculated right
ventricular ejection fraction was normal at 72%, with normal free wall motion.
There was a mechanical prosthesis in the aortic position. A systolic signal
void was seen in the left atrium consistent with an eccentric jet of mitral
regurgitation. The anterior mitral valve leaflet appears redundant, with
possible mitral valve prolapse.
On LGE images, there was no evidence of prior myocardial infarciton or
scarring.
Pulmonary Vein MR
Three right-sided pulmonary veins and one common left-sided pulmonary veins
were identified, all entering the left atrium and free of focal stenoses
listed above). The multiplanar reconstructions confirmed the above
findings.
## IMPRESSION:
1. Normal left ventricular cavity size with normal regional left ventricular
systolic function. The LVEF was normal at 60%.
2. Normal right ventricular cavity size and systolic function. The RVEF was
normal at 72%.
3. The indexed diameters of the ascending and descending thoracic aorta were
normal. The main pulmonary artery diameter index was normal.
4. Bi-atrial enlargement.
5. Normal size and orientation of the pulmonary veins without MR evidence of
anomalous pulmonary venous return or pulmonary vein stenosis.
The images were reviewed by Drs.
.
| medical |
## INDICATION:
Left parietal GBM post resection and radiation started on
Avastin. Evaluate for progression.
## FINDINGS:
Re-identified are postoperative changes from left parietal craniotomy and mass
resection with underlying dural thickening and enhancement. Surrounding and
inferior to the resection bed, re-identified is a heterogeneously enhancing
lesion measuring up to 46 x 26 mm in maximal axial dimension, demonstrating
prominently slowed diffusion, appearing increased in size compared the prior
examination where it measured roughly 33 x 26 mm. The interval increase in
size is mainly due to a heterogeneously enhancing component extending
posteriorly and inferiorly (10:19). Additionally, there are several new areas
of contrast enhancement and slowed diffusion. For example, there is a
confluent area of enhancement crossing midline at the level of the splenium of
the corpus callosum, measuring approximately 22 x 9 mm (900:105, 106), with
increased FLAIR signal abnormality surrounding these lesions. There is an
additional new 16 x 13 area of rounded enhancement in the left frontal
operculum with slowed diffusion. Tiny millimetric areas of punctate satellite
enhancement are noted in the left frontoparietal corona radiata bridging the 2
main enhancing lesions.
There is no evidence of hemorrhage, midline shift or infarction. The
ventricles and sulci are normal in caliber and configuration. Background
areas of periventricular, subcortical and deep white matter T2/FLAIR
hyperintensities likely represent a combination of chronic small vessel
ischemic disease and posttreatment changes. The principal intracranial
vascular flow voids are preserved.
The visualized paranasal sinuses are grossly clear. The orbits are grossly
unremarkable. The mastoid air cells are clear.
## IMPRESSION:
1. Interval disease progression with increase in size of a heterogeneously
enhancing left parietal mass adjacent to the resection bed, with new areas of
enhancement involving the splenium of the corpus callosum crossing midline, as
well as a new rounded area of enhancement in the left frontal operculum, with
punctate areas of satellite nodularity bridging these 2 areas of enhancement,
with prominently slowed diffusion corresponding to the enhancing component.
2. No acute infarct or hemorrhage.
| medical |
সাবধান! গরমে শিশুদের যেসব রোগ হতে পারে, জেনেনিন আর সতর্ক থাকুন গরমে শিশুরা বেশি অসুস্থ হয়ে যায় আর শিশুরা অসুস্থ থাকলে বাবামায়েরাও ভালো থাকে না গরমে শিশুদের মধ্যে যে সমস্যাগুলো বেশি দেখা যায় সেগুলো হচ্ছে জলবসন্ত, ফুসকড়ি, পেটের সমস্যা ইত্যাদি গরমে শিশুদের বিশেষভাবে যত্ন না নিলে এইসব রোগের প্রকট বেশিই দেখা যায় জলবসন্ত বা চিকেন পক্স গরমকালে শিশুদের জলবসন্ত হয়ে থাকে এটা সাধারণত এক থেকে পাঁচ বছরের শিশুদের বেশি হয় তবে চিকেন পক্সের টিকা নেওয়া থাকলে এ রোগটি হওয়ার আশঙ্কা অনেকাংশে কমে যায় এ সময় শিশুর বিশেষ যত্ন নিতে হবে তাকে নরম সুতি কাপড় পরাতে হবে তরল বা নরম জাতীয় খাবার খাওয়াতে হবে বেশি করে জল খাওয়াতে হবে এর সঙ্গে অবশ্যই মায়ের দুধ খাওয়াতে হবে ত্বকের র্যাশ বা ফুসকুড়ি শিশুদের ক্ষেত্রে এ সমস্যাটা বেশি দেখা যায় এটা সাধারণত ঘামাচি বা চামড়ার ওপরে লাল দানার মতো ফুসকুড়ি হয়ে থাকে এই র্যাশ বা ফুসকুড়ি গরমের কারণেই হয়ে থাকে এ সময় শিশুকে অবশ্যই পরিষ্কার রাখতে হবে নিয়মিত স্নান করিয়ে ফুসকুড়ির জায়গাগুলোতে বেবি পাউডার লাগাতে হবে এতে চুলকানি কিছুটা কমে যাবে প্রতিবার কাপড় বদলানোর সময় শিশুকে নরম ভেজা কাপড় দিয়ে মুছে পাউডার লাগিয়ে দিতে হবে অনেক সময় ডায়াপারের কারণেও শিশুর ফুসকুড়ি হতে পারে তাই খেয়াল রাখতে হবে, ভেজা ডায়াপার যেন শিশুর গায়ে বেশিক্ষণ না থাকে ডায়াপার নষ্ট হয়ে গেলে সঙ্গে সঙ্গে তা খুলে নতুন ডায়াপার পরিয়ে দিন তবে গরমের সময় ডায়াপার না পরানোই ভালো অনেক সময় র্যাশ বেশি হয়ে গেলে ঘা হয়ে যেতে পারে সেক্ষেত্রে অবশ্যই বিশেষজ্ঞের পরামর্শ নিতে হবে পেট খারাপ গরমের সময় সাধারণত বাচ্চাদের বেশিই পেট খারাপ করে থাকে শিশুর পেট খারাপ হলে তাকে ঘন ঘন স্যালাইন খাওয়াতে হবে সেইসঙ্গে জল অথবা ডাবের জল খাওয়াতে হবে একই সঙ্গে তাকে তরল খাবারও দিতে হবে যতক্ষণ পর্যন্ত শিশুর পায়খানা স্বাভাবিক না হচ্ছে ততক্ষণ পর্যন্ত এই নিয়ম মেনে চলতে হবে লক্ষ্য রাখতে হবে যেন শিশুর জলশূন্যতা না হয় এবং তার প্রস্রাবের পরিমাণ স্বাভাবিক থাকে এছাড়া শিশুর পায়খানার সঙ্গে যদি রক্ত যায় তবে অবহেলা না করে অবশ্যই বিশেষজ্ঞের পরামর্শ নিতে হবে ঠাণ্ডার সমস্যা গরমে শিশুদের ক্ষেত্রে ঠাণ্ডার সমস্যাটাও বেশি হতে দেখা যায় গরমে অতিরিক্ত ঘামের ফলে ঠাণ্ডা লেগে যেতে পারে তাই শিশু ঘেমে গেলে সঙ্গে সঙ্গে তার শরীর মুছে দিয়ে কাপড় বদলে দিতে হবেbs | bengali |
jsonp({"cep":"08220011","logradouro":"Viela Vinte e Seis","bairro":"Cidade Ant\u00f4nio Estev\u00e3o de Carvalho","cidade":"S\u00e3o Paulo","uf":"SP","estado":"S\u00e3o Paulo"});
| code |
لاہورسپورٹس رپورٹر پاکستان کرکٹ بورڈ کے نئے ئین کے بعد پی سی بی کے نو منتخب چیئرمین شہریار خان کی زیر صدارت گورننگ بورڈ کا پہلا اجلاس نیشنل کرکٹ اکیڈمی لاہور میں ہوگا اجلاس کا ایجنڈ مالی سال 201415ءکے بجٹ کی منظوری کے ساتھ ساتھ مستقبل میں سٹریلیا اور نیوزی لینڈ کے خلاف ہوم سیریز کے میڈیا رائٹس کی فروخت کے لیے پہلے سے ٹینڈرز جاری کر رکھے ہیں جس کے لیے پہلے سے کمیٹی بنائی گئی ہے اس کی جانب سے بنائی جانے والی رپورٹ پر غور کیا جائے گا اجلاس میں پاکستان سپر لیک کے انعقاد اور بورڈ کے مختلف امور کی انجام دہی کے لیے کمیٹیاں بنائی جائیں گی نو منتخب چیئرمین شہریار خان اجلاس میں اعتماد کا ووٹ بھی حاصل کرینگے | urdu |
വിദേശകാര്യ സഹമന്ത്രി വി. മുരളീധരെന്റ ബഹ്റൈന് സന്ദര്ശനത്തിന് തുടക്കം മനാമ: മൂന്നു ദിവസത്തെ ഒൗദ്യോഗിക സന്ദര്ശനത്തിന് ഇന്ത്യന് വിദേശകാര്യ സഹമന്ത്രി വി. മുരളീധരന് ബഹ്റൈനില് എത്തി. ബഹ്റൈന് വിദേശകാര്യ മന്ത്രാലയത്തിലെ കോണ്സുലാര്, അഡ്മിനിസ്ട്രേറ്റിവ് കാര്യങ്ങള്ക്കുള്ള അണ്ടര് സെക്രട്ടറി തൗഫീഖ് അഹ്മദ് അല് മന്സൂര് അദ്ദേഹത്തെ സ്വീകരിച്ചു. ഇരുരാജ്യങ്ങളും തമ്മിലെ സഹകരണം മെച്ചപ്പെടുത്തുന്നതിെന്റ ഭാഗമായാണ് സന്ദര്ശനം.വിദേശകാര്യ സഹമന്ത്രി എന്ന നിലയിലുള്ള വി. മുരളീധരെന്റ ആദ്യ ബഹ്റൈന് സന്ദര്ശനമാണിത്. ബഹ്റൈനിലെ മന്ത്രിമാര്, മുതിര്ന്ന ഉദ്യോഗസ്ഥര് എന്നിവരുമായി അദ്ദേഹം കൂടിക്കാഴ്ച നടത്തും. ഇതിനു പുറമേ, ആരോഗ്യം, വിദ്യാഭ്യാസം, ബിസിനസ്, സാമൂഹിക സേവനം തുടങ്ങിയ രംഗങ്ങളില് പ്രവര്ത്തിക്കുന്ന ഇന്ത്യക്കാരുമായും കൂടിക്കാഴ്ച നടത്തുന്നുണ്ട്. ബഹ്റൈനും ഇന്ത്യയും തമ്മില് ശക്തമായ രാഷ്ട്രീയ, സാമ്ബത്തിക, സാംസ്കാരിക ബന്ധമാണ് നിലനില്ക്കുന്നത്. ഏതാനും വര്ഷങ്ങള്ക്കിടെ ഇൗ സഹകരണം കൂടുതല് മെച്ചപ്പെടുകയും ചെയ്തു. കോവിഡ് കാലത്ത് ഇരു രാജ്യങ്ങളും സഹകരിച്ച് പ്രവര്ത്തിച്ചു. കഴിഞ്ഞ വര്ഷം നവംബറില് ഇന്ത്യന് വിദേശകാര്യ മന്ത്രി എസ്. ജയശങ്കര് ബഹ്റൈന് സന്ദര്ശിച്ചിരുന്നു. ഇൗ വര്ഷം ഏപ്രിലില് ബഹ്റൈന് വിദേശകാര്യ മന്ത്രി അബ്ദുല് ലത്തീഫ് ബിന് റാഷിദ് അല് സയാനിയുടെ ഇന്ത്യ സന്ദര്ശനവും വിജയകരമായിരുന്നു. ഇന്ത്യബഹ്റൈന് മൂന്നാമത് ഹൈ ജോയന്റ് കമീഷന് യോഗത്തില് പെങ്കടുക്കാനാണ് അദ്ദേഹം ഇന്ത്യയില് എത്തിയത്. | malyali |
//
// Copyright 2019 ZetaSQL Authors
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS,
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
// See the License for the specific language governing permissions and
// limitations under the License.
//
#include "zetasql/common/status_payload_utils.h"
#include "google/protobuf/descriptor_database.h"
#include "google/protobuf/message.h"
#include "absl/memory/memory.h"
#include "absl/strings/cord.h"
#include "absl/strings/str_cat.h"
#include "absl/strings/strip.h"
#include "zetasql/base/status.h"
#include "zetasql/base/status_payload.h"
namespace zetasql {
namespace internal {
// Whether the given status has any payload at all. The payloads themselves
// may be empty.
bool HasPayload(const absl::Status& status) {
return GetPayloadCount(status) > 0;
}
// Get the number of items within the payload.
int GetPayloadCount(const absl::Status& status) {
// Status interface forces scan for counting.
int count = 0;
status.ForEachPayload(
[&count](absl::string_view, const absl::Cord&) { ++count; });
return count;
}
std::string PayloadToString(absl::string_view type_url,
const absl::Cord& payload) {
absl::string_view descriptor_full_name = type_url;
if (absl::ConsumePrefix(&descriptor_full_name,
zetasql_base::kZetaSqlTypeUrlPrefix)) {
const google::protobuf::DescriptorPool* pool =
google::protobuf::DescriptorPool::generated_pool();
const google::protobuf::Descriptor* desc =
pool->FindMessageTypeByName(std::string(descriptor_full_name));
if (desc != nullptr) {
google::protobuf::MessageFactory* factory =
google::protobuf::MessageFactory::generated_factory();
auto msg = absl::WrapUnique(factory->GetPrototype(desc)->New());
if (msg->ParseFromString(std::string(payload))) {
return absl::StrCat("[", descriptor_full_name, "] { ",
msg->ShortDebugString(), " }");
}
}
}
return absl::StrCat("[", type_url, "] <unknown type>");
}
// StatusCodeToString does not guarantee any format, this guarantees
// lower-case camel case (except OK, which is just "OK"). Invalid codes
// will be printed as an integer.
std::string LegacyStatusCodeToString(absl::StatusCode code) {
// TODO: Fix string rendering once there is a
// free function we can clone.
switch (code) {
case absl::StatusCode::kOk:
return "OK";
case absl::StatusCode::kCancelled:
return "generic::cancelled";
case absl::StatusCode::kUnknown:
return "generic::unknown";
case absl::StatusCode::kInvalidArgument:
return "generic::invalid_argument";
case absl::StatusCode::kDeadlineExceeded:
return "generic::deadline_exceeded";
case absl::StatusCode::kNotFound:
return "generic::not_found";
case absl::StatusCode::kAlreadyExists:
return "generic::already_exists";
case absl::StatusCode::kPermissionDenied:
return "generic::permission_denied";
case absl::StatusCode::kUnauthenticated:
return "generic::unauthenticated";
case absl::StatusCode::kResourceExhausted:
return "generic::resource_exhausted";
case absl::StatusCode::kFailedPrecondition:
return "generic::failed_precondition";
case absl::StatusCode::kAborted:
return "generic::aborted";
case absl::StatusCode::kOutOfRange:
return "generic::out_of_range";
case absl::StatusCode::kUnimplemented:
return "generic::unimplemented";
case absl::StatusCode::kInternal:
return "generic::internal";
case absl::StatusCode::kUnavailable:
return "generic::unavailable";
case absl::StatusCode::kDataLoss:
return "generic::data_loss";
default:
return absl::StrCat(code);
}
}
std::string PayloadToString(const absl::Status& status) {
std::string ret;
// Make our own version of absl::Join
bool prepend_space = false;
status.ForEachPayload([&ret, &prepend_space](absl::string_view type_url,
const absl::Cord& payload) {
absl::StrAppend(&ret, prepend_space ? " " : "",
PayloadToString(type_url, payload));
prepend_space = true;
});
return ret;
}
// Creates a human readable string from the status, including its payload.
// Exact form is not defined.
std::string StatusToString(const absl::Status& status) {
if (status.ok()) {
return "OK";
}
std::string ret = absl::StrCat(LegacyStatusCodeToString(status.code()), ": ",
status.message());
if (HasPayload(status)) {
absl::StrAppend(&ret, " ", PayloadToString(status));
}
return ret;
}
} // namespace internal
} // namespace zetasql
| code |
لاہوراردو پوائنٹ اخبارتازہ ترین این این ئی 14 دسمبر2016ءرواں مالی سال کے پانچ ماہ میں تجارتی خسارے میں20 فیصد اضافہ ریکارڈ کیا گیا اعدادوشمار کے مطابق برمدات میں کمی اور درمدات میں اضافے کے باعث مالی سال 201617ء کے پہلے ماہ میں تجارتی خسارہ 20 فیصد اضافے سے 11 ارب 77 کروڑ ڈالر تک پہنچ گیا جو گزشہ سال کے اسی عرصے کے مقابلے میں تقریبا ارب ڈالر زائد ہے جولائی سے نومبر کے دوران ملکی برمدات فیصد کمی سے ارب 18 کروڑ ڈالر رہی اسی طرح ماہ کے دوران ملکی درمدات فیصد اضافے سے 19 ارب 96 کروڑ ڈالر رہی ماہرین کے مطابق حکومت کو برمدات میں اضافے کے لئے ایکسپورٹرز کے مسائل کو فوری طور پر حل کرنے اور صنعتوں کی پیداواری لاگت کم کرنے کے لئے ضروری اقدامات اٹھانے کی ضرورت ہے تاکہ پاکستانی مصنوعات دیگر ممالک سے مسابقت کر سکے | urdu |
Today, the senior Russian national team will take on Finland in the opening match of the 2018 Karjala Cup in Helsinki.
Whites: Nesterov, Blazhievskiy - Kaprizov, Loktionov, Grigorenko.
Blues: Khafizullin, Vasilevskiy - Kuzmenko, Byvaltsev, Barabanov.
Reds: Barantsev, Elesin - Golyshev, Zernov, Mikheev.
Blacks: Pedan, Zub - Telegin, Kadeikin, Ketov.
Oranges: Antipin - Slepyshev, Shalunov, Dergachyov.
Puck drop is scheduled for 19:30 Moscow time at the Hartwall Arena in the Finnish capital. | english |
ஆந்திரா டு சென்னை... கோட் வேர்டு மூலம் கடத்தல் போதை வழக்குகளின் அதிர்ச்சிப் பின்னணி! சென்னை பல்லாவரத்தை அடுத்த அனகாபுத்தூர் பகுதியில் போதை மாத்திரைகள் விற்பனை நடப்பதாக சங்கர் நகர் காவல் நிலையத்துக்குத் தகவல் கிடைத்தது. அதன்பேரில் இன்ஸ்பெக்டர் ராஜ்குமார் தலைமையிலான போலீஸார் விசாரணை நடத்தினர். விசாரணையில் போதை மாத்திரைகளை அனகாபுத்தூர், காமராஜபுரம் சுடுகாட்டுப் பகுதியில் சிலர் விற்பதாக ரகசியத் தகவல் கிடைத்தது. அதன்பேரில் போலீஸார் அங்கு சென்று கண்காணித்தனர். அப்போது அனகாபுத்தூர் பாத்திமா நகர், வெள்ளைச்சாமி தெருவில் வசித்துவரும் அஜீத்குமார் என்கிற அஜித் 24, அவரின் கூட்டாளிகள் வினித் 20, பல்லாவரத்தைச் சேர்ந்த அரவிந்த் குமார் 22, தாம்பரத்தைச் சேர்ந்த கௌதம் 19 ஆகியோர் போதை மாத்திரைகளை விற்றது தெரியவந்தது. கௌதம் இதையடுத்து சங்கர்நகர் போலீஸார் நான்கு பேரையும் கைதுசெய்து விசாரித்தனர். விசாரணையில் பல திடுக்கிடும் தகவல்கள் வெளியாகின. இது குறித்து போலீஸார் கூறுகையில், கைதுசெய்யப்பட்ட அஜீத்குமார் மீது கஞ்சா வழக்கு நிலுவையிலிருக்கிறது. கஞ்சா விற்றுவந்த இவன், சில மாதங்களாக வலி, மனஅழுத்தம் ஆகியவற்றுக்குப் பயன்படுத்தப்படும் மாத்திரைகளை போதை மாத்திரை எனக் கூறி அந்தப் பகுதியில் விற்று வந்திருக்கிறான். சில வாரங்களுக்கு முன்பு, சென்னை போலீஸ் கமிஷனர் அலுவலகத்தில் நடந்த கூட்டத்தில், மருந்துக்கடைகளில் மருத்துவரின் பரிந்துரையில்லாமல் போதைதரக்கூடிய மருந்து, மாத்திரைகளை விற்கக் கூடாது என மருந்துக்கடை உரிமையாளர்களுக்கு ஆலோசனை வழங்கப்பட்டது. அதையும் மீறி விற்றால் சம்பந்தப்பட்டவர்கள்மீது நடவடிக்கை எடுக்கப்படும் எனக் கூடுதல் கமிஷனர் கண்ணன் எச்சரித்திருந்தார். அதன் பிறகு சென்னையில் மருந்துக்கடைகளில் மருத்துவரின் பரிந்துரையில்லாமல் போதைக்காகப் பயன்படுத்தப்படும் மருந்து, மாத்திரைகள் அஜீத் குமாருக்கு கிடைக்கவில்லை. அதனால் அஜீத் குமாரும் அவனின் கூட்டாளியான கௌதமும் சேர்ந்து ஆந்திராவிலிருந்து போதைத்தரக்கூடிய மாத்திரைகளை வாங்கிவர முடிவு செய்தனர். இதற்காக வினித், அரவிந்த்குமார் ஆகியோரிடம் பணம் கொடுத்து போதை தரக்கூடிய மருந்து, மாத்திரைகளை ஆந்திராவிலிருந்து வாங்கி வந்து சென்னையில் கூடுதல் விலைக்கு விற்றுவந்திருக்கின்றனர். போதை மாத்திரைகளை வாங்க சென்னையிலிருந்து ஆந்திராவுக்கு வினித்தும் அரவிந்த்குமாரும் பைக்கில் சென்று வந்திருக்கின்றனர். வினித்ஆந்திராவில் பத்து மாத்திரைகளைக்கொண்ட ஓர் அட்டையை 320 ரூபாய்க்கு வாங்கி வந்து, இங்கு ஒரு மாத்திரையை 500 ரூபாய்க்கு இந்தக் கும்பல் விற்றுவந்திருக்கிறது. அதன் மூலம் அவர்களுக்கு நல்ல வருமானம் கிடைத்திருக்கிறது. இந்த மாத்திரைகளைத் தண்ணீரில் கலந்து ஊசி மூலம் உடம்பில் ஏற்றிக்கொள்பவர்கள் போதையிலிருப்பதாக உணர்ந்திருக்கின்றனர். இதையடுத்து இந்தக் கும்பலிடமிருந்து 100 போதை மாத்திரைகள், ஊசி ஆகியவற்றைப் பறிமுதல் செய்திருக்கிறோம். தொடர்ந்து சென்னையில் போதை மாத்திரைகள் எனக் கூறி வலி, மன அழுத்தத்துக்குப் பயன்படுத்தப்படும் மாத்திரைகளை விற்பவர்களைக் கண்காணித்துவருகிறோம் என்றனர். இது குறித்து தமிழ்நாடு அனைத்துப் பதிவுபெற்ற மருந்தாளுனர்கள் சங்கத்தின் மாநிலச் செயலாளர் எஸ்.வசந்த்குமாரிடம் பேசினோம். மதுபானங்கள், போதை மாத்திரைகள், போதைப்பொருள்கள் ஆகியவற்றைவிட போதை தரக்கூடியதாக கருதும் மருந்து, மாத்திரைகளின் விலை குறைவு. அதனால் ஏராளமான இளைஞர்கள் இந்த போதைக்கு அடிமையாகிவருகின்றனர். அது போதையே இல்லை. சுயநினைவற்ற நிலையில் இருப்பதைத்தான் போதை என்று நினைத்துக்கொள்கிறார்கள். பொதுவாக வலிப்புநோய், மன அழுத்தம், வலி நிவாரணத்துக்கு மருத்துவர்கள் பரிந்துரைக்கும் மருந்து, மாத்திரைகளை அதிக அளவில் பயன்படுத்தும்போது ஒருவகையான மயக்கம் ஏற்படும். அதை போதை என கருதிக்கொண்டு மருத்துவர்கள் பரிந்துரைக்கும் அளவைவிடக் கூடுதலாக உபயோகிக்கும்போது நரம்பு மண்டலம் முழுவதும் பாதிக்கப்படுகிறது. வசந்த்குமார் ஒருவர், தொடர்ந்து ஐந்து ஆண்டுகள் இது போன்ற மருந்து, மாத்திரைகளை அளவுக்கு அதிகமாக எடுத்துக்கொள்ளும்போது அவரின் ஆயுள் காலத்தில் 10 ஆண்டுகள் குறையும். ஆன்லைனில் எந்தவிதக் கட்டுபாடும் இல்லாமல் மருந்து, மாத்திரைகள் எளிதாகக் கிடைத்துவருகின்றன. தொடர்ந்து ஒரு வாரம் இது போன்ற மாத்திரை, மருந்துகளைப் பயன்படுத்தினால் அதற்கு அவர்கள் அடிமையாகிவிடுகின்றனர். அதனால், இந்த மாத்திரை, மருந்துகளை மெடிக்கல் கடைகளில் விற்கக் கூடாது. அதோடு மெடிக்கல் கடைகளில் மருந்தாளுனர்கள் அனுமதியில்லாமல் மருந்துகள் விற்பதை அனுமதிக்கக் கூடாது. அதிக அளவில் இந்த மருந்துகளைப் பயன்படுத்தும்போது கிட்னி, நரம்புத் தளர்ச்சி போன்ற பாதிப்புகள் ஏற்பட வாய்ப்பிருக்கின்றன என்றார்.போதைக்காகப் பயன்படுத்தப்படும் வலி நிவாரண மாத்திரைகள், மன அழுத்த மாத்திரைகளுக்கு சில ரகசியப் பெயர்களை அதை விற்கும் கும்பல் பயன்படுத்திவருகிறது. அதில் இஸட் ப்ளஸ் , ஒன் டு ஒன், உற்சாகம், ரெஃப்ரெஷ் உள்ளிட்டவை அதிக அளவில் புழக்கத்திலிருக்கும் வார்த்தைகள். போதை மாத்திரை என்று கேட்காமல் இந்த ரகசிய வார்த்தைகளைத்தான் இந்தக் கும்பலும், அதை வாங்குபவர்களும் பயன்படுத்திவருவதாக போலீஸ் விசாரணையில் தெரியவந்திருக்கிறது. சென்னை போலீஸ் கமிஷனர் சங்கர் ஜிவாலின் உத்தரவின்பேரில் கடந்த 10.12.2021ம் தேதி முதல் 11.12.2021ம் தேதி வரை சென்னையில் போதைப்பொருள்களுக்கு எதிரான சிறப்புச் சோதனைகள் மேற்கொள்ளப்பட்டன. அதில் 47 வழக்குகள் பதிவு செய்யப்பட்டு 65 பேர் கைதுசெய்யப்பட்டனர். கஞ்சா தொடர்பாக ஏழு வழக்குகள் பதிவுசெய்யப்பட்டு, 14 பேர் கைதுசெய்யப்பட்டனர். அவர்களிடமிருந்து 14.6 கிலோ கஞ்சா பறிமுதல் செய்யப்பட்டிருக்கிது.கமிஷனர் சங்கர் ஜிவால்வலி நிவாரண மாத்திரைகள், எல்.எஸ்.டி ஸ்டாம்ப் ஆகியவற்றை போதைக்காகப் பயன்படுத்தியது விற்பனை செய்தது தொடர்பாக மூன்று வழக்குகள் பதிவு செய்யப்பட்டு 12 பேர் கைதுசெய்யப்பட்டிருக்கின்றனர். அவர்களிடமிருந்து 120 வலி நிவாரண மாத்திரைகள், 169 எல்.எஸ்.டி ஸ்டாம்ப், நான்கு செல்போன்கள், ஒரு பைக், ஒரு கார், 17,000 ரூபாய் ரொக்கம் ஆகியவை பறிமுதல் செய்யப்பட்டிருக்கின்றன. தமிழக அரசால் தடைசெய்யப்பட்ட குட்கா, மாவா புகையிலைப் பொருள்களை தயாரித்தல், விற்பனை செய்தல் தொடர்பாக 37 வழக்குகள் பதிவுசெய்யப்பட்டிருக்கின்றன. 39 பேர் கைதுசெய்யப்பட்டிருக்கின்றனர். அவர்களிடமிருந்து 85.4 கிலோ குட்கா பாக்கெட்டுகள், 151 கிலோ மாவா ஆகியவை பறிமுதல் செய்யப்பட்டிருக்கின்றன. கஞ்சா, குட்கா, மாவா, வலி நிவாரண மாத்திரைகளைச் சட்ட விரோதமாக விற்பவர்கள் மீது கடும் நடவடிக்கை எடுக்கப்படும் என கமிஷனர் சங்கர் ஜிவால் எச்சரிக்கை விடுத்திருக்கிறார். சென்னை: திருட்டு செல்போன்களுக்குப் போதை மாத்திரைகள்! பகீர் பின்னணி | tamil |
<?php
/**
* WP_Theme Class
*
* @package WordPress
* @subpackage Theme
* @since 3.4.0
*/
final class WP_Theme implements ArrayAccess {
/**
* Whether the theme has been marked as updateable.
*
* @since 4.4.0
* @var bool
*
* @see WP_MS_Themes_List_Table
*/
public $update = false;
/**
* Headers for style.css files.
*
* @since 3.4.0
* @since 5.4.0 Added `Requires at least` and `Requires PHP` headers.
* @var array
*/
private static $file_headers = array(
'Name' => 'Theme Name',
'ThemeURI' => 'Theme URI',
'Description' => 'Description',
'Author' => 'Author',
'AuthorURI' => 'Author URI',
'Version' => 'Version',
'Template' => 'Template',
'Status' => 'Status',
'Tags' => 'Tags',
'TextDomain' => 'Text Domain',
'DomainPath' => 'Domain Path',
'RequiresWP' => 'Requires at least',
'RequiresPHP' => 'Requires PHP',
);
/**
* Default themes.
*
* @var array
*/
private static $default_themes = array(
'classic' => 'WordPress Classic',
'default' => 'WordPress Default',
'twentyten' => 'Twenty Ten',
'twentyeleven' => 'Twenty Eleven',
'twentytwelve' => 'Twenty Twelve',
'twentythirteen' => 'Twenty Thirteen',
'twentyfourteen' => 'Twenty Fourteen',
'twentyfifteen' => 'Twenty Fifteen',
'twentysixteen' => 'Twenty Sixteen',
'twentyseventeen' => 'Twenty Seventeen',
'twentynineteen' => 'Twenty Nineteen',
'twentytwenty' => 'Twenty Twenty',
);
/**
* Renamed theme tags.
*
* @var array
*/
private static $tag_map = array(
'fixed-width' => 'fixed-layout',
'flexible-width' => 'fluid-layout',
);
/**
* Absolute path to the theme root, usually wp-content/themes
*
* @var string
*/
private $theme_root;
/**
* Header data from the theme's style.css file.
*
* @var array
*/
private $headers = array();
/**
* Header data from the theme's style.css file after being sanitized.
*
* @var array
*/
private $headers_sanitized;
/**
* Header name from the theme's style.css after being translated.
*
* Cached due to sorting functions running over the translated name.
*
* @var string
*/
private $name_translated;
/**
* Errors encountered when initializing the theme.
*
* @var WP_Error
*/
private $errors;
/**
* The directory name of the theme's files, inside the theme root.
*
* In the case of a child theme, this is directory name of the child theme.
* Otherwise, 'stylesheet' is the same as 'template'.
*
* @var string
*/
private $stylesheet;
/**
* The directory name of the theme's files, inside the theme root.
*
* In the case of a child theme, this is the directory name of the parent theme.
* Otherwise, 'template' is the same as 'stylesheet'.
*
* @var string
*/
private $template;
/**
* A reference to the parent theme, in the case of a child theme.
*
* @var WP_Theme
*/
private $parent;
/**
* URL to the theme root, usually an absolute URL to wp-content/themes
*
* @var string
*/
private $theme_root_uri;
/**
* Flag for whether the theme's textdomain is loaded.
*
* @var bool
*/
private $textdomain_loaded;
/**
* Stores an md5 hash of the theme root, to function as the cache key.
*
* @var string
*/
private $cache_hash;
/**
* Flag for whether the themes cache bucket should be persistently cached.
*
* Default is false. Can be set with the {@see 'wp_cache_themes_persistently'} filter.
*
* @var bool
*/
private static $persistently_cache;
/**
* Expiration time for the themes cache bucket.
*
* By default the bucket is not cached, so this value is useless.
*
* @var bool
*/
private static $cache_expiration = 1800;
/**
* Constructor for WP_Theme.
*
* @since 3.4.0
*
* @global array $wp_theme_directories
*
* @param string $theme_dir Directory of the theme within the theme_root.
* @param string $theme_root Theme root.
* @param WP_Theme|null $_child If this theme is a parent theme, the child may be passed for validation purposes.
*/
public function __construct( $theme_dir, $theme_root, $_child = null ) {
global $wp_theme_directories;
// Initialize caching on first run.
if ( ! isset( self::$persistently_cache ) ) {
/** This action is documented in wp-includes/theme.php */
self::$persistently_cache = apply_filters( 'wp_cache_themes_persistently', false, 'WP_Theme' );
if ( self::$persistently_cache ) {
wp_cache_add_global_groups( 'themes' );
if ( is_int( self::$persistently_cache ) ) {
self::$cache_expiration = self::$persistently_cache;
}
} else {
wp_cache_add_non_persistent_groups( 'themes' );
}
}
$this->theme_root = $theme_root;
$this->stylesheet = $theme_dir;
// Correct a situation where the theme is 'some-directory/some-theme' but 'some-directory' was passed in as part of the theme root instead.
if ( ! in_array( $theme_root, (array) $wp_theme_directories, true )
&& in_array( dirname( $theme_root ), (array) $wp_theme_directories, true )
) {
$this->stylesheet = basename( $this->theme_root ) . '/' . $this->stylesheet;
$this->theme_root = dirname( $theme_root );
}
$this->cache_hash = md5( $this->theme_root . '/' . $this->stylesheet );
$theme_file = $this->stylesheet . '/style.css';
$cache = $this->cache_get( 'theme' );
if ( is_array( $cache ) ) {
foreach ( array( 'errors', 'headers', 'template' ) as $key ) {
if ( isset( $cache[ $key ] ) ) {
$this->$key = $cache[ $key ];
}
}
if ( $this->errors ) {
return;
}
if ( isset( $cache['theme_root_template'] ) ) {
$theme_root_template = $cache['theme_root_template'];
}
} elseif ( ! file_exists( $this->theme_root . '/' . $theme_file ) ) {
$this->headers['Name'] = $this->stylesheet;
if ( ! file_exists( $this->theme_root . '/' . $this->stylesheet ) ) {
$this->errors = new WP_Error(
'theme_not_found',
sprintf(
/* translators: %s: Theme directory name. */
__( 'The theme directory "%s" does not exist.' ),
esc_html( $this->stylesheet )
)
);
} else {
$this->errors = new WP_Error( 'theme_no_stylesheet', __( 'Stylesheet is missing.' ) );
}
$this->template = $this->stylesheet;
$this->cache_add(
'theme',
array(
'headers' => $this->headers,
'errors' => $this->errors,
'stylesheet' => $this->stylesheet,
'template' => $this->template,
)
);
if ( ! file_exists( $this->theme_root ) ) { // Don't cache this one.
$this->errors->add( 'theme_root_missing', __( 'Error: The themes directory is either empty or doesn’t exist. Please check your installation.' ) );
}
return;
} elseif ( ! is_readable( $this->theme_root . '/' . $theme_file ) ) {
$this->headers['Name'] = $this->stylesheet;
$this->errors = new WP_Error( 'theme_stylesheet_not_readable', __( 'Stylesheet is not readable.' ) );
$this->template = $this->stylesheet;
$this->cache_add(
'theme',
array(
'headers' => $this->headers,
'errors' => $this->errors,
'stylesheet' => $this->stylesheet,
'template' => $this->template,
)
);
return;
} else {
$this->headers = get_file_data( $this->theme_root . '/' . $theme_file, self::$file_headers, 'theme' );
// Default themes always trump their pretenders.
// Properly identify default themes that are inside a directory within wp-content/themes.
$default_theme_slug = array_search( $this->headers['Name'], self::$default_themes, true );
if ( $default_theme_slug ) {
if ( basename( $this->stylesheet ) != $default_theme_slug ) {
$this->headers['Name'] .= '/' . $this->stylesheet;
}
}
}
if ( ! $this->template && $this->stylesheet === $this->headers['Template'] ) {
$this->errors = new WP_Error(
'theme_child_invalid',
sprintf(
/* translators: %s: Template. */
__( 'The theme defines itself as its parent theme. Please check the %s header.' ),
'<code>Template</code>'
)
);
$this->cache_add(
'theme',
array(
'headers' => $this->headers,
'errors' => $this->errors,
'stylesheet' => $this->stylesheet,
)
);
return;
}
// (If template is set from cache [and there are no errors], we know it's good.)
if ( ! $this->template ) {
$this->template = $this->headers['Template'];
}
if ( ! $this->template ) {
$this->template = $this->stylesheet;
if ( ! file_exists( $this->theme_root . '/' . $this->stylesheet . '/index.php' ) ) {
$error_message = sprintf(
/* translators: 1: index.php, 2: Documentation URL, 3: style.css */
__( 'Template is missing. Standalone themes need to have a %1$s template file. <a href="%2$s">Child themes</a> need to have a Template header in the %3$s stylesheet.' ),
'<code>index.php</code>',
__( 'https://developer.wordpress.org/themes/advanced-topics/child-themes/' ),
'<code>style.css</code>'
);
$this->errors = new WP_Error( 'theme_no_index', $error_message );
$this->cache_add(
'theme',
array(
'headers' => $this->headers,
'errors' => $this->errors,
'stylesheet' => $this->stylesheet,
'template' => $this->template,
)
);
return;
}
}
// If we got our data from cache, we can assume that 'template' is pointing to the right place.
if ( ! is_array( $cache ) && $this->template != $this->stylesheet && ! file_exists( $this->theme_root . '/' . $this->template . '/index.php' ) ) {
// If we're in a directory of themes inside /themes, look for the parent nearby.
// wp-content/themes/directory-of-themes/*
$parent_dir = dirname( $this->stylesheet );
$directories = search_theme_directories();
if ( '.' !== $parent_dir && file_exists( $this->theme_root . '/' . $parent_dir . '/' . $this->template . '/index.php' ) ) {
$this->template = $parent_dir . '/' . $this->template;
} elseif ( $directories && isset( $directories[ $this->template ] ) ) {
// Look for the template in the search_theme_directories() results, in case it is in another theme root.
// We don't look into directories of themes, just the theme root.
$theme_root_template = $directories[ $this->template ]['theme_root'];
} else {
// Parent theme is missing.
$this->errors = new WP_Error(
'theme_no_parent',
sprintf(
/* translators: %s: Theme directory name. */
__( 'The parent theme is missing. Please install the "%s" parent theme.' ),
esc_html( $this->template )
)
);
$this->cache_add(
'theme',
array(
'headers' => $this->headers,
'errors' => $this->errors,
'stylesheet' => $this->stylesheet,
'template' => $this->template,
)
);
$this->parent = new WP_Theme( $this->template, $this->theme_root, $this );
return;
}
}
// Set the parent, if we're a child theme.
if ( $this->template != $this->stylesheet ) {
// If we are a parent, then there is a problem. Only two generations allowed! Cancel things out.
if ( $_child instanceof WP_Theme && $_child->template == $this->stylesheet ) {
$_child->parent = null;
$_child->errors = new WP_Error(
'theme_parent_invalid',
sprintf(
/* translators: %s: Theme directory name. */
__( 'The "%s" theme is not a valid parent theme.' ),
esc_html( $_child->template )
)
);
$_child->cache_add(
'theme',
array(
'headers' => $_child->headers,
'errors' => $_child->errors,
'stylesheet' => $_child->stylesheet,
'template' => $_child->template,
)
);
// The two themes actually reference each other with the Template header.
if ( $_child->stylesheet == $this->template ) {
$this->errors = new WP_Error(
'theme_parent_invalid',
sprintf(
/* translators: %s: Theme directory name. */
__( 'The "%s" theme is not a valid parent theme.' ),
esc_html( $this->template )
)
);
$this->cache_add(
'theme',
array(
'headers' => $this->headers,
'errors' => $this->errors,
'stylesheet' => $this->stylesheet,
'template' => $this->template,
)
);
}
return;
}
// Set the parent. Pass the current instance so we can do the crazy checks above and assess errors.
$this->parent = new WP_Theme( $this->template, isset( $theme_root_template ) ? $theme_root_template : $this->theme_root, $this );
}
if ( wp_paused_themes()->get( $this->stylesheet ) && ( ! is_wp_error( $this->errors ) || ! isset( $this->errors->errors['theme_paused'] ) ) ) {
$this->errors = new WP_Error( 'theme_paused', __( 'This theme failed to load properly and was paused within the admin backend.' ) );
}
// We're good. If we didn't retrieve from cache, set it.
if ( ! is_array( $cache ) ) {
$cache = array(
'headers' => $this->headers,
'errors' => $this->errors,
'stylesheet' => $this->stylesheet,
'template' => $this->template,
);
// If the parent theme is in another root, we'll want to cache this. Avoids an entire branch of filesystem calls above.
if ( isset( $theme_root_template ) ) {
$cache['theme_root_template'] = $theme_root_template;
}
$this->cache_add( 'theme', $cache );
}
}
/**
* When converting the object to a string, the theme name is returned.
*
* @since 3.4.0
*
* @return string Theme name, ready for display (translated)
*/
public function __toString() {
return (string) $this->display( 'Name' );
}
/**
* __isset() magic method for properties formerly returned by current_theme_info()
*
* @since 3.4.0
*
* @param string $offset Property to check if set.
* @return bool Whether the given property is set.
*/
public function __isset( $offset ) {
static $properties = array(
'name',
'title',
'version',
'parent_theme',
'template_dir',
'stylesheet_dir',
'template',
'stylesheet',
'screenshot',
'description',
'author',
'tags',
'theme_root',
'theme_root_uri',
);
return in_array( $offset, $properties, true );
}
/**
* __get() magic method for properties formerly returned by current_theme_info()
*
* @since 3.4.0
*
* @param string $offset Property to get.
* @return mixed Property value.
*/
public function __get( $offset ) {
switch ( $offset ) {
case 'name':
case 'title':
return $this->get( 'Name' );
case 'version':
return $this->get( 'Version' );
case 'parent_theme':
return $this->parent() ? $this->parent()->get( 'Name' ) : '';
case 'template_dir':
return $this->get_template_directory();
case 'stylesheet_dir':
return $this->get_stylesheet_directory();
case 'template':
return $this->get_template();
case 'stylesheet':
return $this->get_stylesheet();
case 'screenshot':
return $this->get_screenshot( 'relative' );
// 'author' and 'description' did not previously return translated data.
case 'description':
return $this->display( 'Description' );
case 'author':
return $this->display( 'Author' );
case 'tags':
return $this->get( 'Tags' );
case 'theme_root':
return $this->get_theme_root();
case 'theme_root_uri':
return $this->get_theme_root_uri();
// For cases where the array was converted to an object.
default:
return $this->offsetGet( $offset );
}
}
/**
* Method to implement ArrayAccess for keys formerly returned by get_themes()
*
* @since 3.4.0
*
* @param mixed $offset
* @param mixed $value
*/
public function offsetSet( $offset, $value ) {}
/**
* Method to implement ArrayAccess for keys formerly returned by get_themes()
*
* @since 3.4.0
*
* @param mixed $offset
*/
public function offsetUnset( $offset ) {}
/**
* Method to implement ArrayAccess for keys formerly returned by get_themes()
*
* @since 3.4.0
*
* @param mixed $offset
* @return bool
*/
public function offsetExists( $offset ) {
static $keys = array(
'Name',
'Version',
'Status',
'Title',
'Author',
'Author Name',
'Author URI',
'Description',
'Template',
'Stylesheet',
'Template Files',
'Stylesheet Files',
'Template Dir',
'Stylesheet Dir',
'Screenshot',
'Tags',
'Theme Root',
'Theme Root URI',
'Parent Theme',
);
return in_array( $offset, $keys, true );
}
/**
* Method to implement ArrayAccess for keys formerly returned by get_themes().
*
* Author, Author Name, Author URI, and Description did not previously return
* translated data. We are doing so now as it is safe to do. However, as
* Name and Title could have been used as the key for get_themes(), both remain
* untranslated for back compatibility. This means that ['Name'] is not ideal,
* and care should be taken to use `$theme::display( 'Name' )` to get a properly
* translated header.
*
* @since 3.4.0
*
* @param mixed $offset
* @return mixed
*/
public function offsetGet( $offset ) {
switch ( $offset ) {
case 'Name':
case 'Title':
/*
* See note above about using translated data. get() is not ideal.
* It is only for backward compatibility. Use display().
*/
return $this->get( 'Name' );
case 'Author':
return $this->display( 'Author' );
case 'Author Name':
return $this->display( 'Author', false );
case 'Author URI':
return $this->display( 'AuthorURI' );
case 'Description':
return $this->display( 'Description' );
case 'Version':
case 'Status':
return $this->get( $offset );
case 'Template':
return $this->get_template();
case 'Stylesheet':
return $this->get_stylesheet();
case 'Template Files':
return $this->get_files( 'php', 1, true );
case 'Stylesheet Files':
return $this->get_files( 'css', 0, false );
case 'Template Dir':
return $this->get_template_directory();
case 'Stylesheet Dir':
return $this->get_stylesheet_directory();
case 'Screenshot':
return $this->get_screenshot( 'relative' );
case 'Tags':
return $this->get( 'Tags' );
case 'Theme Root':
return $this->get_theme_root();
case 'Theme Root URI':
return $this->get_theme_root_uri();
case 'Parent Theme':
return $this->parent() ? $this->parent()->get( 'Name' ) : '';
default:
return null;
}
}
/**
* Returns errors property.
*
* @since 3.4.0
*
* @return WP_Error|false WP_Error if there are errors, or false.
*/
public function errors() {
return is_wp_error( $this->errors ) ? $this->errors : false;
}
/**
* Whether the theme exists.
*
* A theme with errors exists. A theme with the error of 'theme_not_found',
* meaning that the theme's directory was not found, does not exist.
*
* @since 3.4.0
*
* @return bool Whether the theme exists.
*/
public function exists() {
return ! ( $this->errors() && in_array( 'theme_not_found', $this->errors()->get_error_codes(), true ) );
}
/**
* Returns reference to the parent theme.
*
* @since 3.4.0
*
* @return WP_Theme|false Parent theme, or false if the current theme is not a child theme.
*/
public function parent() {
return isset( $this->parent ) ? $this->parent : false;
}
/**
* Adds theme data to cache.
*
* Cache entries keyed by the theme and the type of data.
*
* @since 3.4.0
*
* @param string $key Type of data to store (theme, screenshot, headers, post_templates)
* @param array|string $data Data to store
* @return bool Return value from wp_cache_add()
*/
private function cache_add( $key, $data ) {
return wp_cache_add( $key . '-' . $this->cache_hash, $data, 'themes', self::$cache_expiration );
}
/**
* Gets theme data from cache.
*
* Cache entries are keyed by the theme and the type of data.
*
* @since 3.4.0
*
* @param string $key Type of data to retrieve (theme, screenshot, headers, post_templates)
* @return mixed Retrieved data
*/
private function cache_get( $key ) {
return wp_cache_get( $key . '-' . $this->cache_hash, 'themes' );
}
/**
* Clears the cache for the theme.
*
* @since 3.4.0
*/
public function cache_delete() {
foreach ( array( 'theme', 'screenshot', 'headers', 'post_templates' ) as $key ) {
wp_cache_delete( $key . '-' . $this->cache_hash, 'themes' );
}
$this->template = null;
$this->textdomain_loaded = null;
$this->theme_root_uri = null;
$this->parent = null;
$this->errors = null;
$this->headers_sanitized = null;
$this->name_translated = null;
$this->headers = array();
$this->__construct( $this->stylesheet, $this->theme_root );
}
/**
* Get a raw, unformatted theme header.
*
* The header is sanitized, but is not translated, and is not marked up for display.
* To get a theme header for display, use the display() method.
*
* Use the get_template() method, not the 'Template' header, for finding the template.
* The 'Template' header is only good for what was written in the style.css, while
* get_template() takes into account where WordPress actually located the theme and
* whether it is actually valid.
*
* @since 3.4.0
*
* @param string $header Theme header. Name, Description, Author, Version, ThemeURI, AuthorURI, Status, Tags.
* @return string|array|false String or array (for Tags header) on success, false on failure.
*/
public function get( $header ) {
if ( ! isset( $this->headers[ $header ] ) ) {
return false;
}
if ( ! isset( $this->headers_sanitized ) ) {
$this->headers_sanitized = $this->cache_get( 'headers' );
if ( ! is_array( $this->headers_sanitized ) ) {
$this->headers_sanitized = array();
}
}
if ( isset( $this->headers_sanitized[ $header ] ) ) {
return $this->headers_sanitized[ $header ];
}
// If themes are a persistent group, sanitize everything and cache it. One cache add is better than many cache sets.
if ( self::$persistently_cache ) {
foreach ( array_keys( $this->headers ) as $_header ) {
$this->headers_sanitized[ $_header ] = $this->sanitize_header( $_header, $this->headers[ $_header ] );
}
$this->cache_add( 'headers', $this->headers_sanitized );
} else {
$this->headers_sanitized[ $header ] = $this->sanitize_header( $header, $this->headers[ $header ] );
}
return $this->headers_sanitized[ $header ];
}
/**
* Gets a theme header, formatted and translated for display.
*
* @since 3.4.0
*
* @param string $header Theme header. Name, Description, Author, Version, ThemeURI, AuthorURI, Status, Tags.
* @param bool $markup Optional. Whether to mark up the header. Defaults to true.
* @param bool $translate Optional. Whether to translate the header. Defaults to true.
* @return string|array|false Processed header. An array for Tags if `$markup` is false, string otherwise.
* False on failure.
*/
public function display( $header, $markup = true, $translate = true ) {
$value = $this->get( $header );
if ( false === $value ) {
return false;
}
if ( $translate && ( empty( $value ) || ! $this->load_textdomain() ) ) {
$translate = false;
}
if ( $translate ) {
$value = $this->translate_header( $header, $value );
}
if ( $markup ) {
$value = $this->markup_header( $header, $value, $translate );
}
return $value;
}
/**
* Sanitize a theme header.
*
* @since 3.4.0
* @since 5.4.0 Added support for `Requires at least` and `Requires PHP` headers.
*
* @param string $header Theme header. Accepts 'Name', 'Description', 'Author', 'Version',
* 'ThemeURI', 'AuthorURI', 'Status', 'Tags', 'RequiresWP', 'RequiresPHP'.
* @param string $value Value to sanitize.
* @return string|array An array for Tags header, string otherwise.
*/
private function sanitize_header( $header, $value ) {
switch ( $header ) {
case 'Status':
if ( ! $value ) {
$value = 'publish';
break;
}
// Fall through otherwise.
case 'Name':
static $header_tags = array(
'abbr' => array( 'title' => true ),
'acronym' => array( 'title' => true ),
'code' => true,
'em' => true,
'strong' => true,
);
$value = wp_kses( $value, $header_tags );
break;
case 'Author':
// There shouldn't be anchor tags in Author, but some themes like to be challenging.
case 'Description':
static $header_tags_with_a = array(
'a' => array(
'href' => true,
'title' => true,
),
'abbr' => array( 'title' => true ),
'acronym' => array( 'title' => true ),
'code' => true,
'em' => true,
'strong' => true,
);
$value = wp_kses( $value, $header_tags_with_a );
break;
case 'ThemeURI':
case 'AuthorURI':
$value = esc_url_raw( $value );
break;
case 'Tags':
$value = array_filter( array_map( 'trim', explode( ',', strip_tags( $value ) ) ) );
break;
case 'Version':
case 'RequiresWP':
case 'RequiresPHP':
$value = strip_tags( $value );
break;
}
return $value;
}
/**
* Mark up a theme header.
*
* @since 3.4.0
*
* @param string $header Theme header. Name, Description, Author, Version, ThemeURI, AuthorURI, Status, Tags.
* @param string|array $value Value to mark up. An array for Tags header, string otherwise.
* @param string $translate Whether the header has been translated.
* @return string Value, marked up.
*/
private function markup_header( $header, $value, $translate ) {
switch ( $header ) {
case 'Name':
if ( empty( $value ) ) {
$value = esc_html( $this->get_stylesheet() );
}
break;
case 'Description':
$value = wptexturize( $value );
break;
case 'Author':
if ( $this->get( 'AuthorURI' ) ) {
$value = sprintf( '<a href="%1$s">%2$s</a>', $this->display( 'AuthorURI', true, $translate ), $value );
} elseif ( ! $value ) {
$value = __( 'Anonymous' );
}
break;
case 'Tags':
static $comma = null;
if ( ! isset( $comma ) ) {
/* translators: Used between list items, there is a space after the comma. */
$comma = __( ', ' );
}
$value = implode( $comma, $value );
break;
case 'ThemeURI':
case 'AuthorURI':
$value = esc_url( $value );
break;
}
return $value;
}
/**
* Translate a theme header.
*
* @since 3.4.0
*
* @param string $header Theme header. Name, Description, Author, Version, ThemeURI, AuthorURI, Status, Tags.
* @param string|array $value Value to translate. An array for Tags header, string otherwise.
* @return string|array Translated value. An array for Tags header, string otherwise.
*/
private function translate_header( $header, $value ) {
switch ( $header ) {
case 'Name':
// Cached for sorting reasons.
if ( isset( $this->name_translated ) ) {
return $this->name_translated;
}
// phpcs:ignore WordPress.WP.I18n.LowLevelTranslationFunction,WordPress.WP.I18n.NonSingularStringLiteralText,WordPress.WP.I18n.NonSingularStringLiteralDomain
$this->name_translated = translate( $value, $this->get( 'TextDomain' ) );
return $this->name_translated;
case 'Tags':
if ( empty( $value ) || ! function_exists( 'get_theme_feature_list' ) ) {
return $value;
}
static $tags_list;
if ( ! isset( $tags_list ) ) {
$tags_list = array(
// As of 4.6, deprecated tags which are only used to provide translation for older themes.
'black' => __( 'Black' ),
'blue' => __( 'Blue' ),
'brown' => __( 'Brown' ),
'gray' => __( 'Gray' ),
'green' => __( 'Green' ),
'orange' => __( 'Orange' ),
'pink' => __( 'Pink' ),
'purple' => __( 'Purple' ),
'red' => __( 'Red' ),
'silver' => __( 'Silver' ),
'tan' => __( 'Tan' ),
'white' => __( 'White' ),
'yellow' => __( 'Yellow' ),
'dark' => __( 'Dark' ),
'light' => __( 'Light' ),
'fixed-layout' => __( 'Fixed Layout' ),
'fluid-layout' => __( 'Fluid Layout' ),
'responsive-layout' => __( 'Responsive Layout' ),
'blavatar' => __( 'Blavatar' ),
'photoblogging' => __( 'Photoblogging' ),
'seasonal' => __( 'Seasonal' ),
);
$feature_list = get_theme_feature_list( false ); // No API.
foreach ( $feature_list as $tags ) {
$tags_list += $tags;
}
}
foreach ( $value as &$tag ) {
if ( isset( $tags_list[ $tag ] ) ) {
$tag = $tags_list[ $tag ];
} elseif ( isset( self::$tag_map[ $tag ] ) ) {
$tag = $tags_list[ self::$tag_map[ $tag ] ];
}
}
return $value;
default:
// phpcs:ignore WordPress.WP.I18n.LowLevelTranslationFunction,WordPress.WP.I18n.NonSingularStringLiteralText,WordPress.WP.I18n.NonSingularStringLiteralDomain
$value = translate( $value, $this->get( 'TextDomain' ) );
}
return $value;
}
/**
* The directory name of the theme's "stylesheet" files, inside the theme root.
*
* In the case of a child theme, this is directory name of the child theme.
* Otherwise, get_stylesheet() is the same as get_template().
*
* @since 3.4.0
*
* @return string Stylesheet
*/
public function get_stylesheet() {
return $this->stylesheet;
}
/**
* The directory name of the theme's "template" files, inside the theme root.
*
* In the case of a child theme, this is the directory name of the parent theme.
* Otherwise, the get_template() is the same as get_stylesheet().
*
* @since 3.4.0
*
* @return string Template
*/
public function get_template() {
return $this->template;
}
/**
* Returns the absolute path to the directory of a theme's "stylesheet" files.
*
* In the case of a child theme, this is the absolute path to the directory
* of the child theme's files.
*
* @since 3.4.0
*
* @return string Absolute path of the stylesheet directory.
*/
public function get_stylesheet_directory() {
if ( $this->errors() && in_array( 'theme_root_missing', $this->errors()->get_error_codes(), true ) ) {
return '';
}
return $this->theme_root . '/' . $this->stylesheet;
}
/**
* Returns the absolute path to the directory of a theme's "template" files.
*
* In the case of a child theme, this is the absolute path to the directory
* of the parent theme's files.
*
* @since 3.4.0
*
* @return string Absolute path of the template directory.
*/
public function get_template_directory() {
if ( $this->parent() ) {
$theme_root = $this->parent()->theme_root;
} else {
$theme_root = $this->theme_root;
}
return $theme_root . '/' . $this->template;
}
/**
* Returns the URL to the directory of a theme's "stylesheet" files.
*
* In the case of a child theme, this is the URL to the directory of the
* child theme's files.
*
* @since 3.4.0
*
* @return string URL to the stylesheet directory.
*/
public function get_stylesheet_directory_uri() {
return $this->get_theme_root_uri() . '/' . str_replace( '%2F', '/', rawurlencode( $this->stylesheet ) );
}
/**
* Returns the URL to the directory of a theme's "template" files.
*
* In the case of a child theme, this is the URL to the directory of the
* parent theme's files.
*
* @since 3.4.0
*
* @return string URL to the template directory.
*/
public function get_template_directory_uri() {
if ( $this->parent() ) {
$theme_root_uri = $this->parent()->get_theme_root_uri();
} else {
$theme_root_uri = $this->get_theme_root_uri();
}
return $theme_root_uri . '/' . str_replace( '%2F', '/', rawurlencode( $this->template ) );
}
/**
* The absolute path to the directory of the theme root.
*
* This is typically the absolute path to wp-content/themes.
*
* @since 3.4.0
*
* @return string Theme root.
*/
public function get_theme_root() {
return $this->theme_root;
}
/**
* Returns the URL to the directory of the theme root.
*
* This is typically the absolute URL to wp-content/themes. This forms the basis
* for all other URLs returned by WP_Theme, so we pass it to the public function
* get_theme_root_uri() and allow it to run the {@see 'theme_root_uri'} filter.
*
* @since 3.4.0
*
* @return string Theme root URI.
*/
public function get_theme_root_uri() {
if ( ! isset( $this->theme_root_uri ) ) {
$this->theme_root_uri = get_theme_root_uri( $this->stylesheet, $this->theme_root );
}
return $this->theme_root_uri;
}
/**
* Returns the main screenshot file for the theme.
*
* The main screenshot is called screenshot.png. gif and jpg extensions are also allowed.
*
* Screenshots for a theme must be in the stylesheet directory. (In the case of child
* themes, parent theme screenshots are not inherited.)
*
* @since 3.4.0
*
* @param string $uri Type of URL to return, either 'relative' or an absolute URI. Defaults to absolute URI.
* @return string|false Screenshot file. False if the theme does not have a screenshot.
*/
public function get_screenshot( $uri = 'uri' ) {
$screenshot = $this->cache_get( 'screenshot' );
if ( $screenshot ) {
if ( 'relative' === $uri ) {
return $screenshot;
}
return $this->get_stylesheet_directory_uri() . '/' . $screenshot;
} elseif ( 0 === $screenshot ) {
return false;
}
foreach ( array( 'png', 'gif', 'jpg', 'jpeg' ) as $ext ) {
if ( file_exists( $this->get_stylesheet_directory() . "/screenshot.$ext" ) ) {
$this->cache_add( 'screenshot', 'screenshot.' . $ext );
if ( 'relative' === $uri ) {
return 'screenshot.' . $ext;
}
return $this->get_stylesheet_directory_uri() . '/' . 'screenshot.' . $ext;
}
}
$this->cache_add( 'screenshot', 0 );
return false;
}
/**
* Return files in the theme's directory.
*
* @since 3.4.0
*
* @param string[]|string $type Optional. Array of extensions to find, string of a single extension,
* or null for all extensions. Default null.
* @param int $depth Optional. How deep to search for files. Defaults to a flat scan (0 depth).
* -1 depth is infinite.
* @param bool $search_parent Optional. Whether to return parent files. Default false.
* @return string[] Array of files, keyed by the path to the file relative to the theme's directory, with the values
* being absolute paths.
*/
public function get_files( $type = null, $depth = 0, $search_parent = false ) {
$files = (array) self::scandir( $this->get_stylesheet_directory(), $type, $depth );
if ( $search_parent && $this->parent() ) {
$files += (array) self::scandir( $this->get_template_directory(), $type, $depth );
}
return $files;
}
/**
* Returns the theme's post templates.
*
* @since 4.7.0
*
* @return string[] Array of page templates, keyed by filename and post type,
* with the value of the translated header name.
*/
public function get_post_templates() {
// If you screw up your current theme and we invalidate your parent, most things still work. Let it slide.
if ( $this->errors() && $this->errors()->get_error_codes() !== array( 'theme_parent_invalid' ) ) {
return array();
}
$post_templates = $this->cache_get( 'post_templates' );
if ( ! is_array( $post_templates ) ) {
$post_templates = array();
$files = (array) $this->get_files( 'php', 1, true );
foreach ( $files as $file => $full_path ) {
if ( ! preg_match( '|Template Name:(.*)$|mi', file_get_contents( $full_path ), $header ) ) {
continue;
}
$types = array( 'page' );
if ( preg_match( '|Template Post Type:(.*)$|mi', file_get_contents( $full_path ), $type ) ) {
$types = explode( ',', _cleanup_header_comment( $type[1] ) );
}
foreach ( $types as $type ) {
$type = sanitize_key( $type );
if ( ! isset( $post_templates[ $type ] ) ) {
$post_templates[ $type ] = array();
}
$post_templates[ $type ][ $file ] = _cleanup_header_comment( $header[1] );
}
}
$this->cache_add( 'post_templates', $post_templates );
}
if ( $this->load_textdomain() ) {
foreach ( $post_templates as &$post_type ) {
foreach ( $post_type as &$post_template ) {
$post_template = $this->translate_header( 'Template Name', $post_template );
}
}
}
return $post_templates;
}
/**
* Returns the theme's post templates for a given post type.
*
* @since 3.4.0
* @since 4.7.0 Added the `$post_type` parameter.
*
* @param WP_Post|null $post Optional. The post being edited, provided for context.
* @param string $post_type Optional. Post type to get the templates for. Default 'page'.
* If a post is provided, its post type is used.
* @return string[] Array of template header names keyed by the template file name.
*/
public function get_page_templates( $post = null, $post_type = 'page' ) {
if ( $post ) {
$post_type = get_post_type( $post );
}
$post_templates = $this->get_post_templates();
$post_templates = isset( $post_templates[ $post_type ] ) ? $post_templates[ $post_type ] : array();
/**
* Filters list of page templates for a theme.
*
* @since 4.9.6
*
* @param string[] $post_templates Array of template header names keyed by the template file name.
* @param WP_Theme $this The theme object.
* @param WP_Post|null $post The post being edited, provided for context, or null.
* @param string $post_type Post type to get the templates for.
*/
$post_templates = (array) apply_filters( 'theme_templates', $post_templates, $this, $post, $post_type );
/**
* Filters list of page templates for a theme.
*
* The dynamic portion of the hook name, `$post_type`, refers to the post type.
*
* @since 3.9.0
* @since 4.4.0 Converted to allow complete control over the `$page_templates` array.
* @since 4.7.0 Added the `$post_type` parameter.
*
* @param string[] $post_templates Array of template header names keyed by the template file name.
* @param WP_Theme $this The theme object.
* @param WP_Post|null $post The post being edited, provided for context, or null.
* @param string $post_type Post type to get the templates for.
*/
$post_templates = (array) apply_filters( "theme_{$post_type}_templates", $post_templates, $this, $post, $post_type );
return $post_templates;
}
/**
* Scans a directory for files of a certain extension.
*
* @since 3.4.0
*
* @param string $path Absolute path to search.
* @param array|string|null $extensions Optional. Array of extensions to find, string of a single extension,
* or null for all extensions. Default null.
* @param int $depth Optional. How many levels deep to search for files. Accepts 0, 1+, or
* -1 (infinite depth). Default 0.
* @param string $relative_path Optional. The basename of the absolute path. Used to control the
* returned path for the found files, particularly when this function
* recurses to lower depths. Default empty.
* @return string[]|false Array of files, keyed by the path to the file relative to the `$path` directory prepended
* with `$relative_path`, with the values being absolute paths. False otherwise.
*/
private static function scandir( $path, $extensions = null, $depth = 0, $relative_path = '' ) {
if ( ! is_dir( $path ) ) {
return false;
}
if ( $extensions ) {
$extensions = (array) $extensions;
$_extensions = implode( '|', $extensions );
}
$relative_path = trailingslashit( $relative_path );
if ( '/' === $relative_path ) {
$relative_path = '';
}
$results = scandir( $path );
$files = array();
/**
* Filters the array of excluded directories and files while scanning theme folder.
*
* @since 4.7.4
*
* @param string[] $exclusions Array of excluded directories and files.
*/
$exclusions = (array) apply_filters( 'theme_scandir_exclusions', array( 'CVS', 'node_modules', 'vendor', 'bower_components' ) );
foreach ( $results as $result ) {
if ( '.' === $result[0] || in_array( $result, $exclusions, true ) ) {
continue;
}
if ( is_dir( $path . '/' . $result ) ) {
if ( ! $depth ) {
continue;
}
$found = self::scandir( $path . '/' . $result, $extensions, $depth - 1, $relative_path . $result );
$files = array_merge_recursive( $files, $found );
} elseif ( ! $extensions || preg_match( '~\.(' . $_extensions . ')$~', $result ) ) {
$files[ $relative_path . $result ] = $path . '/' . $result;
}
}
return $files;
}
/**
* Loads the theme's textdomain.
*
* Translation files are not inherited from the parent theme. TODO: If this fails for the
* child theme, it should probably try to load the parent theme's translations.
*
* @since 3.4.0
*
* @return bool True if the textdomain was successfully loaded or has already been loaded.
* False if no textdomain was specified in the file headers, or if the domain could not be loaded.
*/
public function load_textdomain() {
if ( isset( $this->textdomain_loaded ) ) {
return $this->textdomain_loaded;
}
$textdomain = $this->get( 'TextDomain' );
if ( ! $textdomain ) {
$this->textdomain_loaded = false;
return false;
}
if ( is_textdomain_loaded( $textdomain ) ) {
$this->textdomain_loaded = true;
return true;
}
$path = $this->get_stylesheet_directory();
$domainpath = $this->get( 'DomainPath' );
if ( $domainpath ) {
$path .= $domainpath;
} else {
$path .= '/languages';
}
$this->textdomain_loaded = load_theme_textdomain( $textdomain, $path );
return $this->textdomain_loaded;
}
/**
* Whether the theme is allowed (multisite only).
*
* @since 3.4.0
*
* @param string $check Optional. Whether to check only the 'network'-wide settings, the 'site'
* settings, or 'both'. Defaults to 'both'.
* @param int $blog_id Optional. Ignored if only network-wide settings are checked. Defaults to current site.
* @return bool Whether the theme is allowed for the network. Returns true in single-site.
*/
public function is_allowed( $check = 'both', $blog_id = null ) {
if ( ! is_multisite() ) {
return true;
}
if ( 'both' === $check || 'network' === $check ) {
$allowed = self::get_allowed_on_network();
if ( ! empty( $allowed[ $this->get_stylesheet() ] ) ) {
return true;
}
}
if ( 'both' === $check || 'site' === $check ) {
$allowed = self::get_allowed_on_site( $blog_id );
if ( ! empty( $allowed[ $this->get_stylesheet() ] ) ) {
return true;
}
}
return false;
}
/**
* Determines the latest WordPress default theme that is installed.
*
* This hits the filesystem.
*
* @since 4.4.0
*
* @return WP_Theme|false Object, or false if no theme is installed, which would be bad.
*/
public static function get_core_default_theme() {
foreach ( array_reverse( self::$default_themes ) as $slug => $name ) {
$theme = wp_get_theme( $slug );
if ( $theme->exists() ) {
return $theme;
}
}
return false;
}
/**
* Returns array of stylesheet names of themes allowed on the site or network.
*
* @since 3.4.0
*
* @param int $blog_id Optional. ID of the site. Defaults to the current site.
* @return string[] Array of stylesheet names.
*/
public static function get_allowed( $blog_id = null ) {
/**
* Filters the array of themes allowed on the network.
*
* Site is provided as context so that a list of network allowed themes can
* be filtered further.
*
* @since 4.5.0
*
* @param string[] $allowed_themes An array of theme stylesheet names.
* @param int $blog_id ID of the site.
*/
$network = (array) apply_filters( 'network_allowed_themes', self::get_allowed_on_network(), $blog_id );
return $network + self::get_allowed_on_site( $blog_id );
}
/**
* Returns array of stylesheet names of themes allowed on the network.
*
* @since 3.4.0
*
* @return string[] Array of stylesheet names.
*/
public static function get_allowed_on_network() {
static $allowed_themes;
if ( ! isset( $allowed_themes ) ) {
$allowed_themes = (array) get_site_option( 'allowedthemes' );
}
/**
* Filters the array of themes allowed on the network.
*
* @since MU (3.0.0)
*
* @param string[] $allowed_themes An array of theme stylesheet names.
*/
$allowed_themes = apply_filters( 'allowed_themes', $allowed_themes );
return $allowed_themes;
}
/**
* Returns array of stylesheet names of themes allowed on the site.
*
* @since 3.4.0
*
* @param int $blog_id Optional. ID of the site. Defaults to the current site.
* @return string[] Array of stylesheet names.
*/
public static function get_allowed_on_site( $blog_id = null ) {
static $allowed_themes = array();
if ( ! $blog_id || ! is_multisite() ) {
$blog_id = get_current_blog_id();
}
if ( isset( $allowed_themes[ $blog_id ] ) ) {
/**
* Filters the array of themes allowed on the site.
*
* @since 4.5.0
*
* @param string[] $allowed_themes An array of theme stylesheet names.
* @param int $blog_id ID of the site. Defaults to current site.
*/
return (array) apply_filters( 'site_allowed_themes', $allowed_themes[ $blog_id ], $blog_id );
}
$current = get_current_blog_id() == $blog_id;
if ( $current ) {
$allowed_themes[ $blog_id ] = get_option( 'allowedthemes' );
} else {
switch_to_blog( $blog_id );
$allowed_themes[ $blog_id ] = get_option( 'allowedthemes' );
restore_current_blog();
}
// This is all super old MU back compat joy.
// 'allowedthemes' keys things by stylesheet. 'allowed_themes' keyed things by name.
if ( false === $allowed_themes[ $blog_id ] ) {
if ( $current ) {
$allowed_themes[ $blog_id ] = get_option( 'allowed_themes' );
} else {
switch_to_blog( $blog_id );
$allowed_themes[ $blog_id ] = get_option( 'allowed_themes' );
restore_current_blog();
}
if ( ! is_array( $allowed_themes[ $blog_id ] ) || empty( $allowed_themes[ $blog_id ] ) ) {
$allowed_themes[ $blog_id ] = array();
} else {
$converted = array();
$themes = wp_get_themes();
foreach ( $themes as $stylesheet => $theme_data ) {
if ( isset( $allowed_themes[ $blog_id ][ $theme_data->get( 'Name' ) ] ) ) {
$converted[ $stylesheet ] = true;
}
}
$allowed_themes[ $blog_id ] = $converted;
}
// Set the option so we never have to go through this pain again.
if ( is_admin() && $allowed_themes[ $blog_id ] ) {
if ( $current ) {
update_option( 'allowedthemes', $allowed_themes[ $blog_id ] );
delete_option( 'allowed_themes' );
} else {
switch_to_blog( $blog_id );
update_option( 'allowedthemes', $allowed_themes[ $blog_id ] );
delete_option( 'allowed_themes' );
restore_current_blog();
}
}
}
/** This filter is documented in wp-includes/class-wp-theme.php */
return (array) apply_filters( 'site_allowed_themes', $allowed_themes[ $blog_id ], $blog_id );
}
/**
* Enables a theme for all sites on the current network.
*
* @since 4.6.0
*
* @param string|string[] $stylesheets Stylesheet name or array of stylesheet names.
*/
public static function network_enable_theme( $stylesheets ) {
if ( ! is_multisite() ) {
return;
}
if ( ! is_array( $stylesheets ) ) {
$stylesheets = array( $stylesheets );
}
$allowed_themes = get_site_option( 'allowedthemes' );
foreach ( $stylesheets as $stylesheet ) {
$allowed_themes[ $stylesheet ] = true;
}
update_site_option( 'allowedthemes', $allowed_themes );
}
/**
* Disables a theme for all sites on the current network.
*
* @since 4.6.0
*
* @param string|string[] $stylesheets Stylesheet name or array of stylesheet names.
*/
public static function network_disable_theme( $stylesheets ) {
if ( ! is_multisite() ) {
return;
}
if ( ! is_array( $stylesheets ) ) {
$stylesheets = array( $stylesheets );
}
$allowed_themes = get_site_option( 'allowedthemes' );
foreach ( $stylesheets as $stylesheet ) {
if ( isset( $allowed_themes[ $stylesheet ] ) ) {
unset( $allowed_themes[ $stylesheet ] );
}
}
update_site_option( 'allowedthemes', $allowed_themes );
}
/**
* Sorts themes by name.
*
* @since 3.4.0
*
* @param WP_Theme[] $themes Array of theme objects to sort (passed by reference).
*/
public static function sort_by_name( &$themes ) {
if ( 0 === strpos( get_user_locale(), 'en_' ) ) {
uasort( $themes, array( 'WP_Theme', '_name_sort' ) );
} else {
foreach ( $themes as $key => $theme ) {
$theme->translate_header( 'Name', $theme->headers['Name'] );
}
uasort( $themes, array( 'WP_Theme', '_name_sort_i18n' ) );
}
}
/**
* Callback function for usort() to naturally sort themes by name.
*
* Accesses the Name header directly from the class for maximum speed.
* Would choke on HTML but we don't care enough to slow it down with strip_tags().
*
* @since 3.4.0
*
* @param WP_Theme $a First theme.
* @param WP_Theme $b Second theme.
* @return int Negative if `$a` falls lower in the natural order than `$b`. Zero if they fall equally.
* Greater than 0 if `$a` falls higher in the natural order than `$b`. Used with usort().
*/
private static function _name_sort( $a, $b ) {
return strnatcasecmp( $a->headers['Name'], $b->headers['Name'] );
}
/**
* Callback function for usort() to naturally sort themes by translated name.
*
* @since 3.4.0
*
* @param WP_Theme $a First theme.
* @param WP_Theme $b Second theme.
* @return int Negative if `$a` falls lower in the natural order than `$b`. Zero if they fall equally.
* Greater than 0 if `$a` falls higher in the natural order than `$b`. Used with usort().
*/
private static function _name_sort_i18n( $a, $b ) {
return strnatcasecmp( $a->name_translated, $b->name_translated );
}
}
| code |
SHIP offers nationwide coverage- Trade plans or private insurance coverage may not present nationwide coverage. With the healthcare landscape becoming extra complicated on daily basis, going it alone might be risky and costly. As your logistics accomplice, we’ll present the reliability, scalability and security that your provide chain wants – while you give attention to the business of saving lives. There’s even a spa and private training. So it’s very much like the massive name excessive priced gyms however tremendous accessible charges and plans.
And, if HHS does need to step in and implement an alternate itself, what discover will it have? In states like Florida which have refused to participate, HHS will—a minimum of in principle—have sufficient time to implement a federal alternate (but possibly little state cooperation). The more difficult conditions will occur in states which have dedicated to implementation however whose efforts are discovered to be not on time or failing to meet HHS guidelines. Assuming that no less than a dozen states will either refuse to implement exchanges or—deliberately or not—stall their efforts, and that several other states will encounter serious development or implementation issues, HHS is more likely to have its hands very full certainly.
Hi there, My daughters just participated of their first pageant. THEY CHERISHED IT!!!! They each received Princess awards, tiaras, and trophies!!!! I loved it as effectively. We solely do natural pageants. They are the one ones I approve of as a result of I don’t need my 5 yr outdated looking like she is 15 lol. I do assume the Glitz pageants are fairly but just not for me. I really like your articles, they’ve helped me now that my ladies have determined to do another. Thank you!
Stress can spoil relationships shoppers, both present and potential, if you let it. Stress is the last thing your business wants, so learn to handle it and keep it at bay during vital occasions,” suggests Brian Greenberg, founding father of True Blue Life Insurance coverage. Moorman, L. P. (2010). Nurse leaders focus on the nurse’s role in driving expertise decisions. American Nurse Right this moment, 5(1), 1-5.
Have Ramadan drinks akin to jallab and dried apricot syrup in moderate quantities. Although they’re a superb source of sugar and some vitamins they’re additionally a wealthy source of energy, adding up to your caloric consumption. To quench your thirst, drink more water. When you view cancer as a metabolic disease, you can really target and handle the illness with out creating systemic toxicity. You do that primarily by targeting the fuels the most cancers cells use (primarily glucose). | english |
کیا یہ چھ تھکان | kashmiri |
نوئیڈا اردو پوائنٹ اخبارتازہ ترین اے پی پی 17 مارچ2017ء اف سپنر پال سٹرلنگ ون ڈے اننگز میں وکٹیں حاصل کرنے والے پہلے ائرش کھلاڑی بن گئے انہوں نے یہ کارنامہ افغانستان کے خلاف دوسرے ون ڈے انٹرنیشنل میں انجام دیا 26 سالہ پال سٹرلنگ نے گزشتہ روز کھیلے گئے میچ میں شاندار بائولنگ کا مظاہرہ کیا اور 55 رنز کے عوض وکٹیں حاصل کیں اس طرح وہ ون ڈے میں وکٹیں حاصل کرنے والے ائرلینڈ کے پہلے کھلاڑی بن گئے ہیں | urdu |
لاہور ئی این پی گلوکارہ فرین نے کہا ہے کہ شوبز میں پیسے کیلئے نہیں عزت اور شہرت کیلئے ئی ہوں میں شارٹ کٹ پر یقین نہیں رکھتی جو کچھ بھی ہوں اپنے والدین کی دعاں اور میر محنت کا نتیجہ ہے اس بات میں کوئی شک نہیں کہ شوبز میں زیادہ لوگ پیسے کمانے کیلئے تے ہیں لیکن میں اس بات پر یقین نہیں رکھتی میرا شوبز میں نے کا مقصد پیسے اکٹھا کرنا نہیں بلکہ میں چاہتی ہوں کہ میرا ایک نام ہو | urdu |
ಎರಡು ಗಂಟೆ ವಿಚಾರಣೆ ಬಳಿಕ ಇಂದಿಗೆ ಸಾಕು ಎಂದ ಸೋನಿಯಾ: ಇ.ಡಿಯಿಂದ ಬಿಡುಗಡೆ ನವದೆಹಲಿ: ನ್ಯಾಷನಲ್ ಹೆರಾಲ್ಡ್ ಪತ್ರಿಕೆಯ ಕೋಟ್ಯಂತರ ರೂಪಾಯಿಗಳ ಅಕ್ರಮ ಹಣ ವರ್ಗಾವಣೆಗೆ ಸಂಬಂಧಿಸಿದಂತೆ ಜಾರಿ ನಿರ್ದೇಶನಾಯಲಯದ ಇ.ಡಿ ಮುಂದೆ ಕೊನೆಗೂ ಎಐಸಿಸಿ ಹಂಗಾಮಿ ಅಧ್ಯಕ್ಷೆ ಸೋನಿಯಾ ಗಾಂಧಿ ಇಂದು ಬೆಳಗ್ಗೆ ಹಾಜರು ಆದರು. ಈ ಹಿಂದೆ, ಇ.ಡಿ ಹಾಜರಾಗುವಂತೆ ನೋಟಿಸ್ ಜಾರಿ ಮಾಡಿದ ತಕ್ಷಣವೇ ಸೋನಿಯಾ ಅವರಿಗೆ ಕರೊನಾ ಸೋಂಕು ಕಾಣಿಸಿಕೊಂಡಿತ್ತು. ನಂತರ ವಿಚಾರಣೆಗೆ ಬರುವಂತೆ ಮತ್ತೊಮ್ಮೆ ಇಡಿ ನಿರ್ದೇಶಿಸಿದ ನಂತರ ಕೋವಿಡ್ ತೀವ್ರ ಸ್ವರೂಪ ಪಡೆದು ಸೋನಿಯಾ ಆಸ್ಪತ್ರೆಗೆ ದಾಖಲಾಗಿದ್ದರು. ಕೆಲವು ದಿನಗಳ ನಂತರ ಶ್ವಾಸನಾಳ ಸೋಂಕು ಉಂಟಾಗಿದ್ದರಿಂದ ಆಸ್ಪತ್ರೆಯಲ್ಲಿ ಚಿಕಿತ್ಸೆ ಮುಂದುವರಿಸಬೇಕಿದೆ ಎಂದು ವೈದ್ಯರು ತಿಳಿಸಿದ್ದರು. ಕೊನೆಗೂ ಜೂನ್ ಮಧ್ಯ ಭಾಗದಲ್ಲಿ ಆಸ್ಪತ್ರೆಯಿಂದ ಬಿಡುಗಡೆಯಾಗಿದ್ದ ಸೋನಿಯಾ ಅವರು, ವಿಚಾರಣೆಗೆ ಹಾಜರಾಗಲು ಇನ್ನಷ್ಟು ಕಾಲಾವಕಾಶ ಕೇಳಿದ್ದರು. ಈ ಹಿನ್ನೆಲೆಯಲ್ಲಿ ಇಂದು ಅವರ ಹಾಜರಾತಿಯನ್ನು ಕಡ್ಡಾಯ ಮಾಡಲಾಗಿತ್ತು. ಎರಡು ಗಂಟೆಗಳ ವಿಚಾರಣೆ ಬಳಿಕ ಸೋನಿಯಾ ಅವರು ವಿಶ್ರಾಂತಿ ಕೇಳಿದರು. ಕೋವಿಡ್ ಹಿನ್ನೆಲೆಯಲ್ಲಿ ತಮಗೆ ಸುಸ್ತಾಗುತ್ತಿರುವುದಾಗಿ ಅವರು ತಿಳಿಸಿದರು. ಅವರ ಮನವಿಗೆ ಸ್ಪಂದಿಸಿದ ಇ.ಡಿ. ಅಧಿಕಾರಿಗಳು ಅವರನ್ನು ವಾಪಸ್ ಕಳುಹಿಸಿದರು. ಏನಿದು ನ್ಯಾಷನಲ್ ಹೆರಾಲ್ಡ್ ಕೇಸ್? ಜವಾಹರಲಾಲ್ ನೆಹರು ಮತ್ತು ಇತರ ಕೆಲವು ಸ್ವಾತಂತ್ರ್ಯ ಹೋರಾಟಗಾರರು ಜತೆಗೂಡಿ 1938ರಲ್ಲಿ ನ್ಯಾಷನಲ್ ಹೆರಾಲ್ಡ್ ಪತ್ರಿಕೆಯನ್ನು ಹುಟ್ಟುಹಾಕಿದ್ದರು. ಭಾರತೀಯ ರಾಷ್ಟ್ರೀಯ ಕಾಂಗ್ರೆಸ್ನ ಸ್ವತಂತ್ರ ದಳದ ಕಳವಳಗಳಿಗೆ ಧ್ವನಿಯಾಗುವುದು ಇದರ ಉದ್ದೇಶವಾಗಿತ್ತು. ಅಸೋಸಿಯೇಟೆಡ್ ಜರ್ನಲ್ಸ್ ಲಿಮಿಟೆಡ್ ಎಜೆಎಲ್ ಪ್ರಕಾಶನದ ಈ ಪತ್ರಿಕೆಯು, ಸ್ವಾತಂತ್ರ್ಯದ ಬಳಿಕ ಕಾಂಗ್ರೆಸ್ ಮುಖವಾಣಿಯಾಗಿತ್ತು. 2010ರಲ್ಲಿ ಕಾಂಗ್ರೆಸ್ ಪಕ್ಷದ ಆಗಿನ ಪ್ರಧಾನ ಕಾರ್ಯದರ್ಶಿಯಾಗಿದ್ದ ರಾಹುಲ್ ಗಾಂಧಿ ಯಂಗ್ ಇಂಡಿಯಾ ಲಿಮಿಟೆಡ್ ಸ್ಥಾಪಿಸಿದ್ದರು. ಈ ಕಂಪೆನಿಯು ಯಂಗ್ ಇಂಡಿಯಾ ಲಿಮಿಟೆಡ್ ವೈಐಎಲ್, ಅಸೋಸಿಯೇಟೆಡ್ ಜರ್ನಲ್ಸ್ ಲಿಮಿಟೆಡ್ನ ಷೇರುಗಳನ್ನು ಖರೀದಿ ಮಾಡುವಲ್ಲಿ ವಂಚನೆ ಹಾಗೂ ನಂಬಿಕೆ ದ್ರೋಹ ಎಸಗಿದೆ. ಇದರಲ್ಲಿ ಅನೇಕ ಕಾಂಗ್ರೆಸ್ ನಾಯಕರು ಭಾಗಿಯಾಗಿದ್ದಾರೆ ಎಂದು 2012ರಲ್ಲಿ ಬಿಜೆಪಿ ನಾಯಕ ಹಾಗೂ ವಕೀಲ ಸುಬ್ರಮಣಿಯನ್ ಸ್ವಾಮಿ ವಿಚಾರಣಾ ನ್ಯಾಯಾಲಯದಲ್ಲಿ ದೂರು ನೀಡಿದ್ದರು. ಬಳಕೆಯಲ್ಲಿ ಇಲ್ಲದ ಮಾಧ್ಯಮ ಸಂಸ್ಥೆಯ ಆಸ್ತಿಗಳನ್ನು ಸ್ವಾಧೀನ ಪಡಿಸಿಕೊಂಡು ಸುಮಾರು 2 ಸಾವಿರ ಕೋಟಿ ರೂ ಲಾಭ ಹಾಗೂ ಆಸ್ತಿ ಸಂಪಾದಿಸಲು ಯಂಗ್ ಇಂಡಿಯಾ ಲಿ. ವಾಮಮಾರ್ಗ ಅನುಸರಿಸಿದೆ ಎಂದು ಸುಬ್ರಮಣಿಯನ್ ಸ್ವಾಮಿ ಆರೋಪಿಸಿದ್ದರು. ಇದಕ್ಕೆ ಸಂಬಂಧಿಸಿದಂತೆ ವಿಚಾರಣೆ ನಡೆಯುತ್ತಿದ್ದು, ಜಾರಿ ನಿರ್ದೇಶನಾಲಯವು ರಾಹುಲ್ ಮತ್ತು ಸೋನಿಯಾ ಅವರಿಗೆ ನೋಟಿಸ್ ಜಾರಿ ಮಾಡಿ ಖುದ್ದು ಹಾಜರಿಗೆ ಆದೇಶಿಸಿದೆ. ಏಜೆನ್ಸೀಸ್ ಇ.ಡಿ ಇಕ್ಕಳದಲ್ಲಿ ಸೋನಿಯಾ: ದೇಶಾದ್ಯಂತ ಭಾರಿ ಪ್ರತಿಭಟನೆ ವೈರಲ್ ಆಯ್ತು ಈ ಹಳೆಯ ವಿಡಿಯೋ ಕಂಕುಳಿನ ಕೂದಲಿನಿಂದ ಕೋಟಿ ಕೋಟಿ ರೂ. ಗಳಿಸ್ತಾಳೆ ಈಕೆ ಬೆವರೇ ಈಕೆಯ ಆದಾಯದ ಮೂಲವಂತೆ! | kannad |
कोरोना महामारी 16 फिसदी की गिरावट के साथ 13 हजार 405 नये मामले, 235 लोगों की मौत, सक्रीय मामले 2 लाख से कम Vaccination Drive in a School in Delhi नई दिल्ली. कोरोना विषाणु महामारी को लेकर केंद्रीय स्वास्थ्य मंत्रालय द्वारा मंगलवार सुबह जारी आंकड़ों के अनुसार देश में पिछले 24 घंटे के दौरान कोरोना के 13 हजार 405 नए कोरोना विषाणु के मामले सामने आए हैं.यहां कोविड से संबधित सभी नए अपडेट पढ़ें जबकि 235 लोगों की जान चली गई है. अभी डेली पॉजिटिविटी रेट जहां 01.98 फिसदी चल रहा है. 1,75,83,27,441 लोगों को लग चुकी है वैक्सीन देशभर में अभी तक 1 अरब 75 करोड़ 83 लाख 27 हजार 441 लोगों को कोरोनारोधी टीके की खुराक दी जा चूकी है. पिछले 24 घंटे में 7 लाख 706 लोगों को टीका दिया गया है. 4,28,51,929 पहुंची मामलों की संख्या बीते 24 घंटों में आये केसों के बाद भारत में कोरोना विषाणु के मरीजों की संख्या बढ़कर 4 करोड़ 28 लाख 51 हजार 929 पर पहुंच गई है. वहीं, इस बीमारी से मरने वालों की संख्या 5 लाख 12 हजार 344 तक पहुंच गई है. अभी भी देश में 1 लाख 81 हजार 075 लोगों का इलाज अस्पतालों में या घर पर ही चल रहा हैं. पिछले 24 घंटे में सक्रिय मामलों की संख्या में 21 हजार 056 की कमी आई है. 4 करोड़ 21 लाख 58 हजार 510 मरीज हो चुके है स्वस्थ राहत भरी खबर यह है कि कोरोना विषाणु से अब तक 4 करोड़ 21 लाख 58 हजार 510 मरीज स्वस्थ हो चुके हैं. देशभर में ठीक होने की दर 98.33 फिसदी है. पिछले 24 घंटे में 34 हजार 226 लोग कोविड19 से ठीक हुए हैं. 21 फरवरी को 10,84,247 लोगों की जांच भारतीय चिकित्सा अनुसंधान परिषद Indian Council of Medical Research द्वारा जारी आंकड़ों के अनुसार भारत में 21 फरवरी तक कोरोना वायरस के लिए कुल 76 करोड़ 12 लाख 30 हजार 580 नमूने लिए जा चुके हैं, जिनमें से 8 लाख 31 हजार 087 नमूने कल लिए गए हैं. | hindi |
ನವರಾತ್ರಿ ವೈಭವ 2: ಈ ಶ್ಲೋಕ ಪಠಣದಿಂದ ಸಿಗುವುದು ಮನಸಿಗೆ ಶಾಂತಿನೆಮ್ಮದಿ.. ಎಚ್.ವಿ.ದೀಪಕ್ ನರಸಿಂಹ ದಧಾನ ಕರಪದ್ಮಾಭ್ಯಾಂ ಅಕ್ಷಮಾಲಾ ಕಮಂಡಲೂ ದೇವೀ ಪ್ರಸೀದತು ಮಯಿ ಬ್ರಹ್ಮಚಾರಿಣ್ಯನುತ್ತಮಾ ಈಕೆ ಪಾರ್ವತಿಯು ಶಿವನ ಪತ್ನಿಯಾಗುವು ದಕ್ಕಿಂತ ಮೊದಲಿನ ರೂಪ. ಪ್ರಜಾಪತಿ ದಕ್ಷನ ಮಗಳು. ಬ್ರಹ್ಮಚರ್ಯ ಮತ್ತು ತಪಸ್ಸಿಗೆ ಹೆಸರಾದವಳು. ಇಲ್ಲಿ ಬ್ರಹ್ಮ ಶಬ್ದದ ಅರ್ಥ ತಪಸ್ಸು ಎಂದು. ಬ್ರಹ್ಮಚಾರಿಣಿ ಅರ್ಥಾತ್ ತಪಸ್ಸನ್ನು ಆಚರಿಸುವವಳು. ದೇವಿಯ ಸ್ವರೂಪವು ಪೂರ್ಣ ಜ್ಯೋತಿರ್ಮಯ ಹಾಗೂ ಅತ್ಯಂತ ಭವ್ಯವಾಗಿದೆ. ಬರಿಗಾಲಿನಲ್ಲಿ ನಡೆಯುವ ಈಕೆ ಕೈಯಲ್ಲಿ ಜಪದ ಮಾಲೆ ಹಾಗೂ ಕಮಂಡಲು ಹಿಡಿದಿರುತ್ತಾಳೆ. ಇವಳನ್ನು ಅಪರ್ಣಾ ಉಮಾ ಎಂದೂ ಕರೆಯುತ್ತಾರೆ. ಇವಳ ಆರಾಧನೆಯಿಂದ ತಪಸ್ಸು, ತ್ಯಾಗ, ವೈರಾಗ್ಯ, ಸದಾಚಾರ, ಸಂಯಮ ಸಿದ್ಧಿಸುತ್ತದೆ. ನವರಾತ್ರಿಯ ಈ ಎರಡನೆಯ ದಿನ ಸಾಧಕರು ಮನಸ್ಸನ್ನು ಸ್ವಾಧಿಷ್ಠಾನ ಚಕ್ರದಲ್ಲಿ ನೆಲೆಗೊಳಿಸುತ್ತಾರೆ. ಒಮ್ಮೆ ಮನಸ್ಸಿನ ಮೇಲೆ ಹಿಡಿತ ಕಡಿಮೆಯಾದರೆ ಸ್ವಾಸ್ಥ್ಯ ಕೆಡುತ್ತದೆ. ಹಾಗಾಗಿ ಮನಸ್ಸಿನ ಜಾಗೃತಿ, ಆರೈಕೆಗೆ ಮುಖ್ಯ ಸ್ವಾಧಿಷ್ಠಾನ, ಸ್ವ ಅಧಿಷ್ಠಾನ. ಸ್ವ ಅಂದರೆ ನಾನು ಅಧಿಷ್ಠಾನ ಎಂದರೆ ಅಧಿಪತಿ, ಆಡಳಿತ ನಡೆಸುವುದು. ಅಂದರೆ ಮನಸ್ಸಿನ ಮೇಲೆ ಹಿಡಿತ ಸಾಧಿಸುವುದಾಗಿದೆ. ನವರಾತ್ರಿಯ ಎರಡನೇ ದಿನ ದೇವಿಗೆ ಇಷ್ಟವಾದ ದಾಸವಾಳ ಹೂವಿನಿಂದ ಬ್ರಹ್ಮಚಾರಿಣಿ ದೇವಿಯನ್ನು ಪೂಜಿಸಿದರೆ ಇಷ್ಟಾರ್ಥಗಳು ನೆರವೇರುತ್ತವೆ. ಅಂದಹಾಗೆ, ಉತ್ತರ ಪ್ರದೇಶದ ವಾರಾಣಸಿಯ ಗಂಗಾನದಿ ದಡದಲ್ಲಿರುವ ದುರ್ಗಾಘಾಟ್ ಹತ್ತಿರ ಬ್ರಹ್ಮಚಾರಿಣಿಯ ಪ್ರಸಿದ್ಧ ದೇವಾಲಯವಿದೆ. ದೇವಿ ಬ್ರಹ್ಮಚಾರಿಣಿ ಕವಚ ತ್ರಿಪುರಾ ಮೇ ಹೃದಯಂ ಪಾತುಲಲಾಟೇ ಪಾತು ಶಂಕರಭಾಮಿನೀ ಅರ್ಪಣಾ ಸದಾ ಪಾತು ನೇತ್ರೌ ಅಧರೌ ಚ ಕಪೋಲೌ ಪಂಚದಶೀ ಕಂಠಂ ಪಾತು ಮಧ್ಯದೇಶಂ ಪಾತು ಮಹೇಶ್ವರೀ ಷೋಡಶೀ ಸದಾ ಪಾತು ನಾಭೋ ಗೃಹೇ ಚ ಪಾದಯೋಃ ಅಂಗಪ್ರತ್ಯಂಗ ಸತತ ಪಾತು ಬ್ರಹ್ಮಚಾರಿಣೀ ದೇವಿ ಬ್ರಹ್ಮಚಾರಿಣಿ ಮಂತ್ರ: ಓಂ ದೇವೀ ಬ್ರಹ್ಮಚಾರಿಣ್ಯೈ ನಮಃ ಯಶಸ್ಸಿಗೆ ಅಡ್ಡಲಾಗಿರುವ ಎಲ್ಲ ತೊಡಕುಗಳೂ ಸರಿದು ಮನಸ್ಸಿಗೆ ಶಾಂತಿ, ನೆಮ್ಮದಿ ದೊರೆಯಲು ಈ ಶ್ಲೋಕವನ್ನು ಪಠಿಸಬೇಕು. ದೈವದ ಕೃಪಾಕಟಾಕ್ಷಕ್ಕೆ ಸುಲಭ ಮಾರ್ಗವಾದ ಭಕ್ತಿಮಾರ್ಗದಲ್ಲಿ ಎರಡನೆಯದು ಕೀರ್ತನೆ. ಭಗವಂತನ ಹೆಸರು, ಗುಣ, ಮಹಾತ್ಮೆ, ಲೀಲೆಗಳನ್ನು ವರ್ಣಿಸುವುದು, ಹಾಡುವುದೇ ಕೀರ್ತನ ಭಕ್ತಿ. ಇಂತಹ ಕೀರ್ತನ ಭಕ್ತಿಯನ್ನು ಎಲ್ಲ ಭಗವದ್ ಭಕ್ತರುಗಳೂ ಸಾಮಾನ್ಯವಾಗಿ ಪ್ರಶಂಸಿಸಿಯೇ ಇರುತ್ತಾರೆ. ಹಾಗಿದ್ದ ಮೇಲೆ ಆಳ್ವಾರರು ಇದರ ಬಗ್ಗೆ ಏನೂ ಹೇಳದೇ ಇರುತ್ತಾರೇನು? ಆಳ್ವಾರರ ಪಾಶುರಗಳೆ ಲ್ಲವೂ ಸಹಜವಾಗಿ ಸ್ತುತಿಪರವಾದ ಕೀರ್ತನೆಗಳೇನೇ! ಅದರಿಂದಲೇ ಈ ಪಾಶುರ ಗಳನ್ನು ದೇವಸ್ಥಾನಗಳಲ್ಲಿ ಪ್ರತಿದಿನವೂ ಅನು ಸಂಧಾನ ಮಾಡುವರು. ಭಗವಂತನ ಕಲ್ಯಾಣಗುಣಗಳನ್ನು ಸಂಕೀರ್ತನೆ ಮಾಡುವ ಭಕ್ತರ ಪಾದಸ್ಪರ್ಶದಿಂದಲೇ ಈ ಭೂಮಿ ಪಾವಿತ್ರ್ಯವನ್ನು ಹೊಂದಿದೆ ಎಂದು ಪೆರಿಯಾಳ್ವಾರ್ ಪೆರಿಯಾಳ್ವಾರ್ ತಿರುಮೊಷಿ 446 ಸ್ಪಷ್ಟೀಕರಿಸುತ್ತ, ನನ್ನ ನಾಲಿಗೆ ಭಗವಂತನನ್ನು ಮಾತ್ರವೇ ಸ್ತುತಿಸುತ್ತದೆಯೇ ಹೊರತು ಬೇರೆ ಯಾರನ್ನೂ ಸ್ತುತಿಸುವುದಿಲ್ಲ ಎಂದು ತಿಳಿಸಿದ್ದಾರೆ. ಗಾನಯೋಗ್ಯವಾದ ಆಳ್ವಾರರ ಪಾಶುರಗಳೆಲ್ಲವೂ ಭಗವಂತನ ಸ್ತುತಿಪರ ವಾದವುಗಳಾದುದರಿಂದ ಅಂತಹ ಭಕ್ತಿಗೀತೆಗಳನ್ನು ಭಕ್ತರು ಹಾಡುತ್ತ, ವಿವಿಧ ರಾಗ ತಾಳಗಳೊಂದಿಗೆ ಪ್ರಚಾರ ಮಾಡುತ್ತ, ಪ್ರಜೆಗಳನ್ನು ಪ್ರಭಾವಿಸಿದ್ದಾರೆ. ಲೇಖಕರು ಆಧ್ಯಾತ್ಮಿಕ ಚಿಂತಕರು | kannad |
Delhi Riots 2020: अलग मुस्लिम राष्ट्र बनाने की मंशा रखे हुए थे उमर खालिद समेत अन्य साजिशकर्ता नई दिल्ली, जागरण संवाददादा। दिल्ली दंगे की साजिश रचने के मामले में जेएनयू के पूर्व छात्र उमर खालिद समेत सात आरोपितों की जमानत अर्जी का विरोध करते हुए विशेष लोक अभियोजक अमित प्रसाद ने बृहस्पतिवार को अपना पक्ष रखा। उन्होंने अतिरिक्त सत्र न्यायाधीश अमिताभ रावत की कोर्ट में कहा कि अभियोजन के पास गोपनीय गवाह का बयान है, वह बता रहा है कि साजिशकर्ता अलग मुस्लिम राष्ट्र बनाना चाहते थे। देश की एकता और अखंडता को खत्म करने की मंशा के साथ साजिशकर्ताओं ने योजना बनाई थी।विशेष लोक अभियोजक ने कोर्ट से कहा कि अभियोजन के पास आरोपित ताहिर हुसैन के मनी लांड्रिंग में शामिल होने के पर्याप्त साक्ष्य हैं। इस संबंध में भी गोपनीय गवाह का बयान है, जिसमें वह बता रहा है कि ताहिर ने हंिदूुओं को मारने के लिए लोगों को धनराशि बांटी। उन्होंने कहा कि अमूमन लोग ब्लैक मनी को व्हाइट मनी में तब्दील करने का प्रयास करते हैं। अभियोजन के पास इस बात के सुबूत हैं कि ताहिर ने दंगे के लिए व्हाइट मनी को ब्लैक मनी में तब्दील किया।अमित प्रसाद ने कोर्ट से कहा कि वे आरोपितों के आपसी संपर्क के संबंध में वाट्सएप चैट प्रस्तुत कर चुके हैं। वे यह भी बता चुके हैं कि साजिशकर्ताओं ने किस खामोशी के साथ हसा भड़काने की योजना बनाई। स्थानीय लोगों का सहयोग नहीं मिला तो बाहरी लोगों को बुलाकर हिंसा को भड़काया गया। अपनी दलीलों को पूरी करते वक्त अमित प्रसाद ने लगाए गए आरोपों को लेकर कानूनी बिंदुओं पर विस्तृत पक्ष रखा।उन्होंने कोर्ट से कहा कि उमर खालिद दिल्ली प्रोटेस्ट सपोर्ट ग्रुप डीपीएसजी का सदस्य था। वह शाहीन बाग और सीलमपुर में हुई गोपनीय बैठक में शामिल हुआ। वह अन्य आरोपितों के लगातार संपर्क में था। उसके भाषण और विभिन्न गवाहों के बयानों से साजिश में उसकी भूमिका साफ झलकती है। आरोपित खालिद सैफी के संबंध में कहा कि उसने अपने एनजीओ के खाते में दंगे के लिए रुपये लिए। यूनाइटेड अगेंस्ट हेट ग्रुप में शामिल होने के अलावा वह खुरेजी धरना स्थल पर शामिल रहा। इसके अलावा उन्होंने आरोपित सलीम मलिक उर्फ मुन्ना, मुहम्मद सलीम खान, मीरान हैदर व शादाब अहमद की भूमिका बताई। आरोपित शरजील की भूमिका पर वे लिखित पक्ष रखते वक्त कोर्ट को बताएंगे। अब इस मामले में आरोपितों के वकीलों को पक्ष रखने के लिए सुनवाई की अलगअलग तिथियां निर्धारित की गई हैं।कोर्ट में पेश दस्तावेज को ट्वीट करने पर जताई आपत्तिदंगे की साजिश के मामले में एक आरोपित की ओर से पेश वरिष्ठ अधिवक्ता रेबेका जान ने कोर्ट की सुनवाई के दौरान अभियोजक की ओर से पेश किए जा रहे दस्तावेज के स्क्रीन शाट ट्वीट करने को लेकर आपत्ति जताई। उन्होंने कहा कि मीडिया के कुछ लोगों ने स्क्रीन शाट ट्वीट किए हैं। उन्होंने कोर्ट से गुजारिश करते हुए कहा कि इसको लेकर निर्देश जारी किया जाए। इस पर कोर्ट ने कहा कि मीडिया को मामले की रिपोर्टिग करने से नहीं रोक सकते। कोर्ट ने यह जरूर कहा कि मीडिया स्क्रीन शाट न ले। | hindi |
/*
* Copyright 2010-2017 Amazon.com, Inc. or its affiliates. All Rights Reserved.
*
* Licensed under the Apache License, Version 2.0 (the "License").
* You may not use this file except in compliance with the License.
* A copy of the License is located at
*
* http://aws.amazon.com/apache2.0
*
* or in the "license" file accompanying this file. This file is distributed
* on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either
* express or implied. See the License for the specific language governing
* permissions and limitations under the License.
*/
#pragma once
#include <aws/waf-regional/WAFRegional_EXPORTS.h>
#include <aws/core/utils/memory/stl/AWSString.h>
#include <utility>
namespace Aws
{
namespace Utils
{
namespace Json
{
class JsonValue;
class JsonView;
} // namespace Json
} // namespace Utils
namespace WAFRegional
{
namespace Model
{
/**
* <p>Returned by <a>ListRegexPatternSets</a>. Each
* <code>RegexPatternSetSummary</code> object includes the <code>Name</code> and
* <code>RegexPatternSetId</code> for one <a>RegexPatternSet</a>.</p><p><h3>See
* Also:</h3> <a
* href="http://docs.aws.amazon.com/goto/WebAPI/waf-regional-2016-11-28/RegexPatternSetSummary">AWS
* API Reference</a></p>
*/
class AWS_WAFREGIONAL_API RegexPatternSetSummary
{
public:
RegexPatternSetSummary();
RegexPatternSetSummary(Aws::Utils::Json::JsonView jsonValue);
RegexPatternSetSummary& operator=(Aws::Utils::Json::JsonView jsonValue);
Aws::Utils::Json::JsonValue Jsonize() const;
/**
* <p>The <code>RegexPatternSetId</code> for a <code>RegexPatternSet</code>. You
* use <code>RegexPatternSetId</code> to get information about a
* <code>RegexPatternSet</code>, update a <code>RegexPatternSet</code>, remove a
* <code>RegexPatternSet</code> from a <code>RegexMatchSet</code>, and delete a
* <code>RegexPatternSet</code> from AWS WAF.</p> <p>
* <code>RegexPatternSetId</code> is returned by <a>CreateRegexPatternSet</a> and
* by <a>ListRegexPatternSets</a>.</p>
*/
inline const Aws::String& GetRegexPatternSetId() const{ return m_regexPatternSetId; }
/**
* <p>The <code>RegexPatternSetId</code> for a <code>RegexPatternSet</code>. You
* use <code>RegexPatternSetId</code> to get information about a
* <code>RegexPatternSet</code>, update a <code>RegexPatternSet</code>, remove a
* <code>RegexPatternSet</code> from a <code>RegexMatchSet</code>, and delete a
* <code>RegexPatternSet</code> from AWS WAF.</p> <p>
* <code>RegexPatternSetId</code> is returned by <a>CreateRegexPatternSet</a> and
* by <a>ListRegexPatternSets</a>.</p>
*/
inline bool RegexPatternSetIdHasBeenSet() const { return m_regexPatternSetIdHasBeenSet; }
/**
* <p>The <code>RegexPatternSetId</code> for a <code>RegexPatternSet</code>. You
* use <code>RegexPatternSetId</code> to get information about a
* <code>RegexPatternSet</code>, update a <code>RegexPatternSet</code>, remove a
* <code>RegexPatternSet</code> from a <code>RegexMatchSet</code>, and delete a
* <code>RegexPatternSet</code> from AWS WAF.</p> <p>
* <code>RegexPatternSetId</code> is returned by <a>CreateRegexPatternSet</a> and
* by <a>ListRegexPatternSets</a>.</p>
*/
inline void SetRegexPatternSetId(const Aws::String& value) { m_regexPatternSetIdHasBeenSet = true; m_regexPatternSetId = value; }
/**
* <p>The <code>RegexPatternSetId</code> for a <code>RegexPatternSet</code>. You
* use <code>RegexPatternSetId</code> to get information about a
* <code>RegexPatternSet</code>, update a <code>RegexPatternSet</code>, remove a
* <code>RegexPatternSet</code> from a <code>RegexMatchSet</code>, and delete a
* <code>RegexPatternSet</code> from AWS WAF.</p> <p>
* <code>RegexPatternSetId</code> is returned by <a>CreateRegexPatternSet</a> and
* by <a>ListRegexPatternSets</a>.</p>
*/
inline void SetRegexPatternSetId(Aws::String&& value) { m_regexPatternSetIdHasBeenSet = true; m_regexPatternSetId = std::move(value); }
/**
* <p>The <code>RegexPatternSetId</code> for a <code>RegexPatternSet</code>. You
* use <code>RegexPatternSetId</code> to get information about a
* <code>RegexPatternSet</code>, update a <code>RegexPatternSet</code>, remove a
* <code>RegexPatternSet</code> from a <code>RegexMatchSet</code>, and delete a
* <code>RegexPatternSet</code> from AWS WAF.</p> <p>
* <code>RegexPatternSetId</code> is returned by <a>CreateRegexPatternSet</a> and
* by <a>ListRegexPatternSets</a>.</p>
*/
inline void SetRegexPatternSetId(const char* value) { m_regexPatternSetIdHasBeenSet = true; m_regexPatternSetId.assign(value); }
/**
* <p>The <code>RegexPatternSetId</code> for a <code>RegexPatternSet</code>. You
* use <code>RegexPatternSetId</code> to get information about a
* <code>RegexPatternSet</code>, update a <code>RegexPatternSet</code>, remove a
* <code>RegexPatternSet</code> from a <code>RegexMatchSet</code>, and delete a
* <code>RegexPatternSet</code> from AWS WAF.</p> <p>
* <code>RegexPatternSetId</code> is returned by <a>CreateRegexPatternSet</a> and
* by <a>ListRegexPatternSets</a>.</p>
*/
inline RegexPatternSetSummary& WithRegexPatternSetId(const Aws::String& value) { SetRegexPatternSetId(value); return *this;}
/**
* <p>The <code>RegexPatternSetId</code> for a <code>RegexPatternSet</code>. You
* use <code>RegexPatternSetId</code> to get information about a
* <code>RegexPatternSet</code>, update a <code>RegexPatternSet</code>, remove a
* <code>RegexPatternSet</code> from a <code>RegexMatchSet</code>, and delete a
* <code>RegexPatternSet</code> from AWS WAF.</p> <p>
* <code>RegexPatternSetId</code> is returned by <a>CreateRegexPatternSet</a> and
* by <a>ListRegexPatternSets</a>.</p>
*/
inline RegexPatternSetSummary& WithRegexPatternSetId(Aws::String&& value) { SetRegexPatternSetId(std::move(value)); return *this;}
/**
* <p>The <code>RegexPatternSetId</code> for a <code>RegexPatternSet</code>. You
* use <code>RegexPatternSetId</code> to get information about a
* <code>RegexPatternSet</code>, update a <code>RegexPatternSet</code>, remove a
* <code>RegexPatternSet</code> from a <code>RegexMatchSet</code>, and delete a
* <code>RegexPatternSet</code> from AWS WAF.</p> <p>
* <code>RegexPatternSetId</code> is returned by <a>CreateRegexPatternSet</a> and
* by <a>ListRegexPatternSets</a>.</p>
*/
inline RegexPatternSetSummary& WithRegexPatternSetId(const char* value) { SetRegexPatternSetId(value); return *this;}
/**
* <p>A friendly name or description of the <a>RegexPatternSet</a>. You can't
* change <code>Name</code> after you create a <code>RegexPatternSet</code>.</p>
*/
inline const Aws::String& GetName() const{ return m_name; }
/**
* <p>A friendly name or description of the <a>RegexPatternSet</a>. You can't
* change <code>Name</code> after you create a <code>RegexPatternSet</code>.</p>
*/
inline bool NameHasBeenSet() const { return m_nameHasBeenSet; }
/**
* <p>A friendly name or description of the <a>RegexPatternSet</a>. You can't
* change <code>Name</code> after you create a <code>RegexPatternSet</code>.</p>
*/
inline void SetName(const Aws::String& value) { m_nameHasBeenSet = true; m_name = value; }
/**
* <p>A friendly name or description of the <a>RegexPatternSet</a>. You can't
* change <code>Name</code> after you create a <code>RegexPatternSet</code>.</p>
*/
inline void SetName(Aws::String&& value) { m_nameHasBeenSet = true; m_name = std::move(value); }
/**
* <p>A friendly name or description of the <a>RegexPatternSet</a>. You can't
* change <code>Name</code> after you create a <code>RegexPatternSet</code>.</p>
*/
inline void SetName(const char* value) { m_nameHasBeenSet = true; m_name.assign(value); }
/**
* <p>A friendly name or description of the <a>RegexPatternSet</a>. You can't
* change <code>Name</code> after you create a <code>RegexPatternSet</code>.</p>
*/
inline RegexPatternSetSummary& WithName(const Aws::String& value) { SetName(value); return *this;}
/**
* <p>A friendly name or description of the <a>RegexPatternSet</a>. You can't
* change <code>Name</code> after you create a <code>RegexPatternSet</code>.</p>
*/
inline RegexPatternSetSummary& WithName(Aws::String&& value) { SetName(std::move(value)); return *this;}
/**
* <p>A friendly name or description of the <a>RegexPatternSet</a>. You can't
* change <code>Name</code> after you create a <code>RegexPatternSet</code>.</p>
*/
inline RegexPatternSetSummary& WithName(const char* value) { SetName(value); return *this;}
private:
Aws::String m_regexPatternSetId;
bool m_regexPatternSetIdHasBeenSet;
Aws::String m_name;
bool m_nameHasBeenSet;
};
} // namespace Model
} // namespace WAFRegional
} // namespace Aws
| code |
\begin{document}
\title{\bf Spectral analogues of Moon-Moser's theorem on Hamilton paths in
bipartite graphs}
\date{}
\author{Binlong Li\thanks{Department of Applied Mathematics,
Northwestern Polytechnical University, Xi'an, Shaanxi 710072, P.R.
China. Email: [email protected].}~ and Bo
Ning\thanks{Corresponding author. Center for Applied Mathematics,
Tianjin University, Tianjin 300072, P. R. China. Email:
[email protected]}}\maketitle
\begin{center}
\begin{minipage}{130mm}
\small\noindent{\bf Abstract:} In 1962, Erd\H{o}s proved a theorem on
the existence of Hamilton cycles in graphs with given minimum degree and
number of edges. Significantly strengthening in case of balanced bipartite graphs,
Moon and Moser proved a corresponding theorem in 1963. In this paper we establish several
spectral analogues of Moon and Moser's theorem on Hamilton
paths in balanced bipartite graphs and nearly balanced bipartite graphs.
One main ingredient of our proofs is a structural result of its own interest,
involving Hamilton paths in balanced bipartite graphs with given minimum
degree and number of edges.
\noindent{\bf Keywords:} Spectral analogues; Moon-Moser's theorem;
Hamilton path; Balanced bipartite graphs; Nearly
balanced bipartite graphs
\noindent {\bf Mathematics Subject Classification (2010): 05C50, 15A18, 05C38}
\end{minipage}
\end{center}
\section{Introduction}
This is a sequel to our previous paper \cite{LN}. In this paper, we are interested
in establishing tight spectral sufficient conditions for Hamilton paths in balanced bipartite
graphs and nearly balanced bipartite graphs.
Throughout this paper, a bipartite graph with the bipartition $\{X,Y\}$
is called \emph{balanced} if $|X|=|Y|$; and is called \emph{nearly balanced} if
$|X|-|Y|=1$ (by the symmetry). A graph $G$ is called \emph{Hamiltonian} if it contains a
spanning cycle, and is called \emph{traceable} if it contains a spanning path.
The topic of Hamiltonicity of graphs has a long history.
In 1961, Ore \cite{O} proved that
every graph on $n$ vertices has a Hamilton cycle if $e(G)>\binom{n-1}{2}+1$.
One year later, Erd\H{o}s \cite{E} generalized Ore's theorem by introducing the minimum degree
of a graph as a new parameter. More precisely, Erd\H{o}s proved that
\begin{theorem}[Erd\H{o}s \cite{E}]
Let $G$ be a graph on $n$ vertices, with minimum degree $\delta(G)$.
If $n/2>\delta(G)\geq k\geq1$, and
\[
e(G)>\max\left\{\binom{n-k}{2}+k^2,\binom{n-\lfloor\frac{n-1}{2}\rfloor}{2}+\left\lfloor\frac{n-1}{2}\right\rfloor^2\right\},
\]
then $G$ is Hamiltonian.
\end{theorem}
Motivated by Erd\H{o}s' work \cite{E},
Moon and Moser \cite{MM} presented some corresponding results
for balanced bipartite graphs. We state one of their theorems as follows,
which is the starting point of our present paper.
\begin{theorem}[Moon and Moser \cite{MM}]\label{ThMoMo}
Let $G$ be a balanced bipartite graph on $2n$ vertices, with minimum degree
$\delta(G)\geq k$, where $1\leq k\leq n/2$. If
$$e(G)>\max\left\{n(n-k)+k^2,n\left(n-\left\lfloor\frac{n}{2}\right\rfloor\right)+{\left\lfloor\frac{n}{2}\right\rfloor}^2\right\},$$
then $G$ is Hamiltonian.
\end{theorem}
Compared with the number of edges of graphs, eigenvalues of graphs
are also very powerful for describing the structure of graphs. There are
several well known examples, such as the spectral proof of
Friendship Theorem \cite{ERS}. For Hamiltonicity
of graphs, early pioneer work include those of van den Heuvel \cite{H},
Krivelevich and Sudakov \cite{KS}, Butler and Chung \cite{BuC}, etc.
Recently, spectral extremal graph theory has rapidly developed,
where extremal properties of graphs are studied
by means of eigenvalues of associated matrices of graphs.
In this area, many beautiful and deep results have been proved,
such as a spectral Tur\'an theorem \cite{N09JCTB}, a spectral
Erd\H{o}s-Stone-Bollob\'as theorem \cite{N09CPC}, a spectral
version of Zarankiewicz problem \cite{N10_1}, spectral sufficient
conditions for paths and cycles \cite{N10_2,YWZ,ZLG}, etc.
For an excellent survey on recent development of spectral
extremal graph theory, we refer the reader to Nikiforov \cite{N}.
In particular, on the topic of Hamiltonicity, Fielder and Nikiforov \cite{FN}
gave spectral analogues of Ore's theorem \cite{O}. More work in this vein
can be found in Zhou \cite{Z}, Lu, Liu and Tian \cite{LLT},
as well as Liu, Shiu and Xue \cite{LSX}. Towards finding spectral
analogues of Erd\H{o}s' theorem, the first attempt was
made by the second author and Ge \cite{NG}, and finally was
completed by the present authors in \cite{LN}. In the meantime,
the authors obtained some spectral analogues of Moon-Moser's theorem
for Hamilton cycles in balanced bipartite graphs \cite{LN}.
One may look for spectral conditions for Hamilton paths in bipartite graphs.
The situation seems a little more complicated. The main reason is
that every traceable bipartite graph must be balanced, or nearly balanced.
That is, there are two situations for us to explore.
In fact, we need to consider the following two Brualdi-Solheid-Tur\'an-type
problems. Here we use $\widehat{G}$ to denote the \emph{quasi-complement} of
a bipartite graph $G$ with the bipartition $\{X,Y\}$,
i.e., one with vertex set $V(\widehat{G})=V(G)$ and for any $x\in X$
and $y\in Y$, $xy\in E(\widehat{G})$ if and only if $xy\notin E(G)$;
and we use $\rho(G)$ and $q(G)$ to denote the spectral radius and signless Laplacian
spectral radius of $G$, respectively.
\begin{problem}\label{ProbBlBi}
Among all non-traceable balanced bipartite graphs $G$ on $2n$ vertices,
with $\delta(G)\geq k$, determine $\max\rho(G), \min\rho(\widehat{G}),
\max q(G)$ and $\min q(\widehat{G})$,
respectively.
\end{problem}
\begin{problem}\label{ProbNeBlBi}
Among all non-traceable nearly balanced bipartite graphs $G$ on
$2n-1$ vertices, with $\delta(G)\geq k$, determine
$\max\rho(G), \min\rho(\widehat{G}), \max q(G)$ and $\min
q(\widehat{G})$, respectively.
\end{problem}
In this paper, we solve the above problems for graphs of
sufficiently large order. The main theorems and related notation
are given in Section 2.
In order to solve these problems, we need to use several spectral inequalities
and convert the original problems into new ones involving the number of edges.
We also use spectral inequalities to characterize the extremal graphs.
In particular, we prove spectral inequalities to compare the
(signless Laplacian) spectral radii of certain types of graphs.
These are given in Section 3.
The proofs of our main theorems also need detailed structural analysis.
We need to use the closure theory of Hamilton cycles in balanced bipartite
graph due to Bondy and Chvat\'al \cite{BoC}. With the help of this theory, we
need to use an analogous theorem for Hamilton paths in balanced bipartite graphs.
We establish a theorem on the existence of a complete bipartite subgraph with
large order in a balanced bipartite graph with sufficiently many edges.
We also prove a theorem on the existence of Hamilton paths in a balanced
bipartite graph with given number of edges. All these structural
lemmas and proofs are given in Section 4.
In Section 5, we prove our main theorems. Finally, in Section 6,
we conclude the paper with some remarks and problems.
\section{Main theorems}
\subsection{Notation}
To describe all extremal graphs in our coming theorems,
we introduce some terminology and notation.
We use $\mathcal{G}_{m,n}$ to denote the set of bipartite graphs
with partition sets of sizes $m$ and $n$. As usual, $K_{m,n}$ denotes the
complete bipartite graph, and we set
$\varPhi_{m,n}=\widehat{K_{m,n}}$. In this paper, when we mention a
bipartite graph, we always fix its partition sets, e.g.,
$\varPhi_{m,n}$ and $\varPhi_{n,m}$ are considered as different
bipartite graphs, unless $m=n$ (although they are both the empty
graphs of order $m+n$).
Let $G_1,G_2$ be two bipartite graphs, with the bipartition $\{X_1,Y_1\}$
and $\{X_2,Y_2\}$, respectively. We use $G_1\sqcup G_2$ to denote the graph
obtained from $G_1\cup G_2$ by adding all possible edges between
$X_1$ and $Y_2$ and all possible edges between $Y_1$ and $X_2$. We
set
$$B_n^k=K_{k,n-k}\sqcup\varPhi_{n-k,k} \mbox{ and }
\mathcal{B}_n^k=\{H\sqcup\varPhi_{n-k,k}: H\in\mathcal{G}_{k,n-k}\}\
(1\leq k\leq n/2).$$
The graphs $B_n^k$ play a crucial role in the proofs of results in \cite{LN}.
Notice that $B_n^k$ is the graph in $\mathcal{B}_n^k$ with the largest
number of edges. We remark that for any (spanning) subgraph $G$ of $B_n^k$,
$\rho(\widehat{G})=\rho(\widehat{B_n^k})$
($q(\widehat{G})=q(\widehat{B_n^k})$) if and only if
$G\in\mathcal{B}_n^k$.
We define some classes of graphs as follows:
\begin{align*}
\begin{array}{ll}
Q_n^k=K_{k,n-k-1}\sqcup\varPhi_{n-k,k+1} & (0\leq k\leq(n-1)/2), \\
R_n^k=K_{k,k}\cup K_{n-k,n-k} & (1\leq k\leq n/2), \\
S_n^k=K_{k,n-k-1}\sqcup\varPhi_{n-k,k} & (1\leq k\leq(n-1)/2),\\
\mathcal{S}_n^k=\{H\sqcup\varPhi_{k,n-k}: H\in\mathcal{G}_{n-k-1,k}\} & (1\leq k\leq(n-1)/2),\\
T_n^k=K_{k,n-k-1}\sqcup\varPhi_{n-k-1,k+1}& (0\leq k\leq n/2-1),\\
\mathcal{T}_n^k=\{H\sqcup\varPhi_{k+1,n-k-1}:
H\in\mathcal{G}_{n-k-1,k}\} & (0\leq k\leq n/2-1).
\end{array}
\end{align*}
Additionally, let $\varGamma_n^0=K_{n-2,n}\cup K_{1,0}$ and let
\emph{$\L$} be the graph in Fig. 1.
\begin{center}
\begin{picture}(80,60)\label{fi1}
\thicklines \multiput(20,30)(20,0){3}{\put(0,0){\circle*{4}}}
\put(20,30){\line(1,0){40}}
\multiput(40,10)(0,40){2}{\multiput(0,0)(20,0){2}{\circle*{4}}
\put(0,0){\line(1,0){20}}} \put(20,30){\line(1,1){20}}
\put(20,30){\line(1,-1){20}}
\end{picture}
\small Fig. 1. The graph $\emph{\L}$.
\end{center}
Note that $S_n^k$ is the graph in $\mathcal{S}_n^k$ with the largest
number of edges, and $T_n^k$ is the graph in $\mathcal{T}_n^k$ with
the largest number of edges. Similarly, we remark that for any
(spanning) subgraph $G$ of $S_n^k$,
$\rho(\widehat{G})=\rho(\widehat{S_n^k})$
($q(\widehat{G})=q(\widehat{S_n^k})$) if and only if
$G\in\mathcal{S}_n^k$; and for any (spanning) subgraph $G$ of
$T_n^k$, $\rho(\widehat{G})=\rho(\widehat{T_n^k})$
($q(\widehat{G})=q(\widehat{T_n^k})$) if and only if
$G\in\mathcal{T}_n^k$.
\subsection{Main results}
In this subsection, we state all our main theorems. Since we consider
the classes of balanced bipartite graphs and nearly balanced bipartite
graphs, and for each class of graphs, we consider sufficient conditions
in terms of (signless Laplacian) spectral radii of graphs or the complements,
we obtain eight theorems as follows.
For balanced bipartite graphs, we have
\begin{theorem}\label{ThrhoBG}
Let $G$ be a balanced bipartite graph on $2n$ vertices, with minimum
degree $\delta(G)\geq k$, where $k\geq 0$ and $n\geq(k+2)^2$.\\
(1) If $k\neq 1$ and $\rho(G)\geq\rho(Q^k_n)$,
then $G$ is traceable unless $G=Q^k_n$.\\
(2) If $k=1$ and $\rho(G)\geq\rho(R^1_n)$, then $G$ is traceable
unless $G=R^1_n$.
\end{theorem}
\begin{theorem}\label{ThqBG}
Let $G$ be a balanced bipartite graph on $2n$ vertices, with minimum
degree $\delta(G)\geq k$, where $k\geq 0$ and $n\geq(k+2)^2$.
If $q(G)\geq q(Q^k_n)$, then $G$ is traceable unless $G=Q^k_n$.
\end{theorem}
\begin{theorem}\label{ThrhoBGC}
Let $G$ be a balanced bipartite graph on $2n$ vertices, with minimum
degree $\delta(G)\geq k$, where $k\geq 0$ and $n\geq 2k$.\\
(1) If $k\geq 1$ and $\rho(\widehat{G})\leq\rho(\widehat{R^k_n})$,
then $G$ is traceable unless $G=R^k_n$. \\
(2) If $k=0$ and $\rho(\widehat{G})\geq\rho(\widehat{Q^0_n})$, then
$G$ is traceable unless $G=Q_n^0$.
\end{theorem}
\begin{theorem}\label{ThqBGC}
Let $G$ be a balanced bipartite graph on $2n$ vertices. If
$q(\widehat{G})\leq n$, then $G$ is traceable unless $G\in\{R_n^k:
1\leq k\leq\lfloor n/2\rfloor\}$.
\end{theorem}
\begin{remark}
Our Theorem 2.1 generalizes Theorem 2.10 in \cite{LSX} due to Liu et al.
\end{remark}
For nearly balanced bipartite graphs, we have
\begin{theorem}\label{ThrhoNBG}
Let $G$ be a nearly balanced bipartite graph on $2n-1$ vertices, with
minimum degree $\delta(G)\geq k$, where $k\geq 0$ and $n\geq(k+1)^2$.\\
(1) If $k\geq 1$ and $\rho(G)\geq\rho(S^k_n)$, then $G$ is traceable
unless $G=S^k_n$. \\
(2) If $k=0$ and $\rho(G)\geq\rho(T^0_n)$, then $G$ is traceable
unless $G=T_n^0$.
\end{theorem}
\begin{theorem}\label{ThqNBG}
Let $G$ be a nearly balanced bipartite graph on $2n-1$ vertices, with
minimum degree $\delta(G)\geq k$, where $k\geq 0$ and $n\geq(k+1)^2$.\\
(1) If $k\geq 1$ and $q(G)\geq q(S^k_n)$, then $G$ is traceable
unless $G=S^k_n$.\\
(2) If $k=0$ and $q(G)\geq q(S^1_n)$, then $G$ is traceable unless
$G=S_n^1$.
\end{theorem}
\begin{theorem}\label{ThrhoNBGC}
Let $G$ be a nearly balanced bipartite graph on $2n-1$ vertices, with
minimum degree $\delta(G)\geq k$, where $k\geq 0$ and $n\geq 2k+1$. \\
(1) If $k\geq 1$ and $\rho(\widehat{G})\leq\rho(\widehat{S_n^k})$,
then $G$ is traceable unless $G\in\mathcal{S}_n^k$.\\
(2) If $k=0$ and $\rho(\widehat{G})\leq\rho(\widehat{T^0_n})$, then
$G$ is traceable unless $G\in\mathcal{S}_n^1\cup\{T_n^0\}$.
\end{theorem}
\begin{theorem}\label{ThqNBGC}
Let $G$ be a nearly balanced bipartite graph on $2n-1$ vertices. If
$q(\widehat{G})\leq n$, then $G$ is traceable unless
$G\in(\bigcup_{k=1}^{\lfloor
(n-1)/2\rfloor}\mathcal{S}_n^k)\cup(\bigcup_{k=0}^{\lfloor
n/2\rfloor-1}\mathcal{T}_n^k)$, or $n=4$ and $G={\L}$.
\end{theorem}
\section{Spectral inequalities}
We will use the following spectral inequalities for graphs and
bipartite graphs, respectively. The first theorem is a direct
corollary of a result of Nosal \cite{No}. (See also \cite{BFP}.)
\begin{theorem}[Nosal \cite{No}, Bhattacharya, Friedland and Peled \cite{BFP}]\label{ThBhFrPe}
Let $G$ be a bipartite graph. Then
$$\rho(G)\leq \sqrt{e(G)}.$$
\end{theorem}
The next theorem has been proved in \cite{LN}, with the help
of a result due to Feng and Yu \cite[Lemma~2.4]{FY}, which
can be traced back to Merris \cite{M}.
\begin{theorem}[Li and Ning \cite{LN}]\label{ThLiNi5}
Let $G$ be a balanced bipartite graph on $2n$ vertices. Then
$$q(G)\leq \frac{e(G)}{n}+n.$$
\end{theorem}
The following two theorems can be proved similarly as Lemma 2.1 in
\cite{BZ} and Theorem 2 in \cite{AM}, respectively. We omit the proofs.
\begin{theorem}\label{ThMinrhoG}
Let $G$ be a graph with non-empty edge set. Then
$$\rho(G)\geq\min\{\sqrt{d(u)d(v)}: uv\in E(G)\}.$$
Moreover, if $G$ is connected, then equality holds if and only if
$G$ is regular or semi-regular bipartite.
\end{theorem}
\begin{theorem}\label{ThMinqG}
Let $G$ be a graph with non-empty edge set. Then
$$q(G)\geq\min\{d(u)+d(v): uv\in E(G)\}.$$
Moreover, if $G$ is connected, then the equality holds if and only if
$G$ is regular or semi-regular bipartite.
\end{theorem}
\begin{lemma}\label{LeCompare} For $k\geq 1$, $n\geq 2k+1$, we have
\begin{align*}
& \rho(Q_n^k)>\rho(K_{n,n-k-1})=\sqrt{n(n-k-1)}; && \rho(S_n^k)>\rho(K_{n,n-k-1})=\sqrt{n(n-k-1)};\\
& q(Q_n^k)>q(K_{n,n-k-1})=2n-k-1; && q(S_n^k)>q(K_{n,n-k-1})=2n-k-1;\\
& \rho(\widehat{R_n^k})=\rho(K_{k,n-k})=\sqrt{k(n-k)}; && \rho(\widehat{S_n^k})=\rho(K_{n-k,k})=\sqrt{k(n-k)};\\
& q(\widehat{R_n^k})=q(K_{k,n-k})=n; &&
q(\widehat{S_n^k})=q(K_{n-k,k})=q(\widehat{T_n^k})=q(K_{n-k-1,k+1})=n.
\end{align*}
\end{lemma}
\begin{proof}
Since $K_{n,n-k-1}$ is a proper subgraph of $Q_n^k$ or $S_n^k$,
the first four inequalities follow from the Perron-Frobenius Theorem.
The others can be checked easily.
\end{proof}
\begin{lemma}\label{LeQn1Sn1}
(1) For $n\geq 3$,
$\rho(S_n^1)<\rho(Q_n^1)\leq\rho(R_n^1)=\rho(T_n^0)=n-1$, where the second
inequality becomes equality only if $n=3$.\\
(2)~For $n\geq 3$,
$2n-1=q(Q_n^0)>q(Q_n^1)>q(R_n^1)=2n-2$.
\end{lemma}
\begin{proof}
(1) First, note that $S_n^1$ is a proper subgraph of $Q_n^1$. Thus,
$\rho(S_n^1)<\rho(Q_n^1)$.
Next, we show that $\rho(Q_n^1)\leq n-1$. Recall that $Q_n^1=K_{1,n-2}\sqcup\varPhi_{n-1,2}$.
Let $\{X_1,Y_1\}$ be the bipartition of $K_{1,n-2}$, where $|X_1|=1,|Y_1|=n-2$. Let $\{X_2,Y_2\}$
be the bipartition of $\varPhi_{n-1,2}$, where $|X_2|=n-1$, $|Y_2|=2$.
Set $\rho=\rho(Q_n^1)$. Let $X=(x_1,x_2,\ldots,x_n)$ be a positive unit
eigenvector of $Q_n^1$ corresponding to $\rho$.
Since any pair of vertices in the same partite set, say $v_1,v_2$, have the same neighborhood,
we know $x_{v_1}=x_{v_2}$.
Thus, we can assume that
\begin{align*}
& x:=x_v, v\in X_1;\\
& y:=x_v,v\in Y_1;\\
& z:=x_v, v\in X_2;\\
& t:=x_v, v\in Y_2.
\end{align*}
The eigenvalue equations can be reduced to the following four ones:
\begin{align}
&\rho x=(n-2)y+2t,\label{eq1}\\
&\rho y=x+(n-1)z,\label{eq2}\\
&\rho z=(n-2)y,\label{eq3}\\
&\rho t=x\label{eq4}.
\end{align}
Multiplying the two sides of (\ref{eq2}) by $\rho$, and putting (\ref{eq3}) into it, we have
\begin{align*}
{\rho}^2y=\rho x+(n-1)(n-2)y,
\end{align*}
that is,
\begin{align}
[{\rho}^2-(n-1)(n-2)]y=\rho x.\label{eq5}
\end{align}
Similarly, multiplying the two sides of (\ref{eq1}) by $\rho$, and eliminating $t$, we obtain
\begin{align}
({\rho}^2-2)x=(n-2)\rho y.\label{eq6}
\end{align}
Combining (\ref{eq5}) and (\ref{eq6}), and cancelling $xy$ yields
\begin{align}
\rho^4-(n^2-2n+2)\rho^2+2(n-1)(n-2)=0.\label{eq7}
\end{align}
By solving Equation (\ref{eq7}), we obtain
\begin{align*}
\rho^2=\frac{(n^2-2n+2)+\sqrt{(n^2-2n+2)^2-8(n-1)(n-2)}}{2}.
\end{align*}
By simple algebra, we get $\rho^2< (n-1)^2$ when $n\geq 4$ and $\rho=n-1$
when $n=3$.
(2) Since $Q_n^1$ contains $K_{n,n-2}$ as its proper subgraph, from the Perron-Frobenius Theorem,
we can see $q(Q_n^1)>q(K_{n,n-2})=2n-2=q(R_n^1)$. On the other hand, by Theorem \ref{ThLiNi5},
we have
\[
q(Q_n^1)\leq \frac{e(Q_n^1)}{n}+n=\frac{n(n-2)+2}{n}+n=2n-2+\frac{2}{n}<2n-1
\]
when $n\geq 3$. This proves the statement (2).
\end{proof}
\section{Structural lemmas}
In this section, we state some known structural theorems and
prove some new ones.
The first tool we need is the closure theory of Hamilton cycles in
balanced bipartite graphs introduced by Bondy and Chv\'{a}tal \cite{BoC}.
Let $G$ be a balanced bipartite graph on $2n$ vertices. The
\emph{bipartite closure} (or briefly, \emph{B-closure}) of $G$,
denoted by $cl_B(G)$, is the graph obtained from $G$ by recursively
joining pairs of nonadjacent vertices in different partition sets
whose degree sum is at least $n+1$ until no such pair remains. A
balanced bipartite graph $G$ on $2n$ vertices is \emph{B-closed} if
$G=cl_B(G)$, i.e., if every two nonadjacent vertices in distinct
partition sets of $G$ have degree sum at most $n$.
\begin{theorem}[Bondy and Chv\'{a}tal \cite{BoC}]\label{ThBoCh}
A balanced bipartite graph $G$ is Hamiltonian if and only if
$cl_B(G)$ is Hamiltonian.
\end{theorem}
\begin{lemma}\label{LeClosed}\footnote{This result may have appeared in
some early reference, but we could not find any. We include its short proof
here to keep our paper self-contained.}
A balanced bipartite graph $G$ is traceable if and only if $cl_B(G)$
is traceable.
\end{lemma}
\begin{proof}
Clearly $G$ being traceable implies that $cl_B(G)$ being traceable. Now
we assume that $cl_B(G)$ is traceable. If $cl_B(G)$ is Hamiltonian,
then $G$ is Hamiltonian by Theorem \ref{ThBoCh}. Now we assume that
$cl_B(G)$ has a Hamilton path $P$ but no Hamilton cycle. Let $x,y$
be the two end-vertices of $P$. Then $xy\notin E(cl_B(G))$.
Let $G'=G+xy$. Then $cl_B(G)+xy \subseteq cl_B(G')$. Thus, $cl_B(G')$ is Hamiltonian,
and $G'$ is Hamiltonian by Theorem \ref{ThBoCh}. So, $G$ is traceable.
\end{proof}
We need two theorems proved in \cite{LN}.
\begin{theorem}[Li and Ning \cite{LN}]\label{ThLiNi3}
Let $G$ be a B-closed balanced bipartite graph on $2n$ vertices. If
$n\geq 2k+1$ for some $k\geq 1$ and $$e(G)>n(n-k-1)+(k+1)^2,$$ then
$G$ contains a complete bipartite subgraph of order $2n-k$.
Furthermore, if $\delta(G)\geq k$, then $K_{n,n-k}\subseteq G$.
\end{theorem}
\begin{theorem}[Li and Ning \cite{LN}]\label{ThLiNi4}
Let $G$ be a balanced bipartite graph on $2n$ vertices. If
$\delta(G)\geq k\geq 1$, $n\geq 2k+1$ and
$$e(G)>n(n-k-1)+(k+1)^2,$$ then $G$ is Hamiltonian unless $G\subseteq B_n^k$.
\end{theorem}
Using the above two theorems, we prove the following corresponding lemmas
for the existence of Hamilton paths and complete bipartite subgraphs
in balanced bipartite graphs, respectively.
\begin{lemma}\label{LeSubgraph}
Let $G$ be a B-closed balanced bipartite graph on $2n$ vertices. If
$n\geq 2k+3$ for some $k\geq 1$ and $$e(G)>n(n-k-2)+(k+2)^2,$$ then
$G$ contains a complete bipartite subgraph on $2n-k-1$ vertices.
Furthermore, if $\delta(G)\geq k$, then $K_{n,n-k-1}\subseteq G$, or
$k=1$ and $K_{n-1,n-1}\subseteq G$.
\end{lemma}
\begin{proof}
The existence of a complete bipartite subgraph on $2n-k-1$ vertices
can be deduced from Theorem \ref{ThLiNi3}. Let $X,Y$ be the partition sets
of $G$, and $X'\subseteq X$, $Y'\subset Y$ such that $G[X'\cup
Y']=K_{s,t}$, where $s+t\geq 2n-k-1$ and $s\geq t$. We choose $s,t$
such that $s$ is as large as possible.
Now suppose that $\delta(G)\geq k$. If $K_{n,n-k-1}\not\subseteq G$,
then $n-k\leq t\leq s\leq n-1$. Note that every vertex in
$X\backslash X'$ has degree at least $k$ and every vertex in $Y'$
has degree at least $s$. If $s+k\geq n+1$, then every vertex in
$X\backslash X'$ and every vertex in $Y'$ are adjacent, and
$K_{n,n-k}\subseteq G$, a contradiction. This implies that
$s+k\leq n$, i.e., $s\leq n-k$. Hence we have $s=t=n-k$. Recall that
$s+t\geq 2n-k-1$. We have $k=1$ and $s=t=n-1$. Thus
$K_{n-1,n-1}\subseteq G$.
\end{proof}
\begin{lemma}\label{LeTraceable}
Let $G$ be a balanced bipartite graph on $2n$ vertices. If
$\delta(G)\geq k\geq 1$, $n\geq 2k+3$ and
$$e(G)>n(n-k-2)+(k+2)^2,$$ then $G$ is traceable unless $G\subseteq
Q_n^k$, or $k=1$ and $G\subseteq R_n^1$.
\end{lemma}
\begin{proof}
Let $G'=cl_B(G)$. If $G'$ is traceable, then so is $G$ by Lemma
\ref{LeClosed}. Now we assume that $G'$ is not traceable. We first
deal with the case $k=1$. Note that $\delta(G')\geq\delta(G)$ and
$e(G')\geq e(G)$. By Lemma \ref{LeSubgraph}, either
$K_{n,n-2}\subseteq G'$ or $K_{n-1,n-1}\subseteq G'$. Recall that
$\delta(G')\geq 1$. It is easy to check the only
non-traceable balanced bipartite graphs of order $2n$ without
isolated vertices containing $K_{n,n-2}$ or $K_{n-1,n-1}$ are
$Q_n^1$ and $R_n^1$, respectively. Thus $G'=Q_n^1$ or $R_n^1$, and this implies
that $G\subseteq Q_n^1$ or $G\subseteq R_n^1$.
Now assume that $k\geq 2$. By Lemma \ref{LeSubgraph},
$K_{n,n-k-1}\subseteq G'$. Let $t$ be the largest integer such that
$K_{n,t}\subseteq G$. Clearly $n-k-1\leq t<n$. Let $X,Y$ be the
partition sets of $G$, and $Y'\subset Y$ such that $G[X\cup
Y']=K_{n,t}$.
We first claim that $t=n-k-1$. If $t\geq n-k+1$, then every vertex
of $X$ has degree at least $n-k+1$ in $G'$ and every vertex in $Y$
has degree at least $k$ in $G'$, implying that $G'$ is complete
bipartite. Thus $G'$ is traceable, a contradiction. Suppose now that
$t=n-k$. If some vertex in $Y\backslash Y'$ has degree at least
$k+1$ in $G'$, then it will be adjacent to every vertex in $X$ in
$G'$, a contradiction. So we conclude that every vertex in
$Y\backslash Y'$ has degree exactly $k$. If a vertex $x\in X$ is
adjacent to some vertex in $Y\backslash Y'$, then $d_{G'}(x)\geq
n-k+1$ and $x$ will be adjacent to every vertex in $Y\backslash Y'$.
This implies that all the vertices in $Y\backslash Y'$ are adjacent
to $k$ common vertices in $X$, i.e., $G'=B_n^k$. Note that $B_n^k$
is traceable, a contradiction. Thus $t=n-k-1$, as we claimed.
Next we show that every vertex of $Y\backslash Y'$ has degree exactly
$k$. Suppose that there is a vertex $y\in Y\backslash Y'$ which has
degree at least $k+1$ in $G'$. If $d_{G'}(y)\geq k+2$, then since
$d_{G'}(x)\geq n-k-1$ for every $x\in X$, $y$ will be adjacent to
every vertex of $X$, a contradiction. So we have $d_{G'}(y)=k+1$.
Let $X'$ be the set of $n-k-1$ vertices in $X$ nonadjacent to $y$.
Then for every $x\in X'$, $x$ is nonadjacent to any vertex of
$Y\backslash Y'$; otherwise $d_{G'}(x)\geq n-k$, implying that $xy\in
E(G)$. Now consider the subgraph $H=G'[X\backslash X',Y\backslash
Y']$. Note that for every $y'\in Y\backslash Y'$, $d_H(y')\geq k$
and for every $x'\in X\backslash X'$, $d_H(x')\geq 1$. If every
vertex in $X\backslash X'$ has degree at least 2 in $H$, then
$cl_B(H)$ is complete and bipartite, implying that $H$ is traceable; if there
is a vertex, say $x$ in $X\backslash X'$, with degree 1 in $H$,
i.e., $x$ has only one neighbor $y$ in $H$, then $H-\{x,y\}$ is
complete and bipartite, also implying that $H$ is traceable. Note that
$G'[X,Y']$ is complete. So $G'$ is traceable, a contradiction. Thus we
conclude that every vertex of $Y\backslash Y'$ has degree exactly
$k$.
Let $x$ be an arbitrary vertex in $X$. If $x$ is adjacent to at
least two vertices in $Y\backslash Y'$, then $d(x)\geq n-k+1$,
implying that $x$ is adjacent to all vertices in $Y\backslash Y'$. Thus
we conclude that every vertex in $X$ is adjacent to either no
vertices, or only one vertex, or all vertices in $Y\backslash Y'$.
We call the vertex $x$ a \emph{simple} (\emph{frontier}, \emph{saturated}, resp.)
vertex if $x$ is adjacent to no (one, every, resp.) vertex in
$Y\backslash Y'$.
If every vertex in $Y\backslash Y'$ is adjacent to at least two
frontier vertices, then we can take $k+1$ vertex-disjoint $P_3$'s
such that every vertex in $Y\backslash Y'$ is the center of a $P_3$.
Since $G'[X,Y']$ is complete and bipartite, it is easy to check that
$G'$ is traceable, a contradiction. If every vertex in $Y\backslash
Y'$ is adjacent to exactly one frontier vertex, implying that there
are $k-1$ saturated vertices. (Note that every vertex in $Y\backslash
Y'$ is adjacent to the same number of frontier vertices.) In this
case, there are $k-1$ vertex-disjoint $P_3$'s with the centers in
$Y\backslash Y'$ and two additional independent edges incident to
vertices in $Y\backslash Y'$. Since $G'[X,Y']$ is complete and
bipartite, it is easy to check that $G'$ is traceable, a
contradiction.
Now assume that there are no frontier vertices. Thus every vertex
in $Y\backslash Y'$ is adjacent to (the common) $k$ saturated
vertices. In this case $G'=Q_n^k$ and $G\subseteq Q_n^k$.
\end{proof}
Finally, we recall two theorems proved in \cite{LN}.
\begin{theorem}[Li and Ning \cite{LN}]\label{ThLiNi}
Let $G$ be a balanced bipartite graph on $2n$ vertices, with minimum
degree $\delta(G)\geq k\geq 1$. \\
(1) If $n\geq (k+1)^2$ and $\rho(G)\geq\rho(B^k_n)$, then $G$ is
Hamiltonian unless $G=B^k_n$.\\
(2) If $n\geq (k+1)^2$ and $q(G)\geq q(B^k_n)$, then $G$ is
Hamiltonian unless $G=B^k_n$.\\
(3) If $n\geq 2k$ and $\rho(\widehat{G})\leq\rho(\widehat{B^k_n})$,
then $G$ is Hamiltonian unless $G\in\mathcal{B}_n^k$, or $k=2$,
$n=4$ and $G=L_1$ or $L_2$ (see Fig. 2).
\end{theorem}
\begin{center}
\begin{picture}(200,80)
\thicklines
\put(0,0){\multiput(20,30)(20,0){4}{\circle*{4}}
\multiput(20,70)(20,0){4}{\circle*{4}}
\multiput(80,30)(-20,0){3}{\line(0,1){40}}
\put(20,30){\line(1,2){20}} \put(20,30){\line(1,1){40}}
\put(20,30){\line(3,2){60}} \put(20,70){\line(1,-2){20}}
\put(20,70){\line(1,-1){40}} \put(20,70){\line(3,-2){60}}
\put(45,10){$L_1$} }
\put(90,0){\multiput(20,30)(20,0){4}{\circle*{4}}
\multiput(20,70)(20,0){4}{\circle*{4}}
\multiput(80,30)(-20,0){4}{\line(0,1){40}}
\put(20,30){\line(1,2){20}} \put(20,30){\line(1,1){40}}
\put(20,30){\line(3,2){60}} \put(20,70){\line(1,-2){20}}
\put(20,70){\line(1,-1){40}} \put(20,70){\line(3,-2){60}}
\put(45,10){$L_2$} }
\end{picture}
\small Fig. 2. The graphs $L_1$ and $L_2$.
\end{center}
\begin{theorem}[Li and Ning \cite{LN}]\label{ThLiNi'}
Let $G$ be a balanced bipartite graph on $2n$ vertices. If
$q(\widehat{G})\leq n$, then $G$ is Hamiltonian unless
$G\in\bigcup_{k=1}^{\lfloor n/2\rfloor}\mathcal{B}_n^k$, or $n=4$
and $G=L_1$ or $L_2$ (see Fig. 2).
\end{theorem}
\section{Proofs}
In this section, we prove our main theorems.
\noindent\textbf{Proof of Theorem \ref{ThrhoBG}.}
Suppose that $G$ is not traceable. If $k\geq 1$, then by Lemmas
\ref{LeCompare}, \ref{LeQn1Sn1}(1) and Theorem \ref{ThBhFrPe},
$$\sqrt{e(G)}\geq\rho(G)\geq\rho(Q_n^k)>\sqrt{n(n-k-1)}.$$
Thus, we have
\begin{align*}
e(G)>n(n-k-1)\geq n(n-k-2)+(k+2)^2
\end{align*}
when $n\geq(k+2)^2$. Since $n\geq(k+2)^2>2k+3$, by Lemma \ref{LeTraceable}, $G\subseteq
Q_n^k$ or $k=1$ and $G\subseteq R_n^1$. If $k\geq 2$, then
$G\subseteq Q_n^k$. But if $G\varsubsetneq Q_n^k$, then
$\rho(G)<\rho(Q_n^k)$, a contradiction. Thus $G=Q_n^k$. If $k=1$,
then $G\subseteq Q_n^1$ or $G\subseteq R_n^1$. But if $G\subseteq
Q_n^1$ or $G\varsubsetneq R_n^1$, then by Lemma \ref{LeQn1Sn1}(1),
we get $\rho(G)<\rho(R_n^1)$, a contradiction. Thus $G=R_n^1$.
Now assume that $k=0$. If $G$ has no isolated vertex, i.e.,
$\delta(G)\geq 1$, then by the above analysis,
$$\rho(G)\leq\rho(R_n^1)=n-1<\rho(Q_n^0)=\sqrt{n(n-1)},$$
a contradiction. Thus $G$ has an isolated vertex and $G\subseteq
Q_n^0$. But if $G\varsubsetneq Q_n^0$, then $\rho(G)<\rho(Q_n^0)$, a
contradiction. Thus $G=Q_n^0$.
{
$\Box$}
\noindent\textbf{Proof of Theorem \ref{ThqBG}.}
Suppose that $G$ is not traceable. If $k\geq 1$, then by Lemma
\ref{LeCompare} and Theorem \ref{ThLiNi5}, we have
$$\frac{e(G)}{n}+n\geq q(G)\geq q(Q_n^k)>2n-k-1.$$
Thus, we have
\begin{align*}
e(G)>n(n-k-1)\geq n(n-k-2)+(k+2)^2
\end{align*}
when $n\geq(k+2)^2$. By Lemma \ref{LeTraceable}, $G\subseteq
Q_n^k$ or $k=1$ and $G\subseteq R_n^1$. If $k\geq 2$, then
$G\subseteq Q_n^k$. But if $G\varsubsetneq Q_n^k$, then $q(G)<q(Q_n^k)$, a
contradiction. Thus $G=Q_n^k$. If $k=1$, then $G\subseteq Q_n^1$ or
$G\subseteq R_n^1$. But if $G\varsubsetneq Q_n^1$ or $G\subseteq R_n^1$,
then by Lemma \ref{LeQn1Sn1}(2), we obtain $q(G)<q(Q_n^1)$,
a contradiction. Thus $G=Q_n^1$.
Now assume that $k=0$. If $G$ has no isolated vertex, i.e.,
$\delta(G)\geq 1$, then by the analysis above and Lemma \ref{LeQn1Sn1}(2), we obtain
$$q(G)\leq q(Q_n^1)<q(Q_n^0)=2n-1,$$
a contradiction. Thus $G$ has an isolated vertex and $G\subseteq
Q_n^0$. But if $G\varsubsetneq Q_n^0$, then $q(G)<q(Q_n^0)$, a
contradiction. Thus $G=Q_n^0$.
{
$\Box$}
\noindent\textbf{Proof of Theorem \ref{ThrhoBGC}.}
Suppose that $G$ is not traceable. Then $G$ is not hamiltonian. If
$k\geq 1$, then
$$\rho(\widehat{G})\leq\rho(\widehat{R_n^k})=\rho(\widehat{B_n^k})=\sqrt{k(n-k)}.$$ By
Theorem \ref{ThLiNi}, $G\in\mathcal{B}_n^k$, or $k=2$, $n=4$ and
$G=L_1$ or $L_2$. But if $G\in\mathcal{B}_n^k\backslash\{R_n^k\}$,
or $G=L_1$ or $L_2$, then $G$ is traceable, a contradiction. Thus we
conclude $G=R_n^k$.
Now assume that $k=0$. If $G$ has no isolated vertex, i.e.,
$\delta(G)\geq 1$, then by the above analysis,
$$\rho(\widehat{G})\leq\rho(\widehat{R_n^1})=\sqrt{n-1}<\rho(\widehat{Q_n^0})=\sqrt{n},$$
a contradiction. This implies that $G$ has an isolated vertex and
$G\subseteq Q_n^0$. But if $G\varsubsetneq Q_n^0$, then
$\rho(\widehat{G})>\rho(\widehat{Q_n^0})$, a contradiction. Thus
$G=Q_n^0$.
{
$\Box$}
\noindent\textbf{Proof of Theorem \ref{ThqBGC}.}
Suppose that $G$ is not traceable. Then $G$ is not hamiltonian. By
Theorem \ref{ThLiNi'}, $G\in\bigcup_{k=1}^{\lfloor
n/2\rfloor}\mathcal{B}_n^k$, or $n=4$ and $G=L_1$ or $L_2$. But if
$G\in\bigcup_{k=1}^{\lfloor
n/2\rfloor}(\mathcal{B}_n^k\backslash\{R_n^k\})$, or $G=L_1$ or
$L_2$, then $G$ is traceable, a contradiction. Thus we conclude
$G\in\{R_n^k: 1\leq k\leq\lfloor n/2\rfloor\}$.
{
$\Box$}
\noindent\textbf{Proof of Theorem \ref{ThrhoNBG}.}
Let $\{X,Y\}$ be the partition of $V(G)$ such that $|X|=n-1$ and
$|Y|=n$. Let $G'$ be the graph obtained from $G$ by adding one new
vertex $x'$ and connecting $x'$ to every vertex in $Y$ by an edge.
Clearly $G$ is traceable if and only if $G'$ is Hamiltonian.
If $k\geq 1$, then by Lemma \ref{LeCompare} and Theorem
\ref{ThBhFrPe},
$$\sqrt{e(G)}\geq\rho(G)\geq\rho(S_n^k)>\sqrt{n(n-k-1)}.$$
Thus, we have
\begin{align*}
e(G)>n(n-k-1)\geq n(n-k-2)+(k+1)^2
\end{align*}
when $n\geq(k+1)^2$. This implies that $e(G')>n(n-k-1)+(k+1)^2$.
Note that $\delta(G')\geq\delta(G)\geq k$. By Theorem \ref{ThLiNi4},
$G'$ is Hamiltonian or $G'\subseteq B_n^k$. Thus, $G$ is traceable or
$G\subseteq S_n^k$ or $G\subseteq T_n^{k-1}$. But if $G\varsubsetneq
S_n^k$, then $\rho(G)<\rho(S_n^k)$; if $G\subseteq T_n^{k-1}$, then
$\delta(G)\leq k-1$. Thus $G=S_n^k$.
Now assume that $k=0$. If $G$ has no isolated vertex, then
$\delta(G)\geq 1$. If $n=2$, then clearly $G$ is traceable. So we
may assume that $n\geq 3$. By the above analysis, and by Lemma
\ref{LeQn1Sn1}(1),
$$\rho(G)\leq\rho(S_n^1)<\rho(T_n^0)=n-1,$$ a contradiction. This
implies that $G$ has an isolated vertex, and $G\varsubsetneq T_n^0$ or
$G\subseteq\varGamma_n^0$. But if $G\varsubsetneq T_n^0$ or
$G\subseteq\varGamma_n^0$, then $\rho(G)<\rho(T_n^0)$, a
contradiction. Thus $G=T_n^0$.
{
$\Box$}
\noindent\textbf{Proof of Theorem \ref{ThqNBG}.}
Let $G'$ be defined as in the proof of Theorem \ref{ThrhoNBG}. If
$k\geq 1$, then by Lemma \ref{LeCompare} and Theorem \ref{ThLiNi5}, we have
$$\frac{e(G)}{n}+n\geq q(G)>2n-k-1.$$
Note that here we consider $G$ as a balanced bipartite graph having an isolated vertex. Thus
\begin{align*}
e(G)>n(n-k-1)\geq n(n-k-2)+(k+1)^2
\end{align*}
when $n\geq(k+1)^2$. This implies that $e(G')>n(n-k-1)+(k+1)^2$.
Note that $\delta(G')\geq\delta(G)\geq k$. By Theorem \ref{ThLiNi4},
$G'$ is Hamiltonian or $G'\subseteq B_n^k$. Thus $G$ is traceable or
$G\subseteq S_n^k$ or $G\subseteq T_n^{k-1}$. But if $G\varsubsetneq S_n^k$,
then $q(G)<q(S_n^k)$; if $G\subseteq T_n^{k-1}$, then
$\delta(G)\leq k-1$. Thus $G=S_n^k$.
Now assume that $k=0$. If $G$ has an isolated vertex, then
$G\subseteq T_n^0$ or $G\subseteq\varGamma_n^0$. But if $G\varsubsetneq
T_n^0$ or $G\subseteq\varGamma_n^0$, then $q(G)<q(S_n^1)$, a
contradiction. Here notice that $q(T_n^0)=q(\varGamma_n^0)=2n-2$,
and $K_{n,n-2}\varsubsetneq S_n^1$. So we assume that
$G$ has no isolated vertex, i.e., $\delta(G)\geq 1$. By the above
analysis, $G$ is traceable unless $G=S_n^1$.
{
$\Box$}
\noindent\textbf{Proof of Theorem \ref{ThrhoNBGC}.}
We suppose first that $k\geq 1$. Let $G'$ be defined as in the proof
of Theorem \ref{ThrhoNBG}. Note that $\delta(G')\geq\delta(G)\geq k$
and
$\rho(\widehat{G'})=\rho(\widehat{G})\leq\rho(\widehat{S_n^k})=\rho(\widehat{B_n^k})$.
By Theorem \ref{ThLiNi}, $G'$ is Hamiltonian unless
$G'\in\mathcal{B}_n^k$, or $k=2$, $n=4$ and $G'=L_1$ or $L_2$. Thus
$G$ is traceable unless $G\in\mathcal{S}_n^k$ or
$G\in\mathcal{T}_n^{k-1}$, or $n=4$, $k=2$ and $G=\emph{\L}$. But if
$G\in\mathcal{T}_n^{k-1}$, or $n=4$, $k=2$ and $G=\emph{\L}$, then
$\delta(G)\leq k-1$, a contradiction. Thus $G\in\mathcal{S}_n^k$.
Now assume that $k=0$. Then
$\rho(\widehat{G})\leq\rho(\widehat{T_n^0})=\rho(\widehat{S_n^1})$.
If $G$ has no isolated vertex, then $\delta(G)\geq 1$ and by the
above analysis, $G$ is traceable unless $G\in\mathcal{S}_n^1$. If
$G$ has an isolated vertex, then $G\subseteq\varGamma_n^0$ or
$G\subseteq T_n^0$. But if $G\subseteq\varGamma_n^0$ or $G\varsubsetneq
T_n^0$, then $\rho(\widehat{G})>\rho(\widehat{T_n^0})$, a contradiction. Thus
$G\in\mathcal{S}_n^1\cup\{T_n^0\}$.
{
$\Box$}
\vskip\baselineskip\noindent\textbf{Proof of Theorem \ref{ThqNBGC}.}
Let $G'$ be defined as in the proof of Theorem \ref{ThrhoNBG}. Note
that $\delta(G')\geq\delta(G)\geq k$,
$q(\widehat{G'})=q(\widehat{G})\leq n$. By Theorem \ref{ThLiNi'},
$G'$ is Hamiltonian unless $G'\in\bigcup_{k=1}^{\lfloor
n/2\rfloor}\mathcal{B}_n^k$, or $n=4$ and $G'=L_1$ or $L_2$. Thus
$G$ is traceable unless $G\in(\bigcup_{k=1}^{\lfloor
(n-1)/2\rfloor}\mathcal{S}_n^k)\cup(\bigcup_{k=0}^{\lfloor
n/2\rfloor-1}\mathcal{T}_n^k)$, or $n=4$ and $G=\emph{\L}$. The
proof is complete.
{
$\Box$}
\section{Concluding remarks}
In fact, during our proofs of main theorems, we have actually proved the following theorems.
All these results maybe stimulate our further study.
\begin{theorem}\label{Th6.1}
Let $G$ be a balanced bipartite graph on $2n$ vertices, with minimum
degree $\delta(G)\geq k$, where $k\geq 1$ and $n\geq(k+2)^2$.
If $\rho(G)\geq\sqrt{n(n-k-1)}$,
then $G$ is traceable unless $G\subseteq
Q_n^k$ or $k=1$ and $G\subseteq R_n^1$.
\end{theorem}
\begin{theorem}\label{Th6.2}
Let $G$ be a balanced bipartite graph on $2n$ vertices, with minimum
degree $\delta(G)\geq k$, where $k\geq 1$ and $n\geq(k+2)^2$.
If $q(G)\geq 2n-k-1$, then
$G$ is traceable unless $G\subseteq
Q_n^k$ or $k=1$ and $G\subseteq R_n^1$.
\end{theorem}
\begin{theorem}\label{Th6.3}
Let $G$ be a nearly balanced bipartite graph on $2n-1$ vertices, with
minimum degree $\delta(G)\geq k$, where $k\geq 1$ and $n\geq(k+1)^2$.
If $\rho(G)\geq\sqrt{n(n-k-1)}$, then $G$ is traceable unless
$G\subseteq S_n^k$.
\end{theorem}
\begin{theorem}\label{Th6.4}
Let $G$ be a nearly balanced bipartite graph on $2n-1$ vertices, with
minimum degree $\delta(G)\geq k$, where $k\geq 1$ and $n\geq(k+1)^2$.
If $q(G)\geq 2n-k-1$, then $G$ is traceable unless
$G\subseteq S_n^k$.
\end{theorem}
On the other hand, notice that in Theorem \ref{ThMoMo}, the order of a graph is required to be
linear multiple of the minimum degree of a graph. But in our Theorems \ref{ThrhoBG},
\ref{ThqBG}, \ref{ThrhoNBG} and \ref{ThqNBG}, the order of a graph is required
to be at least square multiple of minimum degree of a graph. It is natural
to ask whether the required order could be improved to linear multiple of minimum degree
of the graph. Till now, we cannot solve this problem.
\section*{Acknowledgment}
B.-L. Li was supported by the National Natural Science Foundation of China (No.\ 11601429).
B. Ning was supported by the National Natural Science Foundation of China (No.\ 11601379).
The authors are very grateful to the referee whose suggestions largely
improve the presentation of this paper.
\end{document} | math |
Body Positivity: সৌন্দর্য কমে না, বরং বাড়ে! নিজের গোঁফ নিয়ে আত্মবিশ্বাসী কেরলের তরুণী মৌচাক ছবির পাগলাগারদ কোথায় আছে নেই বুঝি তা জানা গানটি মনে পড়ে? লক্ষ ব্লেডে কামালেও গোঁফ আর দাড়ি গজাবে না, এই যুক্তি দেখিয়ে সে দিন ভাই রঞ্জিত মল্লিককে জিতিয়ে দিয়েছিলেন উত্তমকুমার কিন্তু নারীরাও যে স্বচ্ছন্দে গোঁফে তা দিতে পারেন, তা চোখে আঙুল দিয়ে দেখিয়ে দিলেন কেরলের এক তরুণী কেরলের কন্নুর জেলার বাসিন্দা ওই তরুণীর নাম শয়জা সংবাদ সংস্থাকে বছর ৩৫এর শয়জা জানিয়েছেন, অনেক দিন থেকেই হালকা গোঁফের রেখা দেখা যেত তাঁর মুখে কিন্তু বছর পাঁচেক আগে সেই রেখা ক্রমশই পুরু হয়ে থাকে অন্যরা ভ্রু কুঁচকালেও শুরু থেকেই নিজের গোঁফ দারুণ পছন্দ হয়ে যায় তাঁর সিদ্ধান্ত নেন, কোনও মতেই গোঁফ কাটবেন না তিনি শয়জা জানিয়েছেন, তিনি তাঁর গোঁফকে এতই ভালবাসেন যে, কোভিডের সময় মাস্ক পরার প্রচলন হওয়ার বিমর্ষ হয়ে পড়েছিলেন তিনি মাস্ক পরলে গোঁফ ঢাকা পড়ে যাবে এই ভেবে বড়ই বেদনাহত হন তিনি তবে নিজের গোঁফকে ভালবাসলেও গোঁফ রাখার লড়াইটা সহজ ছিল না শয়জার লোকের টিটকিরিও শুনতে হয়েছে, এসেছে গোঁফ কামিয়ে ফেলার পরামর্শও তবু দমেননি তিনি তাঁর সাফ কথা, এই গোঁফ তার আত্মপরিচয়েরই অঙ্গ পাশাপাশি দীর্ঘ দিন ধরেই নানা অসুখে ভুগেছেন তিনি বিভিন্ন রোগে ইতিমধ্যেই ছয়টি অস্ত্রোপচার হয়ে গিয়েছে তাঁর বিভিন্ন রোগকে হারিয়ে ফিরে আসাই তাঁর বেঁচে থাকার অনুপ্রেরণা তাই নিজের জীবন নিজের মতো করে বাঁচতে চান বলেই জানিয়েছেন শায়জা | bengali |
NEEPCO Recruitment 2022 : पावर कंपनी में आईटीआई पास के लिए अपरेंटिस का माैका NEEPCO Recruitment 2022 : नॉर्थ ईस्टर्न इलेक्ट्रिक पावर कॉर्पोरेशन लिमिटेड ने ट्रेड अपरेंटिस की भर्ती निकाली है. इसके तहत इलेक्ट्रिशियन, फिटर, प्लंबर, इलेक्ट्रीशियन जैसे पदों पर अपरेंटिस का मौका है. इसके तहत कुल 56 वैकेंसी है. अपरेंटिस भर्ती के लिए पहले एनएपीएस के पोर्टल www.apprenticeshipindia.gov.in पर जाकर एनरोलमेंट करना होगा. इसके बाद आवेदन फॉर्म भरकर neepco.apprentices21gmail.com पर जाकर मेल करना है. आवेदन फॉर्म के साथ आईटीआई सर्टिफिकेट, आयु प्रमाण पत्र, जाति प्रमाण पत्र आदि भी भेजना है. इस भर्ती के लिए आवेदन की अंतिम तिथि 24 फरवरी 2022 है.वैकेंसी का डिटेलअसम गैस बेस्ड पावर स्टेशन, बोकुलोनी डिब्रूगढ़इलेक्ट्रिशियन 8फिटर 6प्लंबर 1अगरतला गैस बेस्ड पावर स्टेशनइलेक्ट्रिशियन 8फिटर 4इलेक्ट्रिशियन 8फिटर 4प्लंबर 1डोयांग हाइड्रो पावर स्टेशनइलेक्ट्रिशियन1फिटर 1कामेंग हाइड्रो पावर स्टेशनइलेक्ट्रिशियन 2फिटर 1प्लंबर 1कोपिली हाइड्रो पावर स्टेशनइलेक्ट्रिशियन 5फिटर 3प्लंबर 1एनईईपीसीओ कॉर्पोरेट ऑफिसइलेक्ट्रिशियन 3त्रिपुरा गैस बेस्ड पावर स्टेशनइलेक्ट्रिशियन 5फिटर 5कितना मिलेगा स्टाइपेंडट्रेड अपरेंटिस के रूप में भर्ती होने के बाद हर महीने 14877 रुपये स्टाइपेंड मिलेगा.आयु सीमाट्रेड अपरेंटिस के लिए आयु कम से कम 18 साल और अधिकतम 28 साल होनी चाहिए. आरक्षित वर्ग के उम्मीदवारों को अधिकतम आयु सीमा में छूट मिलेगा.आवश्यक शैक्षिक योग्यताउम्मीदवार का 10वीं पास होने के साथ संबंधित ट्रेड में आईटीआई भी किया होना चाहिए.यहां क्लिक करके नोटिस देखें पढ़ें | hindi |
నీ థైస్ చూపెట్టవా ప్లీజ్.. లైవ్లో హీరోయిన్ సోనాక్షికి వేధింపులు.. ఆ తరువాత ఏం జరిగిందంటే ? Sonakshi Sinha hilarious reply to a fan who asked to show thighs and bikini photographs బాలీవుడ్ షాట్ గన్ గా పేరుపొందిన సీనియర్ స్టార్ హీరో శత్రుఘ్న సిన్హా కూతురు సోనాక్షి సిన్హా బోల్డ్ నెస్ గురించి ప్రత్యేకంగా చెప్పాల్సిన అవసరం లేదు. హీరోలకి దీటుగా ఫైట్స్, పర్ఫార్మెన్స్ చేస్తూ రీల్ లో డేరింగ్ గా కనిపించే సోనాక్షి రియల్ లైఫ్ లోను డేర్ డ్యాషింగ్ గా ఉంటారు. దబంగ్ అంటే ధైర్యశాలి అని అర్ధం. అయితే సల్మాన్ ఖాన్ నటించిన దబంగ్ మూవీతోనే బాలీవుడ్ ఎంట్రీ ఇచ్చిన సోనాక్షి లేటెస్ట్ గా అభిమానులతో లైవ్ సెషన్ నిర్వహించింది. ఆ సమయంలో తనతో అసభ్యకర చాటింగ్ చేసిన నెటిజన్స్ కే దబంగ్ ఆన్సర్లు ఇచ్చి వావ్ అనిపించింది సోనాక్షి. సోషల్మీడియా వాడకం పెరిగిన తర్వాత నటీనటులపై అసభ్యంగా కామెంట్స్ ఎక్కువైపోతోంది. ముఖ్యంగా సినీ నటులకి అయితే ఈ అవమానాలు మరి ఎక్కువైపోతున్నాయి. రోజు ఎవరో ఒక సెలబ్రెటీ నెటిజన్స్ చేతిలో అవమానపడుతుంటారు. అయితే ఈ ట్రెండ్ కి డిఫరెంట్ గా తనతో అసభ్య రీతిలో మాట్లాడిన నెటిజన్ కి కూల్ గా ఆన్సర్ ఇచ్చిన సోనాక్షి చాటింగ్ ఇప్పుడు సోషల్ మీడియాలో వైరల్ అవుతుంది. తాజాగా ఇన్స్టాగ్రామ్లో లైవ్ ఛాట్లో చాలా మంది అభిమానులకి తన ఫ్యూచర్ ప్రాజెక్ట్స్, సినిమాల గురించి వివరిస్తుంటే ఒక నెటిజన్ నుండి ఊహించని ప్రశ్న ఎదురైంది. అందరు మంచి ప్రశ్నలే అడిగినా కొందరు మాత్రం కొన్ని అసభ్యకర కామెంట్స్ చేశారు. ఓ వ్యక్తి అయితే.. బికినీ ఫోటో పోస్ట్ చేయండి సోనాక్షి అంటూ కామెంట్ చేశాడు. దీంతో ఎక్కడ బెదిరిపోకుండా దీనిపై సోనాక్షి సెటైరికల్గా స్పందించింది. ఆన్లైన్ నుంచి ఓ బికినీ ఫోటో తీసి ఆమె పోస్ట్ చేసింది. ఆ తర్వాత మరో వ్యక్తి ఇంకో మరో అసభ్యకర కామెంట్ చేశాడు. సోనాక్షి నీ థైస్తోడలు చూపించు, చాల బాగుంటాయి అంటూ పోస్ట్ చేశాడు. దానికి కూడా ఆమె కుదరదు బాబు అంటూ జవాబు ఇచ్చింది. ఇక నెటిజన్స్ తుంటరి ప్రశ్నలకి ఇచ్చిన కూల్ ఆన్సర్స్ కి సోనాక్షి పై సోషల్ మీడియాలో ప్రశంసలు వస్తున్నాయి. తండ్రికి తాగగ దబంగ్ బేటి అంటూ కామెంట్స్ పెడుతున్నారు నెటిజన్స్. The post నీ థైస్ చూపెట్టవా ప్లీజ్.. లైవ్లో హీరోయిన్ సోనాక్షికి వేధింపులు.. ఆ తరువాత ఏం జరిగిందంటే ? first appeared on TNews Telugu. | telegu |
વેરાવળમાં વયના 80 વર્ષ અને લગ્નના 50 વર્ષ પૂરા કરનાર સિનિયર સીટીઝનું સન્માન સિનિયર સીટીઝન ચેરીટેબલ ટ્રસ્ટની સાધારણ સભા અને હાસ્ય દરબાર કાર્યક્રમ યોજાયો વેરાવળ તા.23 વેરાવળમાં સિનિયર સિટીઝન ચેરીટેબલ ટ્રસ્ટની સાધારણ સભા અને હાસ્ય દરબાર કાર્યક્રમ યોજાયેલ જેમાં 80 વર્ષ પૂર્ણ કરેલા સભ્યો તથા લગ્ન જીવનના 50 વર્ષ પૂર્ણ કરેલા દંપતિઓનુ પણ સન્માન કરવામાં આવ્યું હતું. વેરાવળ ખાતે સિનિયર સિટીઝન ચેરીટેબલ ટ્રસ્ટની સાધારણ સભાની શરૂઆત દિપ પ્રાગટયથી કરવામાં આવેલ ત્યારબાદ સ્વાગત પ્રવચન પ્રમુખ શ્યામભાઇ નાથાણીએ કરેલ અને વાર્ષિક અહેવાલ માનદમંત્રી દિપકભાઇ ટીલાવત દ્વારા રજુ કરાયેલ અને વાર્ષિક હિસાબો ટ્રેઝરર બિપીનભાઇ શાહે રજુ કરેલ હતા. આ કાર્યક્રમમાં ઉપસ્થિત 80 વર્ષ પૂર્ણ કરેલા સભ્યો તથા લગ્ન જીવનના 50 વર્ષ પૂર્ણ કરેલા દંપતિઓનુ પણ સન્માન કરવામાં આવ્યું હતું. આ પ્રસંગે ટ્રસ્ટીઓ અને કમિટી સભ્યો સર્વ જીતેન્દ્ર મહેતા ઉપપ્રમુખ, મધુસૂદન નાયક ઉપપ્રમુખ, અનિલભાઇ એમ.પુરોહિત જો.ટ્રેઝરર, બીપીનભાઇ સંઘવી, નવિનભાઇ ભીંડોરા, દિનેશભાઇ મોદી, શૈલેષભાઇ શેઠ, અનિલભાઇ જી.પુરોહિત, વાય.આર.મહેતા તથા અરૂણભાઇ પુરોહિત સક્રિય રીતે જોડાયા હતા. આ કાર્યક્રમમાં રાજકોટના હાસ્ય કલાકાર ચંદ્રેશ ગઢવી દ્વારા હાસ્ય દરબાર રજુ થયેલ જેને સભ્યોએ ખુબ આનંદ અને હર્ષોલ્લાસથી માણ્યો હતો. આ કાર્યક્રમનું સંચાલન કિરીટ ઉનડકટ અને શૈલેષ શેઠ દ્વારા કરવામાં આવેલ જ્યારે આભાર દર્શન ટ્રેઝરર અનિલભાઇ એમ. પુરોહિત દ્વારા કરવામાં આવેલ હોવાનું એક યાદીમાં જણાવેલ છે. The post વેરાવળમાં વયના 80 વર્ષ અને લગ્નના 50 વર્ષ પૂરા કરનાર સિનિયર સીટીઝનું સન્માન appeared first on Jai Hind. | gujurati |
કર્ક, 25 ફેબ્રુઆરી 2022 ગણેશજી કહે છે કે પ્રતિકૂળતાઓ વચ્ચે પણ આ૫ ખંતપૂર્વક કામ કરશો તો આગળ વધવાની તક છે. આરોગ્યમાં વિશેષ કરીને પેટના દર્દોથી ૫રેશાની થાય. વિદ્યાર્થીઓને વિદ્યાભ્યાસમાં સફળતા મળશે. ૫રંતુ મધ્યાહન બાદ ૫રિસ્થિતિ વધારે અનુકુળ બનશે. તંદુરસ્તી સુધરે અને માનસિક રીતે પણ આ૫ સ્વસ્થ બનશો. ઓફિસમાં સહકારભર્યો માહોલ હશે. અધૂરા કાર્યો પૂરા થશે. પ્રતિસ્પર્ધીઓ ૫ર વિજય મેળવી શકશો. | gujurati |
सड़क हादसों में महिला समेत दो की मौत, पुलिस जांच में जुटी एटा. निधौलीकलां थाना क्षेत्र के अन्तर्गत ग्राम रामनगर निवासी यषपाल सिंह का 23 वर्षीय पुत्र प्रदीप कुमार खेत पर आवारा पषुओं से फसल की रखवाली करने जा रहा था. बुधवार की रात 9 बजे गांव के समीप ही अज्ञात वाहन ने टक्कर मार दी. हादसे में घायल हुए युवक की मौत हो गई. पुलिस ने शव को कब्जे में कर कानूनी कार्रवाई की है. दूसरी घटना जसरथपुर थाना क्षेत्र के ग्राम नगला अचल की बताई गई है. बताते हैं कि नगला अचल निवासी रोषनलाल की 50 वर्षीय पत्नी लौंगश्री षौचकर बुधवार की रात घर लौट रही थी, इसी दौरान तेज रफ्तार अज्ञात वाहन ने उसको रौंद दिया. महिला को उपचार के लिए स्वास्थ्य केन्द्र में दाखिल कराया गया, लेकिन उसकी मौत हो गई. कोतवाली देहात थाना क्षेत्र के अन्तर्गत ग्राम जिरसिमी निवासी मोहनलाल की 9 वर्षीय बेटी मानवी को ट्रक ने उस समय चपेट में ले लिया, जब वह रोडवेज बस की खिड़िकी से मुंह बाहर निकालकर पलटी कर रही थी. उसके सिर में गंभीर चोट आने वह बेहोश हो गई. उसकी मां मधू ने जिला अस्पताल में भर्ती कराई, डाक्टर ने अन्यंत्र रेफर किया है. फांसी पर लटकी मिली विवाहिता, दहेज हत्या का आरोप एटा. जलेसर थाना क्षेत्र के ग्राम देवकरन निवासी सोरन सिंह ने अपनी 22 वर्षीय बेटी साधना की शादी ढाई साल पहले इसी थाना क्षेत्र के गांव कलवारी निवासी वीरेष कुमार के साथ की थी. शादी के कुछ समय बाद से ही ससुराल पक्ष के लोगों ने पुत्री के साथ मारपीट कर प्रताड़ित करना षुरू कर दिया. इसी मध्य वीरेष के संसर्ग से साधना मां बनी, लेकिन आरोपितों ने उसे प्रताड़ित करना बंद नहीं किया. आरोप है कि बुधवार की देर रात साधना की हत्या कर षव फांसी के फंदे लटका दिया है. सूचना पर पहुंचे मायका पक्ष एवं मौके पर पहुंची जलेसर पुलिस ने विवाहिता के षव को पोस्टमार्टम के लिए भेज दिया. विवाहिता के पिता ने कोतवाली में तहरीर दी है. | hindi |
لاہورویب ڈیسک معروف پاکستانی رٹسٹ جمیل نقش انتقال کرگئے معروف پاکستانی رٹسٹ جمیل نقش لندن میں 80 سال کی عمر میں انتقال کرگئے بھارتی ریاست اترپردیش کے شہر کیرانہ میں پیدا ہونے والے رٹسٹ جمیل نقش نے پاکستان منتقل ہونے کے بعد نیشنل کالج رٹس میں داخلہ لیا جہاں انہوں نے استاد حاجی شریف سے منی ایچر مصوری کی تربیت لیجمیل نقش نے کئی کیلی گرافی کے شاہکارتخلیق کیے اورمتعدد کتابوں کے سرورق بنائے جمیل نقش کی مصوری کی خاص بات عورت اورکبوترکا استعارہ تھا انہوں نے اسلامی خطاطی میں بھی اپنا جداگانہ اسلوب وضع کیاجمیل نقش کی خدمات کے اعتراف میں حکومت پاکستان نے 1989 میں صدارتی تمغہ برائے حسن کارکردگی سے جب کہ 2009 میں انہیں ستارہ امتیاز سے نوازا گیا | urdu |
18 ఏళ్లు నిండిన అందరికీ టీకా: కలెక్టర్ విశాఖపట్నం, న్యూస్టుడే: జిల్లాలో 18 నుంచి 44 ఏళ్ల మధ్య వయసు ఉన్న వారందరికీ టీకా పూర్తి చేసే ప్రక్రియను త్వరలో ఆరంభించనున్నామని కలెక్టర్ ఎ.మల్లికార్జున తెలిపారు.అన్ని కోవిడ్ అప్డేట్స్ గురించి తెలుసుకునేందుకు ఇక్కడ చదవండి కలెక్టరేట్లో గురువారం మధ్యాహ్నం ఆయన మీడియాతో మాట్లాడారు. జిల్లాలో ఇప్పటివరకు 27 లక్షల మంది వ్యాక్సిన్ తీసుకున్నారని, 45 ఏళ్లు పైబడిన వారిలో 90 శాతం మందికి టీకా వేయడం పూర్తయినందున, 18 నుంచి 44 ఏళ్ల లోపు వారికి టీకా ప్రక్రియను ప్రారంభించాలని ప్రభుత్వం నిర్ణయించినందున జిల్లాలో త్వరలో ఈ కార్యక్రమం చేపడతామన్నారు. తాను కలెక్టర్గా బాధ్యతలు చేపట్టిన రోజుకు 71 శాతం వ్యాక్సినేషన్ పూర్తి అయిందని, ప్రస్తుతం దాన్ని 90 శాతానికి చేర్చామన్నారు. జిల్లా వ్యాప్తంగా 155 కేంద్రాల్లో టీకా వేస్తున్నట్లు చెప్పారు. మూడో దశ కొవిడ్ను దృష్టిలో ఉంచుకొని అవసరమైన ముందస్తు ఏర్పాట్లు జరుగుతున్నాయని చెప్పారు. ఆసుపత్రుల్లో ఆక్సిజన్ సరఫరా వ్యవస్థను బలోపేతం చేస్తున్నామని, పాడేరు, అరకులో పీఎస్ఏ యూనిట్లు ఏర్పాటు దాదాపు పూర్తియిందన్నారు. మూడో దశలో పిల్లలకు కరోనా వచ్చే అవకాశాలున్నాయని నిపుణులు చెబుతున్నందున 800 పడకలను పిల్లల కోసం సిద్ధం చేస్తున్నట్లు చెప్పారు. వీటిలో 300 పడకలు ఐసీయూలో, 8 వెంటిలేటర్లు, అవసరమైన వైద్య పరికరాలు, ఔషధాలను సిద్ధం చేస్తున్నామన్నారు. నర్సులు, నాలుగో తరగతి ఉద్యోగుల నియామకాలను పూర్తి చేశామన్నారు. 110 మంది పిల్లల వైద్యుల అవసరం కాగా 15 మందే ముందుకు వచ్చారని కలెక్టర్ వివరించారు. 24 గంటల్లో 109 కొవిడ్ కేసులు జిల్లా వ్యాప్తంగా బుధవారం ఉదయం నుంచి గురువారం ఉదయం వరకు 109 కొవిడ్ కేసులు నమోదయ్యాయని ఏఎంసీ ప్రిన్సిపల్ డాక్టర్ పీవీ సుధాకర్ తెలిపారు. తాజా కేసులతో బాధితుల సంఖ్య 1,54,584కు చేరిందన్నారు. గత 24 గంటల వ్యవధిలో 55 మంది కోలుకున్నారని, వీరి సంఖ్య 1,52,214కు చేరిందన్నారు. ఒకరు మృతి చెందడంతో మృతుల సంఖ్య 1,068కు పెరిగాయన్నారు. ప్రస్తుతం 1,302 మంది ఆసుపత్రులు, ఇళ్లలో చికిత్స పొందుతున్నారన్నారు. మన్యంలో 11.. పాడేరు: మన్యంలో 11 కరోనా పాజిటివ్ కేసులు నమోదయ్యాయని ఏడీఎంహెచ్వో లీలాప్రసాద్ గురువారం తెలిపారు. ఇప్పటి వరకు 88,100 మందికి పరీక్షలు నిర్వహించగా 5,859 మందికి పాజిటివ్గా తేలిందన్నారు. 5,736 మంది కోలుకుని ఇళ్లకు వెళ్లగా.. 32 యాక్టివ్ కేసులు ఉన్నాయన్నారు. వీటీఎం కిట్లు 30,500, యాంటిజన్ కిట్లు 4,950 అందుబాటులో ఉన్నట్లు పేర్కొన్నారు. | telegu |
ಓಲಂಪಿಕ್ ಜಾವೆಲಿನ್ ಪಟುಗಳಿಗೆ ಕಾಶಿನಾಥ ನಾಯ್ಕರಿಂದ ತರಬೇತಿ ಶಿರಸಿ: ಭುವನದ ಬೆಡಗು ಒಲಂಪಿಕ್ಗೆ ದೂರದ ಟೋಕಿಯೊದಲ್ಲಿ ವೇದಿಕೆ ಸಿದ್ಧಗೊಳ್ಳುತ್ತಿದೆ. ಚಿನ್ನದ ಪದಕಕ್ಕೆ ಕೊರಳೊಡ್ಡಲು ಸಿದ್ಧರಾಗಿ, ದೇಶ ಪ್ರತಿನಿಧಿಸುವ ಜಾವೆಲಿನ್ ಪಟುಗಳಿಗೆ ಜಿಲ್ಲೆಯ ಕುವರನೊಬ್ಬ ಕಠಿಣ ತರಬೇತಿ ನೀಡುತ್ತಿದ್ದಾರೆ. ಭಾರತೀಯ ಸೇನೆಯಲ್ಲಿ ಸುಭೇದಾರ್ ಹುದ್ದೆಯಲ್ಲಿರುವ, ಪ್ರಸ್ತುತ ಪುಣೆಯ ಆರ್ಮಿ ಸ್ಪೋರ್ಟ್ಸ್ ಇನ್ಸ್ಟಿಟ್ಯೂಟ್ನಲ್ಲಿ ತರಬೇತುದಾರರಾಗಿರುವ ಬೆಂಗಳೆ ಗ್ರಾಮದ ಕಾಶಿನಾಥ ನಾಯ್ಕ ಒಲಂಪಿಕ್ನಲ್ಲಿ ಪಾಲ್ಗೊಳ್ಳುತ್ತಿರುವ ಶಿವಪಾಲ್ ಮತ್ತು ಅನುರಾಣಿಗೆ ಜಾವೆಲಿನ್ ಕಲಿಸಿದ ಗುರುವಾಗಿದ್ದಾರೆ. ಈ ಒಲಂಪಿಕ್ನ ಜಾವೆಲಿನ್ ಎಸೆತ ಸ್ಪರ್ಧೆಯಲ್ಲಿ ಭಾರತವನ್ನು ಮೂವರು ಕ್ರೀಡಾಪಟುಗಳು ಪ್ರತಿನಿಧಿಸಲಿದ್ದಾರೆ. ಈ ಪೈಕಿ ನೀರಜ್ ಛೋಪ್ರಾ ಸ್ವೀಡನ್ನಲ್ಲಿ ತರಬೇತಿ ಪಡೆದುಕೊಳ್ಳುತ್ತಿದ್ದಾರೆ. ಉತ್ತರಪ್ರದೇಶ ಮೂಲದ ಅನುರಾಣಿ, ಶಿವಪಾಲ್ ಅವರನ್ನು ಸ್ಪರ್ಧೆಗೆ ಅಣಿಗೊಳಿಸುವ ಜವಾಬ್ದಾರಿ ಕಾಶಿನಾಥ ಹೆಗಲೇರಿದೆ. ವಿದೇಶಿ ತರಬೇತುದಾರರೊಬ್ಬರು ಜತೆಗಿದ್ದಾರೆ. 23 ವರ್ಷದಿಂದ ಸೈನ್ಯದಲ್ಲಿ ಸೇವೆಯಲ್ಲಿರುವ ಕಾಶಿನಾಥ 2010ರ ನವದೆಹಲಿಯ ಕಾಮನ್ವೆಲ್ತ್ ಗೇಮ್ಸ್ನಲ್ಲಿ ಜಾವೆಲಿನ್ ಎಸೆತದಲ್ಲಿ ಕಂಚಿನ ಪದಕ ಗಳಿಸಿದ್ದರು. 2013ರಿಂದ ಅಂತರರಾಷ್ಟ್ರೀಯ ಮಟ್ಟದ ಸ್ಪರ್ಧೆಯಲ್ಲಿ ದೇಶ ಪ್ರತಿನಿಧಿಸುವ ಕ್ರೀಡಾಪಟುಗಳಿಗೆ ತರಬೇತಿ ನೀಡುತ್ತಿದ್ದಾರೆ. ಈವರೆಗೆ ನೂರಾರು ಜನರಿಗೆ ತರಬೇತಿ ನೀಡಿ, ಸಾಧನೆ ತೋರುವಲ್ಲಿ ಇವರ ಪಾತ್ರ ಮಹತ್ವದ್ದಿದೆ. ವಿಶ್ವ ಚಾಂಪಿಯನ್ಶಿಪ್, ಏಷಿಯನ್ ಗೇಮ್ಸ್ ಸೇರಿದಂತೆ ಹಲವು ಸ್ಪರ್ಧೆಗಳಲ್ಲಿ ಪದಕ ಸಾಧನೆ ಮೆರೆದ ಅನುರಾಣಿ 2013ರಿಂದ ಕಾಶಿನಾಥ ಬಳಿ ತರಬೇತಿಯಲ್ಲಿದ್ದರು. ಆರಂಭದಲ್ಲಿ 45 ಮೀ.ವರೆಗೆ ಜಾವೆಲಿನ್ ಎಸೆಯುತ್ತಿದ್ದ ಅವರು ಈಗ 63 ಮೀ.ಗೂ ಹೆಚ್ಚು ದೂರ ಎಸೆಯಬಲ್ಲ ಚಾಕಚಕ್ಯತೆ ಹೊಂದಿದ್ದಾರೆ. ಆರಂಭಿಕ ಹಂತದಲ್ಲಿ 7275 ಮೀ. ದೂರ ಎಸೆಯುವ ಸಾಮರ್ಥ್ಯ ಹೊಂದಿದ್ದ ಶಿವಪಾಲ್ ಆರು ವರ್ಷಗಳ ತರಬೇತಿ ಮುಗಿಯುವ ಹೊತ್ತಿಗೆ 85 ಮೀ. ದೂರದವರೆಗೆ ಜಾವೆಲಿನ್ ಎಸೆಯುವ ಸಾಮರ್ಥ್ಯ ಪಡೆದಿದ್ದರೆ ಅದರ ಹಿಂದೆ ಕಾಶಿನಾಥ ನಾಯ್ಕ ಶ್ರಮವಿದೆ. ಜು.23 ರಂದು ಟೋಕಿಯೊಗೆ ಪ್ರಯಾಣ ಬೆಳೆಸಲಿರುವ ಇಬ್ಬರು ಕ್ರೀಡಾಪಟುಗಳಿಗೆ ಒಲಂಪಿಕ್ನ ಪದಕ ಬೇಟೆಗೆ ಗೆಲುವಿನ ಸೂತ್ರವನ್ನು ಕಾಶಿನಾಥ ಹೇಳಿಕೊಡುತ್ತಿದ್ದಾರೆ. | kannad |
6,499 টাকার JioPhone Next এবার মাত্র 4,499 টাকায়, Reliance Jioর সীমিত সময়ের অফার, জলদি করুন. গত নভেম্বরে Reliance Jio ভারতে তাদের প্রথম 4G স্মার্টফোন লঞ্চ করে সেই JioPhone Nextএর দাম ভারতে মাত্র 6,499 টাকা খুব অল্প সময়ের মধ্যেই ফোনটি ব্যাপক জনপ্রিয় হয় কম দাম এবং তাতে কিছু অনবদ্য ফিচার্স, যেগুলি উপলব্ধ করতে অনেক টাকাই খরচ হয়ে যায় সেই জিওফোন নেক্সটএর জন্য এবার দুর্ধর্ষ এক্সচেঞ্জ অফার নিয়ে হাজির হল মুম্বইয়ের টেলিকম সংস্থাটি সীমিত সময়ের এই অফারে 2,000 টাকা ছাড়ে বিক্রি করা হচ্ছে JioPhone Next ফলে এখন এই ফোনটি ক্রয় করতে আপনার খরচ হবে মাত্র 4,499 টাকা এই মুহূর্তে যদি একটা স্মার্টফোন কেনার টিন্তাভাবনা থাকে, আর আপনার বাজেটও যদি কম হয়, তাহলে রিলায়েন্স জিওর এই অফারে JioPhone Next কিনে নেওয়ার থেকে ভাল অপশন আর কিছু হতে পারে না যদিও এই অফার উপলব্ধ করার জন্য রয়েছে কিছু শর্তাবলী আপনাকে শুধু সেটাই মানতে হবে মাত্র 4,499 টাকায় JioPhone Next অফারটি মন্দ নয়, কী বলেন! কারণ, 5,000 টাকারও কম দামে আপনাকে স্মার্টফোন কে দেবে তাও এবার একটা নতুন ফোন তবে Reliance Jio এত কম দামের JioPhone Next উপলব্ধ করতে একটা শর্ত রেখেছে তা হল, একটা পুরনো ফোন এক্সচেঞ্জ করতেই হবে কাজ চলে যায় এমন একটা ফোন, তা সে স্মার্টফোন হোক বা ফিচার ফোন, কম দামের হোক বা বেশি দামের, অনেক পুরনো বা হোক কয়েক মাস বয়স সেই ফোনটা বদলেই আপনাকে 2,000 টাকা ছাড়ে একটা জিওফোন নেক্সট দেওয়া হবে তবে JioPhone Next যখন লঞ্চ করা হয়েছিল, তখন থেকেই ফাইন্যান্সিং অপশনে ফোনটির কেনার সুযোগ দিচ্ছিল Reliance Jio যা এখনও রয়েছে ফাইন্যান্সিংয়ে এই জিও 4G ফোনটি ক্রয় করতে গেলে আপনাকে প্রথমে 2,500 দিতে হবে আর বাকিটা আপনাকে কয়েক ধাপে মিটিয়ে ফেলতে হবে এবং তার জন্য বেছে নিতে হবে একটি প্ল্যান এই উপায়ে ফোনটি ক্রয় করার জন্য একটি প্রসেসিং ফিও চার্জ করে মুম্বইয়ের কোম্পানিটি JioPhone Next স্পেসিফিকেশনস, ফিচার্স এই সস্তার 4G স্মার্টফোনে রয়েছে একটি 5.45 ইঞ্চির মাল্টিটাচ HD ডিসপ্লে, যার পিক্সেল রেজ়োলিউশন 720 X 1440 কর্নিং গোরিলা গ্লাস 3 দ্বারা সুরক্ষিত এই ডিসপ্লে ডুয়ালSIM সাপোর্টেড এই ফোনটিতে অত্যন্ত শক্তিশালী একটি 3500mAh ব্যাটারি দেওয়া হয়েছে ফোনের পিছনে রয়েছে একটিই মাত্র 13MP ক্যামেরা সামনে রয়েছে একটি 8MP ক্যামেরা, যার মাধ্যমে আপনি সেলফি তুলে পারবেন, ভিডিয়ো কলও করতে পারবেন JioPhone Nextএর সবথেকে গুরুত্বপূর্ণ বিষয় হল, তার অপারেটিং সিস্টেম প্রগতি OS বা প্রগতি অপারেটিং সিস্টেম দ্বারা চালিত এই ফোন কম দামি ফোনে ব্যবহারের জন্য যৌথ ভাবে এই অপারেটিং সিস্টেম তৈরি করেছে Jio এবং Google পারফরম্যান্সের জন্য ফোনটিতে রয়েছে একটি Qualcomm Snapdragon 215 প্রসেসর, যা পেয়ার করা রয়েছে 2GB পর্যন্ত RAM এবং 32GB পর্যন্ত বিল্টইন স্টোরেজের সঙ্গে রয়েছে একটি ডেডিকেটেড মাইক্রোSD কার্ড স্লটও, যার মাধ্যমে ফোনের স্টোরেজ 512GB পর্যন্ত বাড়িয়ে নেওয়া যেতে পারে | bengali |
Comedian Raja Babu: రాజసులోచన వాచ్మెన్ కు రాజబాబు సాయం ! Comedian Raja Babu: హాస్య నటుడు రాజబాబు Raja Babu అనగానే చాలా మందికి వెలికి నవ్వు గుర్తుకు వస్తుంది. కానీ తోటి వారి మేలెరిగిన మహా మనిషి రాజబాబు. గతంలో ఎప్పుడో తనకు మంచినీళ్లు ఇచ్చి తన దాహం తీర్చారని.. వారిని గుర్తుపెట్టుకుని వారి రుణం తీర్చుకున్న మహానుభావుడు రాజబాబు. తెలుగు చలనచిత్ర పరిశ్రమను రెండు దశాబ్దాల పాటు ఏలారు. అయినా ఎన్నడూ ఎవరితో ఎలాంటి గొడవ పడలేదు అంటే.. అది ఒక్క రాజబాబుకే చెల్లింది. అందుకే రాజబాబు అంటే.. అందరూ ఇష్టపడవారు. రాజబాబు తన జీవితాన్ని బడి పంతులుగా మొదలుపెట్టారు. మిమిక్రీ, నాటకాలపై ఆసక్తి ఉన్న ఆయనకి క్రమంగా నటనపై మనసు మళ్లి, మద్రాసు వెళ్లి సినిమాల్లో ట్రై చేశారు. గొప్ప హాస్యనటుడిగా ఎదిగారు. అసలు ఆయన కాల్షీట్లు ఎప్పుడూ ఖాళీ ఉండేవి కాదు. రెండు చేతులా సంపాదించడం మొదలుపెట్టాక ఎంతోమందికి ఎంతో మేలు చేశారు. South Superstars : సూపర్ స్టార్ల అసలు పేర్లు ఏమిటో తెలుసా ? సోమవారం, 13 సెప్టెంబర్ 2021, 18:20 R. P. Patnaik: అప్పటి ముచ్చట్లు : నాగార్జున వల్లే ఆయన కెరీర్ పోయిందా ! సోమవారం, 13 సెప్టెంబర్ 2021, 17:33 తన జీవిత కాలంలో ఆయన 78 మందికి సొంత ఖర్చులతో వివాహం జరిపించారు. 68 మందికి విద్యాదానం చేశారు. సేవా సంస్థలకు ఉదారంగా విరాళాలు ఇచ్చారు. మద్రాసులో సినిమా అవకాశాల కోసం తిరుగుతూ ఆకలితో పడుకున్నపుడు మంచినీళ్లు ఇచ్చి ఆదుకున్న ఓ వాచ్మెన్ ను గుర్తుపెట్టుకుని ఆర్థిక సాయం కూడా చేశారు. ఇంతకీ ఆ వాచ్మెన్ ఎవరో తెలుసా ? రాజసులోచన ఇంటి వాచ్మెన్ అట. అప్పట్లో తన నాటకాలను ఆదరించిన పేద పారిశుద్ధ్య కార్మికులకు, రిక్షా వాళ్లకు తన సొంత డబ్బుతో రాజమండ్రిలోని దానవాయిపేటలో భూమిని కొని ఉచితంగా పట్టాలిచ్చారు. కోరుకొండలో కళాశాల కూడా కట్టించారు. ఒక విధంగా ఆయన సేవ చేయడానికే సంపాదిస్తున్నారా అన్నట్టు ఉండేది ఆయన సేవ. ఏది ఏమైనా ఆయన ఎప్పటికే రాజబాబే. | telegu |
पोलिंग बूथों पर बिजली, पानी की हो उचित व्यवस्था जिला निर्वाचन अधिकारीजिलाधिकारी मनुज गोयल ने विधानसभा चुनाव में तैनात नोडल अधिकारियों के साथ बैठक कर तैयारियों के बारे में जानकारी ली। इस मौके पर उन्होंने अधिकारियों को जरूरी निर्देश भी दिए।यहां कोविड से संबधित सभी नए अपडेट पढ़ें डीएम ने ऊर्जा निगम को मतदान दिवस पर दोनों विस के सभी पोलिंग बूथों पर बिजली सप्लाई नियमित रखते हुए अतिरिक्त कार्मिकों की तैनाती करने को कहा। साथ ही जलसंस्थान को बिना पेयजल संयोजन वाले पोलिंग बूथों पर 1500 लीटर भंडारण टैंक की व्यवस्था के निर्देश दिए। उन्होंने विस चुनाव मतदान दिवस के दिन दोनों विस में कोविड गाइडलाइन का अनिवार्य रूप से पालन करते हुए मतदान स्थलों में मास्क, सैनिटाइजर, थर्मल स्कैनिंग की व्यवस्था के निर्देश दिए। बैठक में मुख्य विकास अधिकारी नरेश कुमार, एडीएम देपेंद्र नेगी, सीएमओ डा. बीके शुक्ला आदि मौजूद थे। | hindi |
‘Tell me something cheerful” is how Grover Norquist, the president of Americans for Tax Reform, has started most of the conversations I’ve had with him over the past 20 years. Not last week.
Norquist has spent a quarter century getting American politicians, especially Republicans, to sign a pledge opposing all tax increases. In recent weeks, however, his fight has been getting harder. Former Florida Gov. Jeb Bush has been urging Republicans not to take the pledge, arguing that it would rule out even a budget deal with $10 of spending cuts for every $1 of tax increases. CNN, Politico and Bloomberg Businessweek have all run stories claiming that Norquist’s once-legendary influence among Republicans is starting to fade.
Norquist has for years been very successful in his mission. Since the 1990 budget deal signed by President George Bush, no congressional Republican has voted for a broad-based tax increase. There are 238 pledge-takers in the House and 41 in the Senate. Senate Majority Leader Harry Reid says Norquist leads Republicans “like puppets.” President Obama has blasted his sway, too.
He continues: “What the pledge does is it enables an unknown politician to credibly commit” to opposing tax hikes. Politicians who merely say they wish to avoid such increases but refuse to sign the pledge generally want to raise taxes, he thinks.
He points to the examples of Democrats Mark Warner and Tim Kaine, governors in Virginia during the past decade, and Republican Brian Sandoval, governor of Nevada now. None signed the pledge, and all pushed for tax increases as soon as they got into office.
For politicians who genuinely want to avoid higher taxes, he argues, the pledge makes life easier — especially at the state level, where constitutional requirements usually make it harder to run deficits. The pledge enables these politicians to tell interests that seek higher spending, in Norquist’s words, “I’d like to help you, but my hands are tied.” Eventually, the spenders get the message and stop asking.
Jeb Bush, Graham and other Republicans who favor a deal that cuts spending and raises taxes are naive, in Norquist’s view. President Ronald Reagan, he notes, came to regret a similar deal he made in the 1982 budget because the spending cuts didn’t materialize. Last year’s debt-ceiling deal, on the other hand, showed that getting spending cuts without tax increases is possible.
Discussing hypothetical bargains with 10-to-1 spending cuts, in Norquist’s view, is like debating what the best kind of unicorn would be. “Wouldn’t it be nice to have silver-striped unicorns? No one’s offered you 10-to-1!” he says, raising his voice in frustration.
Norquist may be ticked, but it’s not clear that he’s losing the political fight. He and his pledge were widely said to be in decline in 2005, when Washington Monthly magazine ran a story called “Is Grover Over?” It was wishful thinking. Even amid this year’s budgetary gloom, Norquist says, only five states have raised taxes. Even in liberal California, pledge-takers in the Legislature managed to block tax hikes. | english |
Dr Farshid Soheilifar is a fellow of the Royal Australian College of General Practitioners and is a senior lecturer at Griffith university of medicine. He has vast experience working in Primary Care and Emergency Medicine in Australia over the past 10 years.
Farshid has worked as a Senior Medical Officer/Consultant and Visiting Medical Officer in both Public and Private Hospital Departments as well as in General Practice in Queensland.
Dr Soheilifar is passionate about developing education and improving Medical Practice in Australia and been involved in medical student and registrar training programs over the past decade. He is as an examiner of the Australian royal college of general practitioners and a GP registrar supervisor through General Practice Training Queensland (GPTQ) .
Dr Soheilifar is interested in all areas of general practice with a special interest in diabetes and weight management as well as skin cancer.
In his spare time he enjoys playing Soccer and spending time with his family and friends. | english |
ChaySam: పిల్లల విషయంలోనే చైతూసామ్ మధ్య అగ్గి రాజుకుందా? ChaySam: నాగ చైతన్య సమంత విడాకుల విషయం ఇప్పటికీ ట్రెండింగ్లోనే ఉంది. వారు విడిపోయి ఎంత ఫీల్ అవుతున్నారో తెలియదు కాని, అభిమానులు మాత్రం ఇంకా దాని గురించి ముచ్చటించుకున్నారు. ఎందుకు వారిరివురు విడిపోయారు అంటూ అనేక రకాల ఆలోచనలు చేస్తున్నారు.ఒక్కోక్కరు ఒక్కో కారణం చెబుతుండగా,ఇందులో ఏది నిజమో తెలియక చాలా మంది కన్ఫ్యూజ్ అవుతున్నారు. గత ఏడాది కరోనా సమయం నుండే సమంత, నాగ చైతన్య మధ్యలో గొడవలు మొదలయ్యాయని తెలుస్తోంది. అప్పుడు వీళ్ల కెరీర్లో The post ChaySam: పిల్లల విషయంలోనే చైతూసామ్ మధ్య అగ్గి రాజుకుందా? first appeared on The News Qube. ChaySam: నాగ చైతన్య సమంత విడాకుల విషయం ఇప్పటికీ ట్రెండింగ్లోనే ఉంది. వారు విడిపోయి ఎంత ఫీల్ అవుతున్నారో తెలియదు కాని, అభిమానులు మాత్రం ఇంకా దాని గురించి ముచ్చటించుకున్నారు. ఎందుకు వారిరివురు విడిపోయారు అంటూ అనేక రకాల ఆలోచనలు చేస్తున్నారు.ఒక్కోక్కరు ఒక్కో కారణం చెబుతుండగా,ఇందులో ఏది నిజమో తెలియక చాలా మంది కన్ఫ్యూజ్ అవుతున్నారు. గత ఏడాది కరోనా సమయం నుండే సమంత, నాగ చైతన్య మధ్యలో గొడవలు మొదలయ్యాయని తెలుస్తోంది. అప్పుడు వీళ్ల కెరీర్లో మాత్రమే కాదు.. అందరూ కెరీర్లో దాదాపు రెండు సంవత్సరాల గ్యాప్ వచ్చింది. ఆ సమయంలో పిల్లల కోసం ప్లాన్ చేయాలి అంటూ అక్కినేని కుటుంబం నుంచి సమంతకు ఒత్తిడి మొదలైందని తెలుస్తోంది. కానీ దీనికి ఆమె నుంచి నో అనే సమాధానం వచ్చిందట. పిల్లలని కనే ఉద్దేశం తనకు లేదని, అసలు పిల్లలని కనాలని తనపై ఒత్తిడి తీసుకురావొద్దని సమంత చెప్పినట్టు తెలుస్తుంది. బయట అక్కినేని కుటుంబానికి ఒక ఇమేజ్ ఉందని.. కచ్చితంగా పిల్లలు ఉండాల్సిందే అంటూ కుటుంబం నుంచి ఒత్తిడి ఎక్కువగా వచ్చినట్లు తెలుస్తోంది. దీనికి సమంత ససేమిరా అనడంతో.. ఇక్కడే మాట మాట పెరిగినట్లు ప్రచారం జరుగుతోంది. పిల్లల విషయంలో మొదలైన గొడవ తారాస్థాయికి చేరడంతో చివరికి విడాకుల వరకు వచ్చినట్లు సమాచారం.ఈ వివాదంపై అక్కినేని ఫ్యామిలీతో పాటు చాలా మంది సర్ధిచెప్పే ప్రయత్నం చేసినా కూడా ఇద్దరి మధ్య రాజీ కుదరకపోవడంతో డైవర్స్ తీసుకున్నారట. కరోనా సమయంలో పిల్లల్ని ప్లాన్ చేసుకుంటే.. ఆ రెండు సంవత్సరాల గ్యాప్లో కెరీర్పై కూడా ఎలాంటి ప్రభావం పడదు అంటూ.. సమంతకు నచ్చచెప్పడానికి అక్కినేని కుటుంబ సభ్యులు ప్రయత్నించినా కూడా ఫలితం లేకుండా పోయిందని తెలుస్తోంది.The post ChaySam: పిల్లల విషయంలోనే చైతూసామ్ మధ్య అగ్గి రాజుకుందా? first appeared on The News Qube. | telegu |
سنگاپوراردو پوائنٹ اخبار تاز ترین5 اکتوبر 2014ء عالمی نمبر ایک ٹینس اسٹار سرینا ولیمزسابق چمپئن ندرے گاسی اور پیٹرک رافٹر سنگاپور کے افتتاحی انٹرنیشنل پریمئر ٹینس لیگ میں سنگاپور سلمرز کی نمائندگی کریں گے انٹرنیشنل پریمئر ٹینس لیگ میں موجودہ اور ماضی کے کئی سپر اسٹار حصہ لیں گے خواتین اسٹارز میں امریکا کی سرینا ولیمزسابق اسٹار ندرے گاسی اور رافٹر شامل ہیں جبکہ دیگر نمایاں کھلاڑیوں میں ٹامس بریڈیچڈینئیل ہنٹووابرونوسورسلیوٹن ہیویٹ نک کینوساینا ئیوانووچاوگویروبوچارڑجو یلفرائیڈ سونگاگائل مونفلزرچرڈ گیسکوٹگوران ئیوانیسوک اور کارلوس مویا شامل ہیںدوسرا مرحلہ ایشین ٹینس ایسو سی ایشن کے زیر چار شہروں کا دورہ ہے جو مختلف ٹیموں کے خلاف سنگاپور سلمرز کھیلیں گےٹورنامنٹ 2سے 4دسمبر تک کھیلا جائے گا | urdu |
पंचतत्व में विलीन हुए बप्पी लाहिड़ी नई दिल्ली: बप्पी लाहिड़ी का अंतिम संस्कार हो गया है. वैसे तो बप्पी का पार्थिव शरीर बुधवार को घर ले आए थे, लेकिन अंतिम संस्कार नहीं किया गया क्योंकि परिवार बप्पी के बेटे बप्पा का इंतजार कर रहे थे. बप्पा ने अपने पिता को मुखाग्नि दी.बप्पा ने दी मुखाग्निबप्पी के बेटे बप्पा ने दी सिंगर को मुखाग्नि, पंचतत्वों में विलीन हुए बप्पी दा.शक्ति कपूर, मीका सिंह और भूषण कुमार भी पहुंचेशक्ति कपूर, मीका सिंह और भूषण कुमार भी बप्पी दा को अंतिम विदाई देने पहुंचे.विद्या बालन पहुंचीं बप्पी को आखिरी विदाई देनेविद्या बालन, बप्पी लाहिड़ी को आखिरी विदाई देने श्मशान घाट पहुंचीं.सिंगर बप्पी लाहिड़ी Bappi Lahiri का मंगलवार रात निधन हो गया था और आज उनका अंतिम संस्कार हो गया है. डिस्को किंग से जाने जाते बप्पी लाहिड़ी ने हिंदी सिनेमा में डिस्को के अपने अंदाज से फैंस को रूबरू करवाया था. बता दें कि कुछ दिनों पहले ही लता मंगेशकर का निधन हुआ था जिससे म्यूजिक इंडस्ट्री को बड़ा झटका लगा था, लेकिन अब बप्पी के जाने से ये दुख और बढ़ गया है. बप्पी एक महीने से अस्पताल में भर्ती थे और सोमवार को ही उन्हें अस्पताल से डिस्चार्ज किया गया था. हालांकि घर जाने के बाद उनकी तबीयत और बिगड़ गई. इसके बाद मंगलवार को उन्हें वापस अस्पताल में लाया गया. | hindi |
এই বাড়িতে তৈরি বিশেষ চুলের পারফিউম চুলে সতেজতা এবং দুর্দান্ত সুগন্ধি দেয় একটি বডি পারফিউম আমাদেরকে আরও ভালো সুগন্ধ দিতে সাহায্য করে সেইসাথে আমাদের সামনে থাকা ব্যক্তির উপর ভালো ছাপ ফেলতে সাহায্য করে আপনারা সবাই নিশ্চয়ই বডি পারফিউম ব্যবহার করেছেন কিন্তু আপনি কি কখনো চুলের পারফিউম ব্যবহার করেছেন? সম্ভবত না, কারণ চুলের পারফিউম সম্পর্কে খুব কম লোকই জানেন একটি শ্যাম্পু বা কন্ডিশনার অল্প সময়ের জন্য আপনার চুলে একটি সুন্দর সুগন্ধি দেয় কিন্তু চুলের পারফিউম আপনাকে এবং আপনার চুলকে দীর্ঘ সময়ের জন্য একটি সুন্দর ঘ্রাণ দেয় এটি আপনার চুলকে চকচকে, সুগন্ধযুক্ত এবং চুলকে সতেজ রাখে চলুন জেনে নিই কীভাবে ঘরে বসে চুলের সুগন্ধি তৈরি করবেন, যা সস্তা এবং তৈরি করা সহজ কিভাবে চুলের সুগন্ধি তৈরি করবেন উপাদান: আধা কাপ গোলাপ জল 2 ফোঁটা ভ্যানিলা নির্যাস 20 ফোঁটা আঙ্গুরের বীজ তেল বা নারকেল তেল 7 ফোঁটা জেসমিন এসেনশিয়াল অয়েল ছিটানোর বোতল কিভাবে চুলের সুগন্ধি তৈরি করবেন: ঘরে তৈরি এই চুলের সুগন্ধি সস্তার পাশাপাশি আপনার চুলের জন্যও ভালো এটি করতে এখানে দেওয়া সহজ পদক্ষেপগুলি অনুসরণ করুন: প্রথমে একটি পাত্রে নিয়ে তাতে গোলাপ জল ও ভ্যানিলার নির্যাস দিন এখন আপনি যদি আঙ্গুরের তেল, জুঁই তেল এবং সুগন্ধের জন্য চান তবে আপনি এতে 12 ফোঁটা ল্যাভেন্ডার তেলও যোগ করতে পারেন এবার এই মিশ্রণটি ভালো করে মিশিয়ে একটি স্প্রে বোতলে রেখে দিন এবার স্প্রে বোতলটি শুকনো জায়গায় সংরক্ষণ করুন এখন আপনি যখন খুশি এই স্প্রে ব্যবহার করতে পারেন এটি ধোয়ার সাথে বা ছাড়া চুলে ব্যবহার করা যেতে পারে এটি আপনার চুলের সুগন্ধি তৈরি করবে এবং আপনাকে সতেজ অনুভব করবে যখনই আপনি আপনার চুল নিস্তেজ বা তৈলাক্ত দেখতে পান, আপনি এই পারফিউম স্প্রে করতে পারেন চুলের সুগন্ধির উপকারিতা চুলের পারফিউম মূলত চুলে সতেজতা আনতে ব্যবহৃত হয় চুলের আতরের আরেকটি সাধারণ ব্যবহার হল ঘর্মাক্ত চুল থেকে মুক্তি পেতে প্রায়শই, কড়া রোদ, তাপ এবং ওয়ার্কআউটের পরে চুলে ঘামের গন্ধ হয়, তাই চুলের পারফিউম চুলকে দুর্গন্ধযুক্ত এবং ঘামমুক্ত রাখতে সহায়তা করে অনেকেই দিনের বেলায় তাদের পছন্দের ঘ্রাণ পেতে চুলে সুগন্ধি স্প্রে করেন এটি অ্যান্টিস্ট্যাটিক বৈশিষ্ট্য সমৃদ্ধ এবং চকচকে বুস্টের জন্য ভাল এটি আপনার মাথার ত্বককে সুস্থ রাখতে এবং চুলকে মজবুত রাখতে সাহায্য করে কারণ এই হেয়ার পারফিউমে তেলের সমন্বয় রয়েছে যা চুলকে সুস্থ রাখে এই অপরিহার্য তেলগুলি আপনার চুলকে মজবুত রাখে এবং আপনার চুলে দুর্দান্ত সুগন্ধও দেয় এইভাবে, আপনি বাড়িতে আপনার চুলের পারফিউম তৈরি এবং সংরক্ষণ করতে পারেন, এটি দীর্ঘ সময়ের জন্য নিরাপদ এবং ব্যবহার করা যেতে পারে | bengali |
मतदाता जागरूकता के लिए हुई पतंग प्रतियोगिता बुलदंशहर। संवाददातामतदाता जागरूकता के लिए भारत विकास परिषद के तत्वावधान में यमुनापुरम स्टेडियम में पतंग प्रतियोगिता का आयोजन किया गया। जिला निर्वाचन अधिकारी चंद्र प्रकाश सिंह के मार्गदर्शन में मतदाता शिक्षा एवं निर्वाचक सहभागिता स्वीप कार्यक्रम के तहत पतंग प्रतियोगिता हुई।एडीएम प्रशासन डा. प्रशांत कुमार ने भी खूब पतंग उड़ाई तथा पतंग उड़ाने वाले बच्चों का उत्साहवर्धन किया। उन्होंने जनता से 10 फरवरी को मतदान करने की अपील करते हुए कहा कि अधिक से अधिक मतदान करके जनपद को प्रथम स्थान दिलाएं। जिला प्रशासन द्वारा जनपद बुलन्दशहर के सभी मतदाताओं से स्वयं मत का प्रयोग करने एवं अपने सभी सम्बन्धियों व मित्रों को भी मत के प्रति जागरूक करने की अपील की गयी है।पतंगों पर मतदान के लिए प्रेरित करने वाले स्लोगन लिखे गए तथा मतदाता शपथ भी ली गई। प्रतियोगिता में हिस्सा लेने वाले सभी पच्चीस प्रतिभागियों को प्रमाण पत्र और तीन विजेताओं को पुरस्कार देकर सम्मानित किया गया। शाखा अध्यक्ष चन्द्र भूषण मित्तल ने बताया कि सेवार्थ शाखा द्वारा यह पतंग प्रतियोगिता एक अलग ही कार्यक्रम है। उन्होंने कहा जनपद की जनता अधिक से अधिक मतदान करके जनपद को सूबे में प्रथम स्थान दिलाने में अहम भूमिका निभाएगी। इस अवसर पर दीपू गर्ग, विशाल जालान, सतेन्द्र अग्रवाल, गौरव गुप्ता, विकास ग्रोवर, सुमन शर्मा, विशन कुमार, मोहित चौधरी, राजेंद्र सिंह, किशन सिंह, मोहित गर्ग आदि उपस्थित रहे । For Hindustan : हिन्दुस्तान ईसमाचार पत्र के लिए क्लिक करें epaper.livehindustan.com | hindi |
/* Default wcsncpy implementation for S/390.
Copyright (C) 2015-2017 Free Software Foundation, Inc.
This file is part of the GNU C Library.
The GNU C Library is free software; you can redistribute it and/or
modify it under the terms of the GNU Lesser General Public
License as published by the Free Software Foundation; either
version 2.1 of the License, or (at your option) any later version.
The GNU C Library is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
Lesser General Public License for more details.
You should have received a copy of the GNU Lesser General Public
License along with the GNU C Library; if not, see
<http://www.gnu.org/licenses/>. */
#if defined HAVE_S390_VX_ASM_SUPPORT && IS_IN (libc)
# define WCSNCPY __wcsncpy_c
# include <wchar.h>
extern __typeof (__wcsncpy) __wcsncpy_c;
# include <wcsmbs/wcsncpy.c>
#endif
| code |
পরিবারের ইচ্ছা ছিলো ছেলে সরকারি চাকরি করুক! আজ বছরে কোটি কোটি টাকা কামাচ্ছে সুপুত্র বাংলা হান্ট ডেস্কঃ নীতীশ রাজপুত নামটি বর্তমানে তরুণ প্রজন্মের কাছে বেশ জনপ্রিয় আপনারা যারা ইউটিউবে ভিডিও দেখতে পছন্দ করেন, তারা খুব সহজেই চিনবেন এই ইউটিউব স্টার তথা সোশ্যাল মিডিয়া ইনফ্লুয়েন্সারকে তবে নীতিশের পক্ষে সোশ্যাল মিডিয়ায় পরিচিতি লাভ করা খুব সহজ সাধ্য কাজ মোটেও ছিল না! প্রথমে টিকটকে ভিডিও বানিয়ে জনপ্রিয়তা অর্জন করলেও এরপর ভারতের টিকটক নিষিদ্ধ করা হয় বর্তমানে অবশ্য ইউটিউবে একাধিক ভিডিও বানিয়ে দর্শকদের মনোরঞ্জন করে চলেছে সে আপনাদেরকে বলে রাখি যে, একটা সময় নীতিশের পরিবার চেয়েছিল ছেলে পড়াশোনা করে সরকারি চাকরি করুক তবে তাদের সেই প্রত্যাশা পূরণ না হলেও বর্তমানে এক কোটি টাকার কাছাকাছি অর্থ উপার্জন করে চলেছে এই ইউটিউব স্টার টিকটক বনাম ইউটিউব সংক্রান্ত বিতর্কে নীতিশ রাজপুতের একটি ভিডিও তাকে জনপ্রিয়তার শিখরে পৌঁছে দেয় এরপর আর তাকে পিছন ফিরে তাকাতে হয়নি! বর্তমানে তার প্রতিটি ভিডিও ভাইরাল হয়ে চলেছে এই মুহূর্তে নীতিশ শ্রীলঙ্কা অর্থনীতির পতন থেকে শুরু করে রাশিয়াইউক্রেন যুদ্ধের মতো বিভিন্ন সোশ্যাল ইস্যু নিয়ে ভিডিও তৈরি করে চলেছে Related Articles আজকের রাশিফল, ২২ মে, রবিবার, আজ আর্থিক ক্ষেত্রে শুভ এই রাশির জাতকের 2 hours ago জয় দিয়েই মরশুম শেষ করলো রোহিতের মুম্বাই, পন্থের দিল্লি নয়, IPL প্লেঅফ খেলবে কোহলির RCB 2 hours ago উত্তরপ্রদেশের সুলতানপুরে 1989 সালে জন্মগ্রহণ করে বর্তমানে তরুণ প্রজন্মের জনপ্রিয় স্টার নীতীশ তার বাবা এক আইএসপি ফার্ম চালাতেন ছোটবেলায় বেশিরভাগ সময় দিল্লিতে কাটে নীতিশের স্কুলজীবন শেষ করে নিতে গৌতম বুদ্ধ বিশ্ববিদ্যালয়ে পড়াশোনা করে সে এরপর একটি আইটি সেক্টরে কাজ করার মাধ্যমে কেরিয়ারের সূচনা হয় তার অবশ্য এর পরে ভিডিও বানানোতেই মন দেয় নীতীশ তার তৈরি ভিডিওগুলি বর্তমান প্রজন্মের জন্য বেশ অনুপ্রেরণাদায়কও বটে সম্প্রতি RED FM 93.5এর একটি সাক্ষাত্কারে নীতীশ জানায়, বর্তমানে আমি আমেরিকায় একটি এমএনসি কোম্পানীতে ব্যবসায়িক প্রধান হিসেবে কর্মরত রয়েছি এছাড়াও ইউটিউব এবং ইনস্টাগ্রামে ভিডিও বানিয়ে চলেছি নতুন খবর ছবি ভিডিও ভাইরাল পশ্চিমবঙ্গ ভারত আন্তজাতিক বিনোদন খেলা রাজনীতি টেক নিউজ রাশিফল আবহাওয়া টাকা পয়সা লাইফ স্টাইল | bengali |
Astrological Remedies: मंत्र एक ही आसन पर बैठ कर जाप करें, नकारात्मकता दूर करने के लिए करें ये उपाय Astrological Remedies : जीवन के कठिन रास्ते में जब सभी उपाय फेल होने लगते है तब चमत्कारी ज्योतिषीय संभावनाओं का द्वार खेलते है। ज्योतिष शास्त्र में जीवन की हर संभावनाओं के बारे बताया गया है। जीवन की कठिन से कठिन चुनौतियों के समय भी ज्योतिषीय उपचार रास्ते बनाते है। ज्योतिष में फिटकरी के ऐसे कई उपायों के बारे में बताया गया है जिसे करने से धन, नौकरी या सेहत संबंधी परेशानी को दूर किया जा सकता है। चमत्कारी ज्योतिषीय उपायों के बारे में आइये जानते है। शुक्र उपाय और मंत्र: जानिए आपके ग्रह शुक्र और उसके प्रभावों को मजबूत करने के लिए ज्योतिष युक्तियाँ 1.यदि आप बिना वजह व्यापार में लगातार घाटा झेल रहे हैं तो फिटकरी को काले रंग के कपड़े में लपेटें और उसे मुख्य द्वार पर बांध दें। इससे आपकी दुकान की नकारात्मकता दूर होगी और बुरी नजर से भी बचाव होगा। 2.आपके घर में किसी व्यक्ति, बच्चे पर बुरी नजर का प्रभाव है तो उसे लिटाकर फिटकरी से सात बार सिर से लेकर पांव तक वार दें। ध्यान रहे कि हर बार तलवे में फिटकरी स्पर्श जरूर कराएं। ऐसा करने के बाद इसे आग में डालकर जला दें। बुरी नजर से बचाव होता है। 3.कैक्टस या कांटे वाले पौधे घर में लगाने से शनि प्रबल हो जाता है अतः जिनकी कुंडली में शनि खराब हो उन्हें ऐसे पौधे नहीं लगाने चाहिए। 4.जब भी मंत्र का जाप करें उसे पूर्ण संख्या में करना जरूरी है। मंत्र एक ही आसन पर, एक ही समय में सम संख्या में करना चाहिए। Astro Tips for Money : लहसुन की कलियांलौंग को लाल कपड़े में लपेटकर पर्स या मनी लॉकर में रख दें , दूर हो जाएगी पैसे की कमी 5.कभी भी उच्च के ग्रहों का दान नहीं करना चाहिए और नीच ग्रहों की कभी पूजा नहीं करनी चाहिए। | hindi |
ಪ್ರವೀಣ್ ನೆಟ್ಟಾರು ಹತ್ಯೆ: ಅಪರಿಚಿತರಿಂದ ಬಸ್ ಗೆ ಕಲ್ಲೆಸೆತ ಹಲವೆಡೆ ಬಂದ್ ಪುತ್ತೂರು: ಬಿಜೆಪಿ ಜಿಲ್ಲಾ ಯುವ ಮೋರ್ಚಾ ಕಾರ್ಯಕಾರಿಣಿ ಸಮಿತಿ ಸದಸ್ಯ ಪ್ರವೀಣ್ ನೆಟ್ಟಾರು ಅವರ ಹತ್ಯೆ ಖಂಡಿಸಿ ಪುತ್ತೂರು, ಉಪ್ಪಿನಂಗಡಿ, ಕಡಬ ತಾಲೂಕುಗಳಲ್ಲಿ ಬುಧವಾರ ಸ್ವಯಂ ಪ್ರೇರಿತ ಬಂದ್ ಮಾಡಲಾಗಿದೆ. ಮುಂಜಾನೆ ಮಂಗಳೂರಿಗೆ ಸಂಚರಿಸುತಿದ್ದ ಕೆಎಸ್ ಆರ್ ಟಿಸಿ ಬಸ್ ಗೆ ಕಲ್ಲೆಸೆದು ಹಾನಿಮಾಡಿದ್ದಾರೆ ಎಂದು ತಿಳಿದುಬಂದಿದೆ. ಬಿಜೆಪಿ ಯುವ ಮುಖಂಡ 29 ವರ್ಷದ ಪ್ರವೀಣ್ ನೆಟ್ಟಾರು ಅವರನ್ನು ನಗರದ ಬೆಳ್ಳಾರೆ ಪೇಟೆಯಲ್ಲಿ ಹತ್ಯೆ ಮಾಡಲಾಗಿದೆ. ಈ ಬರ್ಬರ ಹತ್ಯೆಯನ್ನು ಖಂಡಿಸಿ ಪುತ್ತೂರು, ಸುಳ್ಯ, ಕಡಬ ತಾಲೂಕಿನಲ್ಲಿ ಸ್ವಯಂಪ್ರೇರಿತ ಬಂದ್ಗೆ ವಿಎಚ್ಪಿ, ಭಜರಂಗದಳ, ಹಿಂದೂ ಜಾಗರಣ ವೇದಿಕೆ ಕರೆ ನೀಡಿದೆ. ಅಶ್ಲೀಲವಾಗಿ ಫೋಟೋ ಮಾರ್ಫಿಂಗ್ ಮಾಡಿ ಸಂದೇಶ ರವಾನೆ ಸುಳ್ಯ ತಾಲೂಕಿನ ಬೆಳ್ಳಾರೆಯ ನೆಟ್ಟಾರು ನಿವಾಸಿಯಾಗಿರುವ ಪ್ರವೀಣ್ ಅವರು ಎಂದಿನಂತೆ ಮಂಗಳವಾರ ರಾತ್ರಿ ಸುಮಾರು 9 ಗಂಟೆಯ ವೇಳೆಗೆ ತನ್ನ ಚಿಕನ್ ಸೆಂಟರ್ ಅನ್ನು ಮುಚ್ಚುವ ತಯಾರಿಯಲ್ಲಿದ್ದಾಗ ಅಲ್ಲಿಗೆ ಬಂದ ದುಷ್ಕರ್ಮಿಗಳು ಈ ಕೃತ್ಯ ಎಸಗಿದ್ದಾರೆ. ಘಟನೆ ನಡೆದ ರಾತ್ರಿಯೇ ನಗರದಲ್ಲಿ ಉದ್ವಿಗ್ನ ಪರಿಸ್ಥಿತಿ ಉಂಟಾದ ಕಾರಣ, ಮುನ್ನೆಚ್ಚರಿಕೆ ಕ್ರಮವಾಗಿ ಪೊಲೀಸರು ಅಂಗಡಿ ಮುಂಗಟ್ಟುಗಳನ್ನು ಬಂದ್ ಮಾಡಿಸಿದ್ದರು. ಬೆಳ್ಳಾರೆ ಪೋಲೀಸ್ ಠಾಣೆಯಲ್ಲಿ ಪ್ರಕರಣ ದಾಖಲಾಗಿದೆ. | kannad |
மேற்கு சகாராவை விட்டு எசுப்பானியா விலகிய நாள் நவம்பர் 14 1971 மரைனர் 9 செவ்வாய் கோளை சென்றடைந்தது. இதுவே பூமியில் இருந்து வேறொரு கோளின் செயற்கைச் செய்மதியாகச் செயற்பட்ட முதலாவது விண்கலமாகும். 1973 கிரேக்க இராணுவ ஆட்சிக்கு 166774 எதிரான பெரும் ஆர்ப்பாட்டம் கிரேக்கத்தில் ஆரம்பமானது. 1975 மேற்கு சகாராவை விட்டு எசுப்பானியா விலகியது. 1978 பிரான்சு ஆப்ரோடைட்டு என்ற அணுவாயுத சோதனையை நிகழ்த்தியது. 1982 போலந்தின் சொலிடாரிட்டி தொழிற்சங்கத் தலைவர் லேக் வலேசா 11 மாதங்கள் சிறையில் இருந்த பின்னர் விடுவிக்கப்பட்டார். | tamil |
दुर्गम की रसोई तक दोगुने दाम में पहुंच रहा LPG सिलेंडर पर्यावरण की सुरक्षा और महिलाओं के स्वास्थ्यसहूलियत के लिए रसोईघर में लकड़ी के बजाए एलपीजी गैस पर जोर दिया जा रहा है। लेकिन राज्य के पर्वतीय क्षेत्रों में लोग चाहकर भी रसोई गैस की सुविधा का इस्तेमाल नहीं कर पाते। दरअसल, गैस एजेंसी पर लगभग साढ़े नौ सौ रुपये में मिलने वाले गैस सिलेंडर का दाम दुर्गम के गांवों तक पहुंचतेपहुंचते 1200 से लेकर 1800 रुपये तक हो जाता है। यह अतिरिक्त खर्च सिलेंडर की ढुलाई का होता है, इसके चलते लोग सिलेंडर लेने से हिचकते हैं। पौड़ी:बीरोंखाल के दूरस्थ क्षेद्ध चैनपुर और सोलाड़ में थलीसैंड में स्थित गैस एजेंसी पर सिलेंडर एक हजार रुपये में मिलता है। यहां से सिलेंडर को गांव तक ले जाने में ग्रामीणों को अतिरिक्त रकम खर्च करनी होती है। महावीर सिंह और तेजपाल ने बताया कि कमडई से उन्हें पचास रुपये टैक्सी को देने पड़ते हैं। भौन स्थित गैस वितरण सेंटर पर घरेलू सिलेंडर 940 व कॉमर्शियल सिलेंडर 2200 रुपये का है। सड़क से सिलेंडर वाहन, खच्चर और मजदूरों की मदद से गांव तक ले जाया जाता है। इसके लिए दो सौ रुपये तक देने पड़ते हैं। नैखाणा के सतीश बिष्ट और कफल टंडा तल्ला के पुष्पराज मधवाल ने भी बताया कि ढुलाई से खर्च बढ़ जाता है। नई टिहरी: जनपद के गेन्वाली और गंगी में सिलेंडर का दाम यूं तो 935.50 रुपये है पर उसे दूरस्थ गांवों तक ले जाने पर कीमत 25 से 30फीसदी तक बढ़ जाती है। दूरस्थ गांवों तक ले जाने पर कीमत 25 से 30फीसदी तक बढ़ जाती है। एजेंसी से घुत्तू तक का भाड़ा 25.50 रुपये है। घुत्तू से गंगी तक खच्चर के लिए 200 रुपये देने होते हैं। इसी प्रकार सेघनसाली से कोट विशन बूढाकेदार का भाड़ा 35 रुपये है। फिर गेन्वाली तक खच्चर से ढुलाई के लिए 250 से 300 रुपये देने होते हैं। गंगी निवासी नैन सिंह राणा और धर्म सिंह ने बताया कि उनके गांव तक सिलेंडर 11 सौ से 12 सौ के बीच पड़ता है। गेन्वाली के बच्चन सिंह व सोबन सिंह का कहना है कि उनके गांव तक सिलेंडर लगभग 12 सौ रुपये का पड़ता है। चंपावत: जिले का का सबसे दूरस्थ गांव कोटकेंद्री में भाड़ा समेत सिलेंडर करीब 1500 रुपये का पहुंच रहा है जबकि एजेंसी से सिलेंडर 943 रुपये का मिलता है। सिलेंडर रिफिलिंग के लिए कोटकेंद्री से 20 किमी दूर पूर्णागिरि आना पड़ता है। यहां से ढुलाई 600 रुपये है। स्थानीय नीरज सिंह कहते हैं कि सड़क से गांव की सीधी पहुंच न होने से लागत बढ़ जाती है। इससे सिलेंडर ही नहीं बल्कि रोजमर्रा की जरूरत की अन्य चीजों के लिए भी ज्यादा कीमत देनी पड़ती है। डांडा के प्रेम सिंह बताते हैं कि डांडा ककनई में सड़क का काम आधे में ही रोक दिया गया। इससे परेशानी हो रही है। जो सिलेंडर एजेंसी से 943 का मिल रहा है, गांव तक उसकी लागत 1213 सौ रुपये हो जाती है। बागेश्वर: जिले का सबसे दूरस्थ्य गांव बोरबलड़ा में गैस सिलेंडर 1350 रुपये का पड़ रहा है। भराड़ी गैस एजेंसी में सिलेंडर उन्हें 937 में मिलता है। यहां से वाहन द्वारा बदियाकोट तक 125 रुपये अतिरिक्त देना पड़ता है। बदियाकोट से 600 रुपये में खच्चर के माध्यम से गांव में सिलेंडर पहुंचाया जाता है। एक बार में खच्चर दो सिलेंडर तक ले जाता हे। गांव में सिलेंडर 1350 रुपये में पहुंच रहा है। जगत सिंह दानू कहते हैं भराड़ी गैस एजेंसी में 937 देना उतना नहीं खलता है। गांव की दूरी दस किमी पैदल है। यहां गैस सिलेंडर पहुंचाने को कोई राजी तक नहीं होता है। काफी मानमनुहार के बाद ही खच्चर वाले यहां आने को तैयार होते हैं। इसके लिए भी 600 रुपये पहले देने पड़ते हैं। हरीश चंद्र सिंह दानू कहते हैं कि भराड़ी से 25 किमी दूर बदियाकोट तक वाहनों के माध्मय से गैस ले जाते हैं। यहां तक का किराया भी उन्हें 125 रुपये देना पड़ता है। गांव की पैदल दूरी अधिक होने से गैस सिलेंडर काफी महंगा पड़ रहा है। नैनीताल: महंगी गैस के कारण चूल्हा जला रहे लोग जिले के बेतालघाट ब्लॉक के खलाड, थुवा, ताड़ीखेत, हरतोल, चंद्रकोट गांव में 920 रुपये की कीमत वाला सिलेंडर 1200 रुपये का पड़ता है। ताड़ीखेत गांव के बची राम ने बताया कि गैस का ट्रक जहां सिलेंडर छोड़ कर जाता है, वहां से गांव छह किलोमीटर दूर है। गाड़ी वाले अलग से ढुलाई लेते हैं। गाड़ी नही आती तो खच्चर से सिलेंडर पहुंचाना पड़ता है। इस कारण गांव में 80 फीसदी लोग चूल्हे का भी प्रयोग करते हैं। चमोली: डुमक कलगोंठ गांव सड़क से आठ से 10 किमी की दूरी पर है। यहां डुमक के राम किशन सनवाल, उर्गम के रघुवीर सिंह नेगी कहते हैं उर्गम सड़क तक वाहन खर्च सहित एक सिलेंडर की कीमत 1100 रुपये तक बैठती है। उसके बाद डुमक तक आते आते एक सिलेंडर की लागत 1900 रुपये पहुंच जाती है। यहां खच्चर का भाड़ा 700 से 800 रूपये रुपये देना पड़ता है । ईराणी के ग्राम प्रधान मोहन सिंह नेगी कहते हैं कि पगना सड़क से इराणी तक खच्चर से गैस की ढुलाई 350 रुपये तक चुकानी पड़ती है। पगना तक 1000 रुपये की लागत गैस सिलेन्डर की है। इराणी तक खच्चर के भाड़े सहित इसकी लागत 1350 रुपये तक हो जाती है । पिथौरागढ़ : मार जाता है सिलेंडर का ढुलाई खर्च पिथौरागढ़ के धारचूला के गांव जुम्मा, नाग व रोड़ा में सिलेंडर 1800 रुपये तक का पड़ता है। ऐलागाड़ तक गैस सिलेंडर गाड़ी से पहुंचते हैं। इस पर 200 रुपये का अतिरिक्त खर्च आता है। इससे आगे सात किमी की दूरी तक सिलेंडर पैदल ले जाने वाले को 600 रुपये और देने पड़ते हैं। इसी तरह मुनस्यारी के क्यूरीजिमिया,पांतो, नामिक, कनार, बोना में भी सिलेंडर 1500 से 1800 रुपये तक पड़ता है। स्थानीय निवासी जितेंद्र वर्मा बताते हैं कि एजेंसी काफी दूर है। वहां से गांव तक सिलेंडर लाने में ढुलाई के चलते लागत बढ़ जाती है। आनंदी देवी कहती हैं कि सिलेंडर को ढोकर गांव तक लाते हैं। इसके लिए मजदूर पर 200 रुपये खर्च करने पड़ते हैं। For Hindustan : हिन्दुस्तान ईसमाचार पत्र के लिए क्लिक करें epaper.livehindustan.com | hindi |
Rajasthan: अंतरराष्ट्रीय तीरंदाज लिंबाराम को उपचार के लिए राजस्थान सरकार ने दी 10 लाख की आर्थिक मदद संवाद सूत्र, उदयपुर। कई साल से दिमाग की गंभीर बीमारी से जूझ रहे अंतरराष्ट्रीय तीरंदाज रहे लिंबाराम के उपचार के लिए मुख्यमंत्री सहायता कोष से 10 लाख रुपये की आर्थिक सहायता मंजूर की गई है। न्यूरोडीजेनेरेटिव और सिजोफ्रेनिया नामक बीमारी से पीड़ित लिंबाराम का उपचार उत्तर प्रदेश में गाजियाबाद के यशोदा अस्पताल में जारी है। जहां लिंबाराम की हालत स्थिर बनी हुई है। लिंबाराम राजस्थान में उदयपुर की झाड़ोल तहसील के सरादीत गांव के रहने वाले हैं। राजस्थान के मुख्यमंत्री अशोक गहलोत को लिंबाराम के परिवार की आर्थिक स्थिति का पता चला तो उन्होंने मुख्यमंत्री सहायता कोष से दस लाख रुपये की आर्थिक सहायता मंजूर कर दी। इसके अलावा दिल्ली में प्रमुख आवासीय आयुक्त शुभ्रा सिंह को उनकी हरसंभव सहायता करने के भी निर्देश दिए। इसके बाद प्रमुख आवासीय आयुक्त शुक्रवार को दिल्ली के जवाहरलाल नेहरू स्टेडियम स्पोर्ट्स हास्टल पहुंचीं, जहां लिंबाराम के परिजन ठहरे हुए हैं। उन्होंने लिंबाराम के स्वास्थ्य के बारे में जानकारी ली। इस बीच, लिंबाराम ने राहत के लिए मुख्यमंत्री अशोक गहलोत का आभार जताया है। उल्लेखनीय है कि राजस्थान ही नहीं देश का नाम रोशन करने वाले तीरंदाज लिंबाराम पद्मश्री तथा अर्जुन पुरस्कार से सम्मानित हैं।गौरतलब है कि लिंबा राम पहले तीरंदाज थे, जिन्होंने अंतरराष्ट्रीय तीरंदाजी फलक पर न सिर्फ भारत का नाम रोशन किया, बल्कि टाटा तीरंदाजी अकादमी को भी नई पहचान दी। लिंबा राम ने 1989 में भारतीय तीरंदाज लिंबा राम ने एशियन चैंपियनशिप में व्यक्तिगत स्पर्धा में रजत पदक व टीम स्पर्धा में स्वर्ण पदक जीता। पद्मश्री से सम्मानित लिंबा राम ने 1989 में सियोल ओलंपिक में भारत का प्रतिनिधित्व किया था। 1995 में बीजिंग में आयोजित एशिया कप तीरंदाजी की टीम स्पर्धा में स्वर्ण व व्यक्तिगत स्पर्धा में रजत जीतने वाले वाले लिंबा राम ने 1995 में नई दिल्ली में आयोजित कामनवेल्थ गेम्स तीरंदाजी में भी दो पदक अपने नाम किए थे। लिंबाराम पिछले काफी समय से बीमार हैं। | hindi |
extern crate clap;
use clap::{App, Arg};
#[test]
fn stdin_char() {
let r = App::new("opts")
.arg( Arg::from_usage("-f [flag] 'some flag'") )
.get_matches_from_safe(vec!["", "-f", "-"]);
assert!(r.is_ok());
let m = r.unwrap();
assert!(m.is_present("f"));
assert_eq!(m.value_of("f").unwrap(), "-");
}
#[test]
fn opts_using_short() {
let r = App::new("opts")
.args(&[
Arg::from_usage("-f [flag] 'some flag'"),
Arg::from_usage("-c [color] 'some other flag'")
])
.get_matches_from_safe(vec!["", "-f", "some", "-c", "other"]);
assert!(r.is_ok());
let m = r.unwrap();
assert!(m.is_present("f"));
assert_eq!(m.value_of("f").unwrap(), "some");
assert!(m.is_present("c"));
assert_eq!(m.value_of("c").unwrap(), "other");
}
#[test]
fn lots_o_vals() {
let r = App::new("opts")
.arg(
Arg::from_usage("-o [opt]... 'some opt'"),
)
.get_matches_from_safe(vec!["", "-o",
"some", "some", "some", "some", "some", "some", "some", "some", "some", "some", "some",
"some", "some", "some", "some", "some", "some", "some", "some", "some", "some", "some",
"some", "some", "some", "some", "some", "some", "some", "some", "some", "some", "some",
"some", "some", "some", "some", "some", "some", "some", "some", "some", "some", "some",
"some", "some", "some", "some", "some", "some", "some", "some", "some", "some", "some",
"some", "some", "some", "some", "some", "some", "some", "some", "some", "some", "some",
"some", "some", "some", "some", "some", "some", "some", "some", "some", "some", "some",
"some", "some", "some", "some", "some", "some", "some", "some", "some", "some", "some",
"some", "some", "some", "some", "some", "some", "some", "some", "some", "some", "some",
"some", "some", "some", "some", "some", "some", "some", "some", "some", "some", "some",
"some", "some", "some", "some", "some", "some", "some", "some", "some", "some", "some",
"some", "some", "some", "some", "some", "some", "some", "some", "some", "some", "some",
"some", "some", "some", "some", "some", "some", "some", "some", "some", "some", "some",
"some", "some", "some", "some", "some", "some", "some", "some", "some", "some", "some",
"some", "some", "some", "some", "some", "some", "some", "some", "some", "some", "some",
"some", "some", "some", "some", "some", "some", "some", "some", "some", "some", "some",
"some", "some", "some", "some", "some", "some", "some", "some", "some", "some", "some",
"some", "some", "some", "some", "some", "some", "some", "some", "some", "some", "some",
"some", "some", "some", "some", "some", "some", "some", "some", "some", "some", "some",
"some", "some", "some", "some", "some", "some", "some", "some", "some", "some", "some",
"some", "some", "some", "some", "some", "some", "some", "some", "some", "some", "some",
"some", "some", "some", "some", "some", "some", "some", "some", "some", "some", "some",
"some", "some", "some", "some", "some", "some", "some", "some", "some", "some", "some",
"some", "some", "some", "some", "some", "some", "some", "some", "some", "some", "some",
"some", "some", "some", "some", "some", "some", "some", "some", "some", "some", "some",
"some", "some", "some", "some", "some", "some", "some", "some", "some", "some", "some",
"some", "some", "some", "some", "some", "some", "some", "some", "some", "some", "some",
]);
assert!(r.is_ok());
let m = r.unwrap();
assert!(m.is_present("o"));
assert_eq!(m.values_of("o").unwrap().collect::<Vec<_>>().len(), 297); // i.e. more than u8
}
#[test]
fn opts_using_long_space() {
let r = App::new("opts")
.args(&[
Arg::from_usage("--flag [flag] 'some flag'"),
Arg::from_usage("--color [color] 'some other flag'")
])
.get_matches_from_safe(vec!["", "--flag", "some", "--color", "other"]);
assert!(r.is_ok());
let m = r.unwrap();
assert!(m.is_present("flag"));
assert_eq!(m.value_of("flag").unwrap(), "some");
assert!(m.is_present("color"));
assert_eq!(m.value_of("color").unwrap(), "other");
}
#[test]
fn opts_using_long_equals() {
let r = App::new("opts")
.args(&[
Arg::from_usage("--flag [flag] 'some flag'"),
Arg::from_usage("--color [color] 'some other flag'")
])
.get_matches_from_safe(vec!["", "--flag=some", "--color=other"]);
assert!(r.is_ok());
let m = r.unwrap();
assert!(m.is_present("flag"));
assert_eq!(m.value_of("flag").unwrap(), "some");
assert!(m.is_present("color"));
assert_eq!(m.value_of("color").unwrap(), "other");
}
#[test]
fn opts_using_mixed() {
let r = App::new("opts")
.args(&[
Arg::from_usage("-f, --flag [flag] 'some flag'"),
Arg::from_usage("-c, --color [color] 'some other flag'")
])
.get_matches_from_safe(vec!["", "-f", "some", "--color", "other"]);
assert!(r.is_ok());
let m = r.unwrap();
assert!(m.is_present("flag"));
assert_eq!(m.value_of("flag").unwrap(), "some");
assert!(m.is_present("color"));
assert_eq!(m.value_of("color").unwrap(), "other");
}
#[test]
fn opts_using_mixed2() {
let r = App::new("opts")
.args(&[
Arg::from_usage("-f, --flag [flag] 'some flag'"),
Arg::from_usage("-c, --color [color] 'some other flag'")
])
.get_matches_from_safe(vec!["", "--flag=some", "-c", "other"]);
assert!(r.is_ok());
let m = r.unwrap();
assert!(m.is_present("flag"));
assert_eq!(m.value_of("flag").unwrap(), "some");
assert!(m.is_present("color"));
assert_eq!(m.value_of("color").unwrap(), "other");
}
#[test]
fn default_values_default() {
let r = App::new("df")
.arg( Arg::from_usage("-o [opt] 'some opt'")
.default_value("default"))
.get_matches_from_safe(vec![""]);
assert!(r.is_ok());
let m = r.unwrap();
assert!(m.is_present("o"));
assert_eq!(m.value_of("o").unwrap(), "default");
}
#[test]
fn default_values_user_value() {
let r = App::new("df")
.arg( Arg::from_usage("-o [opt] 'some opt'")
.default_value("default"))
.get_matches_from_safe(vec!["", "-o", "value"]);
assert!(r.is_ok());
let m = r.unwrap();
assert!(m.is_present("o"));
assert_eq!(m.value_of("o").unwrap(), "value");
}
| code |
ರಮ್ಯಾನರೇಶ್ ಪ್ಯೂರ್ ಲವ್ ಸ್ಟೋರಿ ಶುರುವಾಗಿದ್ದು ಹೇಗೆ? ನರೇಶ್ ಪದೇ ಪದೇ ಬೆಂಗಳೂರಿಗೆ ಬರ್ತಿದ್ದದ್ದು ಏಕೆ? ನರೇಶ್ರಮ್ಯಾರದ್ದು ಪ್ಯೂರ್ ಲವ್ ಸ್ಟೋರಿ. ಒಬ್ರನ್ನೊಬ್ರು ಇಷ್ಟಪಟ್ಟು ಮನೆಯವರನ್ನ ಒಪ್ಪಿಸಿ ಮದುವೆ ಆದವರು. ಇನ್ಫ್ಯಾಕ್ಟ್ ನರೇಶ್ಗೆ ಅದಾಗಲೇ ಎರಡು ಮದುವೆ ಆಗಿ ಡಿವೋರ್ಸ್ ಆಗಿದೆ ಅಂತ ಗೊತ್ತಿದ್ರು ರಮ್ಯಾ ಮೂರನೇ ಮದುವೆ ಆಗೋಕೆ ರೆಡಿಯಾದ್ರು. ಬೀಕಾಸ್ ಆಫ್ ಲವ್. ನರೇಶ್ ಮತ್ತು ರಮ್ಯಾ ನಡುವೆ ಪರಿಚಯ ಆಗಿದ್ದು ಯಾವಾಗ? ಇವರಿಬ್ಬರ ನಡುವೆ ಪ್ರೀತಿ ಹುಟ್ಟಿದ್ದು ಯಾವಾಗ ಅನ್ನೋದನ್ನ ಹೇಳೋಕು ಈ ಮುಂಚೆ ಇವರಿಬ್ಬರ ಫ್ಯಾಮಿಲಿ ಬ್ಯಾಕ್ರೌಂಡ್ ನೋಡೋದು ಉತ್ತಮ. ನರೇಶ್ ವಿಷ್ಯಕ್ಕೆ ಬಂದ್ರೆ ನರೇಶ್ ತೆಲುಗಿನ ಖ್ಯಾತ ನಟಿ ವಿಜಯ ನಿರ್ಮಲಾ ಮತ್ತು ಸೂಪರ್ ಸ್ಟಾರ್ ಕೃಷ್ಣ ದಂಪತಿಯ ಮಗ ಎಂದೇ ಎಲ್ಲರು ತಿಳಿದುಕೊಂಡಿದ್ದಾರೆ. ಬಟ್, ಇದು ರಾಂಗು. ನರೇಶ್ ಅವರ ತಾಯಿ ವಿಜಯ ನಿರ್ಮಲಾ ಅವರೇ. ಬಟ್, ತಂದೆ ಹೆಸರು ಕೃಷ್ಣ ಮೂರ್ತಿ. ಕೃಷ್ಣಮೂರ್ತಿ ಜೊತೆಗಿನ ಡಿವೋರ್ಸ್ ನಂತರ ವಿಜಯ ನಿರ್ಮಲಾ ಸೂಪರ್ ಸ್ಟಾರ್ ಕೃಷ್ಣ ಜೊತೆ ಎರಡನೇ ವಿವಾಹವಾದರು. ಇನ್ನು ವಿಜಯ ನಿರ್ಮಲಾ ನಟಿ ಹಾಗೂ ಖ್ಯಾತ ನಿರ್ದೇಶಕಿ.. ತೆಲುಗಿನಲ್ಲಿ 44 ಚಿತ್ರಗಳಿಗೆ ನಿರ್ದೇಶನ ಮಾಡಿರೋ ವಿಜಯ ನಿರ್ಮಲಾ ಅವರು ಗಿನ್ನಿಸ್ ದಾಖಲೆ ಸಹ ಮಾಡಿದ್ದಾರೆ. ಇಂಥಾ ಫ್ಯಾಮಿಲಿ ಹಿನ್ನೆಲೆಯಿರೋ ನರೇಶ್ ಬಾಬು ಕೂಡ ತುಂಬಾ ಬೇಗನೇ ಇಂಡಸ್ಟ್ರಿಗೆ ಎಂಟ್ರಿಯಾಗಿ ಬಾಲ ನಟನಾಗಿ, ಹೀರೋ ಆಗಿ, ಪೋಷಕ ನಟನಾಗಿ ಇಂಡಸ್ಟ್ರಿಯಲ್ಲಿ ಪ್ರಭಾವ ಸಾಧಿಸಿದ್ರು. ರಮ್ಯಾ ವಿಚಾರಕ್ಕೆ ಬಂದ್ರೆ ರಮ್ಯಾ ಅವರದ್ದೇನು ಸಾಮಾನ್ಯ ಫ್ಯಾಮಿಲಿಯಲ್ಲ. ಬೆಂಗಳೂರಿನ ಪ್ರತಿಷ್ಠಿತ ಹೋಟೆಲ್ ಉದ್ಯಮಿ ಮೋತಿಲಾಲ್ ಕುಟುಂಬದ ಕುಡಿ. ರಘುಪತಿ ಅವರ ಮಗಳು. ರಮ್ಯಾ ಅವರ ಚಿಕ್ಕಪ್ಪ ಆಂಧ್ರಪ್ರದೇಶದ ಸರ್ಕಾರದಲ್ಲಿ ರೆವಿನ್ಯೂ ಮಿನಿಸ್ಟರ್ ಆಗಿದ್ರು. ದೊಡ್ಡ ಬಿಸಿನೆಸ್ ಕುಟುಂಬದ ಮಗಳಾದ ರಮ್ಯಾ ಆಸ್ಟ್ರೇಲಿಯಾದಲ್ಲಿ ಸಿನಿಮಾ ಕೋರ್ಸ್ ಮಾಡಿದ್ದಾರೆ. ಸಿನಿಮಾಟೋಗ್ರಫಿಯಲ್ಲಿ ಸ್ಪೆಷಲಿಸ್ಟ್ ಆಗಿದ್ರು. ನರೇಶ್ ಬಾಳಲ್ಲಿ ರಮ್ಯಾ ಬರೋವೇಳೆ ನರೇಶ್ಗೆ ಎರಡು ಮದುವೆಯಾಗಿತ್ತು. ಇಬ್ಬರಿಂದಲೂ ಡಿವೋರ್ಸ್ ಪಡೆದಿದ್ರು. ಅಮ್ಮನ ಜೊತೆ ಒಂಟಿಯಾಗಿ ಲೈಫ್ ಲೀಡ್ ಮಾಡ್ತಿದ್ರು. ಆಗ ನಂದನವನಂ ಸಿನಿಮಾ ಸೆಟ್ನಲ್ಲಿ ಫಾರ್ ದಿ ಫಸ್ಟ್ ಟೈಂ ರಮ್ಯಾ ಮತ್ತು ನರೇಶ್ ಅವರ ಪರಿಚಯ ಆಗುತ್ತೆ. ಆದ್ರೆ, ಆಗ ಹೆಚ್ಚೇನೂ ಮಾತಾಡಲ್ಲ. ಆಮೇಲೆ ಮತ್ತೆ ಮತ್ತೆ ಭೇಟಿಯಾದಾಗ ಮಾತಿಗೆ ಮಾತು ಬೆರೆಯಿತು. ಸಿನಿಮಾರಂಗದಲ್ಲಿ ಕೆಲಸ ಮಾಡ್ಬೇಕು ಅಂದುಕೊಂಡಿದ್ದ ರಮ್ಯಾ, ನರೇಶ್ ಅವರ ತಾಯಿ ವಿಜಯ ನಿರ್ಮಲಾ ಬಳಿ ಅಸಿಸ್ಟಂಟ್ ಆಗಿ ಕೆಲಸಕ್ಕೂ ಸೇರಿ ಬಿಡ್ತಾರೆ. ಅಮ್ಮನ ಬಳಿ ಅಸಿಸ್ಟಂಟ್ ಆದ್ಮೇಲೆ ನರೇಶ್ಗೆ ಇನ್ನು ಹತ್ತಿರವಾದರು. ಮನೆಗೂ ರಮ್ಯಾ ಬರೋದಕ್ಕೆ ಶುರು ಮಾಡಿದ್ರು. ಇಲ್ಲಿಂದ ನರೇಶ್ ಮತ್ತು ರಮ್ಯಾ ಫ್ರೆಂಡ್ಷಿಪ್ ನಿಧಾನವಾಗಿ ಬಿಲ್ಡ್ ಆಗ್ತಾ ಹೋಯ್ತು. ನರೇಶ್ ಬಾಬು ಮೂರನೇ ಪತ್ನಿ ರಮ್ಯಾನ ಬಗ್ಗೆ ಪರಿಚಯದ ಬಗ್ಗೆ ಹೇಳಿದ್ದು ಹೀಗೆ.. ನಂದನವನಂ ಸೆಟ್ನಲ್ಲಿ ಮೊದಲ ಸಲ ಮೀಟ್ ಮಾಡಿದೆ. ಆಸ್ಟ್ರೇಲಿಯಾದಲ್ಲಿ ಸಿನಿಮಾ ಕೋರ್ಸ್ ಮಾಡಿದ್ದಾರೆ. ಆಗ ನಾವು ಜಸ್ಟ್ ಫ್ರೆಂಡ್ ಅಷ್ಟೆ. ಆಗಾಗ ಭೇಟಿ ಆಗ್ತಿದ್ವಿ ಅಷ್ಟೇ. ಆಮೇಲೆ ನಮ್ಮ ಅಮ್ಮನ ಬಳಿ ಅಸಿಸ್ಟಂಟ್ ಆಗಿ ಕೆಲಸಕ್ಕೆ ಸೇರಿಕೊಂಡ್ರು. ತದನಂತರ ಮನೆಗೂ ಪರಿಚಯ ಆದರು. ನಾವು ಮೀಟ್ ಮಾಡಿ ಹತ್ತು ವರ್ಷ ಆಗಿದೆ. ಒಬ್ಬರಿಗೊಬ್ಬರು ಕೇರ್ ಮಾಡ್ತಿದ್ವಿ. ಅವರು ನನಗೆ ಈ ಕಲರ್ ಸೂಟ್ ಆಗಲ್ಲ ಅಂತ ಹೇಳ್ತಿದ್ರು, ನಾನು ಅವರಿಗೆ ಈ ಕಲರ್ ಶರ್ಟ್ ಸೂಟ್ ಆಗಲ್ಲ ಅಂತಿದ್ದೆ. ಇದು ಇನ್ನೊಂದು ಲೆವೆಲ್ಗೆ ಹೋಯ್ತು. ನಿನಗೆ ಈ ಥರಾ ಹುಡುಗಿ ಕರೆಕ್ಟ್ ಅಲ್ಲ, ನಿನಗೆ ಈ ಥರಾ ಹುಡುಗ ಕರೆಕ್ಟ್ ಅಂತ ಮಾತಾಡ್ತಿದ್ವಿ. ಕೊನೆಗೆ ನಾವಿಬ್ಬರು ಒಬ್ಬರಿಗೊಬ್ಬರು ಚೆನ್ನಾಗಿ ಅರ್ಥ ಮಾಡಿಕೊಂಡಿದ್ದೀವಿ ಗೊತ್ತಾಯ್ತು. ನಾನು ಈ ವಿಷ್ಯವನ್ನ ನಮ್ಮ ಆಂಟಿಯಿಂದ ಅಮ್ಮನಿಗೆ ಹೇಳಿಸಿದೆ. ಅಮ್ಮನೂ ಖುಷಿಪಟ್ರು. ಒಳ್ಳೆಯ ಹುಡುಗಿ, ಅವರ ಮನೆಯವರ ಹತ್ತಿರ ಮಾತಾಡೋಣ ಅಂದ್ರು. ನನ್ನ ಕುಟುಂಬ ಲವ್ ಮ್ಯಾರೇಜ್ನ ಒಪ್ಪಲಿಲ್ಲ. ಅದರಲ್ಲೂ ನಮ್ಮ ಅಮ್ಮನನ್ನ ಒಪ್ಪಿಸೋದು ತುಂಬಾ ಕಷ್ಟ ಆಗಿತ್ತು. ನಮ್ಮ ತಾತ ಇದಕ್ಕೆ ಮೊದಲು ಒಪ್ಪಿದ್ರು.ನಂದನವನಂ ಆದ್ಮೇಲೆ ನರೇಶ್ ಜೊತೆ ತುಂಬಾ ಕನೆಕ್ಟ್ ಆದೆ. ಈ ಮಧ್ಯೆ ಒಂದು ಆರು ವರ್ಷ ನಾನು ತುಂಬಾ ಡಿಪ್ರೆಸ್ ಆಗಿದ್ದೆ, ನಮ್ಮ ತಂದೆ ಕಳೆದುಕೊಂಡು ನೋವಲ್ಲಿದ್ದೆ. ಈ ಸಮಯದಲ್ಲಿ ನನಗೋಸ್ಕರ ಬೆಂಗಳೂರಿಗೆ ಬರ್ತಿದ್ರು. ನಮ್ಮ ತಾತ ಅನಾರೋಗ್ಯದಲ್ಲಿದ್ದಾಗ, ನೀವು ನಂಬಲ್ಲ 9 ಗಂಟೆಗೆ ಶೂಟಿಂಗ್ ಮುಗಿಸಿಕೊಂಡು ನೈಟ್ ಫ್ಲೈಟ್ನಲ್ಲಿ ಬೆಂಗಳೂರಿಗೆ ಬಂದು ನನ್ನ ಜೊತೆ ಆಸ್ಪತ್ರೆಯಲ್ಲಿರ್ತಿದ್ರು. ಮತ್ತೆ ಬೆಳಗ್ಗೆ ಫ್ಲೈಟ್ನಲ್ಲಿ ಶೂಟಿಂಗ್ ಲೋಕೇಶನ್ಗೆ ಹೋಗ್ಬಿಡ್ತಿದ್ರು. ಇದು ಕೂಡ ಫ್ರೆಂಡ್ಷಿಪ್ನಲ್ಲಿ ಬರ್ತಿದ್ರು. ನರೇಶ್.. ನಾನು ಅವಳಿಗೆ ಸಪೋರ್ಟ್ ಮಾಡ್ಬೇಕಿತ್ತು. ಅದಕ್ಕಾಗಿ ನಾನು ಬರ್ತಿದ್ದೆ. ಆಕೆ ಸ್ಟ್ರೈಟ್ ಫಾರ್ವಡ್, ನೀನು ಪ್ಯೂರ್ ಬಂಗಾರ ಅಂತ ಯಾವಾಗಲೂ ಹೇಳ್ತಿರ್ತಿನಿ. ಒಂದೊಂದು ಸಲ ಕೋಪ ಬರುತ್ತೆ, ಆದರೂ ನಾನು ಬೇರೆಯವರ ಬಗ್ಗೆ ಆಲೋಚನೆ ಮಾಡ್ತೇನೆ. ಇದು 2013ರಲ್ಲಿ ಯೂಟ್ಯೂಬ್ನಲ್ಲಿ ಅಪ್ಲೋಡ್ ಆಗಿರೋ ಇಂಟರ್ವ್ಯೂ. ಆಗ ನರೇಶ್ರಮ್ಯಾ ಮದುವೆಯಾಗಿ ಮೂರು ವರ್ಷ ಆಗಿತ್ತಷ್ಟೇ. ಇಷ್ಟು ಇಷ್ಟಪಟ್ಟು ಮದುವೆಯಾದರೋ, ಇಷ್ಟು ನಂಬಿಕೆಯಿಟ್ಟು ಮದುವೆಯಾದರೋ ಇಂದು ನೀನು ಸರಿಯಿಲ್ಲ, ನಾನು ಸರಿಯಿಲ್ಲ ಅಂತಾ ಬೀದಿಗೆ ಬಂದು ಕಿತ್ತಾಡ್ತಿದ್ದಾರೆ. ಹಳೆಯ ಇಂಟರ್ವ್ಯೂನಲ್ಲಿ ಕೇಳಿದಂತೆ ಇಷ್ಟು ಹ್ಯಾಪಿಯಾಗಿಲ್ಲ ಇವರ ಲವ್ ಅಂಡ್ ಲೈಫ್ ಸ್ಟೋರಿ. ಈ ಲವ್ ಹಾಗೂ ಲೈಫ್ ಹಿಂದೇ ಬೇರೆಯದ್ದೇ ಕಥೆ ಇದೆ. ಇದನ್ನ ರಮ್ಯಾ ಅವರು ಎಳೆ ಎಳೆಯಾಗಿ ಬಿಚ್ಚಿಟ್ಟಿದ್ದಾರೆ. ನರೇಶ್ ಪ್ರೀತಿ ನಿಜವಲ್ಲ. ನರೇಶ್ ಪ್ರೀತಿಯ ಹಿಂದೆ ಮೋಸ, ವಂಚನೆ ತುಂಬಿದೆ ಅಂತ ಪತ್ನಿ ರಮ್ಯಾ ಸಿಡಿದೆದ್ದಿದ್ದಾರೆ. | kannad |
Definition : Tuberculin/allergy syringes that still includes a needle preattached to their Luer slip tip, that are designed to provide needle stick protection (safety). These syringes include some mechanism (manually positioned or activated) intended either to shield, blunt, or recess the needle after use or, by some other means, to lessen the possibility of contact of the healthcare provider with a sharp needle. The tapered Luer tip (i.e., Luer slip) allows the two mating tapered fittings to slip-fit into each other while yet permitting the parts to be readily separated.
Entry Terms : "Luer Slip Syringes" , "Syringes, Tuberculin, Shielded-Needle" , "Needlestick Prevention Devices" , "Sharps Injury Prevention Devices" | english |
The Siren SE812 Siren will warn everybody in the building by a loud sound and a flashing light that an alarm has occurred. This product is especially suited to use in combination with other Z-Wave devices such as sensors. Warning by sound and light The SE812 Siren gives a loud sound and a flashing warning light, so everybody in the building will know immediately that an alarm has occurred. You can choose to activate the siren either by burglary alarm or by a smoke alarm or activate the siren by both alarms. It is even possible to install multiple sirens, so the alarm can be heard loudly at multiple locations. The SE812 Siren has an adjustable jumper inside, so you can choose between either a 90dB or a 100 dB volume of the siren. Powered by power supply or batteries Choose either the included batteries or a power supply to power your siren. When using batteries, the siren will give a warning when the batteries are almost empty. | english |
சிறப்பு அந்தஸ்து நீக்கப்பட்ட பின் காஷ்மீரில் நிலங்களை வாங்கியது எத்தனை பேர் தெரியுமா..? ஜம்முகாஷ்மீர் மாநிலத்திற்கான சிறப்பு அந்தஸ்த்து நீக்கப்பட்ட பிறகு இதுவரை 7 நிலங்கள் மட்டுமே வெளி நபர்களால் வாங்கப்பட்டுள்ளது என மத்திய உள்துறை அமைச்சகம் தெரிவித்துள்ளது. ஜம்மு காஷ்மீர் மாநிலத்திற்கு வழங்கப்பட்ட சிறப்பு அந்தஸ்து நீக்கம் செய்யப் பட்டதற்கு பிறகு கடந்த 2020 அக்டோபர் மாதம் புதிய நிலச் சட்டத்தை மத்திய அரசு அறிவித்தது. இதன் மூலம் ஜம்மு காஷ்மீர் நிலங்கள் அம்மாநில மக்களுக்கு மட்டுமே என்ற ஏகபோக உரிமை என்பது முடிவுக்கு கொண்டுவரப்பட்டது. அதே நேரத்தில் ஜம்மு காஷ்மீரில் யார் வேண்டுமானாலும் நிலம் வாங்கலாம் என்ற முறை அமல்படுத்தப்பட்டது. ஜம்மு காஷ்மீர் அல்லாத ஒருவரும் நிலம் வாங்கலாம் என்ற விதிமுறை திருத்தப்பட்ட பிறகு மாநிலத்தின் வளர்ச்சி அதிக அளவில் உயரும் என மத்திய அரசு தெரிவித்திருந்தது. இந்நிலையில், தற்போது நடைபெற்று வரும் நாடாளுமன்ற குளிர்கால கூட்டத்தொடரில் ஜம்மு காஷ்மீர் அல்லாத எத்தனை பேர் அங்கு நிலம் வாங்கி இருக்கிறார்கள்? என்பது தொடர்பாக எழுத்துப்பூர்வமாக உறுப்பினர் ஒருவர் மாநிலங்களவையில் கேள்வி எழுப்பியிருந்தார். இதற்கு பதிலளித்துள்ள மத்திய உள்துறை இணை அமைச்சர் நித்தியானந்தா ராய், ஜம்மு காஷ்மீர் மாநில அரசிடமிருந்து பெறப்பட்ட தகவல்களின்படி புதிய நில சட்டம் அமல்படுத்தப்பட்ட பிறகு ஜம்மு காஷ்மீர் மாநிலத்தவர் அல்லாதவர்கள் 7 இடங்களை வாங்கி உள்ளதாகவும், அந்த குறிப்பிட்ட 7 இடங்களும் ஜம்முவில் இருப்பதாகவும் தெரிவித்துள்ளார். | tamil |
ನೀವು ಜನಧನ್ ಖಾತೆ ಹೊಂದಿದವರಿಗೆ ಗುಡ್ ನ್ಯೂಸ್ ನವದೆಹಲಿ: ನೀವು ಜನಧನ್ ಖಾತೆ ಹೊಂದಿರುವವರು ಸರ್ಕಾರದಿಂದ ಯಾವುದೇ ಪ್ರಯೋಜನವನ್ನು ಪಡೆಯಲು ಆಧಾರ್ ಕಾರ್ಡ್ ಅನ್ನು ಜನಧನ್ ಖಾತೆಗೆ ಲಿಂಕ್ ಮಾಡಿದ್ರೆ ಇದರಿಂದ ಅನೇಕ ಸೌಲಭ್ಯಗಳೊಂದಿಗೆ 1 ಲಕ್ಷ ಅಪಘಾತ ವಿಮೆ, 30000 ಆಕ್ಸಿಡೆಂಟಲ್ ಡೆತ್ ಇನ್ಶುರೆನ್ಸ್ ಕವರ್ ದೊರೆಯುತ್ತದೆ. ಒಂದು ವೇಳೆ ನೀವು ಆಧಾರ್ ಕಾರ್ಡ್ ಅನ್ನು ಜನಧನ್ ಖಾತೆಗೆ ಲಿಂಕ್ ಮಾಡದಿದ್ದರೆ, ಸಮೀಪದ ಬ್ಯಾಂಕ್ ಶಾಖೆಗೆ ತೆರಳಿ ನಿಮ್ಮ ಖಾತೆ ಜೊತೆ ಆಧಾರ್ ಕಾರ್ಡ್ ಅನ್ನು ಲಿಂಕ್ ಮಾಡಿ ಸೌಲಭ್ಯ ಪಡೆಯಬಹುದು.! | kannad |
সল্টলেক আবাসনের ১১ তলা থেকে মরণঝাঁপ যুবকের, মৃত্যুর কারণ নিয়ে ধোঁয়াশা প্রথম কলকাতা সল্টলেকের এক আবাসনের ১১ তলা থেকে ঝাঁপ দেওয়ায় মৃত্যু হল এক যুবকের ওই আবাসনটি কলকাতা পুলিশের আবাসন এই মৃত্যু আত্মহত্যা নাকি যুবককে ঠেলে ফেলে দেওয়া হয়েছে তা নিয়ে ধোঁয়াশা তৈরি হয়েছে নাকি নিছকই একটি দুর্ঘটনা? এখনও পর্যন্ত সে বিষয়ে কিছুই জানতে পারা যায় নি এই ঘটনার তদন্তে নেমেছে বিধান নগর উত্তর থানার পুলিশ ওই আবাসনের কর্মরত মিস্ত্রি এবং আবাসনের বাসিন্দাদেরও জিজ্ঞাসাবাদ করা হচ্ছে বলে জানা যায় ওই আবাসনের এক বাসিন্দা জানান, বুধবার সকাল দশটা নাগাদ হঠাত্ জোরে একটা শব্দ পাওয়া যায় তারপর ওই আবাসনের বাসিন্দারা তড়িঘড়ি ঘর থেকে বেরিয়ে এসে দেখেন যে নিচে পড়ে রয়েছে একটি যুবক রক্তে ভেসে যাচ্ছে জায়গাটি চাঞ্চল্য সৃষ্টি হয় এলাকায় খবর দেওয়া হয় থানায় এসে উপস্থিত হয় বিধান নগর উত্তর থানার পুলিশ মৃত ওই যুবককে উদ্ধার করে নিয়ে যাওয়া হয় হাসপাতালে কিন্তু তাঁর আগেই যুবকের মৃত্যু হয়েছিল তবে স্থানীয় বাসিন্দারা জানান যে এই যুবক সল্টলেক কলকাতা পুলিশ আবাসনের বাসিন্দা নন আপাতত তাঁর দেহ ময়নাতদন্তের জন্য পাঠানো হয়েছে ওই যুবকের কাছ থেকে একটি ফোন উদ্ধার করা যায় কিন্তু সেই ফোনটি খোলা সম্ভব হয়নি যুবকের ফোনে তাঁর বন্ধুর ফোন আসতে জানা যায় যে ওই যুবকের নাম পার্থসারথি পাল সে সল্টলেকেরই বাসিন্দা কিন্তু এই আবাসনের বাসিন্দা না হওয়া সত্ত্বেও কেন সে আবাসনের ১১ তলায় উঠল তা জানা যায়নি অসাবধানতার কারণে আচমকাই সে ছাদ থেকে পড়ে যায় নাকি সেই সময় তাঁর সঙ্গে আরও কেউ উপস্থিত ছিল ছাদ থেকে তাকে ধাক্কা মেরে নিচে ফেলে দেওয়া হয় অথবা নিজে আত্মহত্যা করার জন্যেও ছাদ থেকে ঝাঁপ মারতে পারে সে এই যুবকের মৃত্যুতে এমন অনেকগুলো সম্ভাবনা উঠে আসছে আপাতত তদন্তকারী আধিকারিকরা ময়নাতদন্তের রিপোর্টের অপেক্ষা করছেন ইতিমধ্যে সেখান থেকে বিভিন্ন নমুনা সংগ্রহ করার কাজ শুরু হয়েছে তদন্তকারী আধিকারিকরা ওই যুবক জুতো, মাস্ক এবং ফোন উদ্ধার করেছে এছাড়াও সূত্রের খবর, তাঁর কাছ থেকে একটি সুইসাইড নোট উদ্ধার করা হয়েছে কিন্তু এই ঘটনা সংক্রান্ত আরও বেশ কিছু তথ্য সংগ্রহ করতে চাইছে পুলিশ তাই এখনই ঘটনাটিকে নিছক আত্মহত্যার ঘটনা বলে সিদ্ধান্তে আসেন নি তাঁরা | bengali |
उत्तराखंड में कोरोना: पिछले 24 घंटे में मिले 2813 नए संक्रमित, सात मरीजों की हुई मौत विस्तार प्रदेश में पिछले 24 घंटे में कोरोना के 2813 नए मामले सामने आए हैं, जबकि सात कोरोना संक्रमितों की मौत हो गई। दूसरी ओर, शुक्रवार को 3042 मरीजों ने कोरोना से जंग जीत ली।यहां कोविड से संबधित सभी नए अपडेट पढ़ें स्वास्थ्य विभाग की ओर से जारी जानकारी के मुताबिक, प्रदेश में सामने आए 2813 नए मामलों में अल्मोड़ा में 170, बागेश्वर में 87, चमोली में 67, चंपावत में 74, देहरादून में 978, हरिद्वार में 422, नैनीताल में 257, पौड़ी में 203, पिथौरागढ़ में 96, रुद्रप्रयाग में 113, टिहरी में 49, ऊधमसिंह नगर में 194 और उत्तरकाशी में 103 मामले शामिल हैं। प्रदेश में अब 30927 एक्टिव कोरोना केस हैं, जिनमें सर्वाधिक 14760 केस देहरादून जिले के हैं। कोटद्वार और आसपास के पर्वतीय क्षेत्र में 28 लोग कोरोना संक्रमित कोटद्वार नगर और आसपास के पर्वतीय क्षेत्र में 28 लोग कोरोना संक्रमित मिले हैं। स्वास्थ्य विभाग की ओर से सभी कोरोना संक्रमितों को होम आइसोलेट कर उनका उपचार शुरू कर दिया गया है। सीएमओ पौड़ी डॉ. प्रवीण कुमार ने बताया कि सिद्धबली मार्ग क्षेत्र में एक महिला, कालाबड़ क्षेत्र में एक युवक, एक महिला, एक किशोर, पदमपुर सुखरो में एक व्यक्ति, मनोहर नगर क्षेत्र में एक वृद्ध व एक महिला की कोरोना जांच रिपोर्ट पॉजिटिव आई है। कुंभीचौड़ क्षेत्र में एक वृद्ध व एक महिला, सिगड्डी व हल्दूखाता क्षेत्र में एकएक महिला, सिमलचौड़ क्षेत्र में एक महिला व एक युवक, गिंवाईस्रोत क्षेत्र में एक युवक, देवी रोड क्षेत्र में एक वृद्ध, एक वृद्धा, एक बच्चा व एक युवती की कोरोना जांच रिपोर्ट पॉजिटिव आई है। टीआरएच कौड़िया में एक व्यक्ति और दुगड्डा में एक युवक व एक व्यक्ति की कोरोना जांच रिपोर्ट पॉजिटिव आई है। द्वारीखाल ब्लाक में एक, एकेश्वर और जयहरीखाल ब्लाक में चारचार लोगों की कोरोना जांच रिपोर्ट पॉजिटिव आई है। सभी संक्रमितों को होम आइसोलेट कर उनका उपचार शुरू कर दिया गया है। दुगड्डा के चिकित्साधिकारी और कोरोना नोडल अधिकारी डा. मनोज कुमार और डा. राकेश सारंग ने बताया कि शुक्रवार को शाम चार बजे तक 360 लोगों के टेस्ट किए गए हैं। मुख्य सचिव के बाद विभाग ने किया स्कूल खोलने का आदेश मुख्य सचिव के आदेश के बाद शिक्षा विभाग ने भी कक्षा 10 से 12वीं तक के समस्त स्कूल भौतिक रूप से खोलने का आदेश जारी कर दिया है। संयुक्त सचिव की ओर से शिक्षा महानिदेशक को जारी आदेश में कहा गया है कि कक्षा एक से 9वीं तक के स्कूल अगले आदेश तक पहले की तरह बंद रहेंगे।संयुक्त सचिव जेएल शर्मा की ओर से शिक्षा महानिदेशक को जारी आदेश में कहा गया है कि कोविड19 के नए वैरिएंट ओमिक्रॉन को देखते हुए कक्षा 12 तक के सभी शिक्षण संस्थानों को अगले आदेश तक के लिए बंद किया गया था, लेकिन मुख्य सचिव के 27 जनवरी के आदेश में कक्षा 10 से 12वीं तक के स्कूलों को 31 जनवरी से खोलने का आदेश किया गया है।जबकि कक्षा एक से 9वीं तक की कक्षाओं का भौतिक संचालन पहले की तरह बंद रहेगा। इन स्कूलों में अगले आदेशों तक ऑनलाइन माध्यम से पढ़ाई होगी। आदेश में कहा गया है कि 10 से 12वीं तक के स्कूल खोले जाने के दौरान एसओपी का पालन किया जाएगा। | hindi |
पूर्व सीएम रावत ने कार्यकर्ताओं को भोजन परोसा लालकुआं। संवाददाताविधानसभा चुनाव का मतदान संपन्न हो चुका है। मतदान के दूसरे दिन पूर्व मुख्यमंत्री हरीश रावत ने कार्यकर्ताओं के साथ मुलाकात कर गौलापार सूर्या मंदिर जाकर पूजा अर्चना की। इस दौरान वह काफी उत्साहित दिखाई दिए। कहा कि कांग्रेस राज्य में पूर्ण बहुमत से सरकार बना रही है। मंगलवार को तीनपानी स्थित कैंप कार्यालय में उन्होंने दोपहर के समय कार्यकर्ताओं के लिए पूजा अर्चना का प्रसाद और भोजन परोसा। बाद में वह गौलापार के सूर्या देवी मंदिर गए। यहां पूर्व कैबिनेट मंत्री हरीश चंद्र दुर्गापाल, वरिष्ट कांग्रेसी नेता हरेंद्र बोरा, गोपाल गंगोला, गोपाल नेगी, उमेश कबडवाल, राजेंद्र खनवाल, ब्लाक प्रमुख रूपा आर्या,चेयरमैन लालचंद, राम बाबू मिश्रा, प्रमोद कालोनी, कैलाश दुम्का, अर्जून बिष्ट, पुष्कर दानू, शिवराज बिष्ट, राजेन्द्र बिष्ट, समेत तमाम लाेग मौजूद रहे। For Hindustan : हिन्दुस्तान ईसमाचार पत्र के लिए क्लिक करें epaper.livehindustan.com | hindi |
Multiethnic Brixton is South London's hub for a founding generation of Afro-Caribbean immigrants. It's a crossroad so central to the story of the African diaspora that local historians call the neighborhood - with its jerk chicken grills, reggae dance halls and vibrant mural scene - the black capital of Europe. When South African President Nelson Mandela came to Britain in 1996 he went to Buckingham Palace - and Brixton.
Carter characterized the royal couple's visit to the neighborhood as "a big statement."
For many British blacks, it's worth celebrating that the family that symbolizes Britishness will look a bit more like modern Britain, especially its capital city, which has experienced soaring rates of interracial marriage.
But the American black experience is very different from the British one. People here say a lone biracial royal-by-marriage - even if she's unusually outspoken - may have a muted impact at a time when immigration is such a toxic issue and even legal Caribbean immigrants have been made to feel unwelcome.
Afua Hirsch, author of "Brit(ish): On Race, Identity and Belonging," is keen to see what Markle does and how her arrival in Kensington Palace might change society.
As an all-white dynasty, the royal family "influences perceptions of Britishness as white identity," Hirsch said. But having a senior member who is visibly of color will "change the subconscious messaging about what it means to be British."
It's not just Markle's ethnicity - it's the way that she owns it, Hirsch said.
"I think that's because she's American," she said. "I think that's a really refreshing message. People will notice that you can be a person with a different identity, with different cultural and ethnic heritage, and you can be in a senior position in the establishment and you don't have to ignore or downplay it."
And when race does emerge, the tone of the conversation can sound strange to American ears, as in the Daily Mail headline: "Now that's upwardly mobile! How in 150 years, Meghan Markle's family went from cotton slaves to royalty via freedom in the U.S. Civil War . . . "
Britons discuss "immigration" as a proxy for race, said Nels Abbey, a former columnist for the Voice, Britain's black newspaper, and co-author of an upcoming book, "Think Like a White Man."
People will "swear to high heaven that when they are talking about immigration they are not talking about race, when clearly they are," Abbey said, adding that in the context of immigration, they "are never talking about white people from Australia."
"If you accept that the immigration debate is a racial debate, then Britain talks about race more than anything else," he said. "If you don't accept that, then Britain doesn't talk about race at all."
Writing in Elle magazine in 2016, she recalled being confused as a young girl about whether to tick the "white" or "black" box on a form. She described not being deemed black enough for black acting roles or white enough for white roles. Her mother, Doria Ragland, is black, and her father, Thomas Markle, is white.
"While my mixed heritage may have created a grey area surrounding my self-identification, keeping me with a foot on both sides of the fence, I have come to embrace that," she wrote. "To say who I am, to share where I'm from, to voice my pride in being a strong, confident mixed-race woman."
Prince Harry, too, has been atypically frank in her defense. An extraordinary palace statement in November 2016 condemned media coverage of their fledgling relationship, the "racial undertones" of opinion pieces and "the outright sexism and racism of social media trolls and web article comments."
Such commentary has continued at a low boil. This year, the leader of the U.K. Independence Party, which played a pivotal role winning the vote for Britain to leave the European Union, came under fire - and ultimately lost his job - after his girlfriend sent text messages saying that black people were "ugly" and that Markle would "taint" the royal family.
After Prince Harry recently was appointed Commonwealth youth ambassador, he revealed "the woman that I am about to marry" will be joining him in his new job. The Commonwealth, headed by the prince's grandmother, Queen Elizabeth II, includes 53 nations that were once part of the British Empire, including Canada and Australia, India and Pakistan, and dozens of countries in Africa and the Caribbean.
It is possible that the couple's roles will go global - and bolster not only the House of Windsor brand abroad, but Britain's soft power diplomacy, goodwill being in short supply these days.
Britain didn't have the same kind of civil rights movement that America did. Segregation wasn't enshrined in the law as it was in the United States. When riots erupted in Brixton in the 1980s, it was because Britain was experiencing a sort of Black Lives Matter movement, with black residents objecting to being unfairly targeted and harshly treated by police.
Today, many blacks in Britain are part of, or descended from, the Windrush generation - Commonwealth citizens from the Caribbean who were welcomed to England to help rebuild the country and fill a massive labor shortage in the decades after World War II.
In recent years, as Britain has sought to crack down on illegal immigration, Windrush migrants who couldn't provide all the paperwork to prove they were in the country legally have lost jobs, been denied health services and in some cases been threatened with deportation.
Paul Reid, director of the Black Cultural Archives, located on Brixton's Windrush Square, said that the jury is still out on Markle. She'll be judged by her actions.
"Does she help bring about change?" Reid said. "We're not silly anymore. There was a time when we would have rolled out the red carpet. 'Isn't it amazing! Can I get a selfie?' "
Reid said that now, especially after the Windrush scandals, "you have to demonstrate that you stand for something."
L.B. Brown, a 52-year-old activist and office manager, is willing to give Markle the benefit of the doubt. "She's beautiful, genuine, refreshing," Brown said. "What I like about her is I feel she's going to bring a new vibrancy. They aren't going to do normal establishment, staying in the parameters, they are going to do stuff."
Case in point, Brown said, is that a prominent British rapper has been rumored to be performing on May 19. "You have the prospect of [grime musician] Stormzy coming to your wedding," Brown said. "I mean, come on!"
Merle Mitchell, a 57-year-old nurse who was strolling through one of Brixton's street markets, said she wasn't a royalist, but Markle might change her feelings about the monarchy - not because of her race, but because of her activism.
"When Diana left, I left," she said. "But I think Meghan could restore some of what's gone. I am not saying that because she's mixed race, I'm saying that because I see the same qualities in her, her humanitarianism, that's really inspired me."
Mitchell said that there hasn't been anyone in the palace that black women can point to and say "that person looks like me."
She said, "We need a bit of color in the royal family." | english |
/* $Id$ */
/***************************************************************************
* (C) Copyright 2003-2010 - Stendhal *
***************************************************************************
***************************************************************************
* *
* This program is free software; you can redistribute it and/or modify *
* it under the terms of the GNU General Public License as published by *
* the Free Software Foundation; either version 2 of the License, or *
* (at your option) any later version. *
* *
***************************************************************************/
package games.stendhal.server.actions.pet;
import static org.hamcrest.Matchers.is;
import static org.junit.Assert.assertThat;
import games.stendhal.server.core.engine.StendhalRPZone;
import games.stendhal.server.entity.creature.Sheep;
import games.stendhal.server.entity.player.Player;
import games.stendhal.server.maps.MockStendlRPWorld;
import marauroa.common.game.RPAction;
import org.junit.After;
import org.junit.AfterClass;
import org.junit.Before;
import org.junit.BeforeClass;
import org.junit.Test;
import utilities.PlayerTestHelper;
import utilities.RPClass.SheepTestHelper;
public class NameActionTest {
@BeforeClass
public static void setUpBeforeClass() throws Exception {
MockStendlRPWorld.get();
}
@AfterClass
public static void tearDownAfterClass() throws Exception {
}
@Before
public void setUp() throws Exception {
}
@After
public void tearDown() throws Exception {
}
/**
* Tests for onActionNoArgs.
*/
@Test
public void testOnActionNoArgs() {
final RPAction action = new RPAction();
final NameAction nameAction = new NameAction();
final Player bob = PlayerTestHelper.createPlayer("bob");
nameAction.onAction(bob, action);
assertThat(bob.events().get(0).get("text"), is("Please issue the old and the new name."));
}
/**
* Tests for onActiondoesnotownoldname.
*/
@Test
public void testOnActiondoesnotownoldname() {
final RPAction action = new RPAction();
final NameAction nameAction = new NameAction();
action.put("target", "oldname");
action.put("args", "newname");
final Player bob = PlayerTestHelper.createPlayer("bob");
nameAction.onAction(bob, action);
assertThat(bob.events().get(0).get("text"), is("You don't own any oldname"));
}
/**
* Tests for onActionOwnsPetOfDifferentName.
*/
@Test
public void testOnActionOwnsPetOfDifferentName() {
final StendhalRPZone zone = new StendhalRPZone("zone");
MockStendlRPWorld.get().addRPZone(zone);
SheepTestHelper.generateRPClasses();
final RPAction action = new RPAction();
final NameAction nameAction = new NameAction();
action.put("target", "noname");
action.put("args", "newname");
final Sheep pet = new Sheep();
zone.add(pet);
final Player bob = PlayerTestHelper.createPlayer("bob");
zone.add(bob);
bob.setSheep(pet);
nameAction.onAction(bob, action);
assertThat(bob.events().get(0).get("text"), is("You don't own a pet called 'noname'"));
assertThat(pet.getTitle(), is("sheep"));
}
/**
* Tests for onActionName.
*/
@Test
public void testOnActionName() {
final StendhalRPZone zone = new StendhalRPZone("zone");
MockStendlRPWorld.get().addRPZone(zone);
SheepTestHelper.generateRPClasses();
final RPAction action = new RPAction();
final NameAction nameAction = new NameAction();
action.put("target", "sheep");
action.put("args", "newname");
final Sheep pet = new Sheep();
zone.add(pet);
final Player bob = PlayerTestHelper.createPlayer("bob");
zone.add(bob);
bob.setSheep(pet);
nameAction.onAction(bob, action);
assertThat(bob.events().get(0).get("text"), is("You changed the name of 'sheep' to 'newname'"));
assertThat(pet.getTitle(), is("newname"));
}
/**
* Tests for onActionNameWithQuotesAndSpace.
*/
@Test
public void testOnActionNameWithQuotesAndSpace() {
final StendhalRPZone zone = new StendhalRPZone("zone");
MockStendlRPWorld.get().addRPZone(zone);
SheepTestHelper.generateRPClasses();
final RPAction action = new RPAction();
final NameAction nameAction = new NameAction();
action.put("target", "sheep");
action.put("args", "' newname '");
final Sheep pet = new Sheep();
zone.add(pet);
final Player bob = PlayerTestHelper.createPlayer("bob");
zone.add(bob);
bob.setSheep(pet);
nameAction.onAction(bob, action);
assertThat(bob.events().get(0).get("text"), is("You changed the name of 'sheep' to 'newname'"));
assertThat(pet.getTitle(), is("newname"));
}
/**
* Tests for onActionNameToExisting.
*/
@Test
public void testOnActionNameToExisting() {
final StendhalRPZone zone = new StendhalRPZone("zone");
MockStendlRPWorld.get().addRPZone(zone);
SheepTestHelper.generateRPClasses();
final RPAction action = new RPAction();
final NameAction nameAction = new NameAction();
action.put("target", "sheep");
action.put("args", "sheep");
final Sheep pet = new Sheep();
zone.add(pet);
final Player bob = PlayerTestHelper.createPlayer("bob");
zone.add(bob);
bob.setSheep(pet);
nameAction.onAction(bob, action);
assertThat(bob.events().get(0).get("text"), is("You own already a pet named 'sheep'"));
}
/**
* Tests for onActionRename.
*/
@Test
public void testOnActionRename() {
final StendhalRPZone zone = new StendhalRPZone("zone");
MockStendlRPWorld.get().addRPZone(zone);
SheepTestHelper.generateRPClasses();
final RPAction action = new RPAction();
final NameAction nameAction = new NameAction();
action.put("target", "oldname");
action.put("args", "newname");
final Sheep pet = new Sheep();
pet.setTitle("oldname");
zone.add(pet);
final Player bob = PlayerTestHelper.createPlayer("bob");
zone.add(bob);
bob.setSheep(pet);
nameAction.onAction(bob, action);
assertThat(bob.events().get(0).get("text"), is("You changed the name of 'oldname' to 'newname'"));
assertThat(pet.getTitle(), is("newname"));
}
/**
* Tests for onActionRenameBack.
*/
@Test
public void testOnActionRenameBack() {
final StendhalRPZone zone = new StendhalRPZone("zone");
MockStendlRPWorld.get().addRPZone(zone);
SheepTestHelper.generateRPClasses();
final RPAction action = new RPAction();
final NameAction nameAction = new NameAction();
action.put("target", "oldname");
action.put("args", "sheep");
final Sheep pet = new Sheep();
pet.setTitle("oldname");
zone.add(pet);
final Player bob = PlayerTestHelper.createPlayer("bob");
zone.add(bob);
bob.setSheep(pet);
nameAction.onAction(bob, action);
assertThat(bob.events().get(0).get("text"), is("You changed the name of 'oldname' to 'sheep'"));
assertThat(pet.getTitle(), is("sheep"));
}
/**
* Tests for onActionRenameWithGenericName.
*/
@Test
public void testOnActionRenameWithGenericName() {
final StendhalRPZone zone = new StendhalRPZone("zone");
MockStendlRPWorld.get().addRPZone(zone);
SheepTestHelper.generateRPClasses();
final RPAction action = new RPAction();
final NameAction nameAction = new NameAction();
action.put("target", "sheep");
action.put("args", "newname");
final Sheep pet = new Sheep();
pet.setTitle("oldname");
zone.add(pet);
final Player bob = PlayerTestHelper.createPlayer("bob");
zone.add(bob);
bob.setSheep(pet);
nameAction.onAction(bob, action);
assertThat(bob.events().get(0).get("text"), is("You changed the name of 'oldname' to 'newname'"));
assertThat(pet.getTitle(), is("newname"));
}
/**
* Tests for onActionRenameBackWithGenericName.
*/
@Test
public void testOnActionRenameBackWithGenericName() {
final StendhalRPZone zone = new StendhalRPZone("zone");
MockStendlRPWorld.get().addRPZone(zone);
SheepTestHelper.generateRPClasses();
final RPAction action = new RPAction();
final NameAction nameAction = new NameAction();
action.put("target", "sheep");
action.put("args", "sheep");
final Sheep pet = new Sheep();
pet.setTitle("oldname");
zone.add(pet);
final Player bob = PlayerTestHelper.createPlayer("bob");
zone.add(bob);
bob.setSheep(pet);
nameAction.onAction(bob, action);
assertThat(bob.events().get(0).get("text"), is("You changed the name of 'oldname' to 'sheep'"));
assertThat(pet.getTitle(), is("sheep"));
}
/**
* Tests for onActionLongestName.
*/
@Test
public void testOnActionLongestName() {
final StendhalRPZone zone = new StendhalRPZone("zone");
MockStendlRPWorld.get().addRPZone(zone);
SheepTestHelper.generateRPClasses();
final RPAction action = new RPAction();
final NameAction nameAction = new NameAction();
action.put("target", "oldname");
action.put("args", "01234567890123456789");
final Sheep pet = new Sheep();
pet.setTitle("oldname");
zone.add(pet);
final Player bob = PlayerTestHelper.createPlayer("bob");
zone.add(bob);
bob.setSheep(pet);
nameAction.onAction(bob, action);
assertThat(bob.events().get(0).get("text"), is("You changed the name of 'oldname' to '01234567890123456789'"));
assertThat(pet.getTitle(), is("01234567890123456789"));
}
/**
* Tests for onActiontooLongName.
*/
@Test
public void testOnActiontooLongName() {
final StendhalRPZone zone = new StendhalRPZone("zone");
MockStendlRPWorld.get().addRPZone(zone);
SheepTestHelper.generateRPClasses();
final RPAction action = new RPAction();
final NameAction nameAction = new NameAction();
action.put("target", "oldname");
action.put("args", "012345678901234567890");
final Sheep pet = new Sheep();
pet.setTitle("oldname");
zone.add(pet);
final Player bob = PlayerTestHelper.createPlayer("bob");
zone.add(bob);
bob.setSheep(pet);
nameAction.onAction(bob, action);
assertThat(bob.events().get(0).get("text"), is("The new name of your pet must not be longer than 20 characters."));
assertThat(pet.getTitle(), is("oldname"));
}
/**
* Tests for onActionEmptyName.
*/
@Test
public void testOnActionEmptyName() {
final StendhalRPZone zone = new StendhalRPZone("zone");
MockStendlRPWorld.get().addRPZone(zone);
SheepTestHelper.generateRPClasses();
final RPAction action = new RPAction();
final NameAction nameAction = new NameAction();
action.put("target", "sheep");
action.put("args", " ");
final Sheep pet = new Sheep();
zone.add(pet);
final Player bob = PlayerTestHelper.createPlayer("bob");
zone.add(bob);
bob.setSheep(pet);
nameAction.onAction(bob, action);
assertThat(bob.events().get(0).get("text"), is("Please don't use empty names."));
assertThat(pet.getTitle(), is("sheep"));
}
}
| code |
\begin{document}
\title{Matching Dynamics with Constraints\thanks{Supported by DFG Cluster of Excellence MMCI and grant Ho 3831/3-1.}}
\author{Martin Hoefer\inst{1} \and Lisa Wagner\inst{2}}
\institute{Max-Planck-Institut f\"ur Informatik and Saarland University, Germany\\ \email{[email protected]} \and Dept. of Computer Science, RWTH Aachen University, Germany\\ \email{[email protected]}}
\date{}
\maketitle
\begin{abstract}
We study uncoordinated matching markets with additional local constraints that capture, e.g., restricted information, visibility, or externalities in markets. Each agent is a node in a fixed matching network and strives to be matched to another agent. Each agent has a complete preference list over all other agents it can be matched with. However, depending on the constraints and the current state of the game, not all possible partners are available for matching at all times.
For correlated preferences, we propose and study a general class of hedonic coalition formation games that we call coalition formation games with constraints. This class includes and extends many recently studied variants of stable matching, such as locally stable matching, socially stable matching, or friendship matching. Perhaps surprisingly, we show that all these variants are encompassed in a class of ``consistent'' instances that always allow a polynomial improvement sequence to a stable state. In addition, we show that for consistent instances there always exists a polynomial sequence to every reachable state. Our characterization is tight in the sense that we provide exponential lower bounds when each of the requirements for consistency is violated.
We also analyze matching with uncorrelated preferences, where we obtain a larger variety of results. While socially stable matching always allows a polynomial sequence to a stable state, for other classes different additional assumptions are sufficient to guarantee the same results. For the problem of reaching a \emph{given} stable state, we show {\sf NP}-hardness in almost all considered classes of matching games.
\end{abstract}
\section{Introduction}
Matching problems are at the basis of many important assignment and allocation tasks in computer science, operations research, and economics. A classic approach in all these areas is \emph{stable matching}, as it captures distributed control and rationality of participants that arise in many assignment markets. In the standard two-sided variant, there is a set of men and a set of women. Each man (woman) has a preference list over all women (men) and strives to be matched to one woman (man). A (partial) matching $M$ has a blocking pair $(m,w)$ if both $m$ and $w$ prefer each other to their current partner in $M$ (if any). A matching $M$ is stable if it has no blocking pair. A large variety of allocation problems in markets can be analyzed using variants and extensions of stable matching, e.g., the assignment of jobs to workers
, organs to patients
, students to dormitory rooms, buyers to sellers, etc. In addition, stable matching problems arise in the study of distributed resource allocation problems in networks
.
In this paper, we study uncoordinated matching markets with dynamic matching constraints. An underlying assumption in the vast majority of works on stable matching is that matching possibilities are always available -- deviations of agents are only restricted by their preferences. In contrast, many assignment markets in reality are subject to additional (dynamic) constraints in terms of information, visibility, or externalities that prohibit the formation of certain matches (in certain states). Agents might have restricted information about the population and learn about other agents only dynamically through a matching process. For example, in scientific publishing we would not expect any person to be able to write a joint paper with a possible collaborator instantaneously. Instead, agents first have to get to know about each other to engage in a cooperation. Alternatively, agents might have full information but exhibit externalities that restrict the possibility to form certain matches. For example, an agent might be more reluctant to accept a proposal from the current partner of a close friend knowing that this would leave the friend unmatched.
Recent work has started to formalize some of these intuitions in generalized matching models with dynamic restrictions. For example, the lack of information motivates \emph{socially}~\cite{AskalidisIKMP13} or \emph{locally stable matching}~\cite{ArcauteV09}, externalities between agents have been addressed in \emph{friendship matching}~\cite{AnshelevichBH13}. On a formal level, these are matching models where the definition of blocking pair is restricted beyond the condition of mutual improvement and satisfies additional constraints depending on the current matching $M$ (expressing visibility/externalities/...). Consequently, the resulting stable states are supersets of stable matchings. Our main interest in this paper are convergence properties of dynamics that evolve from iterative resolution of such restricted blocking pairs. Can a stable state be reached from every initial state? Can we reach it in a polynomial number of steps? Will randomized dynamics converge (with probability 1 and/or in expected polynomial time)? Is it possible to obtain a particular stable state from an initial state (quickly)? These questions are prominent also in the economics literature (for a small survey see below) and provide valuable insights under which conditions stable matchings will evolve (quickly) in uncoordinated markets. Also, they highlight interesting structural and algorithmic aspects of matching markets.
Perhaps surprisingly, there is a unified approach to study these questions in all the above mentioned scenarios (and additional ones) via a novel class of coalition formation games with constraints. In these games, the coalitions available for deviation in a state are specified by the interplay of generation and domination rules. We provide a tight characterization of the rules that allow to show polynomial-time convergence results. They encompass all above mentioned matching models and additional ones proposed in this paper. In addition, we provide lower bounds in each model.
\subsubsection*{Contribution and Outline}
A formal definition of stable matching games, socially stable, locally stable, and friendship matching can be found in Section~\ref{sec:prelim}. In addition, we describe a novel scenario that we term \emph{considerate matching}.
In Section~\ref{sec:correlated} we concentrate on stable matching with correlated preferences, in which each matched pair generates a single number that represents the utility of the match to both agents. Blocking pair dynamics in stable matching with correlated preferences give rise to a lexicographical potential function~\cite{AbrahamLMM08,AckermannGMRV11}. In Section~\ref{sec:constraints} we present a general approach on \emph{coalition formation games with constraints}. These games are hedonic coalition formation games, where deviating coalitions are characterized by sets of generation and domination rules. We concentrate on classes of rules that we term \emph{consistent}. For correlated preferences all matching scenarios introduced in Section~\ref{sec:prelim} can be formulated as coalition formation games with constraints and consistent rules. For games with consistent rules we show that from every initial coalition structure a stable state can be reached by a sequence of polynomially many iterative deviations. This shows that for every initial state there is always \emph{some} stable state that can be reached efficiently. In other words, there are polynomial ``paths to stability'' for all consistent games. Consistency relies on three structural assumptions, and we show that if either one of them is relaxed, the result breaks down and exponentially many deviations become necessary. This also implies that in consistent games random dynamics converge with probability 1 in the limit. While it is easy to observe convergence in expected polynomial time for socially stable matching,
such a result is impossible for all consistent games due to exponential lower bounds for locally stable matching. The question for considerate and friendship matching remains an interesting open problem.
In Section~\ref{sec:NPC} we study the same question for a given initial state and a \emph{given stable state}. We first show that if there is a sequence leading to a given stable state, then there is also another sequence to that state with polynomial length. Hence, there is a polynomial-size certificate to decide if a given (stable) state can be reached from an initial state or not. Consequently, this problem is in {\sf NP}\ for consistent games. We also provide a generic reduction in Section~\ref{sec:NPC} to show that it is {\sf NP}-complete for all, socially stable, locally stable, considerate, and friendship matching, even with strict correlated preferences in the two-sided case. Our reduction also works for traditional two-sided stable matching with either correlated preferences and ties, or strict (non-correlated) preferences.
In Section~\ref{sec:general} we study general preferences with incomplete lists and ties that are not necessarily correlated. We show that for socially and classes of considerate and friendship matching we can construct for every initial state a polynomial sequence of deviations to a stable state. Known results for locally stable matching show that such a result cannot hold for all consistent games.
\subsubsection*{Related Work}
For a general introduction to stable matching and variants of the model we refer to textbooks in the area~\cite{Manlove13}. Over the last decade, there has been significant interest in dynamics, especially in economics, but usually there is no consideration of worst-case convergence times or computational complexity. While the literature is too broad to survey here, a few directly related works are as follows. If agents iteratively resolve blocking pairs in the two-sided stable marriage problem, dynamics can cycle~\cite{Knuth76}. On the other hand, there is always a ``path to stability'', i.e., a sequence of (polynomially many) resolutions converging to a stable matching~\cite{RothVV90}. If blocking pairs are chosen uniformly at random at each step, the worst-case convergence time is exponential. In the case of weighted or correlated matching, however, random dynamics converge in expected polynomial time~\cite{AckermannGMRV11,Mathieu10}. More recently, several works studied convergence time of random dynamics using combinatorial properties of preferences~\cite{HoffmanMP13}, or the probabilities of reaching certain stable matchings via random dynamics~\cite{BiroN13}.
In the roommates problem, where every pair of players is allowed to match, stable matchings can be absent, but deciding existence can be done in polynomial time~\cite{Irving85}. If there exists a stable matching, there are also paths to stability~\cite{DiamantoudiMX04}. Similar results hold for more general concepts like $P$-stable matchings that always exist~\cite{InarraLM08}. Ergodic sets of the underlying Markov chain have been studied~\cite{InarraLM10} and related to random dynamics~\cite{KlausFW10}. Alternatively, several works have studied the computation of (variants of) stable matchings using iterative entry dynamics~\cite{BlumRR97,BlumR02,BiroCF08}, or in scenarios with payments or profit sharing~\cite{BiroBGKP14,HoeferW13WINE,AnshelevichBH13}.
Locally stable matching was introduced by~\cite{ArcauteV09} in a two-sided job-market model, in which links exist only among one partition. More recently, we studied locally stable matching with correlated preferences in the roommates case~\cite{Hoefer13}, and with strict preferences in the two-sided case~\cite{HoeferW13}. For correlated preferences, we can always reach a locally stable matching using polynomially many resolutions of local blocking pairs. The expected convergence time of random dynamics, however, is exponential. For strict non-correlated preferences, no converging sequence might exist, and existence becomes {\sf NP}-hard to decide. Even if they exist, the shortest sequence might require an exponential number of steps. These convergence properties improve drastically if agents have random memory.
Friendship and other-regarding preferences in stable matching games have been addressed by~\cite{AnshelevichBH13} in a model with pairwise externalities. They study existence of friendship matchings and bound prices of anarchy and stability in correlated games as well as games with unequal sharing of matching benefits. In friendship matching, agents strive to maximize a weighted linear combination of all agent benefits. In addition, we here propose and study considerate matching based on a friendship graph, where no agent accepts a deviation that deteriorates a friend. Such ordinal externalities have been considered before in the context of resource selection games~\cite{HoeferPPSV11}.
Our general model of coalition formation games with constraints is related to hedonic coalition formation games~\cite{Hajdukova06,Cechlarova08,BogomolnaiaJ02}. A prominent question in the literature is the existence and computational complexity of stable states (for details and references see, e.g., a recent survey~\cite{Woeginger13}).
\subsection{Preliminaries}
\label{sec:prelim}
A \emph{matching game} consists of a graph $G=(V,E)$ where $V$ is a set of vertices representing \emph{agents} and $E\subseteq \{\{u,v\}\mid u,v\in V, u\neq v\}$ defines the \emph{potential matching edges}. A \emph{state} is a matching $M\subseteq E$ such that for each $v\in V$ we have $|\{e~\mid~e\in M, v\in e\}|\leq 1$. An edge $e=\{u,v\}\in M$ provides \emph{utilities} $b_u(e), b_v(e) > 0$ for $u$ and $v$, respectively. If for every $e \in E$ we have some $b_u(e) = b_v(e)=b(e)>0$, we speak of \emph{correlated preferences}. If no explicit values are given, we will assume that each agent has an order $\succeq$ over its possible matching partners, and for every agent the utility of matching edges is given according to this ranking. In this case we speak of \emph{general preferences}. Note that in general, the ranking is allowed to be an incomplete list or to have ties. We define $B(M,u)$ to be $b_u(e)$ if $u\in e\in M$ and $0$ otherwise. A \emph{blocking pair} for matching $M$ is a pair of agents $\{u,v\} \not\in M$ such that each agent $u$ and $v$ is either unmatched or strictly prefers the other over its current partner (if any). A \emph{stable matching} $M$ is a matching without blocking pair.
Unless otherwise stated, we consider the \emph{roommates case} without assumptions on the topology of $G$. In contrast, the \emph{two-sided} or \emph{bipartite} case is often referred to as the \emph{stable marriage problem}. Here $V$ is divided into two disjoint sets $U$ and $W$ such that $E\subseteq \{\{u,w\}|~u\in U, w\in W\}$. Further we will consider matchings when each agent can match with up to $k$ different agents at the same time.
In this paper, we consider broad classes of matching games, in which additional constraints restrict the set of available blocking pairs. The states that are resilient to such restricted sets of blocking pairs are a superset of stable matchings. Let us outline a number of examples that fall into this class and will be of special interest.
\subsubsection*{Socially Stable Matching}
In addition to the graph $G$, there is a (social) \emph{network of links} $(V,L)$ which models static visibility. A state $M$ has a \emph{social blocking pair} $e=\{u,v\}\in E$ if $e$ is blocking pair and $e\in L$. Thus, in a social blocking pair both agents can strictly increase their utility by generating $e$ (and possibly dismissing some other edge thereby). A state $M$ that has no social blocking pair is a \emph{socially stable matching}. A \emph{social improvement step} is the resolution of such a social blocking pair, that is, the blocking pair is added to $M$ and all conflicting edges are removed.
\subsubsection*{Locally Stable Matching}
In addition to $G$, there is a network $(V,L)$ that models dynamic visibility by taking the current matching into account. To describe stability, we assume the pair $\{u,v\}$ is \emph{accessible} in state $M$ if $u$ and $v$ have hop-distance at most 2 in the graph $(V,L\cup M)$, that is, the shortest path between $u$ and $v$ in $(V,L\cup M)$ is of length at most 2 (where we define the shortest path to be of length $\infty$, if $u$ and $v$ are not in the same connected component). A state $M$ has a \emph{local blocking pair} $e=\{u,v\}\in E$ if $e$ is blocking pair and $u$ and $v$ are accessible. Consequently, a \emph{locally stable matching} is a matching without local blocking pair. A \emph{local improvement step} is the resolution of such a local blocking pair, that is, the blocking pair is added to $M$ and all conflicting edges are removed. We also consider locally stable matchings where instead of the 2-hop-distance the $l$-hop-distance in $(V,L\cup M)$ defines the accessibility.
\subsubsection*{Considerate Matching}
In this case, the (social) network $(V,L)$ symbolizes friendships and consideration. We assume the pair $\{u,v'\}$ is \emph{not accessible} in state $M$ if there is agent $v$ such that $\{u,v\} \in M$, and (a) $\{u,v\} \in L$ or (b) $\{v,v'\} \in L$. Otherwise, the pair is called accessible in $M$. Intuitively, this implies a form of consideration -- formation of $\{u,v'\}$ would leave a friend $v$ unmatched, so (a) $u$ will not propose to $v'$ or (b) $v'$ will not accept $u$'s proposal. A state $M$ has a \emph{considerate blocking pair} $e=\{u,v\}\in E$ if $e$ is blocking pair and it is accessible. A state $M$ that has no considerate blocking pair is a \emph{considerate stable matching}. A \emph{considerate improvement step} is the resolution of such a considerate blocking pair.
\subsubsection*{Friendship Matching}
In this scenario, there are numerical values $\alpha_{u,v}\ge 0$ for every unordered pair $u,v\in V$, $u\neq v$, representing how much $u$ and $v$ care for each other's well-being. Thus, instead of the utility gain through its direct matching partner, $u$ now receives a \emph{perceived utility} $B_p(M,u) = B(M,u) + \sum_{v\in V\setminus\{u\}} \alpha_{u,v} B(M,v)$. In contrast to all other examples listed above, this definition requires cardinal matching utilities and cannot be applied directly on ordinal preferences. A state $M$ has a \emph{perceived blocking pair} $e=\{u,v\}\in E$ if $B_p(M,u) < B_p((M\setminus\{e'\mid e\cap e'\neq \emptyset\})\cup\{e\},u)$ and $B_p(M,v) < B_p((M\setminus\{e'\mid e\cap e'\neq \emptyset\})\cup\{e\},v)$. A state $M$ that has no perceived blocking pair is a \emph{perceived} or \emph{friendship stable matching}. A \emph{perceived improvement step} is the resolution of such a perceived blocking pair.
\section{Correlated Preferences}
\label{sec:correlated}
\subsection{Coalition Formation Games with Constraints}
\label{sec:constraints}
In this section, we consider correlated matching where agent preferences are correlated via edge benefits $b(e)$. In fact, we will prove our results for a straightforward generalization of correlated matching -- in correlated coalition formation games that involve coalitions of size larger than 2. In such a \emph{coalition formation game} there is a set $N$ of agents, and a set $\mathcal{C} \subseteq 2^N$ of hyper-edges, the \emph{possible coalitions}. We denote $n = |N|$ and $m = |\mathcal{C}|$. A \emph{state} is a \emph{coalition structure} $\mathcal{S}\subseteq \mathcal{C}$ such that for each $v\in N$ we have $|\{C\mid C\in \mathcal{S}, v\in C\}|\leq 1$. That is, each agent is involved in at most one coalition. Each coalition $C$ has a weight or benefit $w(C)>0$, which is the profit given to each agent $v \in C$. For a coalition structure $\mathcal{S}$, a \emph{blocking coalition} is a coalition $C\in \mathcal{C}\setminus \mathcal{S}$ with $w(C)>w(C_v)$ where $v \in C_v \in \mathcal{S}$ for every $v \in C$ which is part of a coalition in $\mathcal{S}$. Again, the resolution of such a blocking coalition is called an improvement step. A stable state or \emph{stable coalition structure} $\mathcal{S}$ does not have any blocking coalitions. Correlated matching games are a special case of coalition formation games where $\mathcal{C}$ is restricted to pairs of agents and thereby defines the edge set $E$.
To embed the classes of matching games detailed above into a more general framework, we define \emph{coalition formation games with con\-straints}. For each state $\mathcal{S}$ we consider two sets of rules -- \emph{generation rules} that determine candidate coalitions, and \emph{domination rules} that forbid some of the candidate coalitions. The set of undominated candidate coalitions then forms the blocking coalitions for state $\mathcal{S}$. Using suitable generation and domination rules, this allows to describe socially, locally, considerate and friendship matching in this scenario.
More formally, there is a set $T \subseteq \{(\mathcal{T},C) \mid \mathcal{T} \subset \mathcal{C}, C \in \mathcal{C}\}$ of \emph{generation rules}. If in the current state $\mathcal{S}$ we have $\mathcal{T} \subseteq \mathcal{S}$ and $C \not\in \mathcal{S}$, then $C$ becomes a candidate coalition. For convenience, we exclude generation rules of the form $(\emptyset, C)$ from $T$ and capture these rules by a set $\mathcal{C}_g\subseteq \mathcal{C}$ of self-generating coalitions. A coalition $C \in \mathcal{C}_g$ is a candidate coalition for all states $\mathcal{S}$ with $C\not\in\mathcal{S}$. In addition, there is a set $D\subseteq\{(\mathcal{T},C)\mid \mathcal{T}\subset \mathcal{C},C\in \mathcal{C}\}$ of \emph{domination rules}. If $\mathcal{T} \subseteq \mathcal{S}$ for the current state $\mathcal{S}$, then $C$ must not be inserted. To capture the underlying preferences of the agents, we assume that $D$ always includes at least the set $D_w=\{(\{C_1\},C_2)\mid w(C_1) \ge w(C_2),C_1 \cap C_2 \neq \emptyset, C_1\neq C_2\}$ of all weight domination rules.
The undominated candidate coalitions represent the blocking coalitions for $\mathcal{S}$. In particular, the latter assumption on $D$ implies that a blocking coalition must at least yield strictly better profit for every involved agent. Note that in an improvement step, one of these coalitions is inserted, and every coalition that is dominated in the resulting state is removed. By assumption on $D$, we remove at least every overlapping coalition with smaller weight. A coalition structure is stable if the set of blocking coalitions is empty.
Note that we could also define coalition formation games with constraints for general preferences. Then $D_w=\{(\{C_1\},C_2)\mid C_1 \cap C_2 \neq \emptyset, C_1\neq C_2, \exists v\in C_1: w_v(C_1) \ge w_v(C_2)\}$. However, a crucial point in our proofs is that in a chain of succeeding deletions no coalition can appear twice. This is guaranteed for correlated preferences as coalitions can only be deleted by more worthy ones. For general preferences on the other hand there is no such argument.
In the following we define \emph{consistency} for generation and for domination rules. This encompasses many classes of matching cases described above and is key for reaching stable states (quickly).
\begin{definition}
The generation rules of a coalition formation game with constraints are called \emph{consistent} if $T \subseteq \{(\{C_1\},C_2)\mid~ C_1\cap C_2\neq \emptyset\}$, that is, all generation rules have only a single coalition in their precondition and the candidate coalition shares at least one agent.
\end{definition}
\begin{definition}
The domination rules of a coalition formation game with constraints are called \emph{consistent} if $D\subseteq\{(\mathcal{S},C)\mid \mathcal{S}\subset \mathcal{C},C\in \mathcal{C}, C\notin \mathcal{S}, \exists S\in \mathcal{S}: S\cap C\neq \emptyset \}$, that is, at least one of the coalitions in $\mathcal{S}$ overlaps with the dominated coalition. Note that weight domination rules are always consistent.
\end{definition}
\begin{theorem}\label{polyTime}
In every correlated coalition formation game with constraints and consistent generation and domination rules, for every initial structure $\mathcal{S}$ there is a sequence of polynomially many improvement steps that results in a stable coalition structure. The sequence can be computed in polynomial time.
\end{theorem}
\begin{proof}
At first we analyze the consequences of consistency in generation and domination rules. For generation rules we demand that there is only a single precondition coalition and that this coalition overlaps with the candidate coalition. Thus if we apply such a generation rule we essentially replace the precondition with the candidate. The agents in the intersection of the two coalitions would not approve such a resolution if they would not improve. Therefore, the only applicable generation rules are those where the precondition is of smaller value than the candidate.
Now for domination rules we allow an arbitrary number of coalitions in the precondition, but at least one of them has to overlap with the dominated coalition. In consequence a larger set of coalitions might dominate a non-existing coalition, but to remove a coalition they can only use the rules in $D_w$. That is due to the fact that when a coalition $C$ already exists, the overlapping coalition of the precondition cannot exist at the same time. But this coalition can only be created if $C$ does not dominate it. Especially $C$ has to be less worthy than the precondition. Thus the overlapping precondition alone can dominate $C$ via weight.
The proof is inspired by the idea of the edge movement graph~\cite{Hoefer11Proc}. Given a coalition formation game with consistent constraints and some initial coalition structure $\mathcal{S}_0$, we define an object movement hypergraph
\[G_{mov}=(V,V_g,T_{mov},D_{mov}).\]
A coalition structure corresponds to a marking of the vertices in $G_{mov}$. The vertex set is $V=\{v_C\mid C\in\mathcal{C}\}$, and $V_g=\{v_C\mid C\in\mathcal{C}_g\}$ the set of vertices which can generate a marking by themselves. The directed exchange edges are $T_{mov}=\{(v_{C_1},v_{C_2})\mid (\{C_1\},C_2)\in E, w(C_1)<w(C_2)\}$. The directed domination hyperedges are given by $D_{mov}=D_1\cup D_w$, where $D_1= \{(\{v_S\mid S\in \mathcal{S}\},v_C)\mid (\mathcal{S},C)\in D\}$. This covers the rule that a newly inserted coalition must represent a strict improvement for all involved agents. The initial structure is represented by a marking of the vertices $V_0=\{v_C\mid C\in \mathcal{S}_0\}$.
We represent improvement steps by adding, deleting, and moving markings over exchange edges to undominated vertices of the object movement graph. Suppose we are given a state $\mathcal{S}$ and assume we have a marking at every $v_C$ with $C \in \mathcal{S}$. We call a vertex $v$ in $G_{mov}$ currently \emph{undominated} if for every hyperedge $(U,v) \in D_{mov}$ at least one vertex in $U$ is currently unmarked. An improvement step that inserts coalition $C$ is represented by marking $v_C$. For this $v_C$ must be unmarked and undominated. We can create a new marking if $v_C \in V_g$. Otherwise, we must move a marking along an exchange edge to $v_C$. Note that this maps the generation rules correctly as we have seen, that we exchange the precondition for the candidate. To implement the resulting deletion of conflicting coalitions from the current state, we delete markings at all vertices which are now dominated through a rule in $D_{mov}$. That is, we delete markings at all vertices $v$ with $(U,v)\in D$ and every vertex in $U$ marked.
Observe that $T_{mov}$ forms a DAG as the generation of the candidate coalition deletes its overlapping precondition coalition and thus the rule will only be applied if the candidate coalition yields strictly more profit for every agent in the coalition.
\begin{lem}
\label{lem:objectMove}
The transformation of markings in the object movement graph correctly mirrors the improvement dynamics in the coalition formation game with constraints.
\end{lem}
\begin{proof}
Let $\mathcal{S}$ be a state of the coalition formation game and let $C$ be a blocking coalition for $\mathcal{S}$. Then $C$ can be generated either by itself (that is, $C\in \mathcal{C}_g$) or through some generation rule with fulfilled precondition $C' \in \mathcal{S}$, and is not dominated by any subset of $\mathcal{S}$ via $D$. Hence, for the set of marked vertices $V_{\mathcal{S}}=\{v_C \mid C \in \mathcal{S}\}$ it holds that $v_C$ can be generated either because $v_C\in V_g$ or because there is a marking on some $v_{C'}$ with $(v_{C'},v_C)\in T_{mov}$, and is further not dominated via $D$. Hence, we can generate a marking on $v_C$. It is straightforward to verify that if $v_C$ gets marked, then in the resulting deletion step only domination rules of the form $\{(\{v_S\},v_T)\mid S,T\in\mathcal{C}, S\cap T\neq \emptyset$ and $w(S)\geq w(T)\}$ are relevant. Thus, deletion of markings is based only on overlap with the newly inserted coalition $C$. These are exactly the coalitions we lose when inserting $C$ in $\mathcal{S}$.
Conversely, let $V_{\mathcal{S}}$ be a set of marked vertices of $G_{mov}$ such that $\mathcal{S}=\{C\mid v_C\in V_{\mathcal{S}}\}$ does not violate any domination rule (i.e., for every $(\mathcal{U},C) \in D$, we have $\mathcal{U} \not\subseteq \mathcal{S}$ or $C \not\in \mathcal{S}$). Then $\mathcal{S}$ is a feasible coalition structure. Now if $v_C$ is an unmarked vertex in $G_{mov}$, then $C \notin \mathcal{S}$. Furthermore, assume $v_C$ is undominated and can be marked, because $v_C\in V_g$ or because some marking can be moved to $v_C$ via an edge in $T_{mov}$. Thus for every $\{\mathcal{S}_C,C\}\in D$ $v_C$ being undominated implies $\mathcal{S}_C\not\subset\mathcal{S}$. The property that $v_C$ can be marked implies that $C$ is self-generating or can be formed from $\mathcal{S}$ using a generation rule. Hence $C$ is a blocking coalition in $\mathcal{S}$. The insertion $C$ again causes the deletion of exactly the coalitions whose markings get deleted when $v_C$ is marked.\qed
\end{proof}
To show the existence of a short sequence of improvement steps we consider two phases.
\begin{description}
\item [\bf Phase 1] In each round we check whether there is an exchange edge from a marked vertex to an undominated one. If this is the case, we move the marking along the exchange edge and start the next round. Otherwise for each unmarked, undominated $v\in V_g$ we compute the set of reachable positions. This can be done by doing a forward search along the exchange edges that lead to an unmarked undominated vertex. Note that the vertex has to remain undominated when there are the existing markings and a marking on the source of the exchange edge. If we find a reachable position that dominates an existing marking, we create a marking at the associated $v\in V_g$ and move it along the exchange edges to the dominating position. Then we start the next round. If we cannot find a reachable position which dominates an existing marking, we switch to Phase 2.
\item [\bf Phase 2] Again we compute all reachable positions from $v\in V_g$. We iteratively find a reachable vertex $v_C$ with highest weight $w(C)$, generate a marking at the corresponding $v \in V_g$ and move it along the path of exchange edges to $v_C$. We repeat this phase until no reachable vertex remains.
\end{description}
To prove termination and bound the length, we consider each phase separately. In Phase 1 in each round we replace an existing marking by a marking of higher value either by using an exchange edge or by deleting it through domination by weight. Further the remaining markings either stay untouched or get deleted. Now the number of improvements that can be made per marking is limited by $m$ and the number of markings is limited by $n$. Hence, there can be at most $mn$ rounds in Phase 1. Additionally, the number of steps we need per round is limited $m$ again, as we move the marking along the DAG structure of exchange edges. Thus, phase 1 generates a total of $O(n\cdot m^2)$ steps.
If in Phase 1 we cannot come up with an improvement, there is no way to (re)move the existing markings, no matter which other steps are made in subsequent iterations. This relies on the fact that the presence of additional markings can only restrict the subgraph of reachable positions. For the same reason, iteratively generating the reachable marking of highest weight results in markings that cannot be deleted in subsequent steps. Thus, at the end of every iteration in Phase 3, the number of markings is increased by one, and all markings are un(re)movable. Consequently, in Phase 2 there are $O(m\cdot n)$ steps.
For computation of the sequence, the relevant tasks are constructing the graph $G_{mov}$, checking edges in $T_{mov}$ for possible improvement of markings, or constructing subgraphs and checking connectivity of single vertices to $V_g$. Obviously, all these tasks can be executed in time polynomial in $n$, $m$, $|T|$ and $|D|$ using standard algorithmic techniques.
\qed
\end{proof}
Next, we want to analyze whether consistency of generation and domination rules is necessary for the existence of short sequences or can be further relaxed.
\begin{prop}\label{l>2}
If the generation rules contain more than one coalition in the precondition-set, there are instances and initial states such that every sequence to a stable state requires an exponential number of improvement steps.
\end{prop}
The proof uses a coalition formation game with constraints and inconsistent generation rules obtained from locally stable matching, when agents are allowed to match with partners at a hop distance of at most $\ell = 3$ in $(V, L \cup M)$. For this setting in~\cite[Theorem 3]{Hoefer13} we have given an instance such that every sequence to a stable state requires an exponential number of improvement steps. Note that the example is minimal in the sense that now we have at most 2 coalitions in the precondition-set. The detailed proof can be found in the appendix.
\begin{prop}\label{generationInconsistent}
If the generation rules have non-overlapping precondition- and target-coalitions, there are instances and initial states such that every sequence to a stable state requires an exponential number of improvement steps.
\end{prop}
The construction used for the proof exploits the fact that if precondition- and target-coalition do not overlap the precondition can remain when the target-coalition is formed. Then the dynamics require additional steps to clean up the leftover precondition-coalitions which results in an exponential blow-up. The entire proof as well as a sketch of the resulting movement graph can be found in the appendix.
\begin{prop}\label{cycle}
If the domination rules include target-coalitions that do not overlap with any coalition in the precondition, there are instances and starting states such that every sequence cycles.
\end{prop}
\begin{proof}
Consider the following small example with $N=\{1,\ldots,6\}$, $\mathcal{C}$ $=\{\{1,2\},$ $\{3,4\},$ $\{5,6\}\}$, $\mathcal{C}_g = \mathcal{C}$, and weights $w(C) = 1$ for all $C \in \mathcal{C}$. There are no generation rules: $T=\emptyset$ (in addition to $\mathcal{C}_g = \mathcal{C}$). For the domination rules, we consider non-overlapping coalitions in precondition and target:
\[ D = \{(\{\{1,2\}\},\{3,4\}),(\{\{3,4\}\},\{5,6\}),(\{\{5,6\}\},\{1,2\})\}\enspace.\]
The initial state is $\mathcal{C}_{start}=\{1,2\}$.
Now with $\{1,2\}$ existing, $\{3,4\}$ is dominated and cannot be formed although it is a candidate coalition. The other candidate coalition $\{5,6\}$ is undominated and represents the unique improvement step. As $\{5,6\}$ dominates $\{1,2\}$ (but not vice versa), we lose $\{1,2\}$ when $\{5,6\}$ is formed. Now $\{4,3\}$ is the unique undominated candidate coalition and is formed. Thereby, we lose $\{5,6\}$, and $\{1,2\}$ becomes undominated. Now $\{1,2\}$ is formed, $\{4,3\}$ is deleted, and the cycle is complete.
\qed
\end{proof}
Consistent generation and domination rules arise in a large variety of settings, not only in basic matching games but also in some interesting extensions.
\begin{corollary}\label{embedding} Consistent generation and domination rules are present in
\begin{itemize}
\item locally stable matching if agents can create $k=1$ matching edges and have lookahead $\ell = 2$ in $G=(V,M\cup L)$.
\item socially stable matching, even if agents can create $k \ge 1$ matching edges.
\item considerate matching, even if agents can create $k \ge 1$ matching edges.
\item friendship matching, even if agents can create $k \ge 1$ matching edges.
\end{itemize}
\end{corollary}
Due to space restrictions we cannot give a detailed description of the embedding into coalition formation games with constraints. In most cases the embedding is quite straightforward. Agents and edge set are kept as well as the benefits. The generation and domination rules often follow directly from the definitions. However, we want to shortly discuss the more complex mapping of $k$-matching for $k>1$ into coalition formation games with constraints. By definition no agent is allowed to participate in more than one coalition at the same time. Thus we cannot directly embed $k$-matching. Instead we have to map every agent $u$ to $k$ copies $u_1,\ldots,u_k$ who can match one vertex each. With these ``independent'' copies we now encounter the problem that $\{u_i,v_j\}$ and $\{u_{i'},v_{j'}\}$ should not exist simultaneously. This issue can easily be handled via the domination rules, but, as $\{u_i,v_j\}$ and $\{u_{i'},v_{j'}\}$ do not share any agents, rules of the form $(\{\{u_i,v_j\}\},\{u_{i'},v_{j'}\})$ would not be consistent. Thus for every edge $\{u,v\}$ we introduce an auxiliary vertex $a_{u,v}$. Potential coalitions then are given by $\{u_i,v_j,a_{u,v}\}$ instead of $\{u_i,v_j\}$. The exact embedding for every type of game can be found in the appendix. Additionally an exemplar proof for correctness is stated.
Unlike for the other cases, for locally stable matching we cannot guarantee consistent generation rules if we increase the number of matching edges. The same holds for lookahead $>2$. In both cases the accessibility of an edge might depend on more than one matching edge. There are exponential lower bounds in~\cite{Hoefer13,HoeferW13} for those extensions which proves that it is impossible to find an embedding with consistent rules even with the help of auxiliary constructions.
\subsection{Reaching a Given Matching}
\label{sec:NPC}
In this section we consider the problem of deciding reachability of a \emph{given} stable matching from a given initial state. We first show that for correlated coalition formation games with constraints and consistent rules, this problem is in {\sf NP}. If we can reach it and there exists a sequence, then there always exists a polynomial-size certificate due to the following result.
\begin{theorem}\label{alwaysShortSequence}
In a correlated coalition formation game with constraints and consistent generation and domination rules, for every coalition structure $\mathcal{S}^*$ that is reachable from an initial state $\mathcal{S}_0$ through a sequence of improvement steps, there is also a sequence of polynomially many improvement steps from $\mathcal{S}_0$ to $\mathcal{S}^*$.
\end{theorem}
For the proof we analyze an arbitrary sequence of improvement steps from $\mathcal{S}_0$ to $\mathcal{S}^*$ and show that, if the sequence is too long, there are unnecessary steps, that is, coalitions are created and deleted without making a difference for the final outcome. By identifying and removing those superfluous steps we can reduce every sequence to one of polynomial length. The detailed proof can be found in the appendix.
For locally stable matching, the problem of reaching a given locally stable matching from a given initial matching is known to be {\sf NP}-complete~\cite{HoeferW13}. Here we provide a generic reduction that shows {\sf NP}-completeness for socially, locally, considerate, and friendship matching, even in the two-sided case. Surprisingly, it also applies to ordinary two-sided stable matching games that have either correlated preferences with ties, or non-correlated strict preferences. Observe that the problem is trivially solvable for ordinary stable matching and correlated preferences without ties, as in this case there is a unique stable matching that can always be reached using the greedy construction algorithm~\cite{AckermannGMRV11}.
\begin{theorem}\label{np}
It is {\sf NP}-complete to decide if for a given matching game, initial matching $M_0$ and stable matching $M^*$, there is a sequence of improvement steps leading form $M_0$ to $M^*$. This holds even for bipartite games with strict correlated preferences in the case of
\begin{enumerate}
\item socially stable matching and locally stable matching,
\item considerate matching, and
\item friendship matching for symmetric $\alpha$-values in $\left[0,1\right]$.
\end{enumerate}
In addition, it holds for ordinary bipartite stable matching in the case of
\begin{enumerate}
\setcounter{enumi}{3}
\item correlated preferences with ties,
\item strict preferences.
\end{enumerate}
\end{theorem}
\section{General Preferences}
\label{sec:general}
In this section we consider convergence to stable matchings in the two-sided case with general preferences that may be incomplete and have ties. For locally stable matching it is known that in this case there are instances and initial states such that no locally stable matching can be reached using local blocking pair resolutions. Moreover, deciding the existence of a converging sequence of resolutions is {\sf NP}-hard~\cite{HoeferW13}.
We here study the problem for socially, considerate, and friendship matching. Our positive results are based on the following procedure from~\cite{AckermannGMRV11} that is known to construct a sequence of polynomial length for unconstrained stable matching. The only modification of the algorithm for the respective scenarios is to resolve ``social'', ``considerate'' or ``perceived blocking pairs'' in both phases.
\begin{description}
\item[\bf Phase 1] Iteratively resolve only blocking pairs involving a matched vertex $w\in W$. Phase 1 ends when for all blocking pairs $\{u,w\}$ we have $w\in W$ unmatched.
\item[\bf Phase 2] Choose an unmatched $w\in W$ that is involved in a blocking pair. Resolve one of the blocking pairs $\{u,w\}$ that is most preferred by $w$. Repeat until there are no blocking pairs.
\end{description}
It is rather straightforward to see that the algorithm can be applied directly to build a sequence for socially stable matching.
\begin{theorem}
\label{thm:sociallyOneSided}
In every bipartite instance of socially stable matching $G=(V=U\dot{\cup}W,E)$ with general preference lists and social network $L$, for every initial matching $M_0$ there is a sequence of polynomially many improvement steps that results in a socially stable matching. The sequence can be computed in polynomial time.
\end{theorem}
For extended settings the algorithm still works for somewhat restricted social networks. For considerate matching we assume that the link set is only within $L \subseteq (U \times U) \cup (U \times W)$, i.e., no links within partition $W$.
\begin{theorem}
\label{thm:considerOneSided}
In every bipartite instance of considerate matching $G=(V=U\dot{\cup}W,E)$ with general preference lists and social network $L$ such that $\{w,w'\}\notin L$ for all $w,w'\in W$, for every initial matching $M_0$ there is a sequence of polynomially many improvement steps that results in a considerate matching. The sequence can be computed in polynomial time.
\end{theorem}
We also apply the algorithm to friendship matching in case there can be arbitrary friendship relations $\alpha_{u,u'}, \alpha_{u',u} \ge 0$ for each pair $u,u' \in U$. Here we allow asymmetry with $\alpha_{u,u'} \neq \alpha_{u',u}$. Otherwise, for all $u \in U, w,w'\in W$ we assume that $\alpha_{u,w} = \alpha_{w,u} = \alpha_{w,w'} = 0$, i.e., friendship only exists within $U$.
\begin{theorem}\label{perceivedOnesided}
In every bipartite instance of friendship matching $G=(V=U\dot{\cup}W,E)$ with benefits $b$ and friendship values $\alpha$ such that $\alpha_{u,u'}>0$ only for $u,u'\in U$, for every initial matching $M_0$ there is a sequence of polynomially many improvement steps that results in a friendship matching. The sequence can be computed in polynomial time.
\end{theorem}
The algorithm works fine with links between partitions $U$ and $W$ for the considerate setting, but it fails for positive $\alpha$ between partitions in the friendship case. We defer a discussion to the full version of the paper.
\subsubsection*{Acknowledgment}
Part of this research was done at the Institute for Mathematical Sciences of NUS Singapore, and at NTU Singapore. The authors thank Edith Elkind for suggesting to study considerate matching.
\input{./bib.bbl}
\appendix
\section{Omitted Proofs}
\subsection{Proof of Proposition~\ref{l>2}}
In~\cite[Theorem 3]{Hoefer13} we have shown that such instances and starting states exist for locally stable matching, when agents are allowed to match with partners at a hop distance of at most $\ell = 3$ in $(V, L \cup M)$. This scenario can be embedded into the context of coalition formation games with constraints, where we violate only the above mentioned precondition in the generation rules. Note that the violation is minimal in the sense that we increase from one to at most two sets in the precondition.
Given an instance of locally stable matching with graph $G=(V,E)$, (social) links $L$, correlated preferences based on edge benefits $b(e)$, we define the parameters of the framework as follows. The set of agents is $N=V$, the set of possible coalitions is $\mathcal{C}=E$. The coalitions that can always be generated are the ones connected by at most 3 links, i.e., $\mathcal{C}_g= E \cap \{ \{u,v\}\mid dist_{L}(u,v)\leq 3\}$. The benefit or coalition weight is obviously given by $w=b$. For the generation rules, we have $T = T_1 \cup T_2 \cup T_3$, where
\begin{align*}
T_1 &=\{(\{\{u,v\}\},\{u,v'\})\mid \{u,v\},\{u,v'\}\in E, \{v,v'\}\in L\}\\
T_2 &=\{(\{\{u,v\}\},\{u',v'\})\mid \{u,v\},\{u',v'\}\in E, \{u',v\},\{u,v'\} \in L\}\\
T_3 &= \{(\{\{u',v\},\{u,v'\}\},\{u,v\})\mid \{u,v\},\{u,v'\},\{u',v\}\in E, \{u',v'\} \in L\}
\end{align*}
Here $T_1$ captures accessible pairs with 2 hops composed of one matching edge and one link, $T_2$ captures accessible pairs within distance of 3 hops composed of one matching edge and two links, and $T_3$ captures accessible pairs within distance of 3 hops composed of two matching edges and one link. The latter generation rules are obviously using two coalitions as precondition. The domination rules implement only the necessary preference-based improvement of coalitions $D = D_w$.
\qed
\subsection{Proof of Proposition~\ref{generationInconsistent}}
We will attach a sequence of gadgets that imply a unique exponential improvement sequence. We use a gadget of size $9$ and a starting state with the property that to create coalition $C_{6,i}$ of gadget $i$ we twice need to generate $C_{1,i}$. Further the gadget will not reach a stable state unless $C_{6,i}$ exists. Using this property we will connect $k$ such gadgets by allowing a creation rule $\{\{C_{1,i+1}\},C_{6,i}\}$ and identifying $0_{i+1}$ with $8_i$. Then to create $C_{k,6}$ (without which the graph would not be stable) $C_{1,1}$ has to be created at least $2^k$ times.\\
Now for gadget $i$ we have $N_i=\{0_i,\ldots, 8_i\}$, $\mathcal{C}_i=\{C_{1,i},\ldots, C_{6,i}\}$ with $C_{1,i}=\{0_i,1_i,2_i\}$, $C_{2,i}=\{1_i,3_i\}$, $C_{3,i}=\{3_i,4_i,5_i\}$, $C_{4,i}=\{4_i,6_i\}$, $C_{5,i}=\{2_i,6_i,7_i\}$, $C_{6,i}=\{5_i,7_i,8_i\}$, weights $w(C_{1,i})=x_i+1$, $w(C_{2,i})=x_i+2$, $w(C_{3,i})=x_i+4$, $w(C_{4,i})=x_i+3$, $w(C_{5,i})=x_i+2$ and $w(C_{6,i})=x_i+5$ with $x_i=5(i-1)$, and generation rules
\begin{align*}
T_1 &=\{\{\{C_{1,1}\},C_{2,1}\},\{\{C_{1,1}\},C_{5,i}\},\{\{C_{2,1}\},C_{3,i}\},\{\{C_{3,1}\},C_{1,1}\},\{\{C_{4,1}\},C_{1,1}\},\\
& \hspace{0.66cm} \{\{C_{5,1}\},C_{6,1}\}\}\enspace,\\
T_i &=\{\{\{C_{1,i}\},C_{2,i}\},\{\{C_{1,i}\},C_{5,i}\},\{\{C_{2,i}\},C_{3,i}\},\{\{C_{3,i}\},C_{4,i-1}\},\\
& \hspace{0.66cm}\{\{C_{4,i}\},C_{4,i-1}\}, \{\{C_{5,i}\},C_{6,i}\}\}~~\mbox{ if }i>1\enspace.
\end{align*}
The set $D$ of domination rules is empty except for all rules of the form $(\{C\},C')$ such that $w(C) \geq w(C')$ and $C \cap C' \neq \emptyset$. As starting coalition structure we have $\{C_{4,k}\}$.\\
The dynamics are best understood when using the object movement graph instead of dealing with the single vertices. In Figure~\ref{bildExpGeneration} we give the object movement graph of the first two gadgets to visualize the dynamics of the gadgets themselves as well as their interaction. We will analyze the dynamics of gadget $1$. The subsequent gadgets work similarly. In the beginning there are no coalitions in gadget 1 so we first have a look at how to get some coalition to start from. Now every $C_{4,i}$ for $i>1$ can only be used to generate $C_{4,i-1}$. Note that in this case $C_{4,i}$ is not deleted. Thus in the beginning those $C_{4,i}$ are one by one created until we reach $C_{4,1}$. With $C_{4,1}$ we can only generate $C_{1,1}$ (in gadgets $i>1$ in this situation we might generate $C_{4,i-1}$ and then ''wait'' for $C_{1,i}$ to arrive). Next as $C_{5,1}$ is blocked by $C_{4,1}$ the only option is to generate $C_{2,1}$ and thus lose $C_{1,1}$ again. From there we can only generate $C_{3,1}$ while losing $C_{2,1}$ and $C_{4,1}$. With the remaining coalition $C_{3,1}$ we can recover $C_{1,1}$ which now leads to creating $C_{5,1}$ and losing $C_{1,1}$ a second time. Next we can only create $C_{6,1}$ which causes the deletion of $C_{3,1}$ and $C_{5,1}$. Finally $C_{6,1}$ can now be used to create $C_{1,2}$ which leaves gadget 1 empty. But at the latest after $C_{3,2}$ has been created in the next step $C_{4,1}$ has to be created again and we can rerun the dynamics for the gadget in the same manner.
\qed
\begin{figure}
\caption{\textbf{Object movement graph of gadget 1 and 2:}
\label{bildExpGeneration}
\end{figure}
\subsection{Proof of Lemma~\ref{embedding}}
We will consider each setting individually. Further while we describe the embedding for each case we will only give a proof of correctness for friendship matching with $k=1$ as the proofs for all cases are very similar and this is one of the most complex ones.
\subsubsection{Locally Stable Matching}
To embed an instance of locally stable matching given by graph $G$, link set $L$, and edge benefits into our framework, we apply the embedding indicated in Proposition~\ref{l>2}. Note that for the standard case of $k=1$ matching edges and lookahead $\ell = 2$, we obtain consistent generation and domination rules. If we change to $k > 1$ matching edges or lookahead of $\ell > 2$, consistency of generation rules becomes violated, as two edges can appear in the precondition. This follows from the exponential lower bounds in~\cite{Hoefer13,HoeferW13}.
\subsubsection{Socially Stable Matching}
To embed an instance of socially stable matching given by graph $G=(V,E)$, link set $L$, and edge benefits $b$ into our framework, we use $N=V$, $\mathcal{C}=E$, and $\mathcal{C}_g= L \cap E$. There are no additional generation rules $T=\emptyset$, and the benefits are obviously given by $w=b$. The domination rules implement only the necessary preference-based improvement of coalitions $D = D_w$. Obviously, generation and domination rules are consistent.
If we change to $k > 1$ matching edges per agent, then, in principle, we violate a condition of our framework -- that in every state, every agent can be part of at most one coalition. A simple way to embed the games correctly into the framework is to represent each agent $u$ by $k$ auxiliary agents $u_1,\ldots,u_k$, who can match to one partner each. The edges between two agents become a complete bipartite graph between the corresponding auxiliary agents. Note that in the new game, $u_i, u_j$ and $v_{i'},v_{j'}$ can now build two edges among $u$ and $v$. This can be prohibited using an auxiliary agent $a_{u,v}$ for each matching edge $\{u,v\} \in E$, and replacing every coalition $\{u_i,v_j\}$ by $\{u_i,v_j,a_{u,v}\}$, for $i,j = 1,\ldots, k$.
More formally, we define
\begin{align*}
N &=\{v_i\mid v\in V, ~i=1\ldots k\}\cup \{ a_{u,v} \mid \{u,v\} \in E\}\\
\mathcal{C}&= \{\{u_i,v_j,a_{u,v}\}\mid \{u,v\}\in E, ~i,j=1\ldots k\}\\
\mathcal{C}_g &= \{\{u_i,v_j,a_{u,v}\}\mid \{u,v\}\in E \cap L, ~i,j=1\ldots k\}\\
w(\{u_i,v_j,a_{u,v}\})&=b(u,v) \text{ for } \{u,v\}\in E, ~i,j=1\ldots k\\
T &= \emptyset\\
D &=D_w
\end{align*}
Obviously, generation and domination rules are consistent.
\subsubsection{Considerate Matching}
To embed an instance of friendship matching given by graph $G=(V,E)$, link set $L$, and edge benefits $b$, we use $N=V$, $\mathcal{C}=\mathcal{C}_g=E$, and, consequently, $T=\emptyset$. We set $w=b$. For the domination rules, let $D=D_1\cup D_w$ where
\begin{align*}
D_1 &= \{(\{\{u,v\}\},\{u,v'\}) \mid \{u,v\},\{u,v'\} \in E, \{u,v\}\in L \text{ or } \{v,v'\}\in L\} \enspace.
\end{align*}
The case of $k>1$ matching edges can be handled via auxiliary agents as explained for socially stable matching above. Again, this essentially affects only the domination rules, which allow more flexibility with respect to consistency. More formally, we define $N$, $\mathcal{C}$, $w$ and $T$ as outlined above and change the remaining definitions to
\begin{align*}
\mathcal{C}_g &= \mathcal{C} \\
D &= D_1 \cup D_w \text{ with }\\
D_1 &= \{(\{\{u_i,v_j,e_{u,v}\}\},\{u_{i'},v'_{j'},e_{u,v}\})\mid \\& \hspace{0.66cm} \{u,v\},\{u,v'\}\in E, \{u,v\}\in L \text{ or } \{v,v'\}\in L,~i,i',j,j'=1\ldots k\} \enspace.
\end{align*}
\subsubsection{Friendship Matching}
To embed an instance of friendship matching given by graph $G=(V,E)$, edge benefits $b$, symmetric friendship values $\alpha$, we use $N=V$, $\mathcal{C}=\mathcal{C}_g=E$, and, consequently, $T=\emptyset$. To model the perceived utilities, we assume $w(\{u,v\})=b(\{u,v\})+\alpha_{u,v}b(\{u,v\})$. For the domination rules, let $D=D_1\cup D_2\cup D_w$ where
\begin{align*}
D_1 &= \{(\{\{u,v\}\},\{u,v'\})\mid \\
& \hspace{0.66cm} \alpha_{v',v}b(\{u,v\})+\alpha_{v',u}b(\{u,v\})\geq b(\{u,v'\})+\alpha_{v',u}b(\{u,v'\})\} \\
D_2 &= \{(\{\{u,v\},\{u',v'\}\},\{u,v'\})\mid \\
& \hspace{0.66cm} b(\{u',v'\})+\alpha_{v',u'}b(\{u',v'\})+\alpha_{v',v}b(\{u,v\})+\alpha_{v',u}b(\{u,v\})\\ &\hspace{0.76cm}\geq b(\{u,v'\})+\alpha_{v',u}b(\{u,v'\})\} \enspace.
\end{align*}
The domination rules in $D_1$ describe that $v'$ earns more from existing $\{u,v\}$ through friendship than from the candidate $\{u,v'\}$. In $D_2$, agent $v'$ earns more from the combination of benefits from dropped agents than from the candidate $\{u,v'\}$. Again, the case of $k>1$ edges per agent can be included using auxiliary agents and preserves consistency as it affects only the domination rules.
Regarding correctness we only prove the case of $k=1$. The other cases are very similar.
Let $M$ be a matching in $G$. Now assume we have a perceived blocking pair $\{u,v'\}$ for $M$ that we intend to resolve. Domination can only occur through edges involving $u$ or $v'$.
Firstly, if $u$ and $v'$ are unmatched, there cannot be any edges dominating $\{u,v'\}$, and we can generate all matching edges as candidate coalitions via $\mathcal{C}_g=\mathcal{C}$. Hence, perceived blocking pairs between unmatched agents are also undominated candidate coalitions. After adding $\{u,v'\}$, no edge is removed. Hence, the set of coalitions resulting from the rules above exactly represents the matching after resolving the perceived blocking pair $\{u,v'\}$.
Secondly, assume that agent $u$ is matched to some agent $v$, but agent $v'$ is unmatched. As $\{u,v'\}$ is a perceived blocking pair, we know that $u$ improves by switching from $v$ to $v'$, that is,
\begin{align*}
& b(\{u,v\})+\alpha_{u,v} b(\{u,v\})+\sum_{u'\in V\setminus\{u,v,v'\}}\alpha_{u,u'}b(M,u')\\
&< \;\; b(\{u,v'\})+\alpha_{u,v'} b(\{u,v'\})+\sum_{u'\in V\setminus\{u,v,v'\}}\alpha_{u,u'}b(M,u')
\end{align*}
which cancels to $b(\{u,v\})+\alpha_{u,v} b(\{u,v\})< b(\{u,v'\})+\alpha_{u,v'} b(\{u,v'\})$. Thus $\{u,v'\}$ is not dominated by $\{u,v\}$ through $D_w$. Now $\{u,v\}$ might still dominate $\{u,v'\}$ through $D_1$. But then $\alpha_{v,v'}b(\{u,v\})+\alpha_{u,v'}b(\{u,v\})\geq b(\{u,v'\})+\alpha_{u,v'}b(\{u,v'\})$, that is, the gain $v'$ receives through its friendships with $v$ and $u$ from $\{u,v\}$ is at least as large as the gain it would receive by matching with $u$ (directly and through friendship). This contradicts the assumption that $\{u,v'\}$ is a perceived blocking pair. Hence $\{u,v'\}$ is an undominated candidate coalition. After adding $\{u,v'\}$, $\{u,v\}$ is dominated through weight and hence gets dropped. Again, the set of coalitions resulting from our rules exactly correspond to the matching after resolving the perceived blocking pair $\{u,v'\}$.
Thirdly, assume that $\{u,v\}$ and $\{u',v'\}$ are present in $M$. The previous arguments for edges that dominate $\{u,v'\}$ through $D_1$ or $D_w$ can be applied again. It remains to check whether domination via $D_2$ is possible. But the domination rules in $D_2$ imply that the loss caused by giving up $\{u,v\}$ \textbf{and} $\{v',u'\}$ for $v'$ is at least as large as the gain generated from $\{u,v'\}$. Thus, as $\{u,v'\}$ is a perceived blocking pair, there is no rule in $D_2$ pointing from $\{\{u,v\},\{u',v'\}\}$ to $\{u,v'\}$ and we can simply generate $\{u,v'\}$ again. Then $\{u,v\}$ and $\{u',v'\}$ are dominated via $D_w$ and hence get dropped, which gives $M\setminus\{\{u,v\},\{u',v'\}\}\cup\{\{u,v'\}\}$. Again, the set of coalitions resulting from our rules exactly correspond to the matching after resolving the perceived blocking pair $\{u,v'\}$.
Conversely, let $\mathcal{S}$ be a feasible coalition structure in our coalition formation game with constraints. Observe that our rules imply that $\mathcal{S}$ corresponds to a matching $M$. Further let $\{u,v'\} \not\in \mathcal{S}$ be an unmarked, undominated edge. Assume for contradiction that $\{u,v'\}$ is not a perceived blocking pair because $v'$ would not improve.
Firstly, if $v'$ is single, this is only possible if $v'$ gains at least as much through $u$'s current matching edge than through directly matching to $u$. Then, a rule of $D_1$ would dominate $\{u,v'\}$.
Secondly, assume that $v'$ is matched to some $u'$ but $u$ is unmatched. Then $\{u,v'\}$ is not a perceived blocking pair if $b(\{u',v'\})+\alpha_{u',v'}b(\{u',v'\})\geq b(\{u,v'\})+\alpha_{u,v'}b(\{u,v'\})$. But in that case $\{u',v'\}$ would dominate $\{u,v'\}$ by $D_w$.
Thirdly, let $v'$ be matched to some $u'$ and $u$ matched to some $v$. As before we must have $b(\{u',v'\})+\alpha_{u',v'}b(\{u',v'\})< b(\{u,v'\})+\alpha_{u,v'}b(\{u,v'\})$ and $b(\{u,v\})+\alpha_{u,v}b(\{u,v\})< b(\{u,v'\})+\alpha_{u,v'}b(\{u,v'\})$ as otherwise $\{u,v'\}$ would be dominated by $D_w$. $\{u,v'\}$ is no improvement for $v'$ only if the combined loss caused by $\{u,v\}$ and $\{u',v'\}$ out-weights the gain through $\{u,v'\}$. In other words,
\begin{align*}
& b(\{u',v'\})+\alpha_{u',v'}b(\{u',v'\})+\alpha_{v,v'}b(\{u,v\})+\alpha_{u,v'}b(\{u,v\})\\
\geq \; & b(\{u,v'\})+\alpha_{u,v'}b(\{u,v'\})\enspace.
\end{align*}
Then there is an according rule in $D_2$ and the combined existence of $\{u',v'\}$ and $\{u,v\}$ results in $\{u,v'\}$ being dominated.
Hence, whenever $\{u,v'\}$ is an undominated candidate coalition, it represents a perceived blocking pair for the current matching. Further when it gets inserted, any former matching edges of $u$ and $v'$ get dominated by weight and dropped, while all other edges remain unaffected. Hence, the new coalition structure represents exactly matching $M$ after resolving $\{u,v'\}$.
\qed
\subsection{Proof of Theorem~\ref{alwaysShortSequence}}
The proof generalizes a similar result for locally stable matchings~\cite{HoeferW13} and is based on two observations:
\begin{enumerate}
\item Note that by design of $T$ and $D$, if some generation rule $(\{C_1\},C_2)$ is finally applied, we need to have $w(C_2)>w(C_1)$ and the creation of $C_2$ causes the deletion of $C_1$. Thus, within any sequence of improvement steps we can identify a unique predecessor for each coalition $C \notin\mathcal{C}_g$ whose presence is necessary for creation of $C$. Furthermore, this predecessor has weight strictly smaller than $w(C)$. Hence the sequence of predecessors necessary to generate any coalition $C$ is limited by $m$.
\item Our second observation is that the only domination rules that are applied in the deletion of an existing coalition are those based on weight domination. Thus, every deletion of a coalition is accompanied by the creation of a worthier coalition. A chain of deletions again is limited in length by $m$.
\end{enumerate}
Now let $\mathcal{I}$ be some sequence of improvement steps converting $\mathcal{S}_0$ into $\mathcal{S}^*$. If a coalition is created and deleted again but neither used to delete another coalition nor marked as a predecessor to create one, then this coalition provides no contribution for the transformation from $\mathcal{S}_0$ to $\mathcal{S}^*$. Thus we can delete all these coalitions from $\mathcal{I}$ and receive a sequence $\mathcal{I}_1$ which as well transforms $\mathcal{S}_0$ into $\mathcal{S}^*$ via improvement steps. Now in $\mathcal{I}_1$ there might be coalitions which get created and deleted again without use as they only deleted or created coalitions we dropped from $\mathcal{I}_1$. Thus we can repeat this sequence truncation until all remaining coalitions are of use. We claim that this sequence $\mathcal{I}^*$ has to be of polynomial length.
First assume state $\mathcal{S}_0$ is the empty coalition structure. Then we do not have to delete any unfitting coalitions but simply create the needed ones. As not all of $\mathcal{S}^*$ might be in $\mathcal{C}_g$ we possibly have to use generation rules of $T$ but by (1) we know that for each desired coalition we need at most $m$ steps. Thus, overall we need at most $m^2$ steps. Now for an arbitrary starting coalition structure we might also have to delete certain coalitions to reach $\mathcal{S}*$. Thus each of coalition of $\mathcal{S}_0$ might generate a chain of coalitions deleting each other throughout the sequence, but (2) tells us that this chain is limited in length by $m$. Also, (1) again tells us that the number of steps it takes to generate the coalition which is used for the deletion is limited by $m$ as well. The only remaining issue is to argue why additional deletion of coalitions during this procedure does not create problems. Now if such a coalition was part of $\mathcal{S}_0$ it does not create any additional costs. If it was part of some deletion chain, its cost was already accounted towards the coalition of $\mathcal{S}_0$ which had to be deleted. In all other cases, the creation of this coalition was of no use in the first place, that is, it would not be part of the truncated sequence $\mathcal{I}^*$. Hence, overall we have a sequence of length at most $|\mathcal{S}_0|\cdot m^2 + |\mathcal{S}^*|\cdot m \in O(m^2n)$ steps. \qed
\subsection{Proof of Theorem~\ref{np}}
The proof is done via reduction from {\sc 3Sat}\ . We will use the same idea and central construction for all cases and only adapt the structure of the clause-gadgets to the specific settings. Each clause gadget will have the property that one particular vertex $x_C$ has be matched to a vertex of the central construction at some (arbitrary) point during the dynamics and has to be left single again. Otherwise the clause gadget cannot be transformed into the state it has in the desired final matching.
We first outline the universal proof approach including only this one particular vertex $x_C$ per clause $C$ (and the central construction). We show that it is {\sf NP}-hard to decide whether there is a sequence of improvement steps such that each of the clause vertices gets matched and dropped at least once. Afterwards, for every setting we will give the exact clause gadget and explain why it is necessary to match $x_C$ to some vertex outside the clause gadget to reach the final state.
Given a {\sc 3Sat}\ formula with $k$ variables $x_1,\ldots,x_k$ and $l$ clauses $C_1,\ldots,C_l$, where clause $C_j$ contains the literals $l_{1,j}, l_{2,j}$ and $l_{3,j}$, for our central construction we have
\begin{eqnarray*}
U =&&\{u_{x_i}|i=1\ldots k\} \cup \{u_{\overline{x}_i}|i=1\ldots k\} \cup \{x_{C_j}|j=1\ldots l\},\\
W =&&\{w_{x_i}|i=1\ldots k\} \cup \{w_{\overline{x}_i}|i=1\ldots k\}.
\end{eqnarray*}
Further $E=E_1\cup E_2\cup E_3$ with
$E_1=\{u_{x_i},w_{x_i}\}, \{u_{\overline{x}_i},w_{\overline{x}_i}\}\mid i=1\ldots k\}$,
$E_2=\{u_{x_i},w_{\overline{x}_i}\}, \{u_{\overline{x}_i},w_{x_i}\}\mid i=1\ldots k\}$,
and $E_3=\{\{x_{C_j},w_{l_{i,j}}\}\mid j=1\ldots l, i=1\ldots 3\}$,
and benefits in Table~\ref{benefits}.
\setlength{\tabcolsep}{5pt}
\begin{center}
\begin{table}
\caption{Table of edge benefits}
\centering
\begin{tabular}{|l|c|c|l|}\hline
$U$ & $W$ & $b(\{u,w\})$ & ~\\\hline
$x_{C_j}$ & $w_{l_{i,j}}$ & $i\cdot l+j$ & $j=1\ldots l$, $i=1\ldots 3$\\\hline
$u_{x_i}$ & $w_{\overline{x}_i}$ & $4l+i$ & $i=1\ldots k$\\\hline
$u_{\overline{x}_i}$ & $w_{x_i}$ & $4l+k+i$ & $i=1\ldots k$\\\hline
$u_{x_i}$ & $w_{x_i}$ & $4l+2k+i$ & $i=1\ldots k$\\\hline
$u_{\overline{x}_i}$ & $w_{\overline{x}_i}$ & $4l+3k+i$ & $i=1\ldots k$.\\\hline
\end{tabular}
\label{benefits}
\end{table}
\end{center}
For a small example see Figure~\ref{bild3Sat}. In the case of locally and socially stable matching we will have social links between all vertices of $U$ and $W$ to make sure that all edges of $E$ are available for matching at all times. In the case of friendship matching we set all $\alpha$ to $0$ to ensure that utility is also perceived utility.
We start from $M_0=E_2$ and want to reach $M^*=E_1$ which also is the only stable state of this graph. This transformation is always possible, but we now want to decide whether we can construct a sequence which involves all vertices $x_{C_j}$.
First, let us build an intuition what has to happen to match each $x_{C_j}$. Note that we have to create some edge $\{x_{C_j},w_{l_{i,j}}\}$ of $E_3$ for every clause $C_j$, but in the beginning all those edges are blocked through $E_2$. During the dynamics per variable we can switch one edge of $E_2$ to $E_1$ freeing the other $w$-vertex. Then this vertex can be used to ``visit'' all the adjacent clauses in increasing order before creating the second edge of $E_1$. But the $w$-vertex which switched first remains blocked and thus can be used for none of the clauses. Thus, the choice whether to create $\{u_{x_i},w_{x_i}\}$ or $\{u_{\overline{x}_i},w_{\overline{x}_i}\}$ first can be seen as the choice whether to set $x_i$ true or false (by creating the opposite edge first). All clauses that include the variable in the corresponding assignment then can be matched using $w_{x_i}$ respectively $w_{\overline{x}_i}$. We will now formally prove the correctness of the reduction.
Assume that the {\sc 3Sat}\ formula is satisfiable. Then we pick a satisfying assignment and for each variable generate the edge of $E_1$ which symbolizes the inverses of the assignment. Now the $w$-vertex in the assigned value of every variable is unmatched and we one by one generate the incident edges leading to the clause variables in increasing order starting from the smallest unblocked edge. As for every clause at least one literal is satisfied and the edges are created in increasing order and thus cannot block each other, by the end of this phase all vertices $x_{C_j}$ were matched at least once. It remains to generate the second edge for every variable, and we have reached $M^*$ with a sequence of the desired form.
Assume that we can reach $M^*$ from $M_0$ with a sequence matching each $x_{C_j}$ at least once. For each clause $C_j$ pick a vertex $w_{l_{i,j}}$ which was matched to $x_{C_j}$. We claim that for no variable $x_{i}$ both vertices $w_{x_i}$ and $w_{\overline{x}_i}$ are picked: In the beginning both vertices are matched through an edge larger than any edge leading to a clause vertex. Thus to match one of these vertices to some $x_{C_j}$ it first has to become single, that is, its matching partner $u_{\overline{x}_i}$ respectively $u_{x_i}$ has to leave for a better partner. But the only better partner for $u_{\overline{x}_i}$ is $w_{\overline{x}_i}$ and the only better partner for $u_{x_i}$ is $w_{x_i}$. Further, both edges then are stable as they are the top choice of both partners. Hence, to make $w_{x_i}$ available we have to block $w_{\overline{x}_i}$ for the rest of the dynamics and to make $w_{\overline{x}_i}$ available we have to block $w_{x_i}$ for the rest of the dynamics. Now as at most one $w$-vertex of each variable is picked, we can assign each variable the value of the picked vertex and further assign a random value to each variable with no $w$-vertex picked. Then for each clause at least one literal is fulfilled, that is, the formula is satisfied.
\newcommand{0.6le}{0.7}
\begin{figure}
\caption{Central gadget with variables $x$, $y$, $z$ and clause $C_j=x\vee \overline{y}
\label{bild3Sat}
\end{figure}
Finally, we design appropriate clause gadgets for each case:
\begin{enumerate}
\item For \emph{socially and locally stable matching} we add a vertex $y_{C_j}$ to $W$ and an edge $\{x_{C_j},y_{C_j}\}$ of benefit $j$ to $E$ for every clause $C_j$. Further we also add all the edges $\{x_{C_j},y_{C_j}\}$ to the starting state $M_0$ but keep $M^*$. Note that we did no add any social links for $y_{C_j}$. Thus $M^*$ is stable and can be reached if and only if we rematch every $y_{C_j}$ at least once (and hence delete $\{x_{C_j},y_{C_j}\}$).
\item For \emph{considerate matching} we add two vertices $y_{C_j}$ and $y'_{C_j}$ to $W$ and edges $\{x_{C_j},y_{C_j}\}$ of benefit $j-\frac{1}{2}$ and $\{x_{C_j},y'_{C_j}\}$ of benefit $j$ to $E$ for every clause $C_j$. Further we also add all the edges $\{x_{C_j},y_{C_j}\}$ to the starting state $M_0$ and all the edges $\{x_{C_j},y'_{C_j}\}$ to $M^*$. Finally we introduce a social link between $y_{C_j}$ and $y'_{C_j}$. Now $x_{C_j}$ cannot switch from $y_{C_j}$ to $y'_{C_j}$ as $y'_{C_j}$ is friends with $y_{C_j}$ and would thus reject $x_{C_j}$. But, if $x_{C_j}$ is single, $y'_{C_j}$ does not reject $x_{C_j}$. Hence again we need to make sure that for every clause $x_{C_j}$ is matched to some vertex outside the clause-gadget and dropped to reach $M^*$.
\item For \emph{friendship matching} we add two vertices $y_{C_j}$ and $y'_{C_j}$ to $W$ and edges $\{x_{C_j},y_{C_j}\}$ of benefit $j-\frac{1}{2}$ and $\{x_{C_j},y'_{C_j}\}$ of benefit $j$ to $E$ for every clause $C_j$. The only friendship value $\neq 0$ is $\alpha_{x_{C_j},y_{C_j}}=\frac{1}{2j-1}$. Again we add all the edges $\{x_{C_j},y_{C_j}\}$ to the starting state $M_0$ and all the edges $\{x_{C_j},y'_{C_j}\}$ to $M^*$. Note that by the choice of $\alpha_{x_{C_j},y_{C_j}}$ the perceived value for $x_{C_j}$ from $\{x_{C_j},y_{C_j}\}$ now is $(1+\alpha_{x_{C_j},y_{C_j}})(j-\frac{1}{2})=j-\frac{1}{2}+(j-\frac{1}{2})\frac{1}{2j-1}=j=b(\{x_{C_j},y'_{C_j}\})$, that is, there is a tie in $x_{C_j}$'s preference list regarding $y_{C_j}$ and $y'_{C_j}$. Hence $M^*$ is stable but $x_{C_j}$ will not switch directly from $y_{C_j}$ to $y'_{C_j}$. But once $x_{C_j}$ is single we can match it with $y'_{C_j}$ as desired.
\item For \emph{correlated matching with ties} we add two vertices $y_{C_j}$ and $y'_{C_j}$ to $W$ and edges $\{x_{C_j},y_{C_j}\}$ and $\{x_{C_j},y'_{C_j}\}$, both of benefit $j$, to $E$ for every clause $C_j$. Further we also add all the edges $\{x_{C_j},y_{C_j}\}$ to the starting state $M_0$ and all the edges $\{x_{C_j},y'_{C_j}\}$ to $M^*$. Then $x_{C_j}$ does not switch from $y_{C_j}$ to $y'_{C_j}$ as it yields no improvement. But, if $x_{C_j}$ is single, we can choose to match to $y'_{C_j}$.
\item For \emph{matching with strict preferences} we first note that, as all edge values in the central gadget are distinct, we can derive a strict preference order over all possible matching partners for each vertex. Now for each clause $C_j$ we add one vertex $x'_{C_j}$ to $U$ and two vertices $y_{C_j}$ and $y'_{C_j}$ to $W$ and edges $\{x_{C_j},y_{C_j}\}$, $\{x_{C_j},y'_{C_j}\}$, $\{x'_{C_j},y_{C_j}\}$ and $\{x'_{C_j},y'_{C_j}\}$ to $E$. For $x_i$ we add $y_{C_j}>_{x_{C_j}}y'_{C_j}$to the bottom of the preference list, that is, all vertices of the central gadget are preferred. For the other preferences we have $y'_{C_j}>_{x'_{C_j}}y_{C_j}$, $x'_{C_j}>_{y_{C_j}}x_{C_j}$ and $x_{C_j}>_{y'_{C_j}}x'_{C_j}$. To $M_0$ we add $\{x_{C_j},y_{C_j}\}$ and $\{x'_{C_j},y'_{C_j}\}$ and to $M^*$ we add $\{x_{C_j},y'_{C_j}\}$ and $\{x'_{C_j},y_{C_j}\}$. Now the clause gadget has two stable states: $\{\{x_{C_j},y_{C_j}\},\{x'_{C_j},y'_{C_j}\}\}$ and $\{\{x_{C_j},y'_{C_j}\},\{x'_{C_j},y_{C_j}\}\}$. To switch again we first have to break open the stable starting state by matching $x_{C_j}$ to some vertex of the central gadget and then leave $x_{C_j}$ single. Then $y'_{C_j}$ can switch to its preferred choice $x_{C_j}$ which frees $x'_{C_j}$ for $y_{C_j}$ resulting in the desired final state.
\end{enumerate}
\qed
\subsection{Proof of Theorem~\ref{thm:sociallyOneSided}}
The proof is almost identical to the proof for the general case. The only modification is the limitation to pairs that represent social links for the rematching process.
In Phase 1 each matched $w\in W$ increases in terms of utility (or becomes unmatched) and the number of matched $w$ only goes down. Thus, after at most $|U|\cdot |W|$ steps Phase 1 is over.
For Phase 2 we maintain the invariant that no matched $w \in W$ is part of a social blocking pair in any step of the phase. Assume conversely that at some point in Phase 2 there is some matching edge $\{u,w\}$ where $w \in W$ is part of a social blocking pair $\{u',w\}$. As Phase 1 ends only when no matched $w$ can improve further, this situation has to occur after some social blocking pair $\{w',u''\}$ has been resolved in Phase 2. But as $w$ is still matched, this matching edge does not influence $w$'s utility. Also, $u''$ did improve and no vertex in $U$ drops in terms of utility as $w'$ was unmatched before and thus did not leave an agent when matching to $u''$. Hence, all vertices in $U$ which did not want to match to $w$ before still do not want to match $w$. Therefore no matched $w$ can be involved in a social blocking pair during Phase 2. As no matched $w\in W$ ever rematches, no $u\in U$ becomes unmatched and decreases in utility during Phase 2. Thus, in Phase 2 there can be at most $|U| \cdot |W|$ steps. The output is a socially stable matching, as there is no social blocking pair for matched (invariant) and unmatched (Phase 2 terminates) $w \in W$.
\subsection{Proof of Theorem~\ref{thm:considerOneSided}}
Observe that if an edge $\{u,w\} \in L$ forms in $M$, then there are no further considerate blocking pairs for $u$ and $w$ throughout. Hence, if this happens, $\{u,w\}$ remains fixed throughout the run of the algorithm. This does not harm any of the subsequent arguments.
In Phase 1, we again observe that the number of matched $w\in W$ can only decrease. Also, no $w\in W$ ever rematches with some $u\in U$ to which it had been matched before as each matched $w\in W$ only switches partner if it can improve utility by doing so. Once an agent of $W$ loses its partner (due to some other vertex of $W$ matching to it), it will not be considered in Phase 1 anymore. Hence, overall Phase 1 terminates after at most $|U|\cdot |W|$ steps.
For Phase 2 we again maintain the invariant that no matched $w\in W$ is involved in a considerate blocking pair. This claim holds directly after Phase 1 ended. We show that if this holds before some considerate blocking pair $\{u,w\}$ is resolved, then in the resulting matching it holds again. Assume conversely that after $\{u,w\}$ is resolved some matched vertex becomes part of a considerate blocking pair. As $w$ was single, he does not leave any partner in $U$ when matching with $u$. So $w$'s choice was not constrained by the links, and hence $\{u,w\}$ was an ordinary blocking pair. By picking the most preferred one, $w$ is not part of any blocking pair afterwards. Now $u$ matching with $w$ of course opens up the possibility for his former partner $w'$ (if any) to move to $u'$ with $\{u,u'\} \in L$, but this former partner is now unmatched. As there are no links between vertices in $W$, inserting matching edge $\{u,w\}$ alters only the accessible partners for $w$ and $w'$. Since $u$ increases in utility, there are also no additional (considerate) blocking pairs involving $u$. Thus, every considerate blocking pair that evolves must have been present before. This proves that Phase 2 also terminates after at most $|U|\cdot |W|$ steps. The output is a considerate matching, as there is no considerate blocking pair for matched (invariant) and unmatched (Phase 2 terminates) $w \in W$.
\qed
\subsection{Proof of Theorem~\ref{perceivedOnesided}}
Note that in the case of matching with friendship the term \emph{most preferred blocking pair} refers to a perceived blocking pair whose resolution provides the largest perceived welfare.
In phase 1 the number of matched $w\in W$ can only decrease and no $w\in W$ ever rematches with some $u\in U$ it has been matched to before. Once an agent of $W$ loses its partner (due to some other vertex of $W$ matching to it), it will not be considered in Phase 1 anymore. Also, each matched $w\in W$ only switches partner if it can improve perceived utility by doing so. Due to the structure of $\alpha$, the perceived benefit for $w$ does only result from its direct matching partner. Thus $w$ only switches $u$ to $u'$ if $b_w(u,w)<b_w(u',w)$. Hence, $w$ can only be involved in at most $|U|$ resolutions of perceived blocking pairs. Overall, Phase 1 again terminates after at most $|U|\cdot |W|$ steps.
Phase 2 becomes slightly more complicated to analyze. We maintain the invariant that no matched $w\in W$ is involved in a perceived blocking pair. This claim holds directly after Phase 1 ended. We show that if this holds before some perceived blocking pair $\{u,w\}$ is resolved, then in the resulting matching it holds again. Assume conversely that after $\{u,w\}$ is resolved some matched vertex becomes part of a perceived blocking pair. We know that $w'\neq w$ as $u$ was $w$'s most preferred blocking pair partner. Thus, $w'$ was already matched to some $u'\neq u$ before $\{u,w\}$ was resolved but only becomes involved in a perceived blocking pair $\{u'',w'\}$ now. Let $M$ be the matching before $\{u,w\}$ is resolved and $M'$ the matching resulting resolving $\{u,w\}$. Also, let $M''$ be the matching resulting from $M'$ when resolving $\{w',u''\}$, and $\tilde{M}''$ the matching resulting from $M$ if we add $\{u,w\}$ and delete all adjacent edges (that is, resolve $\{u,w\}$ although it might not be a blocking pair). As for $w'$ we have $B_p(M,w')=B_p(M',w')$ and $B_p(M'',w')=B_p(\tilde{M}'',w')$, $w$ is already willing to switch in $M$. Thus $u''$ must not want to switch in $M$ but in $M'$. First assume that $u''=u$. Then $B_p(M,u)<B_p(M',u)$ and further $M''=\tilde{M}''$. Hence, if $u''$ is willing to switch in $M'$, the same holds for $M$. Now assume that $u''\neq u$. Then $u''$ might receive perceived benefit from $u$ which changes from $M$ to $M'$. Note that, as $w$ was unmatched before (that is, $w$ did not leave some benefit-providing $\tilde{u}$ for $u$) and $u''$ does not receive perceived benefit from any vertex in $W$, this is the only perceived benefit that changes for $u''$ between $M$ and $M'$. But then $B_p(M')-B_p(M'')=b_{u''}(\{u'',w'\})-\alpha_{u'',u'}b_{u'}(\{u',w'\})=B_p(M)-B_p(\tilde{M}'')$. Thus, again $u'$ has the same incentive to switch in $M$ as in $M'$. Next, we realize that if some $u\in U$ is matched to some $w$, it is only willing to switch to some unmatched $w'$ if $b_{u}(\{u,w'\})>b_{u}(\{u,w\})$. Thus, once a vertex $u\in U$ is matched in Phase 2, it never becomes unmatched again (as no matched $w\in W$ wants to switch). In every rematching step $u$ increases its direct benefit, so $u$ can only be involved in at most $|W|$ resolutions of perceived blocking pairs. This proves that Phase 2 also terminates after at most $|U|\cdot |W|$ steps. The output is a friendship matching, as there is no perceived blocking pair for matched (invariant) and unmatched (Phase 2 terminates) $w \in W$.
\qed
\end{document} | math |
ఖోఖో విజేతలు కర్ణాటక, కేరళ పురుషుల విభాగంలో రాష్ట్రానికి మూడో స్థానం పురుషుల విభాగంలో తృతీయ స్థానంలో నిలిచిన తెలంగాణ జట్టు వరంగల్ క్రీడా విభాగం, న్యూస్టుడే: దక్షిణ భారత జాతీయ స్థాయి 30వ సీనియర్ ఖోఖో ఛాంపియన్షిప్ పోటీల్లో మహిళల విభాగంలో కర్ణాటక, పురుషుల విభాగంలో కేరళ జట్లు ఛాంపియన్గా నిలిచాయి. సూపర్లీగ్ పద్ధతిలో మూడు రోజులుగా జరుగుతున్న పోటీల్లో మొదటి నుంచి కర్ణాటక, కేరళ రాష్ట్రాల జట్లు దూకుడు ప్రదర్శిస్తూ దుమ్మరేపాయి. ఆదివారం కేరళ, కర్ణాటక రాష్ట్రాల మధ్య ఫైనల్స్ హోరాహోరీగా సాగాయి. మహిళా విభాగంలో కర్ణాటక, కేరళ జట్టుపై 12 4 స్కోరుతో సులువుగా గెలుపొందింది. మూడు, నాలుగో స్థానాల్లో తమిళనాడు, ఆంధ్రప్రదేశ్ జట్లు నిలిచాయి. మరో ఉత్కంఠ భరిత పురుషుల ఫైనల్స్లో కేరళ, కర్ణాటక జట్టుపై 1413 స్కోరుతో విజయబావుటా ఎగురవేసింది. ఆ తర్వాతి స్థానాల్లో తెలంగాణ, ఆంధ్రప్రదేశ్ జట్లు నిలిచాయి. తెలంగాణ మహిళల జట్టు టోర్నీలో ఆడిన ప్రతి మ్యాచులోనూ పేలవమైన ప్రదర్శనతో చివరి స్థానంలో నిలిచింది. ముగింపు వేడుకలకు ముఖ్య అతిథిగా ఖోఖో ఫెడరేషన్ ఆఫ్ ఇండియా కార్యదర్శి ఎంఎస్.త్యాగి హాజరై విజేతలకు ట్రోఫీలను అందించారు. వచ్చే ఏడాది మార్చిలో ఐపీఎల్ తరహాలో దేశవ్యాప్తంగా ఖోఖో పోటీలు నిర్వహిస్తామని తెలిపారు. ప్రముఖ కార్పొరేట్ సంస్థలు, బాలీవుడ్ అగ్ర నటుడు అమితాబ్ బచ్చన్ ఈ లీగ్ పోటీలకు సహకారం అందించనున్నట్లు వివరించారు. తెలంగాణ, ఆంధ్రప్రదేశ్, తమిళనాడు, కేరళ, కర్ణాటక రాష్టాలకు చెందిన మహిళల, పురుషుల జట్లు పాల్గొనగా, పుదుచ్ఛేరి హాజరుకాలేదు. తొలి రెండు స్థానాలు కైవసం చేసుకున్న పురుషులు, మహిళా జట్లు త్వరలో జరుగబోయే ఫెడరేషన్ కప్లో పాల్గొంటాయి. ఈ కార్యక్రమంలో ఖోఖో సంఘం రాష్ట్ర అధ్యక్షుడు రాఘవరెడ్డి, కార్యదర్శి రామకృష్ణ, సౌత్జోన్ కమిటీ ఛైర్మన్ సీతారాంరెడ్డి, హనుమకొండ జిల్లా యువజన క్రీడల అధికారి అశోక్కుమార్, హ్యాండ్బాల్ రాష్ట్ర కార్యదర్శి శ్యామల పవన్కుమార్, ఖోఖో జిల్లా కార్యదర్శి తోట శ్యాంప్రసాద్, కోశాధికారి విజయ్కుమార్, వివిధ రాష్ట్రాల శిక్షకులు, సాంకేతిక నిపుణులు పాల్గొన్నారు. 17న హాకీ క్రీడాకారుల ఎంపిక కేయూ క్యాంపస్, న్యూస్టుడే: దక్షిణ జోన్ అంతర్ విశ్వవిద్యాలయాల పురుషుల క్రీడాపోటీల్లో పాల్గొనే కాకతీయ విశ్వవిద్యాలయం జట్టును ఈ నెల 17వ తేదీన ఎంపిక చేయనున్నట్లు కేయూ క్రీడామండలి కార్యదర్శి డాక్టర్ టి.సవితాజ్యోత్స్న ఆదివారం ఒక ప్రకటనలో తెలిపారు. క్యాంపస్లోని క్రీడామైదానంలో క్రీడాకారులు హాజరుకావాలని సూచించారు. కళాశాల నుంచి గుర్తింపు కార్డు, అర్హత పత్రాలతో పాటుగా పదోతరగతి, ఇంటర్మీడియెట్ ఉత్తీర్ణత పత్రాలను తమ వెంట తెచ్చుకోవాలన్నారు. ఎంపిక పోటీల్లో ప్రతిభ కనబరిచిన క్రీడాకారులను అంతర్ విశ్వవిద్యాలయాల పోటీలకు పంపిస్తామన్నారు. ఈనెల 22 నుంచి ఆంధ్రపదేశ్లోని నాగార్జున విశ్వవిద్యాలయంలో పోటీలు నిర్వహిస్తారన్నారు. వీల్ఛైర్ క్రికెట్ జట్టుకు ఎంపిక డోర్నకల్, న్యూస్టుడే: ముంబైలో డిసెంబరు 2, 3వ తేదీల్లో ముంబైతెలంగాణ జట్ల మధ్య జరిగే వీల్ ఛైర్ క్రికెట్ పోటీలో పాల్గొనే 15 మంది సభ్యులతో కూడిన రాష్ట్ర జట్టుకు ఉమ్మడి వరంగల్ జిల్లా నుంచి అయిదుగురు ఎంపికయ్యారు. క్రీడాకారులు ఆలెపు భరత్, బండ్ల రాము, గంధం సంతోష్, వి.సుధాకర్, బి.వీరన్నకు దివ్యాంగ క్రికెట్ కంట్రోల్ బోర్డు ఆఫ్ ఇండియాడీసీసీబీఐ తెలంగాణ శాఖ అధ్యక్షుడు శ్రీధర్ సమాచారమందించారు. వీల్ ఛైర్ క్రికెట్ పోటీలకు ముంబైలోని సంతాక్రజ్లోని లయన్స్ గ్రౌండ్ వేదిక కానుంది. Advertisement | telegu |
യു.എസിലെ ഷോപ്പിങ് മാളില് വെടിവെപ്പ് രണ്ടുമരണം, നാലുപേര്ക്ക് പരിക്ക് വാഷിങ്ടണ്: യു.എസിലെ ഐഡഹോയിലെ ബോയ്സീഷോപ്പിങ് മാളിലുണ്ടായ വെടിവെപ്പില് രണ്ടുമരണം. ഒരു പൊലീസ് ഉദ്യോഗസ്ഥന് ഉള്പ്പെടെ നാലുപേര്ക്ക് പരിക്കേല്ക്കറ്റതായും പ്രതിയെ കസ്റ്റഡിയിലെടുത്തതായും പൊലീസ് പറഞ്ഞു. കേരളഓണ്ലൈന് ന്യൂസ് യൂട്യൂബ് ചാനല് സബ്സ്ക്രൈബ് ചെയ്യാം സുരക്ഷ ഉദ്യോഗസ്ഥരും അക്രമിയും തമ്മില് വെടിവെപ്പ് നടത്തതായി അധികൃതര് വാര്ത്താസേമ്മളനത്തില് അറിയിച്ചു. മാള് ഉടന്തന്നെ ഒഴിപ്പിച്ചു. മറ്റു പ്രതികളുണ്ടോയെന്ന് തിരച്ചില് നടത്തിയതായും അധികൃതര് അറിയിച്ചു. Also read അമേരിക്കയെ ഞെട്ടിച്ച് സിനിമാ സെറ്റില് കൊലപാതകം ഡല്ഹി കോടതി വളപ്പില് വെടിവെയ്പ്പ് റിമാന്ഡിലായിരുന്ന ഗുണ്ടാനേതാവ് ഉള്പ്പടെ നാലു പേര് കൊല്ലപ്പെട്ടു സിനിമാ ചിത്രീകരണത്തിനുള്ള കോവിഡ് മാര്ഗനിര്ദേശങ്ങള് പുറത്തിറക്കി: ലൊക്കേഷന് പുറത്തുപോകാനാകില്ല മരിച്ചവരെ കുറിച്ചോ പ്രതിയെക്കുറിച്ചോ പൊലീസ് കൂടുതല് വിവരങ്ങള് പുറത്തുവിട്ടിട്ടില്ല. പുലര്ച്ചെ 1.50ഓടെയായിരുന്നു വെടിവെപ്പ്. പൊലീസ് എത്തുന്നതിന് മുമ്ബുതന്നെ ഒരാള് വെടിയേറ്റ് വീണിരുന്നു. പൊലീസ് ഉദ്യോഗസഥര് എത്തിയതോടെ വീണ്ടും വെടിവെപ്പുണ്ടായി. ഒരു പൊലീസുകാരന് പരിക്കേറ്റു. | malyali |
घर पर बनाएं चिकन मलाई कबाब, जाने रेसिपी जनता से रिश्ता वेबडेस्क। नॉन वेज खाने के शौकीनों को चिकन की नईनई डिश खाने का शौक होता है। जैसे, जब भी बात चिकन रेसिपी की होती है, तो बटर चिकन, तंदूरी चिकन या चिकन बिरयानी को खूब पसंद किया जाता है लेकिन इन डिशेज से अलग चिकन मलाई कबाब का फ्लेवर भी कम स्वादिष्ट नहीं लगता। आज हम आपको ऐसी ही लजीज रेसिपी के बारे में बता रहे हैं, आप अगर इस रेसिपी को फॉलो करेंगे, तो चिकन मलाई कबाब बिल्कुल रेस्टोरेंट स्टाइल में बनकर तैयार हो जाएगा।चिकन मलाई कबाब बनाने की सामग्री500 ग्राम बोनलेस चिकन1 टीस्पून लाल मिर्च पेस्ट12 कप क्रीम मलाई1 टेबलस्पून अदरकलहसुन का पेस्ट1 टीस्पून लाल मिर्च पाउडर1 टीस्पून गरम मसाला1 टीस्पून जीरा पाउडर1 टेबलस्पून नींबू का रसनमक स्वादानुसारतेल जरूरत के अनुसारचिकन मलाई कबाब बनाने की विधि सबसे पहले चिकन के छोटे टुकड़ों को लंबाई में काटें और फिर इसमें चाकू से चीरा लगाएं। धुले हुए चिकन के पीस को बड़े बाउल में डालकर उसमें लाल मिर्च पेस्ट, ताजी क्रीम, अदरकलहसुन का पेस्ट, लाल मिर्च पाउडर, गरम मसाला, जीरा पाउडर, नींबू रस, थोड़ा सा तेल, नमक अच्छे से मिलाएं। क्रीम को अच्छी तरह फेंटकर मसाले मिले हुए चिकन के टुकड़ों पर डालें और अच्छी तरह मिलाएं। फिर मसालेमलाई में मिक्स चिकन को 5 से 6 घंटे के लिए फ्रिज में मेरिनेट करने रख दें। चिकन को फ्रिज से निकालकर प्री हीटेड ओवन में 10 मिनट तक रोस्ट करें। चिकन पक जाए तो गरमगरम चिकन मलाई कबाब को चटनी और प्याज के साथ सर्व करें। | hindi |
PM મોદીનું રાજકોટ એરપોર્ટ પર CM પટેલે કર્યું સ્વાગત PM મોદી રાજકોટ એરપોર્ટ પહોંચ્યાહેલિકોપ્ટરથી ઓટકોટ જવા થયા રવાનાહોસ્પિટલના લોકાર્પણના કાર્યક્રમમાં લેશે ભાગ દેશના વડાપ્રધાન નરેન્દ્ર મોદી આજે ગુજરાતના પ્રવાસે છે. સૌથી પહેલા જસદણના આટકોટમાં પાટીદાર સમાજ દ્વારા નિર્મિત કે.ડી.પરવાડિયા મલ્ટી સ્પેશિયાલિસ્ટ હોસ્પિટલના લોકાર્પણ માટે રાજકોટ એરપોર્ટ પર આવ્યા ત્યારે મુખ્યમંત્રી ભૂપેન્દ્ર પટેલ અને સી.આર. પાટીલે તેમનું સ્વાગત કર્યું. આ પછી તેઓ હેલિકોપ્ટર મારફત આટકોટ જવા રવાના થયા છે. પીએમ મોદીના પ્રવાસને ધ્યાનમાં રાખીને આજે એક દિવસ માટે આટકોટને નોફ્લાય ઝોન જાહેર કરાયું છે. જેને પગલે બે એ૨લાઈન્સ કંપનીની દિલ્હીની ફ્લાઈટનાં સમયમાં ફે૨ફા૨ ક૨વામાં આવ્યો છે. PM મોદી અને કેન્દ્રીય ગૃહમંત્રી અમિત શાહ આજે અનેક પરિયોજનાઓનું ઉદ્ધાટન કરશે અને સમારોહમાં સામેલ થવા માટે આજે ગુજરાતમાં રોકાશે. સવારે 10 વાગે પીએમ મોદી રાજકોટના અટકોટમાં નવનિર્મિત માતૃશ્રી કેડીપી મલ્ટીસ્પેશિયાલિટી હોસ્પિટલની મુલાકાત લેશે. આ પછી કાર્યક્રમ સ્થળે સાર્વજનિક સમારોહમાં તેમનું સંબોધન હશે. આ પહેલા પીએમ મોજી 11 અને 12 માર્ચે પણ ગુજરાતની મુલાકાતે આવ્યા હતા અને પંચાયતી રાજ સંમેલનની અધ્યક્ષતા કરી હતી. કલોલમાં ઈફ્કોના નવનિર્મિત નૈનો યૂરિયા સંયંત્રનું ઉદ્ઘાટન કરશેપીએમ મોદી સાંજે 4 વાગે ગાંધીનગરના મહાત્મા મંદિરમાં સહકારથી સમૃદ્ધિ મુદ્દે વિભિન્ન સહકારી સંસ્થાના નેતાઓના એક સેમિનારને સંબોધિત કરશે. આ પછી કલોલમાં ઈફ્કોના નવનિર્મિત નૈનો યૂરિયા સંયંત્રનું ઉદ્ઘાટન કરશે. આ પ્લાન્ટથી રોજ 500 એમએલની 1.5 લાખ નૈનો યૂરિયા બોટલનું ઉત્પાદન કરશે. શુક્રવારે રાતે અમદાવાદના સરદાર વલ્લભભાઈ પટેલ આંતરરાષ્ટ્રિય હવાઈ મથકે પહોંચેલા ગૃહમંત્રી અમિત શાહના શનિવારે સાંજે મહાત્મા મંદિરમાં પીએમ મોદી સાથે કાર્યક્રમમાં સામેલ થવાની આશા છે. પીએમ મોદીના કાર્યક્રમમાં સૌરાષ્ટ્રના તમામ જિલ્લામાંથી પાટીદારો એકઠા થશે અને સાથે પાટીદારો ભાજપ સાથે હોવાનો સભામાં સંદેશ આપશે.આવો હશે પીએમ મોદીનો કાર્યક્રમસવારે 9.30 વાગે PM મોદી રાજકોટ પહોંચશે એરપોર્ટથી સવારે 10 વાગે આટકોટ જવા રવાના થશે પટેલ સેવા સંચાલિત કે.ડી પરવાડિયા હોસ્પિટલનુ કરશે લોકાર્પણ લોકાર્પણ બાદ PM મોદી સભા સબોંધશે PM મોદી 12.30 વાગે રાજકોટથી અમદાવાદ આવશે 12.30 વાગે એરપોર્ટથી રાજભવન જશે PM મોદી રાજભવન ખાતે સાંજે 4 વાગે સુધી કરશે રોકાણ મહાત્મા મંદિર ખાતે સહકાર સે સમૃદ્ધિ સેમિનારને સંબોધિત કરશે સેમિનારમાં વિવિધ સહકારી સંસ્થાઓના પ્રતિનિધિઓ ભાગ લેશે IFFCO, કલોલ ખાતે નિર્મિત નેનો યુરિયા પ્લાન્ટનું ઉદ્ઘાટન કરશેગાંધીનગરના કાર્યક્રમ બાદ દિલ્હી રવાના થશેકોસ્ટલ પોલિસના પ્રશિક્ષુઓને સંબોધિત કરશે શાહઆ પહેલા શનિવાર સવારે અમિત શાહ જામનગર અને દેવભૂમિ દ્વારાકા પહોંચીને તટીય પોલીસ પ્રશિક્ષણ કેન્દ્રમાં પ્રશિક્ષુઓને સંબોધિત કરશે. આ પછી દ્વારકાધીશ મંદિરમાં પૂજા કરશે. આ પછી રવિવારે અમદાવાદના નારણપુરા વિસ્તારમાં એક ખેલ પરિસરની આધારશિલા મૂકશે. આ પછી ખેડાના નડિયાદમાં એક કાર્યક્રમમાં સામેલ થશે અને વર્ચ્યુ્લી રાજ્યના 25 જિલ્લામાં પોલીસ કર્મીને માટે 57 ઘરનું ઉદ્ઘાટન કરશે. પીએમ મોદી અને અમિત શાહના ગુજરાતના આ પ્રવાસને આગામી વિધાનસભાની ચૂંટણીને લઈને એક ભાજપની તૈયારીઓના સ્વરૂપમાં જોવામાં આવી રહ્યો છે. વ્યવસ્થાના ભાગરૂપે 3500 સ્વયંસૈનિકો હાજરરાજકોટમાં મોદી એરપોર્ટ બહાર નહીં નીકળે છતાં તમામ ઈમરજન્સી વ્યવસ્થા કરવામાં આવી છે. કલેક્ટર અને પોલીસ તંત્ર છેલ્લી ઘડી સુધીની તૈયારીમાં વ્યસ્ત બની ગયું છે. આટકોટમાં મોદીની સભામાં અંદાજિત 3 લાખ લોકો એકઠા થશે અને આ માટે વ્યવસ્થાના ભાગરૂપે 3500 સ્વયંસૈનિકો સભાસ્થળ પર તૈનાત રહેશે. | gujurati |
स्वादिष्ट और हेल्दी डिश की रेसिपी के बारे में बताएंगे और ये डिश है बीटरूट मंचूरियन जनता से रिश्ता वेबडेस्क। सर्दियों के मौसम में हर किसी को जल्दी जल्दी भूख लग जाती है। ऐसे में जरूरी है कि आप अपनी डाइट में उन चीजों को शामिल करें जो आपकी सेहत के लिए अच्छा रहें साथ ही खाने में भी लाजवाब लगे। ऐसे में आज हम आपको एक ऐसे ही स्वादिष्ट और हेल्दी डिश के बारे बताएंगे और ये डिश बीटरूट मंचूरियन की है।वैसे तो मंचूरियन सबसे फेमस डिश में से एक होता है। ज्यादातर लोगों को ये खाना बेहद पंसद भी होता है। वहीं कुछ लोग इसे बीटरूट मंचूरियन के तौर पर खाना पंसद करते हैं। लेकिन क्या आपने इसे कभी खाया है? अगर नहीं, तो आज हम आपको बीटरूट मंचूरियन की रेसिपी बताएंगे। आप इसे घर पर ही आसानी से बना सकते हैं। आइए जानते हैं बीटरूट मंचूरियन बनाने की रेसिपीबीटरूट मंचूरियन बनाने के लिए सामग्रीचुकंदर 1पत्ता गोभी 250 ग्राम कटा हुआफूल गोभी 100 ग्रामलाल मिर्च काली मिर्च पाउडर 1 चम्मचकॉर्न फ्लोर 2 चम्मचनमक स्वादानुसारअदरकलहसुन का पेस्ट 2 चम्मचमैदा 4 चम्मचमंचूरियन ग्रेवी बनाने के लिए सामग्री:गाजर 1 बारीक कटा हुआशिमला मिर्च 1 बारीक कटा हुआहरी मिर्च 2 बारीक कटी हुईसोया सॉस 2 चम्मचनमक स्वादानुसारपानीतेलअगर घर पर नहीं जमता है गाढ़ा दही तो ट्राई करें ये आसान तरीके, बाजार जैसा आएगा स्वादबीटरूट मंचूरियन बनाने की रेसिपी:बीटरूट मंचूरियन बनाने के लिए सबसे पहले चुकंदर के छिलके उतारकर उसे पानी में उबला दें।जब ये उबल जाए तो इसे अच्छी तरह से मैश कर दें। उसके बाद एक बर्तन में पत्ता गोभी और फूल गोभी को अच्छे से साफ करने के बाद इसे कद्दूकस कर लें। फिर इसमें कॉर्न फ्लोर और मैदा डालकर मिक्स कर दें।अब इसमें काली मिर्च, लाल मिर्च, नमक, अदरकलहसुन का पेस्ट और थोड़ा सा पानी डालकर मिला दें।इसके बाद इस मिश्रण के छोटेछोटे बॉल्स बना लें।फिर एक पैन में तेल गर्म करें और उन बॉल्स को डीप फ्राई कर लें। मंचूरियन ग्रेवी बनाने की रेसिपी:अब एक पैन में 23 चम्मच तेल डालकर गर्म करें।जब गर्म हो जाए तो इसमें पहले अदरक और लहसुन डालकर भून लें।उसके बाद इसमें सभी सब्जियां गाजर, प्याज, शिमला मिर्च, कटी हुई पत्ता गोभी और हरी मिर्च डालकर अच्छे से भून लें।जब ये पक जाए तो इसमें सोया सॉस, नमक, थोड़ा सा मैदा डालकर कुछ देर तक पका लें। उसके बाद इसमें हल्का पानी डाल दें। ग्रेवी के गाढ़े हो जाने पर इसमें तैयार मंचूरियन बॉल्स को डालकर कुछ देर पका लें।लीजिए तैयार हो गया आपका स्वादिष्ट बीटरूट मंचूरियन। | hindi |
UP Election 2022: नवाब काजिम अली खान हैं सबसे अमीर प्रत्याशी, 296 करोड़ रुपए है संपत्ति उत्तर प्रदेश विधानसभा चुनाव में 403 विधानसभा सीटों के लिए हजारों उम्मीदवार मैदान में ताल ठोक रहे हैं। भारतीय जनता पार्टी बीजेपी, समाजवादी पार्टी सपा और बहुजन समाज पार्टी बसपा समेत अन्य दलों के उम्मीदवार हों या निर्दलीय, चुनाव लड़ रहे अधिकतर उम्मीदवार करोड़पति हैं। अब तक जिन प्रत्याशियों ने नामांकन दाखिल किया है, उनमें सबसे अधिक संपत्ति रामपुर से चुनाव लड़ रहे कांग्रेस नेता नवाब काजिम अली खान के पास है। असोसिएशन फॉर डेमोक्रेटिक रिफॉर्म्स एडीआर और माय नेता इन्फो की ओर से अब तक 113 विधानसभा सीटों के जिन 1199 उम्मीदवारों के शपथपत्र का विश्लेषण किया है, उसके मुताबिक, सबसे अधिक 296 करोड़ रुपए 2,96,88,48,840 रुपए की चलअचल संपत्ति नवाब काजिम अली खान के पास है। वहीं, उन पर 73,43,266 रुपए की देनदारी भी है। नवाब साहब ने हलफनामे में बताया है कि उनके पास 45 हजार रुपए नकदी है, जबकि उनकी पत्नी के पास 50 हजार रुपए कैश है। बैंक में कुल 3,47,600 रुपए जमा हैं। 44.25 लाख रुपए के बॉन्ड और शेयर हैं। नवाब काजिम अली खान के पास फॉर्च्युनर, फोर्ड एंडेवर, टोयोटा फॉर्च्युनर समेत तीन गाड़ियां हैं, जिनका कुल मूल्य 83,44,000 रुपए है। उनके पास कुल 48,97,000 रुपए की जूलरी है और कुल चल संपत्ति 2,14,08,600 रुपए की है। 246 करोड़ की अचल संपत्ति नवाब काजिम अली खान की ओर से दिए गए ब्योरे के मुताबिक, उनके पास रामपुर में कुल 48,81,00,000 करोड़ रुपए की कृषि योग्य भूमि है तो 224 करोड़ रुपए 2,24,17,00,000 की गैर कृषि योग्य भूमि है। वहीं, रामपुर स्थित नूर महल और दिल्ली के आवास की कुल कीमत 21 करोड़ रुपए बताई गई है। वहीं, उनपर बैंकों से लिया 73,43,226 रुपए कर्ज भी है। For Hindustan : हिन्दुस्तान ईसमाचार पत्र के लिए क्लिक करें epaper.livehindustan.com | hindi |
Amarnath Cloudburst: অমরনাথ বিপর্যয়ে নবান্নে কন্ট্রোল রুম খুললেন মমতা, সমবেদনা জানিয়ে টুইট মুখ্যমন্ত্রীর অমরনাথে মেঘভাঙা Amarnath Cloudburst বৃষ্টিতে বিপর্যয় নিয়ে শোকপ্রকাশ করে টুইট করলেন মুখ্যমন্ত্রী মমতা বন্দ্যোপাধ্যায় যাঁরা প্রাণ হারিয়েছেন, তাঁদের পরিবারের প্রতি সমবেদনা জানালেন মমতা বাংলা থেকে অমরনাথ বা সংলগ্ন এলাকায় আটকে পড়া বা সমস্যায় পড়া পূন্যার্থীদের জন্য নবান্নে কন্ট্রোল রুম খোলার কথা ঘোষণা করলেন মমতা ফোন নম্বর হল: ০৩৩২২১৪৩৫২৬ বৃহস্পতিবার বিকেল সাড়ে ৫টা নাগাদ জম্মুকাশ্মীরের অমরনাথ গুহার কাছে হঠাত্ শুরু হয় মেঘভাঙা বৃষ্টি কিছুক্ষণের মধ্যেই ভেসে যায় পুণ্যার্থীদের ২৫টি ক্যাম্প অমরনাথ গুহার কাছে মেঘভাঙা বৃষ্টির জেরে এখনও পর্যন্ত ১৬জনের মৃত্যুর খবর পাওয়া গিয়েছে, নিখোঁজ এখনও ৪০জন দেখুন টুইট টুইটার, ইনস্টাগ্রাম এবং ইউটিউব সহ সোশাল মিডিয়া থেকে আপনার কাছে সর্বশেষতম ব্রেকিং নিউজ, ভাইরাল ট্রেন্ডস এবং ইনফরমেশন নিয়ে আসে SocialLY উপরের পোস্টটি ব্যবহারকারীর সোশাল মিডিয়া অ্যাকাউন্ট থেকে সরাসরি এম্বেড করা হয়েছে এবং লেটেস্টলি এতে কোনও সংশোধন বা সম্পাদনা করেনি সোশাল মিডিয়া পোস্টের মতামত এবং তথ্য লেটেস্টলির মতামতকে প্রতিফলিত করে না লেটেস্টলি এর জন্য কোনও দায়বদ্ধতা বা দায় গ্রহণ করে না Watch Related Videos showVideoTitletrue | bengali |
நிலத்தகராறில் விவசாயி மர்மச்சாவு: நடவடிக்கை எடுக்க உறவினர்கள் சாலை மறியல் சேலம்: நிலத்தகராறில் விவசாயி இறந்த விவகாரத்தில், உரிய நடவடிக்கை எடுக்கக்கோரி, உறவினர்கள் சாலைமறியல் போராட்டத்தில் ஈடுபட்டனர்.சேலம் மாவட்டம், வாழப்பாடி, அத்தனூர்பட்டி, குமார சாமியூரைச் சேர்ந்த விவசாயி ஜெய்சங்கர், 45. இவருக்கும், அதே பகுதியைச் சேர்ந்த செல்வராஜ், வெங்கடேஷ் ஆகியோருக்கும், நிலப்பிரச்னை தொடர்பாக, , நேற்று முன்தினம் வாக்குவாதம் ஏற்பட்டது. அதில், ஜெய்சங்கர் விழுந்து உயிரிழந்தார். வாழப்பாடி போலீசார், சந்தேக மரண வழக்குப்பதிந்து விசாரிக்கின்றனர். நேற்று, ஜெய்சங்கரின் உறவினர்கள், சம்பந்தப்பட்டவர்களை கைது செய்யக்கோரி, அத்தனூர்பட்டியில் சாலை மறியலில் ஈடுபட்டனர். போலீசார், பிரேத சோதனை அறிக்கை பெறப்பட்ட பின், மேல்நடவடிக்கை எடுக்கப்படும் என, உறுதியளித்தனர். பின், மறியலில் ஈடுபட்டவர்கள் கலைந்து சென்றனர். அப்போது, மறியலை மொபைல் போனில் படம் எடுத்தவர்களிடம், போன்களை பறிமுதல் செய்து, போலீசார் எச்சரித்து அனுப்பியதாக புகார் எழுந்தது. போலீசார் கூறுகையில், ஜெய்சங்கர் இறப்பு மீது சந்தேகம் உள்ளதால், பிரேத அறிக்கை பெறப்பட்ட பின், அடுத்தகட்ட நடவடிக்கை எடுக்கப்படும். மறியலில் ஈடுபட வந்தவர்களிடம், பேச்சு நடத்திய பின் அனைவரும் சென்றுவிட்டனர். யாரிடமும் மொபைல் போன் பறிமுதல் செய்யவில்லை. தவறான தகவல் பரப்புகின்றனர் என்றனர். | tamil |
（英） In Utsunomiya Campus, Teikyo University, registration system by mobile phone (Mobile-MARS) is used for student’s attendance registration and tests. Registration process of this system is as follows: 「access to the Web page」→「input school registration number and private certification password」→「input lecture name and lecture password」→「select of attendance registration item」 Therefore, students have to input many items for registration by Mobile-MARS. In this paper, we propose the improved system which minimizes input items using QR code and mobile phone ID. And we also describe about the system configuration, key technologies and practical field trial results.
文献情報 信学技報, vol. 109, no. 387, ET2009-94, pp. 13-18, 2010年1月. | english |
$script:SPDscUtilModulePath = Join-Path -Path $PSScriptRoot -ChildPath '..\..\Modules\SharePointDsc.Util'
Import-Module -Name $script:SPDscUtilModulePath
function Get-TargetResource
{
[CmdletBinding()]
[OutputType([System.Collections.Hashtable])]
param
(
[Parameter(Mandatory = $true)]
[System.String]
$Name,
[Parameter(Mandatory = $true)]
[System.String]
$Forest,
[Parameter(Mandatory = $true)]
[System.Management.Automation.PSCredential]
$ConnectionCredentials,
[Parameter(Mandatory = $true)]
[System.String]
$UserProfileService,
[Parameter(Mandatory = $true)]
[System.String[]]
$IncludedOUs,
[Parameter()]
[System.String[]]
$ExcludedOUs,
[Parameter()]
[System.String]
$Server,
[Parameter()]
[System.UInt32]
$Port = 389,
[Parameter()]
[System.Boolean]
$Force,
[Parameter()]
[System.Boolean]
$UseSSL,
[Parameter()]
[System.Boolean]
$UseDisabledFilter,
[Parameter()]
[ValidateSet("ActiveDirectory", "BusinessDataCatalog")]
[System.String]
$ConnectionType,
[Parameter()]
[ValidateSet("Present", "Absent")]
[System.String]
$Ensure = "Present",
[Parameter()]
[System.Management.Automation.PSCredential]
$InstallAccount
)
Write-Verbose -Message "Getting user profile service sync connection $Name"
$result = Invoke-SPDscCommand -Credential $InstallAccount `
-Arguments $PSBoundParameters `
-ScriptBlock {
$params = $args[0]
$ups = Get-SPServiceApplication | Where-Object -FilterScript {
$_.Name -eq $params.UserProfileService
}
$nullReturn = @{
Name = $params.Name
UserProfileService = $null
Forest = $null
ConnectionCredentials = $null
IncludedOUs = $null
ExcludedOUs = $null
Server = $null
Port = $null
UseSSL = $null
UseDisabledFilter = $null
ConnectionType = $null
Force = $null
Ensure = "Absent"
}
if ($null -eq $ups)
{
return $nullReturn
}
else
{
$context = Get-SPDscServiceContext -ProxyGroup $ups.ServiceApplicationProxyGroup
$upcm = New-Object -TypeName "Microsoft.Office.Server.UserProfiles.UserProfileConfigManager" `
-ArgumentList $context
$Name = $params.Name
$connection = $upcm.ConnectionManager | Where-Object -FilterScript {
$_.DisplayName -eq $Name
}
# In SP2016, the forest name is used as name but the dot is replaced by a dash
$installedVersion = Get-SPDscInstalledProductVersion
if ($installedVersion.FileMajorPart -eq 16 -and $null -eq $connection)
{
$Name = $params.Forest -replace "\.", "-"
$connection = $upcm.ConnectionManager | Where-Object -FilterScript {
$_.DisplayName -eq $Name
}
}
if ($null -eq $connection)
{
return $nullReturn
}
$namingContext = $connection.NamingContexts | Select-Object -First 1
if ($null -eq $namingContext)
{
$BINDING_FLAGS = ([System.Reflection.BindingFlags]::NonPublic -bOr [System.Reflection.BindingFlags]::Instance)
$adImportNamespace = [Microsoft.Office.Server.UserProfiles.ActiveDirectoryImportConnection]
$METHOD_GET_NAMINGCONTEXTS = $adImportNamespace.GetMethod("get_NamingContexts", $BINDING_FLAGS)
$METHOD_GET_ACCOUNTUSERNAME = $adImportNamespace.GetMethod("get_AccountUsername", $BINDING_FLAGS)
$METHOD_GET_ACCOUNTDOMAIN = $adImportNamespace.GetMethod("get_AccountDomain", $BINDING_FLAGS)
$METHOD_GET_USEDISABLEDFILTER = $adImportNamespace.GetMethod("get_UseDisabledFilter", $BINDING_FLAGS)
$METHOD_GET_USESSL = $adImportNamespace.GetMethod("get_UseSSL", $BINDING_FLAGS)
$namingContexts = $METHOD_GET_NAMINGCONTEXTS.Invoke($connection, $null)
$accountName = $METHOD_GET_ACCOUNTUSERNAME.Invoke($connection, $null)
$accountDomain = $METHOD_GET_ACCOUNTDOMAIN.Invoke($connection, $null)
$accountCredentials = $accountDomain + "\" + $accountName
$useDisabledFilter = $METHOD_GET_USEDISABLEDFILTER.Invoke($connection, $null)
$useSSL = $METHOD_GET_USESSL.Invoke($connection, $null)
if ($null -eq $namingContexts)
{
return $nullReturn
}
if ($null -eq $namingContexts.ContainersIncluded)
{
$inclOUs = @()
}
else
{
$inclOUs = @($namingContexts.ContainersIncluded)
}
if ($null -eq $namingContexts.ContainersExcluded)
{
$exclOUs = @()
}
else
{
$exclOUs = @($namingContexts.ContainersExcluded)
}
return @{
Name = $params.Name
UserProfileService = $params.UserProfileService
Forest = $namingContexts.DistinguishedName.Replace(",DC=", ".").Replace("DC=", "");
ConnectionCredentials = $accountCredentials
IncludedOUs = $inclOUs
ExcludedOUs = $exclOUs
Server = $null
Port = $params.Port
UseSSL = $useSSL
UseDisabledFilter = $useDisabledFilter
ConnectionType = $connection.Type -replace "Import", ""
Force = $params.Force
Ensure = "Present"
}
}
$accountCredentials = "$($connection.AccountDomain)\$($connection.AccountUsername)"
$domainController = $namingContext.PreferredDomainControllers | Select-Object -First 1
if ($null -eq $namingContext.ContainersIncluded)
{
$inclOUs = @()
}
else
{
$inclOUs = @($namingContext.ContainersIncluded)
}
if ($null -eq $namingContext.ContainersExcluded)
{
$exclOUs = @()
}
else
{
$exclOUs = @($namingContext.ContainersExcluded)
}
return @{
Name = $params.Name
UserProfileService = $params.UserProfileService
Forest = $connection.Server
ConnectionCredentials = $accountCredentials
IncludedOUs = $inclOUs
ExcludedOUs = $exclOUs
Server = $domainController
UseSSL = $connection.UseSSL
UseDisabledFilter = $connection.UseDisabledFilter
Port = $params.Port
ConnectionType = $connection.Type.ToString()
Force = $params.Force
Ensure = "Present"
}
}
}
return $result
}
function Set-TargetResource
{
[CmdletBinding()]
param
(
[Parameter(Mandatory = $true)]
[System.String]
$Name,
[Parameter(Mandatory = $true)]
[System.String]
$Forest,
[Parameter(Mandatory = $true)]
[System.Management.Automation.PSCredential]
$ConnectionCredentials,
[Parameter(Mandatory = $true)]
[System.String]
$UserProfileService,
[Parameter(Mandatory = $true)]
[System.String[]]
$IncludedOUs,
[Parameter()]
[System.String[]]
$ExcludedOUs,
[Parameter()]
[System.String]
$Server,
[Parameter()]
[System.UInt32]
$Port = 389,
[Parameter()]
[System.Boolean]
$Force,
[Parameter()]
[System.Boolean]
$UseSSL,
[Parameter()]
[System.Boolean]
$UseDisabledFilter,
[Parameter()]
[ValidateSet("ActiveDirectory", "BusinessDataCatalog")]
[System.String]
$ConnectionType,
[Parameter()]
[ValidateSet("Present", "Absent")]
[System.String]
$Ensure = "Present",
[Parameter()]
[System.Management.Automation.PSCredential]
$InstallAccount
)
Write-Verbose -Message "Setting user profile service sync connection $Name"
$PSBoundParameters.Ensure = $Ensure
if ($PSBoundParameters.ContainsKey("UseSSL") -eq $false)
{
Write-Verbose -Message "UseSSL is not specified. Assuming that SSL is not required."
$PSBoundParameters.UseSSL = $false
}
else
{
if ($UseSSL -eq $true -and $PSBoundParameters.ContainsKey("Port") -eq $false)
{
Write-Verbose -Message ("UseSSL is set to True, but no port is specified. Assuming " + `
"that port 636 (default LDAPS port) is to be used.")
$PSBoundParameters.Port = 636
}
}
$installedVersion = Get-SPDscInstalledProductVersion
if ($PSBoundParameters.ContainsKey("Port") -eq $false)
{
$PSBoundParameters.Port = $Port
}
else
{
if ($installedVersion.FileMajorPart -eq 15)
{
Write-Verbose -Message "NOTE: The Port parameter is not used in SharePoint 2013."
}
}
if ($PSBoundParameters.ContainsKey("UseDisabledFilter") -eq $false)
{
Write-Verbose -Message ("UseDisabledFilter is not specified. Assuming that disabled " + `
"accounts should not be filtered.")
$PSBoundParameters.UseDisabledFilter = $false
}
else
{
if ($installedVersion.FileMajorPart -eq 15)
{
Write-Verbose -Message "NOTE: The UseDisabledFilter parameter is ignored in SharePoint 2013."
}
}
Invoke-SPDscCommand -Credential $InstallAccount `
-Arguments @($PSBoundParameters, $MyInvocation.MyCommand.Source, $PSScriptRoot) `
-ScriptBlock {
$params = $args[0]
$eventSource = $args[1]
$scriptRoot = $args[2]
Import-Module -Name (Join-Path -Path $scriptRoot -ChildPath "MSFT_SPUserProfileSyncConnection.psm1")
if ($params.ContainsKey("InstallAccount"))
{
$params.Remove("InstallAccount") | Out-Null
}
$ups = Get-SPServiceApplication | Where-Object -FilterScript {
$_.Name -eq $params.UserProfileService
}
if ($null -eq $ups)
{
$message = "User Profile Service Application $($params.UserProfileService) not found"
Add-SPDscEvent -Message $message `
-EntryType 'Error' `
-EventID 100 `
-Source $eventSource
throw $message
}
$context = Get-SPDscServiceContext -ProxyGroup $ups.ServiceApplicationProxyGroup
Write-Verbose -Message "retrieving UserProfileConfigManager "
$upcm = New-Object -TypeName "Microsoft.Office.Server.UserProfiles.UserProfileConfigManager" `
-ArgumentList @($context)
if ($upcm.IsSynchronizationRunning())
{
$message = "Synchronization is in Progress."
Add-SPDscEvent -Message $message `
-EntryType 'Error' `
-EventID 100 `
-Source $eventSource
throw $message
}
# In SP2016, the forest name is used as name but the dot is replaced by a dash
$installedVersion = Get-SPDscInstalledProductVersion
if ($installedVersion.FileMajorPart -eq 16)
{
$Name = $params.Forest -replace "\.", "-"
}
else
{
$Name = $params.Name
}
$connection = $upcm.ConnectionManager | Where-Object -FilterScript {
$_.DisplayName -eq $Name
} | Select-Object -First 1
if ($params.Ensure -eq "Present")
{
if ($null -ne $connection -and $params.Forest -ieq $connection.Server)
{
$domain = $params.ConnectionCredentials.UserName.Split("\")[0]
$userName = $params.ConnectionCredentials.UserName.Split("\")[1]
$connection.SetCredentials($domain, $userName, $params.ConnectionCredentials.Password)
$connection.NamingContexts | ForEach-Object -Process {
$namingContext = $_
if ($params.ContainsKey("IncludedOUs"))
{
$namingContext.ContainersIncluded.Clear()
$params.IncludedOUs | ForEach-Object -Process {
$namingContext.ContainersIncluded.Add($_)
}
}
$namingContext.ContainersExcluded.Clear()
if ($params.ContainsKey("ExcludedOUs"))
{
$params.ExcludedOUs | ForEach-Object -Process {
$namingContext.ContainersExcluded.Add($_)
}
}
}
$connection.Update()
$connection.RefreshSchema($params.ConnectionCredentials.Password)
return
}
else
{
Write-Verbose -Message "Creating a new connection "
$userDomain = $params.ConnectionCredentials.UserName.Split("\")[0]
$userName = $params.ConnectionCredentials.UserName.Split("\")[1]
$installedVersion = Get-SPDscInstalledProductVersion
switch ($installedVersion.FileMajorPart)
{
15
{
if ($null -ne $connection -and $params.Forest -ine $connection.Server)
{
if ($params.ContainsKey("Force") -and $params.Force -eq $true)
{
Write-Verbose -Message "Force specified, deleting already existing connection"
$connection.Delete()
}
else
{
$message = "connection exists and forest is different. use force"
Add-SPDscEvent -Message $message `
-EntryType 'Error' `
-EventID 100 `
-Source $eventSource
throw $message
}
}
$servers = New-Object -TypeName "System.Collections.Generic.List[[System.String]]"
if ($params.ContainsKey("Server"))
{
$servers.add($params.Server)
}
$listIncludedOUs = New-Object -TypeName "System.Collections.Generic.List[[System.String]]"
$params.IncludedOUs | ForEach-Object -Process {
$listIncludedOUs.Add($_)
}
$listExcludedOUs = New-Object -TypeName "System.Collections.Generic.List[[System.String]]"
if ($params.ContainsKey("ExcludedOus"))
{
$params.ExcludedOus | ForEach-Object -Process {
$listExcludedOUs.Add($_)
}
}
$list = New-Object -TypeName System.Collections.Generic.List[[Microsoft.Office.Server.UserProfiles.DirectoryServiceNamingContext]]
$partition = Get-SPDscADSIObject -LdapPath ("LDAP://" + ("DC=" + $params.Forest.Replace(".", ",DC=")))
$list.Add((New-Object -TypeName "Microsoft.Office.Server.UserProfiles.DirectoryServiceNamingContext" `
-ArgumentList @(
$partition.distinguishedName,
$params.Forest,
$false,
(New-Object -TypeName "System.Guid" `
-ArgumentList $partition.objectGUID),
$listIncludedOUs,
$listExcludedOUs,
$null ,
$false)))
$partition = Get-SPDscADSIObject -LdapPath ("LDAP://CN=Configuration," + ("DC=" + $params.Forest.Replace(".", ",DC=")))
$list.Add((New-Object -TypeName "Microsoft.Office.Server.UserProfiles.DirectoryServiceNamingContext" `
-ArgumentList @(
$partition.distinguishedName,
$params.Forest,
$true,
(New-Object -TypeName "System.Guid" `
-ArgumentList $partition.objectGUID),
$listIncludedOUs ,
$listExcludedOUs ,
$null ,
$false)))
Write-Verbose -Message "Creating the new connection via object model (SP2013)"
$upcm.ConnectionManager.AddActiveDirectoryConnection( [Microsoft.Office.Server.UserProfiles.ConnectionType]::ActiveDirectory, `
$params.Name, `
$params.Forest, `
$params.UseSSL, `
$userDomain, `
$userName, `
$params.ConnectionCredentials.Password, `
$list, `
$null, `
$null) | Out-Null
}
16
{
Write-Verbose -Message "Creating the new connection via cmdlet (SP2016 or SP2019)"
if ($null -ne $connection)
{
$BINDING_FLAGS = ([System.Reflection.BindingFlags]::NonPublic -bOr [System.Reflection.BindingFlags]::Instance)
$adImportNamespace = [Microsoft.Office.Server.UserProfiles.ActiveDirectoryImportConnection]
$METHOD_GET_USEDISABLEDFILTER = $adImportNamespace.GetMethod("get_UseDisabledFilter", $BINDING_FLAGS)
$METHOD_GET_USESSL = $adImportNamespace.GetMethod("get_UseSSL", $BINDING_FLAGS)
$useDisabledFilter = $METHOD_GET_USEDISABLEDFILTER.Invoke($connection, $null)
$useSSL = $METHOD_GET_USESSL.Invoke($connection, $null)
if (($params.ContainsKey("UseSSL") -and $useSSL -ne $params.UseSSL) -or `
($params.ContainsKey("UseDisabledFilter") -and $useDisabledFilter -ne $params.UseDisabledFilter))
{
Write-Verbose -Message "Parameters UseSSL or UseDisabledFilter are not in desired state. Recreating connection!"
$connection.Delete()
}
}
Write-Verbose -Message "Adding IncludedOUs to the connection"
foreach ($ou in $params.IncludedOUs)
{
Add-SPProfileSyncConnection -ProfileServiceApplication $ups `
-ConnectionForestName $params.Forest `
-ConnectionDomain $userDomain `
-ConnectionUserName $userName `
-ConnectionPassword $params.ConnectionCredentials.Password `
-ConnectionUseSSL $params.UseSSL `
-ConnectionSynchronizationOU $ou `
-ConnectionPort $params.Port `
-ConnectionUseDisabledFilter $params.UseDisabledFilter
}
Write-Verbose -Message "Removing ExcludedOUs from the connection"
foreach ($ou in $params.ExcludedOUs)
{
Remove-SPProfilesyncConnection -ProfileServiceApplication $ups `
-ConnectionForestName $params.Forest `
-ConnectionDomain $userDomain `
-ConnectionUserName $userName `
-ConnectionPassword $params.ConnectionCredentials.Password `
-ConnectionSynchronizationOU $ou
}
}
}
}
}
else
{
Write-Verbose -Message "Removing the new connection "
if ($null -ne $connection -and $params.Forest -ine $connection.Server)
{
$connection.Delete()
}
}
}
}
function Test-TargetResource
{
[CmdletBinding()]
[OutputType([System.Boolean])]
param
(
[Parameter(Mandatory = $true)]
[System.String]
$Name,
[Parameter(Mandatory = $true)]
[System.String]
$Forest,
[Parameter(Mandatory = $true)]
[System.Management.Automation.PSCredential]
$ConnectionCredentials,
[Parameter(Mandatory = $true)]
[System.String]
$UserProfileService,
[Parameter(Mandatory = $true)]
[System.String[]]
$IncludedOUs,
[Parameter()]
[System.String[]]
$ExcludedOUs,
[Parameter()]
[System.String]
$Server,
[Parameter()]
[System.UInt32]
$Port = 389,
[Parameter()]
[System.Boolean]
$Force,
[Parameter()]
[System.Boolean]
$UseSSL,
[Parameter()]
[System.Boolean]
$UseDisabledFilter,
[Parameter()]
[ValidateSet("ActiveDirectory", "BusinessDataCatalog")]
[System.String]
$ConnectionType,
[Parameter()]
[ValidateSet("Present", "Absent")]
[System.String]
$Ensure = "Present",
[Parameter()]
[System.Management.Automation.PSCredential]
$InstallAccount
)
Write-Verbose -Message "Testing for user profile service sync connection $Name"
$PSBoundParameters.Ensure = $Ensure
$CurrentValues = Get-TargetResource @PSBoundParameters
Write-Verbose -Message "Current Values: $(Convert-SPDscHashtableToString -Hashtable $CurrentValues)"
Write-Verbose -Message "Target Values: $(Convert-SPDscHashtableToString -Hashtable $PSBoundParameters)"
$installedVersion = Get-SPDscInstalledProductVersion
$valuesToCheck = @("Forest",
"UserProfileService",
"UseSSL",
"UseDisabledFilter",
"IncludedOUs",
"Ensure")
if ($installedVersion.FileMajorPart -eq 15)
{
if ($Force -eq $true)
{
Write-Verbose -Message "Test-TargetResource returned false"
return $false
}
$valuesToCheck += "ExcludedOUs"
$valuesToCheck += "Server"
}
$result = Test-SPDscParameterState -CurrentValues $CurrentValues `
-Source $($MyInvocation.MyCommand.Source) `
-DesiredValues $PSBoundParameters `
-ValuesToCheck $valuesToCheck
Write-Verbose -Message "Test-TargetResource returned $result"
return $result
}
<#
.DESCRIPTION
This method is not intensed for public use, and was created to facilitate unit testing
#>
function Get-SPDscADSIObject
{
param
(
[Parameter()]
[string] $LdapPath
)
return [ADSI]($LdapPath)
}
function Export-TargetResource
{
$VerbosePreference = "SilentlyContinue"
$ParentModuleBase = Get-Module "SharePointDsc" -ListAvailable | Select-Object -ExpandProperty Modulebase
$module = Join-Path -Path $ParentModuleBase -ChildPath "\DSCResources\MSFT_SPUserProfileSyncConnection\MSFT_SPUserProfileSyncConnection.psm1" -Resolve
$Content = ''
$params = Get-DSCFakeParameters -ModulePath $module
$userProfileServiceApps = Get-SPServiceApplication | Where-Object { $_.GetType().Name -eq "UserProfileApplication" }
$caURL = (Get-SpWebApplication -IncludeCentralAdministration |
Where-Object -FilterScript { $_.IsAdministrationWebApplication -eq $true }).Url
$context = Get-SPServiceContext -Site $caURL
try
{
$userProfileConfigManager = New-Object -TypeName "Microsoft.Office.Server.UserProfiles.UserProfileConfigManager" `
-ArgumentList $context
if ($null -ne $userProfileConfigManager.ConnectionManager)
{
$connections = $userProfileConfigManager.ConnectionManager
foreach ($conn in $connections)
{
try
{
$params.Name = $conn.DisplayName
$params.ConnectionCredentials = $Global:spFarmAccount
$params.UserProfileService = $userProfileServiceApps[0].Name
$results = Get-TargetResource @params
if ($null -ne $results)
{
if ($results.ConnectionType -eq "ActiveDirectoryImport")
{
$results.ConnectionType = "ActiveDirectory"
}
$PartialContent = " SPUserProfileSyncConnection " + [System.Guid]::NewGuid().ToString() + "`r`n"
$PartialContent += " {`r`n"
$results = Repair-Credentials -results $results
if ($results.Contains("Ensure"))
{
$results.Remove("Ensure")
}
if (!$results.UseDisabledFilter)
{
$results.Remove("UseDisabledFilter")
}
$results.ConnectionCredentials = "`$Credsinstallaccount"
$currentBlock = Get-DSCBlock -Params $results -ModulePath $module
$currentBlock = Convert-DSCStringParamToVariable -DSCBlock $currentBlock -ParameterName "ConnectionCredentials"
$currentBlock = Convert-DSCStringParamToVariable -DSCBlock $currentBlock -ParameterName "PsDscRunAsCredential"
$PartialContent += $currentBlock
$PartialContent += " }`r`n"
$Content += $PartialContent
}
}
catch
{
$Global:ErrorLog += "[User Profile Sync Connection]" + $conn.DisplayName + "`r`n"
$Global:ErrorLog += "$_`r`n`r`n"
}
}
}
}
catch
{
Write-Verbose $_
}
return $Content
}
Export-ModuleMember -Function *-TargetResource, Get-SPDscADSIObject
| code |
துல்கர் சல்மானின் குரூப் படத்திற்கு தடை விதிக்க மறுத்த நீதிமன்றம் ! துல்கர் சல்மான் நடித்து நேற்று வெளியான குரூப் படத்திற்கு நீதிமன்றம் தடை விதிக்க மறுத்துள்ளது.துல்கர் சல்மான் தயாரித்து, நடித்த படம் குரூப், நேற்று வெளியானது. இந்திரஜித் சுகுமாறன், ஷோபிதா துலிபாலா உள்பட பலர் நடித்துள்ளனர். இயக்குனர் ஸ்ரீநாத் ராஜேந்திரன் இயக்கி உள்ளார். இப்படம் கேரளா போலீஸ் மற்றும் சர்வதே போலீஸ் அமைப்பான இண்டர்போல் ஆகியவற்றால் 1984ம் ஆண்டு முதல் தேடப்படும் குற்றவாளியாக அறிவிக்கப்பட்ட சுகுமார குரூப் என்பவரின் வாழ்க்கை கதையை அடிப்படையாக கொண்டு உருவாக்கப்பட்டுள்ளது.இப்படத்தை தடைவிதிக்க வேண்டும் என்று கொச்சியை சேர்ந்த செபின் தாமஸ் என்பவர் கேரள உயர்நீதி மன்றத்தில் பொதுநல வழக்கு தொடர்ந்தார். வழக்கை விசாரித்த நீதிமன்றம் படத்திற்கு தடைவிதிக்க மறுத்து விட்டது. இது கேரள திரையுலகில பரபரப்பாக பேசப்படுகிறது. | tamil |
ನಕಲಿ ಮಾಲು ಮಾರಾಟ ಮಾಡುವ ಪಟ್ಟಿಯಲ್ಲಿದೆ ಈ ಸ್ಥಳ ಕೇವಲ ನೂರು ರೂಪಾಯಿಗೆ ಪೆನ್ ಡ್ರೈವ್, 500 ರೂಪಾಯಿಗೆ ರೇಬಾನ್ ಸನ್ಗ್ಲಾಸ್, 500 ರೂಪಾಯಿಗೆ ಒರಿಜಿನಲ್ ಲೆದರ್ ವಾಲೆಟ್ ಇದೆಲ್ಲ ಸಿಗೋದು ದೆಹಲಿಯ ಜನಪ್ರಿಯ ಪಾಲಿಕಾ ಬಜಾರ್ ನಲ್ಲಿ. ಕಡಿಮೆ ಬೆಲೆಗೆ ಕದ್ದ ಮಾಲುಗಳನ್ನು ನೀಡುವ ಈ ಪಾಲಿಕಾ ಬಜಾರ್ ಸೇರಿದಂತೆ ಇ ಮಾರುಕಟ್ಟೆ ಸ್ನ್ಯಾಪ್ ಡೀಲ್ ಮುಡಿಗೂ ಕಳಂಕ ತಟ್ಟಿದೆ. ಯುಎಸ್ ಟ್ರೇಡ್ ರೆಪ್ರೆಸೆಂಟೇಟಿವ್, ನಕಲಿ ಕಳವು ಸರಕುಗಳ ಕುಖ್ಯಾತ ಮಾರುಕಟ್ಟೆ ಪಟ್ಟಿ ಬಿಡುಗಡೆ ಮಾಡಿದೆ. ಈ ಪಟ್ಟಿಯಲ್ಲಿ ದೆಹಲಿ ಪಾಲಿಕಾ ಬಜಾರ್, ಮುಂಬೈನ ಹೀರಾ ಪನ್ನಾ, ಕೋಲ್ಕತ್ತಾದ ಕಿಡ್ಡರ್ ಪುರದ ಹೆಸರೂ ಇದೆ. ಮೊದಲು ಈ ಪಟ್ಟಿಯಲ್ಲಿ ಐಜಾಲ್ ಮಾರುಕಟ್ಟೆ ಹೆಸರಿತ್ತು. ಆದ್ರೀಗ ಪಾಲಿಕಾ ಬಜಾರ್ ಮೊದಲ ಸ್ಥಾನ ಪಡೆದಿದೆ. ವಿಶ್ವದಾದ್ಯಂತ 34 ಮಾರುಕಟ್ಟೆ ಹೆಸರು ಇದ್ರಲ್ಲಿದೆ. ಆನ್ಲೈನ್ ಮಾರುಕಟ್ಟೆಗಳೂ ಇದ್ರಲ್ಲಿ ಹಿಂದೆ ಬಿದ್ದಿಲ್ಲ. ನಕಲಿ ಮಾಲು ಮಾರಾಟ ಮಾಡುವ ಆನ್ಲೈನ್ ಮಾರುಕಟ್ಟೆಯಲ್ಲಿ ಸ್ನ್ಯಾಪ್ ಡೀಲ್ ಸೇರಿದಂತೆ 39 ಆನ್ಲೈನ್ ಮಾರುಕಟ್ಟೆಗಳ ಹೆಸರಿದೆ. ಸ್ನ್ಯಾಪ್ ಡೀಲ್ 2018ರಲ್ಲಿಯೇ ನಕಲಿ ವಸ್ತುಗಳನ್ನು ಮಾರಾಟ ಮಾಡ್ತಿದೆ ಎಂಬುದು ಬಹಿರಂಗವಾಗಿತ್ತು. | kannad |
If you’re looking for a luxurious spa experience, then you’re going to love some of the options available from Swim Spas Plus St. Leonard Nb. In particular, one of the best swim spas has to be their 22 foot Galliano swimming pool spa. This incredible item is a full 22 feet long, combined with a width of 7.2ft - making it a true monster in the world swim spas. However, this wonderful creation also comes with an astonishing 41 massage jets, as well as a variety of fantastic LED lighting that makes it a truly delightful experience to have when you’re using the spa in the twilight hours. Of course, this is just one model out of many different options available from this well-respected company – so if you’re looking for something that’s a little on the smaller side, then they can equally serve your needs in this regard as well. So no matter whether you’re looking to purchase something luxurious or economical, you’re going to be thrilled with your new swim spa just as soon as you have it installed into your property.
When you’re trying to find a St. Leonard Nb Swim spa manufacturer that will suit your needs, you don’t have to look much further than Swim Spas Plus. This company specializes in the creation and sale of a wide range of Swim Spas that will give you everything you’ve been looking for and a whole lot more. There’s no denying that there’s a wide range of spa manufacturers available right now, but not all of them are up to the task of producing something that will last you for many years and represents good value for money. However, you can rest assured that whenever you shop with Swim Spas Plus you will be purchasing one of the best spas ever produced. Each of their options uses high-quality pumps and well-designed electrical controls which will simply never let you down. Of course, purchasing from a quality manufacturer will give you great peace of mind, and this is just one of the many reasons why shopping with this company is a smart investment.
With an extensive range of spas on the market, it’s not always easy to find precisely what you’re looking for. With this in mind, it’s certainly a good idea to get in contact with Swim Spas Plus, because they will be more than happy to put together a custom spa that will suit each and every requirement you may have. Ultimately, investing in a custom spa is a wise decision, because this is the only way to truly guarantee you will have everything you want in your very own personal spa. It’s worth noting that this particular company is also well respected for the exceptional quality of spas they produce, so whether you’re looking for a totally unique creation, or simply a few minor tweaks to an already existing design, you can rest assured that purchasing a custom spa from this company will be a fantastic decision for a pool spa St. Leonard Nb. | english |
അമ്മയും മകളും ഷോക്കേറ്റ് മരിച്ചു തിരുവനന്തപുരം : ഷോക്കേറ്റ കൊച്ചുമകളെ രക്ഷിക്കാനെത്തിയ അമ്മയും മകളും മരിച്ചു. തിരുവനന്ത പുരം തിരുവല്ലത്താണ് സംഭവം. ഹെന്ന മോഹന്60, മകള് നീതുമോഹന് 27എന്നിവരാണ് മരിച്ചത്. അമ്മ ഹെന്നയുടെ വീടിന് സമീപത്ത് താമസിക്കുന്ന മകള് നീതു മക്കളുമൊത്ത് അമ്മയെ കാണാന് എത്തിയതായിരുന്നു.വീടിന് സമീപം കളിച്ചുകൊണ്ടിരുന്ന ഇളയകുട്ടി വീട്ടിലെ എര്ത്ത് വയറില് പിടിച്ചതിനെ തുടര്ന്ന് വൈദ്യുതാഘാതമേറ്റു. കുട്ടിയെ രക്ഷിക്കാന് ഓടിയെത്തിയ ഹെന്നക്കും നീതുവിനും ഷോക്കേല്ക്കുകയായിരുന്നു. ശബ്ദം കേട്ട് ഓടിയെത്തിയ നാട്ടുകാര് ഷോക്കേറ്റ് വീണുകിടക്കുകയായിരുന്ന ഇരുവരെയും ആശുപത്രിയിലെത്തിച്ചെങ്കിലും ജീവന് രക്ഷിക്കാനായില്ല. കുട്ടിയും ആശുപത്രിയില് ചികിത്സയിലാണ്. കുട്ടിയുടെ ആരോഗ്യ നില തൃപ്തികരമാണെന്നാണ് ലഭ്യമായ വിവരം. | malyali |
The Travian game is going well. I have another village now, for a total of 2. The other one I named Gergovia, after the city that Vercingetorix took control of in those Gallic wars against Caesar. My total population as of this writing is over 600. I'm quite proud of myself, needless to say! I've managed not to get attacked myself, but this is not to say I haven't lost troops in helping allies battle their own enemies. It was good to lose those troops; I never thought I'd say that, but I learnt a valuable lesson in waging a successful war: always have enough troops.
Otherwise I'm looking at another birthday around the corner. I'll be 35. I'm excited - the older I get, and more specifically the closer I get to 40, the more I like myself. One notable difference between me now and me, oh, 5 years ago is that now I'm allowing myself to do things that before, my perception was I had to "wait" until I reached some arbitrary milestone or acheivement. Take guitar-playing for instance: I've always wanted to learn to play guitar but I've always been distracted by other things I wanted to do first, like piano and drums. I was also always too intimidated by veteran guitar players and figured I'd never be as good as them so why bother?
Whereas now I don't care if people think I'm "good" or not. Now I want to play guitar simply because I want to! I have an 'itch' so to speak, and I must scratch it, hee hee. Critics be damned. There is a chanteuse inside of me that's been locked up for years, and now it's time for her to come out once and for all. (I also think I needed to grow up ALOT before being ready to take on the commitment that learning to play guitar entails.) I've known I've wanted to play guitar ever since I knew what a guitar was.
I know I will be a great guitar player, because the few times I ever played guitar - other people's guitars, that is - I caught on how to play immediately, and I made beautiful music. Also I just love guitar; there's something about that instrument that speaks to my heart. I must play it - it's compulsive, it's not a choice I have, I simply must play guitar.
I've been pushing to get one for my birthday. In particular an Epiphone Les Paul Special II that comes as part of a "value package". It's an electric guitar which I never thought would be my intro to guitar-playing. I've always fancied myself an acoustic guitar player, but after consulting a musician I work with whose taste and judgment I completely trust he convinced me to start on an electric guitar because it's easier on the beginner's fingers than an acoustic is. I no longer care what kind of guitar it is, what name brand it is: as long as I can afford it and as long as it will hold up for a year or longer, then that's the guitar I want. I don't even care what color it is. I just want to play, more than anything I want to play. I've been writing songs for the guitar, songs that my guitar and I will sing together ... now it's time to make it happen. | english |
பிராவோ சாதனையை சமன் செய்த ஹர்சல் பட்டேல். ஒரு சீசனில் அதிக விக்கெட்களை வீழ்த்திய முதல் இந்திய வீரர். ஐபிஎல் 2021 சீசனில் 32 விக்கெட்களை வீழ்த்தி பிராவோவின் சாதனையை ஹர்சல் பட்டேல் சமன் செய்தார். கொரோனா பரவலுக்கு பிறகு தற்காலிகமாக ரத்து செய்யப்பட்ட ஐபிஎல் போட்டிகள் தற்போது மீண்டும் தொடங்கி இறுதி கட்டத்தை நெருங்கி வருகிறது. இந்தநிலையில் நேற்று நடந்த வெளியேறுதல் சுற்றில் பெங்களூர் கொல்கத்தா அணிகள் நேருக்கு நேர் மோதினர். முதலில் டாஸ் வென்ற பெங்களூர் கேப்டன் விராட் கோலி பேட்டிங்கை தேர்வு செய்தார். அதன் அடிப்படையில் களமிறங்கிய பெங்களூர் அணி 20 ஓவர் முடிவில் 7 விக்கெட் இழப்பிற்கு 138 ரன்கள் மட்டுமே எடுத்தது. 139 ரன்கள் எடுத்தால் வெற்றி என்ற இலக்குடன் களமிறங்கிய கொல்கத்தா அணி கடைசி ஓவரில் வெற்றிபெற்று குவாலிபையர் 2 சுற்றுக்குள் தகுதி பெற்றது. இந்தநிலையில், நேற்று கொல்கத்தா அணி பேட்டிங் செய்தபோது, பெங்களூர் அணியின் வேகப்பந்து வீச்சாளர் ஹர்ஷல் பட்டேல் 2 விக்கெட் வீழ்த்தினார். இதன்மூலம் நடப்பு ஐபிஎல் தொடரில் 32 விக்கெட்களை கைப்பற்றி சென்னை வீரர் பிராவோவின் சாதனையை சமன் செய்தார். கடந்த 2013 ஐபிஎல் தொடரில் பிராவோ 32 விக்கெட்களை வீழித்திருந்ததே ஒரு சீசனில் சாதனையாக இருந்தது. அதனை தற்போது ஹர்ஷல் பட்டேல் சமன் செய்துள்ளார். மேலும், ஒரு சீசனில் அதிக விக்கெட்களை வீழ்த்திய முதல் இந்திய வீரர் என்ற சாதனையும் தற்போது ஹர்ஷல் பட்டேல் வசம் உள்ளது என்பது குறிப்பிடத்தக்கது. Read more : 120 என்னால் முடிந்ததை செய்துவிட்டேன். ஆனாலும்.. விராட் கோலி உருக்கம். | tamil |
ಪಂಡಿತ್ ಮೋಡಿ ಕೃಷ್ಣ ಮೂರ್ತಿಯವರಿಂದ ಇಂದಿನ ರಾಶಿ ಭವಿಷ್ಯ ಶುದ್ಧ ಕೊಳ್ಳೇಗಾಲದ ವಂಶಪಾರಂಪರಿಕ ಜ್ಯೋತಿಷ್ಯರು ಶ್ರೀ ಚೌಡೇಶ್ವರಿ ದೇವಿ,ರಕ್ತೇಶ್ವರಿ, ಸ್ಮಶಾನಕಾಳಿ ಆರಾಧಕರು 律 ಪ್ರಧಾನ ಗುರುಗಳು ಪಂಡಿತ್: ಶ್ರೀ ಮೋಡಿ ಕೃಷ್ಣ ಮೂರ್ತಿ, ರಾಜ್ಯ ಹಾಗೂ ಹೊರರಾಜ್ಯದ ಜನರ ಸಮಸ್ಯೆಗಳಿಗೆ ಪರಿಹಾರ ನೀಡಿರುವ ಏಕೈಕ ಮಾಂತ್ರಿಕರು ಸಮಸ್ಯೆ ನಿಮ್ಮದು ಪರಿಹಾರ ನಮ್ಮದು ನಿಮ್ಮ ಜೀವನದ ಸಮಸ್ಯೆಗಳಾದ ವಿದ್ಯೆ,ಉದ್ಯೋಗ, ವಿವಾಹ ವಿಳಂಬ , ಮಾಟ ಮಂತ್ರ, ಶತ್ರುನಾಶ, ಸ್ತ್ರೀವಶೀಕರಣ, ಪುರುಷವಶೀಕರಣ,ಅತ್ತೆಸೊಸೆ ಕಿರಿಕಿರಿ, ಸಂತಾನ ಭಾಗ್ಯ, ವ್ಯಾಪಾರ ಅಭಿವೃದ್ಧಿ, ಹಣಕಾಸು, ಪ್ರೇಮ ವಿಚಾರ, ದಾಂಪತ್ಯ ತೊಂದರೆ, ಕೋರ್ಟ್ ಕೇಸ್, ಶತೃಕಾಟ, ಸಾಲ ಬಾಧೆ, ಅನಾರೋಗ್ಯ, ಮನೆಯಲ್ಲಿ ಅಶಾಂತಿ, ದುಷ್ಟ ಶಕ್ತಿ ಬಾದೆ ಇನ್ನೂ ಅನೇಕ ನಿಮ್ಮ ಜೀವನದ ಗುಪ್ತ ಸಮಸ್ಯೆಗಳಿಗೆ ಪರಿಹಾರಕ್ಕಾಗಿ ಇಂದೇ ಕರೆ ಮಾಡಿ 91 9019491940 ವಿಶೇಷ ಸೂಚನೆ : 5 ರಿಂದ 11 ವರ್ಷದ ಮಕ್ಕಳಿಗೆ ಉಚಿತ ಬಾಲಗ್ರಹ ಯಂತ್ರ ಕಟ್ಟಲಾಗುವುದು ಓಮ್ಮೆ ಕೊಳ್ಳೇಗಾಲಕ್ಕೆ ನೇರ ಭೇಟಿ ನೀಡಿ ಅಥವಾ ಫೋನ್ ಮೂಲಕ ಶಾಶ್ವತ ಪರಿಹಾರ ಪಡೆದುಕೊಳ್ಳಿ. ಕಛೇರಿ : ಕೊಳ್ಳೇಗಾಲ, ಮೈಸೂರು, ಮಂಗಳೂರು, ಬೆಂಗಳೂರು, ಹಾಸನ, ಮಂಡ್ಯ ಮತ್ತು ಬೆಳಗಾವಿ. ಕೊಳ್ಳೇಗಾಲದ ಶ್ರೀ ಚೌಡೇಶ್ವರಿ ದೇವಿ ಕೃಪೆಯಿಂದ ಈ ರಾಶಿಗಳಿಗೆ ಇಂದಿನ ನಿಮ್ಮ ರಾಶಿ ಭವಿಷ್ಯ ನೋಡಿ ಮೇಷ ರಾಶಿ : ಧ್ಯಾನ ಮತ್ತು ಯೋಗ ಆಧ್ಯಾತ್ಮಿಕ ಹಾಗೂ ಭೌತಿಕ ಲಾಭಗಳೆರಡಕ್ಕೂ ಪ್ರಯೋಜನಕಾರಿಯಾಗುತ್ತದೆ. ಮನೆಯ ಅಗತ್ಯಗಳನ್ನು ನೋಡುತ್ತಾ, ಇಂದು ನೀವು ನಿಮ್ಮ ಜೀವನ ಸಂಗಾತಿಯೊಂದಿಗೆ ಯಾವುದೇ ಅಮೂಲ್ಯ ವಸ್ತುವನ್ನು ಖರೀದಿಸಬಹುದು, ಇದರಿಂದ ಆರ್ಥಿಕ ಪರಿಸ್ಥಿತಿ ಸ್ವಲ್ಪ ತೊಂದರೆಗೊಳಗಾಗಬಹುದು. ಪಾಲಕರು ಮತ್ತು ಸ್ನೇಹಿತರು ನಿಮ್ಮನ್ನು ಸಂತೋಷವಾಗಿರಿಸಲು ಅವರಿಗೆ ಸಾಧ್ಯವಾದದ್ದನ್ನೆಲ್ಲ ಮಾಡುತ್ತಾರೆ. ನಿಮ್ಮನ್ನು ಯಾರಾದರೂ ಆಕರ್ಷಿಸಲು ಪ್ರಯತ್ನಿಸಬಹುದಾದ್ದರಿಂದ ಎಚ್ಚರಿಕೆಯಿಂದಿರಿ. ನಿಮ್ಮ ಕೆಲಸದ ಮೇಲೆ ಗಮನ ಹರಿಸಿ ಮತ್ತು ಭಾವನಾತ್ಮಕ ವ್ಯಾಜ್ಯಗಳಿಂದ ದೂರವಿರಿ. ಕೃತಕತೆ ನಿಮಗೆ ಯಾವ ಲಾಭವನ್ನೂ ತರದಿರುವುದರಿಂದ ನಿಮ್ಮ ಸಂಭಾಷಣೆಯಲ್ಲಿ ನೈಜತೆಯಿರಲಿ. ನಿಮ್ಮ ಸಂಗಾತಿ ಇಂದು ಕೆಲವು ಕಷ್ಟಕರ ಸಂದರ್ಭಗಳಲ್ಲಿ ನಿಮಗೆ ಬಂಬಲ ನೀಡಲು ಹೆಚ್ಚು ಆಸಕ್ತಿ ತೋರಿಸದಿರಬಹುದು. ಕರೆ ಮಾಡಿ 91 9019491940 ಅದೃಷ್ಟ ಸಂಖ್ಯೆ: 2 ವೃಷಭ ರಾಶಿ : ನಿಮ್ಮ ಆಕರ್ಷಕ ವರ್ತನೆ ಗಮನ ಸೆಳೆಯುತ್ತದೆ. ಸಣ್ಣ ಉದ್ಯೋಗವನ್ನು ಮಾಡುವ ಜನರು, ಇಂದು ತಮ್ಮ ಆಪ್ತರಿಂದ ಯಾವುದೇ ಸಲಹೆಯನ್ನು ಪಡೆಯಬಹುದು. ಇದರಿಂದ ಅವರಿಗೆ ಆರ್ಥಿಕವಾಗಿ ಲಾಭ ಪಡೆಯುವ ಸಾಧ್ಯತೆ ಇದೆ. ನೀವು ಬಯಸುವ ಲ್ಲಾ ಗಮನವನ್ನೂ ನೀವು ಪಡೆಯುವ ಒಳ್ಳೆಯ ದಿನ ನಿಮ್ಮ ಮನಸ್ಸಿನಲ್ಲಿ ಅನೇಕ ವಿಷಯಗಳಿರುತ್ತವೆ ಹಾಗೂ ನೀವು ಯಾವುದನ್ನು ಅನುಸರಿಸಬೇಕೆನ್ನುವ ಸಮಸ್ಯೆ ಹೊಂದಿರುತ್ತೀರಿ. ನಿಮ್ಮ ಪ್ರೀತಿಪಾತ್ರರ. ನಿಮ್ಮ ಕೆಲಸದ ಮೇಲೆ ಗಮನ ಹರಿಸಿದಲ್ಲಿ ಯಶಸ್ಸು ಮತ್ತು ಮನ್ನಣೆ ನಿಮ್ಮದಾಗುತ್ತದೆ. ಇಂದು ನೀವು ಮನೆಯ ಕಿರಿಯ ಸದಸ್ಯರೊಂದಿಗೆ ಗಾಸಿಪ್ ಮಾಡುವ ಮೂಲಕ ನಿಮ್ಮ ಉಚಿತ ಸಮಯವನ್ನು ಚೆನ್ನಾಗಿ ಬಳಸಿಕೊಳ್ಳಬಹುದು. ನೀವು ನಿಮ್ಮ ಸಂಗಾತಿಯ ಶಿಥಿಲಗೊಳ್ಳುತ್ತಿರುವ ಆರೋಗ್ಯದಿಂದಾಗಿ ಇಂದು ಒತ್ತಡಕ್ಕೊಳಗಾಗುತ್ತೀರಿ. ಕರೆ ಮಾಡಿ 91 9019491940 ಅದೃಷ್ಟ ಸಂಖ್ಯೆ: 1 ಮಿಥುನ ರಾಶಿ : ಅತ್ಯಂತ ಪ್ರಭಾವಿ ಜನರ ಬೆಂಬಲ ನಿಮ್ಮ ನೈತಿಕ ಸ್ಥೈರ್ಯವನ್ನು ಹೆಚ್ಚಿಸುತ್ತದೆ. ಎಲ್ಲಾ ಬದ್ಧತೆಗಳು ಮತ್ತು ಆರ್ಥಿಕ ವ್ಯವಹಾರಗಳನ್ನು ಎಚ್ಚರಿಕೆಯಿಂದ ನಿರ್ವಹಿಸಬೇಕು. ಸಂಗಾತಿಯು ಸಂತೋಷ ನೀಡಲು ಪ್ರಯತ್ನ ಮಾಡಿದಾಗಿನ ಪೂರ್ಣ ಸಂತೋಷದ ಒಂದು ದಿನ. ನಿಮ್ಮ ಸಂಪೂರ್ಣ ಹಾಗೂ ಪ್ರಶ್ನಾತೀತ ಪ್ರೀತಿ ಒಂದು ಜಾದುವಿನಂಥ ಸೃಜನಶೀಲ ಶಕ್ತಿಯನ್ನು ಹೊಂದಿದೆ. ನೀವು ನಿಮ್ಮ ಕೌಶಲ್ಯ ಮತ್ತು ಪ್ರತಿಭೆಗಳನ್ನು ಸರಿಯಾದ ಜನರಿಗೆ ತೋರಿಸಿದಲ್ಲಿ ನೀವು ಶೀಘ್ರದಲ್ಲೇ ಹೊಸ ಮತ್ತು ಒಳ್ಳೆಯ ಸಾರ್ವಜನಿಕ ವ್ಯಕ್ತಿತ್ವವನ್ನು ಹೊಂದಲು ಸಾಧ್ಯವಿದೆ. ವಿದ್ಯಾರ್ಥಿಗಳಲ್ಲಿ ಇಂದು ಪ್ರೀತಿಯ ಜ್ವರವಾಗಬಹುದು ಮತ್ತು ಈ ಕಾರಣದಿಂದಾಗಿ ಅವರ ಸಾಕಷ್ಟು ಸಮಯ ಹಾಳಾಗಬಹುದು. ಇಂದು, ನೀವು ನಿಮ್ಮ ಸಂಗಾತಿಯ ಜೊತೆಗೆ ನಿಮ್ಮ ಜೀವನದ ಅತ್ಯುತ್ತಮ ಸಮಯವನ್ನು ಕಳೆಯುತ್ತೀರಿ. ಕರೆ ಮಾಡಿ 91 9019491940 ಅದೃಷ್ಟ ಸಂಖ್ಯೆ: 8 ಕರ್ಕಾಟಕ ರಾಶಿ : ಸಂತಸದ ಪ್ರಯಾಣ ಮತ್ತು ಸಾಮಾಜಿಕ ಕಾರ್ಯಕ್ರಮಗಳು ನಿಮಗೆ ಆರಾಮ ಮತ್ತು ಸಂತೋಷ ತರುತ್ತದೆ. ಇಂವು ನಿಮಗೆ ನಿಮ್ಮ ಸಹೋದರ ಅಥವಾ ಸಹೋದರಿಯ ಸಹಾಯದಿಂದ ಹಣದ ಲಾಭವಾಗುವ ಸಾಧ್ಯತೆ ಇದೆ ಕುಟುಂಬದ ಸದಸ್ಯರೊಂದಿಗೆ ಒಂದು ಶಾಂತಿಯುತ ಮತ್ತು ಶಾಂತ ದಿನವನ್ನು ಆನಂದಿಸಿ ಜನರು ಸಮಸ್ಯೆಗಳೊಡನೆ ನಿಮ್ಮನ್ನು ಸಮೀಪಿಸಿದರೆ ಅವರನ್ನು ನಿರ್ಲಕ್ಷಿಸಿ ಮತ್ತು ನಿಮ್ಮ ಮನಸ್ಸಿನಲ್ಲಿ ಈ ಚಿಂತೆ ಬೇರೂರಲು ಅವಕಾಶ ನೀಡಬೇಡಿ. ಮೊಂಬತ್ತಿ ಬೆಳಕಿನಲ್ಲಿ ಪ್ರೀತಿಪಾತ್ರರ ಜೊತೆ ಆಹಾರ ಹಂಚಿಕೊಳ್ಳುವುದು. ನಿಮ್ಮ ಮೇಲಿನವರಿಗೆ ಇಂದು ನಿಮ್ಮ ಕೆಲಸದ ಗುಣಮಟ್ಟ ಒಳ್ಳೆಯ ಪ್ರಭಾವ ಬೀರಬಹುದು. ಇಂದು ನೀವು ನಿಮ್ಮ ಪ್ರೀತಿಪಾತ್ರರೊಂದಿಗೆ ಸಮಯವನ್ನು ಕಳೆಯುವಿರಿ ಮತ್ತು ಅವರ ಮುಂದೆ ನಿಮ್ಮ ಭಾವನೆಗಳನ್ನು ಇಡಲು ಸಾಧ್ಯವಾಗುತ್ತದೆ. ನಿಮಗೆ ಗೊತ್ತೇ? ನಿಮ್ಮ ಸಂಗಾತಿ ನಿಜವಾಗಿಯೂ ಒಬ್ಬ ದೇವತೆ. ನಂಬಿಕೆಯಿಲ್ಲವೇ? ಇಂದು ನೋಡಿ ಹಾಗೂ ಅನುಭವಿಸಿ. ಕರೆ ಮಾಡಿ 91 9019491940 ಅದೃಷ್ಟ ಸಂಖ್ಯೆ: 3 ಸಿಂಹ ರಾಶಿ : ನಿಮ್ಮ ಬಗ್ಗೆ ನಿಮಗೇ ಉತ್ತಮ ಅಭಿಪ್ರಾಯ ಬರಲು ಕೆಲಸಗಳನ್ನು ಮಾಡಲು ಒಂದು ಅದ್ಭುತ ದಿನ. ನೀವು ನಿಮ್ಮ ಇಂದಿನ ದಿನವನ್ನು ಉತ್ತಮಗೊಳಿಸಲು ಕಳೆದ ದಿನಗಳಲ್ಲಿ ಹಣವನ್ನು ಹೂಡಿಕೆ ಮಾಡಿದ್ದರೆ, ಅದರ ಪ್ರಯೋಜನವನ್ನು ಇಂದು ನೀವು ಪಡೆಯಬಹುದು. ತಂದೆಯ ಕಠಿಣ ನಡವಳಿಕೆ ನಿಮಗೆ ಸಿಟ್ಟು ಬರಿಸಬಹುದು. ನೀವು ವಿಷಯವನ್ನು ನಿಯಂತ್ರಣದಲ್ಲಿಡಲು ಶಾಂತರಾಗಿರುವ ಅಗತ್ಯವಿದೆ. ನೀವು ಈ ಮೂಲಕ ಲಾಭ ಪಡೆಯುತ್ತೀರಿ. ಅನಿರೀಕ್ಷಿತ ಪ್ರಣಯ ಪ್ರಸಂಗಗಳು ಇಂದು ಎದುರಾಗಬಹುದು. ಕೆಲಸದ ಪ್ರದೇಶದಲ್ಲಿ ಉತ್ತಮವಾಗಿ ಅನುಭವಿಸುವ ದಿನಗಳಲ್ಲಿ ಒಂದು ದಿನ ಇದು. ಇಂದು ನಿಮ್ಮ ಸಹೋದ್ಯೋಗಿಗಳು ನಿಮ್ಮ ಕೆಲಸವನ್ನು ಪ್ರಶಂಸಿಸುತ್ತಾರೆ ಮತ್ತು ನಿಮ್ಮ ಬಾಸ್ ಸಹ ನಿಮ್ಮ ಕೆಲಸದಿಂದ ಸಂತೋಷಪಡುತ್ತಾರೆ. ಉದ್ಯಮಿಗಳು ಸಹ ತಮ್ಮ ವ್ಯಾಪಾರದಲ್ಲಿ ಪ್ರಯೋಜನವನ್ನು ಪಡೆಯಬಹುದು. ದಿನ ಉತ್ತಮವಾಗಿದೆ, ಇತರರೊಂದಿಗೆ ನೀವು ನಿಮಗಾಗಿ ಸಹ ಸಮಯವನ್ನು ತೆಗೆದುಕೊಳ್ಳುವಿರಿ ನಿಮ್ಮ ಹಳೆಯ ಸ್ನೇಹಿತರೊಬ್ಬರು ನಿಮ್ಮ ಸಂಗಾತಿಯ ಜೊತೆಗಿನ ನಿಮ್ಮ ಹಳೆಯ ಸುಂದರ ನೆನಪುಗಳನ್ನು ನೆನಪಿಸಬಹುದು. ಕರೆ ಮಾಡಿ 91 9019491940 ಅದೃಷ್ಟ ಸಂಖ್ಯೆ: 1 ಕನ್ಯಾ ರಾಶಿ : ನೀವು ಇಂದು ಆರಾಮವಾಗಿ ವಿಶ್ರಾಂತಿ ಪಡೆಯಬೇಕು ನೀವು ಆನಂದಿಸುವ ಮತ್ತು ಆಸಕ್ತಿಗಳು ಮತ್ತು ವಿಷಯಗಳಲ್ಲಿ ತೊಡಗಿಕೊಳ್ಳಿ. ವಿದೇಶದಲ್ಲಿ ಮಲಗಿರುವ ನಿಮ್ಮ ಭೂಮಿಯನ್ನು ಇಂದು ಉತ್ತಮ ಬೆಲೆಗೆ ಮಾರಾಟ ಮಾಡಬಹುದು, ಅದು ನಿಮಗೆ ಲಾಭದಾಯಕವಾಗಲಿದೆ. ನೀವು ಕೆಲಸದ ಜಾಗದಲ್ಲಿ ಅತಿಯಾಗಿ ಶ್ರಮಪಡುವುದರಿಂದ ಕೌಟುಂಬಿಕ ಅಗತ್ಯಗಳು ಮತ್ತು ಅವಶ್ಯಕತೆಗಳು ನಿರ್ಲಕ್ಷಿಸಲ್ಪಡುತ್ತವೆ ನಿಮ್ಮ ಶಕ್ತಿಯ ಮಟ್ಟ ಹೆಚ್ಚಿರುತ್ತದೆ ನಿಮ್ಮ ಪ್ರೀತಿಪಾತ್ರರು ನಿಮಗೆ ಅಪಾರ ಸಂತೋಷ ತರುತ್ತಾರೆ. ನೀವು ಏನೂ ಮಾಡಿದರೂ ಪರಿಪೂರ್ಣವಾಗಿ ಮಾಡುತ್ತೀರಿ ನಿಮ್ಮ ಸುತ್ತಲಿನವರಿಗೆ ನೀವೆಷ್ಟು ಪರಿಣಾಮಕಾರಿಯೆಂದು ತೋರಿಸುವ ಮೂಲಕ ನಿಮ್ಮ ಮೌಲ್ಯವನ್ನು ಸಾಬೀತು ಮಾಡಿ. ಜೀವನದ ಜಟಿಲತೆಗಳನ್ನು ಅರ್ಥಮಾಡಿಕೊಳ್ಳಲು ಇಂದು ಮನೆಯ ಯಾವುದೇ ಹಿರಿಯ ವ್ಯಕ್ತಿಯೊಂದಿಗೆ ನೀವು ಸಮಯವನ್ನು ಕಳೆಯಬಹುದು. ನಿಮ್ಮ ಸಂಗಾತಿಯು ಇಂದು ಕೆಲವು ಕುಖ್ಯಾತ ವಿಷಯಗಳ ಜೊತೆಗೆ ನಿಮ್ಮ ಹದಿಹರೆಯದ ದಿನಗಳನ್ನು ನೆನಪಿಸುತ್ತಾರೆ. ಕರೆ ಮಾಡಿ 91 9019491940 ಅದೃಷ್ಟ ಸಂಖ್ಯೆ: 8 ತುಲಾ ರಾಶಿ : ನೀವು ಚೈತನ್ಯದಿಂದ ತುಂಬಿರುತ್ತೀರಿ ಮತ್ತು ಇಂದು ಅಸಾಮಾನ್ಯವಾದದ್ದೇನಾದರೂ ಸಾಧಿಸುತ್ತೀರಿ. ನಿಮ್ಮ ಆರ್ಥಿಕ ಸ್ಥಿತಿ ಸುಧಾರಿಸಿದರೂ ಹಣದ ಹೊರಹರಿವು ನಿಮ್ಮ ಯೋಜನೆಗಳನ್ನು ಕಾರ್ಯರೂಪಕ್ಕೆ ತರುವಲ್ಲಿ ತೊಂದರೆಯುಂಟುಮಾಡುತ್ತದೆ. ಸ್ನೇಹಿತರು ಹಾಗೂ ಕುಟುಂಬದ ಸದಸ್ಯರೊಡನೆ ಒಂದು ಸಂಜೆಯನ್ನು ಆಯೋಜಿಸಿ. ಯಾರೂ ನಿಮ್ಮ ಪ್ರೀತಿಯನ್ನು ಬೇರ್ಪಡಿಸಲಾಗದು. ಕೆಲಸಕ್ಕೆ ಸಂಬಂಧಿಸಿದಂತೆ ಈ ದಿನ ಒಳ್ಳೆಯದಿರುವಂತೆ ಕಾಣುತ್ತದೆ. ಈ ರಾಶಿಚಕ್ರದ ಜನರು ಬಹಳ ಆಸಕ್ತಿದಾಯಕರು. ಇವರು ಕೆಲವೊಮ್ಮೆ ಎಲ್ಲಾ ಜನರ ನಡುವೆ ಸಂತೋಷವಾಗಿರುತ್ತಾರೆ, ಕೆಲವೊಮ್ಮೆ ಒಂಟಿಯಾಗಿ. ಆದಾಗ್ಯೂ ಒಂಟಿಯಾಗಿ ಸಾಮ್ಯವನ್ನು ಕಳೆಯುವುದು ಅಷ್ಟು ಸುಲಭವಲ್ಲ, ಆದರೂ ಇಂದು ನೀವು ಖಂಡಿತವಾಗಿಯೂ ನಿಮಗಾಗಿ ಸ್ವಲ್ಪ ಸಮಯವನ್ನು ಪಡೆಯಲು ಸಾಧ್ಯವಾಗುತ್ತದೆ. ನಿಮ್ಮ ಸಂಗಾತಿಯಿಂದ ನೀವು ಇಂದು ವಿಶೇಷ ಗಮನ ಪಡೆಯುತ್ತೀರಿ. ಕರೆ ಮಾಡಿ 91 9019491940 ಅದೃಷ್ಟ ಸಂಖ್ಯೆ: 2 ವೃಶ್ಚಿಕ ರಾಶಿ : ಕೆಲಸದಲ್ಲಿ ಹಿರಿಯರಿಂದ ಒತ್ತಡ ಮತ್ತು ಮನೆಯಲ್ಲಿ ಅಪಶ್ರುತಿ ನಿಮ್ಮ ಏಕಾಗ್ರತೆಗೆ ತೊಂದರೆ ತರಬಹುದು. ಹೆಚ್ಚುವರಿ ಹಣವನ್ನು ರಿಯಲ್ ಎಸ್ಟೇಟ್ನಲ್ಲಿ ಹೂಡಿಕೆ ಮಾಡಬೇಕು. ಕುಟುಂಬ ಮತ್ತು ಸ್ನೇಹಿತರೊಂದಿಗೆ ಆಹ್ಲಾದಕರ ಸಮಯ ಡೇಟ್ ಕಾರ್ಯಕ್ರಮ ವಿಫಲವಾಗಬಹುದಾದ್ದರಿಂದ ನಿರಾಶೆಯಾಗಬಹುದು. ನಿಮ್ಮ ಕೆಲಸಗಳಿಗೆ ಬೇರೆಯವರು ಗೌರವ ಪಡೆಯಲು ಬಿಡಬೇಡಿ. ವಿದ್ಯಾರ್ಥಿಗಳಲ್ಲಿ ಇಂದು ಪ್ರೀತಿಯ ಜ್ವರವಾಗಬಹುದು ಮತ್ತು ಈ ಕಾರಣದಿಂದಾಗಿ ಅವರ ಸಾಕಷ್ಟು ಸಮಯ ಹಾಳಾಗಬಹುದು. ನಿಮ್ಮ ಸಂಗಾತಿಯ ಕಳಪೆ ಆರೋಗ್ಯ ನಿಮ್ಮ ಕೆಲಸಕ್ಕೆ ಅಡ್ಡಿಯಾಗಬಹುದು, ಆದರೆ ನೀವು ಹೇಗಾದರೂ ಮಾಡಿ ಎಲ್ಲವನ್ನೂ ನಿರ್ವಹಿಸುತ್ತೀರಿ. ಕರೆ ಮಾಡಿ 91 9019491940 ಅದೃಷ್ಟ ಸಂಖ್ಯೆ: 4 ಧನಸ್ಸು ರಾಶಿ : ಯಾವುದಾದರೂ ಸೃಜನಾತ್ಮಕ ಕೆಲಸದಲ್ಲಿ ನಿಮ್ಮನ್ನು ತೊಡಗಿಸಿಕೊಳ್ಳಿ. ಸೋಮಾರಿಯಾಗಿ ಕುಳಿತುಕೊಳ್ಳುವ ನಿಮ್ಮ ಅಭ್ಯಾಸ ಮಾನಸಿಕ ಶಾಂತಿಗೆ ಮಾರಣಾಂತಿಕವಾಗಬಹುದು. ತಮ್ಮ ಹಣವನ್ನು ಇನ್ನೊಬ್ಬರಿಗೆ ನೀಡಲು ಇಷ್ಟಪಡುವುದಿಲ್ಲ ಆದರೆ ಇಂದು ನೀವು ಅಗತ್ಯವಿರುವವರಿಗೆ ಹಣವನ್ನು ಕೊಟ್ಟು ವಿಶ್ರಾಂತಿಯನ್ನು ಅನುಭವಿಸುವಿರಿ. ಗೃಹಪ್ರವೇಶಕ್ಕೆ ಮಂಗಳಕರ ದಿನ. ಇದುವರೆಗೂ ಒಂಟಿಯಾಗಿ ಇರುವವರು ಇಂದು ಯಾರೋ ವಿಶೇಷ ಭೇಟಿಯಾಗುವ ಸಾಧ್ಯತೆ ಇದೆ ಆದರೆ ವಿಷಯವನ್ನು ಮುಂದುವರಿಸುವ ಮೊದಲು, ಆ ವ್ಯಕ್ತಿ ಯಾರೊಂದಿಗಾದರೂ ಸಂಬಂಧದಲ್ಲಿ ಇದ್ದರೋ ಇಲ್ಲವೋ ಎಂಬುದನ್ನು ತಿಳಿದುಕೊಳ್ಳಿ. ಕೆಲಸದಲ್ಲಿ ಎಲ್ಲವೂ ಚೆನ್ನಾಗಿರುವಂತೆ ತೋರುತ್ತದೆ. ನಿಮ್ಮ ಮನಸ್ಥಿತಿ ದಿನವಿಡೀ ಚೆನ್ನಾಗಿರುತ್ತದೆ. ಈ ರಾಶಿಚಕ್ರದ ಜನರು ಇಂದು ನಿಮ್ಮ ಬಿಡುವಿನ ವೇಳೆಯಲ್ಲಿ ಆಧ್ಯಾತ್ಮಿಕ ಪುಸ್ತಕಗಳ ಅಧ್ಯಯನ ಮಾಡಬೇಕು. ಇದನ್ನು ಮಾಡಿ ನೀವು ನಿಮ್ಮ ಅನೇಕ ಸಮಸ್ಯೆಗಳನ್ನು ಪರಿಹರಿಸಬಹುದು. ನಿಮ್ಮ ಪ್ರಚೋದಕ ವೈವಾಹಿಕ ಜೀವನದಲ್ಲಿ ಇಂದು ಒಂದು ಸುಂದರ ಬದಲಾವಣೆಯನ್ನು ನೀವು ಅನುಭವಿಸುತ್ತೀರಿ. ಕರೆ ಮಾಡಿ 91 9019491940 ಅದೃಷ್ಟ ಸಂಖ್ಯೆ: 1 ಮಕರ ರಾಶಿ : ಮಾನಸಿಕ ಶಾಂತಿಗಾಗಿ ಕೆಲವು ದಾನ ಧರ್ಮಗಳಲ್ಲಿ ನಿಮ್ಮನ್ನು ತೊಡಗಿಸಿಕೊಳ್ಳಿ. ಇಂದು ನಿಮಗೆ ದೊರಕುವ ಹೊಸ ಹೂಡಿಕೆಯ ಅವಕಾಶಗಳನ್ನು ಅನ್ವೇಷಿಸಿಆದರೆ ಈ ಯೋಜನೆಗಳ ಕಾರ್ಯಸಾಧ್ಯತೆಯನ್ನು ಅಧ್ಯಯನ ಮಾಡಿದ ನಂತರವೇ ನೀವು ಇದರಲ್ಲಿ ತೊಡಗಿಸಿಕೊಳ್ಳಬೇಕು. ನೀವು ಇಂದು ಹಾಜರಾಗುವ ಒಂದು ಸಾಮಾಜಿಕ ಸಮಾರಂಭದಲ್ಲಿ ನೀವೇ ಕೇಂದ್ರಬಿಂದುವಾಗಿರುತ್ತೀರಿ. ನಿಮ್ಮ ನಗು ಯಾವುದೇ ಅರ್ಥ ಹೊಂದಿಲ್ಲ ನಗುವಿಗೆ ಧ್ವನಿಯಿಲ್ಲ ನಿಮ್ಮ ಸಂಗವಿಲ್ಲದಿದ್ದಾಗ ಹೃದಯ ಬಡಿಯುವುದನ್ನು ಮರೆಯುತ್ತದೆ. ನೀವು ನಿಮ್ಮ ಕೌಶಲ್ಯ ಮತ್ತು ಪ್ರತಿಭೆಗಳನ್ನು ಸರಿಯಾದ ಜನರಿಗೆ ತೋರಿಸಿದಲ್ಲಿ ನೀವು ಶೀಘ್ರದಲ್ಲೇ ಹೊಸ ಮತ್ತು ಒಳ್ಳೆಯ ಸಾರ್ವಜನಿಕ ವ್ಯಕ್ತಿತ್ವವನ್ನು ಹೊಂದಲು ಸಾಧ್ಯವಿದೆ. ವ್ಯಾಪಾರದ ಉದ್ದೇಶದಿಂದ ಕೈಗೊಂಡ ಪ್ರಯಾಣ ದೀರ್ಘಾವಧಿಯಲ್ಲಿ ಪ್ರಯೋಜನಕಾರಿ ಎಂದು ಸಾಬೀತಾಗುತ್ತದೆ. ತಪ್ಪು ಸಂವಹನ ಇಂದು ತೊಂದರೆಯುಂಟುಮಾಡಬಹುದು, ಆದರೆ ನೀವು ಕುಳಿತು ಮಾತನಾಡುವುದರಿಂದ ಇದನ್ನು ನಿರ್ವಹಿಸಬಹುದು. ಕರೆ ಮಾಡಿ 91 9019491940 ಅದೃಷ್ಟ ಸಂಖ್ಯೆ: 9 ಕುಂಭ ರಾಶಿ : ಅದೃಷ್ಟವನ್ನು ಅವಲಂಬಿಸಬೇಡಿ, ನಿಮ್ಮ ಆರೋಗ್ಯ ಸುಧಾರಿಸಲು ಪ್ರಯತ್ನಿಸಿ ಏಕೆಂದರೆ ಅದೃಷ್ಟವು ಒಂದು ಸೋಮಾರಿ ದೇವತೆಯಾಗಿದೆ. ಹಣದ ಚಲನೆ ದಿನವಿಡೀ ಮುಂದುವರಿಯುತ್ತದೆ ಮತ್ತು ದಿನದ ಅಂತ್ಯದ ನಂತರ ನೀವು ಉಳಿಸಲು ಸಾಧ್ಯವಾಗುತ್ತದೆ. ಇತರರಿಗೆ ಪ್ರತಿಫಲಗಳು ತರುವ ನಿಮ್ಮ ಸಾಮರ್ಥ್ಯ ಪ್ರತಿಫಲ ತರುತ್ತದೆ. ನಿಮ್ಮ ಪ್ರಿಯತಮೆಯ ಕಠಿಣ ಪದಗಳಿಂದ ನಿಮ್ಮ ಮನಸ್ಥಿತಿ ಹಾಳಾಗಬಹುದು. ನಿಮ್ಮ ಪ್ರೇಮ ಸಂಗಾತಿ ನಿಜಕ್ಕೂ ಇಂದು ಅದ್ಭುತವಾದದ್ದನ್ನು ಏನೋ ತರುತ್ತಾರೆ. ಈ ರಾಶಿಚಕ್ರದ ಜನರು ಇಂದು ತಮ್ಮ ಸಹೋದರಸಹೋದರಿಯರೊಂದಿಗೆ ಮನೆಯಲ್ಲಿ ಯಾವುದೇ ಚಲನ ಚಿತ್ರ ಅಥವಾ ಮ್ಯಾಚ್ ನೋಡಬಹುದು. ಇದನ್ನು ಮಾಡುವುದರಿಂದ ನಿಮ್ಮ ನಡುವಿನ ಪ್ರೀತಿಯಲ್ಲಿ ಹೆಚ್ಚಳವಾಗುತ್ತದೆ. ನಿಮ್ಮ ಸಂಗಾತಿ ನಿಮ್ಮ ಒಂದು ಯೋಜನೆಯನ್ನು ಹಾಳುಮಾಡಬಹುದು ತಾಳ್ಮೆ ಕಳೆದುಕೊಳ್ಳಬೇಡಿ. ಕರೆ ಮಾಡಿ 91 9019491940 ಅದೃಷ್ಟ ಸಂಖ್ಯೆ: 7 ಮೀನ ರಾಶಿ : ನೀವು ಬಹುಕಾಲದಿಂದ ಎದುರು ನೋಡುತ್ತಿದ್ದ ಜೀವನದ ಒತ್ತಡಗಳಿಂದ ಇಂದು ಶಮನ ಪಡೆಯುತ್ತೀರಿ. ಅವುಗಳನ್ನು ಶಾಶ್ವತವಾಗಿ ದೂರವಿಸಿರಿಸಲು ನಿಮ್ಮ ಜೀವನಶೈಲಿಯನ್ನು ಬದಲಿಸಲು ಇದು ಸರಿಯಾದ ಸಮಯ. ನಿಮ್ಮ ತಾಯಿಯ ಬದಿಯಿಂದ ಇಂದು ಹಣಕಾಸಿನ ಲಾಭವನ್ನು ಪಡೆಯುವ ಪೂರ್ಣ ಸಾಧ್ಯತೆ ಇದೆ.ನಿಮ್ಮ ಮಾಮ ಅಥವಾ ತಾತ ನಿಮಗೆ ಆರ್ಥಿಕ ಬೆಂಬಲ ಮಾಡಬಹುದು. ಮನೆಯಲ್ಲಿನ ಕೆಲವು ಬದಲಾವಣೆಗಳು ನಿಮ್ಮನ್ನು ಭಾವುಕರನ್ನಾಗಿಸಬಹುದು ಆದರೆ ನಿಮಗೆ ಮುಖ್ಯವಾದವರಿಗೆ ನೀವು ನಿಮ್ಮ ಭಾವನೆಗಳನ್ನು ಪರಿಣಾಮಕಾರಿಯಾಗಿ ಹೇಳಲು ಸಾಧ್ಯವಾಗುತ್ತದೆ. ಹಠಾತ್ ಪ್ರಣಯ ಪ್ರಸಂಗಗಳು ನಿಮ್ಮನ್ನು ಗೊಂದಲಕ್ಕೀಡು ಮಾಡಬಹುದು. ದೇಶಿ ವ್ಯಾಪಾರಕ್ಕೆ ಸೇರಿರುವ ಜನರು, ಇಂದು ಅವರು ಅಪೇಕ್ಷಿತ ಫಲಿತಾಂಶವನ್ನು ಪಡೆಯುವ ಸಂಪೂರ್ಣ ಭರವಸೆ ಇದೆ. ಇದರೊಂದಿಗೆ ಉದ್ಯೋಗಕ್ಕೆ ಸಂಬಂಧಿಸಿದ ಈ ರಾಶಿಚಕ್ರದ ಜನರು, ತನ್ನ ಪ್ರತಿಭೆಯ ಪೂರ್ತಿ ಬಳಕೆಯನ್ನು ಕೆಲಸದ ಸ್ಥಳದಲ್ಲಿ ಮಾಡಬಹುದು. ಈ ರಾಶಿಚಕ್ರದ ಜನರು ಬಹಳ ಆಸಕ್ತಿದಾಯಕರು. ಇವರು ಕೆಲವೊಮ್ಮೆ ಎಲ್ಲಾ ಜನರ ನಡುವೆ ಸಂತೋಷವಾಗಿರುತ್ತಾರೆ, ಕೆಲವೊಮ್ಮೆ ಒಂಟಿಯಾಗಿ. ಆದಾಗ್ಯೂ ಒಂಟಿಯಾಗಿ ಸಾಮ್ಯವನ್ನು ಕಳೆಯುವುದು ಅಷ್ಟು ಸುಲಭವಲ್ಲ, ಆದರೂ ಇಂದು ನೀವು ಖಂಡಿತವಾಗಿಯೂ ನಿಮಗಾಗಿ ಸ್ವಲ್ಪ ಸಮಯವನ್ನು ಪಡೆಯಲು ಸಾಧ್ಯವಾಗುತ್ತದೆ. ಈ ದಿನ ನಿಮ್ಮ ಜೀವನ ಸಂಗಾತಿಗೆ ಸಾಮಾನ್ಯ ದಿನಗಳಿಗಿಂತ ಉತ್ತಮವಾಗಿರುವಂತೆ ತೋರುತ್ತದೆ. ಕರೆ ಮಾಡಿ 91 9019491940 ಅದೃಷ್ಟ ಸಂಖ್ಯೆ: 5 | kannad |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.