Ieee Java 2011-2012

BLUECHIP TECHNOLOGIES
JAVA
DOMAIN: IEEE TRANSACTIONS ON DISTRIBUTED NETWORKING WITH DESCRIPTION CODE J1NW01 PROJECT TITLE YEAR LOSSY NETWORK FLOW OPTIMIZATION RECOVERY PROBLEM USING 2011 PORTFOLIO SELECTION IN THIS PAPER WE CONSIDER THE PROBLEM OF JAMMING-AWARE SOURCE ROUTING IN WHICH THE SOURCE NODE PERFORMS TRAFFIC ALLOCATION BASED ON EMPIRICAL JAMMING STATISTICS AT INDIVIDUAL NETWORK NODES. WE FORMULATE THIS TRAFFIC ALLOCATION AS A LOSSY NETWORK FLOW OPTIMIZATION PROBLEM USING PORTFOLIO SELECTION THEORY FROM FINANCIAL STATISTICS. WE SHOW THAT IN MULTISOURCE NETWORKS, THIS CENTRALIZED OPTIMIZATION PROBLEM CAN BE SOLVED USING A DISTRIBUTED ALGORITHM BASED ON DECOMPOSITION IN NETWORK UTILITY MAXIMIZATION (NUM).WE DEMONSTRATE THE NETWORKS ABILITY TO ESTIMATE THE IMPACT OF JAMMING AND INCORPORATE THESE ESTIMATES INTO THE TRAFFIC ALLOCATION PROBLEM. FINALLY, WE SIMULATE THE ACHIEVABLE THROUGHPUT USING OUR PROPOSED TRAFFIC ALLOCATION METHOD IN SEVERAL SCENARIOS. MESH NETWORK MODEL WITH A GENERAL DYNAMIC PATH RESTORATION 2011
WE CONSIDER THE GENERAL PROBLEM OF ANALYZING PATH AVAILABILITY IN MESH NETWORKS WITH DYNAMIC PATH RESTORATION HERE FAILOVER PATHS ARE DETERMINED DYNAMICALLY "ON THE FLY," BY AN ALGORITHM IN REAL-TIME BASED ON THE CURRENT STATE OF THE NETWORK. IN A GENERAL MESH NETWORK MODEL WITH A GENERAL DYNAMIC PATH RESTORATION METHOD. AS ELEMENT REPAIRS ARE MADE AND THE INITIAL ROUTES BECOME AVAILABLE AGAIN FOR USE, THE REROUTED PATHS MAY REVERT TO THEIR RESPECTIVE ORIGINAL ROUTES.
J1NW02
J1NW03
J1NW04
MULTIPLE-FAULT RESTORATION FRAME WORK FOR LOOPBACK 2011 RECOVERY IN OPTICAL NETWORKS THE PROPOSED P-CYCLE-BASED FRAMEWORK ACHIEVES BOTH A MINIMAL SPARE CAPACITY REQUIREMENT AND A RAPID RESTORATION TIME. IN THE PROPOSED APPROACH, AN ALGORITHM DESIGNATED AS STAR-BLOCK IS USED TO SIMPLIFY THE ORIGINAL TOPOLOGY TO A 2-CONNECTED GRAPH AND TO PARTITION THE GRAPH INTO MULTIPLE BLOCKS, WHERE EACH BLOCK CONTAINS A CENTER NODE AND THE MINIMUM NUMBER OF NEIGHBORING NODES THAT COLLECTIVELY FORM A COMPLETE CYCLE. THE SIMPLIFIED GRAPH IS THEN RESTORED TO THE ORIGINAL TOPOLOGY USING CONVENTIONAL GRAPH RULES. AUTONOMOUS NETWORK RECONFIGURATION SYSTEM TO PRESERVE 2011 NETWORK PERFORMANCE
#10/15, 3rd Floor MMH Complex, Natesan Street, T.Nagar, Chennai-17, Ph.9962 087 087, E-mail:tngbct@gmail.com, Web: www.bcprojects.com
WE PRESENT AN AUTONOMOUS NETWORK RECONFIGURATION SYSTEM (ARS) THAT ENABLES A MULTIRADIO WMN TO AUTONOMOUSLY RECOVER FROM LOCAL LINK FAILURES TO PRESERVE NETWORK PERFORMANCE. BY USING CHANNEL AND RADIO DIVERSITIES IN WMNS, ARS GENERATES NECESSARY CHANGES IN LOCAL RADIO AND CHANNEL ASSIGNMENTS IN ORDER TO RECOVER FROM FAILURES. THE ERROR RATE AND ENERGY SAVING PROTOCOL FOR COOPERTIVE 2011 SENSOR NETWORK WE PROPOSE A COOPERATIVE COMMUNICATION PROTOCOL FOR ESTABLISHMENT OF THESE CLUSTERS AND FOR COOPERATIVE TRANSMISSION OF DATA. WE DERIVE THE UPPER BOUND OF THE CAPACITY OF THE PROTOCOL, AND WE ANALYZE THE END-TO-END ROBUSTNESS OF THE PROTOCOL TO DATAPACKET LOSS, ALONG WITH THE TRADEOFF BETWEEN ENERGY CONSUMPTION AND ERROR RATE. PARAMETRIC METHODS FOR ANOMALY DETECTION IN AGGREGATE 2011 TRAFFIC AND RAPID DETECTION OF REAL DENIAL-OF-SERVICE ATTACKS THE PROPOSED BIVARIATE PARAMETRIC DETECTION MECHANISM (BPDM) USES A SEQUENTIAL PROBABILITY RATIO TEST, ALLOWING FOR CONTROL OVER THE FALSE POSITIVE RATE WHILE EXAMINING THE TRADEOFF BETWEEN DETECTION TIME AND THE STRENGTH OF AN ANOMALY. ADDITIONALLY, IT USES BOTH TRAFFIC-RATE AND PACKET-SIZE STATISTICS, YIELDING A BIVARIATE MODEL THAT ELIMINATES MOST FALSE POSITIVES. NEIGHBOR DISCOVERY DURING SENSOR NETWORK INITIALIZATION 2011 AND CONTINUOUS NEIGHBOR DISCOVERY WE DISTINGUISH BETWEEN NEIGHBOR DISCOVERY DURING SENSOR NETWORK INITIALIZATION AND CONTINUOUS NEIGHBOR DISCOVERY. WE FOCUS ON THE LATTER AND VIEW IT AS A JOINT TASK OF ALL THE NODES IN EVERY CONNECTED SEGMENT. THIS ADVANTAGE IS EFFORT TO REDUCE POWER CONSUMPTION WITHOUT INCREASING THE TIME REQUIRED TO DETECT HIDDEN SENSORS. THROUGHPUT-COMPETITIVE ADVANCE RESERVATION WITH BOUNDED 2011 PATH DISPERSION TO ACHIEVE NEAR-OPTIMAL PERFORMANCE. WE SHOW THAT THE PROPOSED ALGORITHMS ACHIEVE REASONABLE DELAY PERFORMANCE, EVEN AT REQUEST ARRIVAL RATES CLOSE TO CAPACITY BOUNDS, AND THAT THREE TO FIVE PARALLEL PATHS ARE SUFFICIENT TO ACHIEVE NEAR-OPTIMAL PERFORMANCE. RING STRUCTURED PEER-TO-PEER OVERLAY NETWORKS USING 2010 CACHING SCHEME WE PROPOSE AN OPTIMAL RESOURCE PLACEMENT STRATEGY, WHICH CAN OPTIMALLY TRADE OFF THE PERFORMANCE GAIN AND PAID COST. PCACHE (A P2P-BASED CACHING SCHEME) AND PRING (A P2P RING STRUCTURE). DYNAMIC LOAD BALANCING WITH PROVABLE PERFORMANCE IN 2010 DISTRIBUTED HASH TABLE NETWORKS
J1NW05
J1NW06
J1NW07
J1NW08
J1NW09
J0NW10
J0NW11 HERE WE PRESENTS AN ELASTIC ROUTING TABLE (ERT) MECHANISM FOR QUERY LOAD BALANCING, BASED ON THE OBSERVATION THAT HIGH-DEGREE NODES TEND TO RECEIVE MORE TRAFFIC LOAD. OPPORTUNISTIC ROUTING WITH MANET ROUTING PROTOCOL 2010
WE PROPOSE A NOVEL OPPORTUNITY-BASED TOPOLOGY CONTROL. TO ADDRESSES THE PROBLEM NP-HARD.WE DESIGN A FULLY DISTRIBUTED ALGORITHM CALLED CONREAP BASED ON RELIABILITY THEORY.
J0NW12
J0NW13
DELAY ANALYSIS FOR MAXIMAL SCHEDULING ALGORITHMS TO 2010 MINIMIZE THE QUEUE-OVERFLOW PROBABILITY IN THIS PAPER, WE ARE INTERESTED IN SCHEDULING ALGORITHMS FOR THE DOWNLINK OF A SINGLE CELL THAT CAN MINIMIZE THEQUEUE-OVERFLOW PROBABILITY. SCALE-FREE CHARACTERISTICS OF RANDOM NETWORKS AND 2010 MAXIMIZING RESTORABLE THROUGHPUT
MPLS RECOVERY MECHANISMS ARE INCREASING IN POPULARITY BECAUSE THEY CAN GUARANTEE FAST RESTORATION AND HIGH QOS ASSURANCE. THEIR MAIN ADVANTAGE IS THAT THEIR BACKUP PATHS ARE ESTABLISHED IN ADVANCE, BEFORE A FAILURE MOBILE COMMUNICATIONS SECURED EVENT TAKES PLACE. 2010
J0NW14
IN THIS PAPER, WE COME UP WITH A NOVEL AUTHENTICATION MECHANISM, CALLED THE NESTED ONE-TIME SECRET MECHANISM, TAILORED FOR MOBILE COMMUNICATION ENVIRONMENTS. DOMAIN : IEEE TRANSACTIONS ON SOFTWARE ENGINEERING WITH DESCRIPTION CODE J1SE01 PROJECT TITLE YEAR DYNAMIC QOS MANAGEMENT AND OPTIMIZATION IN SERVICE-BASED 2011 SYSTEMS THIS PROJECT IS SERVICE-BASED SYSTEMS THAT ARE DYNAMICALLY COMPOSED AT RUNTIME TO PROVIDE COMPLEX, ADAPTIVE FUNCTIONALITY ARE CURRENTLY ONE OF THE MAIN DEVELOPMENT PARADIGMS IN SOFTWARE ENGINEERING. HOWEVER, THE QUALITY OF SERVICE (QOS) DELIVERED BY THESE SYSTEMS REMAINS AN IMPORTANT CONCERN, AND NEEDS TO BE MANAGED IN AN EQUALLY ADAPTIVE AND PREDICTABLE WAY, WE INTRODUCE A NOVEL, TOOL-SUPPORTED FRAMEWORK FOR THE DEVELOPMENT OF ADAPTIVE SERVICE-BASED SYSTEMS CALLED QOSMOS. A GENERAL SOFTWARE DEFECT-PRONENESS PREDICTION FRAMEWORK 2011 PREDICTING DEFECT-PRONE SOFTWARE COMPONENTS IS AN ECONOMICALLY IMPORTANT ACTIVITY AND SO HAS RECEIVED A GOOD DEAL OF ATTENTION. OBJECTIVEWE PROPOSE AND EVALUATE A GENERAL FRAMEWORK FOR SOFTWARE DEFECT PREDICTION THAT SUPPORTS 1) UNBIASED AND 2) COMPREHENSIVE COMPARISON BETWEEN COMPETING PREDICTION SYSTEMS. METHODTHE FRAMEWORK IS COMPRISED OF 1) SCHEME EVALUATION AND 2) DEFECT PREDICTION COMPONENTS.
J1SE02
DOMAIN : IEEE TRANSACTIONS ON DISTRIBUTION SYSTEM WITH DESCRIPTION CODE J1DS01 PROJECT TITLE YEAR MATHEMATICAL FRAMEWORK TO EXPRESS THE ROUTING 2011 COMPLEXITY TO OPTIMIZE THE CLUSTER-POPULATION A NEW MATHEMATICAL FRAMEWORK TO CARRY OUT THE AVERAGES OF THE ROUTING COMPLEXITY AND THE ROUTING TABLE SIZE IS PROPOSED TO EXPRESS THE ROUTING COMPLEXITY AND THE ROUTING TABLE SIZE AS THE FUNCTIONS OF THE HIERARCHICAL NETWORK PARAMETERS SUCH AS THE NUMBER OF THE HIERARCHICAL LEVELS AND THE SUBSCRIBER DENSITY (CLUSTER-POPULATION) FOR EACH HIERARCHICAL LEVEL. MULTIHOP WIRELESS NETWORKS THROUGH COOPERATIVE 2011 CHANNELIZATION IN WIRELESS NETWORKS WE PROPOSE COOPERATIVE CHANNELIZATION, IN WHICH PORTIONS OF THE TRANSMISSION MEDIA ARE ALLOCATED TO LINKS THAT ARE CONGESTED AT THE POINT WHERE NETWORK CODING CANNOT EFFICIENTLY REPAIR LOSS. A HEALTH METRIC IS PROPOSED TO ALLOW COMPARISON OF NEED FOR CHANNELIZATION OF DIFFERENT MULTICAST LINKS. : IEEE TRANSACTIONS ON MOBILE COMPUTING WITH DESCRIPTION
J1DS02
DOMAIN CODE J1MC01
PROJECT TITLE YEAR A SYMBOL LEVEL NETWORK CODING APPROACH TO 2011 RETRANSMISSION TO SOFTWARE DEFINED RADIO (SDR) PLATFORM WE ATTEMPT TO DRASTICALLY REDUCE THE COST OF RETRANSMISSION BY INTRODUCING NETWORK CODING TO SYMBOL LEVEL OPERATION. WE PRESENT SYNC, A PHYSICAL LAYER TRANSMISSION SCHEME THAT DRASTICALLY REDUCES THE COST OF RETRANSMISSION BY INTRODUCING NETWORK CODING CONCEPTS TO SYMBOL LEVEL OPERATION. SOFT LETS MULTIPLE ACCESS POINTS (APS) WORK COOPERATIVELY TO RECOVER FROM FAULTY UPLINK PACKETS. EFFICIENT GEOGRAPHIC MULTICAST PROTOCOL (EGMP) USES A 2011 VIRTUAL-ZONE-BASED STRUCTURE WE PROPOSE A NOVEL EFFICIENT GEOGRAPHIC MULTICAST PROTOCOL (EGMP). EGMP USES A VIRTUAL-ZONE-BASED STRUCTURE TO IMPLEMENT SCALABLE AND EFFICIENT GROUP MEMBERSHIP MANAGEMENT. A NETWORKWIDE ZONE-BASED BIDIRECTIONAL TREE IS CONSTRUCTED TO ACHIEVE MORE EFFICIENT MEMBERSHIP MANAGEMENT AND MULTICAST DELIVERY MULTICAST STRATEGY TO MINIMIZE THE QUEUING DELIVERY IN 2011 DELAY-SENSITIVE COMPONENT WE ANALYZE THE MOVEMENT PATTERN OF MOBILE NODES AND APPROXIMATE IT AS A SEMI-MARKOV PROCESS. BASED ON THIS MODEL, WE EXPLORE DIFFERENT COMPONENTS OF THE UNDERLYING SERVICE DELAY AND PROPOSE THAT APS SHOULD USE A MULTICAST STRATEGY TO MINIMIZE THE QUEUING DELAY COMPONENT
J1MC02
J1MC03
J1MC04 A NOVEL SCHEME TO SECURE A MULTIHOP NETWORK 2011 PROGRAMMING THROUGH MULTIPLE ONE-WAY HASH CHAINS WE PROPOSE A NOVEL SCHEME TO SECURE A MULTIHOP NETWORK PROGRAMMING PROTOCOL THROUGH THE USE OF MULTIPLE ONE-WAY HASH CHAINS. THE SCHEME IS SHOWN TO BE LOWER IN COMPUTATIONAL, POWER CONSUMPTION, AND COMMUNICATION COSTS YET STILL ABLE TO SECURE MULTIHOP PROPAGATION OF PROGRAM IMAGES. RESOURCE MANAGEMENT FOR VOWLAN WIRELESS LOCAL AREA 2011 NETWORKS (WLANS) THIS PROJECT EXAMINES TWO SPECIFIC ASPECTS OF RESOURCE MANAGEMENT IN WIRELESS LOCAL AREA NETWORKS (WLANS)CALL ADMISSION CONTROL (CAC) AND HANDLING OF LINK ADAPTATION (LA) EVENTS. A SELF-CONSISTENT SYSTEM TO MANAGE THESE FOR VOICE OVER INTERNET PROTOCOL (VOIP) OVER AN IEEE 802.11 WLAN IS PRESENTED. THE PROPOSED CAC SCHEME IS BASED ON THE ENDPOINT ADMISSION CONTROL (EAC) PARADIGM. THE PROPOSED SCHEME WAS EVALUATED ON AN EXPERIMENTAL TESTBED AND TEST RESULTS SHOW THAT CORRECT ADMISSION DECISIONS WERE MADE UNDER VARIOUS NETWORK CONFIGURATIONS. AAA ACCOUNTING POLICIES IN MOBILE ENVIRONMENTS 2010 WE PROPOSE AN ADAPTIVE OPTIMIZATION MECHANISM IN MULTISERVICE AAA SYSTEMS WHICH LIMITS THE POTENTIAL LOSS WITHOUT EXCESSIVELY GENERATING UNNECESSARY USAGE REPORTS. EFFICIENT AUTHENTICATION IN MULTICAST NETWORKS 2010 MABS-B ELIMINATES THE CORRELATION AMONG PACKETS AND IT IS ALSO EFFICIENT IN TERMS OF LATENCY, COMPUTATION, AND COMMUNICATION OVERHEAD DUE TO AN EFFICIENT CRYPTOGRAPHIC PRIMITIVE CALLED BATCH SIGNATURE MABS-E, WHICH COMBINES THE BASIC SCHEME WITH A PACKET FILTERING MECHANISM. LOAD-AWARE ROUTING SCHEME 2010 THIS PAPER PROPOSES A LOAD-AWARE ROUTING SCHEME FOR WIRELESS MESH NETWORKS.THE TRAFFIC LOAD TENDS TO BE UNEVENLY DISTRIBUTED OVER THE NETWORK. IN THIS SITUATION, THE LOAD-AWARE ROUTING SCHEME CAN BALANCE THE LOAD, AND CONSEQUENTLY, ENHANCE THE OVERALL NETWORK CAPACITY.
J1MC05
J0MC06
J0MC07
J0MC08
DOMAIN CODE J1NS01 : IEEE BASED ON NETWORK SECURITY WITH DESCRIPTION PROJECT TITLE YEAR A NOVEL TRACE BACK METHOD FOR DDOS ATTACK TRAFFIC USED 2011 PACKET MARKING TECHNIQUES WE PROPOSE A NOVEL TRACE BACK METHOD FOR DDOS ATTACKS THAT IS BASED ON ENTROPY VARIATIONS BETWEEN NORMAL AND DDOS ATTACK TRAFFIC, WHICH IS FUNDAMENTALLY DIFFERENT FROM COMMONLY USED PACKET MARKING TECHNIQUES. IN COMPARISON TO THE EXISTING DDOS TRACEBACK METHODS THE PROPOSED STRATEGY POSSESSES A NUMBER OF ADVANTAGES IT IS MEMORY NONINTENSIVE, EFFICIENTLY SCALABLE, ROBUST AGAINST PACKET POLLUTION, AND INDEPENDENT OF ATTACK TRAFFIC PATTERNS FLEXIBLE ROBUST GROUP KEY AGREEMENT TO SECURE UNDER THE 2011 (STANDARD) DECISIONAL SQUARE DIFFIE-HELLMAN ASSUMPTION WE PROPOSE A NOVEL 2-ROUND GROUP KEY AGREEMENT PROTOCOL, WHICH TOLERATES UP TO T NODE FAILURES, USING O(T)-SIZED MESSAGES FOR ANY T. WE SHOW THAT THE NEW PROTOCOL IMPLIES A FULLY-ROBUST GROUP KEY AGREEMENT WITH LOGARITHMIC-SIZED MESSAGES AND EXPECTED ROUND COMPLEXITY CLOSE, ASSUMING RANDOM NODE FAULTS. RELIABILITY, ANONYMITY AND ACCOUNTABILITY IN PEER-TO-PEER 2010 TRUST MANAGEMENT SYSTEM WE PROPOSE THE SECURE DEEP THROAT (SDT) PROTOCOL TO PROVIDE ANONYMITY FOR THE WITNESSES OF MALICIOUS OR SELFISH BEHAVIOR TO ENABLE SUCH PEERS TO REPORT ON THIS BEHAVIOR WITHOUT FEAR OF RETALIATION. DDOS DEFENSE MECHANISMS FOR DETECTING, TRACING, 2010 AND MITIGATING NETWORK-WIDE ANOMALIES WE PROPOSE A NOVEL GROUP TESTING (GT)-BASED APPROACH DEPLOYED ON BACK-END SERVERS WHICH NOT ONLY OFFERS A THEORETICAL METHOD TO OBTAIN SHORT DETECTION DELAY AND LOW FALSE POSITIVE/NEGATIVE RATE BUT ALSO PROVIDES AN UNDERLYING FRAMEWORK AGAINST GENERAL NETWORK ATTACKS.
J1NS02
J0NS03
J0NS04
DOMAIN: IEEE TRANSACTIONS ON DATA ENGINEERING (DATA MINING) WITH DESCRIPTION CODE J1DM01 PROJECT TITLE YEAR OPTIMIZING RESOURCE CONFLICTS IN WORKFLOW MANAGEMENT 2011 SYSTEMS USING AN INNOVATIVE ALGORITHM IN THIS PAPER, WE PROPOSE AN INNOVATIVE ALGORITHM WHICH JOINTLY OPTIMIZES THE TWO AFOREMENTIONED CONTRADICTORY CRITERIA. THE ALGORITHM, CALLED RESOURCE CONFLICTS.JOINT OPTIMIZATION MINIMIZES RESOURCE CONFLICTS SUBJECT TO TEMPORAL CONSTRAINTS AND SIMULTANEOUSLY OPTIMIZES THROUGHPUT OR UTILIZATION SUBJECT TO RESOURCES CONSTRAINTS. RANKING SPATIAL DATA BY QUALITY PREFERENCES FOR QUERIES 2011
J1DM02
AND PROPOSE APPROPRIATE INDEXING TECHNIQUES IN THIS PAPER, WE FORMALLY DEFINE SPATIAL PREFERENCE QUERIES AND PROPOSE APPROPRIATE INDEXING TECHNIQUES AND SEARCH ALGORITHMS FOR THEM. EXTENSIVE EVALUATION OF OUR METHODS ON BOTH REAL AND SYNTHETIC DATA REVEALS THAT AN OPTIMIZED BRANCH-AND-BOUND SOLUTION IS EFFICIENT AND ROBUST WITH RESPECT TO DIFFERENT PARAMETERS. A GEOMETRIC INTERPRETATION OF THE MONOCHROMATIC REVERSE 2011 TOP K QUERY TO ACQUIRE AN INTUITION OF THE SOLUTION SPACE IN THIS PAPER, WE DEFINE A NOVEL QUERY TYPE, NAMELY THE REVERSE TOPK QUERY THAT COVERS THIS REQUIREMENT: GIVEN A POTENTIAL PRODUCT, WHICH ARE THE USER PREFERENCES THAT MAKE THIS PRODUCT BELONGING TO THE TOP-K QUERY RESULT SET. REVERSE TOP-K QUERIES ARE ESSENTIAL FOR MANUFACTURERS TO ASSESS THE IMPACT OF THEIR PRODUCTS IN THE MARKET BASED ON THE COMPETITION. WE FORMALLY DEFINE REVERSE TOP-K QUERIES AND INTRODUCE TWO VERSIONS OF THE QUERY, MONOCHROMATIC AND BICHROMATIC. FIRST, WE PROVIDE A GEOMETRIC INTERPRETATION OF THE MONOCHROMATIC REVERSE TOP K QUERY TO ACQUIRE AN INTUITION OF THE SOLUTION SPACE. THEN, WE STUDY IN DETAIL THE CASE OF BICHROMATIC REVERSE TOP-K QUERY, AND WE PROPOSE TWO TECHNIQUES FOR QUERY PROCESSING, NAMELY AN EFFICIENT THRESHOLD BASED ALGORITHM AND AN ALGORITHM BASED ON MATERIALIZED REVERSE TOP K VIEWS. OUR EXPERIMENTAL EVALUATION DEMONSTRATES THE EFFICIENCY OF OUR TECHNIQUES. DATABASE RESPONSE POLICIES TO SUPPORT OUR INTRUSION 2011 RESPONSE SYSTEM TAILORED FOR A DBMS WE PROPOSE THE NOTION OF DATABASE RESPONSE POLICIES TO SUPPORT OUR INTRUSION RESPONSE SYSTEM TAILORED FOR A DBMS. OUR INTERACTIVE RESPONSE POLICY LANGUAGE MAKES IT VERY EASY FOR THE DATABASE ADMINISTRATORS TO SPECIFY APPROPRIATE RESPONSE ACTIONS FOR DIFFERENT CIRCUMSTANCES DEPENDING UPON THE NATURE OF THE ANOMALOUS REQUEST. EFFICIENT PERIODICITY MINING IN TIME SERIES DATABASES USING 2011 SUFFIX TREES WHICH CAN DETECT SYMBOL SEQUENCE IN THIS PAPER, WE PRESENT AN ALGORITHM WHICH CAN DETECT SYMBOL, SEQUENCE, AND SEGMENT PERIODICITY IN TIME SERIES. THE ALGORITHM USES SUFFIX TREE AS THE UNDERLYING DATA STRUCTURE; THIS ALLOWS US TO DESIGN THE ALGORITHM SUCH THAT ITS WORSTCASE COMPLEXITY WHERE K IS THE MAXIMUM LENGTH OF PERIODIC PATTERN AND N IS THE LENGTH OF THE ANALYZED PORTION TIME SERIES. THE ALGORITHM IS NOISE RESILIENT; IT HAS BEEN SUCCESSFULLY DEMONSTRATED TO WORK WITH REPLACEMENT, INSERTION, DELETION, OR A MIXTURE OF THESE TYPES OF NOISE. WE HAVE TESTED THE PROPOSED ALGORITHM ON BOTH SYNTHETIC AND REAL DATA FROM DIFFERENT DOMAINS, INCLUDING PROTEIN SEQUENCES. THE CLUSTER-BASED TEMPORAL MOBILE SEQUENTIAL PATTERNS 2011 (CTMSPS) AND TO PREDICT THE SUBSEQUENT MOBILE BEHAVIORS.
J1DM03
J1DM04
J1DM05
J1DM06
WE PROPOSE A NOVEL ALGORITHM, NAMELY, CLUSTER-BASED TEMPORAL MOBILE SEQUENTIAL PATTERN MINE (CTMSP-MINE), TO DISCOVER THE CLUSTER-BASED TEMPORAL MOBILE SEQUENTIAL PATTERNS (CTMSPS). MOREOVER, A PREDICTION STRATEGY IS PROPOSED TO PREDICT THE SUBSEQUENT MOBILE BEHAVIORS. AN EMPIRICAL METHOD TO ESTIMATE SEMANTIC SIMILARITY USING 2011 PAGE COUNTS AND TEXT SNIPPETS RETRIEVED FROM A WEB SEARCH ENGINE WE PROPOSE AN EMPIRICAL METHOD TO ESTIMATE SEMANTIC SIMILARITY USING PAGE COUNTS AND TEXT SNIPPETS RETRIEVED FROM A WEB SEARCH ENGINE FOR TWO WORDS. SPECIFICALLY, WE DEFINE VARIOUS WORD COOCCURRENCE MEASURES USING PAGE COUNTS AND INTEGRATE THOSE WITH LEXICAL PATTERNS EXTRACTED FROM TEXT SNIPPETS. A SECURE DISTRIBUTED ONLINE CERTIFICATION AUTHORITY AND 2010 DECENTRALIZED PEER TO PEER SYSTEMS. IN THIS PAPER, WE PRESENT A CRYPTOGRAPHIC PROTOCOL FOR ENSURING SECURE AND TIMELY AVAILABILITY OF THE REPUTATION DATA OF A PEER TO OTHER PEERS AT EXTREMELY LOW COSTS INTEREST-BASED PERSONALIZED SEARCH 2010 THIS PAPER PRESENTS A KNOWLEDGE DISCOVERY FRAMEWORK FOR THE CONSTRUCTION OF COMMUNITY WEB DIRECTORIES, A CONCEPT THAT WE INTRODUCED IN OUR RECENT WORK, APPLYING PERSONALIZATION TO WEB DIRECTORIES
J1DM07
J0DM08
J0DM09
DOMAIN : IEEE BASED ON GRID APPLICATIONS (GRID COMPUTING) CODE J1GR01 PROJECT TITLE YEAR COLLECTIVE DATA STEALING WITH LOAD BALANCING AND 2011 MULTICAST FOR GRID APPLICATIONS IN THIS PROJECT, WE HAVE PRESENTED ROBBER; A RECEIVER INITIATED MULTICAST APPROACH THAT COMBINES COLLECTIVE DATA STEALING WITH LOAD BALANCING. IN ROBBER, THE AMOUNT OF DATA A NODE STEALS REMOTELY IS TREATED AS WORK. INITIALLY, THE WORK IS DIVIDED EQUALLY AMONG ALL NODES IN A COLLECTIVE, BUT ONCE A NODE BECOMES IDLE, IT TRIES TO STEAL WORK FROM LOCAL PEERS. A FLEXIBLE PHASOR FOR GRID 2010 WE PRESENT A DESIGN FOR A PHASOR SYSTEM, CALLED THE FLEXIBLE INTEGRATED PHASOR SYSTEM (FIPS), TO PROVIDE A MORE FLEXIBLE, LOWER COST ALTERNATIVE TO PROVIDE INDEPENDENT SYSTEM OPERATORS AND TRANSMISSION OWNERS READY ACCESS TO THEIR PHASOR DATA. GRID WORKLOAD PREDICTION 2010` THE MODEL WAS PROVED ESPECIALLY EFFECTIVE TO PREDICT LARGE WORKLOAD THAT DEMANDS VERY LONG EXECUTION TIME, SUCH AS EXCEEDING 4 HOURS ON THE GRID5000 OVER 5,000 PROCESSORS.
J0GR01
J0GR02
DOMAIN CODE J1SC01 : IEEE TRANSACTIONS ON DEPENDABLE AND SECURE COMPUTING WITH DESCRIPTION PROJECT TITLE YEAR STOCHASTIC MODEL FOR QUANTIFYING SECURITY OF NETWORKED 2011 SYSTEMS IN TRADITIONAL SECURITY ANALYSES THIS PAPER PRESENTS A STOCHASTIC MODEL FOR QUANTIFYING SECURITY OF NETWORKED SYSTEMS. THE RESULTING MODEL CAPTURES TWO ASPECTS OF A NETWORKED SYSTEM: 1) THE STRENGTH OF DEPLOYED SECURITY MECHANISMS SUCH AS INTRUSION DETECTION SYSTEMS AND 2) THIS METHOD INVOLVES THE FINE TUNING OF THE SECURITY DEPLOYED IN THE SYSTEM. A POLICY ENFORCING MECHANISM FOR TRUSTED APPLICATION2011 CENTRIC AD HOC NETWORKS WE DESIGN AND IMPLEMENTATION OF A POLICY ENFORCING MECHANISM BASED ON SATEM (SATEM VERIFIES ITS TRUSTWORTHINESS OF ENFORCING THE REQUIRED SET OF POLICIES) A KERNEL-LEVEL TRUSTED EXECUTION MONITOR BUILT ON TOP OF THE TRUSTED PLATFORM MODULE. IN THIS WAY, NODES CAN FORM TRUSTED APPLICATION-CENTRIC NETWORKS BEFORE ALLOWING A NODE TO JOIN SUCH A NETWORK. NETWORK-BASED SIGNATURE GENERATION WORM DETECTION 2011 WE PROPOSE A NEW NSG (NETWORK-BASED SIGNATURE GENERATION) SYSTEM POLYTREE, TO DEFEND AGAINST POLYMORPHIC WORMS. WE OBSERVE THAT SIGNATURES FROM WORMS AND THEIR VARIANTS ARE RELEVANT AND A TREE STRUCTURE CAN PROPERLY REFLECT THEIR FAMILIAL RESEMBLANCE, THESE SIGNATURES ARE WELL RGANIZED IN THE SIGNATURE TREE TO REFLECT THE INHERENT RELATIONS OF WORMS AND THEIR VARIANTS. SPOOFING DEFENSE'S PERFORMANCE AND THE INTERNET'S TOPOLOGY 2011 IP SPOOFING EXACERBATES MANY SECURITY THREATS, AND REDUCING IT WOULD GREATLY ENHANCE INTERNET SECURITY. SEVEN DEFENSES THAT FILTER SPOOFED TRAFFIC HAVE BEEN PROPOSED TO DATE; THREE ARE DESIGNED FOR END-NETWORK DEPLOYMENT, WHILE FOUR ASSUME SOME COLLABORATION WITH CORE ROUTERS FOR PACKET MARKING OR FILTERING.1) FORMALIZING THE PROBLEM OF SPOOFED TRAFFIC FILTERING AND DEFINING NOVEL EFFECTIVENESS MEASURES, 2) OBSERVING EACH DEFENSE AS SELFISH (IT HELPS ITS PARTICIPANTS) OR ALTRUISTIC (IT HELPS EVERYONE) AND DIFFERENTIATING THEIR PERFORMANCE GOALS, 3) DEFINING OPTIMAL CORE DEPLOYMENT POINTS FOR DEFENSES THAT NEED CORE SUPPORT, AND 4) EVALUATING ALL DEFENSES IN A COMMON AND REALISTIC SETTING. BOTNET TRACKING 2010 COMPAREDWITH CURRENT BOTNETS, THE PROPOSED BOTNET IS HARDER TO BE SHUT DOWN, MONITORED, AND HIJACKED. IT PROVIDES ROBUST NETWORK CONNECTIVITY
J1SC02
J1SC03
J1SC04
J0SC05
DOMAIN: IEEE TRANSACTIONS ON CLOUD COMPUTING WITH DESCRIPTION CODE PROJECT TITLES YEAR J1CC01 CLOUD COMPUTING FOR LOOSELY COUPLED CLUSTERS 2011 IN THIS PROJECT, WE HAVE ANALYZED THE CHALLENGES AND VIABILITY OF DEPLOYING A COMPUTING CLUSTER ON TOP OF A MULTICLOUD INFRASTRUCTURE SPANNING FOUR DIFFERENT SITES FOR SOLVING LOOSELY COUPLED MTC APPLICATIONS. J1CC02 DYNAMIC RESOURCE ALLOCATION FOR TASK SCHEDULING AND 2011 EXECUTION IN THIS PROJECT, WE HAVE DISCUSS THE CHALLENGES AND OPPORTUNITIES FOR EFFICIENT PARALLEL DATA PROCESSING IN CLOUD ENVIRONMENTS AND PRESENTED NEPHELE, THE FIRST DATA PROCESSING FRAMEWORK TO EXPLOIT THE DYNAMIC RESOURCE PROVISIONING OFFERED BY TODAYS IAAS CLOUDS. DOMAIN: IEEE TRANSACTIONS ON IMAGE PROCESSING WITH DESCRIPTIONS CODE J1IP01 PROJECT TITLES DIFFERENTIATING REGION-OF-INTEREST IN SPATIAL DOMAIN IMAGES YEAR 2011
IN THIS PROJECT, WE PROPOSE A SCALABLE IMAGE REPRESENTATION WITH THE ROI FUNCTIONALITY IN THE SPATIAL DOMAIN, WHICH ALLOWS US TO GENERATE A HIERARCHY OF IMAGES WITH ARBITRARY SIZES. THE ROI FUNCTIONALITY OF OUR SCALABLE REPRESENTATION IS A RESULT OF A NONUNIFORM GRID TRANSFORMATION IN THE SPATIAL DOMAIN, WHERE ONLY THE CENTER OF ROI AND AN EXPANSION PARAMETER ARE TO BE KNOWN. J1IP02 IMPROVING QUALITY OF HIGH DYNAMIC RANGE VIDEO COMPRESSION 2011 USING TONE-MAPPING OPERATOR IN THIS PROJECT, WE SHOWED THAT THE APPROPRIATE CHOICE OF A TONEMAPPING OPERATOR (TMO) CAN SIGNIFICANTLY IMPROVE THE RECONSTRUCTED HDR QUALITY. WE DEVELOPED A STATISTICAL MODEL THAT APPROXIMATES THE DISTORTION RESULTING FROM THE COMBINED PROCESSES OF TONE-MAPPING AND COMPRESSION.
DOMAIN: IEEE TRANSACTIONS ON INFORMATION FORENSICS AND SECURITY WITH DESCRIPTION CODE J1FS01 PROJECT TITLES DATA HIDING IN COMPRESSED VIDEO BASED ON MINIMUM DISTORTION AND MINIMUM OVERHEAD YEAR 2011
WE PROPOSE A NEW DATA-HIDING METHOD IN THE MOTION VECTORS OF MPEG-2 COMPRESSED VIDEO. THE EMBEDDING AND EXTRACTION ALGORITHMS ARE IMPLEMENTED AND INTEGRATED TO THE MPEG-2 ENCODER/DECODER AND THE RESULTS ARE EVALUATED BASED ON TWO METRICS: QUALITY DISTORTION TO THE RECONSTRUCTED VIDEO AND DATA SIZE INCREASE OF THE COMPRESSED VIDEO. J1FS02 NOVEL HIGH-CAPACITY STEGANOGRAPHY TECHNIQUE FOR 2011 EMBEDDING DATA IN AUDIO STREAMS IN THIS PROJECT, WE HAVE SUGGESTED A HIGH-CAPACITY STEGANOGRAPHY ALGORITHM FOR EMBEDDING DATA. THE EXPERIMENTAL RESULTS HAVE SHOWN THAT OUR PROPOSED STEGANOGRAPHY ALGORITHM CAN ACHIEVE A LARGER DATA EMBEDDING CAPACITY WITH IMPERCEPTIBLE DISTORTION OF THE ORIGINAL SPEECH. WE HAVE ALSO DEMONSTRATED THAT THE PROPOSED STEGANOGRAPHY ALGORITHM IS MORE SUITABLE FOR EMBEDDING DATA IN INACTIVE AUDIO FRAMES THAN IN ACTIVE AUDIO FRAMES.
DOMAIN: IEEE TRANSACTIONS ON BIOMEDICINE WITH DESCRIPTION CODE J1BE01 PROJECT TITLES YEAR HYBRID GENETIC AND VARIATION EXPECTATION-MAXIMIZATION 2011 TECHNIQUE FOR BRAIN IMAGE SEGMENTATION IN THIS PROJECT, WE HAVE PROPOSED A HYBRID GA-VEM ALGORITHM AS AN IMPROVED APPROACH TO BRAIN MR IMAGE SEGMENTATION. WE COMPARED THE PROPOSED SEGMENTATION ALGORITHM WITH THE EM-BASED, VEMBASED, AND GA-EM BASED SEGMENTATION APPROACHES, AND TWO SEGMENTATION METHODS IN THE WIDELY USED SPM8 AND FSL PACKAGES IN LOW- AND HIGH-RESOLUTION CLINICAL BRAIN MR STUDIES.
DOMAIN: IEEE TRANSACTION ON BIOMEDICAL WITH DESCRIPTION CODE J1BM0 1 PROJECT TITLES DETECTING RETINAL BLOOD VESSELS USING CURVELET TRANSFORM YEAR 2011
IN THIS PROJECT, A NEW METHOD FOR THE RETINAL VESSEL SEGMENTATION HAS BEEN PRESENTED. SPECIFIC CHARACTERISTICS OF RETINAL IMAGES MAKE THE VESSEL DETECTION MORE DIFFICULT. REGARDING THE HIGH ABILITY OF FDCT IN REPRESENTING IMAGES CONTAINING EDGES, USING MODIFICATION OF CURVELET TRANSFORMS COEFFICIENTS
DOMAIN: IEEE TRANSACTIONS ON MEDICAL IMAGE PROCESS WITH DESCRIPTION CODE J1MI0 1 PROJECT TITLES GRAPH-BASED TECHNIQUE TO SEGMENT THE VESSEL EDGES YEAR 2011
THIS PROJECT PROPOSES AN ALGORITHM TO MEASURE THE WIDTH OF RETINAL VESSELS IN FUNDUS PHOTOGRAPHS USING GRAPH-BASED ALGORITHM TO SEGMENT BOTH VESSEL EDGES SIMULTANEOUSLY. FIRST, THE SIMULTANEOUS TWO-BOUNDARY SEGMENTATION PROBLEM IS MODELED AS A TWO-SLICE, 3-D SURFACE SEGMENTATION PROBLEM, WHICH IS FURTHER CONVERTED INTO THE PROBLEM OF COMPUTING A MINIMUM CLOSED SET IN A NODE-WEIGHTED GRAPH. DOMAIN: IEEE TRANSACTIONS ON MULTIMEDIA WITH DESCRIPTION CODE PROJECT TITLES YEAR
J1MM01 VIDEO TRANSMISSION OVER ERROR-PRONE MOBILE AD-HOC 2011 NETWORKS IN THIS PROJECT, WE PROPOSE A ROUTING-AWARE MDC APPROACH WITH MULTIPATH TRANSPORT TO ENHANCE THE ERROR ROBUSTNESS OF VIDEO TRANSMISSION OVER WIRELESS AD-HOC NETWORKS. WE ESTABLISH A MODEL TO ESTIMATE THE PACKET LOSS PROBABILITY OF EACH PACKET BASED ON ROUTING MESSAGES AND NETWORK PARAMETERS. J1MM02 BANDWIDTH TRANSFER FOR MULTIPLE DESCRIPTION CODING IN 2011 VIDEO STREAMING IN THIS PROJECT, WE STUDY HOW TO OPTIMALLY ASSIGN DESCRIPTION BANDWIDTH FOR MDC FOR VIDEO STREAMING TO LARGE GROUP, SO THAT THEIR HETEROGENEOUS BANDWIDTH REQUIREMENTS CAN BE BEST SATISFIED. WE FORMULATE THE PROBLEM AS AN OPTIMIZATION PROBLEM AND PROPOSE ALGORITHMS TO ADDRESS IT. J1MM03 DIGITAL VIDEO BROADCASTING USING SV-BCMCS 2011 IN THIS PROJECT, WE PRESENT SV-BCMCS, A NOVEL SCALABLE VIDEO BROADCAST/MULTICAST SOLUTION THAT EFFICIENTLY INTEGRATES SCALABLE VIDEO CODING, 3G BROADCAST, AND AD-HOC FORWARDING. WE FORMULATE THE RESOURCE ALLOCATION PROBLEM FOR SCALABLE VIDEO MULTICAST IN A HYBRID NETWORK WHOSE OPTIMAL SOLUTION CAN BE RESOLVED BY A DYNAMIC PROGRAMMING ALGORITHM. DOMAIN: IEEE TRANSACTIONS ON NEURAL NETWORK WITH DESCRIPTION CODE J1NN01 PROJECT TITLES YEAR
NEURAL NETWORK SCHEME FOR PIXEL CLASSIFICATION AND 2011 COMPUTE BLOOD VESSEL DETECTION IN THIS PROJECT, A NEW METHODOLOGY FOR BLOOD VESSEL DETECTION IS PRESENTED. IT IS BASED ON PIXEL CLASSIFICATION USING A 7-D FEATURE VECTOR EXTRACTED FROM PREPROCESSED RETINAL IMAGES AND GIVEN AS INPUT TO A NEURAL NETWORK. CLASSIFICATION RESULTS ARE THRESHOLDED TO CLASSIFY EACH PIXEL INTO TWO CLASSES: VESSEL AND NONVESSEL.
DOMAIN: IEEE TRANSACTIONS ON SERVICE COMPUTING WITH DESCRIPTION CODE J1SR01 PROJECT TITLES YEAR SERVICE REDUNDANCY FOR CRITICAL TASKS AND BY PLANNING 2011 FOR CONTINGENCIES IN THIS PROJECT, WE DEVELOP A NOVEL ALGORITHM THAT ALLOWS SERVICE CONSUMERS TO EXECUTE BUSINESS PROCESSES (OR WORKFLOWS) OF INTERDEPENDENT SERVICES IN A DEPENDABLE MANNER WITHIN TIGHT TIME-CONSTRAINTS. FIRST, OUR APPROACH RESERVE ONLY PART OF A WORKFLOW AT A TIME AND ADAPTS ITS DECISIONS AT RUNTIME, MAKING THE STRATEGY MORE ROBUST AND DEPENDABLE IN UNCERTAIN ENVIRONMENTS.

Ieee Java 2011-2012

Transféré par

Informations du document

Description originale:

Titre original

Copyright

Formats disponibles

Partager ce document

Partager ou intégrer le document

Options de partage

Avez-vous trouvé ce document utile ?

Ce contenu est-il inapproprié ?

Droits d'auteur :

Formats disponibles

Ieee Java 2011-2012

Transféré par

Droits d'auteur :

Formats disponibles

BLUECHIP TECHNOLOGIES

DOMAIN CODE J1MC01

Vous aimerez peut-être aussi