data
dict |
|---|
{
"proceeding": {
"id": "12OmNrIJqwt",
"title": "2013 IEEE 13th International Conference on Data Mining Workshops (ICDMW)",
"acronym": "icdmw",
"groupId": "1001620",
"volume": "0",
"displayVolume": "0",
"year": "2013",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNwvVrM0",
"doi": "10.1109/ICDMW.2013.65",
"title": "Understanding Service Quality and Customer Churn by Process Discovery for a Multi-National Banking Contact Center",
"normalizedTitle": "Understanding Service Quality and Customer Churn by Process Discovery for a Multi-National Banking Contact Center",
"abstract": "Churning of the customer base is always a top issue in Banking. It is directly related to recurrent revenue, and the ever increasing acquisition costs for new customers. In a first approach, this issue is related to both the quality of service (which is mainly in the front-office, say the contact center) and the speed of service, which is mainly in the back-office. Many studies published to date on this required manual data collection. This creates in general two concerns: worker behavior may change under observation, and manual data collection is expensive and often error prone. In this paper it is shown by means of a case study for a Multi-National Bank (with 5000 employees in the back office) how automated Business Process Discovery, which is an advanced type of process mining, makes it possible to handle the above concerns. The automated data collection and the analysis, in terms of Hidden Markov Models, are key elements. Several results regarding the quality and speed of service have been obtained. Most interesting was the discovery of deeper root causes for customer attrition. Once the deficiencies in the processes are identified, appropriate process improvements can be designed and simulated based on the models emerging from process discovery. In this case study, significant quality and speed improvements as well as customer churn reductions have been obtained.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Churning of the customer base is always a top issue in Banking. It is directly related to recurrent revenue, and the ever increasing acquisition costs for new customers. In a first approach, this issue is related to both the quality of service (which is mainly in the front-office, say the contact center) and the speed of service, which is mainly in the back-office. Many studies published to date on this required manual data collection. This creates in general two concerns: worker behavior may change under observation, and manual data collection is expensive and often error prone. In this paper it is shown by means of a case study for a Multi-National Bank (with 5000 employees in the back office) how automated Business Process Discovery, which is an advanced type of process mining, makes it possible to handle the above concerns. The automated data collection and the analysis, in terms of Hidden Markov Models, are key elements. Several results regarding the quality and speed of service have been obtained. Most interesting was the discovery of deeper root causes for customer attrition. Once the deficiencies in the processes are identified, appropriate process improvements can be designed and simulated based on the models emerging from process discovery. In this case study, significant quality and speed improvements as well as customer churn reductions have been obtained.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Churning of the customer base is always a top issue in Banking. It is directly related to recurrent revenue, and the ever increasing acquisition costs for new customers. In a first approach, this issue is related to both the quality of service (which is mainly in the front-office, say the contact center) and the speed of service, which is mainly in the back-office. Many studies published to date on this required manual data collection. This creates in general two concerns: worker behavior may change under observation, and manual data collection is expensive and often error prone. In this paper it is shown by means of a case study for a Multi-National Bank (with 5000 employees in the back office) how automated Business Process Discovery, which is an advanced type of process mining, makes it possible to handle the above concerns. The automated data collection and the analysis, in terms of Hidden Markov Models, are key elements. Several results regarding the quality and speed of service have been obtained. Most interesting was the discovery of deeper root causes for customer attrition. Once the deficiencies in the processes are identified, appropriate process improvements can be designed and simulated based on the models emerging from process discovery. In this case study, significant quality and speed improvements as well as customer churn reductions have been obtained.",
"fno": "3143a228",
"keywords": [
"Banking",
"Business Data Processing",
"Customer Services",
"Data Mining",
"Hidden Markov Models",
"Quality Of Service",
"Process Discovery",
"Multinational Banking Contact Center",
"Customer Base Churning",
"Acquisition Costs",
"Quality Of Service",
"Manual Data Collection",
"Worker Behavior",
"Automated Business Process Discovery",
"Process Mining",
"Automated Data Collection",
"Automated Data Analysis",
"Hidden Markov Models",
"Deeper Root Discovery",
"Customer Attrition",
"Customer Churn Reductions",
"Hidden Markov Models",
"Customer Satisfaction",
"Banking",
"Manuals",
"Productivity",
"Data Collection",
"Custumer Churn",
"Process Discovery",
"Quality Of Service",
"Process Improvement"
],
"authors": [
{
"affiliation": "OpenConnect Syst. Inc., Dallas, TX, USA",
"fullName": "Edward M.L. Peters",
"givenName": "Edward M.L.",
"surname": "Peters",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Fac. of Bus. & Econ., KU Leuven, Leuven, Belgium",
"fullName": "Guido Dedene",
"givenName": "Guido",
"surname": "Dedene",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Data Discovery Sci. BVBA, Zemst, Belgium",
"fullName": "Jonas Poelmans",
"givenName": "Jonas",
"surname": "Poelmans",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "icdmw",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2013-12-01T00:00:00",
"pubType": "proceedings",
"pages": "228-233",
"year": "2013",
"issn": "2375-9232",
"isbn": "978-1-4799-3142-2",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "3143a219",
"articleId": "12OmNwtn3sz",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "3143a234",
"articleId": "12OmNBhHtcp",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/acsat/2013/2758/0/2758a538",
"title": "Impact of Service Quality on Internet Banking Customer Satisfaction: A Review of Literature",
"doi": null,
"abstractUrl": "/proceedings-article/acsat/2013/2758a538/12OmNAnuTDw",
"parentPublication": {
"id": "proceedings/acsat/2013/2758/0",
"title": "2013 International Conference on Advanced Computer Science Applications and Technologies (ACSAT)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icebe/2012/4809/0/4809a039",
"title": "An Empirical Study of Customer Loyalty to Internet Banking in China",
"doi": null,
"abstractUrl": "/proceedings-article/icebe/2012/4809a039/12OmNB7LvJ5",
"parentPublication": {
"id": "proceedings/icebe/2012/4809/0",
"title": "2012 IEEE Ninth International Conference on e-Business Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/itng/2011/4367/0/4367a845",
"title": "An Analysis of Customer Contribution in a Bank",
"doi": null,
"abstractUrl": "/proceedings-article/itng/2011/4367a845/12OmNvHGrzA",
"parentPublication": {
"id": "proceedings/itng/2011/4367/0",
"title": "Information Technology: New Generations, Third International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/hicss/2002/1435/7/14350186",
"title": "Internet Banking: A Customer-Centric Perspective",
"doi": null,
"abstractUrl": "/proceedings-article/hicss/2002/14350186/12OmNwDACBk",
"parentPublication": {
"id": "proceedings/hicss/2002/1435/7",
"title": "Proceedings of the 35th Annual Hawaii International Conference on System Sciences",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icicta/2015/7644/0/7644b022",
"title": "The Research of the Property Service Enterprise's Innovation Based on the Customer Relationship Management Theory",
"doi": null,
"abstractUrl": "/proceedings-article/icicta/2015/7644b022/12OmNx5Yv65",
"parentPublication": {
"id": "proceedings/icicta/2015/7644/0",
"title": "2015 8th International Conference on Intelligent Computation Technology and Automation (ICICTA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/hpcc-css-icess/2015/8937/0/07336140",
"title": "Customer Churn Aware Resource Allocation and Virtual Machine Placement in Cloud",
"doi": null,
"abstractUrl": "/proceedings-article/hpcc-css-icess/2015/07336140/12OmNxX3uIb",
"parentPublication": {
"id": "proceedings/hpcc-css-icess/2015/8937/0",
"title": "2015 IEEE 17th International Conference on High Performance Computing and Communications (HPCC), 2015 IEEE 7th International Symposium on Cyberspace Safety and Security (CSS) and 2015 IEEE 12th International Conf on Embedded Software and Systems (ICESS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ijcss/2012/4731/0/4731a115",
"title": "Does Back-Office Employee Satisfaction Affect Customer Satisfaction? An Empirical Examination",
"doi": null,
"abstractUrl": "/proceedings-article/ijcss/2012/4731a115/12OmNybfr9O",
"parentPublication": {
"id": "proceedings/ijcss/2012/4731/0",
"title": "Service Sciences, International Joint Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icedeg/2018/2521/0/08372374",
"title": "A Survey on Customer Satisfaction in National Electronic ID User Support",
"doi": null,
"abstractUrl": "/proceedings-article/icedeg/2018/08372374/12OmNywxlPL",
"parentPublication": {
"id": "proceedings/icedeg/2018/2521/0",
"title": "2018 Fifth International Conference on eDemocracy & eGovernment (ICEDEG)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icie/2010/4080/1/05571126",
"title": "Study on Service Response Logistics in Retail Banking Based on E-Commerce",
"doi": null,
"abstractUrl": "/proceedings-article/icie/2010/05571126/13bd1fHrlRU",
"parentPublication": {
"id": "proceedings/icie/2010/4080/1",
"title": "Information Engineering, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/asonam/2020/1056/0/09381429",
"title": "Analysing Digital Banking Reviews Using Text Mining",
"doi": null,
"abstractUrl": "/proceedings-article/asonam/2020/09381429/1semIyudiLu",
"parentPublication": {
"id": "proceedings/asonam/2020/1056/0",
"title": "2020 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNx3q6UL",
"title": "2008 International Conference on Risk Management & Engineering Management",
"acronym": "icrmem",
"groupId": "1002694",
"volume": "0",
"displayVolume": "0",
"year": "2008",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNzC5Tc5",
"doi": "10.1109/ICRMEM.2008.82",
"title": "User Acceptance of Internet Banking in an Uncertain and Risky Environment",
"normalizedTitle": "User Acceptance of Internet Banking in an Uncertain and Risky Environment",
"abstract": "Internet is expected to be especially beneficial to the banking industry. As more and more financial institutions are finding ways to utilize Internet technologies to launch online banking services, an important issue is to understand what factors will impact the decisions of customers in adopting such services. Based on the UTAUT model, the D&M IS success model, and the concept of trust, this paper presents an integrated model to investigate user acceptance of Internet banking in an uncertain and risky environment. Empirically, we analyze an extensive dataset, a sample of 413 respondents; and the results strongly support our model. A momentous conclusion is that user acceptance of Internet banking is highly influenced by perceived risk and perceived uncertainty.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Internet is expected to be especially beneficial to the banking industry. As more and more financial institutions are finding ways to utilize Internet technologies to launch online banking services, an important issue is to understand what factors will impact the decisions of customers in adopting such services. Based on the UTAUT model, the D&M IS success model, and the concept of trust, this paper presents an integrated model to investigate user acceptance of Internet banking in an uncertain and risky environment. Empirically, we analyze an extensive dataset, a sample of 413 respondents; and the results strongly support our model. A momentous conclusion is that user acceptance of Internet banking is highly influenced by perceived risk and perceived uncertainty.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Internet is expected to be especially beneficial to the banking industry. As more and more financial institutions are finding ways to utilize Internet technologies to launch online banking services, an important issue is to understand what factors will impact the decisions of customers in adopting such services. Based on the UTAUT model, the D&M IS success model, and the concept of trust, this paper presents an integrated model to investigate user acceptance of Internet banking in an uncertain and risky environment. Empirically, we analyze an extensive dataset, a sample of 413 respondents; and the results strongly support our model. A momentous conclusion is that user acceptance of Internet banking is highly influenced by perceived risk and perceived uncertainty.",
"fno": "3402a381",
"keywords": [
"Internet Banking",
"User Acceptance",
"Perceived Risk",
"Perceived Uncertainty",
"Trust Perception"
],
"authors": [
{
"affiliation": null,
"fullName": "Gang Liu",
"givenName": "Gang",
"surname": "Liu",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Su-Ping Huang",
"givenName": "Su-Ping",
"surname": "Huang",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Xin-Kai Zhu",
"givenName": "Xin-Kai",
"surname": "Zhu",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "icrmem",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2008-11-01T00:00:00",
"pubType": "proceedings",
"pages": "381-386",
"year": "2008",
"issn": null,
"isbn": "978-0-7695-3402-2",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "3402a466",
"articleId": "12OmNBtl1ul",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "3402a472",
"articleId": "12OmNz61cWj",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/icebe/2012/4809/0/4809a039",
"title": "An Empirical Study of Customer Loyalty to Internet Banking in China",
"doi": null,
"abstractUrl": "/proceedings-article/icebe/2012/4809a039/12OmNB7LvJ5",
"parentPublication": {
"id": "proceedings/icebe/2012/4809/0",
"title": "2012 IEEE Ninth International Conference on e-Business Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/mines/2010/4258/0/4258a264",
"title": "Customer Adoption of Internet Banking: An Integration of TAM with Trust, Perceived Risk, and Quality",
"doi": null,
"abstractUrl": "/proceedings-article/mines/2010/4258a264/12OmNqAU6x8",
"parentPublication": {
"id": "proceedings/mines/2010/4258/0",
"title": "Multimedia Information Networking and Security, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pci/2010/4172/0/4172a180",
"title": "A Study on User Behavior and Acceptance of Electronic Banking Services",
"doi": null,
"abstractUrl": "/proceedings-article/pci/2010/4172a180/12OmNqJZgHd",
"parentPublication": {
"id": "proceedings/pci/2010/4172/0",
"title": "2010 14th Panhellenic Conference on Informatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ssme/2009/3729/0/3729a242",
"title": "Applying E-S-QUAL Scale to Analysis the Factors Affecting Consumers to Use Internet Banking Services",
"doi": null,
"abstractUrl": "/proceedings-article/ssme/2009/3729a242/12OmNrIaemi",
"parentPublication": {
"id": "proceedings/ssme/2009/3729/0",
"title": "2009 IITA International Conference on Services Science, Management and Engineering (SSME)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/hicss/2013/4892/0/4892e666",
"title": "Factors Affecting Internet Banking Pre-usage Expectation Formation",
"doi": null,
"abstractUrl": "/proceedings-article/hicss/2013/4892e666/12OmNrIrPtM",
"parentPublication": {
"id": "proceedings/hicss/2013/4892/0",
"title": "2013 46th Hawaii International Conference on System Sciences",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/amige/2008/3694/0/04721462",
"title": "On Determinants of User Acceptance of Internet Banking: A Theoretical Framework and Empirical Study",
"doi": null,
"abstractUrl": "/proceedings-article/amige/2008/04721462/12OmNs4S8Ja",
"parentPublication": {
"id": "proceedings/amige/2008/3694/0",
"title": "2008 IEEE Symposium on Advanced Management of Information for Globalized Enterprises, AMIGE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/itng/2009/3596/0/3596b637",
"title": "Extending the Technology Acceptance Model for Internet Banking: A Case Study of Iran",
"doi": null,
"abstractUrl": "/proceedings-article/itng/2009/3596b637/12OmNx5pj4k",
"parentPublication": {
"id": "proceedings/itng/2009/3596/0",
"title": "Information Technology: New Generations, Third International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icmb/2011/4434/0/4434a205",
"title": "Mobile Banking Adoption by Under-Banked Communities in the United States: Adapting Mobile Banking Features from Low-Income Countries",
"doi": null,
"abstractUrl": "/proceedings-article/icmb/2011/4434a205/12OmNyxXlyN",
"parentPublication": {
"id": "proceedings/icmb/2011/4434/0",
"title": "Mobile Business, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icebe/2013/5111/0/5111a282",
"title": "Adoption of Internet Banking: An Empirical Study in Vietnam",
"doi": null,
"abstractUrl": "/proceedings-article/icebe/2013/5111a282/12OmNzVoBuj",
"parentPublication": {
"id": "proceedings/icebe/2013/5111/0",
"title": "2013 IEEE 10th International Conference on e-Business Engineering (ICEBE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccis/2011/4501/0/4501a434",
"title": "An Empirical Model of Individual Mobile Banking Acceptance in China",
"doi": null,
"abstractUrl": "/proceedings-article/iccis/2011/4501a434/12OmNzXnNxv",
"parentPublication": {
"id": "proceedings/iccis/2011/4501/0",
"title": "2011 International Conference on Computational and Information Sciences",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "1s645BaTzVu",
"title": "2020 IEEE International Conference on Big Data (Big Data)",
"acronym": "big-data",
"groupId": "1802964",
"volume": "0",
"displayVolume": "0",
"year": "2020",
"__typename": "ProceedingType"
},
"article": {
"id": "1s64vJFILJe",
"doi": "10.1109/BigData50022.2020.9378483",
"title": "Large-scale Data-driven Segmentation of Banking Customers",
"normalizedTitle": "Large-scale Data-driven Segmentation of Banking Customers",
"abstract": "This paper presents a novel big data analytics framework for creating explainable personas for retail and business banking customers. These personas are essential to better tailor financial products and improve customer retention. This framework is comprised of several components including anomaly detection, binning and aggregation of contextual data, clustering of transaction time series, and mining association rules that map contextual data to cluster identifiers. Leveraging rich transaction and contextual data available from nearly 60,000 retail and 90,000 business customers of a financial institution, we empirically evaluate this framework and describe how the identified association rules can be used to explain and refine existing customer classes, and identify new customer classes and various data quality issues. We also analyze the performance of the proposed framework and show that it can easily scale to millions of banking customers.",
"abstracts": [
{
"abstractType": "Regular",
"content": "This paper presents a novel big data analytics framework for creating explainable personas for retail and business banking customers. These personas are essential to better tailor financial products and improve customer retention. This framework is comprised of several components including anomaly detection, binning and aggregation of contextual data, clustering of transaction time series, and mining association rules that map contextual data to cluster identifiers. Leveraging rich transaction and contextual data available from nearly 60,000 retail and 90,000 business customers of a financial institution, we empirically evaluate this framework and describe how the identified association rules can be used to explain and refine existing customer classes, and identify new customer classes and various data quality issues. We also analyze the performance of the proposed framework and show that it can easily scale to millions of banking customers.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "This paper presents a novel big data analytics framework for creating explainable personas for retail and business banking customers. These personas are essential to better tailor financial products and improve customer retention. This framework is comprised of several components including anomaly detection, binning and aggregation of contextual data, clustering of transaction time series, and mining association rules that map contextual data to cluster identifiers. Leveraging rich transaction and contextual data available from nearly 60,000 retail and 90,000 business customers of a financial institution, we empirically evaluate this framework and describe how the identified association rules can be used to explain and refine existing customer classes, and identify new customer classes and various data quality issues. We also analyze the performance of the proposed framework and show that it can easily scale to millions of banking customers.",
"fno": "09378483",
"keywords": [
"Big Data",
"Data Analysis",
"Data Mining",
"Retailing",
"Time Series",
"Retail Business Banking Customers",
"Tailor Financial Products",
"Customer Retention",
"Binning",
"Aggregation",
"Contextual Data",
"Transaction Time Series",
"Cluster Identifiers",
"60 Business Customers",
"000 Retail Business Customers",
"90 Business Customers",
"000 Business Customers",
"Identified Association Rules",
"Existing Customer Classes",
"Data Quality Issues",
"Scale Data Driven Segmentation",
"Big Data Analytics Framework",
"Explainable Personas",
"Data Integrity",
"Conferences",
"Time Series Analysis",
"Banking",
"Big Data",
"Anomaly Detection",
"Business",
"Customer Segmentation",
"Clustering",
"Association Rules Mining",
"Anomaly Detection"
],
"authors": [
{
"affiliation": "University of Alberta,Edmonton,AB,Canada",
"fullName": "Md Monir Hossain",
"givenName": "Md Monir",
"surname": "Hossain",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "ATB Financial,Calgary,AB,Canada",
"fullName": "Mark Sebestyen",
"givenName": "Mark",
"surname": "Sebestyen",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "ATB Financial,Calgary,AB,Canada",
"fullName": "Dhruv Mayank",
"givenName": "Dhruv",
"surname": "Mayank",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "University of Alberta,Edmonton,AB,Canada",
"fullName": "Omid Ardakanian",
"givenName": "Omid",
"surname": "Ardakanian",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "York University,Toronto,ON,Canada",
"fullName": "Hamzeh Khazaei",
"givenName": "Hamzeh",
"surname": "Khazaei",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "big-data",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2020-12-01T00:00:00",
"pubType": "proceedings",
"pages": "4392-4401",
"year": "2020",
"issn": null,
"isbn": "978-1-7281-6251-5",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "09378134",
"articleId": "1s64oFWyBsQ",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09378137",
"articleId": "1s64oKyoFrO",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/avss/2007/1695/0/04425345",
"title": "What are customers looking at?",
"doi": null,
"abstractUrl": "/proceedings-article/avss/2007/04425345/12OmNA0vnZX",
"parentPublication": {
"id": "proceedings/avss/2007/1695/0",
"title": "2007 IEEE Conference on Advanced Video and Signal Based Surveillance, AVSS 2007",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/hicss/2002/1435/7/14350185b",
"title": "An Evaluation of Internet Banking in New Zealand",
"doi": null,
"abstractUrl": "/proceedings-article/hicss/2002/14350185b/12OmNAQrYCJ",
"parentPublication": {
"id": "proceedings/hicss/2002/1435/7",
"title": "Proceedings of the 35th Annual Hawaii International Conference on System Sciences",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/hicss/2013/4892/0/4892b310",
"title": "Customers Waiting in Front of a Retail Store",
"doi": null,
"abstractUrl": "/proceedings-article/hicss/2013/4892b310/12OmNrNh0Qq",
"parentPublication": {
"id": "proceedings/hicss/2013/4892/0",
"title": "2013 46th Hawaii International Conference on System Sciences",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/hicss/2002/1435/7/14350186",
"title": "Internet Banking: A Customer-Centric Perspective",
"doi": null,
"abstractUrl": "/proceedings-article/hicss/2002/14350186/12OmNwDACBk",
"parentPublication": {
"id": "proceedings/hicss/2002/1435/7",
"title": "Proceedings of the 35th Annual Hawaii International Conference on System Sciences",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdm/2006/2701/0/04053050",
"title": "Personalization in Context: Does Context Matter When Building Personalized Customer Models?",
"doi": null,
"abstractUrl": "/proceedings-article/icdm/2006/04053050/12OmNy1SFEq",
"parentPublication": {
"id": "proceedings/icdm/2006/2701/0",
"title": "Sixth International Conference on Data Mining (ICDM'06)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icitcs/2013/2845/0/06717857",
"title": "Mobile Core-Banking Server: Cashless, Branchless and Wireless Retail Banking for the Mass Market",
"doi": null,
"abstractUrl": "/proceedings-article/icitcs/2013/06717857/12OmNy2Jt0P",
"parentPublication": {
"id": "proceedings/icitcs/2013/2845/0",
"title": "2013 International Conference on IT Convergence and Security (ICITCS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wi/2016/4470/0/4470a449",
"title": "Generic Framework to Predict Repeat Behavior of Customers Using Their Transaction History",
"doi": null,
"abstractUrl": "/proceedings-article/wi/2016/4470a449/12OmNybfqUv",
"parentPublication": {
"id": "proceedings/wi/2016/4470/0",
"title": "2016 IEEE/WIC/ACM International Conference on Web Intelligence (WI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icie/2010/4080/1/05571126",
"title": "Study on Service Response Logistics in Retail Banking Based on E-Commerce",
"doi": null,
"abstractUrl": "/proceedings-article/icie/2010/05571126/13bd1fHrlRU",
"parentPublication": {
"id": "proceedings/icie/2010/4080/1",
"title": "Information Engineering, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2008/11/ttk2008111535",
"title": "Using Context to Improve Predictive Modeling of Customers in Personalization Applications",
"doi": null,
"abstractUrl": "/journal/tk/2008/11/ttk2008111535/13rRUwI5TRq",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icste/2022/6355/0/635500a103",
"title": "Utilizing Unsupervised kNN on Customer Risk Assessment for Banking",
"doi": null,
"abstractUrl": "/proceedings-article/icste/2022/635500a103/1LKwhYZK77i",
"parentPublication": {
"id": "proceedings/icste/2022/6355/0",
"title": "2022 12th International Conference on Software Technology and Engineering (ICSTE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "1uGYtvXFOyQ",
"title": "2020 International Conference on Computational Science and Computational Intelligence (CSCI)",
"acronym": "csci",
"groupId": "1803739",
"volume": "0",
"displayVolume": "0",
"year": "2020",
"__typename": "ProceedingType"
},
"article": {
"id": "1uGYTbZvdzq",
"doi": "10.1109/CSCI51800.2020.00090",
"title": "Large scale data mining for banking credit risk prediction",
"normalizedTitle": "Large scale data mining for banking credit risk prediction",
"abstract": "To become compliant with changing and stricter regulatory demands in the world, banks are focused on undertaking preventive measures for effective credit risk management. One of its drivers is to strengthen existing models to increase their predictive powers and help detect future defaults in advance. In this paper, we propose a new evaluation method to improve the overall performance of learning algorithms in the field of over-indebtedness prediction by using feature selection. Our objective is to find the most relevant subset of features related to the customer banking history for use in prediction model construction. Experimental results have shown that the proposed evaluation method is very useful to build a good predictor.",
"abstracts": [
{
"abstractType": "Regular",
"content": "To become compliant with changing and stricter regulatory demands in the world, banks are focused on undertaking preventive measures for effective credit risk management. One of its drivers is to strengthen existing models to increase their predictive powers and help detect future defaults in advance. In this paper, we propose a new evaluation method to improve the overall performance of learning algorithms in the field of over-indebtedness prediction by using feature selection. Our objective is to find the most relevant subset of features related to the customer banking history for use in prediction model construction. Experimental results have shown that the proposed evaluation method is very useful to build a good predictor.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "To become compliant with changing and stricter regulatory demands in the world, banks are focused on undertaking preventive measures for effective credit risk management. One of its drivers is to strengthen existing models to increase their predictive powers and help detect future defaults in advance. In this paper, we propose a new evaluation method to improve the overall performance of learning algorithms in the field of over-indebtedness prediction by using feature selection. Our objective is to find the most relevant subset of features related to the customer banking history for use in prediction model construction. Experimental results have shown that the proposed evaluation method is very useful to build a good predictor.",
"fno": "762400a498",
"keywords": [
"Bank Data Processing",
"Banking",
"Credit Transactions",
"Data Mining",
"Financial Management",
"Learning Artificial Intelligence",
"Risk Analysis",
"Risk Management",
"Scale Data Mining",
"Credit Risk Prediction",
"Changing Demands",
"Stricter Regulatory Demands",
"Undertaking Preventive Measures",
"Effective Credit Risk Management",
"Predictive Powers",
"Future Defaults",
"Evaluation Method",
"Over Indebtedness Prediction",
"Feature Selection",
"Customer Banking History",
"Prediction Model Construction",
"Scientific Computing",
"Computational Modeling",
"Banking",
"Predictive Models",
"Prediction Algorithms",
"Feature Extraction",
"Data Models",
"Data Mining",
"Machine Learning",
"Supervised Learning",
"Feature Selection",
"Predictive Analytics"
],
"authors": [
{
"affiliation": "Imam Abdulrahman Bin Faisal University,Deanship of Preparatory Year and Supporting Studies,Computer Science Department,Dammam,Saudi Arabia",
"fullName": "Suleiman Ali AlSaif",
"givenName": "Suleiman Ali",
"surname": "AlSaif",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "csci",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2020-12-01T00:00:00",
"pubType": "proceedings",
"pages": "498-503",
"year": "2020",
"issn": null,
"isbn": "978-1-7281-7624-6",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "762400a492",
"articleId": "1uGZ5xaFw2c",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "762400a504",
"articleId": "1uGYTLXrXqg",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/icicic/2007/2882/0/28820211",
"title": "A Novel Prediction Model for Credit Card Risk Management",
"doi": null,
"abstractUrl": "/proceedings-article/icicic/2007/28820211/12OmNqFJhO7",
"parentPublication": {
"id": "proceedings/icicic/2007/2882/0",
"title": "2007 Second International Conference on Innovative Computing, Information and Control",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/aiccsa/2014/7100/0/07073270",
"title": "Online risk assessment and prediction models for Autonomic Cloud Intrusion srevention systems",
"doi": null,
"abstractUrl": "/proceedings-article/aiccsa/2014/07073270/12OmNqJq4A5",
"parentPublication": {
"id": "proceedings/aiccsa/2014/7100/0",
"title": "2014 IEEE/ACS 11th International Conference on Computer Systems and Applications (AICCSA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdmw/2016/5910/0/07836716",
"title": "Data Mining Based Product Marketing Technique for Banking Products",
"doi": null,
"abstractUrl": "/proceedings-article/icdmw/2016/07836716/12OmNvDI3Uc",
"parentPublication": {
"id": "proceedings/icdmw/2016/5910/0",
"title": "2016 IEEE 16th International Conference on Data Mining Workshops (ICDMW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icde/2013/4909/0/06544910",
"title": "Pipe failure prediction: A data mining method",
"doi": null,
"abstractUrl": "/proceedings-article/icde/2013/06544910/12OmNyOHG3X",
"parentPublication": {
"id": "proceedings/icde/2013/4909/0",
"title": "2013 29th IEEE International Conference on Data Engineering (ICDE 2013)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/mlbdbi/2021/1790/0/179000a123",
"title": "Credit Default Risk Prediction of Lenders with Resampling Methods",
"doi": null,
"abstractUrl": "/proceedings-article/mlbdbi/2021/179000a123/1BQiwa209kA",
"parentPublication": {
"id": "proceedings/mlbdbi/2021/1790/0",
"title": "2021 3rd International Conference on Machine Learning, Big Data and Business Intelligence (MLBDBI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccsmt/2021/2063/0/206300a154",
"title": "Study on Credit Default Risk Prediction Model Based on BP-RF Neural Network",
"doi": null,
"abstractUrl": "/proceedings-article/iccsmt/2021/206300a154/1E2w62qApR6",
"parentPublication": {
"id": "proceedings/iccsmt/2021/2063/0",
"title": "2021 2nd International Conference on Computer Science and Management Technology (ICCSMT)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/isaiam/2022/8541/0/854100a128",
"title": "Research on Bank Credit Risk Assessment Model based on artificial intelligence algorithm",
"doi": null,
"abstractUrl": "/proceedings-article/isaiam/2022/854100a128/1MTTdXcXAOc",
"parentPublication": {
"id": "proceedings/isaiam/2022/8541/0",
"title": "2022 2nd International Symposium on Artificial Intelligence and its Application on Media (ISAIAM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bibe/2020/9574/0/957400a859",
"title": "An explainable XGBoost–based approach towards assessing the risk of cardiovascular disease in patients with Type 2 Diabetes Mellitus",
"doi": null,
"abstractUrl": "/proceedings-article/bibe/2020/957400a859/1pBMxQULjc4",
"parentPublication": {
"id": "proceedings/bibe/2020/9574/0",
"title": "2020 IEEE 20th International Conference on Bioinformatics and Bioengineering (BIBE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vast/2020/8009/0/800900a084",
"title": "iConViz: Interactive Visual Exploration of the Default Contagion Risk of Networked-Guarantee Loans",
"doi": null,
"abstractUrl": "/proceedings-article/vast/2020/800900a084/1q7jvCEjsxG",
"parentPublication": {
"id": "proceedings/vast/2020/8009/0",
"title": "2020 IEEE Conference on Visual Analytics Science and Technology (VAST)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdmw/2020/9012/0/901200a362",
"title": "A federated learning based approach for loan defaults prediction",
"doi": null,
"abstractUrl": "/proceedings-article/icdmw/2020/901200a362/1rgGjHRMBpK",
"parentPublication": {
"id": "proceedings/icdmw/2020/9012/0",
"title": "2020 International Conference on Data Mining Workshops (ICDMW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNyfdOIO",
"title": "2008 IEEE Symposium on Computers and Communications",
"acronym": "iscc",
"groupId": "1000156",
"volume": "0",
"displayVolume": "0",
"year": "2008",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNAio6Zu",
"doi": "10.1109/ISCC.2008.4625601",
"title": "Searching nearest neighbor in overlay network",
"normalizedTitle": "Searching nearest neighbor in overlay network",
"abstract": "For overlay network, the mismatch between logical network and underlying physical network could cause a high number of substrate hops resulting in increased delay and network traffic, as well as degrade performance of application significantly. Thus selecting the nearest neighbor for each node in terms of network latency, will bridge this gap efficiently. In this paper, we present a novel approach to search nearest neighbor in overlay network, which combines distance prediction using network coordinate and round-trip time measurements to generate proximity information, achieving both efficiency and accuracy. Our proposal can be used to improve the performance of many large scale distributed applications like network-aware overlay construction and selection of nearby resource in the network.",
"abstracts": [
{
"abstractType": "Regular",
"content": "For overlay network, the mismatch between logical network and underlying physical network could cause a high number of substrate hops resulting in increased delay and network traffic, as well as degrade performance of application significantly. Thus selecting the nearest neighbor for each node in terms of network latency, will bridge this gap efficiently. In this paper, we present a novel approach to search nearest neighbor in overlay network, which combines distance prediction using network coordinate and round-trip time measurements to generate proximity information, achieving both efficiency and accuracy. Our proposal can be used to improve the performance of many large scale distributed applications like network-aware overlay construction and selection of nearby resource in the network.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "For overlay network, the mismatch between logical network and underlying physical network could cause a high number of substrate hops resulting in increased delay and network traffic, as well as degrade performance of application significantly. Thus selecting the nearest neighbor for each node in terms of network latency, will bridge this gap efficiently. In this paper, we present a novel approach to search nearest neighbor in overlay network, which combines distance prediction using network coordinate and round-trip time measurements to generate proximity information, achieving both efficiency and accuracy. Our proposal can be used to improve the performance of many large scale distributed applications like network-aware overlay construction and selection of nearby resource in the network.",
"fno": "04625601",
"keywords": [
"Computer Networks",
"Telecommunication Network Topology",
"Telecommunication Traffic",
"Overlay Network",
"Logical Network",
"Physical Network",
"Delay",
"Network Traffic",
"Distance Prediction",
"Network Coordinate",
"Round Trip Time Measurements",
"Information Proximity",
"Network Aware Overlay Construction",
"Network Selection",
"Network Topology",
"Internet",
"Accuracy",
"Distance Measurement",
"Nearest Neighbor Searches",
"Peer To Peer Computing",
"Economic Indicators",
"Network Topology",
"Coordinate Measuring Machines"
],
"authors": [
{
"affiliation": "State Key Laboratory of Software Development Environment, Beihang University, Beijing , China 100083",
"fullName": "Tan Chen",
"givenName": null,
"surname": "Tan Chen",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "School of Computer Science and Engineering, Zhengzhou University of Light Industry, China",
"fullName": "Xin Xiong",
"givenName": null,
"surname": "Xin Xiong",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "iscc",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2008-07-01T00:00:00",
"pubType": "proceedings",
"pages": "",
"year": "2008",
"issn": "1530-1346",
"isbn": "978-1-4244-2702-4",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "04625600",
"articleId": "12OmNwE9Ou7",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "04625602",
"articleId": "12OmNxecRZ8",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/icde/2001/1001/0/10010503",
"title": "Approximate Nearest Neighbor Searching in Multimedia Databases",
"doi": null,
"abstractUrl": "/proceedings-article/icde/2001/10010503/12OmNANTAs0",
"parentPublication": {
"id": "proceedings/icde/2001/1001/0",
"title": "Proceedings 17th International Conference on Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/fmpc/1992/2772/0/00234890",
"title": "Automatic data distribution for nearest neighbor networks",
"doi": null,
"abstractUrl": "/proceedings-article/fmpc/1992/00234890/12OmNAP1YYv",
"parentPublication": {
"id": "proceedings/fmpc/1992/2772/0",
"title": "The Fourth Symposium on the Frontiers of Massively Parallel Computation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/his/2009/3745/2/3745b445",
"title": "A P2P Overlay Network Routing Algorithm Based on Group-Average Agglomerative Clustering Topology",
"doi": null,
"abstractUrl": "/proceedings-article/his/2009/3745b445/12OmNB0X8xa",
"parentPublication": {
"id": "proceedings/his/2009/3745/2",
"title": "Hybrid Intelligent Systems, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icris/2018/6580/0/658001a501",
"title": "Searching Continuous Nearest Neighbor in Transport Network",
"doi": null,
"abstractUrl": "/proceedings-article/icris/2018/658001a501/12OmNwE9OQi",
"parentPublication": {
"id": "proceedings/icris/2018/6580/0",
"title": "2018 International Conference on Robots & Intelligent System (ICRIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/snpd/2016/2239/0/07515874",
"title": "Projection search for approximate nearest neighbor",
"doi": null,
"abstractUrl": "/proceedings-article/snpd/2016/07515874/12OmNwwd2NU",
"parentPublication": {
"id": "proceedings/snpd/2016/2239/0",
"title": "2016 17th IEEE/ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing (SNPD)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/dsc/2017/1600/0/1600a140",
"title": "A Network Coordinate System Constructing Algorithm Based on Optimal Neighbor Nodes",
"doi": null,
"abstractUrl": "/proceedings-article/dsc/2017/1600a140/12OmNyKa63r",
"parentPublication": {
"id": "proceedings/dsc/2017/1600/0",
"title": "2017 IEEE Second International Conference on Data Science in Cyberspace (DSC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2012/2216/0/06460749",
"title": "A Pyramid Nearest Neighbor Search Kernel for object categorization",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2012/06460749/12OmNyoSbdL",
"parentPublication": {
"id": "proceedings/icpr/2012/2216/0",
"title": "2012 21st International Conference on Pattern Recognition (ICPR 2012)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/nbis/2014/4224/0/4224a615",
"title": "A Simple Routing Method for Reverse k-Nearest Neighbor Queries in Spatial Networks",
"doi": null,
"abstractUrl": "/proceedings-article/nbis/2014/4224a615/12OmNyrIaAH",
"parentPublication": {
"id": "proceedings/nbis/2014/4224/0",
"title": "2014 17th International Conference on Network-Based Information Systems (NBiS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2014/04/06509375",
"title": "Fast Nearest Neighbor Search with Keywords",
"doi": null,
"abstractUrl": "/journal/tk/2014/04/06509375/13rRUwInvtb",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2016/10/07517340",
"title": "The Moving Z_$K$_Z Diversified Nearest Neighbor Query",
"doi": null,
"abstractUrl": "/journal/tk/2016/10/07517340/13rRUyp7tXk",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNqH9hnv",
"title": "2010 9th IEEE International Conference on Cognitive Informatics (ICCI)",
"acronym": "coginf",
"groupId": "1000097",
"volume": "0",
"displayVolume": "0",
"year": "2010",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNC8dgf6",
"doi": "10.1109/COGINF.2010.5599779",
"title": "Modeling Gestalt laws for classification",
"normalizedTitle": "Modeling Gestalt laws for classification",
"abstract": "The k-nearest neighbors classifier is simple and often results in good classification performance on problems with unknown and non-normal distributions. However, its selected nearest neighbors on noisy, sparse, or imbalanced data are often inconsistent with our intuition and in turn leads to the worse performance. This paper applies Gestalt visual perceptual laws to design a new KNN classifie r. It applies the neighborhood relation between any two data points to construct the geometry shape of data and then applies the Gestalt laws on this shape to perform the classification. The conducted experiments on challenging benchmark real data validate the proposed approach.",
"abstracts": [
{
"abstractType": "Regular",
"content": "The k-nearest neighbors classifier is simple and often results in good classification performance on problems with unknown and non-normal distributions. However, its selected nearest neighbors on noisy, sparse, or imbalanced data are often inconsistent with our intuition and in turn leads to the worse performance. This paper applies Gestalt visual perceptual laws to design a new KNN classifie r. It applies the neighborhood relation between any two data points to construct the geometry shape of data and then applies the Gestalt laws on this shape to perform the classification. The conducted experiments on challenging benchmark real data validate the proposed approach.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "The k-nearest neighbors classifier is simple and often results in good classification performance on problems with unknown and non-normal distributions. However, its selected nearest neighbors on noisy, sparse, or imbalanced data are often inconsistent with our intuition and in turn leads to the worse performance. This paper applies Gestalt visual perceptual laws to design a new KNN classifie r. It applies the neighborhood relation between any two data points to construct the geometry shape of data and then applies the Gestalt laws on this shape to perform the classification. The conducted experiments on challenging benchmark real data validate the proposed approach.",
"fno": "05599779",
"keywords": [
"Computational Geometry",
"Learning Artificial Intelligence",
"Pattern Classification",
"Visual Perception",
"K Nearest Neighbors Classifier",
"Nonnormal Distributions",
"Imbalanced Data",
"Gestalt Visual Perceptual Laws",
"KNN Classifier",
"Neighborhood Relation",
"Geometry Shape Construction",
"Real Data Validation",
"Classification",
"Nearest Neighbor Searches",
"Strontium",
"Shape",
"Visualization",
"Training",
"Accuracy",
"Robustness",
"Classification",
"Gestalt Laws",
"Cognitive Geom Etry",
"Nearest Neighbors"
],
"authors": [
{
"affiliation": "South China University of Technology Guangzhou 510641, China",
"fullName": "Guihua Wen",
"givenName": "Guihua",
"surname": "Wen",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "South China University of Technology Guangzhou 510641, China",
"fullName": "Xingjiang Pan",
"givenName": "Xingjiang",
"surname": "Pan",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "South China University of Technology Guangzhou 510641, China",
"fullName": "Lijun Jiang",
"givenName": "Lijun",
"surname": "Jiang",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Hubei Institute for Nationalities Ensi 445400, China",
"fullName": "Jun Wen",
"givenName": "Jun",
"surname": "Wen",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "coginf",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2010-07-01T00:00:00",
"pubType": "proceedings",
"pages": "914-918",
"year": "2010",
"issn": null,
"isbn": "978-1-4244-8042-5",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "05599782",
"articleId": "12OmNyL0THL",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "05599780",
"articleId": "12OmNzR8CxX",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/gcc/2010/4313/0/4313a052",
"title": "A New Classification Algorithm Using Mutual Nearest Neighbors",
"doi": null,
"abstractUrl": "/proceedings-article/gcc/2010/4313a052/12OmNAS9zzh",
"parentPublication": {
"id": "proceedings/gcc/2010/4313/0",
"title": "Grid and Cloud Computing, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sisap/2009/3765/0/3765a091",
"title": "Approximate Direct and Reverse Nearest Neighbor Queries, and the k-nearest Neighbor Graph",
"doi": null,
"abstractUrl": "/proceedings-article/sisap/2009/3765a091/12OmNBuL1a6",
"parentPublication": {
"id": "proceedings/sisap/2009/3765/0",
"title": "Similarity Search and Applications, International Workshop on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icde/2017/6543/0/6543a031",
"title": "The Moving K Diversified Nearest Neighbor Query",
"doi": null,
"abstractUrl": "/proceedings-article/icde/2017/6543a031/12OmNrAMEU7",
"parentPublication": {
"id": "proceedings/icde/2017/6543/0",
"title": "2017 IEEE 33rd International Conference on Data Engineering (ICDE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cbd/2013/3261/0/3261a181",
"title": "Large Scale Nearest Neighbors Search Based on Neighborhood Graph",
"doi": null,
"abstractUrl": "/proceedings-article/cbd/2013/3261a181/12OmNwwd2Pd",
"parentPublication": {
"id": "proceedings/cbd/2013/3261/0",
"title": "2013 International Conference on Advanced Cloud and Big Data (CBD)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/taai/2010/4253/0/4253a387",
"title": "A Mixture Approach for Multi-Label Document Classification",
"doi": null,
"abstractUrl": "/proceedings-article/taai/2010/4253a387/12OmNxj23cy",
"parentPublication": {
"id": "proceedings/taai/2010/4253/0",
"title": "2010 International Conference on Technologies and Applications of Artificial Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2012/2216/0/06460749",
"title": "A Pyramid Nearest Neighbor Search Kernel for object categorization",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2012/06460749/12OmNyoSbdL",
"parentPublication": {
"id": "proceedings/icpr/2012/2216/0",
"title": "2012 21st International Conference on Pattern Recognition (ICPR 2012)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icicis/2011/1561/0/06063312",
"title": "An Approximate Nearest Neighbor Query Algorithm Based on Hilbert Curve",
"doi": null,
"abstractUrl": "/proceedings-article/icicis/2011/06063312/12OmNyugyLg",
"parentPublication": {
"id": "proceedings/icicis/2011/1561/0",
"title": "2011 International Conference on Internet Computing and Information Services (ICICIS 2011)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/aiccsa/2003/7983/0/01227559",
"title": "Early-halting criteria for instance-based learning",
"doi": null,
"abstractUrl": "/proceedings-article/aiccsa/2003/01227559/12OmNzayNjf",
"parentPublication": {
"id": "proceedings/aiccsa/2003/7983/0",
"title": "ACS/IEEE International Conference on Computer Systems and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/1999/11/i1170",
"title": "Embedding Gestalt Laws in Markov Random Fields",
"doi": null,
"abstractUrl": "/journal/tp/1999/11/i1170/13rRUy0qnHo",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2016/10/07517340",
"title": "The Moving Z_$K$_Z Diversified Nearest Neighbor Query",
"doi": null,
"abstractUrl": "/journal/tk/2016/10/07517340/13rRUyp7tXk",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNx8wTfL",
"title": "ICPR 2008 19th International Conference on Pattern Recognition",
"acronym": "icpr",
"groupId": "1000545",
"volume": "0",
"displayVolume": "0",
"year": "2008",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNrIaem4",
"doi": "10.1109/ICPR.2008.4761711",
"title": "Memory efficient recognition of specific objects with local features",
"normalizedTitle": "Memory efficient recognition of specific objects with local features",
"abstract": "Balancing the recognition rate, processing time and memory requirement is an important issue for object recognition based on local features. For the task of recognizing not generic but specific objects (object instances), a larger number of local features enable us to improve the recognition rate but pose a problem of processing time and memory requirement. For the problem of processing time, approximate nearest neighbor search is known to be extremely effective. In this paper, we propose a method of memory reduction by applying scalar quantization to local features. From experimental results on 100,000 images, we have found that the scalar quantization is of great help; As compared to the original representation with 16 bit/dimension, the recognition rate of 98.1 % was kept unchanged using the representation with 2 bit/dim.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Balancing the recognition rate, processing time and memory requirement is an important issue for object recognition based on local features. For the task of recognizing not generic but specific objects (object instances), a larger number of local features enable us to improve the recognition rate but pose a problem of processing time and memory requirement. For the problem of processing time, approximate nearest neighbor search is known to be extremely effective. In this paper, we propose a method of memory reduction by applying scalar quantization to local features. From experimental results on 100,000 images, we have found that the scalar quantization is of great help; As compared to the original representation with 16 bit/dimension, the recognition rate of 98.1 % was kept unchanged using the representation with 2 bit/dim.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Balancing the recognition rate, processing time and memory requirement is an important issue for object recognition based on local features. For the task of recognizing not generic but specific objects (object instances), a larger number of local features enable us to improve the recognition rate but pose a problem of processing time and memory requirement. For the problem of processing time, approximate nearest neighbor search is known to be extremely effective. In this paper, we propose a method of memory reduction by applying scalar quantization to local features. From experimental results on 100,000 images, we have found that the scalar quantization is of great help; As compared to the original representation with 16 bit/dimension, the recognition rate of 98.1 % was kept unchanged using the representation with 2 bit/dim.",
"fno": "04761711",
"keywords": [
"Approximation Theory",
"Image Coding",
"Object Recognition",
"Search Problems",
"Object Recognition",
"Memory Efficient Recognition",
"Local Feature",
"Approximate Nearest Neighbor Search",
"Memory Reduction",
"Scalar Quantization",
"Quantization",
"Object Recognition",
"Nearest Neighbor Searches",
"Image Recognition"
],
"authors": [
{
"affiliation": "Dept. of Computer Science and Intelligent Systems, Graduate School of Engineering, Osaka Prefecture University, Japan",
"fullName": "Koichi Kise",
"givenName": "Koichi",
"surname": "Kise",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Dept. of Computer Science and Intelligent Systems, Graduate School of Engineering, Osaka Prefecture University, Japan",
"fullName": "Kazuto Noguchi",
"givenName": "Kazuto",
"surname": "Noguchi",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Dept. of Computer Science and Intelligent Systems, Graduate School of Engineering, Osaka Prefecture University, Japan",
"fullName": "Masakazu Iwamura",
"givenName": "Masakazu",
"surname": "Iwamura",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "icpr",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2008-12-01T00:00:00",
"pubType": "proceedings",
"pages": "",
"year": "2008",
"issn": "1051-4651",
"isbn": "978-1-4244-2174-9",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "04761710",
"articleId": "12OmNznkJVn",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "04761712",
"articleId": "12OmNArbG60",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/icpr/2008/2174/0/04761816",
"title": "Learning vector quantization with local subspace classifier",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2008/04761816/12OmNqAU6Dq",
"parentPublication": {
"id": "proceedings/icpr/2008/2174/0",
"title": "ICPR 2008 19th International Conference on Pattern Recognition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdar/2007/2822/2/28221028",
"title": "Elastic Matching of Online Handwritten Tamil and Telugu Scripts Using Local Features",
"doi": null,
"abstractUrl": "/proceedings-article/icdar/2007/28221028/12OmNqJHFu4",
"parentPublication": {
"id": "proceedings/icdar/2007/2822/2",
"title": "Ninth International Conference on Document Analysis and Recognition (ICDAR 2007)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sbac-pad/2017/1233/0/1233a153",
"title": "Online Multimedia Similarity Search with Response Time-Aware Parallelism and Task Granularity Auto-Tuning",
"doi": null,
"abstractUrl": "/proceedings-article/sbac-pad/2017/1233a153/12OmNvsm6yn",
"parentPublication": {
"id": "proceedings/sbac-pad/2017/1233/0",
"title": "2017 29th International Symposium on Computer Architecture and High Performance Computing (SBAC-PAD)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccvw/2009/4442/0/05457543",
"title": "Robust and efficient recognition of low-quality images by cascaded recognizers with massive local features",
"doi": null,
"abstractUrl": "/proceedings-article/iccvw/2009/05457543/12OmNyQYt56",
"parentPublication": {
"id": "proceedings/iccvw/2009/4442/0",
"title": "2009 IEEE 12th International Conference on Computer Vision Workshops, ICCV Workshops",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2016/8851/0/8851c027",
"title": "Efficient Large-Scale Approximate Nearest Neighbor Search on the GPU",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2016/8851c027/12OmNyRPgO6",
"parentPublication": {
"id": "proceedings/cvpr/2016/8851/0",
"title": "2016 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icmla/2016/6167/0/07838279",
"title": "Fast Nearest Neighbor Search with Transformed Residual Quantization",
"doi": null,
"abstractUrl": "/proceedings-article/icmla/2016/07838279/12OmNzUPpf8",
"parentPublication": {
"id": "proceedings/icmla/2016/6167/0",
"title": "2016 15th IEEE International Conference on Machine Learning and Applications (ICMLA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccvw/2009/4442/0/05457544",
"title": "Compressed representation of feature vectors using a Bloomier filter and its application to specific object recognition",
"doi": null,
"abstractUrl": "/proceedings-article/iccvw/2009/05457544/12OmNzuZUCz",
"parentPublication": {
"id": "proceedings/iccvw/2009/4442/0",
"title": "2009 IEEE 12th International Conference on Computer Vision Workshops, ICCV Workshops",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2016/11/07539664",
"title": "Competitive Quantization for Approximate Nearest Neighbor Search",
"doi": null,
"abstractUrl": "/journal/tk/2016/11/07539664/13rRUNvyatG",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2015/06/06915715",
"title": "The Inverted Multi-Index",
"doi": null,
"abstractUrl": "/journal/tp/2015/06/06915715/13rRUxC0Sx8",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2014/12/06858078",
"title": "Extremely Low Bit-Rate Nearest Neighbor Search Using a Set Compression Tree",
"doi": null,
"abstractUrl": "/journal/tp/2014/12/06858078/13rRUxlgxXF",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNyUWQRh",
"title": "2015 IEEE International Conference on Cloud Engineering (IC2E)",
"acronym": "ic2e",
"groupId": "1802690",
"volume": "0",
"displayVolume": "0",
"year": "2015",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNrY3Lxt",
"doi": "10.1109/IC2E.2015.99",
"title": "Compressed Hierarchical Bitmaps for Efficiently Processing Different Query Workloads",
"normalizedTitle": "Compressed Hierarchical Bitmaps for Efficiently Processing Different Query Workloads",
"abstract": "Today the amount of data that is being processed is growing manyfold. Fast and scalable data processing systems are the need of the hour because of the data deluge. Indexing is a very common mechanism used in data processing systems for fast and efficient search of the data. In many systems, the I/O needed to read and fetch the relevant part of the index into the main memory dominates the overall query processing cost. My research is focused on reducing this I/O cost by effective indexing algorithms. I have particularly focused on using bitmap indices, which are a very efficient indexing mechanism particularly used in data warehouse environments due to their high compressibility and ability to perform bitwise operations even on compressed bitmaps. Column-store architecture is preferred in such environments because of their ability to leverage bitmap indices. Column domains are often hierarchical in nature, and hence using hierarchical bitmap indices is often beneficial. I have designed algorithms for choosing a subset of these hierarchical bitmap indices for 1D as well as spatial data in order to execute range query workloads for various different scenarios. I have shown experimentally that these solutions are very efficient and scalable. Currently, I am focusing on leveraging hierarchical bitmap indices to solve approximate nearest neighbor queries.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Today the amount of data that is being processed is growing manyfold. Fast and scalable data processing systems are the need of the hour because of the data deluge. Indexing is a very common mechanism used in data processing systems for fast and efficient search of the data. In many systems, the I/O needed to read and fetch the relevant part of the index into the main memory dominates the overall query processing cost. My research is focused on reducing this I/O cost by effective indexing algorithms. I have particularly focused on using bitmap indices, which are a very efficient indexing mechanism particularly used in data warehouse environments due to their high compressibility and ability to perform bitwise operations even on compressed bitmaps. Column-store architecture is preferred in such environments because of their ability to leverage bitmap indices. Column domains are often hierarchical in nature, and hence using hierarchical bitmap indices is often beneficial. I have designed algorithms for choosing a subset of these hierarchical bitmap indices for 1D as well as spatial data in order to execute range query workloads for various different scenarios. I have shown experimentally that these solutions are very efficient and scalable. Currently, I am focusing on leveraging hierarchical bitmap indices to solve approximate nearest neighbor queries.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Today the amount of data that is being processed is growing manyfold. Fast and scalable data processing systems are the need of the hour because of the data deluge. Indexing is a very common mechanism used in data processing systems for fast and efficient search of the data. In many systems, the I/O needed to read and fetch the relevant part of the index into the main memory dominates the overall query processing cost. My research is focused on reducing this I/O cost by effective indexing algorithms. I have particularly focused on using bitmap indices, which are a very efficient indexing mechanism particularly used in data warehouse environments due to their high compressibility and ability to perform bitwise operations even on compressed bitmaps. Column-store architecture is preferred in such environments because of their ability to leverage bitmap indices. Column domains are often hierarchical in nature, and hence using hierarchical bitmap indices is often beneficial. I have designed algorithms for choosing a subset of these hierarchical bitmap indices for 1D as well as spatial data in order to execute range query workloads for various different scenarios. I have shown experimentally that these solutions are very efficient and scalable. Currently, I am focusing on leveraging hierarchical bitmap indices to solve approximate nearest neighbor queries.",
"fno": "8218a508",
"keywords": [
"Spatial Databases",
"Query Processing",
"Nearest Neighbor Searches",
"Indexing",
"Data Processing",
"Multimedia Communication"
],
"authors": [
{
"affiliation": null,
"fullName": "Parth Nagarkar",
"givenName": "Parth",
"surname": "Nagarkar",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "ic2e",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2015-03-01T00:00:00",
"pubType": "proceedings",
"pages": "508-510",
"year": "2015",
"issn": null,
"isbn": "978-1-4799-8218-9",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "8218a505",
"articleId": "12OmNB7LvAi",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "8218a511",
"articleId": "12OmNCbkQDx",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/icde/2007/0802/0/04221664",
"title": "Efficiently Processing Continuous k-NN Queries on Data Streams",
"doi": null,
"abstractUrl": "/proceedings-article/icde/2007/04221664/12OmNC8dgmn",
"parentPublication": {
"id": "proceedings/icde/2007/0802/0",
"title": "2007 IEEE 23rd International Conference on Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/csse/2008/3336/4/3336g519",
"title": "Indexing Method for Hyperspectral Data Fast Retrieval by Pyramid Technique",
"doi": null,
"abstractUrl": "/proceedings-article/csse/2008/3336g519/12OmNCd2rAx",
"parentPublication": {
"id": "csse/2008/3336/4",
"title": "Computer Science and Software Engineering, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iscc/2009/4672/0/05202326",
"title": "Compact N-tree: an indexing structure for distance range queries",
"doi": null,
"abstractUrl": "/proceedings-article/iscc/2009/05202326/12OmNCgrD6b",
"parentPublication": {
"id": "proceedings/iscc/2009/4672/0",
"title": "2009 IEEE Symposium on Computers and Communications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icme/2004/8603/2/01394325",
"title": "An efficient bitmap indexing method for similarity search in high dimensional multimedia databases",
"doi": null,
"abstractUrl": "/proceedings-article/icme/2004/01394325/12OmNCgrDbm",
"parentPublication": {
"id": "proceedings/icme/2004/8603/2",
"title": "2004 IEEE International Conference on Multimedia and Expo (ICME)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2008/2174/0/04760937",
"title": "3. Similarity searching: Indexing, nearest neighbor finding, dimensionality reduction, and embedding methods for applications in multimedia databases",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2008/04760937/12OmNwnH4UD",
"parentPublication": {
"id": "proceedings/icpr/2008/2174/0",
"title": "ICPR 2008 19th International Conference on Pattern Recognition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cbd/2013/3261/0/3261a181",
"title": "Large Scale Nearest Neighbors Search Based on Neighborhood Graph",
"doi": null,
"abstractUrl": "/proceedings-article/cbd/2013/3261a181/12OmNwwd2Pd",
"parentPublication": {
"id": "proceedings/cbd/2013/3261/0",
"title": "2013 International Conference on Advanced Cloud and Big Data (CBD)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ispan-fcst-iscc/2017/0840/0/0840a046",
"title": "Grid-Based Indexing and Search Algorithms for Large-Scale and High-Dimensional Data",
"doi": null,
"abstractUrl": "/proceedings-article/ispan-fcst-iscc/2017/0840a046/12OmNz6iOo7",
"parentPublication": {
"id": "proceedings/ispan-fcst-iscc/2017/0840/0",
"title": "2017 14th International Symposium on Pervasive Systems, Algorithms and Networks & 2017 11th International Conference on Frontier of Computer Science and Technology & 2017 Third International Symposium of Creative Computing (ISPAN-FCST-ISCC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2005/2766/0/01532792",
"title": "Query-driven visualization of large data sets",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2005/01532792/12OmNzYNN5Q",
"parentPublication": {
"id": "proceedings/ieee-vis/2005/2766/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2015/06/06915715",
"title": "The Inverted Multi-Index",
"doi": null,
"abstractUrl": "/journal/tp/2015/06/06915715/13rRUxC0Sx8",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2022/08/09383170",
"title": "High Dimensional Similarity Search With Satellite System Graph: Efficiency, Scalability, and Unindexed Query Compatibility",
"doi": null,
"abstractUrl": "/journal/tp/2022/08/09383170/1scDmWFpx3W",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNAJVcFw",
"title": "2010 22nd IEEE International Conference on Tools with Artificial Intelligence",
"acronym": "ictai",
"groupId": "1000763",
"volume": "1",
"displayVolume": "1",
"year": "2010",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNvrdI2t",
"doi": "10.1109/ICTAI.2010.11",
"title": "Active Learning for Semi-Supervised K-Means Clustering",
"normalizedTitle": "Active Learning for Semi-Supervised K-Means Clustering",
"abstract": "K-Means algorithm is one of the most used clustering algorithm for Knowledge Discovery in Data Mining. Seed based K-Means is the integration of a small set of labeled data (called seeds) to the K-Means algorithm to improve its performances and overcome its sensitivity to initial centers. These centers are, most of the time, generated at random or they are assumed to be available for each cluster. This paper introduces a new efficient algorithm for active seeds selection which relies on a Min-Max approach that favors the coverage of the whole dataset. Experiments conducted on artificial and real datasets show that, using our active seeds selection algorithm, each cluster contains at least one seed after a very small number of queries and thus helps reducing the number of iterations until convergence which is crucial in many KDD applications.",
"abstracts": [
{
"abstractType": "Regular",
"content": "K-Means algorithm is one of the most used clustering algorithm for Knowledge Discovery in Data Mining. Seed based K-Means is the integration of a small set of labeled data (called seeds) to the K-Means algorithm to improve its performances and overcome its sensitivity to initial centers. These centers are, most of the time, generated at random or they are assumed to be available for each cluster. This paper introduces a new efficient algorithm for active seeds selection which relies on a Min-Max approach that favors the coverage of the whole dataset. Experiments conducted on artificial and real datasets show that, using our active seeds selection algorithm, each cluster contains at least one seed after a very small number of queries and thus helps reducing the number of iterations until convergence which is crucial in many KDD applications.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "K-Means algorithm is one of the most used clustering algorithm for Knowledge Discovery in Data Mining. Seed based K-Means is the integration of a small set of labeled data (called seeds) to the K-Means algorithm to improve its performances and overcome its sensitivity to initial centers. These centers are, most of the time, generated at random or they are assumed to be available for each cluster. This paper introduces a new efficient algorithm for active seeds selection which relies on a Min-Max approach that favors the coverage of the whole dataset. Experiments conducted on artificial and real datasets show that, using our active seeds selection algorithm, each cluster contains at least one seed after a very small number of queries and thus helps reducing the number of iterations until convergence which is crucial in many KDD applications.",
"fno": "05670014",
"keywords": [
"Data Mining",
"Learning Artificial Intelligence",
"Pattern Clustering",
"Active Learning",
"Semi Supervised K Means Clustering",
"Knowledge Discovery Algorithm",
"Seed Based K Means Clustering",
"Data Mining",
"Min Max Approach",
"Clustering Algorithms",
"Convergence",
"Complexity Theory",
"Equations",
"Data Mining",
"Nearest Neighbor Searches",
"Semi Supervied Clustering",
"Active Learning",
"Seed"
],
"authors": [
{
"affiliation": null,
"fullName": "Viet-Vu Vu",
"givenName": "Viet-Vu",
"surname": "Vu",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Nicolas Labroche",
"givenName": "Nicolas",
"surname": "Labroche",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Bernadette Bouchon-Meunier",
"givenName": "Bernadette",
"surname": "Bouchon-Meunier",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "ictai",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2010-10-01T00:00:00",
"pubType": "proceedings",
"pages": "12-15",
"year": "2010",
"issn": "1082-3409",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "05670009",
"articleId": "12OmNBEpnBs",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "05670011",
"articleId": "12OmNxw5Br0",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/icpr/2006/2521/3/252130198",
"title": "A Generalized K-Means Algorithm with Semi-Supervised Weight Coefficients",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2006/252130198/12OmNAXPy3E",
"parentPublication": {
"id": "proceedings/icpr/2006/2521/3",
"title": "2006 18th International Conference on Pattern Recognition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icmlc/2003/7865/5/01260141",
"title": "A quick evidential classification algorithm based on k-nearest neighbor rule",
"doi": null,
"abstractUrl": "/proceedings-article/icmlc/2003/01260141/12OmNBKmXid",
"parentPublication": {
"id": "proceedings/icmlc/2003/7865/1",
"title": "Proceedings of the 2003 International Conference on Machine Learning and Cybernetics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdma/2012/4772/0/4772a759",
"title": "Semi-supervised Clustering Based on K-Nearest Neighbors",
"doi": null,
"abstractUrl": "/proceedings-article/icdma/2012/4772a759/12OmNqJZgEq",
"parentPublication": {
"id": "proceedings/icdma/2012/4772/0",
"title": "2012 Third International Conference on Digital Manufacturing & Automation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/apcip/2009/3699/2/3699b410",
"title": "Global Optimization for Semi-supervised K-means",
"doi": null,
"abstractUrl": "/proceedings-article/apcip/2009/3699b410/12OmNvAAtBF",
"parentPublication": {
"id": "proceedings/apcip/2009/3699/1",
"title": "Information Processing, Asia-Pacific Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cloudcom/2013/5095/1/5095a017",
"title": "Competitive K-Means, a New Accurate and Distributed K-Means Algorithm for Large Datasets",
"doi": null,
"abstractUrl": "/proceedings-article/cloudcom/2013/5095a017/12OmNwAbqv1",
"parentPublication": {
"id": "proceedings/cloudcom/2013/5095/1",
"title": "2013 IEEE 5th International Conference on Cloud Computing Technology and Science (CloudCom)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bdcloud-socialcom-sustaincom/2016/3936/0/3936a242",
"title": "K*-Means: An Effective and Efficient K-Means Clustering Algorithm",
"doi": null,
"abstractUrl": "/proceedings-article/bdcloud-socialcom-sustaincom/2016/3936a242/12OmNxwENGN",
"parentPublication": {
"id": "proceedings/bdcloud-socialcom-sustaincom/2016/3936/0",
"title": "2016 IEEE International Conferences on Big Data and Cloud Computing (BDCloud), Social Computing and Networking (SocialCom), Sustainable Computing and Communications (SustainCom) (BDCloud-SocialCom-SustainCom)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2008/2174/0/04761253",
"title": "Categorization using semi-supervised clustering",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2008/04761253/12OmNzE54wd",
"parentPublication": {
"id": "proceedings/icpr/2008/2174/0",
"title": "ICPR 2008 19th International Conference on Pattern Recognition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bife/2009/3705/0/3705a237",
"title": "An Enhancement of K-means Clustering Algorithm",
"doi": null,
"abstractUrl": "/proceedings-article/bife/2009/3705a237/12OmNzGlRHi",
"parentPublication": {
"id": "proceedings/bife/2009/3705/0",
"title": "2009 International Conference on Business Intelligence and Financial Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2002/07/i0881",
"title": "An Efficient k-Means Clustering Algorithm: Analysis and Implementation",
"doi": null,
"abstractUrl": "/journal/tp/2002/07/i0881/13rRUxASu1L",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2016/10/07517340",
"title": "The Moving Z_$K$_Z Diversified Nearest Neighbor Query",
"doi": null,
"abstractUrl": "/journal/tk/2016/10/07517340/13rRUyp7tXk",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNxV4itG",
"title": "2017 29th International Symposium on Computer Architecture and High Performance Computing (SBAC-PAD)",
"acronym": "sbac-pad",
"groupId": "1001139",
"volume": "0",
"displayVolume": "0",
"year": "2017",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNvsm6yn",
"doi": "10.1109/SBAC-PAD.2017.27",
"title": "Online Multimedia Similarity Search with Response Time-Aware Parallelism and Task Granularity Auto-Tuning",
"normalizedTitle": "Online Multimedia Similarity Search with Response Time-Aware Parallelism and Task Granularity Auto-Tuning",
"abstract": "This paper presents an efficient parallel implementation of the Product Quantization based approximate nearest neighbor multimedia similarity search indexing (PQANNS). The parallel PQANNS efficiently answers nearest neighbor queries by exploiting the ability of the quantization approach to reduce the data dimensionality (and memory demand) and by leveraging parallelism to speed up the search capabilities of the application. Our solution is also optimized to minimize query response times under scenarios with fluctuating query rates (load) as observed in online services. To achieve this goal, we have developed strategies to dynamically select the parallelism configuration and task granularity that minimizes the query response times during the execution. The proposed strategies (ADAPT and ADAPT+G) were thoroughly evaluated and have shown, for instance, to reduce the query response times in 6.4× as compared to the best static configuration of parallelism and task granularity.",
"abstracts": [
{
"abstractType": "Regular",
"content": "This paper presents an efficient parallel implementation of the Product Quantization based approximate nearest neighbor multimedia similarity search indexing (PQANNS). The parallel PQANNS efficiently answers nearest neighbor queries by exploiting the ability of the quantization approach to reduce the data dimensionality (and memory demand) and by leveraging parallelism to speed up the search capabilities of the application. Our solution is also optimized to minimize query response times under scenarios with fluctuating query rates (load) as observed in online services. To achieve this goal, we have developed strategies to dynamically select the parallelism configuration and task granularity that minimizes the query response times during the execution. The proposed strategies (ADAPT and ADAPT+G) were thoroughly evaluated and have shown, for instance, to reduce the query response times in 6.4× as compared to the best static configuration of parallelism and task granularity.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "This paper presents an efficient parallel implementation of the Product Quantization based approximate nearest neighbor multimedia similarity search indexing (PQANNS). The parallel PQANNS efficiently answers nearest neighbor queries by exploiting the ability of the quantization approach to reduce the data dimensionality (and memory demand) and by leveraging parallelism to speed up the search capabilities of the application. Our solution is also optimized to minimize query response times under scenarios with fluctuating query rates (load) as observed in online services. To achieve this goal, we have developed strategies to dynamically select the parallelism configuration and task granularity that minimizes the query response times during the execution. The proposed strategies (ADAPT and ADAPT+G) were thoroughly evaluated and have shown, for instance, to reduce the query response times in 6.4× as compared to the best static configuration of parallelism and task granularity.",
"fno": "1233a153",
"keywords": [
"Approximation Theory",
"Data Reduction",
"Database Indexing",
"Minimisation",
"Multimedia Databases",
"Parallel Processing",
"Query Processing",
"Online Multimedia Similarity Search",
"Response Time Aware Parallelism",
"Parallel PQANNS",
"Quantization Approach",
"Parallelism Configuration",
"Parallel Implementation",
"Data Dimensionality Reduction",
"Task Granularity Autotuning",
"Product Quantization Based Approximate Nearest Neighbor Multimedia Similarity Search Indexing",
"Nearest Neighbor Queries Answering",
"Query Response Times Minimization",
"Parallel Processing",
"Quantization Signal",
"Time Factors",
"Multimedia Communication",
"Databases",
"Nearest Neighbor Searches",
"Nearest Neighbor Searchm Product Quantizationm Adaptive Parallelism",
"Auto Tuning",
"Task Based Runtime"
],
"authors": [
{
"affiliation": null,
"fullName": "Guilherme Andrade",
"givenName": "Guilherme",
"surname": "Andrade",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "George Teodoro",
"givenName": "George",
"surname": "Teodoro",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Renato Ferreira",
"givenName": "Renato",
"surname": "Ferreira",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "sbac-pad",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2017-10-01T00:00:00",
"pubType": "proceedings",
"pages": "153-160",
"year": "2017",
"issn": null,
"isbn": "978-1-5090-1233-6",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "1233a145",
"articleId": "12OmNAIdBQY",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "1233a161",
"articleId": "12OmNzkuKEP",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/mdm/2014/5705/1/5705a023",
"title": "A*-based Solutions for KNN Queries with Operating Time Constraints in Time-Dependent Road Networks",
"doi": null,
"abstractUrl": "/proceedings-article/mdm/2014/5705a023/12OmNBPtJCM",
"parentPublication": {
"id": "proceedings/mdm/2014/5705/2",
"title": "2014 15th IEEE International Conference on Mobile Data Management (MDM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bigcom/2017/3349/0/3349a122",
"title": "SCPIR-V: An Optimized CPIR-V Algorithm for Privacy Protection Nearest Neighbor Query",
"doi": null,
"abstractUrl": "/proceedings-article/bigcom/2017/3349a122/12OmNqC2v0l",
"parentPublication": {
"id": "proceedings/bigcom/2017/3349/0",
"title": "2017 3rd International Conference on Big Data Computing and Communications (BIGCOM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2008/2174/0/04761711",
"title": "Memory efficient recognition of specific objects with local features",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2008/04761711/12OmNrIaem4",
"parentPublication": {
"id": "proceedings/icpr/2008/2174/0",
"title": "ICPR 2008 19th International Conference on Pattern Recognition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ic2e/2015/8218/0/8218a508",
"title": "Compressed Hierarchical Bitmaps for Efficiently Processing Different Query Workloads",
"doi": null,
"abstractUrl": "/proceedings-article/ic2e/2015/8218a508/12OmNrY3Lxt",
"parentPublication": {
"id": "proceedings/ic2e/2015/8218/0",
"title": "2015 IEEE International Conference on Cloud Engineering (IC2E)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/fccm/2011/4301/0/4301a178",
"title": "Multilevel Granularity Parallelism Synthesis on FPGAs",
"doi": null,
"abstractUrl": "/proceedings-article/fccm/2011/4301a178/12OmNs0TKJF",
"parentPublication": {
"id": "proceedings/fccm/2011/4301/0",
"title": "Field-Programmable Custom Computing Machines, Annual IEEE Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/mdm/2010/4048/0/4048a115",
"title": "Efficient Evaluation of k-Range Nearest Neighbor Queries in Road Networks",
"doi": null,
"abstractUrl": "/proceedings-article/mdm/2010/4048a115/12OmNvA1hcd",
"parentPublication": {
"id": "proceedings/mdm/2010/4048/0",
"title": "2010 Eleventh International Conference on Mobile Data Management",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2008/2174/0/04760937",
"title": "3. Similarity searching: Indexing, nearest neighbor finding, dimensionality reduction, and embedding methods for applications in multimedia databases",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2008/04760937/12OmNwnH4UD",
"parentPublication": {
"id": "proceedings/icpr/2008/2174/0",
"title": "ICPR 2008 19th International Conference on Pattern Recognition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ispa/2014/4293/0/4293a248",
"title": "GPGPU Implementation of Nearest Neighbor Search with Product Quantization",
"doi": null,
"abstractUrl": "/proceedings-article/ispa/2014/4293a248/12OmNym2bSH",
"parentPublication": {
"id": "proceedings/ispa/2014/4293/0",
"title": "2014 IEEE International Symposium on Parallel and Distributed Processing with Applications (ISPA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2018/04/07915742",
"title": "A Survey on Learning to Hash",
"doi": null,
"abstractUrl": "/journal/tp/2018/04/07915742/13rRUILLkwD",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2014/04/06509375",
"title": "Fast Nearest Neighbor Search with Keywords",
"doi": null,
"abstractUrl": "/journal/tk/2014/04/06509375/13rRUwInvtb",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNx8wTfL",
"title": "ICPR 2008 19th International Conference on Pattern Recognition",
"acronym": "icpr",
"groupId": "1000545",
"volume": "0",
"displayVolume": "0",
"year": "2008",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNwnH4UD",
"doi": "10.1109/ICPR.2008.4760937",
"title": "3. Similarity searching: Indexing, nearest neighbor finding, dimensionality reduction, and embedding methods for applications in multimedia databases",
"normalizedTitle": "3. Similarity searching: Indexing, nearest neighbor finding, dimensionality reduction, and embedding methods for applications in multimedia databases",
"abstract": "Similarity searching is usually achieved by means of nearest neighbor finding. Existing methods for handling similarity search in this setting fall into one of two classes. The first is based on mapping to a low-dimensional vector space which is then indexed using representations such as k-d trees, R-trees, quadtrees, etc. The second directly indexes the the objects based on distances using representations such as the vp-tree, M-tree, etc. Mapping from a high-dimensional space into a low-dimensional space is known as dimensionality reduction and is achieved using SVD, DFT, etc. At times, when we just have distance information, the data objects are embedded in a vector space so that the distances of the embedded objects as measured by the distance metric in the embedding space approximate the actual distance. The search in the embedding space uses conventional indexing methods which are often coupled with dimensionality reduction. Some commonly known embedding methods are multidimensional scaling, Lipschitz embeddings, and Fast Map. This tutorial is organized into five parts that cover the five basic concepts outlined above: indexing low and high dimensional spaces, distance-based indexing, dimensionality reduction, embedding methods, and nearest neighbor searching.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Similarity searching is usually achieved by means of nearest neighbor finding. Existing methods for handling similarity search in this setting fall into one of two classes. The first is based on mapping to a low-dimensional vector space which is then indexed using representations such as k-d trees, R-trees, quadtrees, etc. The second directly indexes the the objects based on distances using representations such as the vp-tree, M-tree, etc. Mapping from a high-dimensional space into a low-dimensional space is known as dimensionality reduction and is achieved using SVD, DFT, etc. At times, when we just have distance information, the data objects are embedded in a vector space so that the distances of the embedded objects as measured by the distance metric in the embedding space approximate the actual distance. The search in the embedding space uses conventional indexing methods which are often coupled with dimensionality reduction. Some commonly known embedding methods are multidimensional scaling, Lipschitz embeddings, and Fast Map. This tutorial is organized into five parts that cover the five basic concepts outlined above: indexing low and high dimensional spaces, distance-based indexing, dimensionality reduction, embedding methods, and nearest neighbor searching.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Similarity searching is usually achieved by means of nearest neighbor finding. Existing methods for handling similarity search in this setting fall into one of two classes. The first is based on mapping to a low-dimensional vector space which is then indexed using representations such as k-d trees, R-trees, quadtrees, etc. The second directly indexes the the objects based on distances using representations such as the vp-tree, M-tree, etc. Mapping from a high-dimensional space into a low-dimensional space is known as dimensionality reduction and is achieved using SVD, DFT, etc. At times, when we just have distance information, the data objects are embedded in a vector space so that the distances of the embedded objects as measured by the distance metric in the embedding space approximate the actual distance. The search in the embedding space uses conventional indexing methods which are often coupled with dimensionality reduction. Some commonly known embedding methods are multidimensional scaling, Lipschitz embeddings, and Fast Map. This tutorial is organized into five parts that cover the five basic concepts outlined above: indexing low and high dimensional spaces, distance-based indexing, dimensionality reduction, embedding methods, and nearest neighbor searching.",
"fno": "04760937",
"keywords": [
"Database Indexing",
"Discrete Fourier Transforms",
"Multimedia Databases",
"Singular Value Decomposition",
"Similarity Searching",
"Nearest Neighbor Finding",
"Multimedia Database",
"Lipschitz Embedding Method",
"Fast Map Embedding",
"Multidimensional Scaling Method",
"Distance Based Indexing",
"SVD",
"DFT",
"Indexing",
"Nearest Neighbor Searches",
"Multimedia Databases",
"Vegetation Mapping",
"Multidimensional Systems"
],
"authors": [
{
"affiliation": "University of Maryland, USA",
"fullName": "Hanan Samet",
"givenName": "Hanan",
"surname": "Samet",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "icpr",
"isOpenAccess": true,
"showRecommendedArticles": true,
"showBuyMe": false,
"hasPdf": true,
"pubDate": "2008-12-01T00:00:00",
"pubType": "proceedings",
"pages": "",
"year": "2008",
"issn": "1051-4651",
"isbn": "978-1-4244-2174-9",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "04760936",
"articleId": "12OmNqzcvDi",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "04760938",
"articleId": "12OmNz5JC9k",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/iscc/2008/2702/0/04625601",
"title": "Searching nearest neighbor in overlay network",
"doi": null,
"abstractUrl": "/proceedings-article/iscc/2008/04625601/12OmNAio6Zu",
"parentPublication": {
"id": "proceedings/iscc/2008/2702/0",
"title": "2008 IEEE Symposium on Computers and Communications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/compsac/2005/2413/1/241310249",
"title": "Nearest Neighbor Queries on Extensible Grid Files Using Dimensionality Reduction",
"doi": null,
"abstractUrl": "/proceedings-article/compsac/2005/241310249/12OmNqzu6Ke",
"parentPublication": {
"id": "proceedings/compsac/2005/2413/1",
"title": "29th Annual International Computer Software and Applications Conference (COMPSAC'05)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icde/2017/6543/0/6543a031",
"title": "The Moving K Diversified Nearest Neighbor Query",
"doi": null,
"abstractUrl": "/proceedings-article/icde/2017/6543a031/12OmNrAMEU7",
"parentPublication": {
"id": "proceedings/icde/2017/6543/0",
"title": "2017 IEEE 33rd International Conference on Data Engineering (ICDE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icmla/2009/3926/0/3926a771",
"title": "Improving Fusion of Dimensionality Reduction Methods for Nearest Neighbor Classification",
"doi": null,
"abstractUrl": "/proceedings-article/icmla/2009/3926a771/12OmNyUWR6J",
"parentPublication": {
"id": "proceedings/icmla/2009/3926/0",
"title": "Machine Learning and Applications, Fourth International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icicis/2011/1561/0/06063312",
"title": "An Approximate Nearest Neighbor Query Algorithm Based on Hilbert Curve",
"doi": null,
"abstractUrl": "/proceedings-article/icicis/2011/06063312/12OmNyugyLg",
"parentPublication": {
"id": "proceedings/icicis/2011/1561/0",
"title": "2011 International Conference on Internet Computing and Information Services (ICICIS 2011)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2001/01/k0096",
"title": "On the 'Dimensionality Curse' and the 'Self-Similarity Blessing'",
"doi": null,
"abstractUrl": "/journal/tk/2001/01/k0096/13rRUEgs2tC",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2008/01/ttp2008010089",
"title": "BoostMap: An Embedding Method for Efficient Nearest Neighbor Retrieval",
"doi": null,
"abstractUrl": "/journal/tp/2008/01/ttp2008010089/13rRUwInvtV",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2014/02/ttp2014020388",
"title": "Trinary-Projection Trees for Approximate Nearest Neighbor Search",
"doi": null,
"abstractUrl": "/journal/tp/2014/02/ttp2014020388/13rRUxAAT2s",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2016/10/07517340",
"title": "The Moving Z_$K$_Z Diversified Nearest Neighbor Query",
"doi": null,
"abstractUrl": "/journal/tk/2016/10/07517340/13rRUyp7tXk",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/big-data/2022/8045/0/10020464",
"title": "Hybrid Approximate Nearest Neighbor Indexing and Search (HANNIS) for Large Descriptor Databases",
"doi": null,
"abstractUrl": "/proceedings-article/big-data/2022/10020464/1KfSTxHm1KU",
"parentPublication": {
"id": "proceedings/big-data/2022/8045/0",
"title": "2022 IEEE International Conference on Big Data (Big Data)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNvAS4s7",
"title": "2017 14th International Symposium on Pervasive Systems, Algorithms and Networks & 2017 11th International Conference on Frontier of Computer Science and Technology & 2017 Third International Symposium of Creative Computing (ISPAN-FCST-ISCC)",
"acronym": "ispan-fcst-iscc",
"groupId": "1000536",
"volume": "0",
"displayVolume": "0",
"year": "2017",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNz6iOo7",
"doi": "10.1109/ISPAN-FCST-ISCC.2017.85",
"title": "Grid-Based Indexing and Search Algorithms for Large-Scale and High-Dimensional Data",
"normalizedTitle": "Grid-Based Indexing and Search Algorithms for Large-Scale and High-Dimensional Data",
"abstract": "The rapid development of Internet has resulted in massive information overloading recently. These information is usually represented by high-dimensional feature vectors in many related applications such as recognition, classification and retrieval. These applications usually need efficient indexing and search methods for such large-scale and high-dimensional database, which typically is a challenging task. Some efforts have been made and solved this problem to some extent. However, most of them are implemented in a single machine, which is not suitable to handle large-scale database.In this paper, we present a novel data index structure and nearest neighbor search algorithm implemented on Apache Spark. We impose a grid on the database and index data by non-empty grid cells. This grid-based index structure is simple and easy to be implemented in parallel. Moreover, we propose to build a scalable KNN graph on the grids, which increase the efficiency of this index structure by a low cost in parallel implementation. Finally, experiments are conducted in both public databases and synthetic databases, showing that the proposed methods achieve overall high performance in both efficiency and accuracy.",
"abstracts": [
{
"abstractType": "Regular",
"content": "The rapid development of Internet has resulted in massive information overloading recently. These information is usually represented by high-dimensional feature vectors in many related applications such as recognition, classification and retrieval. These applications usually need efficient indexing and search methods for such large-scale and high-dimensional database, which typically is a challenging task. Some efforts have been made and solved this problem to some extent. However, most of them are implemented in a single machine, which is not suitable to handle large-scale database.In this paper, we present a novel data index structure and nearest neighbor search algorithm implemented on Apache Spark. We impose a grid on the database and index data by non-empty grid cells. This grid-based index structure is simple and easy to be implemented in parallel. Moreover, we propose to build a scalable KNN graph on the grids, which increase the efficiency of this index structure by a low cost in parallel implementation. Finally, experiments are conducted in both public databases and synthetic databases, showing that the proposed methods achieve overall high performance in both efficiency and accuracy.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "The rapid development of Internet has resulted in massive information overloading recently. These information is usually represented by high-dimensional feature vectors in many related applications such as recognition, classification and retrieval. These applications usually need efficient indexing and search methods for such large-scale and high-dimensional database, which typically is a challenging task. Some efforts have been made and solved this problem to some extent. However, most of them are implemented in a single machine, which is not suitable to handle large-scale database.In this paper, we present a novel data index structure and nearest neighbor search algorithm implemented on Apache Spark. We impose a grid on the database and index data by non-empty grid cells. This grid-based index structure is simple and easy to be implemented in parallel. Moreover, we propose to build a scalable KNN graph on the grids, which increase the efficiency of this index structure by a low cost in parallel implementation. Finally, experiments are conducted in both public databases and synthetic databases, showing that the proposed methods achieve overall high performance in both efficiency and accuracy.",
"fno": "0840a046",
"keywords": [
"Data Handling",
"Database Indexing",
"Feature Extraction",
"Graph Theory",
"Grid Computing",
"Internet",
"Query Processing",
"Search Problems",
"Synthetic Databases",
"Public Databases",
"Parallel Implementation",
"Grid Based Index Structure",
"Grid Cells",
"Index Data",
"Nearest Neighbor Search Algorithm",
"Data Index Structure",
"Large Scale Database",
"Single Machine",
"High Dimensional Database",
"Search Methods",
"Retrieval",
"High Dimensional Feature Vectors",
"Massive Information",
"High Dimensional Data",
"Search Algorithms",
"Nearest Neighbor Searches",
"Partitioning Algorithms",
"Clustering Algorithms",
"Quantization Signal",
"Indexing",
"Large Scale Data",
"High Dimensional Data",
"Approximate Nearest Neighbor Search"
],
"authors": [
{
"affiliation": null,
"fullName": "Chuanfu Yang",
"givenName": "Chuanfu",
"surname": "Yang",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Zhiyang Li",
"givenName": "Zhiyang",
"surname": "Li",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Wenyu Qu",
"givenName": "Wenyu",
"surname": "Qu",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Zhaobin Liu",
"givenName": "Zhaobin",
"surname": "Liu",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Heng Qi",
"givenName": "Heng",
"surname": "Qi",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "ispan-fcst-iscc",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2017-06-01T00:00:00",
"pubType": "proceedings",
"pages": "46-51",
"year": "2017",
"issn": "2375-527X",
"isbn": "978-1-5386-0840-1",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "0840a038",
"articleId": "12OmNybfr70",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "0840a052",
"articleId": "12OmNz5apBk",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/iscc/2009/4672/0/05202326",
"title": "Compact N-tree: an indexing structure for distance range queries",
"doi": null,
"abstractUrl": "/proceedings-article/iscc/2009/05202326/12OmNCgrD6b",
"parentPublication": {
"id": "proceedings/iscc/2009/4672/0",
"title": "2009 IEEE Symposium on Computers and Communications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icme/2004/8603/2/01394325",
"title": "An efficient bitmap indexing method for similarity search in high dimensional multimedia databases",
"doi": null,
"abstractUrl": "/proceedings-article/icme/2004/01394325/12OmNCgrDbm",
"parentPublication": {
"id": "proceedings/icme/2004/8603/2",
"title": "2004 IEEE International Conference on Multimedia and Expo (ICME)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icde/2013/4909/0/06544822",
"title": "Voronoi-based nearest neighbor search for multi-dimensional uncertain databases",
"doi": null,
"abstractUrl": "/proceedings-article/icde/2013/06544822/12OmNqHItMe",
"parentPublication": {
"id": "proceedings/icde/2013/4909/0",
"title": "2013 29th IEEE International Conference on Data Engineering (ICDE 2013)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/aina/2014/3630/0/3629a560",
"title": "Processing Probabilistic K-Nearest Neighbor Query Using Rlsd-Tree",
"doi": null,
"abstractUrl": "/proceedings-article/aina/2014/3629a560/12OmNrAMETN",
"parentPublication": {
"id": "proceedings/aina/2014/3630/0",
"title": "2014 IEEE 28th International Conference on Advanced Information Networking and Applications (AINA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icde/2017/6543/0/6543a045",
"title": "Exploit Every Bit: Effective Caching for High-Dimensional Nearest Neighbor Search",
"doi": null,
"abstractUrl": "/proceedings-article/icde/2017/6543a045/12OmNwDj16O",
"parentPublication": {
"id": "proceedings/icde/2017/6543/0",
"title": "2017 IEEE 33rd International Conference on Data Engineering (ICDE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iciapw/2007/2921/0/29210021",
"title": "Shape Indexing through Laplacian Spectra",
"doi": null,
"abstractUrl": "/proceedings-article/iciapw/2007/29210021/12OmNwcCII7",
"parentPublication": {
"id": "proceedings/iciapw/2007/2921/0",
"title": "2007 14th International Conference on Image Analysis and Processing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ism/2011/4589/0/4589a069",
"title": "AH+-Tree: An Efficient Multimedia Indexing Structure for Similarity Queries",
"doi": null,
"abstractUrl": "/proceedings-article/ism/2011/4589a069/12OmNz2C1ls",
"parentPublication": {
"id": "proceedings/ism/2011/4589/0",
"title": "2011 IEEE International Symposium on Multimedia",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2000/01/k0045",
"title": "Indexing the Solution Space: A New Technique for Nearest Neighbor Search in High-Dimensional Space",
"doi": null,
"abstractUrl": "/journal/tk/2000/01/k0045/13rRUwdIOV3",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2016/03/07300426",
"title": "Nearest Keyword Set Search in Multi-Dimensional Datasets",
"doi": null,
"abstractUrl": "/journal/tk/2016/03/07300426/13rRUwhpBOq",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/big-data/2022/8045/0/10020464",
"title": "Hybrid Approximate Nearest Neighbor Indexing and Search (HANNIS) for Large Descriptor Databases",
"doi": null,
"abstractUrl": "/proceedings-article/big-data/2022/10020464/1KfSTxHm1KU",
"parentPublication": {
"id": "proceedings/big-data/2022/8045/0",
"title": "2022 IEEE International Conference on Big Data (Big Data)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNwseER5",
"title": "1993 (4th) International Conference on Computer Vision",
"acronym": "iccv",
"groupId": "1000149",
"volume": "0",
"displayVolume": "0",
"year": "1993",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNxGSmae",
"doi": "10.1109/ICCV.1993.378183",
"title": "A complete two-plane camera calibration method and experimental comparisons",
"normalizedTitle": "A complete two-plane camera calibration method and experimental comparisons",
"abstract": "For both 3-D reconstruction and prediction of image coordinates, cameras can be calibrated implicitly without involving their physical parameters. The authors present a two-plane method for such a complete calibration, which models all kinds of lens distortions. First, the modeling is done in a general case without imposing the pinhole constraint. Epipolar curves considering lens distortions are introduced and are found in a closed form. Then, a set of constraints of perspectivity is derived to constrain the modeling process. With these constraints, the camera physical parameters can be related directly to the modeling parameters. Extensive experimental comparisons of the methods with the classic photogrammetric method and Tsai's method relating to the aspects of 3-D measurement, the effect of the number of calibration points, and the prediction of image coordinates, are made using real images from 15 different depth values.<>",
"abstracts": [
{
"abstractType": "Regular",
"content": "For both 3-D reconstruction and prediction of image coordinates, cameras can be calibrated implicitly without involving their physical parameters. The authors present a two-plane method for such a complete calibration, which models all kinds of lens distortions. First, the modeling is done in a general case without imposing the pinhole constraint. Epipolar curves considering lens distortions are introduced and are found in a closed form. Then, a set of constraints of perspectivity is derived to constrain the modeling process. With these constraints, the camera physical parameters can be related directly to the modeling parameters. Extensive experimental comparisons of the methods with the classic photogrammetric method and Tsai's method relating to the aspects of 3-D measurement, the effect of the number of calibration points, and the prediction of image coordinates, are made using real images from 15 different depth values.<>",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "For both 3-D reconstruction and prediction of image coordinates, cameras can be calibrated implicitly without involving their physical parameters. The authors present a two-plane method for such a complete calibration, which models all kinds of lens distortions. First, the modeling is done in a general case without imposing the pinhole constraint. Epipolar curves considering lens distortions are introduced and are found in a closed form. Then, a set of constraints of perspectivity is derived to constrain the modeling process. With these constraints, the camera physical parameters can be related directly to the modeling parameters. Extensive experimental comparisons of the methods with the classic photogrammetric method and Tsai's method relating to the aspects of 3-D measurement, the effect of the number of calibration points, and the prediction of image coordinates, are made using real images from 15 different depth values.",
"fno": "00378183",
"keywords": [
"Calibration",
"Image Reconstruction",
"Stereo Image Processing",
"Epipolar Curves",
"Complete Two Plane Camera Calibration Method",
"3 D Reconstruction",
"Image Coordinates",
"Lens Distortions",
"Perspectivity",
"Modeling Parameters",
"3 D Measurement",
"Real Images",
"Cameras",
"Calibration",
"Lenses",
"Computer Vision",
"Image Reconstruction",
"Interpolation",
"Least Squares Methods",
"Automation",
"Coordinate Measuring Machines",
"Physics Computing"
],
"authors": [
{
"affiliation": "Inst. of Autom., Chinese Acad. of Sci., Beijing, China",
"fullName": "G.-Q. Wei",
"givenName": "G.-Q.",
"surname": "Wei",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Inst. of Autom., Chinese Acad. of Sci., Beijing, China",
"fullName": "S.D. Ma",
"givenName": "S.D.",
"surname": "Ma",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "iccv",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "1993-01-01T00:00:00",
"pubType": "proceedings",
"pages": "439,440,441,442,443,444,445,446",
"year": "1993",
"issn": null,
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "00378182",
"articleId": "12OmNzSyCj1",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "00378184",
"articleId": "12OmNy5hRff",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/ecmsm/2013/6298/0/06648945",
"title": "Comparison and error analysis of the standard pin-hole and Scheimpflug camera calibration models",
"doi": null,
"abstractUrl": "/proceedings-article/ecmsm/2013/06648945/12OmNAIMO81",
"parentPublication": {
"id": "proceedings/ecmsm/2013/6298/0",
"title": "2013 IEEE 11th International Workshop of Electronics, Control, Measurement, Signals and their application to Mechatronics (ECMSM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2012/2216/0/06460855",
"title": "Camera self calibration based on direct image alignment",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2012/06460855/12OmNqFJhFc",
"parentPublication": {
"id": "proceedings/icpr/2012/2216/0",
"title": "2012 21st International Conference on Pattern Recognition (ICPR 2012)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wcsn/2014/7091/0/7091a232",
"title": "Study on Wireless Sensor Network Boundary Localization Based on RSSI",
"doi": null,
"abstractUrl": "/proceedings-article/wcsn/2014/7091a232/12OmNqyUUzy",
"parentPublication": {
"id": "proceedings/wcsn/2014/7091/0",
"title": "2014 International Conference on Wireless Communication and Sensor Network",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icie/2009/3679/2/3679b218",
"title": "The Camera Calibration Approach of Pipeline Detecting Robot",
"doi": null,
"abstractUrl": "/proceedings-article/icie/2009/3679b218/12OmNwtn3qA",
"parentPublication": {
"id": "icie/2009/3679/2",
"title": "2009 WASE International Conference on Information Engineering (ICIE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/case/2006/0310/0/04120417",
"title": "The hybrid calibration of linear structured light system",
"doi": null,
"abstractUrl": "/proceedings-article/case/2006/04120417/12OmNx207fG",
"parentPublication": {
"id": "proceedings/case/2006/0310/0",
"title": "2006 IEEE International Conference on Automation Science and Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iwecms/2011/398/0/05952376",
"title": "A new method for Scheimpflug camera calibration",
"doi": null,
"abstractUrl": "/proceedings-article/iwecms/2011/05952376/12OmNx57HFV",
"parentPublication": {
"id": "proceedings/iwecms/2011/398/0",
"title": "2011 10th International Workshop on Electronics, Control, Measurement and Signals (ECMS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/1991/2148/0/00139675",
"title": "Two plane camera calibration: a unified model",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/1991/00139675/12OmNy7h35t",
"parentPublication": {
"id": "proceedings/cvpr/1991/2148/0",
"title": "Proceedings. 1991 IEEE Computer Society Conference on Computer Vision and Pattern Recognition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/2015/8391/0/8391a612",
"title": "Self-Calibration of Optical Lenses",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2015/8391a612/12OmNyQ7FPm",
"parentPublication": {
"id": "proceedings/iccv/2015/8391/0",
"title": "2015 IEEE International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/2009/4420/0/05459336",
"title": "Plane-based calibration of central catadioptric cameras",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2009/05459336/12OmNyU63tu",
"parentPublication": {
"id": "proceedings/iccv/2009/4420/0",
"title": "2009 IEEE 12th International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wacv/2021/0477/0/047700b771",
"title": "Automatic Calibration of the Fisheye Camera for Egocentric 3D Human Pose Estimation from a Single Image",
"doi": null,
"abstractUrl": "/proceedings-article/wacv/2021/047700b771/1uqGwG2xnQQ",
"parentPublication": {
"id": "proceedings/wacv/2021/0477/0",
"title": "2021 IEEE Winter Conference on Applications of Computer Vision (WACV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNwvVrM8",
"title": "Computer and Information Technology, International Conference on",
"acronym": "cit",
"groupId": "1001306",
"volume": "0",
"displayVolume": "0",
"year": "2010",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNzTH0Sq",
"doi": "10.1109/CIT.2010.281",
"title": "Modifed Re-sampling Based Particle Filter for Visual Tracking with MPH",
"normalizedTitle": "Modifed Re-sampling Based Particle Filter for Visual Tracking with MPH",
"abstract": "In this paper we propose a particle filter based strategic approach to enhance the performance of visual tracking system with a new re-sampling algorithm. In any particle filter based application especially in visual tracking system, re-sampling is a vital process in the implementation of particle filtering. Usually it is a linear function of particle weight calculation to know the number of particle copies. But, in visual tracking problem it makes the system computationally expensive to make real time performance. We can take more effective particle which has high weight by changing re-sampling as non-linear function. For smooth tracking Maximum a Posteriori (MAP) is introduced for better observation likelihood calculations. Experiments of proposed tracker show that our system is robust against false target tracking, severe occlusion, and rotation, scaling without extra computational cost. We evaluate our system with MPH measurement techniques, and demonstrate that, our proposed new re-sampling algorithm works well.",
"abstracts": [
{
"abstractType": "Regular",
"content": "In this paper we propose a particle filter based strategic approach to enhance the performance of visual tracking system with a new re-sampling algorithm. In any particle filter based application especially in visual tracking system, re-sampling is a vital process in the implementation of particle filtering. Usually it is a linear function of particle weight calculation to know the number of particle copies. But, in visual tracking problem it makes the system computationally expensive to make real time performance. We can take more effective particle which has high weight by changing re-sampling as non-linear function. For smooth tracking Maximum a Posteriori (MAP) is introduced for better observation likelihood calculations. Experiments of proposed tracker show that our system is robust against false target tracking, severe occlusion, and rotation, scaling without extra computational cost. We evaluate our system with MPH measurement techniques, and demonstrate that, our proposed new re-sampling algorithm works well.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "In this paper we propose a particle filter based strategic approach to enhance the performance of visual tracking system with a new re-sampling algorithm. In any particle filter based application especially in visual tracking system, re-sampling is a vital process in the implementation of particle filtering. Usually it is a linear function of particle weight calculation to know the number of particle copies. But, in visual tracking problem it makes the system computationally expensive to make real time performance. We can take more effective particle which has high weight by changing re-sampling as non-linear function. For smooth tracking Maximum a Posteriori (MAP) is introduced for better observation likelihood calculations. Experiments of proposed tracker show that our system is robust against false target tracking, severe occlusion, and rotation, scaling without extra computational cost. We evaluate our system with MPH measurement techniques, and demonstrate that, our proposed new re-sampling algorithm works well.",
"fno": "4108b582",
"keywords": [
"Multi Part Histogram",
"Particle Filtering",
"Bayesian Estimation",
"Maximum A Posteriori",
"Boosting Re Sampling"
],
"authors": [
{
"affiliation": null,
"fullName": "Md. Zahidul Islam",
"givenName": "Md. Zahidul",
"surname": "Islam",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Chi-Min Oh",
"givenName": "Chi-Min",
"surname": "Oh",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Chil-Woo Lee",
"givenName": "Chil-Woo",
"surname": "Lee",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "cit",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2010-06-01T00:00:00",
"pubType": "proceedings",
"pages": "1582-1587",
"year": "2010",
"issn": null,
"isbn": "978-0-7695-4108-2",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "4108b577",
"articleId": "12OmNz4BdiH",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "4108b588",
"articleId": "12OmNBziBcB",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/icnc/2009/3736/5/3736e313",
"title": "A Method of Genetic Algorithm Optimized Extended Kalman Particle Filter for Nonlinear System State Estimation",
"doi": null,
"abstractUrl": "/proceedings-article/icnc/2009/3736e313/12OmNAOsMKD",
"parentPublication": {
"id": "proceedings/icnc/2009/3736/5",
"title": "2009 Fifth International Conference on Natural Computation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iptc/2011/4498/0/4498a009",
"title": "Model Update Particle Filter for Multiple Objects Detection and Tracking",
"doi": null,
"abstractUrl": "/proceedings-article/iptc/2011/4498a009/12OmNvSbBHV",
"parentPublication": {
"id": "proceedings/iptc/2011/4498/0",
"title": "Intelligence Information Processing and Trusted Computing, International Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icece/2010/4031/0/4031b478",
"title": "Pedestrian Tracking Using Particle Filter Algorithm",
"doi": null,
"abstractUrl": "/proceedings-article/icece/2010/4031b478/12OmNvjgWzO",
"parentPublication": {
"id": "proceedings/icece/2010/4031/0",
"title": "Electrical and Control Engineering, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/2007/1630/0/04408952",
"title": "Variational Particle Filter for Multi-Object Tracking",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2007/04408952/12OmNwM6A1b",
"parentPublication": {
"id": "proceedings/iccv/2007/1630/0",
"title": "2007 11th IEEE International Conference on Computer Vision",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2017/0457/0/0457e819",
"title": "Multi-task Correlation Particle Filter for Robust Object Tracking",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2017/0457e819/12OmNwMXnsE",
"parentPublication": {
"id": "proceedings/cvpr/2017/0457/0",
"title": "2017 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icmv/2009/3944/0/3944a089",
"title": "Particle Filter Based Object Tracking with Sift and Color Feature",
"doi": null,
"abstractUrl": "/proceedings-article/icmv/2009/3944a089/12OmNx8OuoR",
"parentPublication": {
"id": "proceedings/icmv/2009/3944/0",
"title": "Machine Vision, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icig/2013/5050/0/5050a374",
"title": "Object Tracking with Sparse Representation and Annealed Particle Filter",
"doi": null,
"abstractUrl": "/proceedings-article/icig/2013/5050a374/12OmNyPQ4QN",
"parentPublication": {
"id": "proceedings/icig/2013/5050/0",
"title": "2013 Seventh International Conference on Image and Graphics (ICIG)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cmc/2010/3989/3/3989c504",
"title": "Application of Particle Filter for Target Tracking in Wireless Sensor Networks",
"doi": null,
"abstractUrl": "/proceedings-article/cmc/2010/3989c504/12OmNzUxOjs",
"parentPublication": {
"id": "proceedings/cmc/2010/3989/3",
"title": "Communications and Mobile Computing, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icme/2018/1737/0/08486439",
"title": "Robust Object Tracking Via Part-Based Correlation Particle Filter",
"doi": null,
"abstractUrl": "/proceedings-article/icme/2018/08486439/14jQfRmTc4g",
"parentPublication": {
"id": "proceedings/icme/2018/1737/0",
"title": "2018 IEEE International Conference on Multimedia and Expo (ICME)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNBp52yf",
"title": "2012 IEEE 19th International Conference on Web Services",
"acronym": "icws",
"groupId": "1001210",
"volume": "0",
"displayVolume": "0",
"year": "2012",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNzahc4E",
"doi": "10.1109/ICWS.2012.81",
"title": "WSP: A Network Coordinate Based Web Service Positioning Framework for Response Time Prediction",
"normalizedTitle": "WSP: A Network Coordinate Based Web Service Positioning Framework for Response Time Prediction",
"abstract": "With the rapid growth of Web services in recent years, the optimal service selection from functionally-equivalent service candidates has become more critical for building high quality service-oriented systems. To provide accurate QoSvalues for service selection, user-side QoS prediction thus becomes an important research problem. Although collaborative filtering based prediction approaches have been studied in several previous works, these methods suffer from the limitation of the sparsity of available historical QoS data, which greatly degrades the prediction accuracy. To address this problem, this paper proposes a Web service positioning (WSP)framework for response time prediction, which is one of the most important QoS properties. In our approach, a small set of landmarks are deployed to periodically monitor the response times of the Web service candidates and provide references to the numerous service users. By combining the advantages of network coordinate based approaches and collaborative filtering based approaches, the response times between users and Web services can be accurately predicted using their corresponding Euclidean distances. Extensive experiments are conducted based on our real-world QoS dataset collected on PlanetLab, comprising about 359,400 response time values from 200 users on 1,597 Web services. The experimental results show that our WSP approach outperforms the other existing approaches, especially when the historical data is sparse.",
"abstracts": [
{
"abstractType": "Regular",
"content": "With the rapid growth of Web services in recent years, the optimal service selection from functionally-equivalent service candidates has become more critical for building high quality service-oriented systems. To provide accurate QoSvalues for service selection, user-side QoS prediction thus becomes an important research problem. Although collaborative filtering based prediction approaches have been studied in several previous works, these methods suffer from the limitation of the sparsity of available historical QoS data, which greatly degrades the prediction accuracy. To address this problem, this paper proposes a Web service positioning (WSP)framework for response time prediction, which is one of the most important QoS properties. In our approach, a small set of landmarks are deployed to periodically monitor the response times of the Web service candidates and provide references to the numerous service users. By combining the advantages of network coordinate based approaches and collaborative filtering based approaches, the response times between users and Web services can be accurately predicted using their corresponding Euclidean distances. Extensive experiments are conducted based on our real-world QoS dataset collected on PlanetLab, comprising about 359,400 response time values from 200 users on 1,597 Web services. The experimental results show that our WSP approach outperforms the other existing approaches, especially when the historical data is sparse.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "With the rapid growth of Web services in recent years, the optimal service selection from functionally-equivalent service candidates has become more critical for building high quality service-oriented systems. To provide accurate QoSvalues for service selection, user-side QoS prediction thus becomes an important research problem. Although collaborative filtering based prediction approaches have been studied in several previous works, these methods suffer from the limitation of the sparsity of available historical QoS data, which greatly degrades the prediction accuracy. To address this problem, this paper proposes a Web service positioning (WSP)framework for response time prediction, which is one of the most important QoS properties. In our approach, a small set of landmarks are deployed to periodically monitor the response times of the Web service candidates and provide references to the numerous service users. By combining the advantages of network coordinate based approaches and collaborative filtering based approaches, the response times between users and Web services can be accurately predicted using their corresponding Euclidean distances. Extensive experiments are conducted based on our real-world QoS dataset collected on PlanetLab, comprising about 359,400 response time values from 200 users on 1,597 Web services. The experimental results show that our WSP approach outperforms the other existing approaches, especially when the historical data is sparse.",
"fno": "4752a090",
"keywords": [
"Web Services",
"Time Factors",
"Quality Of Service",
"Accuracy",
"Coordinate Measuring Machines",
"Prediction Algorithms",
"Network Coordinate",
"Web Service Positioning",
"Qo S Prediction",
"Collaborative Filtering"
],
"authors": [
{
"affiliation": null,
"fullName": "Jieming Zhu",
"givenName": "Jieming",
"surname": "Zhu",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Yu Kang",
"givenName": "Yu",
"surname": "Kang",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Zibin Zheng",
"givenName": "Zibin",
"surname": "Zheng",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Michael R. Lyu",
"givenName": "Michael R.",
"surname": "Lyu",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "icws",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2012-06-01T00:00:00",
"pubType": "proceedings",
"pages": "90-97",
"year": "2012",
"issn": null,
"isbn": "978-1-4673-2131-0",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "4752a082",
"articleId": "12OmNAOsMOQ",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "4752a098",
"articleId": "12OmNCmpcUP",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/cicn/2010/4254/0/4254a254",
"title": "A Short-Term Prediction for QoS of Web Service Based on Wavelet Neural Networks",
"doi": null,
"abstractUrl": "/proceedings-article/cicn/2010/4254a254/12OmNApLGEY",
"parentPublication": {
"id": "proceedings/cicn/2010/4254/0",
"title": "Computational Intelligence and Communication Networks, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/isorcw/2012/4669/0/4669a093",
"title": "A Clustering-Based QoS Prediction Approach for Web Service Recommendation",
"doi": null,
"abstractUrl": "/proceedings-article/isorcw/2012/4669a093/12OmNBCZnSp",
"parentPublication": {
"id": "proceedings/isorcw/2012/4669/0",
"title": "2012 IEEE 15th International Symposium on Object/Component/Service-Oriented Real-Time Distributed Computing Workshops",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/issre/2011/4568/0/4568a210",
"title": "WSPred: A Time-Aware Personalized QoS Prediction Framework for Web Services",
"doi": null,
"abstractUrl": "/proceedings-article/issre/2011/4568a210/12OmNBf94ZE",
"parentPublication": {
"id": "proceedings/issre/2011/4568/0",
"title": "2011 IEEE 22nd International Symposium on Software Reliability Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icws/2016/2675/0/2675a623",
"title": "PLMwsp: Probabilistic Latent Model for Web Service QoS Prediction",
"doi": null,
"abstractUrl": "/proceedings-article/icws/2016/2675a623/12OmNBpEeKm",
"parentPublication": {
"id": "proceedings/icws/2016/2675/0",
"title": "2016 IEEE International Conference on Web Services (ICWS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icctd/2009/3892/1/3892a265",
"title": "Web Service QoS Prediction Based on Multi Agents",
"doi": null,
"abstractUrl": "/proceedings-article/icctd/2009/3892a265/12OmNwAt1FR",
"parentPublication": {
"id": "proceedings/icctd/2009/3892/1",
"title": "2009 International Conference on Computer Technology and Development (ICCTD 2009)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wi-iat/2009/3801/1/3801a395",
"title": "An Adaptive Web Services Selection Method Based on the QoS Prediction Mechanism",
"doi": null,
"abstractUrl": "/proceedings-article/wi-iat/2009/3801a395/12OmNyQYtwa",
"parentPublication": {
"id": "proceedings/wi-iat/2009/3801/1",
"title": "2009 IEEE/WIC/ACM International Joint Conference on Web Intelligence and Intelligent Agent Technology (WI-IAT)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/scc/2012/3049/0/06274152",
"title": "On Graph Reduction for QoS Prediction of Very Large Web Service Compositions",
"doi": null,
"abstractUrl": "/proceedings-article/scc/2012/06274152/12OmNym2c5f",
"parentPublication": {
"id": "proceedings/scc/2012/3049/0",
"title": "2012 IEEE International Conference on Services Computing (SCC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/sc/2016/05/07108071",
"title": "Location-aware and personalized collaborative filtering for web service recommendation",
"doi": null,
"abstractUrl": "/journal/sc/2016/05/07108071/13rRUwInvqA",
"parentPublication": {
"id": "trans/sc",
"title": "IEEE Transactions on Services Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/sc/2013/03/tsc2013030289",
"title": "Collaborative Web Service QoS Prediction via Neighborhood Integrated Matrix Factorization",
"doi": null,
"abstractUrl": "/journal/sc/2013/03/tsc2013030289/13rRUwjoNua",
"parentPublication": {
"id": "trans/sc",
"title": "IEEE Transactions on Services Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/sc/2016/04/07051279",
"title": "A Highly Accurate Prediction Algorithm for Unknown Web Service QoS Values",
"doi": null,
"abstractUrl": "/journal/sc/2016/04/07051279/13rRUxAATe1",
"parentPublication": {
"id": "trans/sc",
"title": "IEEE Transactions on Services Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNCf1Dp1",
"title": "Visualization Conference, IEEE",
"acronym": "ieee-vis",
"groupId": "1000796",
"volume": "0",
"displayVolume": "0",
"year": "2002",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNAYXWIv",
"doi": "10.1109/VISUAL.2002.1183816",
"title": "Case Study: Interactive Visualization for Internet Security",
"normalizedTitle": "Case Study: Interactive Visualization for Internet Security",
"abstract": "Internet connectivity is defined by a set of routing protocols which let the routers that comprise the Internet backbone choose the best route for a packet to reach its destination. One way to improve the security and performance of Internet is to routinely examine the routing data. In this case study, we show how interactive visualization of Border Gateway Protocol (BGP) data helps characterize routing behavior, identify weaknesses in connectivity which could potentially cripple the Internet, as well as detect and explain actual anomalous events.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Internet connectivity is defined by a set of routing protocols which let the routers that comprise the Internet backbone choose the best route for a packet to reach its destination. One way to improve the security and performance of Internet is to routinely examine the routing data. In this case study, we show how interactive visualization of Border Gateway Protocol (BGP) data helps characterize routing behavior, identify weaknesses in connectivity which could potentially cripple the Internet, as well as detect and explain actual anomalous events.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Internet connectivity is defined by a set of routing protocols which let the routers that comprise the Internet backbone choose the best route for a packet to reach its destination. One way to improve the security and performance of Internet is to routinely examine the routing data. In this case study, we show how interactive visualization of Border Gateway Protocol (BGP) data helps characterize routing behavior, identify weaknesses in connectivity which could potentially cripple the Internet, as well as detect and explain actual anomalous events.",
"fno": "7498teoh",
"keywords": [
"Anomaly Detection",
"Graph Drawing",
"Information Visualization",
"Network Security"
],
"authors": [
{
"affiliation": "University of California, Davis",
"fullName": "Soon Tee Teoh",
"givenName": "Soon Tee",
"surname": "Teoh",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "University of California, Davis",
"fullName": "Kwan-Liu Ma",
"givenName": "Kwan-Liu",
"surname": "Ma",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "University of California, Davis",
"fullName": "S. Felix Wu",
"givenName": "S. Felix",
"surname": "Wu",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "North Carolina State University",
"fullName": "Xiaoliang Zhao",
"givenName": "Xiaoliang",
"surname": "Zhao",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "ieee-vis",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2002-10-01T00:00:00",
"pubType": "proceedings",
"pages": "null",
"year": "2002",
"issn": "1070-2385",
"isbn": "0-7803-7498-3",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "7498hiraga",
"articleId": "12OmNwwd2Kr",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "7498gresh",
"articleId": "12OmNwekjvY",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/infcom/2002/7476/2/01019307",
"title": "Characterizing the Internet hierarchy from multiple vantage points",
"doi": null,
"abstractUrl": "/proceedings-article/infcom/2002/01019307/12OmNBtl1DK",
"parentPublication": {
"id": "proceedings/infcom/2002/7476/2",
"title": "Proceedings of IEEE Information Communications Conference (INFOCOM 2002)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-infovis/2004/8779/0/87790199",
"title": "Interactive Visualization of Small World Graphs",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-infovis/2004/87790199/12OmNCgrDcT",
"parentPublication": {
"id": "proceedings/ieee-infovis/2004/8779/0",
"title": "Information Visualization, IEEE Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/dsn/2005/2282/0/22820172",
"title": "Internet Routing Anomaly Detection and Visualization",
"doi": null,
"abstractUrl": "/proceedings-article/dsn/2005/22820172/12OmNwF0C3o",
"parentPublication": {
"id": "proceedings/dsn/2005/2282/0",
"title": "2005 International Conference on Dependable Systems and Networks (DSN'05)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/trustcom/2012/4745/0/4745b239",
"title": "Border Gateway Protocol Anomaly Detection Using Failure Quality Control Method",
"doi": null,
"abstractUrl": "/proceedings-article/trustcom/2012/4745b239/12OmNxE2mN5",
"parentPublication": {
"id": "proceedings/trustcom/2012/4745/0",
"title": "2012 IEEE 11th International Conference on Trust, Security and Privacy in Computing and Communications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icppw/1999/0353/0/03530274",
"title": "A Tool for Monitoring Routing Information in the Internet",
"doi": null,
"abstractUrl": "/proceedings-article/icppw/1999/03530274/12OmNxVV60x",
"parentPublication": {
"id": "proceedings/icppw/1999/0353/0",
"title": "Proceedings of the 1999 ICPP Workshops on Collaboration and Mobile Computing (CMC'99). Group Communications (IWGC). Internet '99 (IWI'99). Industrial Applications on Network Computing (INDAP). Multime",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tc/2009/11/ttc2009111470",
"title": "An Online Mechanism for BGP Instability Detection and Analysis",
"doi": null,
"abstractUrl": "/journal/tc/2009/11/ttc2009111470/13rRUILLkDe",
"parentPublication": {
"id": "trans/tc",
"title": "IEEE Transactions on Computers",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/nt/2001/03/00929852",
"title": "Delayed Internet routing convergence",
"doi": null,
"abstractUrl": "/journal/nt/2001/03/00929852/13rRUxAASQf",
"parentPublication": {
"id": "trans/nt",
"title": "IEEE/ACM Transactions on Networking",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/csase/2022/2632/0/09759613",
"title": "Internet Routing Anomaly Detection Using LSTM Based Autoencoder",
"doi": null,
"abstractUrl": "/proceedings-article/csase/2022/09759613/1CRw9IsTQic",
"parentPublication": {
"id": "proceedings/csase/2022/2632/0",
"title": "2022 International Conference on Computer Science and Software Engineering (CSASE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2023/01/09904432",
"title": "The State of the Art in BGP Visualization Tools: A Mapping of Visualization Techniques to Cyberattack Types",
"doi": null,
"abstractUrl": "/journal/tg/2023/01/09904432/1H0Gf7qlCU0",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/big-data/2019/0858/0/09006201",
"title": "Border Gateway Protocol Anomaly Detection Using Neural Network",
"doi": null,
"abstractUrl": "/proceedings-article/big-data/2019/09006201/1hJs4iYB7TW",
"parentPublication": {
"id": "proceedings/big-data/2019/0858/0",
"title": "2019 IEEE International Conference on Big Data (Big Data)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNBC8AAJ",
"title": "2016 IEEE Trustcom/BigDataSE/ISPA",
"acronym": "trustcom-bigdatase-i-spa",
"groupId": "1800729",
"volume": "0",
"displayVolume": "0",
"year": "2016",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNB1NVOd",
"doi": "10.1109/TrustCom.2016.0068",
"title": "The Power of Prefix Hijackings in the Internet Hierarchy",
"normalizedTitle": "The Power of Prefix Hijackings in the Internet Hierarchy",
"abstract": "The correct functioning of inter-domain routing is of vital importance to the ever expanding Internet. As a common threat to the Internet, prefix hijackings often hijack traffic destined to some Autonomous Systems(ASes), leading to routing black holes or traffic interception. In this paper, we study two typical categories of prefix hijackings, namely false origin hijacking and man-in-the-middle interception, by extensive simulations. Our simulations are based on a new model which takes both the hierarchical Internet structure and the AS connectivity degrees into consideration. With this model, we explore the attacking/hijacking power of different ASes and their resisting power to this attack, where different categories of hijackings exhibit different characteristics. In addition, we also confirm that our results still hold considering various factors in the real Internet, including hidden links, prefix distribution, and RPKI, a countermeasure to prefix hijackings that is undergoing an active deployment in inter-domain routing. Some explanations and case studies are given to help better understanding of our results, which we hope will facilitate the deployment of RPKI and inspire new research.",
"abstracts": [
{
"abstractType": "Regular",
"content": "The correct functioning of inter-domain routing is of vital importance to the ever expanding Internet. As a common threat to the Internet, prefix hijackings often hijack traffic destined to some Autonomous Systems(ASes), leading to routing black holes or traffic interception. In this paper, we study two typical categories of prefix hijackings, namely false origin hijacking and man-in-the-middle interception, by extensive simulations. Our simulations are based on a new model which takes both the hierarchical Internet structure and the AS connectivity degrees into consideration. With this model, we explore the attacking/hijacking power of different ASes and their resisting power to this attack, where different categories of hijackings exhibit different characteristics. In addition, we also confirm that our results still hold considering various factors in the real Internet, including hidden links, prefix distribution, and RPKI, a countermeasure to prefix hijackings that is undergoing an active deployment in inter-domain routing. Some explanations and case studies are given to help better understanding of our results, which we hope will facilitate the deployment of RPKI and inspire new research.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "The correct functioning of inter-domain routing is of vital importance to the ever expanding Internet. As a common threat to the Internet, prefix hijackings often hijack traffic destined to some Autonomous Systems(ASes), leading to routing black holes or traffic interception. In this paper, we study two typical categories of prefix hijackings, namely false origin hijacking and man-in-the-middle interception, by extensive simulations. Our simulations are based on a new model which takes both the hierarchical Internet structure and the AS connectivity degrees into consideration. With this model, we explore the attacking/hijacking power of different ASes and their resisting power to this attack, where different categories of hijackings exhibit different characteristics. In addition, we also confirm that our results still hold considering various factors in the real Internet, including hidden links, prefix distribution, and RPKI, a countermeasure to prefix hijackings that is undergoing an active deployment in inter-domain routing. Some explanations and case studies are given to help better understanding of our results, which we hope will facilitate the deployment of RPKI and inspire new research.",
"fno": "07846951",
"keywords": [
"Internet",
"Routing",
"IP Networks",
"Business",
"Topology",
"Security",
"Monitoring",
"Interception",
"Prefix Hijacking",
"BGP",
"Security"
],
"authors": [
{
"affiliation": null,
"fullName": "Yan Yang",
"givenName": "Yan",
"surname": "Yang",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Xingang Shi",
"givenName": "Xingang",
"surname": "Shi",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Xia Yin",
"givenName": "Xia",
"surname": "Yin",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Zhiliang Wang",
"givenName": "Zhiliang",
"surname": "Wang",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "trustcom-bigdatase-i-spa",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2016-08-01T00:00:00",
"pubType": "proceedings",
"pages": "228-235",
"year": "2016",
"issn": "2324-9013",
"isbn": "978-1-5090-3205-1",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "07846950",
"articleId": "12OmNxwWoJU",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "07846952",
"articleId": "12OmNrIJqxg",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/dsn/2009/4422/0/05270359",
"title": "HC-BGP: A light-weight and flexible scheme for securing prefix ownership",
"doi": null,
"abstractUrl": "/proceedings-article/dsn/2009/05270359/12OmNB06l51",
"parentPublication": {
"id": "proceedings/dsn/2009/4422/0",
"title": "2009 IEEE/IFIP International Conference on Dependable Systems & Networks",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cit/2012/4858/0/4858a375",
"title": "Analysis on the Effect of Prefix Hijacking Attack and Internet Hierarchy",
"doi": null,
"abstractUrl": "/proceedings-article/cit/2012/4858a375/12OmNBIWXCy",
"parentPublication": {
"id": "proceedings/cit/2012/4858/0",
"title": "Computer and Information Technology, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/trustcom/2011/2135/0/06120920",
"title": "Study on IP Prefix Hijacking in Cloud Computing Networks Based on Attack Planning",
"doi": null,
"abstractUrl": "/proceedings-article/trustcom/2011/06120920/12OmNCy2L35",
"parentPublication": {
"id": "proceedings/trustcom/2011/2135/0",
"title": "2011IEEE 10th International Conference on Trust, Security and Privacy in Computing and Communications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ipdpsw/2012/4676/0/4676b197",
"title": "LDC: Detecting BGP Prefix Hijacking by Load Distribution Change",
"doi": null,
"abstractUrl": "/proceedings-article/ipdpsw/2012/4676b197/12OmNrJiD1J",
"parentPublication": {
"id": "proceedings/ipdpsw/2012/4676/0",
"title": "2012 IEEE 26th International Parallel and Distributed Processing Symposium Workshops & PhD Forum",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icmecg/2014/6543/0/6543a087",
"title": "A DSA-Based and Efficient Scheme for Preventing IP Prefix Hijacking",
"doi": null,
"abstractUrl": "/proceedings-article/icmecg/2014/6543a087/12OmNvjQ92A",
"parentPublication": {
"id": "proceedings/icmecg/2014/6543/0",
"title": "2014 International Conference on Management of e-Commerce and e-Government (ICMeCG)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdcs/2012/4685/0/4685a667",
"title": "Studying Impacts of Prefix Interception Attack by Exploring BGP AS-PATH Prepending",
"doi": null,
"abstractUrl": "/proceedings-article/icdcs/2012/4685a667/12OmNwGIcBC",
"parentPublication": {
"id": "proceedings/icdcs/2012/4685/0",
"title": "2012 IEEE 32nd International Conference on Distributed Computing Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/lcn/2017/6523/0/6523a330",
"title": "Reclaim Your Prefix: Mitigation of Prefix Hijacking Using IPsec Tunnels",
"doi": null,
"abstractUrl": "/proceedings-article/lcn/2017/6523a330/12OmNwdL7gr",
"parentPublication": {
"id": "proceedings/lcn/2017/6523/0",
"title": "2017 IEEE 42nd Conference on Local Computer Networks (LCN)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ipccc/2014/7575/0/07017052",
"title": "Measuring path divergence in the Internet",
"doi": null,
"abstractUrl": "/proceedings-article/ipccc/2014/07017052/12OmNwoPtrK",
"parentPublication": {
"id": "proceedings/ipccc/2014/7575/0",
"title": "2014 IEEE International Performance Computing and Communications Conference (IPCCC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/imis/2012/4684/0/4684a415",
"title": "The Relation on Prefix Hijacking and the Internet Hierarchy",
"doi": null,
"abstractUrl": "/proceedings-article/imis/2012/4684a415/12OmNz6iO7A",
"parentPublication": {
"id": "proceedings/imis/2012/4684/0",
"title": "Innovative Mobile and Internet Services in Ubiquitous Computing, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/nt/2010/06/05582115",
"title": "iSPY: Detecting IP Prefix Hijacking on My Own",
"doi": null,
"abstractUrl": "/journal/nt/2010/06/05582115/13rRUxBJhs0",
"parentPublication": {
"id": "trans/nt",
"title": "IEEE/ACM Transactions on Networking",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNAsTgXb",
"title": "2017 IEEE Frontiers in Education Conference (FIE)",
"acronym": "fie",
"groupId": "1000297",
"volume": "0",
"displayVolume": "0",
"year": "2017",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNqOffAU",
"doi": "10.1109/FIE.2017.8190531",
"title": "An interactive visualization tool for teaching ARP spoofing attack",
"normalizedTitle": "An interactive visualization tool for teaching ARP spoofing attack",
"abstract": "Local area network (LAN) access is the top vector for insider threats and misuses according to the Verizon's Data Breach Investigations Report. Address Resolution Protocol (ARP) is often exploited by the attackers who have gained access to the LAN. It is critical for students to learn how attacks on ARP work and know the countermeasures. In an earlier work, authors developed a hands-on lab to help students learn how an ARP spoofing attack works by asking them to create and send attack packets. To enhance learning further, we present an interactive visualization tool that intuitively shows the effects of the ARP spoofing attack in real-time. The Hacker Graphical User Interface (HGUI) is an interactive visualization tool developed to assist students in learning how ARP Spoofing works. By modeling a controlled ARP Spoofing attack using virtual machines, we give students the ability to alter elements of the attack by interacting with the visualization. This tool was developed using Processing, an open source programming language used in many visual art communities. It runs on virtual machines installed with Kali Linux. This tool animates attack packets, normal packets, and the status of ARP cache in real-time. If students have successfully carried out the ARP spoofing attack, they can see the normal packets being routed to the attacker machine and the victim's ARP cache being poisoned. In this paper, we present the design, implementation, and evaluation of the lab. Tests were conducted to measure the performance of students before and after using this tool. We also gave students surveys after they completed the hands-on lab. The result shows that this tool can significantly enhance students' understanding of the concept of ARP spoofing attacks and motivate them in learning more about cyber security.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Local area network (LAN) access is the top vector for insider threats and misuses according to the Verizon's Data Breach Investigations Report. Address Resolution Protocol (ARP) is often exploited by the attackers who have gained access to the LAN. It is critical for students to learn how attacks on ARP work and know the countermeasures. In an earlier work, authors developed a hands-on lab to help students learn how an ARP spoofing attack works by asking them to create and send attack packets. To enhance learning further, we present an interactive visualization tool that intuitively shows the effects of the ARP spoofing attack in real-time. The Hacker Graphical User Interface (HGUI) is an interactive visualization tool developed to assist students in learning how ARP Spoofing works. By modeling a controlled ARP Spoofing attack using virtual machines, we give students the ability to alter elements of the attack by interacting with the visualization. This tool was developed using Processing, an open source programming language used in many visual art communities. It runs on virtual machines installed with Kali Linux. This tool animates attack packets, normal packets, and the status of ARP cache in real-time. If students have successfully carried out the ARP spoofing attack, they can see the normal packets being routed to the attacker machine and the victim's ARP cache being poisoned. In this paper, we present the design, implementation, and evaluation of the lab. Tests were conducted to measure the performance of students before and after using this tool. We also gave students surveys after they completed the hands-on lab. The result shows that this tool can significantly enhance students' understanding of the concept of ARP spoofing attacks and motivate them in learning more about cyber security.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Local area network (LAN) access is the top vector for insider threats and misuses according to the Verizon's Data Breach Investigations Report. Address Resolution Protocol (ARP) is often exploited by the attackers who have gained access to the LAN. It is critical for students to learn how attacks on ARP work and know the countermeasures. In an earlier work, authors developed a hands-on lab to help students learn how an ARP spoofing attack works by asking them to create and send attack packets. To enhance learning further, we present an interactive visualization tool that intuitively shows the effects of the ARP spoofing attack in real-time. The Hacker Graphical User Interface (HGUI) is an interactive visualization tool developed to assist students in learning how ARP Spoofing works. By modeling a controlled ARP Spoofing attack using virtual machines, we give students the ability to alter elements of the attack by interacting with the visualization. This tool was developed using Processing, an open source programming language used in many visual art communities. It runs on virtual machines installed with Kali Linux. This tool animates attack packets, normal packets, and the status of ARP cache in real-time. If students have successfully carried out the ARP spoofing attack, they can see the normal packets being routed to the attacker machine and the victim's ARP cache being poisoned. In this paper, we present the design, implementation, and evaluation of the lab. Tests were conducted to measure the performance of students before and after using this tool. We also gave students surveys after they completed the hands-on lab. The result shows that this tool can significantly enhance students' understanding of the concept of ARP spoofing attacks and motivate them in learning more about cyber security.",
"fno": "08190531",
"keywords": [
"Tools",
"Virtual Machining",
"IP Networks",
"Data Visualization",
"Protocols",
"Local Area Networks",
"Visualization",
"Course Module",
"Computer Science",
"Cyber Security",
"Hands On Lab",
"Visualization",
"Local Area Network",
"ARP Spoofing",
"Man In The Middle"
],
"authors": [
{
"affiliation": "John Hopkins University of Applied, Physics Laboratory, Laurel, MD, USA",
"fullName": "Brandon Scott",
"givenName": "Brandon",
"surname": "Scott",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Department of Computer Science, North Carolina A&T State University, Greensboro, NC, USA",
"fullName": "Jinsheng Xu",
"givenName": "Jinsheng",
"surname": "Xu",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Department of Computer Science, Winston-Salem State University, Winston-Salem, NC, USA",
"fullName": "Jinghua Zhang",
"givenName": "Jinghua",
"surname": "Zhang",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Department of Computer Science, North Carolina A&T State University, Greensboro, NC, USA",
"fullName": "Ariana Brown",
"givenName": "Ariana",
"surname": "Brown",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Department of Computer Science, North Carolina A&T State University, Greensboro, NC, USA",
"fullName": "Erica Clark",
"givenName": "Erica",
"surname": "Clark",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Department of Computer Science, North Carolina A&T State University, Greensboro, NC, USA",
"fullName": "Xiaohong Yuan",
"givenName": "Xiaohong",
"surname": "Yuan",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Department of Computer Science, North Carolina A&T State University, Greensboro, NC, USA",
"fullName": "Anna Yu",
"givenName": "Anna",
"surname": "Yu",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Department of Computer Science, North Carolina A&T State University, Greensboro, NC, USA",
"fullName": "Kenneth Williams",
"givenName": "Kenneth",
"surname": "Williams",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "fie",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2017-10-01T00:00:00",
"pubType": "proceedings",
"pages": "1-5",
"year": "2017",
"issn": null,
"isbn": "978-1-5090-5920-1",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "08190530",
"articleId": "12OmNro0HWR",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "08190532",
"articleId": "12OmNxETaeW",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/fie/2016/1790/0/07757364",
"title": "Developing and evaluating a hands-on lab for teaching local area network vulnerabilities",
"doi": null,
"abstractUrl": "/proceedings-article/fie/2016/07757364/12OmNBEYzKT",
"parentPublication": {
"id": "proceedings/fie/2016/1790/0",
"title": "2016 IEEE Frontiers in Education Conference (FIE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/dcabes/2012/4818/0/4818a295",
"title": "Preventing ARP Spoofing Attacks through Gratuitous Decision Packet",
"doi": null,
"abstractUrl": "/proceedings-article/dcabes/2012/4818a295/12OmNBZYTpk",
"parentPublication": {
"id": "proceedings/dcabes/2012/4818/0",
"title": "2012 11th International Symposium on Distributed Computing and Applications to Business, Engineering & Science",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/trustcom-bigdatase-i-spa/2015/7952/1/07345444",
"title": "ARP Cache Poisoning Mitigation and Forensics Investigation",
"doi": null,
"abstractUrl": "/proceedings-article/trustcom-bigdatase-i-spa/2015/07345444/12OmNC3FG8D",
"parentPublication": {
"id": "proceedings/trustcom-bigdatase-i-spa/2015/7952/2",
"title": "2015 IEEE Trustcom/BigDataSE/ISPA",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/etcs/2010/3987/1/3987a762",
"title": "Research on the Defense Against ARP Spoofing Attacks Based on Winpcap",
"doi": null,
"abstractUrl": "/proceedings-article/etcs/2010/3987a762/12OmNrYlmHi",
"parentPublication": {
"id": "proceedings/etcs/2010/3987/1",
"title": "Education Technology and Computer Science, International Workshop on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cdciem/2012/4639/0/4639a218",
"title": "Defence Design for ARP Spoofing Based on NDIS Intermediate Driver",
"doi": null,
"abstractUrl": "/proceedings-article/cdciem/2012/4639a218/12OmNrkBwuw",
"parentPublication": {
"id": "proceedings/cdciem/2012/4639/0",
"title": "Computer Distributed Control and Intelligent Environmental Monitoring, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cine/2015/7548/0/7549a136",
"title": "Detection and Prevention against ARP Poisoning Attack Using Modified ICMP and Voting",
"doi": null,
"abstractUrl": "/proceedings-article/cine/2015/7549a136/12OmNxWuitU",
"parentPublication": {
"id": "proceedings/cine/2015/7548/0",
"title": "2015 International Conference on Computational Intelligence & Networks (CINE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/fie/2022/6244/0/09962649",
"title": "Learn ARP Spoofing Attack in a Game",
"doi": null,
"abstractUrl": "/proceedings-article/fie/2022/09962649/1IHohBxshkk",
"parentPublication": {
"id": "proceedings/fie/2022/6244/0",
"title": "2022 IEEE Frontiers in Education Conference (FIE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/aemcse/2022/8474/0/847400a776",
"title": "Research and Implementation of ARP Attack Defense Software Based on SharpPcap",
"doi": null,
"abstractUrl": "/proceedings-article/aemcse/2022/847400a776/1IlOdBKMSBO",
"parentPublication": {
"id": "proceedings/aemcse/2022/8474/0",
"title": "2022 5th International Conference on Advanced Electronic Materials, Computers and Software Engineering (AEMCSE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icoin/2019/8350/0/08718158",
"title": "ARP Poisoning Attack Detection Based on ARP Update State in Software-Defined Networks",
"doi": null,
"abstractUrl": "/proceedings-article/icoin/2019/08718158/1aIS1js8stG",
"parentPublication": {
"id": "proceedings/icoin/2019/8350/0",
"title": "2019 International Conference on Information Networking (ICOIN)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icsgea/2020/8278/0/827800a572",
"title": "ARP Spoofing Analysis and Prevention",
"doi": null,
"abstractUrl": "/proceedings-article/icsgea/2020/827800a572/1p4AFPWKKSA",
"parentPublication": {
"id": "proceedings/icsgea/2020/8278/0",
"title": "2020 5th International Conference on Smart Grid and Electrical Automation (ICSGEA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNrAdsts",
"title": "Proceedings of HCC 2001. IEEE Symposium on Human-Centric Computing Languages and Environments",
"acronym": "hcc",
"groupId": "1000339",
"volume": "0",
"displayVolume": "0",
"year": "2001",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNrkT7uI",
"doi": "10.1109/HCC.2001.995296",
"title": "Towards the conceptions of visualization language and visualization metaphor",
"normalizedTitle": "Towards the conceptions of visualization language and visualization metaphor",
"abstract": "In this article the conceptions of visualization language and visualization metaphor are suggested. The structure of a metaphor and the some conceptions linked with visualization languages are considered. The approaches to evaluating of visualization systems based on the adequacy in visualization are suggested.",
"abstracts": [
{
"abstractType": "Regular",
"content": "In this article the conceptions of visualization language and visualization metaphor are suggested. The structure of a metaphor and the some conceptions linked with visualization languages are considered. The approaches to evaluating of visualization systems based on the adequacy in visualization are suggested.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "In this article the conceptions of visualization language and visualization metaphor are suggested. The structure of a metaphor and the some conceptions linked with visualization languages are considered. The approaches to evaluating of visualization systems based on the adequacy in visualization are suggested.",
"fno": "00995296",
"keywords": [
"Visual Programming",
"Visual Languages",
"Visualization Language",
"Visualization Metaphor",
"Adequacy",
"Graphical Representation",
"Formalization",
"Visualization",
"Focusing",
"Application Software",
"Cognitive Science",
"Vocabulary",
"Animation",
"Testing"
],
"authors": [
{
"affiliation": "Inst. Math. Mech., Urals State Univ., Ekaterinburg, Russia",
"fullName": "V.L. Averbukh",
"givenName": "V.L.",
"surname": "Averbukh",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "hcc",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2001-01-01T00:00:00",
"pubType": "proceedings",
"pages": "390,391",
"year": "2001",
"issn": null,
"isbn": "0-7803-7198-4",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "00995295",
"articleId": "12OmNAQrYEP",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "00995297",
"articleId": "12OmNxbEtKp",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/iv/2007/2900/0/29000342",
"title": "Without Knowledge Visualization? Proposing a Deconstructivist Approach to Metaphor, Meaning and Perception",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2007/29000342/12OmNwErpT1",
"parentPublication": {
"id": "proceedings/iv/2007/2900/0",
"title": "2007 11th International Conference Information Visualization (IV '07)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/visual/1994/6627/0/00346309",
"title": "An annotation system for 3D fluid flow visualization",
"doi": null,
"abstractUrl": "/proceedings-article/visual/1994/00346309/12OmNweBUQu",
"parentPublication": {
"id": "proceedings/visual/1994/6627/0",
"title": "Proceedings Visualization '94",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vissoft/2013/1457/0/06650520",
"title": "Synchrovis: 3D visualization of monitoring traces in the city metaphor for analyzing concurrency",
"doi": null,
"abstractUrl": "/proceedings-article/vissoft/2013/06650520/12OmNxWuimK",
"parentPublication": {
"id": "proceedings/vissoft/2013/1457/0",
"title": "2013 First IEEE Working Conference on Software Visualization (VISSOFT)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cmpcon/1991/2134/0/00128856",
"title": "Conceptual models and metaphor in software design",
"doi": null,
"abstractUrl": "/proceedings-article/cmpcon/1991/00128856/12OmNxu6pbM",
"parentPublication": {
"id": "proceedings/cmpcon/1991/2134/0",
"title": "COMPCON Spring '91",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vl/1997/8144/0/81440046",
"title": "Toward Formal Definition of Conception \"Adequacy in Visualization\"",
"doi": null,
"abstractUrl": "/proceedings-article/vl/1997/81440046/12OmNxxdZLp",
"parentPublication": {
"id": "proceedings/vl/1997/8144/0",
"title": "Proceedings. 1997 IEEE Symposium on Visual Languages (Cat. No.97TB100180)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vlhcc/2010/8485/0/05635217",
"title": "TimeSpiderTrees: A Novel Visual Metaphor for Dynamic Compound Graphs",
"doi": null,
"abstractUrl": "/proceedings-article/vlhcc/2010/05635217/12OmNypIYEz",
"parentPublication": {
"id": "proceedings/vlhcc/2010/8485/0",
"title": "2010 IEEE Symposium on Visual Languages and Human-Centric Computing (VL/HCC 2010)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cw/2016/2303/0/2303a131",
"title": "SeeGroove2: An Orbit Metaphor for Interactive Groove Visualization",
"doi": null,
"abstractUrl": "/proceedings-article/cw/2016/2303a131/12OmNzwZ6v3",
"parentPublication": {
"id": "proceedings/cw/2016/2303/0",
"title": "2016 International Conference on Cyberworlds (CW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ldav/2022/9156/0/09966401",
"title": "Exploration Tool for Effectively Interpreting the Visual Metaphor Process of Sentiment Visualization",
"doi": null,
"abstractUrl": "/proceedings-article/ldav/2022/09966401/1IT0DG3tHPO",
"parentPublication": {
"id": "proceedings/ldav/2022/9156/0",
"title": "2022 IEEE 12th Symposium on Large Data Analysis and Visualization (LDAV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2019/2838/0/283800a392",
"title": "Visualization of Histopathological Decision Making Using a Roadbook Metaphor",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2019/283800a392/1cMF8urE6vS",
"parentPublication": {
"id": "proceedings/iv/2019/2838/0",
"title": "2019 23rd International Conference Information Visualisation (IV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vissoft/2021/3144/0/314400a140",
"title": "Understanding High-Level Behavior with a Light-Traces Visualization Metaphor",
"doi": null,
"abstractUrl": "/proceedings-article/vissoft/2021/314400a140/1yrHrR5aFA4",
"parentPublication": {
"id": "proceedings/vissoft/2021/3144/0",
"title": "2021 Working Conference on Software Visualization (VISSOFT)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNrIaeeT",
"title": "2017 IEEE 42nd Conference on Local Computer Networks (LCN)",
"acronym": "lcn",
"groupId": "1000419",
"volume": "0",
"displayVolume": "0",
"year": "2017",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNwdL7gr",
"doi": "10.1109/LCN.2017.59",
"title": "Reclaim Your Prefix: Mitigation of Prefix Hijacking Using IPsec Tunnels",
"normalizedTitle": "Reclaim Your Prefix: Mitigation of Prefix Hijacking Using IPsec Tunnels",
"abstract": "Prefix hijacking is a serious threat in the Internet routing landscape. The Border Gateway Protocol has no origin authentication by design. Countermeasures, e.g. on-top authentication as implemented by R-PKI infrastructures, are not yet deployed on a very large scale. Being victim of prefix hijacking is a difficult situation with few options. Not only the owner of a prefix is victim but all the networks being deceived by the attacker. They are unable to communicate with the owner and corresponding traffic travels into the wrong direction. Current data from the Internet routing plane as collected by RIPE-NCC is examined to detect prefix hijacking. This paper discusses means to manipulate the partitions resulting from prefix hijacking with router inherent functionality. By this means, prefix owners become able to increase their impact and enlarge the corresponding partition, with just one assistant Autonomous System (AS). Selection strategies to find a well suited assistant AS are compared and the top three are verified in an emulation environment. Therefore, an emulation network is created on the dataset that is representative for prefix hijacking in the Internet. The presented approach can be the foundation of a (semi-)automated tool to mitigate prefix hijacking in the future.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Prefix hijacking is a serious threat in the Internet routing landscape. The Border Gateway Protocol has no origin authentication by design. Countermeasures, e.g. on-top authentication as implemented by R-PKI infrastructures, are not yet deployed on a very large scale. Being victim of prefix hijacking is a difficult situation with few options. Not only the owner of a prefix is victim but all the networks being deceived by the attacker. They are unable to communicate with the owner and corresponding traffic travels into the wrong direction. Current data from the Internet routing plane as collected by RIPE-NCC is examined to detect prefix hijacking. This paper discusses means to manipulate the partitions resulting from prefix hijacking with router inherent functionality. By this means, prefix owners become able to increase their impact and enlarge the corresponding partition, with just one assistant Autonomous System (AS). Selection strategies to find a well suited assistant AS are compared and the top three are verified in an emulation environment. Therefore, an emulation network is created on the dataset that is representative for prefix hijacking in the Internet. The presented approach can be the foundation of a (semi-)automated tool to mitigate prefix hijacking in the future.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Prefix hijacking is a serious threat in the Internet routing landscape. The Border Gateway Protocol has no origin authentication by design. Countermeasures, e.g. on-top authentication as implemented by R-PKI infrastructures, are not yet deployed on a very large scale. Being victim of prefix hijacking is a difficult situation with few options. Not only the owner of a prefix is victim but all the networks being deceived by the attacker. They are unable to communicate with the owner and corresponding traffic travels into the wrong direction. Current data from the Internet routing plane as collected by RIPE-NCC is examined to detect prefix hijacking. This paper discusses means to manipulate the partitions resulting from prefix hijacking with router inherent functionality. By this means, prefix owners become able to increase their impact and enlarge the corresponding partition, with just one assistant Autonomous System (AS). Selection strategies to find a well suited assistant AS are compared and the top three are verified in an emulation environment. Therefore, an emulation network is created on the dataset that is representative for prefix hijacking in the Internet. The presented approach can be the foundation of a (semi-)automated tool to mitigate prefix hijacking in the future.",
"fno": "6523a330",
"keywords": [
"Cryptographic Protocols",
"Internet",
"Internetworking",
"IP Networks",
"Network Servers",
"Routing Protocols",
"Telecommunication Traffic",
"Prefix Owners",
"Prefix Hijacking Mitigation",
"I Psec Tunnels",
"Internet Routing Landscape",
"Border Gateway Protocol",
"R PKI Infrastructure",
"Authentication",
"RIPE NCC",
"Prefix Hijacking Detection",
"Autonomous System",
"AS",
"Routing",
"Internet",
"IP Networks",
"Emulation",
"Authentication",
"Autonomous Systems",
"Internet Routing Anomalies",
"Prefix Hijacking",
"MOAS",
"BGP",
"Routing Security"
],
"authors": [
{
"affiliation": "Fraunhofer FKIE, Univ. of Bonn, Bonn, Germany",
"fullName": "Matthias Wübbeling",
"givenName": "Matthias",
"surname": "Wübbeling",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Fraunhofer FKIE, Univ. of Bonn, Bonn, Germany",
"fullName": "Michael Meier",
"givenName": "Michael",
"surname": "Meier",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "lcn",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2017-10-01T00:00:00",
"pubType": "proceedings",
"pages": "330-338",
"year": "2017",
"issn": "0742-1303",
"isbn": "978-1-5090-6523-3",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "6523a321",
"articleId": "12OmNxvNZYn",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "6523a339",
"articleId": "12OmNzmtWtp",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/icnp/2010/8644/0/05762762",
"title": "TowerDefense: Deployment strategies for battling against IP prefix hijacking",
"doi": null,
"abstractUrl": "/proceedings-article/icnp/2010/05762762/12OmNAP1Z0O",
"parentPublication": {
"id": "proceedings/icnp/2010/8644/0",
"title": "The 18th IEEE International Conference on Network Protocols",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cit/2012/4858/0/4858a375",
"title": "Analysis on the Effect of Prefix Hijacking Attack and Internet Hierarchy",
"doi": null,
"abstractUrl": "/proceedings-article/cit/2012/4858a375/12OmNBIWXCy",
"parentPublication": {
"id": "proceedings/cit/2012/4858/0",
"title": "Computer and Information Technology, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/trustcom/2011/2135/0/06120920",
"title": "Study on IP Prefix Hijacking in Cloud Computing Networks Based on Attack Planning",
"doi": null,
"abstractUrl": "/proceedings-article/trustcom/2011/06120920/12OmNCy2L35",
"parentPublication": {
"id": "proceedings/trustcom/2011/2135/0",
"title": "2011IEEE 10th International Conference on Trust, Security and Privacy in Computing and Communications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ipdpsw/2012/4676/0/4676b197",
"title": "LDC: Detecting BGP Prefix Hijacking by Load Distribution Change",
"doi": null,
"abstractUrl": "/proceedings-article/ipdpsw/2012/4676b197/12OmNrJiD1J",
"parentPublication": {
"id": "proceedings/ipdpsw/2012/4676/0",
"title": "2012 IEEE 26th International Parallel and Distributed Processing Symposium Workshops & PhD Forum",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/lcnw/2016/2347/0/2347a121",
"title": "Improved Calculation of aS Resilience against IP Prefix Hijacking",
"doi": null,
"abstractUrl": "/proceedings-article/lcnw/2016/2347a121/12OmNro0Ifi",
"parentPublication": {
"id": "proceedings/lcnw/2016/2347/0",
"title": "2016 IEEE 41st Conference on Local Computer Networks Workshops (LCN Workshops)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icmecg/2014/6543/0/6543a087",
"title": "A DSA-Based and Efficient Scheme for Preventing IP Prefix Hijacking",
"doi": null,
"abstractUrl": "/proceedings-article/icmecg/2014/6543a087/12OmNvjQ92A",
"parentPublication": {
"id": "proceedings/icmecg/2014/6543/0",
"title": "2014 International Conference on Management of e-Commerce and e-Government (ICMeCG)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sp/2007/2848/0/04223210",
"title": "Accurate Real-time Identification of IP Prefix Hijacking",
"doi": null,
"abstractUrl": "/proceedings-article/sp/2007/04223210/12OmNxZBSCm",
"parentPublication": {
"id": "proceedings/sp/2007/2848/0",
"title": "2007 IEEE Symposium on Security and Privacy (SP '07)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/imis/2012/4684/0/4684a415",
"title": "The Relation on Prefix Hijacking and the Internet Hierarchy",
"doi": null,
"abstractUrl": "/proceedings-article/imis/2012/4684a415/12OmNz6iO7A",
"parentPublication": {
"id": "proceedings/imis/2012/4684/0",
"title": "Innovative Mobile and Internet Services in Ubiquitous Computing, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/lcn/2011/926/0/06115172",
"title": "About prefix hijacking in the Internet",
"doi": null,
"abstractUrl": "/proceedings-article/lcn/2011/06115172/12OmNzmclEu",
"parentPublication": {
"id": "proceedings/lcn/2011/926/0",
"title": "2011 IEEE 36th Conference on Local Computer Networks",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/nt/2010/06/05582115",
"title": "iSPY: Detecting IP Prefix Hijacking on My Own",
"doi": null,
"abstractUrl": "/journal/nt/2010/06/05582115/13rRUxBJhs0",
"parentPublication": {
"id": "trans/nt",
"title": "IEEE/ACM Transactions on Networking",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNyKJiaW",
"title": "Innovative Mobile and Internet Services in Ubiquitous Computing, International Conference on",
"acronym": "imis",
"groupId": "1800457",
"volume": "0",
"displayVolume": "0",
"year": "2012",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNz6iO7A",
"doi": "10.1109/IMIS.2012.40",
"title": "The Relation on Prefix Hijacking and the Internet Hierarchy",
"normalizedTitle": "The Relation on Prefix Hijacking and the Internet Hierarchy",
"abstract": "Border Gateway Protocol (BGP) is the de facto inter-domain routing protocol. There have been many incidents of IP prefix hijacking by BGP protocol in the Internet. Attacks may hijack victim's address space to disrupt network services or perpetrate malicious activities such as spamming and DoS attacks without disclosing identity. The relation on prefix hijacking and the Internet hierarchy is presented in this paper. The Internet is classified into three hierarchies based on the power-law and commercial relations of autonomous systems. The relation of network topology and prefix hijacking influence is presented for all sorts of hijacking events in different layers. The result shows that the hierarchical nature of network influences the prefix hijacking greatly.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Border Gateway Protocol (BGP) is the de facto inter-domain routing protocol. There have been many incidents of IP prefix hijacking by BGP protocol in the Internet. Attacks may hijack victim's address space to disrupt network services or perpetrate malicious activities such as spamming and DoS attacks without disclosing identity. The relation on prefix hijacking and the Internet hierarchy is presented in this paper. The Internet is classified into three hierarchies based on the power-law and commercial relations of autonomous systems. The relation of network topology and prefix hijacking influence is presented for all sorts of hijacking events in different layers. The result shows that the hierarchical nature of network influences the prefix hijacking greatly.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Border Gateway Protocol (BGP) is the de facto inter-domain routing protocol. There have been many incidents of IP prefix hijacking by BGP protocol in the Internet. Attacks may hijack victim's address space to disrupt network services or perpetrate malicious activities such as spamming and DoS attacks without disclosing identity. The relation on prefix hijacking and the Internet hierarchy is presented in this paper. The Internet is classified into three hierarchies based on the power-law and commercial relations of autonomous systems. The relation of network topology and prefix hijacking influence is presented for all sorts of hijacking events in different layers. The result shows that the hierarchical nature of network influences the prefix hijacking greatly.",
"fno": "4684a415",
"keywords": [
"Peer To Peer Computing",
"Internet",
"Routing",
"IP Networks",
"Security",
"Routing Protocols",
"Internet Service Providers",
"IP Prefix Hijacking",
"Power Law",
"BGP",
"Inter Domain Routing System"
],
"authors": [],
"idPrefix": "imis",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2012-07-01T00:00:00",
"pubType": "proceedings",
"pages": "415-420",
"year": "2012",
"issn": null,
"isbn": "978-1-4673-1328-5",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "4684a409",
"articleId": "12OmNx5GU7a",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "4684a421",
"articleId": "12OmNs5rkMq",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/dsn/2009/4422/0/05270359",
"title": "HC-BGP: A light-weight and flexible scheme for securing prefix ownership",
"doi": null,
"abstractUrl": "/proceedings-article/dsn/2009/05270359/12OmNB06l51",
"parentPublication": {
"id": "proceedings/dsn/2009/4422/0",
"title": "2009 IEEE/IFIP International Conference on Dependable Systems & Networks",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cit/2012/4858/0/4858a375",
"title": "Analysis on the Effect of Prefix Hijacking Attack and Internet Hierarchy",
"doi": null,
"abstractUrl": "/proceedings-article/cit/2012/4858a375/12OmNBIWXCy",
"parentPublication": {
"id": "proceedings/cit/2012/4858/0",
"title": "Computer and Information Technology, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/trustcom/2011/2135/0/06120920",
"title": "Study on IP Prefix Hijacking in Cloud Computing Networks Based on Attack Planning",
"doi": null,
"abstractUrl": "/proceedings-article/trustcom/2011/06120920/12OmNCy2L35",
"parentPublication": {
"id": "proceedings/trustcom/2011/2135/0",
"title": "2011IEEE 10th International Conference on Trust, Security and Privacy in Computing and Communications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icnp/2011/1392/0/06089080",
"title": "Argus: An accurate and agile system to detecting IP prefix hijacking",
"doi": null,
"abstractUrl": "/proceedings-article/icnp/2011/06089080/12OmNrJ11Fv",
"parentPublication": {
"id": "proceedings/icnp/2011/1392/0",
"title": "2011 19th IEEE International Conference on Network Protocols",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ipdpsw/2012/4676/0/4676b197",
"title": "LDC: Detecting BGP Prefix Hijacking by Load Distribution Change",
"doi": null,
"abstractUrl": "/proceedings-article/ipdpsw/2012/4676b197/12OmNrJiD1J",
"parentPublication": {
"id": "proceedings/ipdpsw/2012/4676/0",
"title": "2012 IEEE 26th International Parallel and Distributed Processing Symposium Workshops & PhD Forum",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/lcnw/2016/2347/0/2347a121",
"title": "Improved Calculation of aS Resilience against IP Prefix Hijacking",
"doi": null,
"abstractUrl": "/proceedings-article/lcnw/2016/2347a121/12OmNro0Ifi",
"parentPublication": {
"id": "proceedings/lcnw/2016/2347/0",
"title": "2016 IEEE 41st Conference on Local Computer Networks Workshops (LCN Workshops)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/lcn/2017/6523/0/6523a330",
"title": "Reclaim Your Prefix: Mitigation of Prefix Hijacking Using IPsec Tunnels",
"doi": null,
"abstractUrl": "/proceedings-article/lcn/2017/6523a330/12OmNwdL7gr",
"parentPublication": {
"id": "proceedings/lcn/2017/6523/0",
"title": "2017 IEEE 42nd Conference on Local Computer Networks (LCN)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sp/2007/2848/0/04223210",
"title": "Accurate Real-time Identification of IP Prefix Hijacking",
"doi": null,
"abstractUrl": "/proceedings-article/sp/2007/04223210/12OmNxZBSCm",
"parentPublication": {
"id": "proceedings/sp/2007/2848/0",
"title": "2007 IEEE Symposium on Security and Privacy (SP '07)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/lcn/2011/926/0/06115172",
"title": "About prefix hijacking in the Internet",
"doi": null,
"abstractUrl": "/proceedings-article/lcn/2011/06115172/12OmNzmclEu",
"parentPublication": {
"id": "proceedings/lcn/2011/926/0",
"title": "2011 IEEE 36th Conference on Local Computer Networks",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/nt/2010/06/05582115",
"title": "iSPY: Detecting IP Prefix Hijacking on My Own",
"doi": null,
"abstractUrl": "/journal/nt/2010/06/05582115/13rRUxBJhs0",
"parentPublication": {
"id": "trans/nt",
"title": "IEEE/ACM Transactions on Networking",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNykCcdp",
"title": "1988 Computer Networking Symposium",
"acronym": "cns",
"groupId": "1000136",
"volume": "0",
"displayVolume": "0",
"year": "1988",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNzRHOTs",
"doi": "10.1109/CNS.1988.5009",
"title": "Protocols for a transparent, internet, distributed operating system",
"normalizedTitle": "Protocols for a transparent, internet, distributed operating system",
"abstract": "The value of network transparency increases with the size and complexity of the network. However, due to performance considerations, network transparency is difficult to achieve in an internet environment. Specialized protocols were developed for the IPLocus distributed operating system so that transparency is feasible over an internet. These protocols are examined and compared to traditional internet protocols.<<ETX>>",
"abstracts": [
{
"abstractType": "Regular",
"content": "The value of network transparency increases with the size and complexity of the network. However, due to performance considerations, network transparency is difficult to achieve in an internet environment. Specialized protocols were developed for the IPLocus distributed operating system so that transparency is feasible over an internet. These protocols are examined and compared to traditional internet protocols.<<ETX>>",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "The value of network transparency increases with the size and complexity of the network. However, due to performance considerations, network transparency is difficult to achieve in an internet environment. Specialized protocols were developed for the IPLocus distributed operating system so that transparency is feasible over an internet. These protocols are examined and compared to traditional internet protocols.>",
"fno": "00005009",
"keywords": [
"Computer Networks",
"Data Communication Systems",
"Network Operating Systems",
"Performance Evaluation",
"Protocols",
"Transport Level Protocols",
"Flow Control",
"TIDOS",
"Congestion Control",
"Near LAN Performance",
"Long Haul Networks",
"Network Transparency",
"Performance Considerations",
"Internet Environment",
"Protocols",
"IP Locus Distributed Operating System",
"Internet Protocols",
"Protocols",
"Internet",
"Operating Systems",
"IP Networks",
"Local Area Networks",
"Bandwidth",
"ARPANET",
"Application Software",
"Control Systems",
"Contracts"
],
"authors": [
{
"affiliation": "California Univ., Los Angeles, CA, USA",
"fullName": "A.R. Downing",
"givenName": "A.R.",
"surname": "Downing",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "California Univ., Los Angeles, CA, USA",
"fullName": "G.J. Popek",
"givenName": "G.J.",
"surname": "Popek",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "cns",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "1988-01-01T00:00:00",
"pubType": "proceedings",
"pages": "313-321",
"year": "1988",
"issn": null,
"isbn": "0-8186-0835-8",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "00005008",
"articleId": "12OmNASraWO",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "00005010",
"articleId": "12OmNAJm0pk",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/hicss/1989/1912/2/00048106",
"title": "Transport protocol requirements for distributed multimedia information systems",
"doi": null,
"abstractUrl": "/proceedings-article/hicss/1989/00048106/12OmNASraG3",
"parentPublication": {
"id": "proceedings/hicss/1989/1912/2",
"title": "Proceedings of the Twenty-Second Annual Hawaii International Conference on System Sciences. Volume II: Software Track",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/infcom/1993/3580/0/00253324",
"title": "Parallel communication",
"doi": null,
"abstractUrl": "/proceedings-article/infcom/1993/00253324/12OmNC36tPc",
"parentPublication": {
"id": "proceedings/infcom/1993/3580/0",
"title": "IEEE INFOCOM '93",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/hotos/1995/7081/0/00513471",
"title": "Operating systems support for busy Internet servers",
"doi": null,
"abstractUrl": "/proceedings-article/hotos/1995/00513471/12OmNqESudn",
"parentPublication": {
"id": "proceedings/hotos/1995/7081/0",
"title": "Hot Topics in Operating Systems, Workshop on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pdsw/2008/4208/0/04811885",
"title": "Performance of RDMA-capable storage protocols on wide-area network",
"doi": null,
"abstractUrl": "/proceedings-article/pdsw/2008/04811885/12OmNwKYbsk",
"parentPublication": {
"id": "proceedings/pdsw/2008/4208/0",
"title": "2008 3rd Petascale Data Storage Workshop. (PDSW '08)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/infcom/1994/5570/0/00337661",
"title": "Bounding the unbounded [distributed computing protocols]",
"doi": null,
"abstractUrl": "/proceedings-article/infcom/1994/00337661/12OmNyTwRci",
"parentPublication": {
"id": "proceedings/infcom/1994/5570/0",
"title": "Proceedings of INFOCOM '94 Conference on Computer Communications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/dcs/1988/0865/0/00012493",
"title": "The Clouds distributed operating system: functional description, implementation details and related work",
"doi": null,
"abstractUrl": "/proceedings-article/dcs/1988/00012493/12OmNz2kqqF",
"parentPublication": {
"id": "proceedings/dcs/1988/0865/0",
"title": "The 8th International Conference on Distributed",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/lcn/1991/2370/0/00208062",
"title": "Brouter: the transparent bridge with shortest path in interconnected LANs",
"doi": null,
"abstractUrl": "/proceedings-article/lcn/1991/00208062/12OmNzlUKEd",
"parentPublication": {
"id": "proceedings/lcn/1991/2370/0",
"title": "[1991] Proceedings 16th Conference on Local Computer Networks",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/nt/1999/04/00793022",
"title": "Mitigating server-side congestion in the Internet through pseudoserving",
"doi": null,
"abstractUrl": "/journal/nt/1999/04/00793022/13rRUEgs2qs",
"parentPublication": {
"id": "trans/nt",
"title": "IEEE/ACM Transactions on Networking",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ts/1986/11/06312996",
"title": "Internet Locus: Extending transparency to an Internet environment",
"doi": null,
"abstractUrl": "/journal/ts/1986/11/06312996/13rRUIJuxrd",
"parentPublication": {
"id": "trans/ts",
"title": "IEEE Transactions on Software Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/td/1990/01/l0017",
"title": "Broadcast Protocols for Distributed Systems",
"doi": null,
"abstractUrl": "/journal/td/1990/01/l0017/13rRUxjyX3k",
"parentPublication": {
"id": "trans/td",
"title": "IEEE Transactions on Parallel & Distributed Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNzUPpw6",
"title": "2011 IEEE 36th Conference on Local Computer Networks",
"acronym": "lcn",
"groupId": "1000419",
"volume": "0",
"displayVolume": "0",
"year": "2011",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNzmclEu",
"doi": "10.1109/LCN.2011.6115172",
"title": "About prefix hijacking in the Internet",
"normalizedTitle": "About prefix hijacking in the Internet",
"abstract": "From time to time, global routing is affected by local misconfigurations of global impact. Incorrect routing information leaks into the global routing IP address space becomes hijacked. As such incidents are highly problematic and may even serve as blueprints for purposeful attacks, concepts to prevent or at least automatically detect such incidents are desirable. As planned architectures to prevent prefix hijacking incidents will need some time to become globally deployed and may be ineffective if manipulations are obfuscated, automatic detection seems to be an crucial facet. In this paper, we study a misconflguration event that could serve as blueprint for attacks. With this analysis, we try to provide starting points for the development of indicators to detect routing manipulations and classify them automatically.",
"abstracts": [
{
"abstractType": "Regular",
"content": "From time to time, global routing is affected by local misconfigurations of global impact. Incorrect routing information leaks into the global routing IP address space becomes hijacked. As such incidents are highly problematic and may even serve as blueprints for purposeful attacks, concepts to prevent or at least automatically detect such incidents are desirable. As planned architectures to prevent prefix hijacking incidents will need some time to become globally deployed and may be ineffective if manipulations are obfuscated, automatic detection seems to be an crucial facet. In this paper, we study a misconflguration event that could serve as blueprint for attacks. With this analysis, we try to provide starting points for the development of indicators to detect routing manipulations and classify them automatically.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "From time to time, global routing is affected by local misconfigurations of global impact. Incorrect routing information leaks into the global routing IP address space becomes hijacked. As such incidents are highly problematic and may even serve as blueprints for purposeful attacks, concepts to prevent or at least automatically detect such incidents are desirable. As planned architectures to prevent prefix hijacking incidents will need some time to become globally deployed and may be ineffective if manipulations are obfuscated, automatic detection seems to be an crucial facet. In this paper, we study a misconflguration event that could serve as blueprint for attacks. With this analysis, we try to provide starting points for the development of indicators to detect routing manipulations and classify them automatically.",
"fno": "06115172",
"keywords": [
"Computer Network Security",
"Internet",
"IP Networks",
"Telecommunication Network Routing",
"Prefix Hijacking",
"Internet",
"Global Routing IP Address",
"Routing Manipulation",
"Routing",
"You Tube",
"Internet",
"Security",
"IP Networks",
"Protocols",
"Servers",
"Routing Protocols",
"BGP",
"Security",
"Prefix Hijacking"
],
"authors": [
{
"affiliation": "University of Bonn - Institute of Computer Science 4 - Friedrich-Ebert-Allee 144 - D - 53113 Bonn",
"fullName": "Uli Bornhauser",
"givenName": "Uli",
"surname": "Bornhauser",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "University of Bonn - Institute of Computer Science 4 - Friedrich-Ebert-Allee 144 - D - 53113 Bonn",
"fullName": "Peter Martini",
"givenName": "Peter",
"surname": "Martini",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "lcn",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2011-10-01T00:00:00",
"pubType": "proceedings",
"pages": "143-146",
"year": "2011",
"issn": "0742-1303",
"isbn": "978-1-61284-926-3",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "06115171",
"articleId": "12OmNvnwVns",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "06115173",
"articleId": "12OmNvvc5NR",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/dsn/2009/4422/0/05270359",
"title": "HC-BGP: A light-weight and flexible scheme for securing prefix ownership",
"doi": null,
"abstractUrl": "/proceedings-article/dsn/2009/05270359/12OmNB06l51",
"parentPublication": {
"id": "proceedings/dsn/2009/4422/0",
"title": "2009 IEEE/IFIP International Conference on Dependable Systems & Networks",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/trustcom-bigdatase-i-spa/2016/3205/0/07846951",
"title": "The Power of Prefix Hijackings in the Internet Hierarchy",
"doi": null,
"abstractUrl": "/proceedings-article/trustcom-bigdatase-i-spa/2016/07846951/12OmNB1NVOd",
"parentPublication": {
"id": "proceedings/trustcom-bigdatase-i-spa/2016/3205/0",
"title": "2016 IEEE Trustcom/BigDataSE/ISPA",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cit/2012/4858/0/4858a375",
"title": "Analysis on the Effect of Prefix Hijacking Attack and Internet Hierarchy",
"doi": null,
"abstractUrl": "/proceedings-article/cit/2012/4858a375/12OmNBIWXCy",
"parentPublication": {
"id": "proceedings/cit/2012/4858/0",
"title": "Computer and Information Technology, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/trustcom/2011/2135/0/06120920",
"title": "Study on IP Prefix Hijacking in Cloud Computing Networks Based on Attack Planning",
"doi": null,
"abstractUrl": "/proceedings-article/trustcom/2011/06120920/12OmNCy2L35",
"parentPublication": {
"id": "proceedings/trustcom/2011/2135/0",
"title": "2011IEEE 10th International Conference on Trust, Security and Privacy in Computing and Communications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/lcnw/2016/2347/0/2347a121",
"title": "Improved Calculation of aS Resilience against IP Prefix Hijacking",
"doi": null,
"abstractUrl": "/proceedings-article/lcnw/2016/2347a121/12OmNro0Ifi",
"parentPublication": {
"id": "proceedings/lcnw/2016/2347/0",
"title": "2016 IEEE 41st Conference on Local Computer Networks Workshops (LCN Workshops)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sp/2017/5533/0/07958588",
"title": "Hijacking Bitcoin: Routing Attacks on Cryptocurrencies",
"doi": null,
"abstractUrl": "/proceedings-article/sp/2017/07958588/12OmNvjgWwz",
"parentPublication": {
"id": "proceedings/sp/2017/5533/0",
"title": "2017 IEEE Symposium on Security and Privacy (SP)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/lcn/2017/6523/0/6523a330",
"title": "Reclaim Your Prefix: Mitigation of Prefix Hijacking Using IPsec Tunnels",
"doi": null,
"abstractUrl": "/proceedings-article/lcn/2017/6523a330/12OmNwdL7gr",
"parentPublication": {
"id": "proceedings/lcn/2017/6523/0",
"title": "2017 IEEE 42nd Conference on Local Computer Networks (LCN)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/imis/2012/4684/0/4684a415",
"title": "The Relation on Prefix Hijacking and the Internet Hierarchy",
"doi": null,
"abstractUrl": "/proceedings-article/imis/2012/4684a415/12OmNz6iO7A",
"parentPublication": {
"id": "proceedings/imis/2012/4684/0",
"title": "Innovative Mobile and Internet Services in Ubiquitous Computing, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/nt/2010/06/05582115",
"title": "iSPY: Detecting IP Prefix Hijacking on My Own",
"doi": null,
"abstractUrl": "/journal/nt/2010/06/05582115/13rRUxBJhs0",
"parentPublication": {
"id": "trans/nt",
"title": "IEEE/ACM Transactions on Networking",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/aiipcc/2022/6287/0/628700a050",
"title": "Research and Development of Intelligent Protection Capabilities Against Internet Routing Hijacking and Leakage",
"doi": null,
"abstractUrl": "/proceedings-article/aiipcc/2022/628700a050/1LR9UHr8Aso",
"parentPublication": {
"id": "proceedings/aiipcc/2022/6287/0",
"title": "2022 International Conference on Artificial Intelligence, Information Processing and Cloud Computing (AIIPCC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNy3iFun",
"title": "2009 IEEE 6th International Conference on Mobile Adhoc and Sensor Systems",
"acronym": "mass",
"groupId": "1001499",
"volume": "0",
"displayVolume": "0",
"year": "2009",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNA2cYCC",
"doi": "10.1109/MOBHOC.2009.5337016",
"title": "Quantum communication in distributed wireless sensor networks",
"normalizedTitle": "Quantum communication in distributed wireless sensor networks",
"abstract": "In the wireless sensor networks (WSNs), sensor nodes may be deployed in the hostile areas. The eavesdropper can intercept the messages in the public channel and the communication between the nodes is easily monitored. Furthermore, any malicious intermediate node can act as a legal receiver to alter the passing messages. Hence, message protection and sensor node identification become important issues in WSN. In this paper, we propose a novel scheme providing unconditional secure communication based on the quantum characteristics, including no-cloning and teleportation. We present a random EPR-pair allocation scheme that is designed to overcome the vulnerability caused by possible compromised nodes. EPR pairs are pre-assigned to sensor nodes randomly and the entangled qubits are used by the nodes with the quantum teleportation scheme to form a secure link. We also show a scheme on how to resist the man-in-the-middle attack. In the framework, the qubits are allocated to each node before deployment and the adversary is unable to create the duplicated nodes. Even if the malicious nodes are added to the network to falsify the messages transmitting in the public channel, the legal nodes can easily detect the fake nodes that have no entangled qubits and verify the counterfeit messages. In addition, we prove that one node sharing EPR pairs with a certain amount of neighbor nodes can teleport information to any node in the sensor network if there are sufficient EPR pairs in the qubits pool. The proposal shows that the distributed quantum wireless sensor network gains better security than classical wireless sensor network and centralized quantum wireless network.",
"abstracts": [
{
"abstractType": "Regular",
"content": "In the wireless sensor networks (WSNs), sensor nodes may be deployed in the hostile areas. The eavesdropper can intercept the messages in the public channel and the communication between the nodes is easily monitored. Furthermore, any malicious intermediate node can act as a legal receiver to alter the passing messages. Hence, message protection and sensor node identification become important issues in WSN. In this paper, we propose a novel scheme providing unconditional secure communication based on the quantum characteristics, including no-cloning and teleportation. We present a random EPR-pair allocation scheme that is designed to overcome the vulnerability caused by possible compromised nodes. EPR pairs are pre-assigned to sensor nodes randomly and the entangled qubits are used by the nodes with the quantum teleportation scheme to form a secure link. We also show a scheme on how to resist the man-in-the-middle attack. In the framework, the qubits are allocated to each node before deployment and the adversary is unable to create the duplicated nodes. Even if the malicious nodes are added to the network to falsify the messages transmitting in the public channel, the legal nodes can easily detect the fake nodes that have no entangled qubits and verify the counterfeit messages. In addition, we prove that one node sharing EPR pairs with a certain amount of neighbor nodes can teleport information to any node in the sensor network if there are sufficient EPR pairs in the qubits pool. The proposal shows that the distributed quantum wireless sensor network gains better security than classical wireless sensor network and centralized quantum wireless network.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "In the wireless sensor networks (WSNs), sensor nodes may be deployed in the hostile areas. The eavesdropper can intercept the messages in the public channel and the communication between the nodes is easily monitored. Furthermore, any malicious intermediate node can act as a legal receiver to alter the passing messages. Hence, message protection and sensor node identification become important issues in WSN. In this paper, we propose a novel scheme providing unconditional secure communication based on the quantum characteristics, including no-cloning and teleportation. We present a random EPR-pair allocation scheme that is designed to overcome the vulnerability caused by possible compromised nodes. EPR pairs are pre-assigned to sensor nodes randomly and the entangled qubits are used by the nodes with the quantum teleportation scheme to form a secure link. We also show a scheme on how to resist the man-in-the-middle attack. In the framework, the qubits are allocated to each node before deployment and the adversary is unable to create the duplicated nodes. Even if the malicious nodes are added to the network to falsify the messages transmitting in the public channel, the legal nodes can easily detect the fake nodes that have no entangled qubits and verify the counterfeit messages. In addition, we prove that one node sharing EPR pairs with a certain amount of neighbor nodes can teleport information to any node in the sensor network if there are sufficient EPR pairs in the qubits pool. The proposal shows that the distributed quantum wireless sensor network gains better security than classical wireless sensor network and centralized quantum wireless network.",
"fno": "05337016",
"keywords": [
"Quantum Communication",
"Quantum Entanglement",
"Telecommunication Network Reliability",
"Telecommunication Security",
"Wireless Channels",
"Wireless Sensor Networks",
"Quantum Communication",
"Distributed Wireless Sensor Network",
"Public Channel",
"Message Passing",
"Communication Security",
"Random EPR Pair Allocation Scheme",
"WSN Vulnerability",
"Qubit Entanglement",
"Wireless Sensor Networks",
"Paramagnetic Resonance",
"Law",
"Legal Factors",
"Sensor Phenomena And Characterization",
"Teleportation",
"Monitoring",
"Protection",
"Quantum Entanglement",
"Resists",
"No Cloning",
"Teleportation",
"EPR Pair Allocation"
],
"authors": [
{
"affiliation": "Institute of Computer and Communication Engineering, National Cheng Kung University, Tainan, Taiwan, R.O.C.",
"fullName": "Jung-Shian Li",
"givenName": "Jung-Shian",
"surname": "Li",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Institute of Computer and Communication Engineering, National Cheng Kung University, Tainan, Taiwan, R.O.C.",
"fullName": "Ching-Fang Yang",
"givenName": "Ching-Fang",
"surname": "Yang",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "mass",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2009-10-01T00:00:00",
"pubType": "proceedings",
"pages": "",
"year": "2009",
"issn": "2155-6806",
"isbn": "978-1-4244-5114-2",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "05337018",
"articleId": "12OmNz2C1rX",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "05337014",
"articleId": "12OmNzyp63Y",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/npc/2008/3354/0/3354a549",
"title": "A Group Quantum Communication Network Using Quantum Secret Sharing",
"doi": null,
"abstractUrl": "/proceedings-article/npc/2008/3354a549/12OmNwe2IwT",
"parentPublication": {
"id": "proceedings/npc/2008/3354/0",
"title": "Network and Parallel Computing Workshops, IFIP International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/isca/2006/2608/0/26080366",
"title": "Interconnection Networks for Scalable Quantum Computers",
"doi": null,
"abstractUrl": "/proceedings-article/isca/2006/26080366/12OmNyrIaKk",
"parentPublication": {
"id": "proceedings/isca/2006/2608/0",
"title": "Proceedings. 33rd International Symposium on Computer Architecture",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ispa-iucc/2017/3790/0/379001b422",
"title": "Graph-Based Quantum Parallel Teleportation in Quantum Wireless Multi-Hop Networks",
"doi": null,
"abstractUrl": "/proceedings-article/ispa-iucc/2017/379001b422/17D45Xh13ru",
"parentPublication": {
"id": "proceedings/ispa-iucc/2017/3790/0",
"title": "2017 IEEE International Symposium on Parallel and Distributed Processing with Applications and 2017 IEEE International Conference on Ubiquitous Computing and Communications (ISPA/IUCC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/qe/2022/01/09760110",
"title": "Efficient Quantum Network Communication Using Optimized Entanglement Swapping Trees",
"doi": null,
"abstractUrl": "/journal/qe/2022/01/09760110/1CHsD5G2J6E",
"parentPublication": {
"id": "trans/qe",
"title": "IEEE Transactions on Quantum Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/qe/2022/01/09779492",
"title": "A Connection-Oriented Entanglement Distribution Design in Quantum Networks",
"doi": null,
"abstractUrl": "/journal/qe/2022/01/09779492/1DwUDdErb8s",
"parentPublication": {
"id": "trans/qe",
"title": "IEEE Transactions on Quantum Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/csp/2022/7975/0/797500a001",
"title": "Teleporting Qubits Between Participants by Third-Party Center",
"doi": null,
"abstractUrl": "/proceedings-article/csp/2022/797500a001/1FRKJBSLnS8",
"parentPublication": {
"id": "proceedings/csp/2022/7975/0",
"title": "2022 6th International Conference on Cryptography, Security and Privacy (CSP)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/nca/2022/9730/21/10013538",
"title": "Distributed Coordination Based on Quantum Entanglement (Work in Progress)",
"doi": null,
"abstractUrl": "/proceedings-article/nca/2022/10013538/1JZ44fjI1kQ",
"parentPublication": {
"id": "proceedings/nca/2022/9730/21",
"title": "2022 IEEE 21st International Symposium on Network Computing and Applications (NCA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/nt/5555/01/10092522",
"title": "Distributed Transport Protocols for Quantum Data Networks",
"doi": null,
"abstractUrl": "/journal/nt/5555/01/10092522/1M61JWVvrTG",
"parentPublication": {
"id": "trans/nt",
"title": "IEEE/ACM Transactions on Networking",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pdcat/2019/2616/0/261600a179",
"title": "Faithful Multi-Hop Qubit Transmission Based on GHZ States",
"doi": null,
"abstractUrl": "/proceedings-article/pdcat/2019/261600a179/1iff6fnWr7y",
"parentPublication": {
"id": "proceedings/pdcat/2019/2616/0",
"title": "2019 20th International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ccict/2021/2392/0/239200a084",
"title": "Quantum Memory Multiple Access",
"doi": null,
"abstractUrl": "/proceedings-article/ccict/2021/239200a084/1wkvFUdnq36",
"parentPublication": {
"id": "proceedings/ccict/2021/2392/0",
"title": "2021 Fourth International Conference on Computational Intelligence and Communication Technologies (CCICT)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNxRnvRV",
"title": "2006 IEEE/ACM 6th Joint Conference on Digital Libraries",
"acronym": "jcdl",
"groupId": "1804605",
"volume": "0",
"displayVolume": "0",
"year": "2006",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNCbCrHX",
"doi": "10.1145/1141753.1141868",
"title": "Exploring content-actor paired network data using iterative query refinement with NetLens",
"normalizedTitle": "Exploring content-actor paired network data using iterative query refinement with NetLens",
"abstract": "Networks have remained a challenge for information retrieval and visualization because of the rich set of tasks that users want to accomplish. This paper demonstrates a tool, NetLens, to explore a content-actor paired network data model. The NetLens interface was designed to allow users to pose a series of elementary queries and iteratively refine visual overviews and sorted lists. This enables the support of complex queries that are traditionally hard to specify in node-link visualizations. NetLens is general and scalable in that it applies to any dataset that can be represented with our abstract content-actor data model",
"abstracts": [
{
"abstractType": "Regular",
"content": "Networks have remained a challenge for information retrieval and visualization because of the rich set of tasks that users want to accomplish. This paper demonstrates a tool, NetLens, to explore a content-actor paired network data model. The NetLens interface was designed to allow users to pose a series of elementary queries and iteratively refine visual overviews and sorted lists. This enables the support of complex queries that are traditionally hard to specify in node-link visualizations. NetLens is general and scalable in that it applies to any dataset that can be represented with our abstract content-actor data model",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Networks have remained a challenge for information retrieval and visualization because of the rich set of tasks that users want to accomplish. This paper demonstrates a tool, NetLens, to explore a content-actor paired network data model. The NetLens interface was designed to allow users to pose a series of elementary queries and iteratively refine visual overviews and sorted lists. This enables the support of complex queries that are traditionally hard to specify in node-link visualizations. NetLens is general and scalable in that it applies to any dataset that can be represented with our abstract content-actor data model",
"fno": "04119187",
"keywords": [
"Data Models",
"Data Visualisation",
"Digital Libraries",
"Query Processing",
"User Interface Management Systems",
"Content Actor Pair Network Data Model",
"Iterative Query Refinement",
"Net Lens",
"Information Retrieval",
"Data Visualization",
"Educational Institutions",
"Data Visualization",
"Computer Networks",
"Data Models",
"User Interfaces",
"Graphical User Interfaces",
"Software Libraries",
"Law",
"Legal Factors",
"Computer Science",
"Digital Library",
"Human Computer Interaction",
"Incremental Data Exploration",
"Iterative Query Refinement",
"Network Visualization",
"Piccolo",
"User Interfaces"
],
"authors": [
{
"affiliation": "University of Maryland, College Park, MD",
"fullName": "Benjamin B. Bederson",
"givenName": "Benjamin B.",
"surname": "Bederson",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "University of Maryland, College Park, MDUniversity of Maryland, College Park, MD",
"fullName": "Bongshin Lee",
"givenName": "Bongshin",
"surname": "Lee",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "University of Maryland Institute for Advanced Computer Studies, College Park, MD",
"fullName": "Catherine Plaisant",
"givenName": "Catherine",
"surname": "Plaisant",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "University of Maryland Institute for Advanced Computer Studies, College Park, MD",
"fullName": "Hyunmo Kang",
"givenName": "Hyunmo",
"surname": "Kang",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "jcdl",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2006-06-01T00:00:00",
"pubType": "proceedings",
"pages": "",
"year": "2006",
"issn": null,
"isbn": "1-59593-354-9",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "04119186",
"articleId": "12OmNwFidc7",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "04119188",
"articleId": "12OmNwJPMW0",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/pci/2009/3788/0/3788a215",
"title": "Exploring Gadget-Based Interfaces for the Social Semantic Desktop",
"doi": null,
"abstractUrl": "/proceedings-article/pci/2009/3788a215/12OmNvIxeVZ",
"parentPublication": {
"id": "proceedings/pci/2009/3788/0",
"title": "2009 13th Panhellenic Conference on Informatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cmpsac/1993/4440/0/00404183",
"title": "DELTA-DEsign Language To Actor",
"doi": null,
"abstractUrl": "/proceedings-article/cmpsac/1993/00404183/12OmNwCsdxx",
"parentPublication": {
"id": "proceedings/cmpsac/1993/4440/0",
"title": "Proceedings of 1993 IEEE 17th International Computer Software and Applications Conference COMPSAC '93",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/compsac/2013/4986/0/4986a820",
"title": "A Retrospection on Building a Custom Tool for Automated System Testing",
"doi": null,
"abstractUrl": "/proceedings-article/compsac/2013/4986a820/12OmNwuvrUF",
"parentPublication": {
"id": "proceedings/compsac/2013/4986/0",
"title": "2013 IEEE 37th Annual Computer Software and Applications Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/avss/2015/7632/0/07301807",
"title": "An end-to-end system for content-based video retrieval using behavior, actions, and appearance with interactive query refinement",
"doi": null,
"abstractUrl": "/proceedings-article/avss/2015/07301807/12OmNxbW4RI",
"parentPublication": {
"id": "proceedings/avss/2015/7632/0",
"title": "2015 12th IEEE International Conference on Advanced Video and Signal Based Surveillance (AVSS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icstw/2018/6352/0/635201a138",
"title": "Introducing Automated GUI Testing and Observing Its Benefits: An Industrial Case Study in the Context of Law-Practice Management Software",
"doi": null,
"abstractUrl": "/proceedings-article/icstw/2018/635201a138/12OmNxwENDs",
"parentPublication": {
"id": "proceedings/icstw/2018/6352/0",
"title": "2018 IEEE International Conference on Software Testing, Verification and Validation Workshops (ICSTW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vast/2006/0591/0/04035752",
"title": "NetLens: Iterative Exploration of Content-Actor Network Data",
"doi": null,
"abstractUrl": "/proceedings-article/vast/2006/04035752/12OmNz61ds4",
"parentPublication": {
"id": "proceedings/vast/2006/0591/0",
"title": "2006 IEEE Symposium On Visual Analytics Science And Technology",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/it/2017/06/mit2017060058",
"title": "High-Performance with an In-GPU Graph Database Cache",
"doi": null,
"abstractUrl": "/magazine/it/2017/06/mit2017060058/13rRUxAATd2",
"parentPublication": {
"id": "mags/it",
"title": "IT Professional",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2006/05/v0733",
"title": "Network Visualization by Semantic Substrates",
"doi": null,
"abstractUrl": "/journal/tg/2006/05/v0733/13rRUxASuMv",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/pc/2010/02/mpc2010020046",
"title": "Linking Digital Media to Physical Documents: Comparing Content- and Marker-Based Tags",
"doi": null,
"abstractUrl": "/magazine/pc/2010/02/mpc2010020046/13rRUzpQPN7",
"parentPublication": {
"id": "mags/pc",
"title": "IEEE Pervasive Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ainit/2021/1296/0/129600a699",
"title": "Actor Information Crawling System Based On Python",
"doi": null,
"abstractUrl": "/proceedings-article/ainit/2021/129600a699/1BzWFFtkie4",
"parentPublication": {
"id": "proceedings/ainit/2021/1296/0",
"title": "2021 2nd International Seminar on Artificial Intelligence, Networking and Information Technology (AINIT)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNxwWoqL",
"title": "Computer Security Applications Conference, Annual",
"acronym": "acsac",
"groupId": "1000141",
"volume": "0",
"displayVolume": "0",
"year": "1997",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNrNh0Oz",
"doi": "10.1109/CSAC.1997.646196",
"title": "Ethical responsibilities and legal liabilities of network security professionals",
"normalizedTitle": "Ethical responsibilities and legal liabilities of network security professionals",
"abstract": "Profits, losses and the attendant risks of tort litigation run to the extreme in times of great speculation in an unregulated economic environment-conditions which characterize the present enormous growth in computer networking. Public law enforcement has thus far been largely ineffectual in deterring or even detecting criminal abuses of network resources. At the same time, reliance primarily on technical solutions for preventing and redressing criminal and civil wrongs may prove to be more harmful to individual and group liberties than imaginative and ethical attempts to use the criminal and civil law traditions. The anticipated storm of civil litigation flowing from the Year 2000 (Y2K) crisis can be expected to create a critical mass in both the number of new computer literate lawyers and in their experimentation with and confidence in the use of tort law for computer security failures and other Y2K related litigation. Among the risks that prudent network security professionals need to be concerned with, as they plan to deal with the millennium bug, is the growing risk of legal liability for security failures. Computer security professionals have not yet had to answer to any moral or legal outcry for social redress of the lack of security in the networks, while the tradition of keeping secret the vulnerabilities of evolving computer network technology has only recently begun to be seriously questioned by the profession and others.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Profits, losses and the attendant risks of tort litigation run to the extreme in times of great speculation in an unregulated economic environment-conditions which characterize the present enormous growth in computer networking. Public law enforcement has thus far been largely ineffectual in deterring or even detecting criminal abuses of network resources. At the same time, reliance primarily on technical solutions for preventing and redressing criminal and civil wrongs may prove to be more harmful to individual and group liberties than imaginative and ethical attempts to use the criminal and civil law traditions. The anticipated storm of civil litigation flowing from the Year 2000 (Y2K) crisis can be expected to create a critical mass in both the number of new computer literate lawyers and in their experimentation with and confidence in the use of tort law for computer security failures and other Y2K related litigation. Among the risks that prudent network security professionals need to be concerned with, as they plan to deal with the millennium bug, is the growing risk of legal liability for security failures. Computer security professionals have not yet had to answer to any moral or legal outcry for social redress of the lack of security in the networks, while the tradition of keeping secret the vulnerabilities of evolving computer network technology has only recently begun to be seriously questioned by the profession and others.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Profits, losses and the attendant risks of tort litigation run to the extreme in times of great speculation in an unregulated economic environment-conditions which characterize the present enormous growth in computer networking. Public law enforcement has thus far been largely ineffectual in deterring or even detecting criminal abuses of network resources. At the same time, reliance primarily on technical solutions for preventing and redressing criminal and civil wrongs may prove to be more harmful to individual and group liberties than imaginative and ethical attempts to use the criminal and civil law traditions. The anticipated storm of civil litigation flowing from the Year 2000 (Y2K) crisis can be expected to create a critical mass in both the number of new computer literate lawyers and in their experimentation with and confidence in the use of tort law for computer security failures and other Y2K related litigation. Among the risks that prudent network security professionals need to be concerned with, as they plan to deal with the millennium bug, is the growing risk of legal liability for security failures. Computer security professionals have not yet had to answer to any moral or legal outcry for social redress of the lack of security in the networks, while the tradition of keeping secret the vulnerabilities of evolving computer network technology has only recently begun to be seriously questioned by the profession and others.",
"fno": "82740239",
"keywords": [
"Computer Networks Ethical Responsibilities Legal Liabilities Network Security Professionals Tort Litigation Unregulated Economic Environment Computer Networking Public Law Enforcement Criminal Abuses Technical Solutions Civil Wrongs Individual Liberty Group Liberty Criminal Law Civil Law Year 2000 Problem Computer Literate Lawyers Computer Security Failures Millennium Bug Legal Liability Morality Social Redress Network Vulnerabilities"
],
"authors": [
{
"affiliation": "Rose, Kohl & Davenport Ltd., Santa Fe, NM, USA",
"fullName": "F.C. Smith",
"givenName": "F.C.",
"surname": "Smith",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "acsac",
"isOpenAccess": false,
"showRecommendedArticles": false,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "1997-12-01T00:00:00",
"pubType": "proceedings",
"pages": "239",
"year": "1997",
"issn": null,
"isbn": "0-8186-8274-4",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "82740232",
"articleId": "12OmNwwMeYo",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "82740251",
"articleId": "12OmNwM6A2u",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNx3HI1C",
"title": "1990 IEEE International Conference on Computer-Aided Design",
"acronym": "iccad",
"groupId": "1000151",
"volume": "0",
"displayVolume": "0",
"year": "1990",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNrYCXS9",
"doi": "10.1109/ICCAD.1990.129853",
"title": "Floorplanning by topological constraint reduction",
"normalizedTitle": "Floorplanning by topological constraint reduction",
"abstract": "The problem considered is that of producing a legal floorplan that respects a given topological constraint set. The floorplanning approach described is targeted for multilayer sea-of-cells based designs. Therefore it is assumed that no channel separations are required between the blocks. The approach can be generalized to incorporate channel separations.<>",
"abstracts": [
{
"abstractType": "Regular",
"content": "The problem considered is that of producing a legal floorplan that respects a given topological constraint set. The floorplanning approach described is targeted for multilayer sea-of-cells based designs. Therefore it is assumed that no channel separations are required between the blocks. The approach can be generalized to incorporate channel separations.<>",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "The problem considered is that of producing a legal floorplan that respects a given topological constraint set. The floorplanning approach described is targeted for multilayer sea-of-cells based designs. Therefore it is assumed that no channel separations are required between the blocks. The approach can be generalized to incorporate channel separations.",
"fno": "00129853",
"keywords": [
"Circuit Layout CAD",
"Topological Constraint Reduction",
"Legal Floorplan",
"Multilayer Sea Of Cells Based Designs",
"Law",
"Legal Factors",
"Shape",
"Linear Programming",
"Dynamic Programming",
"Constraint Optimization",
"Simulated Annealing",
"Compaction"
],
"authors": [
{
"affiliation": "IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA",
"fullName": "G. Vijayan",
"givenName": "G.",
"surname": "Vijayan",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA",
"fullName": "R.S. Tsay",
"givenName": "R.S.",
"surname": "Tsay",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "iccad",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "1990-01-01T00:00:00",
"pubType": "proceedings",
"pages": "106,107,108,109",
"year": "1990",
"issn": null,
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "00129852",
"articleId": "12OmNwdtwbQ",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "00129855",
"articleId": "12OmNyQpgUQ",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/aspdac/2001/6633/0/00913359",
"title": "VLSI floorplanning with boundary constraints based on corner block list",
"doi": null,
"abstractUrl": "/proceedings-article/aspdac/2001/00913359/12OmNvkGW63",
"parentPublication": {
"id": "proceedings/aspdac/2001/6633/0",
"title": "Proceedings of the ASP-DAC 2001. Asia and South Pacific Design Automation Conference 2001",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccad/2007/1381/0/04397329",
"title": "3D-STAF: scalable temperature and leakage aware floorplanning for three-dimensional integrated circuits",
"doi": null,
"abstractUrl": "/proceedings-article/iccad/2007/04397329/12OmNvvtGX9",
"parentPublication": {
"id": "proceedings/iccad/2007/1381/0",
"title": "2007 IEEE/ACM International Conference on Computer Aided Design",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccad/1991/2157/0/00185190",
"title": "A floorplanning algorithm using rectangular Voronoi diagram and force-directed block shaping",
"doi": null,
"abstractUrl": "/proceedings-article/iccad/1991/00185190/12OmNxETaf7",
"parentPublication": {
"id": "proceedings/iccad/1991/2157/0",
"title": "1991 IEEE International Conference on Computer-Aided Design Digest of Technical Papers",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vlsid/1997/7755/0/77550021",
"title": "Macro Block Based FPGA Floorplanning",
"doi": null,
"abstractUrl": "/proceedings-article/vlsid/1997/77550021/12OmNxj23dk",
"parentPublication": {
"id": "proceedings/vlsid/1997/7755/0",
"title": "VLSI Design, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/date/2007/2/0/04211975",
"title": "Microarchitecture Floorplanning for Sub-threshold Leakage Reduction",
"doi": null,
"abstractUrl": "/proceedings-article/date/2007/04211975/12OmNxwWorj",
"parentPublication": {
"id": "proceedings/date/2007/2/0",
"title": "2007 10th Design, Automation and Test in Europe Conference and Exhibition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iscbi/2015/8501/0/8501a021",
"title": "An Improved Simulated Annealing Algorithm and Area Model for the Fixed-Outline Floorplanning with Hard Modules",
"doi": null,
"abstractUrl": "/proceedings-article/iscbi/2015/8501a021/12OmNybfr9s",
"parentPublication": {
"id": "proceedings/iscbi/2015/8501/0",
"title": "2015 3rd International Symposium on Computational and Business Intelligence (ISCBI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccad/2007/1381/0/04397338",
"title": "Voltage island-driven floorplanning",
"doi": null,
"abstractUrl": "/proceedings-article/iccad/2007/04397338/12OmNyxFKaU",
"parentPublication": {
"id": "proceedings/iccad/2007/1381/0",
"title": "2007 IEEE/ACM International Conference on Computer Aided Design",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/si/2001/02/00924056",
"title": "Fast floorplanning for effective prediction and construction",
"doi": null,
"abstractUrl": "/journal/si/2001/02/00924056/13rRUEgs2zg",
"parentPublication": {
"id": "trans/si",
"title": "IEEE Transactions on Very Large Scale Integration (VLSI) Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/si/2004/08/01316901",
"title": "An orthogonal simulated annealing algorithm for large floorplanning problems",
"doi": null,
"abstractUrl": "/journal/si/2004/08/01316901/13rRUwvT9ed",
"parentPublication": {
"id": "trans/si",
"title": "IEEE Transactions on Very Large Scale Integration (VLSI) Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/si/2003/06/01255486",
"title": "Fixed-outline floorplanning: enabling hierarchical design",
"doi": null,
"abstractUrl": "/journal/si/2003/06/01255486/13rRUxASuQs",
"parentPublication": {
"id": "trans/si",
"title": "IEEE Transactions on Very Large Scale Integration (VLSI) Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNxHrym1",
"title": "2016 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)",
"acronym": "asonam",
"groupId": "1002866",
"volume": "0",
"displayVolume": "0",
"year": "2016",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNvo67AN",
"doi": "10.1109/ASONAM.2016.7752308",
"title": "Selecting the cases that defined Europe: Complementary metrics for a network analysis",
"normalizedTitle": "Selecting the cases that defined Europe: Complementary metrics for a network analysis",
"abstract": "Do case citations reflect the “real” importance of individual judgments for the legal system concerned? This question has long been puzzling empirical legal scholars. Existing research typically studies case citation networks as a whole applying traditional network metrics stemming from graph theory. Those approaches are able to detect globally important cases, but since they do not take time explicitly into account, they cannot provide a comprehensive account of the dynamics behind the network structure and its evolution. In this paper we provide such a description, using two node importance metrics that take time into account to study important cases in the Court of Justice of the European Union over time. We then compare cases deemed as important by the metrics, with a set of 50 cases selected by the Court as the most important (landmark) cases. Our contribution is twofold. First, with regard to network science, we show that structural and time-related properties are complementary, and necessary to obtain a complete and nuanced picture of the citation network. Second, with regard to the case law of the Court, this study provides empirical evidence clarifying the motivation of the Court when selecting the landmark cases, revealing the importance of symbolic and historical cases in the selection. In addition, the temporal analysis sheds new light on the network properties specific to the landmark cases that distinguishes them from the rest of the cases. We validate our results by providing legal interpretations that sustain the highlights provided by the proposed network analysis.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Do case citations reflect the “real” importance of individual judgments for the legal system concerned? This question has long been puzzling empirical legal scholars. Existing research typically studies case citation networks as a whole applying traditional network metrics stemming from graph theory. Those approaches are able to detect globally important cases, but since they do not take time explicitly into account, they cannot provide a comprehensive account of the dynamics behind the network structure and its evolution. In this paper we provide such a description, using two node importance metrics that take time into account to study important cases in the Court of Justice of the European Union over time. We then compare cases deemed as important by the metrics, with a set of 50 cases selected by the Court as the most important (landmark) cases. Our contribution is twofold. First, with regard to network science, we show that structural and time-related properties are complementary, and necessary to obtain a complete and nuanced picture of the citation network. Second, with regard to the case law of the Court, this study provides empirical evidence clarifying the motivation of the Court when selecting the landmark cases, revealing the importance of symbolic and historical cases in the selection. In addition, the temporal analysis sheds new light on the network properties specific to the landmark cases that distinguishes them from the rest of the cases. We validate our results by providing legal interpretations that sustain the highlights provided by the proposed network analysis.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Do case citations reflect the “real” importance of individual judgments for the legal system concerned? This question has long been puzzling empirical legal scholars. Existing research typically studies case citation networks as a whole applying traditional network metrics stemming from graph theory. Those approaches are able to detect globally important cases, but since they do not take time explicitly into account, they cannot provide a comprehensive account of the dynamics behind the network structure and its evolution. In this paper we provide such a description, using two node importance metrics that take time into account to study important cases in the Court of Justice of the European Union over time. We then compare cases deemed as important by the metrics, with a set of 50 cases selected by the Court as the most important (landmark) cases. Our contribution is twofold. First, with regard to network science, we show that structural and time-related properties are complementary, and necessary to obtain a complete and nuanced picture of the citation network. Second, with regard to the case law of the Court, this study provides empirical evidence clarifying the motivation of the Court when selecting the landmark cases, revealing the importance of symbolic and historical cases in the selection. In addition, the temporal analysis sheds new light on the network properties specific to the landmark cases that distinguishes them from the rest of the cases. We validate our results by providing legal interpretations that sustain the highlights provided by the proposed network analysis.",
"fno": "07752308",
"keywords": [
"Law",
"Europe",
"Context",
"Measurement",
"Electronic Mail",
"Web Search",
"European Court Of Justice",
"Citation Networks",
"Directed Acyclic Graphs",
"Relative In Degree",
"Average Longevity",
"Authority Scores"
],
"authors": [
{
"affiliation": "Université Paris-Saclay, ISP, ENS Cachan, CNRS, Cachan, France",
"fullName": "Fabien Tarissan",
"givenName": "Fabien",
"surname": "Tarissan",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "iCourts Centre of Excellence for International Courts, Faculty of Law, Copenhagen, Denmark",
"fullName": "Yannis Panagis",
"givenName": "Yannis",
"surname": "Panagis",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "iCourts Centre of Excellence for International Courts, Faculty of Law, Copenhagen, Denmark",
"fullName": "Urška Šadl",
"givenName": "Urška",
"surname": "Šadl",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "asonam",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2016-08-01T00:00:00",
"pubType": "proceedings",
"pages": "661-668",
"year": "2016",
"issn": null,
"isbn": "978-1-5090-2846-7",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "07752307",
"articleId": "12OmNyoiYVM",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "07752309",
"articleId": "12OmNzSQdoI",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/itme/2015/8302/0/8302a464",
"title": "Exploration on the practice teaching of law major in Distance Education",
"doi": null,
"abstractUrl": "/proceedings-article/itme/2015/8302a464/12OmNARRYgR",
"parentPublication": {
"id": "proceedings/itme/2015/8302/0",
"title": "2015 7th International Conference on Information Technology in Medicine and Education (ITME)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/hicss/2015/7367/0/7367f234",
"title": "Investigating the Impact of Global Positioning System Evidence",
"doi": null,
"abstractUrl": "/proceedings-article/hicss/2015/7367f234/12OmNB9t6j6",
"parentPublication": {
"id": "proceedings/hicss/2015/7367/0",
"title": "2015 48th Hawaii International Conference on System Sciences (HICSS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ica/2016/3931/0/3931a013",
"title": "Modeling Predictability of Agent in Legal Cases",
"doi": null,
"abstractUrl": "/proceedings-article/ica/2016/3931a013/12OmNs0TKTT",
"parentPublication": {
"id": "proceedings/ica/2016/3931/0",
"title": "2016 IEEE International Conference on Agents (ICA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cedem/2017/6718/0/08046275",
"title": "Towards Open Justice: ICT Acceptance in the Greek Justice System the Case of the Integrated Court Management System for Penal and Civil Procedures (OSDDY/PP)",
"doi": null,
"abstractUrl": "/proceedings-article/cedem/2017/08046275/12OmNySG3RQ",
"parentPublication": {
"id": "proceedings/cedem/2017/6718/0",
"title": "2017 Conference for E-Democracy and Open Government (CeDEM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icse-c/2016/4205/0/4205a563",
"title": "A Guided Tour of the Legal Implications of Software Cloning",
"doi": null,
"abstractUrl": "/proceedings-article/icse-c/2016/4205a563/12OmNzCWG7g",
"parentPublication": {
"id": "proceedings/icse-c/2016/4205/0",
"title": "2016 IEEE/ACM 38th International Conference on Software Engineering Companion (ICSE-C)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccma/2019/0818/0/081800a110",
"title": "Using Bayesian Networks In Analysing Judgement",
"doi": null,
"abstractUrl": "/proceedings-article/iccma/2019/081800a110/1b1xBTRm0qQ",
"parentPublication": {
"id": "proceedings/iccma/2019/0818/0",
"title": "2019 International Conference on Computing, Computational Modelling and Applications (ICCMA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/dsc/2019/4528/0/452800a016",
"title": "RnnTd: An Approach Based on LSTM and Tensor Decomposition for Classification of Crimes in Legal Cases",
"doi": null,
"abstractUrl": "/proceedings-article/dsc/2019/452800a016/1fHjN2HA23K",
"parentPublication": {
"id": "proceedings/dsc/2019/4528/0",
"title": "2019 IEEE Fourth International Conference on Data Science in Cyberspace (DSC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ec/2021/01/08540060",
"title": "E-Voting System Evaluation Based on The Council of Europe Recommendations: Helios Voting",
"doi": null,
"abstractUrl": "/journal/ec/2021/01/08540060/1rNPNA5HONy",
"parentPublication": {
"id": "trans/ec",
"title": "IEEE Transactions on Emerging Topics in Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdmw/2020/9012/0/901200a799",
"title": "Using Unlabeled Data for US Supreme Court Case Classification",
"doi": null,
"abstractUrl": "/proceedings-article/icdmw/2020/901200a799/1rgGhqM0yPu",
"parentPublication": {
"id": "proceedings/icdmw/2020/9012/0",
"title": "2020 International Conference on Data Mining Workshops (ICDMW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icedme/2021/3596/0/359600a038",
"title": "A Location-based Blockchain Evidence Preservation Wireless Communitication Scheme for HuaTaiYiMei v Tongdao Technology Development Case",
"doi": null,
"abstractUrl": "/proceedings-article/icedme/2021/359600a038/1tMPO0o3PIA",
"parentPublication": {
"id": "proceedings/icedme/2021/3596/0",
"title": "2021 4th International Conference on Electron Device and Mechanical Engineering (ICEDME)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNy314bw",
"title": "1992 FTCS - The Twenty-Second International Symposium on Fault-Tolerant Computing",
"acronym": "ftcs",
"groupId": "1000287",
"volume": "0",
"displayVolume": "0",
"year": "1992",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNx4yvvy",
"doi": "10.1109/FTCS.1992.243596",
"title": "Closure and convergence: a formulation of fault-tolerant computing",
"normalizedTitle": "Closure and convergence: a formulation of fault-tolerant computing",
"abstract": "The authors give a formal definition of what it means for a system to tolerate a class of faults. The definition consists of two conditions. First, if a fault occurs when the system state is within some larger set and, if faults continue occurring, the system state remains within that larger set. Second, if faults stop occurring, the system eventually reaches a state within the legal set. The authors demonstrate the applicability of the definition for stating and verifying the fault-tolerance properties of a variety of digital and computer systems. Using the definition, a simple classification is obtained of fault-tolerant systems, and methods for the systematic design of fault-tolerant systems are outlined.<>",
"abstracts": [
{
"abstractType": "Regular",
"content": "The authors give a formal definition of what it means for a system to tolerate a class of faults. The definition consists of two conditions. First, if a fault occurs when the system state is within some larger set and, if faults continue occurring, the system state remains within that larger set. Second, if faults stop occurring, the system eventually reaches a state within the legal set. The authors demonstrate the applicability of the definition for stating and verifying the fault-tolerance properties of a variety of digital and computer systems. Using the definition, a simple classification is obtained of fault-tolerant systems, and methods for the systematic design of fault-tolerant systems are outlined.<>",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "The authors give a formal definition of what it means for a system to tolerate a class of faults. The definition consists of two conditions. First, if a fault occurs when the system state is within some larger set and, if faults continue occurring, the system state remains within that larger set. Second, if faults stop occurring, the system eventually reaches a state within the legal set. The authors demonstrate the applicability of the definition for stating and verifying the fault-tolerance properties of a variety of digital and computer systems. Using the definition, a simple classification is obtained of fault-tolerant systems, and methods for the systematic design of fault-tolerant systems are outlined.",
"fno": "00243596",
"keywords": [
"Computation Theory",
"Fault Tolerant Computing",
"Convergence",
"Fault Tolerant Computing",
"Formal Definition",
"Legal Set",
"Computer Systems",
"Systematic Design",
"Convergence",
"Fault Tolerance",
"Fault Tolerant Systems",
"Microelectronics",
"Law",
"Legal Factors",
"Application Software",
"Design Methodology",
"Terminology",
"Computer Crashes"
],
"authors": [
{
"affiliation": "Dept. of Comput. Sci., Texas Univ., Austin, TX, USA",
"fullName": "A. Arora",
"givenName": "A.",
"surname": "Arora",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "M. Gouda",
"givenName": "M.",
"surname": "Gouda",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "ftcs",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "1992-01-01T00:00:00",
"pubType": "proceedings",
"pages": "396,397,398,399,400,401,402,403",
"year": "1992",
"issn": null,
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "00243595",
"articleId": "12OmNy4r3Vg",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "00243597",
"articleId": "12OmNroij6c",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/ipdps/2006/0054/0/01639554",
"title": "An advanced performance analysis of self-stabilizing protocols: stabilization time with transient faults during convergence",
"doi": null,
"abstractUrl": "/proceedings-article/ipdps/2006/01639554/12OmNqBbI0t",
"parentPublication": {
"id": "proceedings/ipdps/2006/0054/0",
"title": "Proceedings 20th IEEE International Parallel & Distributed Processing Symposium",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cluster/2006/0327/0/04100357",
"title": "FAIL-MPI: How Fault-Tolerant Is Fault-Tolerant MPI?",
"doi": null,
"abstractUrl": "/proceedings-article/cluster/2006/04100357/12OmNxwWoJd",
"parentPublication": {
"id": "proceedings/cluster/2006/0327/0",
"title": "2006 IEEE International Conference on Cluster Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bigdata-congress/2015/7278/0/07207257",
"title": "Greft: Arbitrary Fault-Tolerant Distributed Graph Processing",
"doi": null,
"abstractUrl": "/proceedings-article/bigdata-congress/2015/07207257/12OmNyKa60L",
"parentPublication": {
"id": "proceedings/bigdata-congress/2015/7278/0",
"title": "2015 IEEE International Congress on Big Data (BigData Congress)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/prdc/2014/6474/0/6474a011",
"title": "Design of Multi-threaded Fault-Tolerant Connection-Oriented Communication",
"doi": null,
"abstractUrl": "/proceedings-article/prdc/2014/6474a011/12OmNySG3P5",
"parentPublication": {
"id": "proceedings/prdc/2014/6474/0",
"title": "2014 IEEE 20th Pacific Rim International Symposium on Dependable Computing (PRDC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/dft/2017/0362/0/08244447",
"title": "Volume management for fault-tolerant continuous-flow microfluidics",
"doi": null,
"abstractUrl": "/proceedings-article/dft/2017/08244447/12OmNzwHvvk",
"parentPublication": {
"id": "proceedings/dft/2017/0362/0",
"title": "2017 IEEE International Symposium on Defect and Fault Tolerance in VLSI and Nanotechnology Systems (DFT)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tc/1976/12/01674598",
"title": "Fault-Tolerant Systems",
"doi": null,
"abstractUrl": "/journal/tc/1976/12/01674598/13rRUwInv3f",
"parentPublication": {
"id": "trans/tc",
"title": "IEEE Transactions on Computers",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tc/1975/05/01672839",
"title": "Fault-Tolerant Computing: An Introduction and a Perspective",
"doi": null,
"abstractUrl": "/journal/tc/1975/05/01672839/13rRUwfI0OL",
"parentPublication": {
"id": "trans/tc",
"title": "IEEE Transactions on Computers",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tc/1971/10/01671694",
"title": "Fault Tolerant Sequential Machines",
"doi": null,
"abstractUrl": "/journal/tc/1971/10/01671694/13rRUyeTVgK",
"parentPublication": {
"id": "trans/tc",
"title": "IEEE Transactions on Computers",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ts/1993/11/e1015",
"title": "Closure and Convergence: A Foundation of Fault-Tolerant Computing",
"doi": null,
"abstractUrl": "/journal/ts/1993/11/e1015/13rRUyuvRqC",
"parentPublication": {
"id": "trans/ts",
"title": "IEEE Transactions on Software Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/dft/2006/2706/0/04030942",
"title": "Bilateral Testing of Nano-scale Fault-tolerant Circuits",
"doi": null,
"abstractUrl": "/proceedings-article/dft/2006/04030942/14dcDYc4Ti9",
"parentPublication": {
"id": "proceedings/dft/2006/2706/0",
"title": "2006 21st IEEE International Symposium On Defect and Fault Tolerance in VLSI Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNBV9Icf",
"title": "2007 IEEE Symposium on Security and Privacy (SP '07)",
"acronym": "sp",
"groupId": "1000646",
"volume": "0",
"displayVolume": "0",
"year": "2007",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNxTmHJK",
"doi": "10.1109/SP.2007.32",
"title": "On the Safety and Efficiency of Firewall Policy Deployment",
"normalizedTitle": "On the Safety and Efficiency of Firewall Policy Deployment",
"abstract": "Firewall policy management is challenging and error-prone. While ample research has led to tools for policy specification, correctness analysis, and optimization, few researchers have paid attention to firewall policy deployment: the process where a management tool edits a firewall's configuration to make it run the policies specified in the tool. In this paper, we provide the first formal definition and theoretical analysis of safety in firewall policy deployment. We show that naive deployment approaches can easily create a temporary security hole by permitting illegal traffic, or interrupt service by rejecting legal traffic during the deployment. We define safe and most-efficient deployments, and introduce the shuffling theorem as a formal basis for constructing deployment algorithms and proving their safety. We present efficient algorithms for constructing most-efficient deployments in popular policy editing languages. We show that in certain widely- installed policy editing languages, a safe deployment is not always possible. We also show how to leverage existing diff algorithms to guarantee a safe, most- efficient, and monotonic deployment in other editing languages.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Firewall policy management is challenging and error-prone. While ample research has led to tools for policy specification, correctness analysis, and optimization, few researchers have paid attention to firewall policy deployment: the process where a management tool edits a firewall's configuration to make it run the policies specified in the tool. In this paper, we provide the first formal definition and theoretical analysis of safety in firewall policy deployment. We show that naive deployment approaches can easily create a temporary security hole by permitting illegal traffic, or interrupt service by rejecting legal traffic during the deployment. We define safe and most-efficient deployments, and introduce the shuffling theorem as a formal basis for constructing deployment algorithms and proving their safety. We present efficient algorithms for constructing most-efficient deployments in popular policy editing languages. We show that in certain widely- installed policy editing languages, a safe deployment is not always possible. We also show how to leverage existing diff algorithms to guarantee a safe, most- efficient, and monotonic deployment in other editing languages.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Firewall policy management is challenging and error-prone. While ample research has led to tools for policy specification, correctness analysis, and optimization, few researchers have paid attention to firewall policy deployment: the process where a management tool edits a firewall's configuration to make it run the policies specified in the tool. In this paper, we provide the first formal definition and theoretical analysis of safety in firewall policy deployment. We show that naive deployment approaches can easily create a temporary security hole by permitting illegal traffic, or interrupt service by rejecting legal traffic during the deployment. We define safe and most-efficient deployments, and introduce the shuffling theorem as a formal basis for constructing deployment algorithms and proving their safety. We present efficient algorithms for constructing most-efficient deployments in popular policy editing languages. We show that in certain widely- installed policy editing languages, a safe deployment is not always possible. We also show how to leverage existing diff algorithms to guarantee a safe, most- efficient, and monotonic deployment in other editing languages.",
"fno": "04223212",
"keywords": [
"Safety",
"Graphical User Interfaces",
"Telecommunication Traffic",
"Security",
"Law",
"Legal Factors",
"Internet",
"Protection",
"Communication System Traffic Control",
"Network Topology"
],
"authors": [
{
"affiliation": "University of Illinois at Urbana-Champaign",
"fullName": "Charles C. Zhang",
"givenName": "Charles C.",
"surname": "Zhang",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "University of Illinois at Urbana-Champaign",
"fullName": "Marianne Winslett",
"givenName": "Marianne",
"surname": "Winslett",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "University of Illinois at Urbana-Champaign",
"fullName": "Carl A. Gunter",
"givenName": "Carl A.",
"surname": "Gunter",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "sp",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2007-05-01T00:00:00",
"pubType": "proceedings",
"pages": "33-50",
"year": "2007",
"issn": "1081-6011",
"isbn": "0-7695-2848-1",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "04223211",
"articleId": "12OmNzb7ZqL",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "28480051",
"articleId": "12OmNyQ7G5e",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/cw/2008/3381/0/3381a192",
"title": "A Flexible Policy-Based Firewall Management Framework",
"doi": null,
"abstractUrl": "/proceedings-article/cw/2008/3381a192/12OmNBE7Mvo",
"parentPublication": {
"id": "proceedings/cw/2008/3381/0",
"title": "2008 International Conference on Cyberworlds",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/npsec/2005/9427/0/01532056",
"title": "Policy segmentation for intelligent firewall testing",
"doi": null,
"abstractUrl": "/proceedings-article/npsec/2005/01532056/12OmNBl6EHg",
"parentPublication": {
"id": "proceedings/npsec/2005/9427/0",
"title": "2005 First Workshop on Secure Network Protocols (NPSEC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icnc/2010/4277/0/4277a294",
"title": "Inconsistency Detection System for Security Policy and Firewall Policy",
"doi": null,
"abstractUrl": "/proceedings-article/icnc/2010/4277a294/12OmNqBKTRk",
"parentPublication": {
"id": "proceedings/icnc/2010/4277/0",
"title": "2010 First International Conference on Networking and Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/policy/2009/3742/0/3742a060",
"title": "Model Checking Firewall Policy Configurations",
"doi": null,
"abstractUrl": "/proceedings-article/policy/2009/3742a060/12OmNx3HIaC",
"parentPublication": {
"id": "proceedings/policy/2009/3742/0",
"title": "Policies for Distributed Systems and Networks, IEEE International Workshop on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/csse/2008/3336/1/3336a196",
"title": "Verify Consistency between Security Policy and Firewall Policy with Answer Set Programming",
"doi": null,
"abstractUrl": "/proceedings-article/csse/2008/3336a196/12OmNyFCvS4",
"parentPublication": {
"id": "proceedings/csse/2008/3336/1",
"title": "Computer Science and Software Engineering, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iscc/2016/0679/0/07543759",
"title": "Malachite: Firewall policy comparison",
"doi": null,
"abstractUrl": "/proceedings-article/iscc/2016/07543759/12OmNyL0TMM",
"parentPublication": {
"id": "proceedings/iscc/2016/0679/0",
"title": "2016 IEEE Symposium on Computers and Communication (ISCC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tq/2012/03/ttq2012030318",
"title": "Detecting and Resolving Firewall Policy Anomalies",
"doi": null,
"abstractUrl": "/journal/tq/2012/03/ttq2012030318/13rRUEgarkN",
"parentPublication": {
"id": "trans/tq",
"title": "IEEE Transactions on Dependable and Secure Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/td/2008/09/ttd2008091237",
"title": "Diverse Firewall Design",
"doi": null,
"abstractUrl": "/journal/td/2008/09/ttd2008091237/13rRUwbs2g4",
"parentPublication": {
"id": "trans/td",
"title": "IEEE Transactions on Parallel & Distributed Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/td/2009/06/ttd2009060766",
"title": "Firewall Policy Queries",
"doi": null,
"abstractUrl": "/journal/td/2009/06/ttd2009060766/13rRUxjQybv",
"parentPublication": {
"id": "trans/td",
"title": "IEEE Transactions on Parallel & Distributed Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/hpcc-smartcity-dss/2019/2058/0/205800b757",
"title": "An Analysis Method for IPv6 Firewall Policy",
"doi": null,
"abstractUrl": "/proceedings-article/hpcc-smartcity-dss/2019/205800b757/1dPozF4KbCM",
"parentPublication": {
"id": "proceedings/hpcc-smartcity-dss/2019/2058/0",
"title": "2019 IEEE 21st International Conference on High Performance Computing and Communications; IEEE 17th International Conference on Smart City; IEEE 5th International Conference on Data Science and Systems (HPCC/SmartCity/DSS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNrIJqpO",
"title": "Internet and Web Applications and Services, International Conference on",
"acronym": "iciw",
"groupId": "1001764",
"volume": "0",
"displayVolume": "0",
"year": "2010",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNxwWoLv",
"doi": "10.1109/ICIW.2010.35",
"title": "A Secure and Legal Network-Aware P2P VoD System",
"normalizedTitle": "A Secure and Legal Network-Aware P2P VoD System",
"abstract": "File sharing applications using Peer-to-Peer (P2P) networks such as Bittorrent or eDonkey rapidly attracted a lot of people and proved the efficiency and interest of this P2P technology. Distribution of video and of live contents also experienced the P2P mechanisms with success. PPLive, UUSee and others have many of customers, hundreds of channels and thousands of concurrent users. However, major content providers are reluctant to use this technology because no solution to ensure the distribution of only legal contents is provided. In the same way, network operators do not really push towards P2P content distribution because bad organization of the overlay can lead to overload the network and consume a lot of networks resources. In this paper, a secure and legal network-aware P2P video system is introduced, which aims at overcoming those two drawbacks. The design of the system and the evaluation of a prototype showed good results and let us be optimistic about a possible deployment of P2P systems for video delivery, having the support of content providers as well as network operators.",
"abstracts": [
{
"abstractType": "Regular",
"content": "File sharing applications using Peer-to-Peer (P2P) networks such as Bittorrent or eDonkey rapidly attracted a lot of people and proved the efficiency and interest of this P2P technology. Distribution of video and of live contents also experienced the P2P mechanisms with success. PPLive, UUSee and others have many of customers, hundreds of channels and thousands of concurrent users. However, major content providers are reluctant to use this technology because no solution to ensure the distribution of only legal contents is provided. In the same way, network operators do not really push towards P2P content distribution because bad organization of the overlay can lead to overload the network and consume a lot of networks resources. In this paper, a secure and legal network-aware P2P video system is introduced, which aims at overcoming those two drawbacks. The design of the system and the evaluation of a prototype showed good results and let us be optimistic about a possible deployment of P2P systems for video delivery, having the support of content providers as well as network operators.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "File sharing applications using Peer-to-Peer (P2P) networks such as Bittorrent or eDonkey rapidly attracted a lot of people and proved the efficiency and interest of this P2P technology. Distribution of video and of live contents also experienced the P2P mechanisms with success. PPLive, UUSee and others have many of customers, hundreds of channels and thousands of concurrent users. However, major content providers are reluctant to use this technology because no solution to ensure the distribution of only legal contents is provided. In the same way, network operators do not really push towards P2P content distribution because bad organization of the overlay can lead to overload the network and consume a lot of networks resources. In this paper, a secure and legal network-aware P2P video system is introduced, which aims at overcoming those two drawbacks. The design of the system and the evaluation of a prototype showed good results and let us be optimistic about a possible deployment of P2P systems for video delivery, having the support of content providers as well as network operators.",
"fno": "05476763",
"keywords": [
"Computer Network Security",
"Content Management",
"Peer To Peer Computing",
"Video On Demand",
"Video Streaming",
"P 2 P Vo D System",
"File Sharing",
"Peer To Peer Network",
"Content Distribution",
"P 2 P Video System",
"Video Delivery",
"Network Operator",
"Law",
"Legal Factors",
"Peer To Peer Computing",
"Video Sharing",
"Prototypes",
"Watermarking",
"Computer Architecture",
"IP Networks",
"Web And Internet Services",
"Design Optimization",
"P 2 P Video Streaming",
"Network Awareness",
"Secure Distribution",
"Legal Contents",
"Watermarking"
],
"authors": [
{
"affiliation": "Orange Labs., Lannion, France",
"fullName": "Bertrand Mathieu",
"givenName": "Bertrand",
"surname": "Mathieu",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Orange Labs., Lannion, France",
"fullName": "Pierre Paris",
"givenName": "Pierre",
"surname": "Paris",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Orange Labs., Lannion, France",
"fullName": "Gaëtan Le Guelvouit",
"givenName": "Gaëtan Le",
"surname": "Guelvouit",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "TMG, St. Sebastien sur Loire, France",
"fullName": "Soufiane Rouibia",
"givenName": "Soufiane",
"surname": "Rouibia",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "iciw",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2010-05-01T00:00:00",
"pubType": "proceedings",
"pages": "194-199",
"year": "2010",
"issn": null,
"isbn": "978-1-4244-6728-0",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "4022a186",
"articleId": "12OmNBajTIe",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "4022a200",
"articleId": "12OmNBBQZuH",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/cisis/2010/3967/0/3967a457",
"title": "Adaptive Mechanism for P2P Video Streaming Using SVC and MDC",
"doi": null,
"abstractUrl": "/proceedings-article/cisis/2010/3967a457/12OmNAkniWm",
"parentPublication": {
"id": "proceedings/cisis/2010/3967/0",
"title": "2010 International Conference on Complex, Intelligent and Software Intensive Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ipccc/2009/5737/0/05403807",
"title": "Towards health of replication in large-scale P2P-VoD systems",
"doi": null,
"abstractUrl": "/proceedings-article/ipccc/2009/05403807/12OmNApu5f2",
"parentPublication": {
"id": "proceedings/ipccc/2009/5737/0",
"title": "2009 IEEE 28th International Performance Computing and Communications Conference (IPCCC 2009)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/qest/2012/4781/0/4781a238",
"title": "Max Percentile Replication for Optimal Performance in Multi-regional P2P VoD Systems",
"doi": null,
"abstractUrl": "/proceedings-article/qest/2012/4781a238/12OmNBTs7pg",
"parentPublication": {
"id": "proceedings/qest/2012/4781/0",
"title": "Quantitative Evaluation of Systems, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icme/2007/1016/0/04284671",
"title": "Content-Aware P2P Video Streaming with Low Latency",
"doi": null,
"abstractUrl": "/proceedings-article/icme/2007/04284671/12OmNBlFQXl",
"parentPublication": {
"id": "proceedings/icme/2007/1016/0",
"title": "2007 International Conference on Multimedia & Expo",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ism/2010/4217/0/4217a081",
"title": "Temporal-DHT and Its Application in P2P-VoD Systems",
"doi": null,
"abstractUrl": "/proceedings-article/ism/2010/4217a081/12OmNrJAdMR",
"parentPublication": {
"id": "proceedings/ism/2010/4217/0",
"title": "2010 IEEE International Symposium on Multimedia",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdcsw/2014/4181/0/06888836",
"title": "Socially-Optimal ISP-Aware P2P Content Distribution via a Primal-Dual Approach",
"doi": null,
"abstractUrl": "/proceedings-article/icdcsw/2014/06888836/12OmNx19jSu",
"parentPublication": {
"id": "proceedings/icdcsw/2014/4181/0",
"title": "2014 IEEE 34th International Conference on Distributed Computing Systems Workshops (ICDCSW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iciw/2008/3163/0/3163a686",
"title": "Value Networks of P2P TV: An Analysis of Actors and Their Roles",
"doi": null,
"abstractUrl": "/proceedings-article/iciw/2008/3163a686/12OmNyO8tNe",
"parentPublication": {
"id": "proceedings/iciw/2008/3163/0",
"title": "Internet and Web Applications and Services, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/td/2014/03/ttd2014030612",
"title": "Distributed Caching via Rewarding: An Incentive Scheme Design in P2P-VoD Systems",
"doi": null,
"abstractUrl": "/journal/td/2014/03/ttd2014030612/13rRUwkxc59",
"parentPublication": {
"id": "trans/td",
"title": "IEEE Transactions on Parallel & Distributed Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/nt/2013/01/06198314",
"title": "On Replication Algorithm in P2P VoD",
"doi": null,
"abstractUrl": "/journal/nt/2013/01/06198314/13rRUyft7wp",
"parentPublication": {
"id": "trans/nt",
"title": "IEEE/ACM Transactions on Networking",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNy3iFtz",
"title": "Proceedings of the 41st Annual Hawaii International Conference on System Sciences (HICSS 2008)",
"acronym": "hicss",
"groupId": "1000730",
"volume": "0",
"displayVolume": "0",
"year": "2008",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNy4r40n",
"doi": "10.1109/HICSS.2008.497",
"title": "Web Accessibility for the Blind: Corporate Social Responsibility  or Litigation Avoidance?",
"normalizedTitle": "Web Accessibility for the Blind: Corporate Social Responsibility or Litigation Avoidance?",
"abstract": "On September 5, 2006, a legal precedent was set for web accessibility. Federal judge Marilyn Patel sustained discrimination claims by the National Federation for the Blind against Target Corporation. She established that retailers must make their websites accessible to the blind under the Americans with Disabilities Act. Past research has indicated that eCommerce retailers have largely ignored W3C guidelines for making their sites accessible. This study examines web accessibility motivation under the lens of Corporate Social Responsibility (CSR). A model is developed linking accessibility behavior to a retailer's propensity to engage in CSR activities, the types of products and services sold, complexity of visual web content, and perceived threat of litigation resulting from an inaccessible site. Based on the model recommendations are suggested for future research. Thirty-two websites of the largest online retailers with a physical presence were analyzed using IBM's aDesigner accessibility tool for the three years before and one year since the commencement of the Target litigation. Results suggest that accessibility of sites has showed significant improvement since the Target case began.",
"abstracts": [
{
"abstractType": "Regular",
"content": "On September 5, 2006, a legal precedent was set for web accessibility. Federal judge Marilyn Patel sustained discrimination claims by the National Federation for the Blind against Target Corporation. She established that retailers must make their websites accessible to the blind under the Americans with Disabilities Act. Past research has indicated that eCommerce retailers have largely ignored W3C guidelines for making their sites accessible. This study examines web accessibility motivation under the lens of Corporate Social Responsibility (CSR). A model is developed linking accessibility behavior to a retailer's propensity to engage in CSR activities, the types of products and services sold, complexity of visual web content, and perceived threat of litigation resulting from an inaccessible site. Based on the model recommendations are suggested for future research. Thirty-two websites of the largest online retailers with a physical presence were analyzed using IBM's aDesigner accessibility tool for the three years before and one year since the commencement of the Target litigation. Results suggest that accessibility of sites has showed significant improvement since the Target case began.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "On September 5, 2006, a legal precedent was set for web accessibility. Federal judge Marilyn Patel sustained discrimination claims by the National Federation for the Blind against Target Corporation. She established that retailers must make their websites accessible to the blind under the Americans with Disabilities Act. Past research has indicated that eCommerce retailers have largely ignored W3C guidelines for making their sites accessible. This study examines web accessibility motivation under the lens of Corporate Social Responsibility (CSR). A model is developed linking accessibility behavior to a retailer's propensity to engage in CSR activities, the types of products and services sold, complexity of visual web content, and perceived threat of litigation resulting from an inaccessible site. Based on the model recommendations are suggested for future research. Thirty-two websites of the largest online retailers with a physical presence were analyzed using IBM's aDesigner accessibility tool for the three years before and one year since the commencement of the Target litigation. Results suggest that accessibility of sites has showed significant improvement since the Target case began.",
"fno": "04438989",
"keywords": [
"Electronic Commerce",
"Handicapped Aids",
"Internet",
"Legislation",
"Retail Data Processing",
"Blind Web Accessibility",
"Corporate Social Responsibility",
"Litigation Avoidance",
"Legal Precedent",
"Americans With Disabilities Act",
"W 3 C Guidelines",
"Web Sites",
"Online Retailers",
"Feedback Amplifiers",
"Information Technology",
"Law",
"Legal Factors",
"Electronic Commerce",
"Guidelines",
"Lenses",
"Joining Processes",
"Military Computing",
"Statistics"
],
"authors": [
{
"affiliation": null,
"fullName": "Jonathan Frank",
"givenName": "Jonathan",
"surname": "Frank",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "hicss",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2008-01-01T00:00:00",
"pubType": "proceedings",
"pages": "284-284",
"year": "2008",
"issn": "1530-1605",
"isbn": "978-0-7695-3075-8",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "04438988",
"articleId": "12OmNxcMSnd",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "04438990",
"articleId": "12OmNyjLoQv",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNxG1yTG",
"title": "Proceedings 1992 IEEE Computer Society Conference on Computer Vision and Pattern Recognition",
"acronym": "cvpr",
"groupId": "1000147",
"volume": "0",
"displayVolume": "0",
"year": "1992",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNBO3K1m",
"doi": "10.1109/CVPR.1992.223127",
"title": "Image segmentation via edge contour finding: a graph theoretic approach",
"normalizedTitle": "Image segmentation via edge contour finding: a graph theoretic approach",
"abstract": "A graph-theoretic approach for image segmentation is presented. The pixels of the image are represented by the vertices of an undirected adjacency graph G. All neighboring pairs of pixels are linked by arcs with capacities assigned to reflect the strength of an edge element between the linked vertices. Segmentation is achieved by removing arcs corresponding to selected minimum cuts of G to form mutually exclusive subgraphs such that the largest intersubgraph maximum flow is minimized. This is equivalent to partitioning the image using closed contours of edge elements, which consist mostly of strong edges. The method accurately locates region boundaries and at the same time rejects contours containing isolated strong edges. The minimum cuts in G can be computed from a partially cut-equivalent tree of G. A fast algorithm for constructing partially equivalent trees that can handle graphs with several hundred thousand vertices is developed.<>",
"abstracts": [
{
"abstractType": "Regular",
"content": "A graph-theoretic approach for image segmentation is presented. The pixels of the image are represented by the vertices of an undirected adjacency graph G. All neighboring pairs of pixels are linked by arcs with capacities assigned to reflect the strength of an edge element between the linked vertices. Segmentation is achieved by removing arcs corresponding to selected minimum cuts of G to form mutually exclusive subgraphs such that the largest intersubgraph maximum flow is minimized. This is equivalent to partitioning the image using closed contours of edge elements, which consist mostly of strong edges. The method accurately locates region boundaries and at the same time rejects contours containing isolated strong edges. The minimum cuts in G can be computed from a partially cut-equivalent tree of G. A fast algorithm for constructing partially equivalent trees that can handle graphs with several hundred thousand vertices is developed.<>",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "A graph-theoretic approach for image segmentation is presented. The pixels of the image are represented by the vertices of an undirected adjacency graph G. All neighboring pairs of pixels are linked by arcs with capacities assigned to reflect the strength of an edge element between the linked vertices. Segmentation is achieved by removing arcs corresponding to selected minimum cuts of G to form mutually exclusive subgraphs such that the largest intersubgraph maximum flow is minimized. This is equivalent to partitioning the image using closed contours of edge elements, which consist mostly of strong edges. The method accurately locates region boundaries and at the same time rejects contours containing isolated strong edges. The minimum cuts in G can be computed from a partially cut-equivalent tree of G. A fast algorithm for constructing partially equivalent trees that can handle graphs with several hundred thousand vertices is developed.",
"fno": "00223127",
"keywords": [
"Graph Theory",
"Image Segmentation",
"Pattern Recognition",
"Image Segmentation",
"Edge Contour Finding",
"Graph Theoretic Approach",
"Pixels",
"Undirected Adjacency Graph",
"Linked Vertices",
"Partitioning",
"Closed Contours",
"Isolated Strong Edges",
"Partially Cut Equivalent Tree",
"Image Segmentation",
"Image Edge Detection",
"Pixel",
"Tree Graphs",
"Biomedical Image Processing",
"Radiology",
"Signal Processing",
"Image Processing",
"Biomedical Engineering",
"Petroleum"
],
"authors": [
{
"affiliation": "Dept. of Radiol., Pennsylvania Univ., Philadelphia, PA, USA",
"fullName": "Z. Wu",
"givenName": "Z.",
"surname": "Wu",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "R. Leahy",
"givenName": "R.",
"surname": "Leahy",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "cvpr",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "1992-01-01T00:00:00",
"pubType": "proceedings",
"pages": "613,614,615,616,617,618,619",
"year": "1992",
"issn": "1063-6919",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "00223126",
"articleId": "12OmNzmtWFB",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "00223128",
"articleId": "12OmNzmclXa",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/synasc/2013/3035/0/06821173",
"title": "Algorithmic Experiences in Coxeter Spectral Study of P-critical Edge-Bipartite Graphs and Posets",
"doi": null,
"abstractUrl": "/proceedings-article/synasc/2013/06821173/12OmNC2OSL9",
"parentPublication": {
"id": "proceedings/synasc/2013/3035/0",
"title": "2013 15th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2012/2216/0/06460149",
"title": "Stereo matching with Global Edge Constraint and Graph Cuts",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2012/06460149/12OmNwtWfEA",
"parentPublication": {
"id": "proceedings/icpr/2012/2216/0",
"title": "2012 21st International Conference on Pattern Recognition (ICPR 2012)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sc/2016/8815/0/8815a830",
"title": "G-Store: High-Performance Graph Store for Trillion-Edge Processing",
"doi": null,
"abstractUrl": "/proceedings-article/sc/2016/8815a830/12OmNxFaLks",
"parentPublication": {
"id": "proceedings/sc/2016/8815/0",
"title": "SC16: International Conference for High Performance Computing, Networking, Storage and Analysis (SC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/2009/4420/0/05459196",
"title": "Kernel active contour",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2009/05459196/12OmNxGSmg4",
"parentPublication": {
"id": "proceedings/iccv/2009/4420/0",
"title": "2009 IEEE 12th International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/isise/2012/5680/0/06495325",
"title": "Nonexistences of the Packing and Covering Designs for the Join Graph of K1 and C4 with a Pendent Edge",
"doi": null,
"abstractUrl": "/proceedings-article/isise/2012/06495325/12OmNylKARG",
"parentPublication": {
"id": "proceedings/isise/2012/5680/0",
"title": "2012 Fourth International Symposium on Information Science and Engineering (ISISE 2012)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/itme/2015/8302/0/8302a129",
"title": "MRI Tumor Image Segmentation by Parametric Kernel Graph Cut with Deformable Shape Prior",
"doi": null,
"abstractUrl": "/proceedings-article/itme/2015/8302a129/12OmNyvGykz",
"parentPublication": {
"id": "proceedings/itme/2015/8302/0",
"title": "2015 7th International Conference on Information Technology in Medicine and Education (ITME)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icde/2014/2555/0/06816681",
"title": "Continuous pattern detection over billion-edge graph using distributed framework",
"doi": null,
"abstractUrl": "/proceedings-article/icde/2014/06816681/12OmNzICEKM",
"parentPublication": {
"id": "proceedings/icde/2014/2555/0",
"title": "2014 IEEE 30th International Conference on Data Engineering (ICDE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/1993/11/i1101",
"title": "An Optimal Graph Theoretic Approach to Data Clustering: Theory and Its Application to Image Segmentation",
"doi": null,
"abstractUrl": "/journal/tp/1993/11/i1101/13rRUwhHcK8",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ispa-iucc-bdcloud-socialcom-sustaincom/2018/1141/0/114100a237",
"title": "Fault-Tolerant Edge-Pancyclicity of Möbius Cube MQ_n",
"doi": null,
"abstractUrl": "/proceedings-article/ispa-iucc-bdcloud-socialcom-sustaincom/2018/114100a237/18AuSeK4PrG",
"parentPublication": {
"id": "proceedings/ispa-iucc-bdcloud-socialcom-sustaincom/2018/1141/0",
"title": "2018 IEEE Intl Conf on Parallel & Distributed Processing with Applications, Ubiquitous Computing & Communications, Big Data & Cloud Computing, Social Computing & Networking, Sustainable Computing & Communications (ISPA/IUCC/BDCloud/SocialCom/SustainCom)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icvisp/2021/0770/0/077000a259",
"title": "Complete Graphs and Bipartite Graphs in a Random Graph",
"doi": null,
"abstractUrl": "/proceedings-article/icvisp/2021/077000a259/1APq5FO8TBK",
"parentPublication": {
"id": "proceedings/icvisp/2021/0770/0",
"title": "2021 5th International Conference on Vision, Image and Signal Processing (ICVISP)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNwDAC42",
"title": "Proceedings of 3rd International Conference on Document Analysis and Recognition",
"acronym": "icdar",
"groupId": "1000219",
"volume": "2",
"displayVolume": "2",
"year": "1995",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNzTH0Vm",
"doi": "10.1109/ICDAR.1995.602012",
"title": "Four directional adjacency graphs (FDAG) and their application in locating fields in forms",
"normalizedTitle": "Four directional adjacency graphs (FDAG) and their application in locating fields in forms",
"abstract": "A new non-hierarchical spatial data structure named four directional adjacency graphs (FDAG) is proposed. In the FDAG vertical and horizontal neighborhood relationship between rectangles is well represented so that structural information can be easily extracted. An application for structural analysis of forms is given, where experiments are conducted with positive results.",
"abstracts": [
{
"abstractType": "Regular",
"content": "A new non-hierarchical spatial data structure named four directional adjacency graphs (FDAG) is proposed. In the FDAG vertical and horizontal neighborhood relationship between rectangles is well represented so that structural information can be easily extracted. An application for structural analysis of forms is given, where experiments are conducted with positive results.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "A new non-hierarchical spatial data structure named four directional adjacency graphs (FDAG) is proposed. In the FDAG vertical and horizontal neighborhood relationship between rectangles is well represented so that structural information can be easily extracted. An application for structural analysis of forms is given, where experiments are conducted with positive results.",
"fno": "71280752",
"keywords": [
"Spatial Data Structures Four Directional Adjacency Graphs Non Hierarchical Spatial Data Structure Structural Analysis Forms"
],
"authors": [
{
"affiliation": "Center for Pattern Recognition & Machine Intelligence, Concordia Univ., Montreal, Que., Canada",
"fullName": "Jianxing Yuan",
"givenName": "Jianxing",
"surname": "Yuan",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Center for Pattern Recognition & Machine Intelligence, Concordia Univ., Montreal, Que., Canada",
"fullName": "Y.Y. Tang",
"givenName": "Y.Y.",
"surname": "Tang",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Center for Pattern Recognition & Machine Intelligence, Concordia Univ., Montreal, Que., Canada",
"fullName": "C.Y. Suen",
"givenName": "C.Y.",
"surname": "Suen",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "icdar",
"isOpenAccess": false,
"showRecommendedArticles": false,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "1995-08-01T00:00:00",
"pubType": "proceedings",
"pages": "752",
"year": "1995",
"issn": null,
"isbn": "0-8186-7128-9",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "71280748",
"articleId": "12OmNyQYt5n",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "71280756",
"articleId": "12OmNrAv3Em",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNxG1yTH",
"title": "Proceedings of the IEEE International Symposium on Requirements Engineering",
"acronym": "isre",
"groupId": "1000631",
"volume": "0",
"displayVolume": "0",
"year": "1993",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNBAqZIV",
"doi": "10.1109/ISRE.1993.324838",
"title": "Dealing with performance requirements during the development of information systems",
"normalizedTitle": "Dealing with performance requirements during the development of information systems",
"abstract": "Performance goals for information systems are treated as a class of nonfunctional requirements (NFRs). A given model for representing NFRs is given to make provisions for: representing a variety of implementation alternatives; expressing performance goals (including responsiveness) in terms of performance and information system concepts; and organizing the process into layers corresponding to subsets of the language to be implemented. The application of the framework is illustrated by mapping the conceptual design of an information system to its implementation, while attempting to meet a set of goals such as 'achieve good time performance for authorizing credit card sales'. A tool is being developed to aid this process.<>",
"abstracts": [
{
"abstractType": "Regular",
"content": "Performance goals for information systems are treated as a class of nonfunctional requirements (NFRs). A given model for representing NFRs is given to make provisions for: representing a variety of implementation alternatives; expressing performance goals (including responsiveness) in terms of performance and information system concepts; and organizing the process into layers corresponding to subsets of the language to be implemented. The application of the framework is illustrated by mapping the conceptual design of an information system to its implementation, while attempting to meet a set of goals such as 'achieve good time performance for authorizing credit card sales'. A tool is being developed to aid this process.<>",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Performance goals for information systems are treated as a class of nonfunctional requirements (NFRs). A given model for representing NFRs is given to make provisions for: representing a variety of implementation alternatives; expressing performance goals (including responsiveness) in terms of performance and information system concepts; and organizing the process into layers corresponding to subsets of the language to be implemented. The application of the framework is illustrated by mapping the conceptual design of an information system to its implementation, while attempting to meet a set of goals such as 'achieve good time performance for authorizing credit card sales'. A tool is being developed to aid this process.",
"fno": "00324838",
"keywords": [
"Information Systems",
"Software Engineering",
"Systems Analysis",
"Performance Requirements",
"Information Systems",
"Nonfunctional Requirements",
"NF Rs",
"Implementation Alternatives",
"Performance Goals",
"Conceptual Design",
"Information Systems",
"Credit Cards",
"Delay",
"Computer Science",
"Marketing And Sales",
"Authorization",
"Tree Graphs",
"System Performance",
"Throughput"
],
"authors": [
{
"affiliation": "Dept. of Comput. Sci., Toronto Univ., Ont., Canada",
"fullName": "B.A. Nixon",
"givenName": "B.A.",
"surname": "Nixon",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "isre",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "1993-01-01T00:00:00",
"pubType": "proceedings",
"pages": "42,43,44,45,46,47,48,49",
"year": "1993",
"issn": null,
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "00324837",
"articleId": "12OmNrEL2Am",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "00324839",
"articleId": "12OmNxH9XgE",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/rev/2010/8766/0/05625663",
"title": "Visualizing non-functional requirements patterns",
"doi": null,
"abstractUrl": "/proceedings-article/rev/2010/05625663/12OmNC943JG",
"parentPublication": {
"id": "proceedings/rev/2010/8766/0",
"title": "2010 Fifth International Workshop on Requirements Engineering Visualization (REV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/re/1995/7017/0/70170132",
"title": "Using non-functional requirements to systematically support change",
"doi": null,
"abstractUrl": "/proceedings-article/re/1995/70170132/12OmNvDqsN3",
"parentPublication": {
"id": "proceedings/re/1995/7017/0",
"title": "Proceedings of 1995 IEEE International Symposium on Requirements Engineering (RE'95)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/csf/2010/7510/0/05552644",
"title": "Required Information Release",
"doi": null,
"abstractUrl": "/proceedings-article/csf/2010/05552644/12OmNvwkumu",
"parentPublication": {
"id": "proceedings/csf/2010/7510/0",
"title": "2010 23rd IEEE Computer Security Foundations Symposium",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/re/2010/8022/0/05636888",
"title": "Integrating Preferences into Goal Models for Requirements Engineering",
"doi": null,
"abstractUrl": "/proceedings-article/re/2010/05636888/12OmNyen1lJ",
"parentPublication": {
"id": "proceedings/re/2010/8022/0",
"title": "2010 18th IEEE International Requirements Engineering Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/re/2010/8022/0/05636894",
"title": "Dealing with Non-Functional Requirements in Model-Driven Development",
"doi": null,
"abstractUrl": "/proceedings-article/re/2010/05636894/12OmNz5JBQA",
"parentPublication": {
"id": "proceedings/re/2010/8022/0",
"title": "2010 18th IEEE International Requirements Engineering Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/trustcom-bigdatase-i-spa/2015/7952/1/07345359",
"title": "Enhancing EMV Online PIN Verification",
"doi": null,
"abstractUrl": "/proceedings-article/trustcom-bigdatase-i-spa/2015/07345359/12OmNzAohSU",
"parentPublication": {
"id": "proceedings/trustcom-bigdatase-i-spa/2015/7952/2",
"title": "2015 IEEE Trustcom/BigDataSE/ISPA",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/re/2010/8022/0/05636893",
"title": "An NFR Pattern Approach to Dealing with NFRs",
"doi": null,
"abstractUrl": "/proceedings-article/re/2010/05636893/12OmNzd7br8",
"parentPublication": {
"id": "proceedings/re/2010/8022/0",
"title": "2010 18th IEEE International Requirements Engineering Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iscc/2008/2702/0/04625644",
"title": "Variability Modeling for Business Component Customization",
"doi": null,
"abstractUrl": "/proceedings-article/iscc/2008/04625644/12OmNzhnacn",
"parentPublication": {
"id": "proceedings/iscc/2008/2702/0",
"title": "2008 IEEE Symposium on Computers and Communications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ts/2000/12/e1122",
"title": "Management of Performance Requirements for Information Systems",
"doi": null,
"abstractUrl": "/journal/ts/2000/12/e1122/13rRUxASu2u",
"parentPublication": {
"id": "trans/ts",
"title": "IEEE Transactions on Software Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ts/2021/04/08665968",
"title": "Dealing with Non-Functional Requirements in Model-Driven Development: A Survey",
"doi": null,
"abstractUrl": "/journal/ts/2021/04/08665968/18l6LikUPde",
"parentPublication": {
"id": "trans/ts",
"title": "IEEE Transactions on Software Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNynJMVF",
"title": "2009 IEEE 17th International Conference on Program Comprehension (ICPC 2009)",
"acronym": "icpc",
"groupId": "1003168",
"volume": "0",
"displayVolume": "0",
"year": "2009",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNCzsKEh",
"doi": "10.1109/ICPC.2009.5090022",
"title": "Intensions are a key to program comprehension",
"normalizedTitle": "Intensions are a key to program comprehension",
"abstract": "The classical comprehension theories study relations between extensions, intensions, and names. Originally developed in linguistics and mathematics, these theories are applicable to program comprehension as well. While extensions are present in the program, the intensions are usually missing, and evolution and maintenance programmers have to recover them as the program cannot be successfully comprehended and changed without them.",
"abstracts": [
{
"abstractType": "Regular",
"content": "The classical comprehension theories study relations between extensions, intensions, and names. Originally developed in linguistics and mathematics, these theories are applicable to program comprehension as well. While extensions are present in the program, the intensions are usually missing, and evolution and maintenance programmers have to recover them as the program cannot be successfully comprehended and changed without them.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "The classical comprehension theories study relations between extensions, intensions, and names. Originally developed in linguistics and mathematics, these theories are applicable to program comprehension as well. While extensions are present in the program, the intensions are usually missing, and evolution and maintenance programmers have to recover them as the program cannot be successfully comprehended and changed without them.",
"fno": "05090022",
"keywords": [
"Computational Linguistics",
"Reverse Engineering",
"Software Maintenance",
"Software Metrics",
"Program Comprehension Effort",
"Program Intension",
"Software Evolution",
"Software Maintenance",
"Linguistics",
"Software Development",
"Program Extension",
"Mathematics",
"Programming Profession",
"Hardware",
"Computer Science",
"Visualization",
"Humans",
"Cities And Towns",
"Marketing And Sales",
"Credit Cards",
"Software Engineering"
],
"authors": [
{
"affiliation": "Department of Computer Science, Wayne State University, Detroit, MI USA 48202",
"fullName": "Vaclav Rajlich",
"givenName": "Vaclav",
"surname": "Rajlich",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "icpc",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2009-05-01T00:00:00",
"pubType": "proceedings",
"pages": "",
"year": "2009",
"issn": "1092-8138",
"isbn": "978-1-4244-3998-0",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "05090021",
"articleId": "12OmNxXUhRp",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "05090023",
"articleId": "12OmNwswg3T",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/iccsee/2012/4647/1/4647a601",
"title": "Overview of Program Comprehension",
"doi": null,
"abstractUrl": "/proceedings-article/iccsee/2012/4647a601/12OmNBziBc8",
"parentPublication": {
"id": "proceedings/iccsee/2012/4647/2",
"title": "Computer Science and Electronics Engineering, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iwpc/2002/1495/0/14950281",
"title": "Constructivism and Program Comprehension Strategies",
"doi": null,
"abstractUrl": "/proceedings-article/iwpc/2002/14950281/12OmNC4eSx7",
"parentPublication": {
"id": "proceedings/iwpc/2002/1495/0",
"title": "10th International Workshop on Program Comprehension (IWPC'02)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/csf/2010/7510/0/05552644",
"title": "Required Information Release",
"doi": null,
"abstractUrl": "/proceedings-article/csf/2010/05552644/12OmNvwkumu",
"parentPublication": {
"id": "proceedings/csf/2010/7510/0",
"title": "2010 23rd IEEE Computer Security Foundations Symposium",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/esem/2011/4604/0/4604a127",
"title": "Exploring Software Measures to Assess Program Comprehension",
"doi": null,
"abstractUrl": "/proceedings-article/esem/2011/4604a127/12OmNxXCGIV",
"parentPublication": {
"id": "proceedings/esem/2011/4604/0",
"title": "2011 International Symposium on Empirical Software Engineering and Measurement",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpc/2009/3998/0/05090073",
"title": "Improving program comprehension by enhancing program constructs: An analysis of the Umple language",
"doi": null,
"abstractUrl": "/proceedings-article/icpc/2009/05090073/12OmNzcxZgp",
"parentPublication": {
"id": "proceedings/icpc/2009/3998/0",
"title": "2009 IEEE 17th International Conference on Program Comprehension (ICPC 2009)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpc/2017/0535/0/0535a308",
"title": "Comprehending Studies on Program Comprehension",
"doi": null,
"abstractUrl": "/proceedings-article/icpc/2017/0535a308/12OmNzmLxOj",
"parentPublication": {
"id": "proceedings/icpc/2017/0535/0",
"title": "2017 IEEE/ACM 25th International Conference on Program Comprehension (ICPC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/compsac/2002/1727/0/17270427",
"title": "From System Comprehension to Program Comprehension",
"doi": null,
"abstractUrl": "/proceedings-article/compsac/2002/17270427/12OmNznCkYo",
"parentPublication": {
"id": "proceedings/compsac/2002/1727/0",
"title": "Proceedings 26th Annual International Computer Software and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpc/2005/2254/0/01421034",
"title": "Theories, methods and tools in program comprehension: past, present and future",
"doi": null,
"abstractUrl": "/proceedings-article/icpc/2005/01421034/1htC9G5ebwQ",
"parentPublication": {
"id": "proceedings/icpc/2005/2254/0",
"title": "International Conference on Program Comprehension",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpc/2021/1403/0/140300a455",
"title": "Is Algorithm Comprehension Different from Program Comprehension?",
"doi": null,
"abstractUrl": "/proceedings-article/icpc/2021/140300a455/1tB7wCcSiEU",
"parentPublication": {
"id": "proceedings/icpc/2021/1403/0/",
"title": "2021 IEEE/ACM 29th International Conference on Program Comprehension (ICPC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNxWcHe6",
"title": "2010 23rd IEEE Computer Security Foundations Symposium",
"acronym": "csf",
"groupId": "1000142",
"volume": "0",
"displayVolume": "0",
"year": "2010",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNvwkumu",
"doi": "10.1109/CSF.2010.22",
"title": "Required Information Release",
"normalizedTitle": "Required Information Release",
"abstract": "Many computer systems have a functional requirement to release information. Such requirements are an important part of a system's information security requirements. Current information-flow control techniques are able to reason about permitted information flows, but not required information flows. In this paper, we introduce and explore the specification and enforcement of required information release in a language-based setting. We define semantic security conditions that express both what information a program is required to release, and how an observer is able to learn this information. We also consider the relationship between permitted and required information release, and define bounded release, which provides upper- and lower-bounds on the information a program releases. We show that both required information release and bounded release can be enforced using a security-type system.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Many computer systems have a functional requirement to release information. Such requirements are an important part of a system's information security requirements. Current information-flow control techniques are able to reason about permitted information flows, but not required information flows. In this paper, we introduce and explore the specification and enforcement of required information release in a language-based setting. We define semantic security conditions that express both what information a program is required to release, and how an observer is able to learn this information. We also consider the relationship between permitted and required information release, and define bounded release, which provides upper- and lower-bounds on the information a program releases. We show that both required information release and bounded release can be enforced using a security-type system.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Many computer systems have a functional requirement to release information. Such requirements are an important part of a system's information security requirements. Current information-flow control techniques are able to reason about permitted information flows, but not required information flows. In this paper, we introduce and explore the specification and enforcement of required information release in a language-based setting. We define semantic security conditions that express both what information a program is required to release, and how an observer is able to learn this information. We also consider the relationship between permitted and required information release, and define bounded release, which provides upper- and lower-bounds on the information a program releases. We show that both required information release and bounded release can be enforced using a security-type system.",
"fno": "05552644",
"keywords": [
"Security Of Data",
"Computer Systems",
"System Information Security",
"Information Flow Control Techniques",
"Language Based Setting",
"Semantic Security Conditions",
"Lower Bounds",
"Program Information Release",
"Security Type System",
"Bounded Release",
"Observers",
"Credit Cards",
"Marketing And Sales",
"Semantics",
"Information Security",
"Joints",
"Information Flow",
"Declassification",
"Information Release",
"Algorithmic Knowledge"
],
"authors": [
{
"affiliation": null,
"fullName": "Stephen Chong",
"givenName": "Stephen",
"surname": "Chong",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "csf",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2010-07-01T00:00:00",
"pubType": "proceedings",
"pages": "215-227",
"year": "2010",
"issn": "1063-6900",
"isbn": "978-1-4244-7510-0",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "05552643",
"articleId": "12OmNxAlA9M",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "05552641",
"articleId": "12OmNqIhFKC",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/sp/2007/2848/0/04223226",
"title": "Gradual Release: Unifying Declassification, Encryption and Key Release Policies",
"doi": null,
"abstractUrl": "/proceedings-article/sp/2007/04223226/12OmNASILKf",
"parentPublication": {
"id": "proceedings/sp/2007/2848/0",
"title": "2007 IEEE Symposium on Security and Privacy (SP '07)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/isre/1993/3120/0/00324838",
"title": "Dealing with performance requirements during the development of information systems",
"doi": null,
"abstractUrl": "/proceedings-article/isre/1993/00324838/12OmNBAqZIV",
"parentPublication": {
"id": "proceedings/isre/1993/3120/0",
"title": "Proceedings of the IEEE International Symposium on Requirements Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/csf/2009/3712/0/3712a043",
"title": "Tight Enforcement of Information-Release Policies for Dynamic Languages",
"doi": null,
"abstractUrl": "/proceedings-article/csf/2009/3712a043/12OmNBLdKPh",
"parentPublication": {
"id": "proceedings/csf/2009/3712/0",
"title": "2009 22nd IEEE Computer Security Foundations Symposium",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/issre/1991/2143/0/00145384",
"title": "On the determination of optimum software release time",
"doi": null,
"abstractUrl": "/proceedings-article/issre/1991/00145384/12OmNrkBwm4",
"parentPublication": {
"id": "proceedings/issre/1991/2143/0",
"title": "Proceedings. 1991 International Symposium on Software Reliability Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cis/2010/4297/0/4297a073",
"title": "Credit Card Customer Segmentation and Target Marketing Based on Data Mining",
"doi": null,
"abstractUrl": "/proceedings-article/cis/2010/4297a073/12OmNvwTGDD",
"parentPublication": {
"id": "proceedings/cis/2010/4297/0",
"title": "2010 International Conference on Computational Intelligence and Security",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iri/2016/3207/0/3207a040",
"title": "A Risk-Benefit Driven Architecture for Personal Data Release (Invited Paper)",
"doi": null,
"abstractUrl": "/proceedings-article/iri/2016/3207a040/12OmNx7G61E",
"parentPublication": {
"id": "proceedings/iri/2016/3207/0",
"title": "2016 IEEE 17th International Conference on Information Reuse and Integration (IRI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iscc/2008/2702/0/04625644",
"title": "Variability Modeling for Business Component Customization",
"doi": null,
"abstractUrl": "/proceedings-article/iscc/2008/04625644/12OmNzhnacn",
"parentPublication": {
"id": "proceedings/iscc/2008/2702/0",
"title": "2008 IEEE Symposium on Computers and Communications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2006/05/v0749",
"title": "Visualization of Geo-spatial Point Sets via Global Shape Transformation and Local Pixel Placement",
"doi": null,
"abstractUrl": "/journal/tg/2006/05/v0749/13rRUxBa5rM",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/hicss/2007/2755/0/04076689",
"title": "An Empirical Analysis of Fraud Detection in Online Auctions: Credit Card Phantom Transaction",
"doi": null,
"abstractUrl": "/proceedings-article/hicss/2007/04076689/17D45WK5Al4",
"parentPublication": {
"id": "proceedings/hicss/2007/2755/0",
"title": "2007 40th Annual Hawaii International Conference on System Sciences (HICSS'07)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icmsse/2021/2565/0/256500a092",
"title": "Research on Government Procurement Information Release Process Model Based on IDEF Method",
"doi": null,
"abstractUrl": "/proceedings-article/icmsse/2021/256500a092/1yNjjhz4vGE",
"parentPublication": {
"id": "proceedings/icmsse/2021/2565/0",
"title": "2021 International Conference on Management Science and Software Engineering (ICMSSE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNxisQYT",
"title": "2017 IEEE 16th International Symposium on Network Computing and Applications (NCA)",
"acronym": "nca",
"groupId": "1000490",
"volume": "0",
"displayVolume": "0",
"year": "2017",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNx5piP3",
"doi": "10.1109/NCA.2017.8171391",
"title": "NFV orchestrator placement for geo-distributed systems",
"normalizedTitle": "NFV orchestrator placement for geo-distributed systems",
"abstract": "The European Telecommunications Standards Institute (ETSI) developed Network Functions Virtualization (NFV) Management and Orchestration (MANO) framework. Within that framework, NFV orchestrator (NFVO) and Virtualized Network Function (VNF) Manager (VNFM) functional blocks are responsible for managing the lifecycle of network services and their associated VNFs. However, they face significant scalability and performance challenges in large-scale and geo-distributed NFV systems. Their number and location have major implications for the number of VNFs that can be accommodated and also for the overall system performance. NFVO and VNFM placement is therefore a key challenge due to its potential impact on the system scalability and performance. In this paper, we address the placement of NFVO and VNFM in large-scale and geo-distributed NFV infrastructure. We provide an integer linear programming formulation of the problem and propose a two-step placement algorithm to solve it. We also conduct a set of experiments to evaluate the proposed algorithm.",
"abstracts": [
{
"abstractType": "Regular",
"content": "The European Telecommunications Standards Institute (ETSI) developed Network Functions Virtualization (NFV) Management and Orchestration (MANO) framework. Within that framework, NFV orchestrator (NFVO) and Virtualized Network Function (VNF) Manager (VNFM) functional blocks are responsible for managing the lifecycle of network services and their associated VNFs. However, they face significant scalability and performance challenges in large-scale and geo-distributed NFV systems. Their number and location have major implications for the number of VNFs that can be accommodated and also for the overall system performance. NFVO and VNFM placement is therefore a key challenge due to its potential impact on the system scalability and performance. In this paper, we address the placement of NFVO and VNFM in large-scale and geo-distributed NFV infrastructure. We provide an integer linear programming formulation of the problem and propose a two-step placement algorithm to solve it. We also conduct a set of experiments to evaluate the proposed algorithm.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "The European Telecommunications Standards Institute (ETSI) developed Network Functions Virtualization (NFV) Management and Orchestration (MANO) framework. Within that framework, NFV orchestrator (NFVO) and Virtualized Network Function (VNF) Manager (VNFM) functional blocks are responsible for managing the lifecycle of network services and their associated VNFs. However, they face significant scalability and performance challenges in large-scale and geo-distributed NFV systems. Their number and location have major implications for the number of VNFs that can be accommodated and also for the overall system performance. NFVO and VNFM placement is therefore a key challenge due to its potential impact on the system scalability and performance. In this paper, we address the placement of NFVO and VNFM in large-scale and geo-distributed NFV infrastructure. We provide an integer linear programming formulation of the problem and propose a two-step placement algorithm to solve it. We also conduct a set of experiments to evaluate the proposed algorithm.",
"fno": "08171391",
"keywords": [
"Delays",
"Scalability",
"Network Function Virtualization",
"Software",
"5 G Mobile Communication",
"ETSI",
"Systems Architecture",
"Distributed Systems",
"Network Functions Virtualization",
"Management And Orchestration",
"NFV Orchestrator",
"VNF Manager",
"Scalability",
"Placement"
],
"authors": [
{
"affiliation": "Concordia University, Montreal, Canada",
"fullName": "Mohammad Abu-Lebdeh",
"givenName": "Mohammad",
"surname": "Abu-Lebdeh",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Concordia University, Montreal, Canada",
"fullName": "Diala Naboulsi",
"givenName": "Diala",
"surname": "Naboulsi",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Concordia University, Montreal, Canada",
"fullName": "Roch Glitho",
"givenName": "Roch",
"surname": "Glitho",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Ericsson Montreal, Canada",
"fullName": "Constant Wette Tchouati",
"givenName": "Constant Wette",
"surname": "Tchouati",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "nca",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2017-10-01T00:00:00",
"pubType": "proceedings",
"pages": "1-5",
"year": "2017",
"issn": null,
"isbn": "978-1-5386-1465-5",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "08171390",
"articleId": "12OmNyL0TFL",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "08171392",
"articleId": "12OmNCxL9Sq",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/icoin/2018/2290/0/08343197",
"title": "A fault management system for NFV",
"doi": null,
"abstractUrl": "/proceedings-article/icoin/2018/08343197/12OmNyfdOU9",
"parentPublication": {
"id": "proceedings/icoin/2018/2290/0",
"title": "2018 International Conference on Information Networking (ICOIN)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/nt/2018/02/08293815",
"title": "Online Scaling of NFV Service Chains Across Geo-Distributed Datacenters",
"doi": null,
"abstractUrl": "/journal/nt/2018/02/08293815/13rRUB6SpXM",
"parentPublication": {
"id": "trans/nt",
"title": "IEEE/ACM Transactions on Networking",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tm/2019/12/08570806",
"title": "Multi-Timescale Online Optimization of Network Function Virtualization for Service Chaining",
"doi": null,
"abstractUrl": "/journal/tm/2019/12/08570806/17D45Xh13tI",
"parentPublication": {
"id": "trans/tm",
"title": "IEEE Transactions on Mobile Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icoin/2019/8350/0/08717979",
"title": "A Practical Model for Optimal Placement of Virtual Network Functions",
"doi": null,
"abstractUrl": "/proceedings-article/icoin/2019/08717979/1aIRYF9vJyo",
"parentPublication": {
"id": "proceedings/icoin/2019/8350/0",
"title": "2019 International Conference on Information Networking (ICOIN)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/sc/2022/01/08758357",
"title": "Delay-Sensitive and Availability-Aware Virtual Network Function Scheduling for NFV",
"doi": null,
"abstractUrl": "/journal/sc/2022/01/08758357/1bwCdDqTREQ",
"parentPublication": {
"id": "trans/sc",
"title": "IEEE Transactions on Services Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icoin/2020/4199/0/09016492",
"title": "A VNF Placement Method Considering Load and Hop count in NFV Environment",
"doi": null,
"abstractUrl": "/proceedings-article/icoin/2020/09016492/1hQqSCSvcaY",
"parentPublication": {
"id": "proceedings/icoin/2020/4199/0",
"title": "2020 International Conference on Information Networking (ICOIN)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cloud/2020/8780/0/878000a267",
"title": "Resource Optimization and Delay-aware Virtual Network Function Placement for Mapping SFC Requests in NFV-enabled Networks",
"doi": null,
"abstractUrl": "/proceedings-article/cloud/2020/878000a267/1pF6lMnUkQE",
"parentPublication": {
"id": "proceedings/cloud/2020/8780/0",
"title": "2020 IEEE 13th International Conference on Cloud Computing (CLOUD)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icws/2020/8786/0/878600a216",
"title": "Joint Availability- and Traffic-aware Placement of Parallelized Service Chain in NFV-enabled Data Center",
"doi": null,
"abstractUrl": "/proceedings-article/icws/2020/878600a216/1pLJGA0o3Kg",
"parentPublication": {
"id": "proceedings/icws/2020/8786/0",
"title": "2020 IEEE International Conference on Web Services (ICWS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icoin/2021/9101/0/09334022",
"title": "A VNF Placement Method based on VNF Characteristics",
"doi": null,
"abstractUrl": "/proceedings-article/icoin/2021/09334022/1qTrShXL3bO",
"parentPublication": {
"id": "proceedings/icoin/2021/9101/0",
"title": "2021 International Conference on Information Networking (ICOIN)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tm/2023/06/09652100",
"title": "Online Control of Service Function Chainings Across Geo-Distributed Datacenters",
"doi": null,
"abstractUrl": "/journal/tm/2023/06/09652100/1zmuQQrYp5m",
"parentPublication": {
"id": "trans/tm",
"title": "IEEE Transactions on Mobile Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNqG0SWa",
"title": "Proceedings. Eighth International Conference on Parallel and Distributed Systems. ICPADS 2001",
"acronym": "icpads",
"groupId": "1000534",
"volume": "0",
"displayVolume": "0",
"year": "2001",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNx965vl",
"doi": "10.1109/ICPADS.2001.934889",
"title": "The Parallel Processing of Spatial Selection for Very Large Geo-Spatial Databases",
"normalizedTitle": "The Parallel Processing of Spatial Selection for Very Large Geo-Spatial Databases",
"abstract": "Abstract: Earth science (ES) applications handle very large geo-spatial data sets and interactive response time is required by its query processing. Spatial selection is one of the very important basic operations for geo-spatial databases. It retrieves all the objects that intersect with a given point or rectangle. This paper presents a novel approach for the parallel processing of spatial selection of very large geo-spatial databases using partitioned parallelism. To evaluate this approach, we use the Extended Sequoia 2000 benchmark, which has real world data and real queries. In addition, we use an actual object database management system, ShusseUo, which we developed previously. The experimental results of parallel processing of spatial selection show good speed-up.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Abstract: Earth science (ES) applications handle very large geo-spatial data sets and interactive response time is required by its query processing. Spatial selection is one of the very important basic operations for geo-spatial databases. It retrieves all the objects that intersect with a given point or rectangle. This paper presents a novel approach for the parallel processing of spatial selection of very large geo-spatial databases using partitioned parallelism. To evaluate this approach, we use the Extended Sequoia 2000 benchmark, which has real world data and real queries. In addition, we use an actual object database management system, ShusseUo, which we developed previously. The experimental results of parallel processing of spatial selection show good speed-up.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Abstract: Earth science (ES) applications handle very large geo-spatial data sets and interactive response time is required by its query processing. Spatial selection is one of the very important basic operations for geo-spatial databases. It retrieves all the objects that intersect with a given point or rectangle. This paper presents a novel approach for the parallel processing of spatial selection of very large geo-spatial databases using partitioned parallelism. To evaluate this approach, we use the Extended Sequoia 2000 benchmark, which has real world data and real queries. In addition, we use an actual object database management system, ShusseUo, which we developed previously. The experimental results of parallel processing of spatial selection show good speed-up.",
"fno": "11530721",
"keywords": [],
"authors": [
{
"affiliation": "Kyushu University",
"fullName": "Keiichi Tamura",
"givenName": "Keiichi",
"surname": "Tamura",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Kyushu University",
"fullName": "Yuya Nakano",
"givenName": "Yuya",
"surname": "Nakano",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Kyushu University",
"fullName": "Kunihiko Kaneko",
"givenName": "Kunihiko",
"surname": "Kaneko",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Kyushu University",
"fullName": "Akifumi Makinouchi",
"givenName": "Akifumi",
"surname": "Makinouchi",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "icpads",
"isOpenAccess": false,
"showRecommendedArticles": false,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2001-06-01T00:00:00",
"pubType": "proceedings",
"pages": "0721",
"year": "2001",
"issn": null,
"isbn": "0-7695-1153-8",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "11530713",
"articleId": "12OmNwwMeXX",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "11530727",
"articleId": "12OmNy4IEZQ",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNAolGQz",
"title": "2016 International Conference on Advanced Cloud and Big Data (CBD)",
"acronym": "cbd",
"groupId": "1803748",
"volume": "0",
"displayVolume": "0",
"year": "2016",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNz3bdKf",
"doi": "10.1109/CBD.2016.048",
"title": "Location-Aware Data Placement for Geo-Distributed Online Social Networks",
"normalizedTitle": "Location-Aware Data Placement for Geo-Distributed Online Social Networks",
"abstract": "Globally distributed data centers provide an opportunity to deploy geo-distributed Online Social Networks (OSNs). To guarantee access latency, today's popular OSN providers store users' data in each deployed data center. However, the full replication manner brings relative high storage cost and traffic cost, which extremely increases the economic expenditure of OSN providers. Data placement based on social graph partitioning is an efficient way to minimize cost, but it requires the information of entire social graph and cannot fully guarantee latency. In this paper, we explore an integrated manner of optimizing partitioning and replication simultaneously without distinguishing replica's role. We propose a location-aware data placement scheme (LDP) to conduct the optimization of replica placement. Evaluations with Twitter dataset show that LDP significantly reduces the cost compared with state-of-the-art schemes.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Globally distributed data centers provide an opportunity to deploy geo-distributed Online Social Networks (OSNs). To guarantee access latency, today's popular OSN providers store users' data in each deployed data center. However, the full replication manner brings relative high storage cost and traffic cost, which extremely increases the economic expenditure of OSN providers. Data placement based on social graph partitioning is an efficient way to minimize cost, but it requires the information of entire social graph and cannot fully guarantee latency. In this paper, we explore an integrated manner of optimizing partitioning and replication simultaneously without distinguishing replica's role. We propose a location-aware data placement scheme (LDP) to conduct the optimization of replica placement. Evaluations with Twitter dataset show that LDP significantly reduces the cost compared with state-of-the-art schemes.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Globally distributed data centers provide an opportunity to deploy geo-distributed Online Social Networks (OSNs). To guarantee access latency, today's popular OSN providers store users' data in each deployed data center. However, the full replication manner brings relative high storage cost and traffic cost, which extremely increases the economic expenditure of OSN providers. Data placement based on social graph partitioning is an efficient way to minimize cost, but it requires the information of entire social graph and cannot fully guarantee latency. In this paper, we explore an integrated manner of optimizing partitioning and replication simultaneously without distinguishing replica's role. We propose a location-aware data placement scheme (LDP) to conduct the optimization of replica placement. Evaluations with Twitter dataset show that LDP significantly reduces the cost compared with state-of-the-art schemes.",
"fno": "3677a234",
"keywords": [
"Optimization",
"Facebook",
"Twitter",
"Data Models",
"Distributed Databases",
"Synchronization",
"Geo Distributed System",
"Data Placement",
"Online Social Networks",
"Inter Data Center Traffic",
"Storage"
],
"authors": [
{
"affiliation": null,
"fullName": "Jingya Zhou",
"givenName": "Jingya",
"surname": "Zhou",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Jianxi Fan",
"givenName": "Jianxi",
"surname": "Fan",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Juncheng Jia",
"givenName": "Juncheng",
"surname": "Jia",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Baolei Cheng",
"givenName": "Baolei",
"surname": "Cheng",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Zhao Liu",
"givenName": "Zhao",
"surname": "Liu",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "cbd",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2016-08-01T00:00:00",
"pubType": "proceedings",
"pages": "234-239",
"year": "2016",
"issn": null,
"isbn": "978-1-5090-3677-6",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "3677a228",
"articleId": "12OmNAkWvnI",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "3677a240",
"articleId": "12OmNwtEEAk",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/ficloud/2015/8103/0/8103a473",
"title": "Analysis of Structural Social Capital in Online Social Networks",
"doi": null,
"abstractUrl": "/proceedings-article/ficloud/2015/8103a473/12OmNAT0mPF",
"parentPublication": {
"id": "proceedings/ficloud/2015/8103/0",
"title": "2015 3rd International Conference on Future Internet of Things and Cloud (FiCloud)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/trustcom/2011/2135/0/06120880",
"title": "A Model for Automating Persistent Identity Clone in Online Social Network",
"doi": null,
"abstractUrl": "/proceedings-article/trustcom/2011/06120880/12OmNAoUT96",
"parentPublication": {
"id": "proceedings/trustcom/2011/2135/0",
"title": "2011IEEE 10th International Conference on Trust, Security and Privacy in Computing and Communications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cnsm/2014/67/0/07014157",
"title": "Measuring interactivity and geographical closeness of Online Social Network users to support social recommendation systems",
"doi": null,
"abstractUrl": "/proceedings-article/cnsm/2014/07014157/12OmNqzcvEq",
"parentPublication": {
"id": "proceedings/cnsm/2014/67/0",
"title": "2014 10th International Conference on Network and Service Management (CNSM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/asonam/2014/5877/0/06921557",
"title": "Gossip-based partitioning and replication for Online Social Networks",
"doi": null,
"abstractUrl": "/proceedings-article/asonam/2014/06921557/12OmNvnwVl7",
"parentPublication": {
"id": "proceedings/asonam/2014/5877/0",
"title": "2014 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cbd/2015/8537/0/8537a125",
"title": "Traffic-Aware Data Placement for Online Social Networks",
"doi": null,
"abstractUrl": "/proceedings-article/cbd/2015/8537a125/12OmNxE2mQ8",
"parentPublication": {
"id": "proceedings/cbd/2015/8537/0",
"title": "2015 Third International Conference on Advanced Cloud and Big Data (CBD)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icnp/2012/2445/0/06459989",
"title": "Cost optimization for Online Social Networks on geo-distributed clouds",
"doi": null,
"abstractUrl": "/proceedings-article/icnp/2012/06459989/12OmNxFaLr9",
"parentPublication": {
"id": "proceedings/icnp/2012/2445/0",
"title": "2012 20th IEEE International Conference on Network Protocols (ICNP 2012)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cloud/2016/2619/0/2619a678",
"title": "Improving Cloud-Based Online Social Network Data Placement and Replication",
"doi": null,
"abstractUrl": "/proceedings-article/cloud/2016/2619a678/12OmNySXEZh",
"parentPublication": {
"id": "proceedings/cloud/2016/2619/0",
"title": "2016 IEEE 9th International Conference on Cloud Computing (CLOUD)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/td/2018/07/07902221",
"title": "Scalable Minimum-Cost Balanced Partitioning of Large-Scale Social Networks: Online and Offline Solutions",
"doi": null,
"abstractUrl": "/journal/td/2018/07/07902221/13rRUwI5U2v",
"parentPublication": {
"id": "trans/td",
"title": "IEEE Transactions on Parallel & Distributed Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ec/2018/01/07163309",
"title": "Toward Reproducibility in Online Social Network Research",
"doi": null,
"abstractUrl": "/journal/ec/2018/01/07163309/13rRUwInvh6",
"parentPublication": {
"id": "trans/ec",
"title": "IEEE Transactions on Emerging Topics in Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/nas/2018/8367/0/08515718",
"title": "A Worm Containment Approach Towards Online Social Networks",
"doi": null,
"abstractUrl": "/proceedings-article/nas/2018/08515718/17D45X2fUFa",
"parentPublication": {
"id": "proceedings/nas/2018/8367/0",
"title": "2018 IEEE International Conference on Networking, Architecture and Storage (NAS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNyfdOIO",
"title": "2008 IEEE Symposium on Computers and Communications",
"acronym": "iscc",
"groupId": "1000156",
"volume": "0",
"displayVolume": "0",
"year": "2008",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNzhnacn",
"doi": "10.1109/ISCC.2008.4625644",
"title": "Variability Modeling for Business Component Customization",
"normalizedTitle": "Variability Modeling for Business Component Customization",
"abstract": "Since a component-based information system has different requirements, components customization for various constraints is needed. Thus, the ability of reusable components to be varied and appropriate to different information systems requirements is a key property in reusable component development, especially in business component (BC) development. In this paper, a BC customization approach is presented. In order to do this, we focus on the variability concept, which is defined as the ability of a software artefact to be changed or customized to be reused in multiple contexts. Hence, the objective of this work is to specify business components with the consideration of commonality and variability in a business domain, in order to increase their reusability and applicability.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Since a component-based information system has different requirements, components customization for various constraints is needed. Thus, the ability of reusable components to be varied and appropriate to different information systems requirements is a key property in reusable component development, especially in business component (BC) development. In this paper, a BC customization approach is presented. In order to do this, we focus on the variability concept, which is defined as the ability of a software artefact to be changed or customized to be reused in multiple contexts. Hence, the objective of this work is to specify business components with the consideration of commonality and variability in a business domain, in order to increase their reusability and applicability.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Since a component-based information system has different requirements, components customization for various constraints is needed. Thus, the ability of reusable components to be varied and appropriate to different information systems requirements is a key property in reusable component development, especially in business component (BC) development. In this paper, a BC customization approach is presented. In order to do this, we focus on the variability concept, which is defined as the ability of a software artefact to be changed or customized to be reused in multiple contexts. Hence, the objective of this work is to specify business components with the consideration of commonality and variability in a business domain, in order to increase their reusability and applicability.",
"fno": "04625644",
"keywords": [
"Business Data Processing",
"Corporate Modelling",
"Information Systems",
"Software Reusability",
"Business Component Customization",
"Component Based Information System",
"Business Component Development",
"Business",
"Information Systems",
"Marketing And Sales",
"Credit Cards",
"Shape",
"Unified Modeling Language",
"Magnetic Domains"
],
"authors": [
{
"affiliation": "GSCM_LRIT, Mohammed V-Agdal University, B.P 1014, Rabat, Morocco",
"fullName": "Rajaa Saidi",
"givenName": "Rajaa",
"surname": "Saidi",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "L@GI, Al Qualsadi Team, ENSIAS, BP 713, Rabat, Morocco",
"fullName": "Mounia Fredj",
"givenName": "Mounia",
"surname": "Fredj",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "GSCM_LRIT, Mohammed V-Agdal University, B.P 1014, Rabat, Morocco",
"fullName": "Salma Mouline",
"givenName": "Salma",
"surname": "Mouline",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "LIG, SIGMA Team, BP 72, 38402 Saint Martin d'Hères Cedex, France",
"fullName": "Agnes Front",
"givenName": "Agnes",
"surname": "Front",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "LIG, SIGMA Team, BP 72, 38402 Saint Martin d'Hères Cedex, France",
"fullName": "Dominique Rieu",
"givenName": "Dominique",
"surname": "Rieu",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "iscc",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2008-07-01T00:00:00",
"pubType": "proceedings",
"pages": "730-735",
"year": "2008",
"issn": "1530-1346",
"isbn": "978-1-4244-2702-4",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "04625643",
"articleId": "12OmNwE9OHK",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "04625645",
"articleId": "12OmNs0C9yC",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/icsea/2006/2703/0/27030042",
"title": "Using RDL to Facilitate Customization of Variability Points",
"doi": null,
"abstractUrl": "/proceedings-article/icsea/2006/27030042/12OmNAlvHMG",
"parentPublication": {
"id": "proceedings/icsea/2006/2703/0",
"title": "2006 International Conference on Software Engineering Advances",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/edoc/2000/0865/0/08650184",
"title": "Business Component Framework and Modeling Method for Component-Based Application Architecture",
"doi": null,
"abstractUrl": "/proceedings-article/edoc/2000/08650184/12OmNB1eJyG",
"parentPublication": {
"id": "proceedings/edoc/2000/0865/0",
"title": "Proceedings Fourth International Enterprise Distributed Objects Computing Conference. EDOC2000",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/csf/2016/2607/0/2607a253",
"title": "Non-interference with What-Declassification in Component-Based Systems",
"doi": null,
"abstractUrl": "/proceedings-article/csf/2016/2607a253/12OmNBpmDFF",
"parentPublication": {
"id": "proceedings/csf/2016/2607/0",
"title": "2016 IEEE 29th Computer Security Foundations Symposium (CSF)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icds/2009/3526/0/3526a030",
"title": "The Application Research of e-Government Procurement in China Based on Business Component Framework",
"doi": null,
"abstractUrl": "/proceedings-article/icds/2009/3526a030/12OmNC8MsEf",
"parentPublication": {
"id": "proceedings/icds/2009/3526/0",
"title": "International Conference on the Digital Society",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/qsic/2006/2718/0/27180369",
"title": "A Framework for Extensible Component Customization for Component-based Software Development",
"doi": null,
"abstractUrl": "/proceedings-article/qsic/2006/27180369/12OmNqFJhLq",
"parentPublication": {
"id": "proceedings/qsic/2006/2718/0",
"title": "Proceedings of the 6th International Conference on Quality Software",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iwssd/1991/2320/0/00213051",
"title": "Designing software for customization and evolution",
"doi": null,
"abstractUrl": "/proceedings-article/iwssd/1991/00213051/12OmNqJ8tjz",
"parentPublication": {
"id": "proceedings/iwssd/1991/2320/0",
"title": "Proceedings of the Sixth International Workshop on Software Specification and Design",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/fit/2016/5300/0/5300a187",
"title": "Modeling E-Business Customization with e3value Modeling",
"doi": null,
"abstractUrl": "/proceedings-article/fit/2016/5300a187/12OmNrkT7s8",
"parentPublication": {
"id": "proceedings/fit/2016/5300/0",
"title": "2016 International Conference on Frontiers of Information Technology (FIT)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ncm/2008/3322/2/3322b226",
"title": "API and Component Based Customization of an Open Source Business Process Management System: uEngine",
"doi": null,
"abstractUrl": "/proceedings-article/ncm/2008/3322b226/12OmNynJMCM",
"parentPublication": {
"id": "proceedings/ncm/2008/3322/2",
"title": "Networked Computing and Advanced Information Management, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icsea/2006/2703/0/04031827",
"title": "Using RDL to Facilitate Customization of Variability Points",
"doi": null,
"abstractUrl": "/proceedings-article/icsea/2006/04031827/12OmNyrqznK",
"parentPublication": {
"id": "proceedings/icsea/2006/2703/0",
"title": "2006 International Conference on Software Engineering Advances",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/srii/2014/5193/0/5193a106",
"title": "Towards Software Mass Customization for Business Collaboration",
"doi": null,
"abstractUrl": "/proceedings-article/srii/2014/5193a106/12OmNzd7brO",
"parentPublication": {
"id": "proceedings/srii/2014/5193/0",
"title": "2014 Annual SRII Global Conference (SRII)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNwCJP0g",
"title": "Proceedings First International Symposium on Uncertainty Modeling and Analysis",
"acronym": "isuma",
"groupId": "1000771",
"volume": "0",
"displayVolume": "0",
"year": "1990",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNCdTeOr",
"doi": "10.1109/ISUMA.1990.151315",
"title": "Optimizing residential photovoltaic system size using approximate reasoning",
"normalizedTitle": "Optimizing residential photovoltaic system size using approximate reasoning",
"abstract": "Alternative electrical energy conversion systems employing renewable energy sources suffer significant price disadvantages in relation to those utilizing conventional sources. In an effort to minimize this disadvantage, an evaluation was made of a residential photovoltaic conversion system configured to take advantage of an economic incentive offered by an electrical utility to encourage off-peak energy consumption. Subjective factors in the array sizing decision were evaluated using a fuzzy decision-making process. The alternative does not make economic sense for subjectively acceptable array sizes. A small saving for annual utility bills was obtained utilizing the incentive relative to one not incorporating the utility rate differential, but additional hardware expenses are likely to negate the benefit.<>",
"abstracts": [
{
"abstractType": "Regular",
"content": "Alternative electrical energy conversion systems employing renewable energy sources suffer significant price disadvantages in relation to those utilizing conventional sources. In an effort to minimize this disadvantage, an evaluation was made of a residential photovoltaic conversion system configured to take advantage of an economic incentive offered by an electrical utility to encourage off-peak energy consumption. Subjective factors in the array sizing decision were evaluated using a fuzzy decision-making process. The alternative does not make economic sense for subjectively acceptable array sizes. A small saving for annual utility bills was obtained utilizing the incentive relative to one not incorporating the utility rate differential, but additional hardware expenses are likely to negate the benefit.<>",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Alternative electrical energy conversion systems employing renewable energy sources suffer significant price disadvantages in relation to those utilizing conventional sources. In an effort to minimize this disadvantage, an evaluation was made of a residential photovoltaic conversion system configured to take advantage of an economic incentive offered by an electrical utility to encourage off-peak energy consumption. Subjective factors in the array sizing decision were evaluated using a fuzzy decision-making process. The alternative does not make economic sense for subjectively acceptable array sizes. A small saving for annual utility bills was obtained utilizing the incentive relative to one not incorporating the utility rate differential, but additional hardware expenses are likely to negate the benefit.",
"fno": "00151315",
"keywords": [
"Decision Theory",
"Economics",
"Fuzzy Set Theory",
"Inference Mechanisms",
"Photovoltaic Power Systems",
"Solar Cell Arrays",
"Residential Photovoltaic System Size",
"Approximate Reasoning",
"Electrical Energy Conversion Systems",
"Renewable Energy Sources",
"Economic Incentive",
"Off Peak Energy Consumption",
"Array Sizing Decision",
"Photovoltaic Systems",
"Power Generation Economics",
"Environmental Economics",
"Fuel Economy",
"Costs",
"Power System Economics",
"Fossil Fuels",
"Energy Consumption",
"Decision Making",
"Power Generation"
],
"authors": [
{
"affiliation": "Moore Sch. of Electr. Eng., Pennsylvania Univ., Philadelphia, PA, USA",
"fullName": "D. Macomber",
"givenName": "D.",
"surname": "Macomber",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "isuma",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "1990-01-01T00:00:00",
"pubType": "proceedings",
"pages": "558,559,560,561,562,563",
"year": "1990",
"issn": null,
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "00151314",
"articleId": "12OmNBNM8Tk",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "00151316",
"articleId": "12OmNwtWfRl",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/issst/2010/7094/0/05507732",
"title": "Experiences with stakeholder engagement in transitioning to an increased use of renewable energy systems",
"doi": null,
"abstractUrl": "/proceedings-article/issst/2010/05507732/12OmNA0vo0r",
"parentPublication": {
"id": "proceedings/issst/2010/7094/0",
"title": "IEEE International Symposium on Sustainable Systems and Technology (ISSST 2010)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cso/2010/6812/1/05533014",
"title": "An Investment Decision-Making Research Based on Mothballing Option",
"doi": null,
"abstractUrl": "/proceedings-article/cso/2010/05533014/12OmNB836Qn",
"parentPublication": {
"id": "proceedings/cso/2010/6812/1",
"title": "2010 Third International Joint Conference on Computational Science and Optimization",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/isee/2005/8910/0/01436999",
"title": "Energy recovery in the sustainable recycling of plastics from end-of-life electrical and electronic products",
"doi": null,
"abstractUrl": "/proceedings-article/isee/2005/01436999/12OmNweTvKZ",
"parentPublication": {
"id": "proceedings/isee/2005/8910/0",
"title": "Proceedings of the 2005 IEEE International Symposium on Electronics and the Environment",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/isda/2007/2976/0/29760252",
"title": "Fuzzy-Logic Control System of a Variable-Speed Variable-Pitch Wind-Turbine and a Double-Fed Induction Generator",
"doi": null,
"abstractUrl": "/proceedings-article/isda/2007/29760252/12OmNwpoFEV",
"parentPublication": {
"id": "proceedings/isda/2007/2976/0",
"title": "2007 7th International Conference on Intelligent Systems Design and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iciev/2014/5179/0/06850829",
"title": "Electricity from bio-waste-based gas hydrogen as a source of renewable energy biomass",
"doi": null,
"abstractUrl": "/proceedings-article/iciev/2014/06850829/12OmNx9WST5",
"parentPublication": {
"id": "proceedings/iciev/2014/5179/0",
"title": "2014 International Conference on Informatics, Electronics & Vision (ICIEV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/isee/2002/7214/0/01003255",
"title": "Application of the sustainability target method: supply line case studies",
"doi": null,
"abstractUrl": "/proceedings-article/isee/2002/01003255/12OmNxTVU1Z",
"parentPublication": {
"id": "proceedings/isee/2002/7214/0",
"title": "Conference Record 2002 IEEE International Symposium on Electronics and the Environment",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ssst/2005/8808/0/01460952",
"title": "Low cost utility interconnected photovoltaic scheme for residential/ village/ cottage electricity",
"doi": null,
"abstractUrl": "/proceedings-article/ssst/2005/01460952/12OmNyLiuzB",
"parentPublication": {
"id": "proceedings/ssst/2005/8808/0",
"title": "Proceedings of the Thirty-Seventh Southeastern Symposium on System Theory (SSST05)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/issst/2010/7094/0/05507754",
"title": "The contributions of logistics to enhance energy-efficiency in freight traffic",
"doi": null,
"abstractUrl": "/proceedings-article/issst/2010/05507754/12OmNyv7m7P",
"parentPublication": {
"id": "proceedings/issst/2010/7094/0",
"title": "IEEE International Symposium on Sustainable Systems and Technology (ISSST 2010)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/hicss/2001/0981/0/00926285",
"title": "The design of efficient market structures for ancillary services [electricity industry]",
"doi": null,
"abstractUrl": "/proceedings-article/hicss/2001/00926285/12OmNz5s0UR",
"parentPublication": {
"id": "proceedings/hicss/2001/0981/2",
"title": "Proceedings of the 34th Annual Hawaii International Conference on System Sciences",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cmpeur/1992/2760/0/00218486",
"title": "Economic-environmental unit-commitment (EEUC)-a multicriteria approach",
"doi": null,
"abstractUrl": "/proceedings-article/cmpeur/1992/00218486/12OmNzT7OvH",
"parentPublication": {
"id": "proceedings/cmpeur/1992/2760/0",
"title": "1992 Proceedings Computer Systems and Software Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNxETa7S",
"title": "Proceedings of the 2005 IEEE International Symposium on Electronics and the Environment",
"acronym": "isee",
"groupId": "1000254",
"volume": "0",
"displayVolume": "0",
"year": "2005",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNyS6RGF",
"doi": "10.1109/ISEE.2005.1436985",
"title": "Cycle evaluation of combined heat and power alternatives in data centers",
"normalizedTitle": "Cycle evaluation of combined heat and power alternatives in data centers",
"abstract": "This paper presents a first-order life cycle analysis of different combined heat and power (CHP) concepts in an air-cooled data center. The study finds that the benefits availed by implementing CHP may be small in the short run and depend largely on the size and configuration of the data center infrastructure. However, under certain operating circumstances, both environmental and economic gains can be realized.",
"abstracts": [
{
"abstractType": "Regular",
"content": "This paper presents a first-order life cycle analysis of different combined heat and power (CHP) concepts in an air-cooled data center. The study finds that the benefits availed by implementing CHP may be small in the short run and depend largely on the size and configuration of the data center infrastructure. However, under certain operating circumstances, both environmental and economic gains can be realized.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "This paper presents a first-order life cycle analysis of different combined heat and power (CHP) concepts in an air-cooled data center. The study finds that the benefits availed by implementing CHP may be small in the short run and depend largely on the size and configuration of the data center infrastructure. However, under certain operating circumstances, both environmental and economic gains can be realized.",
"fno": "01436985",
"keywords": [
"Cogeneration",
"Power Consumption",
"Life Cycle Costing",
"Space Heating",
"Cycle Evaluation",
"Combined Heat And Power Alternatives",
"Data Centers",
"Air Cooled Data Center",
"Life Cycle Assessment",
"Cogeneration",
"Waste Heat",
"Space Heating",
"Costs",
"Energy Consumption",
"Power Generation Economics",
"Environmental Economics",
"Resistance Heating",
"Production",
"Power Generation"
],
"authors": [
{
"affiliation": "Dept. of Mech. Eng., Univ. of California, Berkeley, CA, USA",
"fullName": "A. Shah",
"givenName": "A.",
"surname": "Shah",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "N. Krishnan",
"givenName": "N.",
"surname": "Krishnan",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "isee",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2005-01-01T00:00:00",
"pubType": "proceedings",
"pages": "19,20,21,22,23,24",
"year": "2005",
"issn": "1095-2020",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "01436984",
"articleId": "12OmNxdm4B3",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "01436986",
"articleId": "12OmNqJq4xI",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/icmtma/2018/5114/0/511401a159",
"title": "Research on Energy Saving Evaluation Index of Combined Heat and Power Generation System",
"doi": null,
"abstractUrl": "/proceedings-article/icmtma/2018/511401a159/12OmNA1Vnsm",
"parentPublication": {
"id": "proceedings/icmtma/2018/5114/0",
"title": "2018 10th International Conference on Measuring Technology and Mechatronics Automation (ICMTMA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icisce/2017/3013/0/3013b682",
"title": "Research on the Utilization of Waste Heat from Flue Gas of Combined Cycle Unit",
"doi": null,
"abstractUrl": "/proceedings-article/icisce/2017/3013b682/12OmNBp52Ir",
"parentPublication": {
"id": "proceedings/icisce/2017/3013/0",
"title": "2017 4th International Conference on Information Science and Control Engineering (ICISCE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cgc/2013/5114/0/5114a428",
"title": "Energy and Heat-Aware Metrics for Data Centers: Metrics Analysis in the Framework of CoolEmAll Project",
"doi": null,
"abstractUrl": "/proceedings-article/cgc/2013/5114a428/12OmNBpmDFB",
"parentPublication": {
"id": "proceedings/cgc/2013/5114/0",
"title": "2013 International Conference on Cloud and Green Computing (CGC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/igcc/2014/6177/0/07039163",
"title": "Placement optimization of liquid-cooled servers for power minimization in data centers",
"doi": null,
"abstractUrl": "/proceedings-article/igcc/2014/07039163/12OmNxHJ9ox",
"parentPublication": {
"id": "proceedings/igcc/2014/6177/0",
"title": "2014 International Green Computing Conference (IGCC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/igsc/2015/0172/0/07393715",
"title": "Dynamic workload and cooling management in high-efficiency data centers",
"doi": null,
"abstractUrl": "/proceedings-article/igsc/2015/07393715/12OmNyU63s5",
"parentPublication": {
"id": "proceedings/igsc/2015/0172/0",
"title": "2015 Sixth International Green and Sustainable Computing Conference (IGSC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpads/2022/7315/0/731500a578",
"title": "A Heat-Recirculation-Aware Data Placement Strategy towards Data Centers",
"doi": null,
"abstractUrl": "/proceedings-article/icpads/2022/731500a578/1LRlSV2OWDS",
"parentPublication": {
"id": "proceedings/icpads/2023/7315/0",
"title": "2022 IEEE 28th International Conference on Parallel and Distributed Systems (ICPADS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icapc/2022/6303/0/630300a149",
"title": "Design and Performance Assessment of Combined Heat and Power Unit Incorporating Parabolic Trough Solar Energy",
"doi": null,
"abstractUrl": "/proceedings-article/icapc/2022/630300a149/1M7KXkcbooE",
"parentPublication": {
"id": "proceedings/icapc/2022/6303/0",
"title": "2022 International Conference on Applied Physics and Computing (ICAPC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icei/2019/1493/0/149300a368",
"title": "Optimal Operation Model of the Multi-Energy Network in the Distribution System",
"doi": null,
"abstractUrl": "/proceedings-article/icei/2019/149300a368/1ckselX1ux2",
"parentPublication": {
"id": "proceedings/icei/2019/1493/0",
"title": "2019 IEEE International Conference on Energy Internet (ICEI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icei/2019/1493/0/149300a328",
"title": "An Iteration Method for Optimal Energy Flow of Combined Heating and Electricity System",
"doi": null,
"abstractUrl": "/proceedings-article/icei/2019/149300a328/1cksg2k0YNO",
"parentPublication": {
"id": "proceedings/icei/2019/1493/0",
"title": "2019 IEEE International Conference on Energy Internet (ICEI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icicta/2019/4284/0/428400a696",
"title": "Research on Optimal Configuration of Multi-Source Energy Storage System to Promote Wind Power Consumption",
"doi": null,
"abstractUrl": "/proceedings-article/icicta/2019/428400a696/1hQqLU2h5iU",
"parentPublication": {
"id": "proceedings/icicta/2019/4284/0",
"title": "2019 12th International Conference on Intelligent Computation Technology and Automation (ICICTA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNzXFowc",
"title": "Proceedings of the 34th Annual Hawaii International Conference on System Sciences",
"acronym": "hicss",
"groupId": "1000730",
"volume": "0",
"displayVolume": "0",
"year": "2001",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNyeWdO9",
"doi": "10.1109/HICSS.2001.927067",
"title": "Establishing a framework for analyzing market power in electronic commerce: an empirical study",
"normalizedTitle": "Establishing a framework for analyzing market power in electronic commerce: an empirical study",
"abstract": "The research presented aims to develop some suitable metrics for the measurement of market power in the online retailing business. While it is obvious that market power exists in the online retailing business, especially among the market leaders, the factors that drive that market power have been considerably less analyzed. One of the main reasons why existing research in this area has concentrated on case studies and generalized observations is the lack of data that has been traditionally used to measure market power. On the other hand, the electronic nature of an online transaction makes available \"new\" clickstream data, in the form of individual and aggregate Web statistics. We explain the strategic conduct of an online retailer in terms of its manifestation in the clickstream data. In the process, we develop a framework for measuring market power as applicable to the world of online retailing.",
"abstracts": [
{
"abstractType": "Regular",
"content": "The research presented aims to develop some suitable metrics for the measurement of market power in the online retailing business. While it is obvious that market power exists in the online retailing business, especially among the market leaders, the factors that drive that market power have been considerably less analyzed. One of the main reasons why existing research in this area has concentrated on case studies and generalized observations is the lack of data that has been traditionally used to measure market power. On the other hand, the electronic nature of an online transaction makes available \"new\" clickstream data, in the form of individual and aggregate Web statistics. We explain the strategic conduct of an online retailer in terms of its manifestation in the clickstream data. In the process, we develop a framework for measuring market power as applicable to the world of online retailing.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "The research presented aims to develop some suitable metrics for the measurement of market power in the online retailing business. While it is obvious that market power exists in the online retailing business, especially among the market leaders, the factors that drive that market power have been considerably less analyzed. One of the main reasons why existing research in this area has concentrated on case studies and generalized observations is the lack of data that has been traditionally used to measure market power. On the other hand, the electronic nature of an online transaction makes available \"new\" clickstream data, in the form of individual and aggregate Web statistics. We explain the strategic conduct of an online retailer in terms of its manifestation in the clickstream data. In the process, we develop a framework for measuring market power as applicable to the world of online retailing.",
"fno": "00927067",
"keywords": [
"Electronic Commerce",
"Internet",
"Power Measurement",
"Books",
"Power Generation Economics",
"Area Measurement",
"Consumer Electronics",
"Aggregates",
"Statistics",
"Web Sites"
],
"authors": [
{
"affiliation": "Purdue Univ., West Lafayette, IN, USA",
"fullName": "A. Chaturvedi",
"givenName": "A.",
"surname": "Chaturvedi",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Purdue Univ., West Lafayette, IN, USA",
"fullName": "S. Bandyopadhyay",
"givenName": "S.",
"surname": "Bandyopadhyay",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "hicss",
"isOpenAccess": false,
"showRecommendedArticles": false,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2001-01-01T00:00:00",
"pubType": "proceedings",
"pages": "10 pp.",
"year": "2001",
"issn": null,
"isbn": "0-7695-0981-9",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "00927066",
"articleId": "12OmNyrqzDz",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "00927068",
"articleId": "12OmNz2TCxc",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNzXFowc",
"title": "Proceedings of the 34th Annual Hawaii International Conference on System Sciences",
"acronym": "hicss",
"groupId": "1000730",
"volume": "0",
"displayVolume": "0",
"year": "2001",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNz5s0UR",
"doi": "10.1109/HICSS.2001.926285",
"title": "The design of efficient market structures for ancillary services [electricity industry]",
"normalizedTitle": "The design of efficient market structures for ancillary services [electricity industry]",
"abstract": "The electricity industry has particular characteristics that create barriers to its successful commercialization. Electrical energy is instantaneously transmitted from generators to end-use equipment according to physical laws rather than commercial contracts. Any blueprint for commercialization must be compatible with these characteristics. The main commercial activities in a restructured electricity industry assume that electrical energy behaves as a commodity. Ancillary services play a crucial role in underwriting that assumption. Therefore, it is even more complex to achieve economically efficient outcomes in ancillary services than in the main commercial activities. This paper discusses approaches to this problem, with particular emphasis on recent proposals for changes to the implementation of ancillary services in Australia. It will be several years before the success of these proposals can be measured.",
"abstracts": [
{
"abstractType": "Regular",
"content": "The electricity industry has particular characteristics that create barriers to its successful commercialization. Electrical energy is instantaneously transmitted from generators to end-use equipment according to physical laws rather than commercial contracts. Any blueprint for commercialization must be compatible with these characteristics. The main commercial activities in a restructured electricity industry assume that electrical energy behaves as a commodity. Ancillary services play a crucial role in underwriting that assumption. Therefore, it is even more complex to achieve economically efficient outcomes in ancillary services than in the main commercial activities. This paper discusses approaches to this problem, with particular emphasis on recent proposals for changes to the implementation of ancillary services in Australia. It will be several years before the success of these proposals can be measured.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "The electricity industry has particular characteristics that create barriers to its successful commercialization. Electrical energy is instantaneously transmitted from generators to end-use equipment according to physical laws rather than commercial contracts. Any blueprint for commercialization must be compatible with these characteristics. The main commercial activities in a restructured electricity industry assume that electrical energy behaves as a commodity. Ancillary services play a crucial role in underwriting that assumption. Therefore, it is even more complex to achieve economically efficient outcomes in ancillary services than in the main commercial activities. This paper discusses approaches to this problem, with particular emphasis on recent proposals for changes to the implementation of ancillary services in Australia. It will be several years before the success of these proposals can be measured.",
"fno": "00926285",
"keywords": [
"Electrical Equipment Industry",
"Commercialization",
"Industrial Economics",
"Power Generation Economics",
"Energy Consumption",
"Mathematical Model",
"Contracts",
"Proposals",
"Power Generation",
"Power System Economics"
],
"authors": [
{
"affiliation": "New South Wales Univ., Kensington, NSW, Australia",
"fullName": "H. Outhred",
"givenName": "H.",
"surname": "Outhred",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "hicss",
"isOpenAccess": false,
"showRecommendedArticles": false,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2001-01-01T00:00:00",
"pubType": "proceedings",
"pages": "5 pp.",
"year": "2001",
"issn": null,
"isbn": "0-7695-0981-9",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "00926283",
"articleId": "12OmNzmclkv",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "00926286",
"articleId": "12OmNC4wtwB",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNwcUjWr",
"title": "Proceedings ISAD 93: International Symposium on Autonomous Decentralized Systems",
"acronym": "isads",
"groupId": "1000067",
"volume": "0",
"displayVolume": "0",
"year": "1993",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNzyp5Xb",
"doi": "10.1109/ISADS.1993.262729",
"title": "Japan's contribution to the world through science and technology",
"normalizedTitle": "Japan's contribution to the world through science and technology",
"abstract": "It is argued that as a technological superpower committed to peace, Japan should play a more positive role for the good of humanity. Japan's postwar experience of converting military industry to civilian production and thus gaining international competitiveness, for example, could help nations facing large-scale arms reduction. Japan's development of clean automotive engines that greatly reduced air pollution and established international competitiveness of Japanese cars could encourage nations tackling global environmental issues. Thus, by solving its own problems, including the enhancement of basic research and higher education, Japan can make genuine contributions to the world.<>",
"abstracts": [
{
"abstractType": "Regular",
"content": "It is argued that as a technological superpower committed to peace, Japan should play a more positive role for the good of humanity. Japan's postwar experience of converting military industry to civilian production and thus gaining international competitiveness, for example, could help nations facing large-scale arms reduction. Japan's development of clean automotive engines that greatly reduced air pollution and established international competitiveness of Japanese cars could encourage nations tackling global environmental issues. Thus, by solving its own problems, including the enhancement of basic research and higher education, Japan can make genuine contributions to the world.<>",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "It is argued that as a technological superpower committed to peace, Japan should play a more positive role for the good of humanity. Japan's postwar experience of converting military industry to civilian production and thus gaining international competitiveness, for example, could help nations facing large-scale arms reduction. Japan's development of clean automotive engines that greatly reduced air pollution and established international competitiveness of Japanese cars could encourage nations tackling global environmental issues. Thus, by solving its own problems, including the enhancement of basic research and higher education, Japan can make genuine contributions to the world.",
"fno": "00262729",
"keywords": [
"Engineering",
"Social Aspects Of Automation",
"Science",
"Technology",
"Japan",
"International Competitiveness",
"Automotive Engines",
"Air Pollution",
"Global Environmental Issues",
"Research",
"Education",
"Technological Innovation",
"Power Generation Economics",
"Peace Technology",
"Environmental Economics",
"Industrial Economics",
"Defense Industry",
"Engines",
"Computational Intelligence Society",
"Information Systems",
"Councils"
],
"authors": [
{
"affiliation": "Nat. Center for Sci. Inf. Syst., Tokyo, Japan",
"fullName": "H. Inose",
"givenName": "H.",
"surname": "Inose",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "isads",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "1993-01-01T00:00:00",
"pubType": "proceedings",
"pages": "2,3,4,5,6,7,8",
"year": "1993",
"issn": null,
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "00262728",
"articleId": "12OmNzkMlSG",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "00262730",
"articleId": "12OmNyr8YuH",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/iiai-aai/2017/0621/0/0621a188",
"title": "The Study of Global Mobility of the Technology University Students",
"doi": null,
"abstractUrl": "/proceedings-article/iiai-aai/2017/0621a188/12OmNBSBkga",
"parentPublication": {
"id": "proceedings/iiai-aai/2017/0621/0",
"title": "2017 6th IIAI International Congress on Advanced Applied Informatics (IIAI-AAI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/srii/2012/4770/0/4770a895",
"title": "Problem to the Productivity Improvement of the Service Industry of Japan",
"doi": null,
"abstractUrl": "/proceedings-article/srii/2012/4770a895/12OmNsd6vnl",
"parentPublication": {
"id": "proceedings/srii/2012/4770/0",
"title": "Annual SRII Global Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/fie/1997/4086/1/00644847",
"title": "Status and issues in international accreditation of computer science and engineering programs",
"doi": null,
"abstractUrl": "/proceedings-article/fie/1997/00644847/12OmNzXFoGE",
"parentPublication": {
"id": "proceedings/fie/1997/4086/1",
"title": "Proceedings Frontiers in Education 1997 27th Annual Conference. Teaching and Learning in an Era of Change",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icim/2022/5174/0/517400a041",
"title": "Research on Experimental Resource Sharing System for New Engineering Talents Training-Taking Industrial Engineering Laboratory of Wuhan University of Technology as an Example",
"doi": null,
"abstractUrl": "/proceedings-article/icim/2022/517400a041/1FHqB6JcHL2",
"parentPublication": {
"id": "proceedings/icim/2022/5174/0",
"title": "2022 8th International Conference on Information Management (ICIM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/eimss/2021/2707/0/270700a351",
"title": "Exploration and Practice of the Bilingual Teaching Model of “International Business Management” Based on Information Technology Platform",
"doi": null,
"abstractUrl": "/proceedings-article/eimss/2021/270700a351/1yEZUGPsLny",
"parentPublication": {
"id": "proceedings/eimss/2021/2707/0",
"title": "2021 International Conference on Education, Information Management and Service Science (EIMSS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "1jZacXR14xa",
"title": "2020 Seventh International Conference on eDemocracy & eGovernment (ICEDEG)",
"acronym": "icedeg",
"groupId": "1803698",
"volume": "0",
"displayVolume": "0",
"year": "2020",
"__typename": "ProceedingType"
},
"article": {
"id": "1l6SzmDsnp6",
"doi": "10.1109/ICEDEG48599.2020.9096711",
"title": "ICT Development in the Public Sector and the Small Island States Context - Evidence from across the World",
"normalizedTitle": "ICT Development in the Public Sector and the Small Island States Context - Evidence from across the World",
"abstract": "Information and Communication Technology (ICT) as an enabler of public sector reform, efficiency and effectiveness gains is a key topic in Public Administration, IT governance and electronic government (e-Government) literature. While the study of small states is a specialised research field of, not much has been written on the application of ICT in the public sector of small island states. This article outlines the key challenges of small island states on public administration ICT development. Using longitudinal data, ranging from 2003 to 2018, for more than 170 countries, we empirically investigate the main determinants of e-Government development by taking into consideration the impact exerted by the small island state status. Small islands exhibit lower average Online Services Index scores than the remaining countries and the regression results indicate that being a small island state has, on average, a negative effect on e-Government development. When we observe the evolution of the Online Services Index within the same income category, for the period 2003-2018, we find that the difference between small islands states and the remaining countries becomes smaller as we move from the low-income to the high-income group. For the small island states, the degree of openness of the economy appears to be a relevant determinant of e-Government development, but the same does not happen for the remaining countries. When it comes to political rights and the level of corruption, the results suggest it works the other way around. Historical challenges, successes, and specificities of these countries are mentioned, and key lessons are outlined when discussing the results.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Information and Communication Technology (ICT) as an enabler of public sector reform, efficiency and effectiveness gains is a key topic in Public Administration, IT governance and electronic government (e-Government) literature. While the study of small states is a specialised research field of, not much has been written on the application of ICT in the public sector of small island states. This article outlines the key challenges of small island states on public administration ICT development. Using longitudinal data, ranging from 2003 to 2018, for more than 170 countries, we empirically investigate the main determinants of e-Government development by taking into consideration the impact exerted by the small island state status. Small islands exhibit lower average Online Services Index scores than the remaining countries and the regression results indicate that being a small island state has, on average, a negative effect on e-Government development. When we observe the evolution of the Online Services Index within the same income category, for the period 2003-2018, we find that the difference between small islands states and the remaining countries becomes smaller as we move from the low-income to the high-income group. For the small island states, the degree of openness of the economy appears to be a relevant determinant of e-Government development, but the same does not happen for the remaining countries. When it comes to political rights and the level of corruption, the results suggest it works the other way around. Historical challenges, successes, and specificities of these countries are mentioned, and key lessons are outlined when discussing the results.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Information and Communication Technology (ICT) as an enabler of public sector reform, efficiency and effectiveness gains is a key topic in Public Administration, IT governance and electronic government (e-Government) literature. While the study of small states is a specialised research field of, not much has been written on the application of ICT in the public sector of small island states. This article outlines the key challenges of small island states on public administration ICT development. Using longitudinal data, ranging from 2003 to 2018, for more than 170 countries, we empirically investigate the main determinants of e-Government development by taking into consideration the impact exerted by the small island state status. Small islands exhibit lower average Online Services Index scores than the remaining countries and the regression results indicate that being a small island state has, on average, a negative effect on e-Government development. When we observe the evolution of the Online Services Index within the same income category, for the period 2003-2018, we find that the difference between small islands states and the remaining countries becomes smaller as we move from the low-income to the high-income group. For the small island states, the degree of openness of the economy appears to be a relevant determinant of e-Government development, but the same does not happen for the remaining countries. When it comes to political rights and the level of corruption, the results suggest it works the other way around. Historical challenges, successes, and specificities of these countries are mentioned, and key lessons are outlined when discussing the results.",
"fno": "09096711",
"keywords": [
"Government Data Processing",
"Organisational Aspects",
"Public Administration",
"Regression Analysis",
"Research And Development",
"Small To Medium Enterprises",
"Small Island States Context Evidence",
"Public Sector Reform",
"Electronic Government Literature",
"Public Administration ICT Development",
"E Government Development",
"Island State Status",
"Lower Average Online Services Index Scores",
"Remaining Countries",
"Islands States",
"Electronic Government",
"Sociology",
"Statistics",
"Mathematical Model",
"Open Systems",
"Economics",
"E Government",
"ICT",
"Public Administration",
"Online Services",
"Small Islands",
"Development"
],
"authors": [
{
"affiliation": "UNU-EGOV and NIPE, United Nations University and University of Minho,Guimarães,Portugal",
"fullName": "João Martins",
"givenName": "João",
"surname": "Martins",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "UNU-EGOV, United Nations University,Guimarães,Portugal",
"fullName": "Morten Meyerhoff Nielsen",
"givenName": "Morten Meyerhoff",
"surname": "Nielsen",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "icedeg",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2020-04-01T00:00:00",
"pubType": "proceedings",
"pages": "67-73",
"year": "2020",
"issn": null,
"isbn": "978-1-7281-5882-2",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "09096697",
"articleId": "1l6SxkgPUgo",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09096801",
"articleId": "1l6SDoqKrja",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/big-data/2014/5666/0/07004446",
"title": "Mining microdata: Economic opportunity and spatial mobility in Britain and the United States, 1850–1881",
"doi": null,
"abstractUrl": "/proceedings-article/big-data/2014/07004446/12OmNARAn8z",
"parentPublication": {
"id": "proceedings/big-data/2014/5666/0",
"title": "2014 IEEE International Conference on Big Data (Big Data)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icmecg/2014/6543/0/6543a307",
"title": "The Influence of the Digital Divide to the Electronic Government Affairs",
"doi": null,
"abstractUrl": "/proceedings-article/icmecg/2014/6543a307/12OmNAlvHUZ",
"parentPublication": {
"id": "proceedings/icmecg/2014/6543/0",
"title": "2014 International Conference on Management of e-Commerce and e-Government (ICMeCG)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/hicss/2015/7367/0/7367c242",
"title": "Investigating Open Source Software Benefits in Public Sector",
"doi": null,
"abstractUrl": "/proceedings-article/hicss/2015/7367c242/12OmNAlvHys",
"parentPublication": {
"id": "proceedings/hicss/2015/7367/0",
"title": "2015 48th Hawaii International Conference on System Sciences (HICSS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/hicss/2013/4892/0/4892b922",
"title": "An Information Ecology Approach to Sustainable E-Government among Small Island Developing States in the Pacific",
"doi": null,
"abstractUrl": "/proceedings-article/hicss/2013/4892b922/12OmNCdBDOE",
"parentPublication": {
"id": "proceedings/hicss/2013/4892/0",
"title": "2013 46th Hawaii International Conference on System Sciences",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/hicss/2013/4892/0/4892e226",
"title": "Information and Communications Technology in the Tourism Sector of the Maldives: An Institutional Perspective",
"doi": null,
"abstractUrl": "/proceedings-article/hicss/2013/4892e226/12OmNvDI45m",
"parentPublication": {
"id": "proceedings/hicss/2013/4892/0",
"title": "2013 46th Hawaii International Conference on System Sciences",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ictai/2017/3876/0/387601a709",
"title": "Particle Swarm Optimization Based on Dynamic Island Model",
"doi": null,
"abstractUrl": "/proceedings-article/ictai/2017/387601a709/12OmNxT56D3",
"parentPublication": {
"id": "proceedings/ictai/2017/3876/0",
"title": "2017 IEEE 29th International Conference on Tools with Artificial Intelligence (ICTAI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iacsit-sc/2009/3653/0/3653a608",
"title": "Sustainable Development of Small Island Developing States: The Case of Curaçao",
"doi": null,
"abstractUrl": "/proceedings-article/iacsit-sc/2009/3653a608/12OmNykTNmm",
"parentPublication": {
"id": "proceedings/iacsit-sc/2009/3653/0",
"title": "Computer Science and Information Technology, International Association of",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/hicss/2016/5670/0/07427695",
"title": "Fostering GCC's Knowledge Economy through ICT: Research in Progress",
"doi": null,
"abstractUrl": "/proceedings-article/hicss/2016/07427695/12OmNzTppzL",
"parentPublication": {
"id": "proceedings/hicss/2016/5670/0",
"title": "2016 49th Hawaii International Conference on System Sciences (HICSS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/hicss/2016/5670/0/5670e655",
"title": "Emerging Technology Use in Very Small Island States: A Tenuous Relationship between Average Information and Communication Technology (ICT) Usage and Per Capita Gross Domestic Product (GDP) Growth",
"doi": null,
"abstractUrl": "/proceedings-article/hicss/2016/5670e655/12OmNzcxYVy",
"parentPublication": {
"id": "proceedings/hicss/2016/5670/0",
"title": "2016 49th Hawaii International Conference on System Sciences (HICSS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/mark/1979/3181/0/08817310",
"title": "How do we best control the flow of electronic information across sovereign borders?",
"doi": null,
"abstractUrl": "/proceedings-article/mark/1979/08817310/1cTIXQLZQVq",
"parentPublication": {
"id": "proceedings/mark/1979/3181/0",
"title": "1979 International Workshop on Managing Requirements Knowledge",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNxRnvRV",
"title": "2006 IEEE/ACM 6th Joint Conference on Digital Libraries",
"acronym": "jcdl",
"groupId": "1804605",
"volume": "0",
"displayVolume": "0",
"year": "2006",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNA0dMJL",
"doi": "10.1145/1141753.1141759",
"title": "The challenge of virginia banks: an evaluation of named entity analysis in a 19th-century newspaper collection",
"normalizedTitle": "The challenge of virginia banks: an evaluation of named entity analysis in a 19th-century newspaper collection",
"abstract": "This paper evaluates automatic extraction of ten named entity classes from a 19th century newspaper, the Civil War years of the Richmond Times Dispatch, digitized with IMLS support by the University of Richmond. This paper analyzes success with ten categories of entities prominent in these newspapers and the particular problems that these classes of named entities raise. Personal and place names are familiar but some more important categories (such as ship names and military units) illustrate some of the challenges that named entity identification confronts as it evolves into a fundamental tool not only for automatic metadata generation but also for searching and browsing as well. We conclude by suggesting the kinds of knowledge sources that digital libraries need to assemble as part of their machine readable reference collections to support named entity identification as a core service",
"abstracts": [
{
"abstractType": "Regular",
"content": "This paper evaluates automatic extraction of ten named entity classes from a 19th century newspaper, the Civil War years of the Richmond Times Dispatch, digitized with IMLS support by the University of Richmond. This paper analyzes success with ten categories of entities prominent in these newspapers and the particular problems that these classes of named entities raise. Personal and place names are familiar but some more important categories (such as ship names and military units) illustrate some of the challenges that named entity identification confronts as it evolves into a fundamental tool not only for automatic metadata generation but also for searching and browsing as well. We conclude by suggesting the kinds of knowledge sources that digital libraries need to assemble as part of their machine readable reference collections to support named entity identification as a core service",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "This paper evaluates automatic extraction of ten named entity classes from a 19th century newspaper, the Civil War years of the Richmond Times Dispatch, digitized with IMLS support by the University of Richmond. This paper analyzes success with ten categories of entities prominent in these newspapers and the particular problems that these classes of named entities raise. Personal and place names are familiar but some more important categories (such as ship names and military units) illustrate some of the challenges that named entity identification confronts as it evolves into a fundamental tool not only for automatic metadata generation but also for searching and browsing as well. We conclude by suggesting the kinds of knowledge sources that digital libraries need to assemble as part of their machine readable reference collections to support named entity identification as a core service",
"fno": "04119094",
"keywords": [
"Digital Libraries",
"History",
"Information Analysis",
"Information Retrieval",
"Meta Data",
"Virginia Banks",
"Named Entity Analysis",
"19th Century Newspaper Collection",
"Automatic Extraction",
"Civil War Years",
"Richmond Times Dispatch",
"IMLS",
"Automatic Metadata Generation",
"Digital Library",
"Machine Readable Reference Collections",
"Software Libraries",
"Information Retrieval",
"Permission",
"Cranes",
"Marine Vehicles",
"Assembly",
"Oceans",
"Abstracts",
"Job Listing Service",
"Encyclopedias",
"Digital Libraries",
"Historical Newspapers",
"Named Entity Recognition"
],
"authors": [
{
"affiliation": "Tufts University, Medford, MA",
"fullName": "Alison Jones",
"givenName": "Alison",
"surname": "Jones",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Tufts University, Medford, MA",
"fullName": "Gregory Crane",
"givenName": "Gregory",
"surname": "Crane",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "jcdl",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2006-06-01T00:00:00",
"pubType": "proceedings",
"pages": "",
"year": "2006",
"issn": null,
"isbn": "1-59593-354-9",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "04119093",
"articleId": "12OmNCga1Ti",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "04119095",
"articleId": "12OmNyvGyiy",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/iiai-aai/2016/8985/0/8985a179",
"title": "Entity Linking of Artists Names in Japanese Music Articles",
"doi": null,
"abstractUrl": "/proceedings-article/iiai-aai/2016/8985a179/12OmNB836Tt",
"parentPublication": {
"id": "proceedings/iiai-aai/2016/8985/0",
"title": "2016 5th IIAI International Congress on Advanced Applied Informatics (IIAI-AAI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icmi/2002/1834/0/18340253",
"title": "Improved Named Entity Translation and Bilingual Named Entity Extraction",
"doi": null,
"abstractUrl": "/proceedings-article/icmi/2002/18340253/12OmNrNh0Fr",
"parentPublication": {
"id": "proceedings/icmi/2002/1834/0",
"title": "Proceedings Fourth IEEE International Conference on Multimodal Interfaces",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ictai/2016/4459/0/4459b035",
"title": "NEREA: Named Entity Recognition and Disambiguation Exploiting Local Document Repositories",
"doi": null,
"abstractUrl": "/proceedings-article/ictai/2016/4459b035/12OmNvpNIs4",
"parentPublication": {
"id": "proceedings/ictai/2016/4459/0",
"title": "2016 IEEE 28th International Conference on Tools with Artificial Intelligence (ICTAI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cit-iucc-dasc-picom/2015/0154/0/07363087",
"title": "An Approach of Vector Space Model to Link Concrete Concepts with Wiki Entities",
"doi": null,
"abstractUrl": "/proceedings-article/cit-iucc-dasc-picom/2015/07363087/12OmNxGSmc1",
"parentPublication": {
"id": "proceedings/cit-iucc-dasc-picom/2015/0154/0",
"title": "2015 IEEE International Conference on Computer and Information Technology; Ubiquitous Computing and Communications; Dependable, Autonomic and Secure Computing; Pervasive Intelligence and Computing (CIT/IUCC/DASC/PICOM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iiai-aai/2017/0621/0/0621a334",
"title": "An Entity Disambiguation Approach Based on Wikipedia for Entity Linking in Microblogs",
"doi": null,
"abstractUrl": "/proceedings-article/iiai-aai/2017/0621a334/12OmNyeECHL",
"parentPublication": {
"id": "proceedings/iiai-aai/2017/0621/0",
"title": "2017 6th IIAI International Congress on Advanced Applied Informatics (IIAI-AAI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2018/02/07990163",
"title": "SHINE+: A General Framework for Domain-Specific Entity Linking with Heterogeneous Information Networks",
"doi": null,
"abstractUrl": "/journal/tk/2018/02/07990163/13rRUwbs2gP",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdmw/2021/2427/0/242700a653",
"title": "Legal Entity Extraction using a Pointer Generator Network",
"doi": null,
"abstractUrl": "/proceedings-article/icdmw/2021/242700a653/1AjSVHFR5h6",
"parentPublication": {
"id": "proceedings/icdmw/2021/2427/0",
"title": "2021 International Conference on Data Mining Workshops (ICDMW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2022/11/09316308",
"title": "Open Named Entity Modeling From Embedding Distribution",
"doi": null,
"abstractUrl": "/journal/tk/2022/11/09316308/1qaz8NMdICA",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ifeea/2020/9627/0/962700a652",
"title": "Named Entity Recognition of TCM Text Based on Bert Model",
"doi": null,
"abstractUrl": "/proceedings-article/ifeea/2020/962700a652/1rvCGiktbC8",
"parentPublication": {
"id": "proceedings/ifeea/2020/9627/0",
"title": "2020 7th International Forum on Electrical Engineering and Automation (IFEEA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/aiam/2020/9986/0/998600a121",
"title": "Research on Named Entity Recognition for Information Extraction",
"doi": null,
"abstractUrl": "/proceedings-article/aiam/2020/998600a121/1tweKY4y7Ic",
"parentPublication": {
"id": "proceedings/aiam/2020/9986/0",
"title": "2020 2nd International Conference on Artificial Intelligence and Advanced Manufacture (AIAM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNCcKQAl",
"title": "Proceedings of the 2003 International Conference on Machine Learning and Cybernetics",
"acronym": "icmlc",
"groupId": "1000424",
"volume": "4",
"displayVolume": "4",
"year": "2003",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNAYGlzt",
"doi": "10.1109/ICMLC.2003.1259879",
"title": "Ontology-based GML schema matching for spatial information integration",
"normalizedTitle": "Ontology-based GML schema matching for spatial information integration",
"abstract": "The variety and complexity of spatial data models and geographic information systems (GIS) together with the popularity of WWW have led to an increasing number of heterogeneous and autonomous geo-referenced information sources that spread over the Internet. This paper proposes a framework for integrating distributed spatial information based on GML schema matching by using ontology. GML is adopted as the common format for spatial information wrapping and mediation, and ontology is used to overcome the heterogeneity when matching different GML schemas. A prototype is also implemented based on the proposed framework.",
"abstracts": [
{
"abstractType": "Regular",
"content": "The variety and complexity of spatial data models and geographic information systems (GIS) together with the popularity of WWW have led to an increasing number of heterogeneous and autonomous geo-referenced information sources that spread over the Internet. This paper proposes a framework for integrating distributed spatial information based on GML schema matching by using ontology. GML is adopted as the common format for spatial information wrapping and mediation, and ontology is used to overcome the heterogeneity when matching different GML schemas. A prototype is also implemented based on the proposed framework.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "The variety and complexity of spatial data models and geographic information systems (GIS) together with the popularity of WWW have led to an increasing number of heterogeneous and autonomous geo-referenced information sources that spread over the Internet. This paper proposes a framework for integrating distributed spatial information based on GML schema matching by using ontology. GML is adopted as the common format for spatial information wrapping and mediation, and ontology is used to overcome the heterogeneity when matching different GML schemas. A prototype is also implemented based on the proposed framework.",
"fno": "01259879",
"keywords": [
"Geographic Information Systems",
"Internet",
"Web Sites",
"Hypermedia Markup Languages",
"Ontology",
"GML Schema Matching",
"Spatial Information Integration",
"GIS",
"Geographic Information System",
"World Wide Web",
"Internet",
"Ontologies",
"Data Engineering",
"Internet",
"XML",
"Geographic Information Systems",
"Mobile Agents",
"Computer Science",
"Data Models",
"Computational Intelligence Society",
"World Wide Web"
],
"authors": [
{
"affiliation": "Sch. of Comput., Wuhan Univ., China",
"fullName": "Ji-Hong Guan",
"givenName": null,
"surname": "Ji-Hong Guan",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Shui-Geng Zhou",
"givenName": null,
"surname": "Shui-Geng Zhou",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Jun-Peng Chen",
"givenName": null,
"surname": "Jun-Peng Chen",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Xiao-Long Chen",
"givenName": null,
"surname": "Xiao-Long Chen",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Yang An",
"givenName": null,
"surname": "Yang An",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Wei Yu",
"givenName": null,
"surname": "Wei Yu",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Rong Wang",
"givenName": null,
"surname": "Rong Wang",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Xu-Jun Liu",
"givenName": null,
"surname": "Xu-Jun Liu",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "icmlc",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2003-01-01T00:00:00",
"pubType": "proceedings",
"pages": "2240,2241,2242,2243,2244,2245",
"year": "2003",
"issn": null,
"isbn": "0-7803-7865-2",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "01259878",
"articleId": "12OmNAoUTsk",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "01259880",
"articleId": "12OmNx57HLz",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/mvhi/2010/4009/0/4009a588",
"title": "Towards Spatial Information Services in LBS: A GML-Based Approach",
"doi": null,
"abstractUrl": "/proceedings-article/mvhi/2010/4009a588/12OmNALlcgU",
"parentPublication": {
"id": "proceedings/mvhi/2010/4009/0",
"title": "Machine Vision and Human-machine Interface, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/compsac/2004/2209/2/220920074",
"title": "Evaluating GML Support for Spatial Databases",
"doi": null,
"abstractUrl": "/proceedings-article/compsac/2004/220920074/12OmNBUS77v",
"parentPublication": {
"id": "proceedings/compsac/2004/2209/2",
"title": "Proceedings of the 28th Annual International Computer Software and Applications Conference, 2004. COMPSAC 2004.",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/aici/2009/3816/4/3816d298",
"title": "A Spatial Clustering Algorithm Based on Spatial Topological Relations for GML Data",
"doi": null,
"abstractUrl": "/proceedings-article/aici/2009/3816d298/12OmNBa2iAM",
"parentPublication": {
"id": "proceedings/aici/2009/3816/4",
"title": "2009 International Conference on Artificial Intelligence and Computational Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/dexa/2004/2195/0/21950872",
"title": "Integrating GML Resources and Other Web Resources",
"doi": null,
"abstractUrl": "/proceedings-article/dexa/2004/21950872/12OmNqN6RaS",
"parentPublication": {
"id": "proceedings/dexa/2004/2195/0",
"title": "Proceedings. 15th International Workshop on Database and Expert Systems Applications, 2004.",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/esiat/2009/3682/2/3682b538",
"title": "Load Balancing Spatial Analysis in XML/GML/SVG Based WebGIS",
"doi": null,
"abstractUrl": "/proceedings-article/esiat/2009/3682b538/12OmNx5piUU",
"parentPublication": {
"id": "esiat/2009/3682/2",
"title": "Environmental Science and Information Application Technology, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/etcs/2009/3557/1/3557a278",
"title": "A Novel Spatial Clustering Algorithm Based on Spatial Adjacent Relation for GML Data",
"doi": null,
"abstractUrl": "/proceedings-article/etcs/2009/3557a278/12OmNx76TGR",
"parentPublication": {
"id": "proceedings/etcs/2009/3557/2",
"title": "Education Technology and Computer Science, International Workshop on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ettandgrs/2008/3563/1/3563a281",
"title": "GHIC: A GML Compressor with Holistic Isomorphic Characteristic",
"doi": null,
"abstractUrl": "/proceedings-article/ettandgrs/2008/3563a281/12OmNyUFg24",
"parentPublication": {
"id": "proceedings/ettandgrs/2008/3563/1",
"title": "Education Technology and Training & Geoscience and Remote Sensing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/fcst/2008/3540/0/3540a079",
"title": "Spatial Data Compression Techniques for GML",
"doi": null,
"abstractUrl": "/proceedings-article/fcst/2008/3540a079/12OmNzt0IOL",
"parentPublication": {
"id": "proceedings/fcst/2008/3540/0",
"title": "2008 Japan-China Joint Workshop on Frontier of Computer Science and Technology",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cit/2010/4108/0/4108a620",
"title": "New GML Storage Schema Models for Spatial and Non-spatial Information",
"doi": null,
"abstractUrl": "/proceedings-article/cit/2010/4108a620/12OmNzwHvhA",
"parentPublication": {
"id": "proceedings/cit/2010/4108/0",
"title": "Computer and Information Technology, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/compsac/2007/2870/1/04291076",
"title": "Study on GML Spatial Interoperability based on Web Service",
"doi": null,
"abstractUrl": "/proceedings-article/compsac/2007/04291076/17D45Xh13w7",
"parentPublication": {
"id": "proceedings/compsac/2007/2870/2",
"title": "31st Annual International Computer Software and Applications Conference (COMPSAC 2007)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNqAU6sQ",
"title": "Computer Research and Development, International Conference on",
"acronym": "iccrd",
"groupId": "1800063",
"volume": "0",
"displayVolume": "0",
"year": "2010",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNwtEELs",
"doi": "10.1109/ICCRD.2010.150",
"title": "Spatial Autocorrelation Analysis of Population in Main Years",
"normalizedTitle": "Spatial Autocorrelation Analysis of Population in Main Years",
"abstract": "The purpose of this paper is to analyze the spatial characteristics of the total population distribution in 39 cities near the Lancang River at the end of 1978 year to 2007 Year .The inherent laws of spatial distribution of population can be revealed by the spatial autocorrelation analysis based on population density data, we can analyze the spatial characteristics of population for each cities and the reason of the formed dynamic mechanism and motivation. In this paper studies, we mixed the spatial Topology relationship, the visualization and exporting map of GIS function into the spatial pattern of the geographical phenomena perfectly.",
"abstracts": [
{
"abstractType": "Regular",
"content": "The purpose of this paper is to analyze the spatial characteristics of the total population distribution in 39 cities near the Lancang River at the end of 1978 year to 2007 Year .The inherent laws of spatial distribution of population can be revealed by the spatial autocorrelation analysis based on population density data, we can analyze the spatial characteristics of population for each cities and the reason of the formed dynamic mechanism and motivation. In this paper studies, we mixed the spatial Topology relationship, the visualization and exporting map of GIS function into the spatial pattern of the geographical phenomena perfectly.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "The purpose of this paper is to analyze the spatial characteristics of the total population distribution in 39 cities near the Lancang River at the end of 1978 year to 2007 Year .The inherent laws of spatial distribution of population can be revealed by the spatial autocorrelation analysis based on population density data, we can analyze the spatial characteristics of population for each cities and the reason of the formed dynamic mechanism and motivation. In this paper studies, we mixed the spatial Topology relationship, the visualization and exporting map of GIS function into the spatial pattern of the geographical phenomena perfectly.",
"fno": "4043a844",
"keywords": [
"Demography",
"Geographic Information Systems",
"Spatial Autocorrelation Population Analysis",
"Spatial Population Distribution",
"Spatial Topology Relationship",
"GIS Function",
"Autocorrelation",
"Power Generation Economics",
"Cities And Towns",
"Statistical Distributions",
"Statistical Analysis",
"Force Measurement",
"Data Visualization",
"Geographic Information Systems",
"Rivers",
"Data Analysis",
"Spatial Distribution",
"Spatial Autocorrelation",
"Spatial Statistics",
"Visualization"
],
"authors": [
{
"affiliation": "Chinese Acad. of Surveying & Mapping, Liaoning Tech. Univ., Beijing, China",
"fullName": "Zhang Yu",
"givenName": "Zhang",
"surname": "Yu",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Chinese Acad. of Surveying & Mapping, Beijing, China",
"fullName": "Dong Chun",
"givenName": "Dong",
"surname": "Chun",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "iccrd",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2010-05-01T00:00:00",
"pubType": "proceedings",
"pages": "844-848",
"year": "2010",
"issn": null,
"isbn": "978-0-7695-4043-6",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "4043a839",
"articleId": "12OmNqAU6H8",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "4043a849",
"articleId": "12OmNy2Jt9e",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/e-science/2009/5946/0/05407971",
"title": "Combining historic interpretations of the Great Britain population with contemporary spatial analysis: The case of surnames",
"doi": null,
"abstractUrl": "/proceedings-article/e-science/2009/05407971/12OmNAYXWza",
"parentPublication": {
"id": "proceedings/e-science/2009/5946/0",
"title": "2009 5th IEEE International Conference on e-Science Workshops (e-science 2009)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pdcat/2011/4564/0/4564a427",
"title": "Spatial Clustering Applied to Health Area",
"doi": null,
"abstractUrl": "/proceedings-article/pdcat/2011/4564a427/12OmNrJiCGF",
"parentPublication": {
"id": "proceedings/pdcat/2011/4564/0",
"title": "Parallel and Distributed Computing Applications and Technologies, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/fskd/2008/3305/2/3305b498",
"title": "Research on Evaluating Urban Comprehensive Competitiveness during Multi-year and the Spatial Characters of Important Cities in China",
"doi": null,
"abstractUrl": "/proceedings-article/fskd/2008/3305b498/12OmNs0TL1e",
"parentPublication": {
"id": "fskd/2008/3305/2",
"title": "Fuzzy Systems and Knowledge Discovery, Fourth International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/isdea/2014/4261/0/4261a825",
"title": "Research on Optimization of Spatial Structure Benefit for Urban Agglomeration in Central Yunnan Province Based on GIS",
"doi": null,
"abstractUrl": "/proceedings-article/isdea/2014/4261a825/12OmNvA1hwv",
"parentPublication": {
"id": "proceedings/isdea/2014/4261/0",
"title": "2014 Fifth International Conference on Intelligent Systems Design and Engineering Applications (ISDEA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/etcs/2009/3557/3/3557e720",
"title": "A Local Indicator of Spatial Autocorrelation Based Sub-Area Algorithm for Wireless Sensor Networks",
"doi": null,
"abstractUrl": "/proceedings-article/etcs/2009/3557e720/12OmNwB2dVa",
"parentPublication": {
"id": "proceedings/etcs/2009/3557/3",
"title": "Education Technology and Computer Science, International Workshop on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/isvd/2009/3781/0/3781a118",
"title": "A Voronoi-Like Model of Spatial Autocorrelation for Characterizing Spatial Patterns in Vector Data",
"doi": null,
"abstractUrl": "/proceedings-article/isvd/2009/3781a118/12OmNx3HI3f",
"parentPublication": {
"id": "proceedings/isvd/2009/3781/0",
"title": "2009 Sixth International Symposium on Voronoi Diagrams",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iciss/2015/8611/0/07371016",
"title": "Mapping of Dengue Outbreak Distribution Using Spatial Statistics and Geographical Information System",
"doi": null,
"abstractUrl": "/proceedings-article/iciss/2015/07371016/12OmNxZkhvZ",
"parentPublication": {
"id": "proceedings/iciss/2015/8611/0",
"title": "2015 2nd International Conference on Information Science and Security (ICISS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/isdea/2014/4261/0/4261a213",
"title": "Analysis on Cross-Border Distribution Temporal and Spatial Pattern Evolution of Population of Wa Nationality Based on GIS",
"doi": null,
"abstractUrl": "/proceedings-article/isdea/2014/4261a213/12OmNyTwRf5",
"parentPublication": {
"id": "proceedings/isdea/2014/4261/0",
"title": "2014 Fifth International Conference on Intelligent Systems Design and Engineering Applications (ISDEA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2014/06/06574853",
"title": "A K-Main Routes Approach to Spatial Network Activity Summarization",
"doi": null,
"abstractUrl": "/journal/tk/2014/06/06574853/13rRUEgs2tM",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icvris/2018/8031/0/803100a143",
"title": "Study on Regional Differences of Population Urbanization in Yunnan Province Based on the Analysis of Census Big Data",
"doi": null,
"abstractUrl": "/proceedings-article/icvris/2018/803100a143/17D45WZZ7Ch",
"parentPublication": {
"id": "proceedings/icvris/2018/8031/0",
"title": "2018 International Conference on Virtual Reality and Intelligent Systems (ICVRIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNvk7JKG",
"title": "2010 IEEE International Conference on Granular Computing",
"acronym": "grc",
"groupId": "1001626",
"volume": "0",
"displayVolume": "0",
"year": "2010",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNzX6cfp",
"doi": "10.1109/GrC.2010.106",
"title": "Using Feature Component for Spatial Data Modeling of GIS",
"normalizedTitle": "Using Feature Component for Spatial Data Modeling of GIS",
"abstract": "Based on the traditional Entity-oriented spatial data model, such as Geodatabase, this paper propositions a new model for spatial data modeling in GIS system. Reference to the concept of component in the realm of software engineering, spatial data entity in GIS is abstracted with loose coupling and multi-spatial expression into several feature components for modeling. It is benefit for GIS upper application due to a significant spatial data structure. And eventually, the advantages of this model are introduced with detail.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Based on the traditional Entity-oriented spatial data model, such as Geodatabase, this paper propositions a new model for spatial data modeling in GIS system. Reference to the concept of component in the realm of software engineering, spatial data entity in GIS is abstracted with loose coupling and multi-spatial expression into several feature components for modeling. It is benefit for GIS upper application due to a significant spatial data structure. And eventually, the advantages of this model are introduced with detail.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Based on the traditional Entity-oriented spatial data model, such as Geodatabase, this paper propositions a new model for spatial data modeling in GIS system. Reference to the concept of component in the realm of software engineering, spatial data entity in GIS is abstracted with loose coupling and multi-spatial expression into several feature components for modeling. It is benefit for GIS upper application due to a significant spatial data structure. And eventually, the advantages of this model are introduced with detail.",
"fno": "05576046",
"keywords": [
"Entity Relationship Modelling",
"Geographic Information Systems",
"Software Engineering",
"Spatial Data Structures",
"Feature Component",
"Entity Oriented Spatial Data Model",
"Geodatabase",
"GIS System",
"Software Engineering",
"Spatial Data Entity",
"Multispatial Expression",
"Data Models",
"Spatial Databases",
"Geographic Information Systems",
"Geometry",
"Topology",
"Power Systems",
"Computers",
"GIS",
"Feature Component",
"Spatial Data Modeing"
],
"authors": [
{
"affiliation": null,
"fullName": "Wei Li",
"givenName": "Wei",
"surname": "Li",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Shuai Gong",
"givenName": "Shuai",
"surname": "Gong",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Xiaohui Wang",
"givenName": "Xiaohui",
"surname": "Wang",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "grc",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2010-08-01T00:00:00",
"pubType": "proceedings",
"pages": "708-711",
"year": "2010",
"issn": null,
"isbn": "978-1-4244-7964-1",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "05576045",
"articleId": "12OmNrYlmHj",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "05576048",
"articleId": "12OmNwcUk1I",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/isise/2008/3494/2/3494b641",
"title": "Security Model for Distributed GIS Spatial Data",
"doi": null,
"abstractUrl": "/proceedings-article/isise/2008/3494b641/12OmNASILPZ",
"parentPublication": {
"id": "proceedings/isise/2008/3494/2",
"title": "2008 International Symposium on Information Science and Engineering (ISISE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wkdd/2009/3543/0/3543a159",
"title": "Research of GIS-based Spatial Data Mining Model",
"doi": null,
"abstractUrl": "/proceedings-article/wkdd/2009/3543a159/12OmNAmE5XM",
"parentPublication": {
"id": "proceedings/wkdd/2009/3543/0",
"title": "2009 Second International Workshop on Knowledge Discovery and Data Mining. WKDD 2009",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pdcat/2010/4287/0/4287a011",
"title": "A Feature-Based Replica Consistency Strategy for Spatial Data in Distributed GIS",
"doi": null,
"abstractUrl": "/proceedings-article/pdcat/2010/4287a011/12OmNBiygBR",
"parentPublication": {
"id": "proceedings/pdcat/2010/4287/0",
"title": "Parallel and Distributed Computing Applications and Technologies, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/grc/2011/0372/0/06122689",
"title": "The data model and structure of power GIS",
"doi": null,
"abstractUrl": "/proceedings-article/grc/2011/06122689/12OmNBp52z8",
"parentPublication": {
"id": "proceedings/grc/2011/0372/0",
"title": "2011 IEEE International Conference on Granular Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cits/2012/1550/0/06220391",
"title": "CAD file conversion to GIS layers: Issues and solutions",
"doi": null,
"abstractUrl": "/proceedings-article/cits/2012/06220391/12OmNrJiCP2",
"parentPublication": {
"id": "proceedings/cits/2012/1550/0",
"title": "2012 International Conference on Computer, Information and Telecommunication Systems (CITS 2012)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/hicss/1996/7324/3/00493251",
"title": "Spatial metadata and GIS for decision support",
"doi": null,
"abstractUrl": "/proceedings-article/hicss/1996/00493251/12OmNx2zjxk",
"parentPublication": {
"id": "proceedings/hicss/1996/7324/3",
"title": "Proceedings of HICSS-29: 29th Hawaii International Conference on System Sciences",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icde/2013/4909/0/06544917",
"title": "Sorting in Space: Multidimensional, spatial, and metric data structures for applications in spatial databases, geographic information systems (GIS), and location-based services",
"doi": null,
"abstractUrl": "/proceedings-article/icde/2013/06544917/12OmNxWcH2K",
"parentPublication": {
"id": "proceedings/icde/2013/4909/0",
"title": "2013 29th IEEE International Conference on Data Engineering (ICDE 2013)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icicic/2008/3161/0/31610115",
"title": "Qualitative Description and Reasoning of Topological Relation in Three-Dimensional GIS",
"doi": null,
"abstractUrl": "/proceedings-article/icicic/2008/31610115/12OmNxuo0go",
"parentPublication": {
"id": "proceedings/icicic/2008/3161/0",
"title": "Innovative Computing ,Information and Control, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iwcfta/2009/3853/0/3853a399",
"title": "Estimation of Undiscovered Hydrocarbon Resources Potential through Fractal Geometry Based on GIS",
"doi": null,
"abstractUrl": "/proceedings-article/iwcfta/2009/3853a399/12OmNyRPgS0",
"parentPublication": {
"id": "proceedings/iwcfta/2009/3853/0",
"title": "Chaos-Fractals Theories and Applications, International Workshop on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/comgeo/2013/5012/0/06602049",
"title": "Asking Spatial Questions to Identify GIS Functionality",
"doi": null,
"abstractUrl": "/proceedings-article/comgeo/2013/06602049/12OmNzxyiJU",
"parentPublication": {
"id": "proceedings/comgeo/2013/5012/0",
"title": "2013 4th International Conference on Computing for Geospatial Research & Application (COM.Geo)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNCwUmAj",
"title": "2008 Second International Symposium on Universal Communication",
"acronym": "isuc",
"groupId": "1002556",
"volume": "0",
"displayVolume": "0",
"year": "2008",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNzaQogY",
"doi": "10.1109/ISUC.2008.79",
"title": "Information Credibility Analysis of Web Contents",
"normalizedTitle": "Information Credibility Analysis of Web Contents",
"abstract": "As computers and computer networks become more sophisticated, a vastamount of information and knowledge has been accumulated and circulatedon the Web.",
"abstracts": [
{
"abstractType": "Regular",
"content": "As computers and computer networks become more sophisticated, a vastamount of information and knowledge has been accumulated and circulatedon the Web.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "As computers and computer networks become more sophisticated, a vastamount of information and knowledge has been accumulated and circulatedon the Web.",
"fno": "3433a146",
"keywords": [
"Information Credibility",
"World Wide Web",
"Natural Language Processing"
],
"authors": [
{
"affiliation": null,
"fullName": "Sadao Kurohashi",
"givenName": "Sadao",
"surname": "Kurohashi",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Susumu Akamine",
"givenName": "Susumu",
"surname": "Akamine",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Daisuke Kawahara",
"givenName": "Daisuke",
"surname": "Kawahara",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Yoshikiyo Kato",
"givenName": "Yoshikiyo",
"surname": "Kato",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Tetsuji Nakagawa",
"givenName": "Tetsuji",
"surname": "Nakagawa",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Kentaro Inui",
"givenName": "Kentaro",
"surname": "Inui",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Yutaka Kidawara",
"givenName": "Yutaka",
"surname": "Kidawara",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "isuc",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2008-12-01T00:00:00",
"pubType": "proceedings",
"pages": "146-153",
"year": "2008",
"issn": null,
"isbn": "978-0-7695-3433-6",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "3433a141",
"articleId": "12OmNxeut3n",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "3433a154",
"articleId": "12OmNwDAClC",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/wisa/2011/4555/0/4555a069",
"title": "Evaluation Method of Information Credibility Based on the Trust Features of Web Page",
"doi": null,
"abstractUrl": "/proceedings-article/wisa/2011/4555a069/12OmNrIJqDk",
"parentPublication": {
"id": "proceedings/wisa/2011/4555/0",
"title": "Web Information Systems and Applications Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/acsac/2003/2041/0/20410034",
"title": "A Stateful Intrusion Detection System for World-Wide Web Servers",
"doi": null,
"abstractUrl": "/proceedings-article/acsac/2003/20410034/12OmNs59K1G",
"parentPublication": {
"id": "proceedings/acsac/2003/2041/0",
"title": "Computer Security Applications Conference, Annual",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wi-iat/2008/3496/1/3496a393",
"title": "Grasping Major Statements and Their Contradictions Toward Information Credibility Analysis of Web Contents",
"doi": null,
"abstractUrl": "/proceedings-article/wi-iat/2008/3496a393/12OmNvA1h3V",
"parentPublication": {
"id": "proceedings/wi-iat/2008/3496/1",
"title": "Web Intelligence and Intelligent Agent Technology, IEEE/WIC/ACM International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icks/2008/3128/0/3128a093",
"title": "NLP Approach to Knowledge Search and Information Credibility Analysis",
"doi": null,
"abstractUrl": "/proceedings-article/icks/2008/3128a093/12OmNwCJOSd",
"parentPublication": {
"id": "proceedings/icks/2008/3128/0",
"title": "2008 International Conference on Informatics Education and Research for Development of Knowledge Society Infrastructure",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icicta/2009/3804/4/3804e338",
"title": "The Power Law of Social and Economic Indexes Based on Languages on the Web",
"doi": null,
"abstractUrl": "/proceedings-article/icicta/2009/3804e338/12OmNx5piOk",
"parentPublication": {
"id": "proceedings/icicta/2009/3804/4",
"title": "Intelligent Computation Technology and Automation, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/t4e/2011/4534/0/4534a291",
"title": "Enhancing Computer Assisted Language Learning via the World Wide Web for English Language Teaching",
"doi": null,
"abstractUrl": "/proceedings-article/t4e/2011/4534a291/12OmNyRxFBE",
"parentPublication": {
"id": "proceedings/t4e/2011/4534/0",
"title": "2011 IEEE International Conference on Technology for Education",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/isuc/2008/3433/0/3433a363",
"title": "Using Appearance Information for Web Information Credibility Analysis",
"doi": null,
"abstractUrl": "/proceedings-article/isuc/2008/3433a363/12OmNzXWZKM",
"parentPublication": {
"id": "proceedings/isuc/2008/3433/0",
"title": "2008 Second International Symposium on Universal Communication",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/ex/2008/03/mex2008030041",
"title": "The Semantic Web: Apotheosis of Annotation, but What Are Its Semantics?",
"doi": null,
"abstractUrl": "/magazine/ex/2008/03/mex2008030041/13rRUIJcWsN",
"parentPublication": {
"id": "mags/ex",
"title": "IEEE Intelligent Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/ex/2008/05/mex2008050016",
"title": "Natural Language Processing and the Web",
"doi": null,
"abstractUrl": "/magazine/ex/2008/05/mex2008050016/13rRUwwJWJx",
"parentPublication": {
"id": "mags/ex",
"title": "IEEE Intelligent Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/ex/2003/01/x1062",
"title": "Personalizing Web Publishing via Information Extraction",
"doi": null,
"abstractUrl": "/magazine/ex/2003/01/x1062/13rRUzp02ki",
"parentPublication": {
"id": "mags/ex",
"title": "IEEE Intelligent Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNqAU6sQ",
"title": "Computer Research and Development, International Conference on",
"acronym": "iccrd",
"groupId": "1800063",
"volume": "0",
"displayVolume": "0",
"year": "2010",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNy50g4n",
"doi": "10.1109/ICCRD.2010.173",
"title": "Mapping and Labeling XML Data for Dynamic Update",
"normalizedTitle": "Mapping and Labeling XML Data for Dynamic Update",
"abstract": "Expeditious growth of XML as a data exchange medium over the web has inspired many researchers to propose efficient and effective mapping and labeling schemes for proficient XML processing. The most crucial aspect that an approach needs to cater is the support for dynamic update. In this paper, we scrutinize and study the existing approaches in terms of the table schema, complexity and support for dynamic update. In addition, we suggest a mapping approach to map XML data into relational database, s-XML based on the persistent labeling scheme.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Expeditious growth of XML as a data exchange medium over the web has inspired many researchers to propose efficient and effective mapping and labeling schemes for proficient XML processing. The most crucial aspect that an approach needs to cater is the support for dynamic update. In this paper, we scrutinize and study the existing approaches in terms of the table schema, complexity and support for dynamic update. In addition, we suggest a mapping approach to map XML data into relational database, s-XML based on the persistent labeling scheme.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Expeditious growth of XML as a data exchange medium over the web has inspired many researchers to propose efficient and effective mapping and labeling schemes for proficient XML processing. The most crucial aspect that an approach needs to cater is the support for dynamic update. In this paper, we scrutinize and study the existing approaches in terms of the table schema, complexity and support for dynamic update. In addition, we suggest a mapping approach to map XML data into relational database, s-XML based on the persistent labeling scheme.",
"fno": "4043a781",
"keywords": [
"XML",
"Numbering Scheme",
"Labeling Scheme",
"Mapping Approach",
"Dynamic Update"
],
"authors": [
{
"affiliation": null,
"fullName": "Samini Subramaniam",
"givenName": "Samini",
"surname": "Subramaniam",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Su-Cheng Haw",
"givenName": "Su-Cheng",
"surname": "Haw",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Poo Kuan Hoong",
"givenName": "Poo Kuan",
"surname": "Hoong",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "iccrd",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2010-05-01T00:00:00",
"pubType": "proceedings",
"pages": "781-786",
"year": "2010",
"issn": null,
"isbn": "978-0-7695-4043-6",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "4043a775",
"articleId": "12OmNxaNGhO",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "4043a787",
"articleId": "12OmNqFa5mg",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/wisa/2010/4193/0/4193a110",
"title": "Incremental Validation of XML Document Based on Simplified XML Element Sequence Pattern",
"doi": null,
"abstractUrl": "/proceedings-article/wisa/2010/4193a110/12OmNBqdrfX",
"parentPublication": {
"id": "proceedings/wisa/2010/4193/0",
"title": "Web Information Systems and Applications Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icde/2005/2285/0/22850285",
"title": "BOXes: Efficient Maintenance of Order-Based Labeling for Dynamic XML Data",
"doi": null,
"abstractUrl": "/proceedings-article/icde/2005/22850285/12OmNx9nGEx",
"parentPublication": {
"id": "proceedings/icde/2005/2285/0",
"title": "21st International Conference on Data Engineering (ICDE'05)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wi/2006/2747/0/274700498",
"title": "A Persistent Labeling Scheme for Dynamic Ordered XML Trees",
"doi": null,
"abstractUrl": "/proceedings-article/wi/2006/274700498/12OmNy6HQVY",
"parentPublication": {
"id": "proceedings/wi/2006/2747/0",
"title": "2006 IEEE/WIC/ACM International Conference on Web Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cit/2010/4108/0/4108b639",
"title": "Group-Based Prime Number Labeling Scheme for XML Data",
"doi": null,
"abstractUrl": "/proceedings-article/cit/2010/4108b639/12OmNyKrHnG",
"parentPublication": {
"id": "proceedings/cit/2010/4108/0",
"title": "Computer and Information Technology, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cit/2009/3836/1/3836a318",
"title": "A New Labeling Scheme without Re-labeling Using Circular Concepts for Dynamic XML Data",
"doi": null,
"abstractUrl": "/proceedings-article/cit/2009/3836a318/12OmNyqzLVV",
"parentPublication": {
"id": "proceedings/cit/2009/3836/1",
"title": "2009 Ninth IEEE International Conference on Computer and Information Technology. CIT 2009",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/csse/2008/3336/4/3336g704",
"title": "An Efficient Numbering Scheme for Dynamic XML Trees",
"doi": null,
"abstractUrl": "/proceedings-article/csse/2008/3336g704/12OmNzBOhTO",
"parentPublication": {
"id": "csse/2008/3336/4",
"title": "Computer Science and Software Engineering, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/csse/2008/3336/4/3336g692",
"title": "XSIU: An XML-Based Structure Incremental Update Algorithm in Mobile Database",
"doi": null,
"abstractUrl": "/proceedings-article/csse/2008/3336g692/12OmNzYwceO",
"parentPublication": {
"id": "csse/2008/3336/4",
"title": "Computer Science and Software Engineering, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/gpc-workshops/2008/3177/0/3177a329",
"title": "Access Control and Labeling Scheme for Dynamic XML Data",
"doi": null,
"abstractUrl": "/proceedings-article/gpc-workshops/2008/3177a329/12OmNzcPAvS",
"parentPublication": {
"id": "proceedings/gpc-workshops/2008/3177/0",
"title": "GPC Workshops - 2008 3rd International Conference on Grid and Pervasive Computing Workshops",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2012/01/ttk2012010100",
"title": "Labeling Dynamic XML Documents: An Order-Centric Approach",
"doi": null,
"abstractUrl": "/journal/tk/2012/01/ttk2012010100/13rRUwdrdSP",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2010/04/ttk2010040602",
"title": "A Binary String Approach for Updates in Dynamic Ordered XML Data",
"doi": null,
"abstractUrl": "/journal/tk/2010/04/ttk2010040602/13rRUwfZC0y",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNzIUg07",
"title": "Third International Conference on Natural Computation (ICNC 2007)",
"acronym": "icnc",
"groupId": "1001312",
"volume": "2",
"displayVolume": "2",
"year": "2007",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNB8CiXz",
"doi": "10.1109/ICNC.2007.733",
"title": "The Prediction of RNA Secondary Structure Using Multiple Unaligned Sequences",
"normalizedTitle": "The Prediction of RNA Secondary Structure Using Multiple Unaligned Sequences",
"abstract": "Comparative analysis of homologous sequences has been used to predict RNA secondary structure. However, most of existing comparative approaches are vulnerable to alignment errors and thus are not quite suitable for practical application. Here we devise a new method for predicting RNA secondary structure using multiple unaligned sequences. Our method completes the prediction in four major steps: 1) to detect all possible stems in each sequence using the so-called position matrix which indicates paired or unpaired information for each position in the sequence; 2) to find conserved stems across all sequences by multiplying the position matrices; 3) to assess the conserved stems and select some of them as the constraint for RNA folding; 4) to perform final structure prediction using RNAalifold, which is a popular program for secondary structure prediction. We tested our method on data sets composed of RNA sequences with known secondary structures. Our method has average accuracy 73.21% for two-sequence tests, 74.18% for three-sequence tests, and 79.75% for four-sequence tests. The results show that our method can predict RNA secondary structure with a higher accuracy than RNAalifold.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Comparative analysis of homologous sequences has been used to predict RNA secondary structure. However, most of existing comparative approaches are vulnerable to alignment errors and thus are not quite suitable for practical application. Here we devise a new method for predicting RNA secondary structure using multiple unaligned sequences. Our method completes the prediction in four major steps: 1) to detect all possible stems in each sequence using the so-called position matrix which indicates paired or unpaired information for each position in the sequence; 2) to find conserved stems across all sequences by multiplying the position matrices; 3) to assess the conserved stems and select some of them as the constraint for RNA folding; 4) to perform final structure prediction using RNAalifold, which is a popular program for secondary structure prediction. We tested our method on data sets composed of RNA sequences with known secondary structures. Our method has average accuracy 73.21% for two-sequence tests, 74.18% for three-sequence tests, and 79.75% for four-sequence tests. The results show that our method can predict RNA secondary structure with a higher accuracy than RNAalifold.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Comparative analysis of homologous sequences has been used to predict RNA secondary structure. However, most of existing comparative approaches are vulnerable to alignment errors and thus are not quite suitable for practical application. Here we devise a new method for predicting RNA secondary structure using multiple unaligned sequences. Our method completes the prediction in four major steps: 1) to detect all possible stems in each sequence using the so-called position matrix which indicates paired or unpaired information for each position in the sequence; 2) to find conserved stems across all sequences by multiplying the position matrices; 3) to assess the conserved stems and select some of them as the constraint for RNA folding; 4) to perform final structure prediction using RNAalifold, which is a popular program for secondary structure prediction. We tested our method on data sets composed of RNA sequences with known secondary structures. Our method has average accuracy 73.21% for two-sequence tests, 74.18% for three-sequence tests, and 79.75% for four-sequence tests. The results show that our method can predict RNA secondary structure with a higher accuracy than RNAalifold.",
"fno": "28750367",
"keywords": [],
"authors": [
{
"affiliation": "National University of Defense Technology, China",
"fullName": "Xiaoyong Fang",
"givenName": "Xiaoyong",
"surname": "Fang",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "National University of Defense Technology, China",
"fullName": "Zhigang Luo",
"givenName": "Zhigang",
"surname": "Luo",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Ohio State University, USA",
"fullName": "Bo Yuan",
"givenName": "Bo",
"surname": "Yuan",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "icnc",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2007-09-01T00:00:00",
"pubType": "proceedings",
"pages": "367-374",
"year": "2007",
"issn": null,
"isbn": "0-7695-2875-9",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "28750363",
"articleId": "12OmNwM6A47",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "28750375",
"articleId": "12OmNCd2rzB",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/bibe/2013/3163/0/06701532",
"title": "Modified free energy model to improve RNA secondary structure prediction with pseudoknots",
"doi": null,
"abstractUrl": "/proceedings-article/bibe/2013/06701532/12OmNAqU4X5",
"parentPublication": {
"id": "proceedings/bibe/2013/3163/0",
"title": "2013 IEEE 13th International Conference on Bioinformatics and Bioengineering (BIBE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bibe/2006/2727/0/27270149",
"title": "Simplicity in RNA Secondary Structure Alignment: Towards biologically plausible alignments",
"doi": null,
"abstractUrl": "/proceedings-article/bibe/2006/27270149/12OmNAqkSDE",
"parentPublication": {
"id": "proceedings/bibe/2006/2727/0",
"title": "2006 IEEE Symposium on Bioinformatics and Bioengineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ipdpsw/2013/4979/0/4979a520",
"title": "Secondary Structure Predictions for Long RNA Sequences Based on Inversion Excursions and MapReduce",
"doi": null,
"abstractUrl": "/proceedings-article/ipdpsw/2013/4979a520/12OmNqIhFRB",
"parentPublication": {
"id": "proceedings/ipdpsw/2013/4979/0",
"title": "2013 IEEE International Symposium on Parallel & Distributed Processing, Workshops and Phd Forum (IPDPSW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cis/2011/4584/0/4584a110",
"title": "New Heuristic Algorithm of RNA Secondary Structure Prediction with Pseudoknots",
"doi": null,
"abstractUrl": "/proceedings-article/cis/2011/4584a110/12OmNqJZgEI",
"parentPublication": {
"id": "proceedings/cis/2011/4584/0",
"title": "2011 Seventh International Conference on Computational Intelligence and Security",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/coginf/2010/8042/0/05599703",
"title": "Predicting RNA secondary structure with Tabu Search",
"doi": null,
"abstractUrl": "/proceedings-article/coginf/2010/05599703/12OmNvjQ8YW",
"parentPublication": {
"id": "proceedings/coginf/2010/8042/0",
"title": "2010 9th IEEE International Conference on Cognitive Informatics (ICCI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bibe/2007/1509/0/04375580",
"title": "Detecting and Assessing Conserved Stems for Accurate Structural Alignment of RNA Sequences",
"doi": null,
"abstractUrl": "/proceedings-article/bibe/2007/04375580/12OmNySosHL",
"parentPublication": {
"id": "proceedings/bibe/2007/1509/0",
"title": "7th IEEE International Conference on Bioinformatics and Bioengineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ictai/2003/2038/0/20380010",
"title": "Predicting Conserved Hairpin Motifs in Unaligned RNA Sequences",
"doi": null,
"abstractUrl": "/proceedings-article/ictai/2003/20380010/12OmNyp9Mms",
"parentPublication": {
"id": "proceedings/ictai/2003/2038/0",
"title": "Proceedings. 15th IEEE International Conference on Tools with Artificial Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/2013/01/ttb2013010002",
"title": "RNA Secondary Structure Prediction Using Soft Computing",
"doi": null,
"abstractUrl": "/journal/tb/2013/01/ttb2013010002/13rRUzp02mN",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/5555/01/10058976",
"title": "StemP: A fast and deterministic Stem-graph approach for RNA secondary structure prediction",
"doi": null,
"abstractUrl": "/journal/tb/5555/01/10058976/1LiKHPXjzRC",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNvStcUj",
"title": "Soft Computing and Pattern Recognition, International Conference of",
"acronym": "socpar",
"groupId": "1003023",
"volume": "0",
"displayVolume": "0",
"year": "2009",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNBRbkoy",
"doi": "10.1109/SoCPaR.2009.102",
"title": "The Effect of Using Different Thermodynamic Models with Harmony Search Algorithm in the Accuracy of RNA Secondary Structure Prediction",
"normalizedTitle": "The Effect of Using Different Thermodynamic Models with Harmony Search Algorithm in the Accuracy of RNA Secondary Structure Prediction",
"abstract": "Ribonucleic acid (RNA) is a nucleic acid composed of a group of the nucleotides. RNA molecule is essential to all biological systems. The RNA strand folds back into itself during the folding process via hydrogen bonds to build the secondary and tertiary structures. Understanding the biological function of a given RNA molecule is critical to determining its structure. Since the structure of RNA molecules is a key to their function, algorithms for the prediction of RNA structure are promising. This paper discusses the effect of applying different thermodynamic models to HSRNAFold an RNA secondary structure prediction algorithm based on Harmony search (HS). The experiments were performed on twelve individual known structures from four RNA classes (5S rRNA, Group I intron 23S rRNA, Group I intron 16S rRNA and 16S rRNA). The data demonstrate that the results obtained via RNAeval are better than those of enf2 in terms of prediction accuracy. In addition, the time needed by RNAeval is less than the time needed by enf2 for the same number of iterations.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Ribonucleic acid (RNA) is a nucleic acid composed of a group of the nucleotides. RNA molecule is essential to all biological systems. The RNA strand folds back into itself during the folding process via hydrogen bonds to build the secondary and tertiary structures. Understanding the biological function of a given RNA molecule is critical to determining its structure. Since the structure of RNA molecules is a key to their function, algorithms for the prediction of RNA structure are promising. This paper discusses the effect of applying different thermodynamic models to HSRNAFold an RNA secondary structure prediction algorithm based on Harmony search (HS). The experiments were performed on twelve individual known structures from four RNA classes (5S rRNA, Group I intron 23S rRNA, Group I intron 16S rRNA and 16S rRNA). The data demonstrate that the results obtained via RNAeval are better than those of enf2 in terms of prediction accuracy. In addition, the time needed by RNAeval is less than the time needed by enf2 for the same number of iterations.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Ribonucleic acid (RNA) is a nucleic acid composed of a group of the nucleotides. RNA molecule is essential to all biological systems. The RNA strand folds back into itself during the folding process via hydrogen bonds to build the secondary and tertiary structures. Understanding the biological function of a given RNA molecule is critical to determining its structure. Since the structure of RNA molecules is a key to their function, algorithms for the prediction of RNA structure are promising. This paper discusses the effect of applying different thermodynamic models to HSRNAFold an RNA secondary structure prediction algorithm based on Harmony search (HS). The experiments were performed on twelve individual known structures from four RNA classes (5S rRNA, Group I intron 23S rRNA, Group I intron 16S rRNA and 16S rRNA). The data demonstrate that the results obtained via RNAeval are better than those of enf2 in terms of prediction accuracy. In addition, the time needed by RNAeval is less than the time needed by enf2 for the same number of iterations.",
"fno": "3879a505",
"keywords": [
"Meta Heuristic Algorithms",
"Dynamic Programming Algorithms",
"RNA Folding",
"Minimum Free Energy"
],
"authors": [
{
"affiliation": null,
"fullName": "Abdulqader M. Mohsen",
"givenName": "Abdulqader M.",
"surname": "Mohsen",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Ahamad Tajudin Khader",
"givenName": "Ahamad Tajudin",
"surname": "Khader",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Abdullatif Ghallab",
"givenName": "Abdullatif",
"surname": "Ghallab",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "socpar",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2009-12-01T00:00:00",
"pubType": "proceedings",
"pages": "505-510",
"year": "2009",
"issn": null,
"isbn": "978-0-7695-3879-2",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "3879a490",
"articleId": "12OmNzdoMRs",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "3879a511",
"articleId": "12OmNxFJXB8",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/bibe/2006/2727/0/27270149",
"title": "Simplicity in RNA Secondary Structure Alignment: Towards biologically plausible alignments",
"doi": null,
"abstractUrl": "/proceedings-article/bibe/2006/27270149/12OmNAqkSDE",
"parentPublication": {
"id": "proceedings/bibe/2006/2727/0",
"title": "2006 IEEE Symposium on Bioinformatics and Bioengineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ijcbs/2009/3739/0/3739a167",
"title": "On the Design of RNA Sequences for Realizing Extended Shapes",
"doi": null,
"abstractUrl": "/proceedings-article/ijcbs/2009/3739a167/12OmNwlHT0J",
"parentPublication": {
"id": "proceedings/ijcbs/2009/3739/0",
"title": "2009 International Joint Conference on Bioinformatics, Systems Biology and Intelligent Computing (IJCBS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccabs/2014/5786/0/06863943",
"title": "An SVM-based approach for discovering splicing junctions with RNA-Seq",
"doi": null,
"abstractUrl": "/proceedings-article/iccabs/2014/06863943/12OmNyQGRVT",
"parentPublication": {
"id": "proceedings/iccabs/2014/5786/0",
"title": "2014 IEEE 4th International Conference on Computational Advances in Bio and Medical Sciences (ICCABS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bibm/2014/5669/0/06999394",
"title": "Template-based prediction of ribosomal RNA secondary structure",
"doi": null,
"abstractUrl": "/proceedings-article/bibm/2014/06999394/12OmNzd7bOd",
"parentPublication": {
"id": "proceedings/bibm/2014/5669/0",
"title": "2014 IEEE International Conference on Bioinformatics and Biomedicine (BIBM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/2011/06/ttb2011061468",
"title": "Analysis of the Free Energy in a Stochastic RNA Secondary Structure Model",
"doi": null,
"abstractUrl": "/journal/tb/2011/06/ttb2011061468/13rRUwghd7I",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/2012/01/ttb2012010001",
"title": "A Memory Efficient Method for Structure-Based RNA Multiple Alignment",
"doi": null,
"abstractUrl": "/journal/tb/2012/01/ttb2012010001/13rRUwvT9f7",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/2010/04/ttb2010040727",
"title": "SARNA-Predict: Accuracy Improvement of RNA Secondary Structure Prediction Using Permutation-Based Simulated Annealing",
"doi": null,
"abstractUrl": "/journal/tb/2010/04/ttb2010040727/13rRUxASuz4",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/2013/01/ttb2013010002",
"title": "RNA Secondary Structure Prediction Using Soft Computing",
"doi": null,
"abstractUrl": "/journal/tb/2013/01/ttb2013010002/13rRUzp02mN",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2006/2602/0/01648249",
"title": "From Visualization to Manipulation of RNA Secondary and Tertiary Structures",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2006/01648249/1iES6r80Yec",
"parentPublication": {
"id": "proceedings/iv/2006/2602/0",
"title": "Tenth International Conference on Information Visualisation (IV'06)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNqBtiE9",
"title": "Computer Modeling and Simulation, UKSIM European Symposium on",
"acronym": "ems",
"groupId": "1002447",
"volume": "0",
"displayVolume": "0",
"year": "2011",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNwDACtF",
"doi": "10.1109/EMS.2011.14",
"title": "Fitness Landscape Analysis of a Simulation Optimisation Problems with HeuristicLab",
"normalizedTitle": "Fitness Landscape Analysis of a Simulation Optimisation Problems with HeuristicLab",
"abstract": "In this paper the fitness landscape of a simulation optimisation problem is analysed within the metaheuristic optimisation framework Heuristic Lab. Computational experiments are performed within an application prototype of a link between the model of a vehicle scheduling problem and the optimisation framework. Modern fitness landscape analysis approaches implemented in the Heuristic Lab framework are applied and described. New insights are gained in the field of fitness landscapes analysis for stochastic problems. Application of fitness landscape analysis in simulation optimisation for meta-optimisation purposes is also considered in this paper. Comprehensive fitness landscape analysis of different instances of one type of optimisation problem and its results in comparison with results of optimisation experiments allows determining the impact of different landscape structures on the behaviour of different metaheuristic optimisation algorithms.",
"abstracts": [
{
"abstractType": "Regular",
"content": "In this paper the fitness landscape of a simulation optimisation problem is analysed within the metaheuristic optimisation framework Heuristic Lab. Computational experiments are performed within an application prototype of a link between the model of a vehicle scheduling problem and the optimisation framework. Modern fitness landscape analysis approaches implemented in the Heuristic Lab framework are applied and described. New insights are gained in the field of fitness landscapes analysis for stochastic problems. Application of fitness landscape analysis in simulation optimisation for meta-optimisation purposes is also considered in this paper. Comprehensive fitness landscape analysis of different instances of one type of optimisation problem and its results in comparison with results of optimisation experiments allows determining the impact of different landscape structures on the behaviour of different metaheuristic optimisation algorithms.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "In this paper the fitness landscape of a simulation optimisation problem is analysed within the metaheuristic optimisation framework Heuristic Lab. Computational experiments are performed within an application prototype of a link between the model of a vehicle scheduling problem and the optimisation framework. Modern fitness landscape analysis approaches implemented in the Heuristic Lab framework are applied and described. New insights are gained in the field of fitness landscapes analysis for stochastic problems. Application of fitness landscape analysis in simulation optimisation for meta-optimisation purposes is also considered in this paper. Comprehensive fitness landscape analysis of different instances of one type of optimisation problem and its results in comparison with results of optimisation experiments allows determining the impact of different landscape structures on the behaviour of different metaheuristic optimisation algorithms.",
"fno": "4619a107",
"keywords": [
"Simulation Optimisation",
"Fitness Landscape Analysis",
"Vehicle Scheduling",
"Optimisation Framework",
"Metaheuristics"
],
"authors": [
{
"affiliation": null,
"fullName": "Vitaly Bolshakov",
"givenName": "Vitaly",
"surname": "Bolshakov",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Erik Pitzer",
"givenName": "Erik",
"surname": "Pitzer",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Michael Affenzeller",
"givenName": "Michael",
"surname": "Affenzeller",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "ems",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2011-11-01T00:00:00",
"pubType": "proceedings",
"pages": "107-112",
"year": "2011",
"issn": null,
"isbn": "978-0-7695-4619-3",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "4619a102",
"articleId": "12OmNyfvpRx",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "4619a113",
"articleId": "12OmNrnJ6Kr",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/iceccs/2015/8581/0/8581a011",
"title": "Fitness Landscape Characterisation for Constrained Software Architecture Optimisation Problems",
"doi": null,
"abstractUrl": "/proceedings-article/iceccs/2015/8581a011/12OmNBNM96s",
"parentPublication": {
"id": "proceedings/iceccs/2015/8581/0",
"title": "2015 20th International Conference on Engineering of Complex Computer Systems (ICECCS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/eh/2003/1977/0/19770013",
"title": "Fitness Landscape and Evolutionary Boolean Synthesis using Information",
"doi": null,
"abstractUrl": "/proceedings-article/eh/2003/19770013/12OmNBiygzW",
"parentPublication": {
"id": "proceedings/eh/2003/1977/0",
"title": "Evolvable Hardware, NASA/DoD Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icccs/2009/3906/0/3906a119",
"title": "Polynomial Fitness Simulation of Chinese New Stockholders",
"doi": null,
"abstractUrl": "/proceedings-article/icccs/2009/3906a119/12OmNBqv2oc",
"parentPublication": {
"id": "proceedings/icccs/2009/3906/0",
"title": "2009 International Conference on Computer and Communications Security",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/synasc/2008/3523/0/3523a201",
"title": "A Comparative Landscape Analysis of Fitness Functions for Search-Based Testing",
"doi": null,
"abstractUrl": "/proceedings-article/synasc/2008/3523a201/12OmNvEQsfZ",
"parentPublication": {
"id": "proceedings/synasc/2008/3523/0",
"title": "2008 10th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cssim/2009/3795/0/3795a054",
"title": "A Review on Techniques Applied to Modelling, Simulating and Visualising Evolution of Physical Landscape",
"doi": null,
"abstractUrl": "/proceedings-article/cssim/2009/3795a054/12OmNwIYZCo",
"parentPublication": {
"id": "proceedings/cssim/2009/3795/0",
"title": "Computational Intelligence, Modelling and Simulation, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icstw/2008/3388/0/33880210",
"title": "Search-based Testing using State-based Fitness",
"doi": null,
"abstractUrl": "/proceedings-article/icstw/2008/33880210/12OmNwoPtp3",
"parentPublication": {
"id": "proceedings/icstw/2008/3388/0",
"title": "Software Testing Verification and Validation Workshop, IEEE International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ictai/1997/8203/0/82030357",
"title": "GA Performance in a Babel-like Fitness Landscape",
"doi": null,
"abstractUrl": "/proceedings-article/ictai/1997/82030357/12OmNxVDuMs",
"parentPublication": {
"id": "proceedings/ictai/1997/8203/0",
"title": "Proceedings Ninth IEEE International Conference on Tools with Artificial Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ems/2010/4308/0/4308a096",
"title": "Comparative Analysis of Statistical and Information Measures for Benchmark Fitness Landscapes",
"doi": null,
"abstractUrl": "/proceedings-article/ems/2010/4308a096/12OmNyNQSM4",
"parentPublication": {
"id": "proceedings/ems/2010/4308/0",
"title": "Computer Modeling and Simulation, UKSIM European Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/eh/2003/1977/0/19770164",
"title": "Fitness Estimations for Evolutionary Antenna Design",
"doi": null,
"abstractUrl": "/proceedings-article/eh/2003/19770164/12OmNz5s0JH",
"parentPublication": {
"id": "proceedings/eh/2003/1977/0",
"title": "Evolvable Hardware, NASA/DoD Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/isms/2010/3973/0/3973a134",
"title": "Simulation-Based Vehicle Scheduling with Time Windows",
"doi": null,
"abstractUrl": "/proceedings-article/isms/2010/3973a134/12OmNzwZ6zR",
"parentPublication": {
"id": "proceedings/isms/2010/3973/0",
"title": "Intelligent Systems, Modelling and Simulation, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNzYwc36",
"title": "2009 International Joint Conference on Bioinformatics, Systems Biology and Intelligent Computing (IJCBS)",
"acronym": "ijcbs",
"groupId": "1002888",
"volume": "0",
"displayVolume": "0",
"year": "2009",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNwlHT0J",
"doi": "10.1109/IJCBS.2009.73",
"title": "On the Design of RNA Sequences for Realizing Extended Shapes",
"normalizedTitle": "On the Design of RNA Sequences for Realizing Extended Shapes",
"abstract": "It is known that for two given secondary structures (defined by position of base pairings) an RNA string can easily be found that can fold into both structures. But for more than two secondary structures this is not necessarily possible. Moreover, when four or more secondary structures are given the problem to determine the least number of positions, such that after the removal of all incident base pairs, a compatible RNA sequence can be found, is known to be NP-complete (\\cite{real_shapes}). In this paper we introduce pseudo edges that are used to forbid that certain base pairs can bind and therefore can be used to define the properties of possible RNA secondary structures. We study the complexity of the problem to design an RNA sequence that can fold into different secondary structures each of them is described by a set of required and forbidden base pairs. We refine the NP-completeness results of \\cite{real_shapes} and show an analoguous NP-completeness result for the realization problem concerning the removal of (pseudo) edges. We also present a polynomial time method for checking the realizability of extended shape graphs. Furthermore, we empirically analyze the influence of pseudo edges on the realizability for sets of random RNA sequences and for sets of aptamers.",
"abstracts": [
{
"abstractType": "Regular",
"content": "It is known that for two given secondary structures (defined by position of base pairings) an RNA string can easily be found that can fold into both structures. But for more than two secondary structures this is not necessarily possible. Moreover, when four or more secondary structures are given the problem to determine the least number of positions, such that after the removal of all incident base pairs, a compatible RNA sequence can be found, is known to be NP-complete (\\cite{real_shapes}). In this paper we introduce pseudo edges that are used to forbid that certain base pairs can bind and therefore can be used to define the properties of possible RNA secondary structures. We study the complexity of the problem to design an RNA sequence that can fold into different secondary structures each of them is described by a set of required and forbidden base pairs. We refine the NP-completeness results of \\cite{real_shapes} and show an analoguous NP-completeness result for the realization problem concerning the removal of (pseudo) edges. We also present a polynomial time method for checking the realizability of extended shape graphs. Furthermore, we empirically analyze the influence of pseudo edges on the realizability for sets of random RNA sequences and for sets of aptamers.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "It is known that for two given secondary structures (defined by position of base pairings) an RNA string can easily be found that can fold into both structures. But for more than two secondary structures this is not necessarily possible. Moreover, when four or more secondary structures are given the problem to determine the least number of positions, such that after the removal of all incident base pairs, a compatible RNA sequence can be found, is known to be NP-complete (\\cite{real_shapes}). In this paper we introduce pseudo edges that are used to forbid that certain base pairs can bind and therefore can be used to define the properties of possible RNA secondary structures. We study the complexity of the problem to design an RNA sequence that can fold into different secondary structures each of them is described by a set of required and forbidden base pairs. We refine the NP-completeness results of \\cite{real_shapes} and show an analoguous NP-completeness result for the realization problem concerning the removal of (pseudo) edges. We also present a polynomial time method for checking the realizability of extended shape graphs. Furthermore, we empirically analyze the influence of pseudo edges on the realizability for sets of random RNA sequences and for sets of aptamers.",
"fno": "3739a167",
"keywords": [
"RNA Folding",
"RNA Design",
"NP Completeness",
"Secondary Structure",
"Aptamer"
],
"authors": [
{
"affiliation": null,
"fullName": "Marc Hellmuth",
"givenName": "Marc",
"surname": "Hellmuth",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Daniel Merkle",
"givenName": "Daniel",
"surname": "Merkle",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Martin Middendorf",
"givenName": "Martin",
"surname": "Middendorf",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "ijcbs",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2009-08-01T00:00:00",
"pubType": "proceedings",
"pages": "167-173",
"year": "2009",
"issn": null,
"isbn": "978-0-7695-3739-9",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "3739a160",
"articleId": "12OmNyk2ZZn",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "3739a174",
"articleId": "12OmNvDI3Y1",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/socpar/2009/3879/0/3879a505",
"title": "The Effect of Using Different Thermodynamic Models with Harmony Search Algorithm in the Accuracy of RNA Secondary Structure Prediction",
"doi": null,
"abstractUrl": "/proceedings-article/socpar/2009/3879a505/12OmNBRbkoy",
"parentPublication": {
"id": "proceedings/socpar/2009/3879/0",
"title": "Soft Computing and Pattern Recognition, International Conference of",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bibe/2009/3656/0/3656a184",
"title": "Asymptotics of Canonical RNA Secondary Structures",
"doi": null,
"abstractUrl": "/proceedings-article/bibe/2009/3656a184/12OmNBpmDBa",
"parentPublication": {
"id": "proceedings/bibe/2009/3656/0",
"title": "2009 Ninth IEEE International Conference on Bioinformatics and Bioengineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ijcbs/2009/3739/0/3739a109",
"title": "A Classification System for Predicting RNA Hairpin Loops",
"doi": null,
"abstractUrl": "/proceedings-article/ijcbs/2009/3739a109/12OmNCcKQii",
"parentPublication": {
"id": "proceedings/ijcbs/2009/3739/0",
"title": "2009 International Joint Conference on Bioinformatics, Systems Biology and Intelligent Computing (IJCBS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccabs/2011/4851/0/135",
"title": "A grammar-based approach to RNA pseudoknotted structure prediction for aligned sequences",
"doi": null,
"abstractUrl": "/proceedings-article/iccabs/2011/135/12OmNvSKNMv",
"parentPublication": {
"id": "proceedings/iccabs/2011/4851/0",
"title": "2011 IEEE 1st International Conference on Computational Advances in Bio and Medical Sciences (ICCABS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccabs/2011/4851/0/123",
"title": "Maximum expected accurate structural neighbors of an RNA secondary structure",
"doi": null,
"abstractUrl": "/proceedings-article/iccabs/2011/123/12OmNyGtjog",
"parentPublication": {
"id": "proceedings/iccabs/2011/4851/0",
"title": "2011 IEEE 1st International Conference on Computational Advances in Bio and Medical Sciences (ICCABS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/2004/02/n0066",
"title": "Prediction of Consensus RNA Secondary Structures Including Pseudoknots",
"doi": null,
"abstractUrl": "/journal/tb/2004/02/n0066/13rRUEgs2Kc",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/2010/02/ttb2010020323",
"title": "Approximation Algorithms for Predicting RNA Secondary Structures with Arbitrary Pseudoknots",
"doi": null,
"abstractUrl": "/journal/tb/2010/02/ttb2010020323/13rRUIJcWvl",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/2008/01/ttb2008010025",
"title": "RnaPredict—An Evolutionary Algorithm for RNA Secondary Structure Prediction",
"doi": null,
"abstractUrl": "/journal/tb/2008/01/ttb2008010025/13rRUwInvwA",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/hpcasia/2005/2486/0/01592335",
"title": "Towards a weighted-tree similarity algorithm for RNA secondary structure comparison",
"doi": null,
"abstractUrl": "/proceedings-article/hpcasia/2005/01592335/1iERxb58HEQ",
"parentPublication": {
"id": "proceedings/hpcasia/2005/2486/0",
"title": "Proceedings. Eighth International Conference on High-Performance Computing in Asia-Pacific Region",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNxuXcDx",
"title": "Visual Languages, IEEE Symposium on",
"acronym": "vl",
"groupId": "1000793",
"volume": "0",
"displayVolume": "0",
"year": "1998",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNxXUhMp",
"doi": "10.1109/VL.1998.706154",
"title": "Fluid Visualization of Spreadsheet Structures",
"normalizedTitle": "Fluid Visualization of Spreadsheet Structures",
"abstract": "Spreadsheets augment a visible tabular layout with invisible formulas. Direct manipulations of the tabular layout may or may not result in the desired changes to the formulas. The user is forced to explore the individual cells to find, verify, and modify the formulas, which causes heavy cognitive overhead. We present a set of techniques that make these formulas and their resulting dataflow structure easily accessible while maintaining the natural appearance of the spreadsheet. Transient local views visualize dataflow structures associated with individual cells, while static global views and animated global explanations visually present the entire dataflow structure at once. Semantic navigation enables the user to navigate through the dataflow structure interactively, and visual editing techniques make it possible to construct formulas using graphical editing techniques. Central to these techniques is the use of animation and lightweight interaction for rapid and non-intrusive visualization. Our prototype implementation suggests that these techniques can greatly improve the expressive power of current spreadsheets as well as other applications that have rich underlying structures.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Spreadsheets augment a visible tabular layout with invisible formulas. Direct manipulations of the tabular layout may or may not result in the desired changes to the formulas. The user is forced to explore the individual cells to find, verify, and modify the formulas, which causes heavy cognitive overhead. We present a set of techniques that make these formulas and their resulting dataflow structure easily accessible while maintaining the natural appearance of the spreadsheet. Transient local views visualize dataflow structures associated with individual cells, while static global views and animated global explanations visually present the entire dataflow structure at once. Semantic navigation enables the user to navigate through the dataflow structure interactively, and visual editing techniques make it possible to construct formulas using graphical editing techniques. Central to these techniques is the use of animation and lightweight interaction for rapid and non-intrusive visualization. Our prototype implementation suggests that these techniques can greatly improve the expressive power of current spreadsheets as well as other applications that have rich underlying structures.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Spreadsheets augment a visible tabular layout with invisible formulas. Direct manipulations of the tabular layout may or may not result in the desired changes to the formulas. The user is forced to explore the individual cells to find, verify, and modify the formulas, which causes heavy cognitive overhead. We present a set of techniques that make these formulas and their resulting dataflow structure easily accessible while maintaining the natural appearance of the spreadsheet. Transient local views visualize dataflow structures associated with individual cells, while static global views and animated global explanations visually present the entire dataflow structure at once. Semantic navigation enables the user to navigate through the dataflow structure interactively, and visual editing techniques make it possible to construct formulas using graphical editing techniques. Central to these techniques is the use of animation and lightweight interaction for rapid and non-intrusive visualization. Our prototype implementation suggests that these techniques can greatly improve the expressive power of current spreadsheets as well as other applications that have rich underlying structures.",
"fno": "87120118",
"keywords": [
"Information Visualization",
"Spreadsheet",
"Animation",
"Dataflow Graph",
"Fluid User Interfaces"
],
"authors": [
{
"affiliation": "University of Tokyo",
"fullName": "Takeo Igarashi",
"givenName": "Takeo",
"surname": "Igarashi",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Xerox PARC",
"fullName": "Jock D. Mackinlay",
"givenName": "Jock D.",
"surname": "Mackinlay",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Xerox PARC",
"fullName": "Bay-Wei Chang",
"givenName": "Bay-Wei",
"surname": "Chang",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Xerox PARC",
"fullName": "Polle T. Zellweger",
"givenName": "Polle T.",
"surname": "Zellweger",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "vl",
"isOpenAccess": false,
"showRecommendedArticles": false,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "1998-09-01T00:00:00",
"pubType": "proceedings",
"pages": "118",
"year": "1998",
"issn": "1049-2615",
"isbn": "0-8186-8712-6",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "87120108",
"articleId": "12OmNrJAeac",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "87120126",
"articleId": "12OmNxvwoLO",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNvjgWMZ",
"title": "2008 12th International Conference Information Visualisation",
"acronym": "iv",
"groupId": "1000370",
"volume": "0",
"displayVolume": "0",
"year": "2008",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNxyDZed",
"doi": "10.1109/IV.2008.107",
"title": "The Complexity of Terrorist Networks",
"normalizedTitle": "The Complexity of Terrorist Networks",
"abstract": "Complexity science affords a number of novel tools for examining terrorism, particularly network analysis and NK-Boolean fitness landscapes. The following paper explores various aspects of terrorist networks which can be illuminated through applications of non-linear dynamical systems modeling to terrorist network structures. Of particular interest are some of the emergent properties of terrorist networks as typified by the 9-11 hijackers network, properties of centrality, hierarchy and distance, as well as ways in which attempts to disrupt the transmission of information through terrorist networks may be expected to produce greater or lesser levels of fitness in those organizations.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Complexity science affords a number of novel tools for examining terrorism, particularly network analysis and NK-Boolean fitness landscapes. The following paper explores various aspects of terrorist networks which can be illuminated through applications of non-linear dynamical systems modeling to terrorist network structures. Of particular interest are some of the emergent properties of terrorist networks as typified by the 9-11 hijackers network, properties of centrality, hierarchy and distance, as well as ways in which attempts to disrupt the transmission of information through terrorist networks may be expected to produce greater or lesser levels of fitness in those organizations.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Complexity science affords a number of novel tools for examining terrorism, particularly network analysis and NK-Boolean fitness landscapes. The following paper explores various aspects of terrorist networks which can be illuminated through applications of non-linear dynamical systems modeling to terrorist network structures. Of particular interest are some of the emergent properties of terrorist networks as typified by the 9-11 hijackers network, properties of centrality, hierarchy and distance, as well as ways in which attempts to disrupt the transmission of information through terrorist networks may be expected to produce greater or lesser levels of fitness in those organizations.",
"fno": "3268a338",
"keywords": [
"Terrorism",
"Dynamic Network Analysis",
"Covert Networks",
"Dynamic Fitness Landscape Modeling"
],
"authors": [
{
"affiliation": null,
"fullName": "Philip V. Fellman",
"givenName": "Philip V.",
"surname": "Fellman",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "iv",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2008-07-01T00:00:00",
"pubType": "proceedings",
"pages": "338-340",
"year": "2008",
"issn": "1550-6037",
"isbn": "978-0-7695-3268-4",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "3268a333",
"articleId": "12OmNwDSdzy",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "3268a341",
"articleId": "12OmNyjLoQa",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/icbk/2017/3120/0/3120a009",
"title": "Analyzing Structure of Terrorist Networks by Using Graph Metrics",
"doi": null,
"abstractUrl": "/proceedings-article/icbk/2017/3120a009/12OmNxEjY93",
"parentPublication": {
"id": "proceedings/icbk/2017/3120/0",
"title": "2017 IEEE International Conference on Big Knowledge (ICBK)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ems/2010/4308/0/4308a096",
"title": "Comparative Analysis of Statistical and Information Measures for Benchmark Fitness Landscapes",
"doi": null,
"abstractUrl": "/proceedings-article/ems/2010/4308a096/12OmNyNQSM4",
"parentPublication": {
"id": "proceedings/ems/2010/4308/0",
"title": "Computer Modeling and Simulation, UKSIM European Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/eisic/2011/4406/0/4406a052",
"title": "Terrorism, Threat and Time: The Mediating Effect of Terrorist Threat on Public Willingness to Forego Civil Liberties",
"doi": null,
"abstractUrl": "/proceedings-article/eisic/2011/4406a052/12OmNyQpgTu",
"parentPublication": {
"id": "proceedings/eisic/2011/4406/0",
"title": "European Intelligence and Security Informatics Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/eisic/2012/4782/0/4782a297",
"title": "Detecting Key Players in Terrorist Networks",
"doi": null,
"abstractUrl": "/proceedings-article/eisic/2012/4782a297/12OmNyyO8Pu",
"parentPublication": {
"id": "proceedings/eisic/2012/4782/0",
"title": "European Intelligence and Security Informatics Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bife/2012/4750/0/4750a476",
"title": "Multi-factor Analysis of Terrorist Activities Based on Social Network",
"doi": null,
"abstractUrl": "/proceedings-article/bife/2012/4750a476/12OmNzcxZ7D",
"parentPublication": {
"id": "proceedings/bife/2012/4750/0",
"title": "2012 Fifth International Conference on Business Intelligence and Financial Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/ex/2015/01/mex2015010053",
"title": "Defeating Terrorist Networks with Game Theory",
"doi": null,
"abstractUrl": "/magazine/ex/2015/01/mex2015010053/13rRUxNW21d",
"parentPublication": {
"id": "mags/ex",
"title": "IEEE Intelligent Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ispa-iucc-bdcloud-socialcom-sustaincom/2018/1141/0/114100b159",
"title": "A Novel Graph Analytic Approach to Monitor Terrorist Networks",
"doi": null,
"abstractUrl": "/proceedings-article/ispa-iucc-bdcloud-socialcom-sustaincom/2018/114100b159/18AuLbjEbLy",
"parentPublication": {
"id": "proceedings/ispa-iucc-bdcloud-socialcom-sustaincom/2018/1141/0",
"title": "2018 IEEE Intl Conf on Parallel & Distributed Processing with Applications, Ubiquitous Computing & Communications, Big Data & Cloud Computing, Social Computing & Networking, Sustainable Computing & Communications (ISPA/IUCC/BDCloud/SocialCom/SustainCom)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ainit/2021/1296/0/129600a033",
"title": "Finding key nodes on terrorist networks through k-shell based on structural hole",
"doi": null,
"abstractUrl": "/proceedings-article/ainit/2021/129600a033/1BzWmp6nJ5e",
"parentPublication": {
"id": "proceedings/ainit/2021/1296/0",
"title": "2021 2nd International Seminar on Artificial Intelligence, Networking and Information Technology (AINIT)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/asonam/2017/4993/0/09069108",
"title": "A Generative Model for the Layers of Terrorist Networks",
"doi": null,
"abstractUrl": "/proceedings-article/asonam/2017/09069108/1j9xRY7nr6E",
"parentPublication": {
"id": "proceedings/asonam/2017/4993/0",
"title": "2017 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/asonam/2017/4993/0/09069153",
"title": "Three is The Answer: Combining Relationships to Analyze Multilayered Terrorist Networks",
"doi": null,
"abstractUrl": "/proceedings-article/asonam/2017/09069153/1j9xVZgE3FC",
"parentPublication": {
"id": "proceedings/asonam/2017/4993/0",
"title": "2017 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNqAU6sN",
"title": "Computer Modeling and Simulation, UKSIM European Symposium on",
"acronym": "ems",
"groupId": "1002447",
"volume": "0",
"displayVolume": "0",
"year": "2010",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNyNQSM4",
"doi": "10.1109/EMS.2010.27",
"title": "Comparative Analysis of Statistical and Information Measures for Benchmark Fitness Landscapes",
"normalizedTitle": "Comparative Analysis of Statistical and Information Measures for Benchmark Fitness Landscapes",
"abstract": "Various techniques of fitness landscape analysis for the determination of optimisation problem hardness for evolutionary algorithms are proposed in the literature. However, a few implementations of these techniques and their application in practice are described nowadays. In this paper fitness landscapes of benchmark fitness functions are analysed. Statistical and information measures of fitness landscapes are briefly described. Measures of both types are calculated and interpreted for this benchmark landscapes. Detailed calculations of performed experiments are provided and analysed in this paper. The obtained results will allow estimating hardness of different potential optimisation problems for application of the evolutionary algorithms. Conclusions about the influence of conditions and parameters of the fitness landscape analysis techniques on the results that could be achieved also are made.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Various techniques of fitness landscape analysis for the determination of optimisation problem hardness for evolutionary algorithms are proposed in the literature. However, a few implementations of these techniques and their application in practice are described nowadays. In this paper fitness landscapes of benchmark fitness functions are analysed. Statistical and information measures of fitness landscapes are briefly described. Measures of both types are calculated and interpreted for this benchmark landscapes. Detailed calculations of performed experiments are provided and analysed in this paper. The obtained results will allow estimating hardness of different potential optimisation problems for application of the evolutionary algorithms. Conclusions about the influence of conditions and parameters of the fitness landscape analysis techniques on the results that could be achieved also are made.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Various techniques of fitness landscape analysis for the determination of optimisation problem hardness for evolutionary algorithms are proposed in the literature. However, a few implementations of these techniques and their application in practice are described nowadays. In this paper fitness landscapes of benchmark fitness functions are analysed. Statistical and information measures of fitness landscapes are briefly described. Measures of both types are calculated and interpreted for this benchmark landscapes. Detailed calculations of performed experiments are provided and analysed in this paper. The obtained results will allow estimating hardness of different potential optimisation problems for application of the evolutionary algorithms. Conclusions about the influence of conditions and parameters of the fitness landscape analysis techniques on the results that could be achieved also are made.",
"fno": "4308a096",
"keywords": [
"Fitness Landscape",
"Fitness Landscape Analysis",
"Information Measures",
"Statistical Measures",
"Genetic Algorithm"
],
"authors": [
{
"affiliation": null,
"fullName": "Galina Merkuryeva",
"givenName": "Galina",
"surname": "Merkuryeva",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Vitalijs Bolshakovs",
"givenName": "Vitalijs",
"surname": "Bolshakovs",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "ems",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2010-11-01T00:00:00",
"pubType": "proceedings",
"pages": "96-101",
"year": "2010",
"issn": null,
"isbn": "978-0-7695-4308-6",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "4308a090",
"articleId": "12OmNrIrPr9",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "4308a102",
"articleId": "12OmNAnuTvi",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/wcci/2002/7282/2/01004439",
"title": "Neutrality and ruggedness in robot landscapes",
"doi": null,
"abstractUrl": "/proceedings-article/wcci/2002/01004439/12OmNC3XhiT",
"parentPublication": {
"id": "proceedings/wcci/2002/7282/2",
"title": "Computational Intelligence, Proceedings of the World on Congress on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wcci/2002/7282/1/01006234",
"title": "A comparison of neutral landscapes - NK, NKp and NKq",
"doi": null,
"abstractUrl": "/proceedings-article/wcci/2002/01006234/12OmNqAU6xs",
"parentPublication": {
"id": "proceedings/wcci/2002/7282/1",
"title": "Computational Intelligence, Proceedings of the World on Congress on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ahs/2008/3166/0/3166a027",
"title": "Fitness Evaluation Expansion to Enhance GA?S Performance in Evolvable Hardware",
"doi": null,
"abstractUrl": "/proceedings-article/ahs/2008/3166a027/12OmNvAiSBM",
"parentPublication": {
"id": "proceedings/ahs/2008/3166/0",
"title": "Adaptive Hardware and Systems, NASA/ESA Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/synasc/2008/3523/0/3523a201",
"title": "A Comparative Landscape Analysis of Fitness Functions for Search-Based Testing",
"doi": null,
"abstractUrl": "/proceedings-article/synasc/2008/3523a201/12OmNvEQsfZ",
"parentPublication": {
"id": "proceedings/synasc/2008/3523/0",
"title": "2008 10th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ems/2011/4619/0/4619a107",
"title": "Fitness Landscape Analysis of a Simulation Optimisation Problems with HeuristicLab",
"doi": null,
"abstractUrl": "/proceedings-article/ems/2011/4619a107/12OmNwDACtF",
"parentPublication": {
"id": "proceedings/ems/2011/4619/0",
"title": "Computer Modeling and Simulation, UKSIM European Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2008/3268/0/3268a338",
"title": "The Complexity of Terrorist Networks",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2008/3268a338/12OmNxyDZed",
"parentPublication": {
"id": "proceedings/iv/2008/3268/0",
"title": "2008 12th International Conference Information Visualisation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/eh/2003/1977/0/19770164",
"title": "Fitness Estimations for Evolutionary Antenna Design",
"doi": null,
"abstractUrl": "/proceedings-article/eh/2003/19770164/12OmNz5s0JH",
"parentPublication": {
"id": "proceedings/eh/2003/1977/0",
"title": "Evolvable Hardware, NASA/DoD Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/isms/2010/3973/0/3973a134",
"title": "Simulation-Based Vehicle Scheduling with Time Windows",
"doi": null,
"abstractUrl": "/proceedings-article/isms/2010/3973a134/12OmNzwZ6zR",
"parentPublication": {
"id": "proceedings/isms/2010/3973/0",
"title": "Intelligent Systems, Modelling and Simulation, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cse-euc/2017/3220/1/08005923",
"title": "A Mixed Strategies Differential Evolution Based on Fitness Landscapes Features",
"doi": null,
"abstractUrl": "/proceedings-article/cse-euc/2017/08005923/17D45Wc1IIK",
"parentPublication": {
"id": "proceedings/cse-euc/2017/3220/1",
"title": "2017 IEEE International Conference on Computational Science and Engineering (CSE) and IEEE International Conference on Embedded and Ubiquitous Computing (EUC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cis/2021/9489/0/948900a006",
"title": "Machine Learning based Fitness Landscape Smoothing for Guiding Evolutionary Optimization",
"doi": null,
"abstractUrl": "/proceedings-article/cis/2021/948900a006/1AUppXvx076",
"parentPublication": {
"id": "proceedings/cis/2021/9489/0",
"title": "2021 17th International Conference on Computational Intelligence and Security (CIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "1i5m1cJ2kG4",
"title": "2019 15th International Conference on Computational Intelligence and Security (CIS)",
"acronym": "cis",
"groupId": "1001517",
"volume": "0",
"displayVolume": "0",
"year": "2019",
"__typename": "ProceedingType"
},
"article": {
"id": "1i5m3JFNgHK",
"doi": "10.1109/CIS.2019.00078",
"title": "The Predicting Algorithm of Barrier Tree in RNA Folding Structure",
"normalizedTitle": "The Predicting Algorithm of Barrier Tree in RNA Folding Structure",
"abstract": "Computing algorithm of RNA Structure is the important in biology data mining. Biostatistics is one method of data mining, It is an NP-hard problem for prediction of RNA folding structure including pseudoknots, we investigate the RNA pseudoknotted structure based on characteristics of the RNA folding structure, and introduce the Basin Hopping Graph as a novel model of RNA folding landscape structures. The paper presented the computing algorithm of barrier tree based on the BHG. the experimental results in Rfam13.0 and PseudoBase indicate that the algorithm is more effective.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Computing algorithm of RNA Structure is the important in biology data mining. Biostatistics is one method of data mining, It is an NP-hard problem for prediction of RNA folding structure including pseudoknots, we investigate the RNA pseudoknotted structure based on characteristics of the RNA folding structure, and introduce the Basin Hopping Graph as a novel model of RNA folding landscape structures. The paper presented the computing algorithm of barrier tree based on the BHG. the experimental results in Rfam13.0 and PseudoBase indicate that the algorithm is more effective.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Computing algorithm of RNA Structure is the important in biology data mining. Biostatistics is one method of data mining, It is an NP-hard problem for prediction of RNA folding structure including pseudoknots, we investigate the RNA pseudoknotted structure based on characteristics of the RNA folding structure, and introduce the Basin Hopping Graph as a novel model of RNA folding landscape structures. The paper presented the computing algorithm of barrier tree based on the BHG. the experimental results in Rfam13.0 and PseudoBase indicate that the algorithm is more effective.",
"fno": "609200a336",
"keywords": [
"Bioinformatics",
"Computational Complexity",
"Data Mining",
"RNA",
"Trees Mathematics",
"Predicting Algorithm",
"Barrier Tree",
"Computing Algorithm",
"RNA Structure",
"Biology Data Mining",
"NP Hard Problem",
"RNA Folding Landscape Structures",
"Pseudoknots",
"Basin Hopping Graph",
"Biostatistics",
"RNA Folding Structure Prediction",
"Pseudo Base",
"Rfam 13 0",
"RNA Pseudoknotted Structure",
"RNA",
"Prediction Algorithms",
"Heuristic Algorithms",
"Vegetation",
"Time Complexity",
"Computational Modeling",
"Clustering Algorithms",
"RNA Structures",
"Barrier Tree",
"Pseudoknots",
"Algorithm",
"Basin Hopping Graph"
],
"authors": [
{
"affiliation": "Shandong Jianzhu University",
"fullName": "Zhendong Liu",
"givenName": "Zhendong",
"surname": "Liu",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Shandong Jianzhu University",
"fullName": "Fanghan Liu",
"givenName": "Fanghan",
"surname": "Liu",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Shandong Jianzhu University",
"fullName": "Yurong Yang",
"givenName": "Yurong",
"surname": "Yang",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Shandong Jianzhu University",
"fullName": "Jiwei Wang",
"givenName": "Jiwei",
"surname": "Wang",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Shandong Jianzhu University",
"fullName": "Hailin Zhang",
"givenName": "Hailin",
"surname": "Zhang",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "cis",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2019-12-01T00:00:00",
"pubType": "proceedings",
"pages": "336-340",
"year": "2019",
"issn": null,
"isbn": "978-1-7281-6092-4",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "609200a332",
"articleId": "1i5m3qMTV9C",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "609200a341",
"articleId": "1i5m7GMHGxO",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/cis/2017/4822/0/482201a469",
"title": "The Algorithm and Scheme of Prediction in RNA Folding Structure with Pseudoknots",
"doi": null,
"abstractUrl": "/proceedings-article/cis/2017/482201a469/12OmNASraXN",
"parentPublication": {
"id": "proceedings/cis/2017/4822/0",
"title": "2017 13th International Conference on Computational Intelligence and Security (CIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cis/2015/8660/0/8660a034",
"title": "Predicting Algorithm of RNA Folding Structure with Pseudoknots",
"doi": null,
"abstractUrl": "/proceedings-article/cis/2015/8660a034/12OmNApcuqF",
"parentPublication": {
"id": "proceedings/cis/2015/8660/0",
"title": "2015 11th International Conference on Computational Intelligence and Security (CIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cis/2013/2549/0/06746345",
"title": "An Approximation Scheme for RNA Folding Structure Prediction Including Pseudoknots",
"doi": null,
"abstractUrl": "/proceedings-article/cis/2013/06746345/12OmNC8uRwv",
"parentPublication": {
"id": "proceedings/cis/2013/2549/0",
"title": "2013 Ninth International Conference on Computational Intelligence and Security (CIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cis/2011/4584/0/4584a110",
"title": "New Heuristic Algorithm of RNA Secondary Structure Prediction with Pseudoknots",
"doi": null,
"abstractUrl": "/proceedings-article/cis/2011/4584a110/12OmNqJZgEI",
"parentPublication": {
"id": "proceedings/cis/2011/4584/0",
"title": "2011 Seventh International Conference on Computational Intelligence and Security",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccabs/2013/0716/0/06629204",
"title": "Multicore and GPU algorithms for nussinov RNA folding",
"doi": null,
"abstractUrl": "/proceedings-article/iccabs/2013/06629204/12OmNx3HI20",
"parentPublication": {
"id": "proceedings/iccabs/2013/0716/0",
"title": "2013 IEEE 3rd International Conference on Computational Advances in Bio and Medical Sciences (ICCABS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccabs/2017/2594/0/08114309",
"title": "Efficient RNA folding using Zuker's method",
"doi": null,
"abstractUrl": "/proceedings-article/iccabs/2017/08114309/12OmNyz5JUL",
"parentPublication": {
"id": "proceedings/iccabs/2017/2594/0",
"title": "2017 IEEE 7th International Conference on Computational Advances in Bio- and Medical Sciences (ICCABS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/2016/05/07317534",
"title": "A New Method to Predict RNA Secondary Structure Based on RNA Folding Simulation",
"doi": null,
"abstractUrl": "/journal/tb/2016/05/07317534/13rRUwgQppn",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cis/2018/0169/0/016900a006",
"title": "The Computation of the Barrier Tree for BHG of RNA Folding Structure",
"doi": null,
"abstractUrl": "/proceedings-article/cis/2018/016900a006/17D45XDIXXc",
"parentPublication": {
"id": "proceedings/cis/2018/0169/0",
"title": "2018 14th International Conference on Computational Intelligence and Security (CIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cis/2018/0169/0/016900a196",
"title": "Algorithm and Scheme in RNA Structure Prediction Including Pseudoknots",
"doi": null,
"abstractUrl": "/proceedings-article/cis/2018/016900a196/17D45Xh13w4",
"parentPublication": {
"id": "proceedings/cis/2018/0169/0",
"title": "2018 14th International Conference on Computational Intelligence and Security (CIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cis/2020/0445/0/044500a351",
"title": "Predicting Algorithms and Complexity in RNA Structure Based on BHG",
"doi": null,
"abstractUrl": "/proceedings-article/cis/2020/044500a351/1t90vwgdKZG",
"parentPublication": {
"id": "proceedings/cis/2020/0445/0",
"title": "2020 16th International Conference on Computational Intelligence and Security (CIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNqJq4iC",
"title": "2016 IEEE Working Conference on Software Visualization (VISSOFT)",
"acronym": "vissoft",
"groupId": "1001231",
"volume": "0",
"displayVolume": "0",
"year": "2016",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNvTTck3",
"doi": "10.1109/VISSOFT.2016.22",
"title": "vizSlice: Visualizing Large Scale Software Slices",
"normalizedTitle": "vizSlice: Visualizing Large Scale Software Slices",
"abstract": "Program slicing has long been used to facilitate program understanding. Several approaches have been suggested for computing slices based on different perspectives, including forward slicing, backward slicing, static slicing, and dynamic slicing. The applications of slicing are numerous, including testing, effort estimation, and impact analysis. Surprisingly, given the maturity of slicing, few approaches exist for visualizing slices. In this paper, we present our tool for visualizing large systems based on program slicing and through two visualization idioms: treemaps and bipartite graphs. In particular, we use treemaps to facilitate slicing-based navigation, and we use bipartite graphs to facilitate visual impact analysis by displaying relationships among system decomposition slices showing the relevant computations involving a given slicing variable. We believe our tool will support various software maintenance tasks, including providing analysts an interactive visualization of the impact of potential changes, thus allowing them to plan maintenance accordingly. Finally, we show that, through the use of both existing scalable slicing and scalable visualization approaches, our tool can facilitate analysis of large software systems.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Program slicing has long been used to facilitate program understanding. Several approaches have been suggested for computing slices based on different perspectives, including forward slicing, backward slicing, static slicing, and dynamic slicing. The applications of slicing are numerous, including testing, effort estimation, and impact analysis. Surprisingly, given the maturity of slicing, few approaches exist for visualizing slices. In this paper, we present our tool for visualizing large systems based on program slicing and through two visualization idioms: treemaps and bipartite graphs. In particular, we use treemaps to facilitate slicing-based navigation, and we use bipartite graphs to facilitate visual impact analysis by displaying relationships among system decomposition slices showing the relevant computations involving a given slicing variable. We believe our tool will support various software maintenance tasks, including providing analysts an interactive visualization of the impact of potential changes, thus allowing them to plan maintenance accordingly. Finally, we show that, through the use of both existing scalable slicing and scalable visualization approaches, our tool can facilitate analysis of large software systems.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Program slicing has long been used to facilitate program understanding. Several approaches have been suggested for computing slices based on different perspectives, including forward slicing, backward slicing, static slicing, and dynamic slicing. The applications of slicing are numerous, including testing, effort estimation, and impact analysis. Surprisingly, given the maturity of slicing, few approaches exist for visualizing slices. In this paper, we present our tool for visualizing large systems based on program slicing and through two visualization idioms: treemaps and bipartite graphs. In particular, we use treemaps to facilitate slicing-based navigation, and we use bipartite graphs to facilitate visual impact analysis by displaying relationships among system decomposition slices showing the relevant computations involving a given slicing variable. We believe our tool will support various software maintenance tasks, including providing analysts an interactive visualization of the impact of potential changes, thus allowing them to plan maintenance accordingly. Finally, we show that, through the use of both existing scalable slicing and scalable visualization approaches, our tool can facilitate analysis of large software systems.",
"fno": "3850a101",
"keywords": [
"Data Visualisation",
"Interactive Systems",
"Program Slicing",
"Software Maintenance",
"Trees Mathematics",
"Viz Slice",
"Large Scale Software Slice Visualization",
"Program Slicing",
"Forward Slicing",
"Backward Slicing",
"Static Slicing",
"Dynamic Slicing",
"Effort Estimation",
"Treemaps",
"Slicing Based Navigation",
"Bipartite Graphs",
"Visual Impact Analysis",
"System Decomposition Slices",
"Slicing Variable",
"Software Maintenance",
"Interactive Visualization",
"Large Software Systems",
"Visualization",
"Data Visualization",
"Bipartite Graph",
"Maintenance Engineering",
"Software Systems",
"Complexity Theory"
],
"authors": [
{
"affiliation": "Dept. of Comput. Sci. & Software Eng., Miami Univ., Oxford, OH, USA",
"fullName": "Hakam W. Alomari",
"givenName": "Hakam W.",
"surname": "Alomari",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Dept. of Comput. Sci. & Software Eng., Miami Univ., Oxford, OH, USA",
"fullName": "Rachel A. Jennings",
"givenName": "Rachel A.",
"surname": "Jennings",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Dept. of Comput. Sci. & Software Eng., Miami Univ., Oxford, OH, USA",
"fullName": "Paulo Virote De Souza",
"givenName": "Paulo Virote",
"surname": "De Souza",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Dept. of Comput. Sci. & Software Eng., Miami Univ., Oxford, OH, USA",
"fullName": "Matthew Stephan",
"givenName": "Matthew",
"surname": "Stephan",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Dept. of Comput. Sci., Tennessee Technol. Univ., Cookeville, TN, USA",
"fullName": "Gerald C. Gannod",
"givenName": "Gerald C.",
"surname": "Gannod",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "vissoft",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2016-10-01T00:00:00",
"pubType": "proceedings",
"pages": "101-105",
"year": "2016",
"issn": null,
"isbn": "978-1-5090-3850-3",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "3850a096",
"articleId": "12OmNC3XhpE",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "3850a106",
"articleId": "12OmNwtn3u4",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/issrew/2015/1944/0/07392045",
"title": "Conditional slicing: Reducing dynamic slices",
"doi": null,
"abstractUrl": "/proceedings-article/issrew/2015/07392045/12OmNApu5J7",
"parentPublication": {
"id": "proceedings/issrew/2015/1944/0",
"title": "2015 IEEE International Symposium on Software Reliability Engineering Workshops (ISSREW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bigdata-congress/2014/5057/0/06906756",
"title": "Rectangle Counting in Large Bipartite Graphs",
"doi": null,
"abstractUrl": "/proceedings-article/bigdata-congress/2014/06906756/12OmNBtCCLP",
"parentPublication": {
"id": "proceedings/bigdata-congress/2014/5057/0",
"title": "2014 IEEE International Congress on Big Data (BigData Congress)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/apsec/1997/8271/0/82710395",
"title": "Slicing Object-Oriented Programs",
"doi": null,
"abstractUrl": "/proceedings-article/apsec/1997/82710395/12OmNqG0SY2",
"parentPublication": {
"id": "proceedings/apsec/1997/8271/0",
"title": "Proceedings of Joint 4th International Computer Science Conference and 4th Asia Pacific Software Engineering Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/csmr/2001/1028/0/10280105",
"title": "Dynamic Slicing Method for Maintenance of Large C Programs",
"doi": null,
"abstractUrl": "/proceedings-article/csmr/2001/10280105/12OmNvkpl5u",
"parentPublication": {
"id": "proceedings/csmr/2001/1028/0",
"title": "Proceedings Fifth European Conference on Software Maintenance and Reengineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vl/1994/6660/0/00363606",
"title": "Visualizing program slices",
"doi": null,
"abstractUrl": "/proceedings-article/vl/1994/00363606/12OmNwlZu1M",
"parentPublication": {
"id": "proceedings/vl/1994/6660/0",
"title": "Proceedings of 1994 IEEE Symposium on Visual Languages",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wi-iat/2009/3801/1/3801a050",
"title": "Community Detection in Large-Scale Bipartite Networks",
"doi": null,
"abstractUrl": "/proceedings-article/wi-iat/2009/3801a050/12OmNyRPgCU",
"parentPublication": {
"id": "proceedings/wi-iat/2009/3801/1",
"title": "2009 IEEE/WIC/ACM International Joint Conference on Web Intelligence and Intelligent Agent Technology (WI-IAT)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2019/01/08440048",
"title": "V<sc>i</sc>B<sc>r</sc>: Visualizing Bipartite Relations at Scale with the Minimum Description Length Principle",
"doi": null,
"abstractUrl": "/journal/tg/2019/01/08440048/17D45W2WyxU",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/td/2023/02/09947316",
"title": "Distributed Approaches to Butterfly Analysis on Large Dynamic Bipartite Graphs",
"doi": null,
"abstractUrl": "/journal/td/2023/02/09947316/1IiLLpU0bhm",
"parentPublication": {
"id": "trans/td",
"title": "IEEE Transactions on Parallel & Distributed Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icde/2020/2903/0/09101358",
"title": "Efficient Bitruss Decomposition for Large-scale Bipartite Graphs",
"doi": null,
"abstractUrl": "/proceedings-article/icde/2020/09101358/1kaMKNvItzy",
"parentPublication": {
"id": "proceedings/icde/2020/2903/0",
"title": "2020 IEEE 36th International Conference on Data Engineering (ICDE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icde/2020/2903/0/09101846",
"title": "Hierarchical Bipartite Graph Neural Networks: Towards Large-Scale E-commerce Applications",
"doi": null,
"abstractUrl": "/proceedings-article/icde/2020/09101846/1kaMyoISgBW",
"parentPublication": {
"id": "proceedings/icde/2020/2903/0",
"title": "2020 IEEE 36th International Conference on Data Engineering (ICDE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNzvQHK1",
"title": "2011 IEEE 27th International Conference on Data Engineering",
"acronym": "icde",
"groupId": "1000178",
"volume": "0",
"displayVolume": "0",
"year": "2011",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNAle6jz",
"doi": "10.1109/ICDE.2011.5767943",
"title": "Advanced search, visualization and tagging of sensor metadata",
"normalizedTitle": "Advanced search, visualization and tagging of sensor metadata",
"abstract": "As sensors continue to proliferate, the capabilities of effectively querying not only sensor data but also its metadata becomes important in a wide range of applications. This paper demonstrates a search system that utilizes various techniques and tools for querying sensor metadata and visualizing the results. Our system provides an easy-to-use query interface, built upon semantic technologies where users can freely store and query their metadata. Going beyond basic keyword search, the system provides a variety of advanced functionalities tailored for sensor metadata search; ordering search results according to our ranking mechanism based on the PageRank algorithm, recommending pages that contain relevant metadata information to given search conditions, presenting search results using various visualization tools, and offering dynamic hypergraphs and tag clouds of metadata. The system has been running as a real application and its effectiveness has been proved by a number of users.",
"abstracts": [
{
"abstractType": "Regular",
"content": "As sensors continue to proliferate, the capabilities of effectively querying not only sensor data but also its metadata becomes important in a wide range of applications. This paper demonstrates a search system that utilizes various techniques and tools for querying sensor metadata and visualizing the results. Our system provides an easy-to-use query interface, built upon semantic technologies where users can freely store and query their metadata. Going beyond basic keyword search, the system provides a variety of advanced functionalities tailored for sensor metadata search; ordering search results according to our ranking mechanism based on the PageRank algorithm, recommending pages that contain relevant metadata information to given search conditions, presenting search results using various visualization tools, and offering dynamic hypergraphs and tag clouds of metadata. The system has been running as a real application and its effectiveness has been proved by a number of users.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "As sensors continue to proliferate, the capabilities of effectively querying not only sensor data but also its metadata becomes important in a wide range of applications. This paper demonstrates a search system that utilizes various techniques and tools for querying sensor metadata and visualizing the results. Our system provides an easy-to-use query interface, built upon semantic technologies where users can freely store and query their metadata. Going beyond basic keyword search, the system provides a variety of advanced functionalities tailored for sensor metadata search; ordering search results according to our ranking mechanism based on the PageRank algorithm, recommending pages that contain relevant metadata information to given search conditions, presenting search results using various visualization tools, and offering dynamic hypergraphs and tag clouds of metadata. The system has been running as a real application and its effectiveness has been proved by a number of users.",
"fno": "05767943",
"keywords": [],
"authors": [
{
"affiliation": "School of Computer and Communication Sciences, Ecole Polytechnique Fédérale de Lausanne (EPFL), Switzerland",
"fullName": "Ioannis Paparrizos",
"givenName": "Ioannis",
"surname": "Paparrizos",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "School of Computer and Communication Sciences, Ecole Polytechnique Fédérale de Lausanne (EPFL), Switzerland",
"fullName": "Hoyoung Jeung",
"givenName": "Hoyoung",
"surname": "Jeung",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "School of Computer and Communication Sciences, Ecole Polytechnique Fédérale de Lausanne (EPFL), Switzerland",
"fullName": "Karl Aberer",
"givenName": "Karl",
"surname": "Aberer",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "icde",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2011-04-01T00:00:00",
"pubType": "proceedings",
"pages": "1356-1359",
"year": "2011",
"issn": null,
"isbn": "978-1-4244-8959-6",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "05767954",
"articleId": "12OmNBCqbBP",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "05767962",
"articleId": "12OmNwdbVdS",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/icde/2007/0802/0/04221823",
"title": "Using Queries to Associate Metadata with Data",
"doi": null,
"abstractUrl": "/proceedings-article/icde/2007/04221823/12OmNAu1Flf",
"parentPublication": {
"id": "proceedings/icde/2007/0802/0",
"title": "2007 IEEE 23rd International Conference on Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sutc/2010/4049/0/4049a107",
"title": "Effective Metadata Management in Federated Sensor Networks",
"doi": null,
"abstractUrl": "/proceedings-article/sutc/2010/4049a107/12OmNqH9hrE",
"parentPublication": {
"id": "proceedings/sutc/2010/4049/0",
"title": "Sensor Networks, Ubiquitous, and Trustworthy Computing, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/dexa/2004/2195/0/21950168",
"title": "A Search Engine for RDF Metadata",
"doi": null,
"abstractUrl": "/proceedings-article/dexa/2004/21950168/12OmNqHqSxx",
"parentPublication": {
"id": "proceedings/dexa/2004/2195/0",
"title": "Proceedings. 15th International Workshop on Database and Expert Systems Applications, 2004.",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccit/2008/3407/1/3407a571",
"title": "A Metadata Search Approach to Keyword Search in Relational Databases",
"doi": null,
"abstractUrl": "/proceedings-article/iccit/2008/3407a571/12OmNwfsI3a",
"parentPublication": {
"id": "iccit/2008/3407/1",
"title": "Convergence Information Technology, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/nas/2011/4509/0/4509a278",
"title": "Efficient, Modular Metadata Management with Loris",
"doi": null,
"abstractUrl": "/proceedings-article/nas/2011/4509a278/12OmNx7G62L",
"parentPublication": {
"id": "proceedings/nas/2011/4509/0",
"title": "2011 IEEE Sixth International Conference on Networking, Architecture, and Storage",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ism/2006/2746/0/274600720",
"title": "MeTaMaF: Metadata Tagging and Mapping Framework for Managing Multimedia Content",
"doi": null,
"abstractUrl": "/proceedings-article/ism/2006/274600720/12OmNxX3uMp",
"parentPublication": {
"id": "proceedings/ism/2006/2746/0",
"title": "Eighth IEEE International Symposium on Multimedia (ISM'06)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/chinagrid/2008/3306/0/3306a115",
"title": "A Self-Adaptive Metadata Management Model for Data Grid",
"doi": null,
"abstractUrl": "/proceedings-article/chinagrid/2008/3306a115/12OmNyQYthq",
"parentPublication": {
"id": "proceedings/chinagrid/2008/3306/0",
"title": "The Third ChinaGrid Annual Conference (chinagrid 2008)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icalt/2008/3167/0/3167a829",
"title": "Tagging Learning Objects with Evolving Metadata Schemas",
"doi": null,
"abstractUrl": "/proceedings-article/icalt/2008/3167a829/12OmNyeECDk",
"parentPublication": {
"id": "proceedings/icalt/2008/3167/0",
"title": "IEEE International Conference on Advanced Learning Technologies (ICALT 2008)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/e-science/2018/9156/0/915600a093",
"title": "ScienceSearch: Enabling Search through Automatic Metadata Generation",
"doi": null,
"abstractUrl": "/proceedings-article/e-science/2018/915600a093/17D45XwUAIC",
"parentPublication": {
"id": "proceedings/e-science/2018/9156/0",
"title": "2018 IEEE 14th International Conference on e-Science (e-Science)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ccgrid/2020/6095/0/09139660",
"title": "Efficient Metadata Indexing for HPC Storage Systems",
"doi": null,
"abstractUrl": "/proceedings-article/ccgrid/2020/09139660/1lsspFlVlkI",
"parentPublication": {
"id": "proceedings/ccgrid/2020/6095/0",
"title": "2020 20th IEEE/ACM International Symposium on Cluster, Cloud and Internet Computing (CCGRID)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNBrDqEq",
"title": "Proceedings IEEE Conference on Computer Vision and Pattern Recognition. CVPR 2000 (Cat. No.PR00662)",
"acronym": "cvpr",
"groupId": "1000147",
"volume": "2",
"displayVolume": "3",
"year": "2000",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNAnMuvX",
"doi": "10.1109/CVPR.2000.854958",
"title": "CueVideo: A System for Cross-Modal Search and Browse of Video Databases",
"normalizedTitle": "CueVideo: A System for Cross-Modal Search and Browse of Video Databases",
"abstract": "The detection and recognition of events is a challenging problem in video databases. It involves cross-linking and combining information available in multiple modalities such as audio, video and associated text metadata. CueVideo is a system designed for the discovery and recognition of specific events called topics of discussion through advanced video summarization and cross-modal indexing. It supports search for relevant video content through several modes of video summarization including storyboards moving storyboards and time-scale modified audio summarization. It also enables the recognition and indexing of topical events through cross-modal search of audio and video content based on text and image queries respectively.",
"abstracts": [
{
"abstractType": "Regular",
"content": "The detection and recognition of events is a challenging problem in video databases. It involves cross-linking and combining information available in multiple modalities such as audio, video and associated text metadata. CueVideo is a system designed for the discovery and recognition of specific events called topics of discussion through advanced video summarization and cross-modal indexing. It supports search for relevant video content through several modes of video summarization including storyboards moving storyboards and time-scale modified audio summarization. It also enables the recognition and indexing of topical events through cross-modal search of audio and video content based on text and image queries respectively.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "The detection and recognition of events is a challenging problem in video databases. It involves cross-linking and combining information available in multiple modalities such as audio, video and associated text metadata. CueVideo is a system designed for the discovery and recognition of specific events called topics of discussion through advanced video summarization and cross-modal indexing. It supports search for relevant video content through several modes of video summarization including storyboards moving storyboards and time-scale modified audio summarization. It also enables the recognition and indexing of topical events through cross-modal search of audio and video content based on text and image queries respectively.",
"fno": "06622786",
"keywords": [],
"authors": [
{
"affiliation": "IBM Almaden Research Center",
"fullName": "Tanveer Syeda-Mahmood",
"givenName": "Tanveer",
"surname": "Syeda-Mahmood",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "IBM Almaden Research Center",
"fullName": "S. Srinivasan",
"givenName": "S.",
"surname": "Srinivasan",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "IBM Almaden Research Center",
"fullName": "A. Amir",
"givenName": "A.",
"surname": "Amir",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "IBM Almaden Research Center",
"fullName": "D. Ponceleon",
"givenName": "D.",
"surname": "Ponceleon",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "IBM Almaden Research Center",
"fullName": "B. Blanchard",
"givenName": "B.",
"surname": "Blanchard",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "IBM Almaden Research Center",
"fullName": "D. Petkovic",
"givenName": "D.",
"surname": "Petkovic",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "cvpr",
"isOpenAccess": false,
"showRecommendedArticles": false,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2000-06-01T00:00:00",
"pubType": "proceedings",
"pages": "2786",
"year": "2000",
"issn": "1063-6919",
"isbn": "0-7695-0662-3",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "06622784",
"articleId": "12OmNxFaLf1",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "06622788",
"articleId": "12OmNyaXPLS",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNvkYx8t",
"title": "2011 44th Hawaii International Conference on System Sciences",
"acronym": "hicss",
"groupId": "1000730",
"volume": "0",
"displayVolume": "0",
"year": "2011",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNAoUTkT",
"doi": "10.1109/HICSS.2011.11",
"title": "A Four Group Cross-Over Design for Measuring Irreversible Treatments on Web Search Tasks",
"normalizedTitle": "A Four Group Cross-Over Design for Measuring Irreversible Treatments on Web Search Tasks",
"abstract": "When trying to measure the effect of irreversible treatments such as training interventions, the choice of the experimental design can be difficult. A two group cross-over experimental design cannot be used due to longitudinal effects during the course of the experimental run, which can be especially large in dynamic web search environments. A standard case/control two group design also can be problematic because it is negatively impacted by variability among participants. Our solution uses a four group cross-over design that combines features from standard cross-over and case/control designs. We illustrate the effectiveness of this design through a case study in which participants are shown a video on how to use \"control-F\" to search for text within a web page. We quantify the improvement of our four group cross-over design compared to the standard case/control two group design with respect to measuring the effect of this video on participants. Finally, we compare the magnitude of our estimated \"control-F\" effect to similar studies on web ranking and user-interface changes, revealing that teaching this skill produces a potentially large improvement in web searchers' ability to search rapidly.",
"abstracts": [
{
"abstractType": "Regular",
"content": "When trying to measure the effect of irreversible treatments such as training interventions, the choice of the experimental design can be difficult. A two group cross-over experimental design cannot be used due to longitudinal effects during the course of the experimental run, which can be especially large in dynamic web search environments. A standard case/control two group design also can be problematic because it is negatively impacted by variability among participants. Our solution uses a four group cross-over design that combines features from standard cross-over and case/control designs. We illustrate the effectiveness of this design through a case study in which participants are shown a video on how to use \"control-F\" to search for text within a web page. We quantify the improvement of our four group cross-over design compared to the standard case/control two group design with respect to measuring the effect of this video on participants. Finally, we compare the magnitude of our estimated \"control-F\" effect to similar studies on web ranking and user-interface changes, revealing that teaching this skill produces a potentially large improvement in web searchers' ability to search rapidly.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "When trying to measure the effect of irreversible treatments such as training interventions, the choice of the experimental design can be difficult. A two group cross-over experimental design cannot be used due to longitudinal effects during the course of the experimental run, which can be especially large in dynamic web search environments. A standard case/control two group design also can be problematic because it is negatively impacted by variability among participants. Our solution uses a four group cross-over design that combines features from standard cross-over and case/control designs. We illustrate the effectiveness of this design through a case study in which participants are shown a video on how to use \"control-F\" to search for text within a web page. We quantify the improvement of our four group cross-over design compared to the standard case/control two group design with respect to measuring the effect of this video on participants. Finally, we compare the magnitude of our estimated \"control-F\" effect to similar studies on web ranking and user-interface changes, revealing that teaching this skill produces a potentially large improvement in web searchers' ability to search rapidly.",
"fno": "05718609",
"keywords": [
"Information Retrieval",
"Internet",
"Search Engines",
"Four Group Cross Over Design",
"Irreversible Treatment",
"Web Search Task",
"Longitudinal Effect",
"Control F",
"Particle Measurements",
"Atmospheric Measurements",
"Web Search",
"Web Pages",
"Data Models",
"Google"
],
"authors": [
{
"affiliation": null,
"fullName": "Li Ma",
"givenName": "Li",
"surname": "Ma",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "David Mease",
"givenName": "David",
"surname": "Mease",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Daniel M. Russell",
"givenName": "Daniel M.",
"surname": "Russell",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "hicss",
"isOpenAccess": true,
"showRecommendedArticles": true,
"showBuyMe": false,
"hasPdf": true,
"pubDate": "2011-01-01T00:00:00",
"pubType": "proceedings",
"pages": "1-9",
"year": "2011",
"issn": "1530-1605",
"isbn": "978-1-4244-9618-1",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "05718608",
"articleId": "12OmNrEL2AF",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "05718610",
"articleId": "12OmNvzJGck",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/icalt/2015/7334/0/7334a175",
"title": "The Impact of Cross-Age Peer Tutors on Knowledge Elaboration, Knowledge Convergence, and Group Performance in Computer Supported Collaborative Learning",
"doi": null,
"abstractUrl": "/proceedings-article/icalt/2015/7334a175/12OmNAhfIwo",
"parentPublication": {
"id": "proceedings/icalt/2015/7334/0",
"title": "2015 IEEE 15th International Conference on Advanced Learning Technologies (ICALT)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/hicss/2011/9618/0/05718620",
"title": "Deformation Analysis of Modified Maps Based on Geographical Accuracy and Spatial Context",
"doi": null,
"abstractUrl": "/proceedings-article/hicss/2011/05718620/12OmNArbG5Z",
"parentPublication": {
"id": "proceedings/hicss/2011/9618/0",
"title": "2011 44th Hawaii International Conference on System Sciences",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iiaiaai/2014/4174/0/06913326",
"title": "An Integrated Contextual and Web-Based Problem-Solving Approach to Improving Students' Learning Achievements, Attitudes and Critical Thinking",
"doi": null,
"abstractUrl": "/proceedings-article/iiaiaai/2014/06913326/12OmNxQOjKe",
"parentPublication": {
"id": "proceedings/iiaiaai/2014/4174/0",
"title": "2014 IIAI 3rd International Conference on Advanced Applied Informatics (IIAIAAI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/dexa/2008/3299/0/3299a444",
"title": "The Effectiveness of the Nature and the Type of Web Content",
"doi": null,
"abstractUrl": "/proceedings-article/dexa/2008/3299a444/12OmNxX3uAH",
"parentPublication": {
"id": "proceedings/dexa/2008/3299/0",
"title": "2008 19th International Workshop on Database and Expert Systems Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icse/2013/3073/0/06606627",
"title": "Reverb: Recommending code-related web pages",
"doi": null,
"abstractUrl": "/proceedings-article/icse/2013/06606627/12OmNxisQR6",
"parentPublication": {
"id": "proceedings/icse/2013/3073/0",
"title": "2013 35th International Conference on Software Engineering (ICSE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/hicss/2011/9618/0/05718612",
"title": "User Behaviour during Web Search as Part of Information Gathering",
"doi": null,
"abstractUrl": "/proceedings-article/hicss/2011/05718612/12OmNyPQ4xN",
"parentPublication": {
"id": "proceedings/hicss/2011/9618/0",
"title": "2011 44th Hawaii International Conference on System Sciences",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/asonam/2016/2846/0/07752439",
"title": "A centrality-based measure of user privacy in online social networks",
"doi": null,
"abstractUrl": "/proceedings-article/asonam/2016/07752439/12OmNzWx007",
"parentPublication": {
"id": "proceedings/asonam/2016/2846/0",
"title": "2016 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/passat-socialcom/2011/1931/0/06113154",
"title": "Enabling Cross-Site Content Sharing between Social Networks",
"doi": null,
"abstractUrl": "/proceedings-article/passat-socialcom/2011/06113154/12OmNzdGnu1",
"parentPublication": {
"id": "proceedings/passat-socialcom/2011/1931/0",
"title": "2011 IEEE Third Int'l Conference on Privacy, Security, Risk and Trust (PASSAT) / 2011 IEEE Third Int'l Conference on Social Computing (SocialCom)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iscc/2018/6950/0/08538687",
"title": "QUIC and TCP: A Performance Evaluation",
"doi": null,
"abstractUrl": "/proceedings-article/iscc/2018/08538687/17D45VVho3G",
"parentPublication": {
"id": "proceedings/iscc/2018/6950/0",
"title": "2018 IEEE Symposium on Computers and Communications (ISCC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tq/2022/02/09144421",
"title": "JSCSP: A Novel Policy-Based XSS Defense Mechanism for Browsers",
"doi": null,
"abstractUrl": "/journal/tq/2022/02/09144421/1lClyO5O3qE",
"parentPublication": {
"id": "trans/tq",
"title": "IEEE Transactions on Dependable and Secure Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNzlD9Hs",
"title": "6th Asia-Pacific Symposium on Information and Telecommunication Technologies",
"acronym": "apsitt",
"groupId": "1002058",
"volume": "0",
"displayVolume": "0",
"year": "2005",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNB836G3",
"doi": "10.1109/APSITT.2005.203657",
"title": "Desktop search system based on the Action-Oriented algorism",
"normalizedTitle": "Desktop search system based on the Action-Oriented algorism",
"abstract": "Have you ever been unable to retrieve a Web page even though you have read it before? In Japan, the broadband environment is common now, and people easily read many pages obtained through the Internet. However, finding the files is sometimes difficult because of forgetting how to find them. Some desktop search services have begun to be provided to solve this problem. However, users do not seem to be satisfied with them. For example, most services show many unimportant files. Against this background, we propose a new desktop search system that uses text of the files and various action logs of a user such as view time, view period, frequency of copying the file, and frequency of printing the file. The system shows files that are more useful from among many files that have been read. In this paper, the outline of the desktop search prototype system and the result of an evaluation experiment are described. To collect various action logs without user effort, we developed a logging agent that gathers and stores the logs automatically. Action-oriented algorithm deduces the degree of importance of a file for each person by analyzing the various action logs. The proposed system shows thumbnails of files that are prized highly valuable according to their degree of importance and the result of keyword matching. In the evaluation experiment, we assume that the service's goal is to enable retrieving of an important page within a short time. Finally, the effectiveness of the proposed system is shown through the experiment",
"abstracts": [
{
"abstractType": "Regular",
"content": "Have you ever been unable to retrieve a Web page even though you have read it before? In Japan, the broadband environment is common now, and people easily read many pages obtained through the Internet. However, finding the files is sometimes difficult because of forgetting how to find them. Some desktop search services have begun to be provided to solve this problem. However, users do not seem to be satisfied with them. For example, most services show many unimportant files. Against this background, we propose a new desktop search system that uses text of the files and various action logs of a user such as view time, view period, frequency of copying the file, and frequency of printing the file. The system shows files that are more useful from among many files that have been read. In this paper, the outline of the desktop search prototype system and the result of an evaluation experiment are described. To collect various action logs without user effort, we developed a logging agent that gathers and stores the logs automatically. Action-oriented algorithm deduces the degree of importance of a file for each person by analyzing the various action logs. The proposed system shows thumbnails of files that are prized highly valuable according to their degree of importance and the result of keyword matching. In the evaluation experiment, we assume that the service's goal is to enable retrieving of an important page within a short time. Finally, the effectiveness of the proposed system is shown through the experiment",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Have you ever been unable to retrieve a Web page even though you have read it before? In Japan, the broadband environment is common now, and people easily read many pages obtained through the Internet. However, finding the files is sometimes difficult because of forgetting how to find them. Some desktop search services have begun to be provided to solve this problem. However, users do not seem to be satisfied with them. For example, most services show many unimportant files. Against this background, we propose a new desktop search system that uses text of the files and various action logs of a user such as view time, view period, frequency of copying the file, and frequency of printing the file. The system shows files that are more useful from among many files that have been read. In this paper, the outline of the desktop search prototype system and the result of an evaluation experiment are described. To collect various action logs without user effort, we developed a logging agent that gathers and stores the logs automatically. Action-oriented algorithm deduces the degree of importance of a file for each person by analyzing the various action logs. The proposed system shows thumbnails of files that are prized highly valuable according to their degree of importance and the result of keyword matching. In the evaluation experiment, we assume that the service's goal is to enable retrieving of an important page within a short time. Finally, the effectiveness of the proposed system is shown through the experiment",
"fno": "01593464",
"keywords": [
"Information Retrieval",
"Internet",
"Desktop Search System",
"Action Oriented Algorithm",
"Web Page Retrieval",
"Desktop Search Services",
"Logging Agent",
"Keyword Matching",
"History",
"Web Pages",
"Books",
"Frequency",
"Web And Internet Services",
"Web Server",
"Uniform Resource Locators",
"Laboratories",
"Printing",
"Prototypes"
],
"authors": [
{
"affiliation": "NTT Cyber Solutions Laboratories 3-9-11 Midori-cho Musashino-shi Tokyo, 180-8585, JAPAN; morita.t@lab.ntt.co.jp",
"fullName": "T. Morita",
"givenName": "T.",
"surname": "Morita",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "T. Hidaka",
"givenName": "T.",
"surname": "Hidaka",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "T. Kura",
"givenName": "T.",
"surname": "Kura",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "K. Ooura",
"givenName": "K.",
"surname": "Ooura",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Y. Kato",
"givenName": "Y.",
"surname": "Kato",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "apsitt",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2005-01-01T00:00:00",
"pubType": "proceedings",
"pages": "204-207",
"year": "2005",
"issn": null,
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "01593463",
"articleId": "12OmNyvY9Co",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "01593465",
"articleId": "12OmNC4eSrQ",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/iiai-aai/2015/9957/0/07373978",
"title": "Silhouette Web Browser: Toward an Integration of Web and Desktop Applications Based on Transparent Layers for Collaborative Works",
"doi": null,
"abstractUrl": "/proceedings-article/iiai-aai/2015/07373978/12OmNALCNra",
"parentPublication": {
"id": "proceedings/iiai-aai/2015/9957/0",
"title": "2015 IIAI 4th International Congress on Advanced Applied Informatics (IIAI-AAI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wisa/2014/5726/0/07057992",
"title": "HuaVideo: Towards a Secure, Scalable and Compatible HTML5 Video Providing System",
"doi": null,
"abstractUrl": "/proceedings-article/wisa/2014/07057992/12OmNBO3JUs",
"parentPublication": {
"id": "proceedings/wisa/2014/5726/0",
"title": "2014 11th Web Information System and Application Conference (WISA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdm/2016/5473/0/07837916",
"title": "Spell: Streaming Parsing of System Event Logs",
"doi": null,
"abstractUrl": "/proceedings-article/icdm/2016/07837916/12OmNC2xhyD",
"parentPublication": {
"id": "proceedings/icdm/2016/5473/0",
"title": "2016 IEEE 16th International Conference on Data Mining (ICDM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/acsac/2008/2682/0/04625483",
"title": "Desktop search in the intranet with integrated desktop search engines",
"doi": null,
"abstractUrl": "/proceedings-article/acsac/2008/04625483/12OmNqBbHLB",
"parentPublication": {
"id": "proceedings/acsac/2008/2682/0",
"title": "2008 13th Asia-Pacific Computer Systems Architecture Conference (ACSAC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icme/2006/0366/0/04036614",
"title": "Videopot: Indexing-Based Desktop Video Search System",
"doi": null,
"abstractUrl": "/proceedings-article/icme/2006/04036614/12OmNvSbBz5",
"parentPublication": {
"id": "proceedings/icme/2006/0366/0",
"title": "2006 IEEE International Conference on Multimedia and Expo",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/dexa/1999/0281/0/02810544",
"title": "Desktop Scene Analysis for Document Management System",
"doi": null,
"abstractUrl": "/proceedings-article/dexa/1999/02810544/12OmNvqW6XC",
"parentPublication": {
"id": "proceedings/dexa/1999/0281/0",
"title": "Proceedings. Tenth International Workshop on Database and Expert Systems Applications. DEXA 99",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wisa/2013/3218/0/06778688",
"title": "Searching Desktop Files Based on Synonym Relationship",
"doi": null,
"abstractUrl": "/proceedings-article/wisa/2013/06778688/12OmNxE2mKh",
"parentPublication": {
"id": "proceedings/wisa/2013/3218/0",
"title": "2013 10th Web Information System and Application Conference (WISA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/csnt/2012/4692/0/4692a463",
"title": "SoDesktop: A Desktop Search Engine",
"doi": null,
"abstractUrl": "/proceedings-article/csnt/2012/4692a463/12OmNzcPA3z",
"parentPublication": {
"id": "proceedings/csnt/2012/4692/0",
"title": "Communication Systems and Network Technologies, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/ex/2008/01/mex2008010024",
"title": "Toward the Semantic Desktop: The seMouse Approach",
"doi": null,
"abstractUrl": "/magazine/ex/2008/01/mex2008010024/13rRUxC0SAn",
"parentPublication": {
"id": "mags/ex",
"title": "IEEE Intelligent Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "1lgoo8LiPZe",
"title": "Computer and Electrical Engineering, International Conference on",
"acronym": "iccee",
"groupId": "1002575",
"volume": "1",
"displayVolume": "1",
"year": "2009",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNC3FGkQ",
"doi": "10.1109/ICCEE.2009.228",
"title": "Exploring HTML Tags and Metadata to Improve the Expressiveness of Web Search Engine's Queries",
"normalizedTitle": "Exploring HTML Tags and Metadata to Improve the Expressiveness of Web Search Engine's Queries",
"abstract": "Web search engines are powerful tools used to satisfy specific information needs on the Web. Their purpose is to maximize user satisfaction when performing this task. Although there are other sources of evidence, besides text, to characterize document relevance for a specific need, especially for HTML documents, current search engines do not allow users to explore these features when posing a query. Search engine queries are based almost exclusively on keywords. We believe that it is possible to improve user satisfaction if HTML tags and document metadata are available to users at query time. In this paper we present Xearch, a meta-search system that wraps public search engines in a framework that improves both the expressiveness of the language available for the user to specify information needs and the control over the answer format. Xearch converts HTML pages to a specific XML schema, covering text and metadata derived from HTML. User queries are then submitted on this schema and can be specified through keywords but also explore documents' HTML tags and metadata. Results from our experimental evaluation confirm that it is possible to improve the answer quality with this framework.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Web search engines are powerful tools used to satisfy specific information needs on the Web. Their purpose is to maximize user satisfaction when performing this task. Although there are other sources of evidence, besides text, to characterize document relevance for a specific need, especially for HTML documents, current search engines do not allow users to explore these features when posing a query. Search engine queries are based almost exclusively on keywords. We believe that it is possible to improve user satisfaction if HTML tags and document metadata are available to users at query time. In this paper we present Xearch, a meta-search system that wraps public search engines in a framework that improves both the expressiveness of the language available for the user to specify information needs and the control over the answer format. Xearch converts HTML pages to a specific XML schema, covering text and metadata derived from HTML. User queries are then submitted on this schema and can be specified through keywords but also explore documents' HTML tags and metadata. Results from our experimental evaluation confirm that it is possible to improve the answer quality with this framework.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Web search engines are powerful tools used to satisfy specific information needs on the Web. Their purpose is to maximize user satisfaction when performing this task. Although there are other sources of evidence, besides text, to characterize document relevance for a specific need, especially for HTML documents, current search engines do not allow users to explore these features when posing a query. Search engine queries are based almost exclusively on keywords. We believe that it is possible to improve user satisfaction if HTML tags and document metadata are available to users at query time. In this paper we present Xearch, a meta-search system that wraps public search engines in a framework that improves both the expressiveness of the language available for the user to specify information needs and the control over the answer format. Xearch converts HTML pages to a specific XML schema, covering text and metadata derived from HTML. User queries are then submitted on this schema and can be specified through keywords but also explore documents' HTML tags and metadata. Results from our experimental evaluation confirm that it is possible to improve the answer quality with this framework.",
"fno": "3925a569",
"keywords": [
"Hypermedia Markup Languages",
"Internet",
"Query Processing",
"Search Engines",
"XML",
"HTML Tags",
"Web Search Engine Queries",
"HTML Documents",
"Document Metadata",
"Meta Search System",
"Xearch",
"XML Schema",
"HTML",
"Web Search",
"Search Engines",
"XML",
"Web Pages",
"Metasearch",
"Database Languages",
"Power Engineering Computing",
"Control Systems",
"Information Retrieval",
"XML",
"Query Language"
],
"authors": [
{
"affiliation": null,
"fullName": "Fonseca Vasconcelos Escudeiro",
"givenName": "Fonseca Vasconcelos",
"surname": "Escudeiro",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Lab. de Intel. Artificial e Apoio a Decisao, Inst. Politec. do Porto, Porto, Portugal",
"fullName": "Nuno Filipe Escudeiro",
"givenName": "Nuno Filipe",
"surname": "Escudeiro",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Graphic Interface Learning Technol., Inst. Politec. do Porto, Porto, Portugal",
"fullName": "Paula Maria de Sa Oliveira",
"givenName": "Paula Maria",
"surname": "de Sa Oliveira",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "iccee",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2009-12-01T00:00:00",
"pubType": "proceedings",
"pages": "569-573",
"year": "2009",
"issn": null,
"isbn": "978-1-4244-5365-8",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "3925a487",
"articleId": "12OmNx7ov0A",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "3925a492",
"articleId": "12OmNyPQ4Kq",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/icnisc/2015/1843/0/1843a426",
"title": "A User Model Based Ranking Method of Query Results of Meta-Search Engines",
"doi": null,
"abstractUrl": "/proceedings-article/icnisc/2015/1843a426/12OmNAPjA6y",
"parentPublication": {
"id": "proceedings/icnisc/2015/1843/0",
"title": "2015 International Conference on Network and Information Systems for Computers (ICNISC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wi/2005/2415/0/01517860",
"title": "Visual similarity comparison for Web page retrieval",
"doi": null,
"abstractUrl": "/proceedings-article/wi/2005/01517860/12OmNqIzgTg",
"parentPublication": {
"id": "proceedings/wi/2005/2415/0",
"title": "Proceedings. The 2005 IEEE/WIC/ACM International Conference on Web Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/fskd/2009/3735/7/05359983",
"title": "Using Missing Documents in Metasearch Aggregation: An Application of OWA Operator",
"doi": null,
"abstractUrl": "/proceedings-article/fskd/2009/05359983/12OmNrHB1Qp",
"parentPublication": {
"id": "proceedings/fskd/2009/3735/7",
"title": "Fuzzy Systems and Knowledge Discovery, Fourth International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wkdd/2010/5397/0/05432665",
"title": "A Multi-Agent Based Personalized Meta-Search Engine Using Automatic Fuzzy Concept Networks",
"doi": null,
"abstractUrl": "/proceedings-article/wkdd/2010/05432665/12OmNwLOYTW",
"parentPublication": {
"id": "proceedings/wkdd/2010/5397/0",
"title": "2010 3rd International Conference on Knowledge Discovery and Data Mining (WKDD 2010)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ainaw/2007/2847/1/284710355",
"title": "ClusTex: Information Extraction from HTML Pages",
"doi": null,
"abstractUrl": "/proceedings-article/ainaw/2007/284710355/12OmNwx3Q6O",
"parentPublication": {
"id": "proceedings/ainaw/2007/2847/1",
"title": "Advanced Information Networking and Applications Workshops, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/fskd/2008/3305/2/3305b038",
"title": "Optimized Query Terms Creation Based on Meta-Search and Clustering",
"doi": null,
"abstractUrl": "/proceedings-article/fskd/2008/3305b038/12OmNy87QzD",
"parentPublication": {
"id": "fskd/2008/3305/2",
"title": "Fuzzy Systems and Knowledge Discovery, Fourth International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icst/2015/7125/0/07102586",
"title": "Detection and Localization of HTML Presentation Failures Using Computer Vision-Based Techniques",
"doi": null,
"abstractUrl": "/proceedings-article/icst/2015/07102586/12OmNyjccCu",
"parentPublication": {
"id": "proceedings/icst/2015/7125/0",
"title": "2015 IEEE 8th International Conference on Software Testing, Verification and Validation (ICST)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ialp/2011/4554/0/4554a255",
"title": "Using HTML Tags to Improve Parallel Resources Extraction",
"doi": null,
"abstractUrl": "/proceedings-article/ialp/2011/4554a255/12OmNz2TCxP",
"parentPublication": {
"id": "proceedings/ialp/2011/4554/0",
"title": "Asian Language Processing, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2015/06/06945905",
"title": "What Can Pictures Tell Us About Web Pages? Improving Document Search Using Images",
"doi": null,
"abstractUrl": "/journal/tp/2015/06/06945905/13rRUIIVldT",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/jcdl/2021/1770/0/177000a110",
"title": "It's All About The Cards: Sharing on Social Media Encouraged HTML Metadata Growth",
"doi": null,
"abstractUrl": "/proceedings-article/jcdl/2021/177000a110/1zJmS1GaP28",
"parentPublication": {
"id": "proceedings/jcdl/2021/1770/0",
"title": "2021 ACM/IEEE Joint Conference on Digital Libraries (JCDL)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNz2TCuW",
"title": "2013 International Conference on Information Networking (ICOIN)",
"acronym": "icoin",
"groupId": "1000363",
"volume": "0",
"displayVolume": "0",
"year": "2013",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNzUPpAN",
"doi": "10.1109/ICOIN.2013.6496429",
"title": "A new video search approach based on user's preference and query ambiguity",
"normalizedTitle": "A new video search approach based on user's preference and query ambiguity",
"abstract": "Common re-ranking algorithms such as PageRank and HITS are not suitable for text-based video search approaches. Methods that utilize addition information (such as video length, release time) require too much user participation and cannot meet the different need of the users with different preference. Personalized search that collect users' preference information implicitly and re-rank the search result automatically can be used to re-rank search results for the text-based video search approach. Most existing personalized approaches only utilize users' long term preference or short term preference. They ignore the ambiguity difference among queries and suffer from adverse affects brought by improper personalized strategy over queries with certain ambiguity. We propose a new search approach and develop a system called CMSearch. CMSearch utilizes both users' long term preference and short term preference to capture us.ers' preference and makes use of the query ambiguity to adjust the utilization of the preference. Performance tests show that the system archives an average Ranking Score improvement of 37.52%.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Common re-ranking algorithms such as PageRank and HITS are not suitable for text-based video search approaches. Methods that utilize addition information (such as video length, release time) require too much user participation and cannot meet the different need of the users with different preference. Personalized search that collect users' preference information implicitly and re-rank the search result automatically can be used to re-rank search results for the text-based video search approach. Most existing personalized approaches only utilize users' long term preference or short term preference. They ignore the ambiguity difference among queries and suffer from adverse affects brought by improper personalized strategy over queries with certain ambiguity. We propose a new search approach and develop a system called CMSearch. CMSearch utilizes both users' long term preference and short term preference to capture us.ers' preference and makes use of the query ambiguity to adjust the utilization of the preference. Performance tests show that the system archives an average Ranking Score improvement of 37.52%.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Common re-ranking algorithms such as PageRank and HITS are not suitable for text-based video search approaches. Methods that utilize addition information (such as video length, release time) require too much user participation and cannot meet the different need of the users with different preference. Personalized search that collect users' preference information implicitly and re-rank the search result automatically can be used to re-rank search results for the text-based video search approach. Most existing personalized approaches only utilize users' long term preference or short term preference. They ignore the ambiguity difference among queries and suffer from adverse affects brought by improper personalized strategy over queries with certain ambiguity. We propose a new search approach and develop a system called CMSearch. CMSearch utilizes both users' long term preference and short term preference to capture us.ers' preference and makes use of the query ambiguity to adjust the utilization of the preference. Performance tests show that the system archives an average Ranking Score improvement of 37.52%.",
"fno": "06496429",
"keywords": [
"Entropy",
"Vectors",
"Support Vector Machine Classification",
"Search Problems",
"Internet",
"Web Pages",
"Indexes",
"Video",
"Search",
"Page Rank"
],
"authors": [
{
"affiliation": "Services Comput. Technol. & Syst. Lab. Cluster & Grid Comput. Lab., Huazhong Univ. of Sci. & Technol., Wuhan, China",
"fullName": "Wangxi Jia",
"givenName": null,
"surname": "Wangxi Jia",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Services Comput. Technol. & Syst. Lab. Cluster & Grid Comput. Lab., Huazhong Univ. of Sci. & Technol., Wuhan, China",
"fullName": "Hai Jin",
"givenName": null,
"surname": "Hai Jin",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Services Comput. Technol. & Syst. Lab. Cluster & Grid Comput. Lab., Huazhong Univ. of Sci. & Technol., Wuhan, China",
"fullName": "Xiaofei Liao",
"givenName": null,
"surname": "Xiaofei Liao",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "icoin",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2013-01-01T00:00:00",
"pubType": "proceedings",
"pages": "493-498",
"year": "2013",
"issn": "1976-7684",
"isbn": "978-1-4673-5740-1",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "06496428",
"articleId": "12OmNAhfIya",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "06496430",
"articleId": "12OmNAlvHR4",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/ncm/2008/3322/2/3322b531",
"title": "Mobile Semantic Search Using Personal Preference Filtering",
"doi": null,
"abstractUrl": "/proceedings-article/ncm/2008/3322b531/12OmNBtCCAk",
"parentPublication": {
"id": "proceedings/ncm/2008/3322/2",
"title": "Networked Computing and Advanced Information Management, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ictai/2012/0227/1/06495064",
"title": "Articulating Decision Maker's Preference Information within Multiobjective Artificial Immune Systems",
"doi": null,
"abstractUrl": "/proceedings-article/ictai/2012/06495064/12OmNCf1Dv7",
"parentPublication": {
"id": "proceedings/ictai/2012/0227/1",
"title": "2012 IEEE 24th International Conference on Tools with Artificial Intelligence (ICTAI 2012)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iscid/2009/3865/1/3865a268",
"title": "Extracting Query Expansion Terms Based on User's Search Behavior",
"doi": null,
"abstractUrl": "/proceedings-article/iscid/2009/3865a268/12OmNwMFMjj",
"parentPublication": {
"id": "proceedings/iscid/2009/3865/1",
"title": "Computational Intelligence and Design, International Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/csc/2011/1635/0/06138552",
"title": "Modeling user's preference in folksonomy for personalized search",
"doi": null,
"abstractUrl": "/proceedings-article/csc/2011/06138552/12OmNwtWfJl",
"parentPublication": {
"id": "proceedings/csc/2011/1635/0",
"title": "2011 International Conference on Cloud and Service Computing (CSC 2011)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/dsc/2016/1192/0/1192a508",
"title": "A Personalized Microblog Search Model Considering User-Author Relationship",
"doi": null,
"abstractUrl": "/proceedings-article/dsc/2016/1192a508/12OmNzcPAjB",
"parentPublication": {
"id": "proceedings/dsc/2016/1192/0",
"title": "2016 IEEE First International Conference on Data Science in Cyberspace (DSC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2014/02/ttk2014020376",
"title": "Learning Conditional Preference Networks from Inconsistent Examples",
"doi": null,
"abstractUrl": "/journal/tk/2014/02/ttk2014020376/13rRUxBJhnc",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2017/07/07852459",
"title": "Query Expansion with Enriched User Profiles for Personalized Search Utilizing Folksonomy Data",
"doi": null,
"abstractUrl": "/journal/tk/2017/07/07852459/13rRUxjQyvZ",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/jcdl/2019/1547/0/154700a404",
"title": "Recommending Personalized Search Terms for Assisting Exploratory Website Search",
"doi": null,
"abstractUrl": "/proceedings-article/jcdl/2019/154700a404/1ckrEtkp7Y4",
"parentPublication": {
"id": "proceedings/jcdl/2019/1547/0",
"title": "2019 ACM/IEEE Joint Conference on Digital Libraries (JCDL)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ispa-bdcloud-socialcom-sustaincom/2019/4328/0/09047398",
"title": "Parallelized Top-k Route Search with User's Preferences",
"doi": null,
"abstractUrl": "/proceedings-article/ispa-bdcloud-socialcom-sustaincom/2019/09047398/1iC6FiO1DSU",
"parentPublication": {
"id": "proceedings/ispa-bdcloud-socialcom-sustaincom/2019/4328/0",
"title": "2019 IEEE Intl Conf on Parallel & Distributed Processing with Applications, Big Data & Cloud Computing, Sustainable Computing & Communications, Social Computing & Networking (ISPA/BDCloud/SocialCom/SustainCom)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ickg/2020/8156/0/09194494",
"title": "Global and Personalized Query Probability for Obfuscation-Based Web Search",
"doi": null,
"abstractUrl": "/proceedings-article/ickg/2020/09194494/1n2nmZ0DCdq",
"parentPublication": {
"id": "proceedings/ickg/2020/8156/0",
"title": "2020 IEEE International Conference on Knowledge Graph (ICKG)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNzUPpvR",
"title": "2012 7th International Conference on Malicious and Unwanted Software",
"acronym": "malware",
"groupId": "1002525",
"volume": "0",
"displayVolume": "0",
"year": "2012",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNzcPAl5",
"doi": "10.1109/MALWARE.2012.6461014",
"title": "A scalable search index for binary files",
"normalizedTitle": "A scalable search index for binary files",
"abstract": "The ability to locate specific byte-sequences in large collections of binary files is important in many applications, especially malware analysis. However, it can be a time consuming process. Researchers and analysts, such as those at CERT, often have to search terabytes of data for characteristic patterns and signatures, which can take upwards of days to complete. Although many search systems, designed specifically to expedite text and metadata queries, exist, these tools are unsuitable for searching files containing arbitrary bytes. By using probabilistic techniques to pre-filter likely search candidates, we present a scalable architecture for searching and indexing terabyte-size collections of binary files. Our implementation performs searches in minutes that would required days to complete using iterative techniques. It also reduces storage costs by balancing the amount of data indexed with the total time required to conduct and verify a query.",
"abstracts": [
{
"abstractType": "Regular",
"content": "The ability to locate specific byte-sequences in large collections of binary files is important in many applications, especially malware analysis. However, it can be a time consuming process. Researchers and analysts, such as those at CERT, often have to search terabytes of data for characteristic patterns and signatures, which can take upwards of days to complete. Although many search systems, designed specifically to expedite text and metadata queries, exist, these tools are unsuitable for searching files containing arbitrary bytes. By using probabilistic techniques to pre-filter likely search candidates, we present a scalable architecture for searching and indexing terabyte-size collections of binary files. Our implementation performs searches in minutes that would required days to complete using iterative techniques. It also reduces storage costs by balancing the amount of data indexed with the total time required to conduct and verify a query.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "The ability to locate specific byte-sequences in large collections of binary files is important in many applications, especially malware analysis. However, it can be a time consuming process. Researchers and analysts, such as those at CERT, often have to search terabytes of data for characteristic patterns and signatures, which can take upwards of days to complete. Although many search systems, designed specifically to expedite text and metadata queries, exist, these tools are unsuitable for searching files containing arbitrary bytes. By using probabilistic techniques to pre-filter likely search candidates, we present a scalable architecture for searching and indexing terabyte-size collections of binary files. Our implementation performs searches in minutes that would required days to complete using iterative techniques. It also reduces storage costs by balancing the amount of data indexed with the total time required to conduct and verify a query.",
"fno": "06461014",
"keywords": [
"Indexes",
"Encoding",
"Bioinformatics",
"Open Source Software",
"Malware",
"Data Structures"
],
"authors": [
{
"affiliation": "CMU, USA",
"fullName": "Wesley Jin",
"givenName": "Wesley",
"surname": "Jin",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "CERT, USA",
"fullName": "Charles Hines",
"givenName": "Charles",
"surname": "Hines",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "CERT, USA",
"fullName": "Cory Cohen",
"givenName": "Cory",
"surname": "Cohen",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "CMU, USA",
"fullName": "Priya Narasimhan",
"givenName": "Priya",
"surname": "Narasimhan",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "malware",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2012-10-01T00:00:00",
"pubType": "proceedings",
"pages": "94-103",
"year": "2012",
"issn": null,
"isbn": "978-1-4673-4880-5",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "06461017",
"articleId": "12OmNzlUKrP",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "06461011",
"articleId": "12OmNwFicXz",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/spire/2000/0746/0/07460209",
"title": "Parallel Search using Partitioned Inverted Files",
"doi": null,
"abstractUrl": "/proceedings-article/spire/2000/07460209/12OmNAolGPU",
"parentPublication": {
"id": "proceedings/spire/2000/0746/0",
"title": "String Processing and Information Retrieval, International Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/jcdl/2004/832/0/01336216",
"title": "Digital library access via image similarity search",
"doi": null,
"abstractUrl": "/proceedings-article/jcdl/2004/01336216/12OmNvTk02W",
"parentPublication": {
"id": "proceedings/jcdl/2004/832/0",
"title": "Proceedings of the Fourth ACM/IEEE Joint Conference on Digital Libraries",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/msr/2013/0345/0/06624047",
"title": "An unabridged source code dataset for research in software reuse",
"doi": null,
"abstractUrl": "/proceedings-article/msr/2013/06624047/12OmNy1SFCC",
"parentPublication": {
"id": "proceedings/msr/2013/0345/0",
"title": "2013 10th IEEE Working Conference on Mining Software Repositories (MSR 2013)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iwsc/2017/6595/0/07880504",
"title": "Web-service for finding cloned files using b-bit minwise hashing",
"doi": null,
"abstractUrl": "/proceedings-article/iwsc/2017/07880504/12OmNzEVRYl",
"parentPublication": {
"id": "proceedings/iwsc/2017/6595/0",
"title": "2017 IEEE 11th International Workshop on Software Clones (IWSC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ts/1990/12/e1433",
"title": "Efficient Expressions for Completely and Partly Unsuccessful Batched Search of Tree-Structured Files",
"doi": null,
"abstractUrl": "/journal/ts/1990/12/e1433/13rRUxOvebq",
"parentPublication": {
"id": "trans/ts",
"title": "IEEE Transactions on Software Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ts/1989/06/e0794",
"title": "Expressions for Completely and Partly Unsuccessful Batched Search of Sequential and Tree-Structured Files",
"doi": null,
"abstractUrl": "/journal/ts/1989/06/e0794/13rRUypp59g",
"parentPublication": {
"id": "trans/ts",
"title": "IEEE Transactions on Software Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ithings-greencom-cpscom-smartdata/2017/3066/0/08276781",
"title": "Using Open Source Forensic Carving Tools on Split DD and EWF Files",
"doi": null,
"abstractUrl": "/proceedings-article/ithings-greencom-cpscom-smartdata/2017/08276781/17D45WHONkM",
"parentPublication": {
"id": "proceedings/ithings-greencom-cpscom-smartdata/2017/3066/0",
"title": "2017 IEEE International Conference on Internet of Things (iThings) and IEEE Green Computing and Communications (GreenCom) and IEEE Cyber, Physical and Social Computing (CPSCom) and IEEE Smart Data (SmartData)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icde/2019/7474/0/747400b790",
"title": "DirectLoad: A Fast Web-Scale Index System Across Large Regional Centers",
"doi": null,
"abstractUrl": "/proceedings-article/icde/2019/747400b790/1aDSYHgK4A8",
"parentPublication": {
"id": "proceedings/icde/2019/7474/0",
"title": "2019 IEEE 35th International Conference on Data Engineering (ICDE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/acit-csii-bcd/2017/3302/0/3302a248",
"title": "Investigation of Coding Violations Focusing on Authorships of Source Files",
"doi": null,
"abstractUrl": "/proceedings-article/acit-csii-bcd/2017/3302a248/1cdOC3UTjs4",
"parentPublication": {
"id": "proceedings/acit-csii-bcd/2017/3302/0",
"title": "2017 5th Intl Conf on Applied Computing and Information Technology/4th Intl Conf on Computational Science/Intelligence and Applied Informatics/2nd Intl Conf on Big Data, Cloud Computing, Data Science (ACIT-CSII-BCD)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/trustcom/2020/4380/0/438000a818",
"title": "Scalable and Accurate Binary Code Search Method Based on Simhash and Partial Trace",
"doi": null,
"abstractUrl": "/proceedings-article/trustcom/2020/438000a818/1r549JhpD68",
"parentPublication": {
"id": "proceedings/trustcom/2020/4380/0",
"title": "2020 IEEE 19th International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNwKoZd6",
"title": "2017 18th IEEE/ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing (SNPD)",
"acronym": "snpd",
"groupId": "1001811",
"volume": "0",
"displayVolume": "0",
"year": "2017",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNzyGH69",
"doi": "10.1109/SNPD.2017.8022782",
"title": "Clustering search engine suggests by integrating a topic model and word embeddings",
"normalizedTitle": "Clustering search engine suggests by integrating a topic model and word embeddings",
"abstract": "The background of this paper is the issue of how to overview the knowledge of a given query keyword. Especially, we focus on concerns of those who search for Web pages with a given query keyword. The Web search information needs of a given query keyword is collected through search engine suggests. Given a query keyword, we collect up to around 1,000 suggests, while many of them are redundant. We cluster redundant search engine suggests based on a topic model. However, one limitation of the topic model based clustering of search engine suggests is that the granularity of the topics, i.e., the clusters of search engine suggests, is too coarse. In order to overcome the problem of the coarse-grained clusters of search engine suggests, this paper further applies the word embedding technique to the Web pages used during the training of the topic model, in addition to the text data of the whole Japanese version of Wikipedia. Then, we examine the word embedding based similarity between search engines suggests and further classify search engine suggests within a single topic into finer-grained subtopics based on the similarity of word embeddings. Evaluation results prove that the proposed approach performs well in the task of subtopic clustering of search engine suggests.",
"abstracts": [
{
"abstractType": "Regular",
"content": "The background of this paper is the issue of how to overview the knowledge of a given query keyword. Especially, we focus on concerns of those who search for Web pages with a given query keyword. The Web search information needs of a given query keyword is collected through search engine suggests. Given a query keyword, we collect up to around 1,000 suggests, while many of them are redundant. We cluster redundant search engine suggests based on a topic model. However, one limitation of the topic model based clustering of search engine suggests is that the granularity of the topics, i.e., the clusters of search engine suggests, is too coarse. In order to overcome the problem of the coarse-grained clusters of search engine suggests, this paper further applies the word embedding technique to the Web pages used during the training of the topic model, in addition to the text data of the whole Japanese version of Wikipedia. Then, we examine the word embedding based similarity between search engines suggests and further classify search engine suggests within a single topic into finer-grained subtopics based on the similarity of word embeddings. Evaluation results prove that the proposed approach performs well in the task of subtopic clustering of search engine suggests.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "The background of this paper is the issue of how to overview the knowledge of a given query keyword. Especially, we focus on concerns of those who search for Web pages with a given query keyword. The Web search information needs of a given query keyword is collected through search engine suggests. Given a query keyword, we collect up to around 1,000 suggests, while many of them are redundant. We cluster redundant search engine suggests based on a topic model. However, one limitation of the topic model based clustering of search engine suggests is that the granularity of the topics, i.e., the clusters of search engine suggests, is too coarse. In order to overcome the problem of the coarse-grained clusters of search engine suggests, this paper further applies the word embedding technique to the Web pages used during the training of the topic model, in addition to the text data of the whole Japanese version of Wikipedia. Then, we examine the word embedding based similarity between search engines suggests and further classify search engine suggests within a single topic into finer-grained subtopics based on the similarity of word embeddings. Evaluation results prove that the proposed approach performs well in the task of subtopic clustering of search engine suggests.",
"fno": "08022782",
"keywords": [
"Search Engines",
"Web Pages",
"Encyclopedias",
"Electronic Publishing",
"Internet",
"Training",
"Search Engine Suggest",
"Overview",
"Clustering",
"Topic Model",
"Word Embeddings"
],
"authors": [
{
"affiliation": "Graduate School of Systems and Information Engineering, University of Tsukuba, 1-1-1 Tennodai, Tsukuba, 305-8573, Japan",
"fullName": "Tian Nie",
"givenName": "Tian",
"surname": "Nie",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Graduate School of Systems and Information Engineering, University of Tsukuba, 1-1-1 Tennodai, Tsukuba, 305-8573, Japan",
"fullName": "Yi Ding",
"givenName": "Yi",
"surname": "Ding",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Graduate School of Systems and Information Engineering, University of Tsukuba, 1-1-1 Tennodai, Tsukuba, 305-8573, Japan",
"fullName": "Chen Zhao",
"givenName": "Chen",
"surname": "Zhao",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Graduate School of Systems and Information Engineering, University of Tsukuba, 1-1-1 Tennodai, Tsukuba, 305-8573, Japan",
"fullName": "Youchao Lin",
"givenName": "Youchao",
"surname": "Lin",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Faculty of Engineering, Information and Systems, University of Tsukuba, 1-1-1 Tennodai, Tsukuba, 305-8573, Japan",
"fullName": "Takehito Utsuro",
"givenName": "Takehito",
"surname": "Utsuro",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Logworks Co., Ltd., 1-3-15, Yoyogi, Shibuya-ku, Tokyo, 151-0053, Japan",
"fullName": "Yasuhide Kawada",
"givenName": "Yasuhide",
"surname": "Kawada",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "snpd",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2017-06-01T00:00:00",
"pubType": "proceedings",
"pages": "581-586",
"year": "2017",
"issn": null,
"isbn": "978-1-5090-5504-3",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "08022781",
"articleId": "12OmNvStcIF",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "08022783",
"articleId": "12OmNzYeB1H",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/icdm/2016/5473/0/07837989",
"title": "Topic Discovery for Short Texts Using Word Embeddings",
"doi": null,
"abstractUrl": "/proceedings-article/icdm/2016/07837989/12OmNAWpywe",
"parentPublication": {
"id": "proceedings/icdm/2016/5473/0",
"title": "2016 IEEE 16th International Conference on Data Mining (ICDM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icsgea/2017/2813/0/2813a672",
"title": "Library Resource Vertical Search Engine Based on Ontology",
"doi": null,
"abstractUrl": "/proceedings-article/icsgea/2017/2813a672/12OmNAio74j",
"parentPublication": {
"id": "proceedings/icsgea/2017/2813/0",
"title": "2017 International Conference on Smart Grid and Electrical Automation (ICSGEA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/hicss/2008/3075/0/04438843",
"title": "Automatic New Topic Identification in Search Engine Transaction Logs  Using Multiple Linear Regression",
"doi": null,
"abstractUrl": "/proceedings-article/hicss/2008/04438843/12OmNAle6o9",
"parentPublication": {
"id": "proceedings/hicss/2008/3075/0",
"title": "Proceedings of the 41st Annual Hawaii International Conference on System Sciences (HICSS 2008)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/waina/2015/1775/0/1775a535",
"title": "Overviewing the Knowledge of a Query Keyword by Clustering Viewpoints of Web Search Information Needs",
"doi": null,
"abstractUrl": "/proceedings-article/waina/2015/1775a535/12OmNB1wkLc",
"parentPublication": {
"id": "proceedings/waina/2015/1775/0",
"title": "2015 IEEE 29th International Conference on Advanced Information Networking and Applications Workshops (WAINA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ialp/2009/3904/0/3904a091",
"title": "Foxinfo1.0: A Chinese Topic-Oriented Search Engine",
"doi": null,
"abstractUrl": "/proceedings-article/ialp/2009/3904a091/12OmNCeaPXw",
"parentPublication": {
"id": "proceedings/ialp/2009/3904/0",
"title": "Asian Language Processing, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/waina/2016/2461/0/2461a214",
"title": "An Empirical Study on Optimal Correlation between Market Share and Concerns on Companies Measured through Search Engine Suggests",
"doi": null,
"abstractUrl": "/proceedings-article/waina/2016/2461a214/12OmNvAAtzP",
"parentPublication": {
"id": "proceedings/waina/2016/2461/0",
"title": "2016 30th International Conference on Advanced Information Networking and Applications Workshops (WAINA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/waina/2016/2461/0/2461a455",
"title": "Selecting Web Search Results of Diverse Contents with Search Engine Suggests and a Topic Model",
"doi": null,
"abstractUrl": "/proceedings-article/waina/2016/2461a455/12OmNwtn3zF",
"parentPublication": {
"id": "proceedings/waina/2016/2461/0",
"title": "2016 30th International Conference on Advanced Information Networking and Applications Workshops (WAINA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ictai/2012/0227/1/06495133",
"title": "Extracting Knowledge from Web Search Engine Results",
"doi": null,
"abstractUrl": "/proceedings-article/ictai/2012/06495133/12OmNyNzhxF",
"parentPublication": {
"id": "proceedings/ictai/2012/0227/1",
"title": "2012 IEEE 24th International Conference on Tools with Artificial Intelligence (ICTAI 2012)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sera/2019/0798/0/08886775",
"title": "Searching Tourism Information by Using Vertical Search Engine Based on Nutch and Solr",
"doi": null,
"abstractUrl": "/proceedings-article/sera/2019/08886775/1ezRyCMTHwc",
"parentPublication": {
"id": "proceedings/sera/2019/0798/0",
"title": "2019 IEEE 17th International Conference on Software Engineering Research, Management and Applications (SERA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/bd/2022/01/08949739",
"title": "Fuzzy Deep Neural Learning Based on Goodman and Kruskal's Gamma for Search Engine Optimization",
"doi": null,
"abstractUrl": "/journal/bd/2022/01/08949739/1gi7oVev0UE",
"parentPublication": {
"id": "trans/bd",
"title": "IEEE Transactions on Big Data",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "1fHkuWTT1cs",
"title": "2019 IEEE International Conference on Computational Science and Engineering (CSE) and IEEE International Conference on Embedded and Ubiquitous Computing (EUC)",
"acronym": "cse-euc",
"groupId": "1002115",
"volume": "0",
"displayVolume": "0",
"year": "2019",
"__typename": "ProceedingType"
},
"article": {
"id": "1fHkwtB65CU",
"doi": "10.1109/CSE/EUC.2019.00049",
"title": "Search Prevention with Captcha Against Web Indexing: A Proof of Concept",
"normalizedTitle": "Search Prevention with Captcha Against Web Indexing: A Proof of Concept",
"abstract": "A website appears in search results based on web indexing conducted by a search engine bot (e.g., a web crawler). Some webpages do not want to be found easily because they include sensitive information. There are several methods to prevent web crawlers from indexing in search engine database. However, such webpages can still be indexed by malicious web crawlers. Through this study, we explore a paradox perspective on a new use of captchas for search prevention. Captchas are used to prevent web crawlers from indexing by converting sensitive words to captchas. We have implemented the web-based captcha conversion tool based on our search prevention algorithm. We also describe our proof of concept with the web-based chat application modified to utilize our algorithm. We have conducted the experiment to evaluate our idea on Google search engine with two versions of webpages, one containing plain text and another containing sensitive words converted to captchas. The experiment results show that the sensitive words on the captcha version of the webpages are unable to be found by Google's search engine, while the plain text versions are.",
"abstracts": [
{
"abstractType": "Regular",
"content": "A website appears in search results based on web indexing conducted by a search engine bot (e.g., a web crawler). Some webpages do not want to be found easily because they include sensitive information. There are several methods to prevent web crawlers from indexing in search engine database. However, such webpages can still be indexed by malicious web crawlers. Through this study, we explore a paradox perspective on a new use of captchas for search prevention. Captchas are used to prevent web crawlers from indexing by converting sensitive words to captchas. We have implemented the web-based captcha conversion tool based on our search prevention algorithm. We also describe our proof of concept with the web-based chat application modified to utilize our algorithm. We have conducted the experiment to evaluate our idea on Google search engine with two versions of webpages, one containing plain text and another containing sensitive words converted to captchas. The experiment results show that the sensitive words on the captcha version of the webpages are unable to be found by Google's search engine, while the plain text versions are.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "A website appears in search results based on web indexing conducted by a search engine bot (e.g., a web crawler). Some webpages do not want to be found easily because they include sensitive information. There are several methods to prevent web crawlers from indexing in search engine database. However, such webpages can still be indexed by malicious web crawlers. Through this study, we explore a paradox perspective on a new use of captchas for search prevention. Captchas are used to prevent web crawlers from indexing by converting sensitive words to captchas. We have implemented the web-based captcha conversion tool based on our search prevention algorithm. We also describe our proof of concept with the web-based chat application modified to utilize our algorithm. We have conducted the experiment to evaluate our idea on Google search engine with two versions of webpages, one containing plain text and another containing sensitive words converted to captchas. The experiment results show that the sensitive words on the captcha version of the webpages are unable to be found by Google's search engine, while the plain text versions are.",
"fno": "166400a219",
"keywords": [
"Information Retrieval",
"Internet",
"Search Engines",
"Security Of Data",
"Webpages",
"Web Indexing",
"Search Engine Bot",
"Web Crawler",
"Search Engine Database",
"Malicious Web Crawlers",
"Web Based Captcha Conversion Tool",
"Search Prevention Algorithm",
"Google Search Engine",
"Containing Sensitive Words",
"Captcha Version",
"CAPTCH As",
"Search Engines",
"Google",
"Crawlers",
"Web Pages",
"Indexing",
"Security",
"Captcha Web Index Search Engine Web Crawler Search Prevention Security"
],
"authors": [
{
"affiliation": "Arkansas State University",
"fullName": "Donghoon Kim",
"givenName": "Donghoon",
"surname": "Kim",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Arkansas State University",
"fullName": "Luke Sample",
"givenName": "Luke",
"surname": "Sample",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "cse-euc",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2019-08-01T00:00:00",
"pubType": "proceedings",
"pages": "219-224",
"year": "2019",
"issn": null,
"isbn": "978-1-7281-1664-8",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "166400a211",
"articleId": "1fHky5loIww",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "166400a225",
"articleId": "1fHkv6CdPdm",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/chinagrid/2013/5058/0/06623874",
"title": "An Incremental Crawler for Web Video Based on Content Longevity",
"doi": null,
"abstractUrl": "/proceedings-article/chinagrid/2013/06623874/12OmNAo45H8",
"parentPublication": {
"id": "proceedings/chinagrid/2013/5058/0",
"title": "2013 8th ChinaGrid Annual Conference (ChinaGrid)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ic3/2014/5172/0/06897224",
"title": "Focused crawling with ontology using semi-automatic tagging for relevancy",
"doi": null,
"abstractUrl": "/proceedings-article/ic3/2014/06897224/12OmNApcuAT",
"parentPublication": {
"id": "proceedings/ic3/2014/5172/0",
"title": "2014 Seventh International Conference on Contemporary Computing (IC3)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/micai/2008/3441/0/3441a393",
"title": "An Alternate Downloading Methodology of Webpages",
"doi": null,
"abstractUrl": "/proceedings-article/micai/2008/3441a393/12OmNBghtr6",
"parentPublication": {
"id": "proceedings/micai/2008/3441/0",
"title": "2008 Seventh Mexican International Conference on Artificial Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccct/2012/3149/0/06394657",
"title": "An Ontology-Based Topical Crawling Algorithm for Accessing Deep Web Content",
"doi": null,
"abstractUrl": "/proceedings-article/iccct/2012/06394657/12OmNwErpJJ",
"parentPublication": {
"id": "proceedings/iccct/2012/3149/0",
"title": "2012 3rd International Conference on Computer and Communication Technology (ICCCT 2012)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sp/2016/0824/0/0824a743",
"title": "Cloak of Visibility: Detecting When Machines Browse a Different Web",
"doi": null,
"abstractUrl": "/proceedings-article/sp/2016/0824a743/12OmNyuPKYn",
"parentPublication": {
"id": "proceedings/sp/2016/0824/0",
"title": "2016 IEEE Symposium on Security and Privacy (SP)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/aiccsa/2014/7100/0/07073287",
"title": "Topical search engine for Internet of Things",
"doi": null,
"abstractUrl": "/proceedings-article/aiccsa/2014/07073287/12OmNzlUKxO",
"parentPublication": {
"id": "proceedings/aiccsa/2014/7100/0",
"title": "2014 IEEE/ACS 11th International Conference on Computer Systems and Applications (AICCSA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/jcdl/2014/5569/0/06970146",
"title": "The Archival Acid Test: Evaluating archive performance on advanced HTML and JavaScript",
"doi": null,
"abstractUrl": "/proceedings-article/jcdl/2014/06970146/12OmNzn38WJ",
"parentPublication": {
"id": "proceedings/jcdl/2014/5569/0",
"title": "2014 IEEE/ACM Joint Conference on Digital Libraries (JCDL)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icws/2018/7247/0/724701a257",
"title": "Hitting Three Birds with One System: A Voice-Based CAPTCHA for the Modern User",
"doi": null,
"abstractUrl": "/proceedings-article/icws/2018/724701a257/13rRUx0gemR",
"parentPublication": {
"id": "proceedings/icws/2018/7247/0",
"title": "2018 IEEE International Conference on Web Services (ICWS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pst/2017/2487/0/248701a355",
"title": "Hiding Behind the Shoulders of Giants: Abusing Crawlers for Indirect Web Attacks",
"doi": null,
"abstractUrl": "/proceedings-article/pst/2017/248701a355/144U9bp5Zby",
"parentPublication": {
"id": "proceedings/pst/2017/2487/0",
"title": "2017 15th Annual Conference on Privacy, Security and Trust (PST)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/trustcom-bigdatase/2019/2777/0/277700a075",
"title": "A Survey of Research on CAPTCHA Designing and Breaking Techniques",
"doi": null,
"abstractUrl": "/proceedings-article/trustcom-bigdatase/2019/277700a075/1ezRuVFcxTq",
"parentPublication": {
"id": "proceedings/trustcom-bigdatase/2019/2777/0",
"title": "2019 18th IEEE International Conference On Trust, Security And Privacy In Computing And Communications/13th IEEE International Conference On Big Data Science And Engineering (TrustCom/BigDataSE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNBrDqDJ",
"title": "[Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science",
"acronym": "focs",
"groupId": "1000292",
"volume": "0",
"displayVolume": "0",
"year": "1988",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNwJgAJX",
"doi": "10.1109/SFCS.1988.21933",
"title": "Efficient parallel algorithms for chordal graphs",
"normalizedTitle": "Efficient parallel algorithms for chordal graphs",
"abstract": "The author gives efficient parallel algorithms for recognizing chordal graphs, finding a maximum clique and a maximum independent set in a chordal graph, finding an optimal coloring of a chordal graph, finding a breadth-first search tree and a depth-first search tree of a chordal graph, recognizing interval graphs, and testing interval graphs for isomorphism. The key to the results is an efficient parallel algorithm for finding a perfect elimination ordering.",
"abstracts": [
{
"abstractType": "Regular",
"content": "The author gives efficient parallel algorithms for recognizing chordal graphs, finding a maximum clique and a maximum independent set in a chordal graph, finding an optimal coloring of a chordal graph, finding a breadth-first search tree and a depth-first search tree of a chordal graph, recognizing interval graphs, and testing interval graphs for isomorphism. The key to the results is an efficient parallel algorithm for finding a perfect elimination ordering.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "The author gives efficient parallel algorithms for recognizing chordal graphs, finding a maximum clique and a maximum independent set in a chordal graph, finding an optimal coloring of a chordal graph, finding a breadth-first search tree and a depth-first search tree of a chordal graph, recognizing interval graphs, and testing interval graphs for isomorphism. The key to the results is an efficient parallel algorithm for finding a perfect elimination ordering.",
"fno": "021933",
"keywords": [
"Elimination Ordering",
"Parallel Algorithms",
"Chordal Graphs",
"Maximum Clique",
"Maximum Independent Set",
"Optimal Coloring",
"Breadth First Search Tree",
"Depth First Search Tree",
"Interval Graphs",
"Isomorphism"
],
"authors": [
{
"affiliation": "Harvard Univ., Cambridge, MA, USA",
"fullName": "P.N. Klein",
"givenName": "P.N.",
"surname": "Klein",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "focs",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "1988-10-01T00:00:00",
"pubType": "proceedings",
"pages": "150-161",
"year": "1988",
"issn": null,
"isbn": "0-8186-0877-3",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "021932",
"articleId": "12OmNBsue3P",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "021934",
"articleId": "12OmNBLdKHl",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/spdp/1992/3200/0/0242748",
"title": "A new framework for designing parallel algorithms on series parallel graphs",
"doi": null,
"abstractUrl": "/proceedings-article/spdp/1992/0242748/12OmNAkWvzs",
"parentPublication": {
"id": "proceedings/spdp/1992/3200/0",
"title": "Parallel and Distributed Processing, IEEE Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ipps/1992/2672/0/0223066",
"title": "Efficient parallel shortest path algorithms for k-chordal graphs",
"doi": null,
"abstractUrl": "/proceedings-article/ipps/1992/0223066/12OmNs0kyDQ",
"parentPublication": {
"id": "proceedings/ipps/1992/2672/0",
"title": "Parallel Processing Symposium, International",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/hpcasia/1997/7901/0/79010373",
"title": "Parallel Recognition of Doubly Chordal Graphs",
"doi": null,
"abstractUrl": "/proceedings-article/hpcasia/1997/79010373/12OmNvzJFTu",
"parentPublication": {
"id": "proceedings/hpcasia/1997/7901/0",
"title": "High Performance Computing and Grid in Asia Pacific Region, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/hicss/1994/5090/2/00323270",
"title": "Efficient parallel algorithms on chordal graphs with a sparse tree representation",
"doi": null,
"abstractUrl": "/proceedings-article/hicss/1994/00323270/12OmNx3Zjj2",
"parentPublication": {
"id": "proceedings/hicss/1994/5090/2",
"title": "Proceedings of the Twenty-Seventh Annual Hawaii International Conference on System Sciences",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/itcc/2003/1916/0/19160320",
"title": "Distance-Hereditary Embeddings of Circulant Graphs",
"doi": null,
"abstractUrl": "/proceedings-article/itcc/2003/19160320/12OmNyYm2E5",
"parentPublication": {
"id": "proceedings/itcc/2003/1916/0",
"title": "Information Technology: Coding and Computing, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpp/2012/4796/0/4796a058",
"title": "A Novel Multithreaded Algorithm for Extracting Maximal Chordal Subgraphs",
"doi": null,
"abstractUrl": "/proceedings-article/icpp/2012/4796a058/12OmNz2TCFA",
"parentPublication": {
"id": "proceedings/icpp/2012/4796/0",
"title": "2012 41st International Conference on Parallel Processing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ipdps/2001/0990/1/099010035a",
"title": "Parallel Algorithms for Hamiltonian 2 -Separator Chordal Graphs",
"doi": null,
"abstractUrl": "/proceedings-article/ipdps/2001/099010035a/12OmNzFMFlN",
"parentPublication": {
"id": "proceedings/ipdps/2001/0990/1",
"title": "Parallel and Distributed Processing Symposium, International",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/2011/04/ttb2011040912",
"title": "Extensions and Improvements to the Chordal Graph Approach to the Multistate Perfect Phylogeny Problem",
"doi": null,
"abstractUrl": "/journal/tb/2011/04/ttb2011040912/13rRUwInvx8",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tc/1981/04/01675777",
"title": "Analysis of Chordal Ring Network",
"doi": null,
"abstractUrl": "/journal/tc/1981/04/01675777/13rRUxBrGfH",
"parentPublication": {
"id": "trans/tc",
"title": "IEEE Transactions on Computers",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tc/1988/10/t1178",
"title": "NC Algorithms for Recognizing Chordal Graphs and k Trees",
"doi": null,
"abstractUrl": "/journal/tc/1988/10/t1178/13rRUxjQygl",
"parentPublication": {
"id": "trans/tc",
"title": "IEEE Transactions on Computers",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "1n2nh6feFVe",
"title": "2020 IEEE International Conference on Knowledge Graph (ICKG)",
"acronym": "ickg",
"groupId": "1821544",
"volume": "0",
"displayVolume": "0",
"year": "2020",
"__typename": "ProceedingType"
},
"article": {
"id": "1n2nl724Zd6",
"doi": "10.1109/ICBK50248.2020.00046",
"title": "Network Analysis of Technology Stocks using Market Correlation",
"normalizedTitle": "Network Analysis of Technology Stocks using Market Correlation",
"abstract": "In this paper, we propose to use network approaches to analyze correlation between stocks. Our essential goal is to directly answer four questions: (1) how stocks in certain industry sector are correlated to each other' (2) what are the characteristics of stock networks with respect to their market behavioral correlations, and (3) do stocks in an industry sector form meaningful groups, based on on their market behaviors based correlations, and (4) how robust a correlation based network analysis approach can be used to understand stocks as a graph. In order to provide clear answers to address the above questions, we used market correlation methods to generate stock graphs. Two community detection methods, Louvain Modularity and Walk Trap, were used to study the structure of the graphs. To further test the robustness of our model, we created another graph using different correlation threshold. In the experiment we detected twelve communities using Louvain Modularity method and they consisted of stocks from different industries. Even the smallest cluster, which included only 2-3 stocks contained stocks from different industries.",
"abstracts": [
{
"abstractType": "Regular",
"content": "In this paper, we propose to use network approaches to analyze correlation between stocks. Our essential goal is to directly answer four questions: (1) how stocks in certain industry sector are correlated to each other' (2) what are the characteristics of stock networks with respect to their market behavioral correlations, and (3) do stocks in an industry sector form meaningful groups, based on on their market behaviors based correlations, and (4) how robust a correlation based network analysis approach can be used to understand stocks as a graph. In order to provide clear answers to address the above questions, we used market correlation methods to generate stock graphs. Two community detection methods, Louvain Modularity and Walk Trap, were used to study the structure of the graphs. To further test the robustness of our model, we created another graph using different correlation threshold. In the experiment we detected twelve communities using Louvain Modularity method and they consisted of stocks from different industries. Even the smallest cluster, which included only 2-3 stocks contained stocks from different industries.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "In this paper, we propose to use network approaches to analyze correlation between stocks. Our essential goal is to directly answer four questions: (1) how stocks in certain industry sector are correlated to each other' (2) what are the characteristics of stock networks with respect to their market behavioral correlations, and (3) do stocks in an industry sector form meaningful groups, based on on their market behaviors based correlations, and (4) how robust a correlation based network analysis approach can be used to understand stocks as a graph. In order to provide clear answers to address the above questions, we used market correlation methods to generate stock graphs. Two community detection methods, Louvain Modularity and Walk Trap, were used to study the structure of the graphs. To further test the robustness of our model, we created another graph using different correlation threshold. In the experiment we detected twelve communities using Louvain Modularity method and they consisted of stocks from different industries. Even the smallest cluster, which included only 2-3 stocks contained stocks from different industries.",
"fno": "09194514",
"keywords": [
"Correlation Methods",
"Network Theory Graphs",
"Pattern Clustering",
"Random Processes",
"Stock Markets",
"Stock Networks",
"Market Behavioral Correlations",
"Industry Sector",
"Correlation Based Network Analysis Approach",
"Market Correlation Methods",
"Stock Graphs",
"Correlation Threshold",
"Technology Stocks Network Analysis",
"Community Detection Methods",
"Louvain Modularity Method",
"Walk Trap",
"Correlation",
"Industries",
"Stock Markets",
"Social Network Services",
"Support Vector Machines",
"Business",
"Data Models",
"Community Detection",
"Graph",
"Correlation Coefficient",
"Stock Market",
"Stock Clustering",
"Cluster Analysis"
],
"authors": [
{
"affiliation": "Florida Atlantic University,College of Business,Boca Raton,FL,USA,33431",
"fullName": "Lukasz Chmielewski",
"givenName": "Lukasz",
"surname": "Chmielewski",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Florida Atlantic University,College of Business,Boca Raton,FL,USA,33431",
"fullName": "Rafina Amin",
"givenName": "Rafina",
"surname": "Amin",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Florida Atlantic University,Dept. of Computer & Electrical Engineering and Computer Science,Boca Raton,FL,USA,33431",
"fullName": "Anak Wannaphaschaiyong",
"givenName": "Anak",
"surname": "Wannaphaschaiyong",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Florida Atlantic University,Dept. of Computer & Electrical Engineering and Computer Science,Boca Raton,FL,USA,33431",
"fullName": "Xingquan Zhu",
"givenName": "Xingquan",
"surname": "Zhu",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "ickg",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2020-08-01T00:00:00",
"pubType": "proceedings",
"pages": "267-274",
"year": "2020",
"issn": null,
"isbn": "978-1-7281-8156-1",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "09194494",
"articleId": "1n2nmZ0DCdq",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09194529",
"articleId": "1n2nkrX4j4c",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/bigcomp/2018/3649/0/364901a455",
"title": "Development of Stock Correlation Network Models Using Maximum Likelihood Method and Stock Big Data",
"doi": null,
"abstractUrl": "/proceedings-article/bigcomp/2018/364901a455/12OmNAGNCeE",
"parentPublication": {
"id": "proceedings/bigcomp/2018/3649/0",
"title": "2018 IEEE International Conference on Big Data and Smart Computing (BigComp)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iiki/2016/5952/0/5952a573",
"title": "Social Network-Based Stock Correlation Analysis and Prediction",
"doi": null,
"abstractUrl": "/proceedings-article/iiki/2016/5952a573/12OmNBEpnD4",
"parentPublication": {
"id": "proceedings/iiki/2016/5952/0",
"title": "2016 International Conference on Identification, Information and Knowledge in the Internet of Things (IIKI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cis/2012/4896/0/4896a387",
"title": "Analyses the Financial Data of Stocks Based Rough Set Theory",
"doi": null,
"abstractUrl": "/proceedings-article/cis/2012/4896a387/12OmNrIaehb",
"parentPublication": {
"id": "proceedings/cis/2012/4896/0",
"title": "2012 Eighth International Conference on Computational Intelligence and Security",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cso/2014/5372/0/5372a284",
"title": "Volatility Spillover Effects between Gold and Stocks Based on VAR-DCC-BVGARCH Model",
"doi": null,
"abstractUrl": "/proceedings-article/cso/2014/5372a284/12OmNs0TKJD",
"parentPublication": {
"id": "proceedings/cso/2014/5372/0",
"title": "2014 Seventh International Joint Conference on Computational Sciences and Optimization (CSO)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cit/2014/6239/0/6239a482",
"title": "Analysis on Stock Market Volatility with Collective Human Behaviors in Online Message Board",
"doi": null,
"abstractUrl": "/proceedings-article/cit/2014/6239a482/12OmNxVlTDL",
"parentPublication": {
"id": "proceedings/cit/2014/6239/0",
"title": "2014 IEEE International Conference on Computer and Information Technology (CIT)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/dcc/1994/5637/0/00305914",
"title": "Data compression techniques for stock market prediction",
"doi": null,
"abstractUrl": "/proceedings-article/dcc/1994/00305914/12OmNyL0TMg",
"parentPublication": {
"id": "proceedings/dcc/1994/5637/0",
"title": "Proceedings of IEEE Data Compression Conference (DCC'94)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cmcsn/2016/1093/0/1093a126",
"title": "Time-Series Analysis on the Impact Level upon Taiwan Stock Market with Events of Signing International Agreements",
"doi": null,
"abstractUrl": "/proceedings-article/cmcsn/2016/1093a126/12OmNyr8Yw2",
"parentPublication": {
"id": "proceedings/cmcsn/2016/1093/0",
"title": "2016 Third International Conference on Computing Measurement Control and Sensor Network (CMCSN)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/enic/2016/3455/0/07838051",
"title": "A Large Scale Study to Understand the Relation between Twitter and Financial Market",
"doi": null,
"abstractUrl": "/proceedings-article/enic/2016/07838051/12OmNzzP5HP",
"parentPublication": {
"id": "proceedings/enic/2016/3455/0",
"title": "2016 Third European Network Intelligence Conference (ENIC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icbk/2018/9125/0/912500a041",
"title": "Deep Co-Investment Network Learning for Financial Assets",
"doi": null,
"abstractUrl": "/proceedings-article/icbk/2018/912500a041/17D45XeKgua",
"parentPublication": {
"id": "proceedings/icbk/2018/9125/0",
"title": "2018 IEEE International Conference on Big Knowledge (ICBK)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icitbs/2019/1307/0/130700a309",
"title": "Stocks Analysis and Prediction Using Big Data Analytics",
"doi": null,
"abstractUrl": "/proceedings-article/icitbs/2019/130700a309/18Av2GCEqju",
"parentPublication": {
"id": "proceedings/icitbs/2019/1307/0",
"title": "2019 International Conference on Intelligent Transportation, Big Data & Smart City (ICITBS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNCf1Di9",
"title": "Proceedings 10th International Conference on Pattern Recognition",
"acronym": "icpr",
"groupId": "1000545",
"volume": "2",
"displayVolume": "2",
"year": "1990",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNB7LvIw",
"doi": "10.1109/ICPR.1990.119339",
"title": "The extended binary tree representation of binary image and its application to engineering drawing entry",
"normalizedTitle": "The extended binary tree representation of binary image and its application to engineering drawing entry",
"abstract": "A kind of tree structure called extended binary tree (EBT) is presented to represent the line adjacency graph (LAG) in order to reduce the computational complexities of LAG-based algorithms in binary image processing. The traversal and the storage of the EBT are discussed. Applications of the structure in engineering drawing entry are shown.<>",
"abstracts": [
{
"abstractType": "Regular",
"content": "A kind of tree structure called extended binary tree (EBT) is presented to represent the line adjacency graph (LAG) in order to reduce the computational complexities of LAG-based algorithms in binary image processing. The traversal and the storage of the EBT are discussed. Applications of the structure in engineering drawing entry are shown.<>",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "A kind of tree structure called extended binary tree (EBT) is presented to represent the line adjacency graph (LAG) in order to reduce the computational complexities of LAG-based algorithms in binary image processing. The traversal and the storage of the EBT are discussed. Applications of the structure in engineering drawing entry are shown.",
"fno": "00119339",
"keywords": [
"Computational Complexity",
"Computer Graphics",
"Computerised Picture Processing",
"Data Structures",
"Trees Mathematics",
"Extended Binary Tree Representation",
"Binary Image",
"Engineering Drawing Entry",
"Line Adjacency Graph",
"Traversal",
"Storage",
"Binary Trees",
"Engineering Drawings",
"Image Processing",
"Tree Data Structures",
"Tree Graphs",
"Computational Complexity",
"Least Squares Approximation",
"Application Software",
"Pixel",
"Joining Processes"
],
"authors": [
{
"affiliation": "Dept. of Electron. Eng., Tsinghua Univ., Beijing, China",
"fullName": "Bin Yu",
"givenName": null,
"surname": "Bin Yu",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Dept. of Electron. Eng., Tsinghua Univ., Beijing, China",
"fullName": "Xinggang Lin",
"givenName": null,
"surname": "Xinggang Lin",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "icpr",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "1990-01-01T00:00:00",
"pubType": "proceedings",
"pages": "109,110,111,112,113,114",
"year": "1990",
"issn": null,
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "00119338",
"articleId": "12OmNBbaH8b",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "00119340",
"articleId": "12OmNrHjqNN",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/icpr/1988/0878/0/00028296",
"title": "Linear binary tree",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/1988/00028296/12OmNAJVcE0",
"parentPublication": {
"id": "proceedings/icpr/1988/0878/0",
"title": "9th International Conference on Pattern Recognition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/acssc/1993/4120/0/00342359",
"title": "Unbalanced non-binary tree-structured vector quantizers",
"doi": null,
"abstractUrl": "/proceedings-article/acssc/1993/00342359/12OmNBgz4yO",
"parentPublication": {
"id": "proceedings/acssc/1993/4120/0",
"title": "Proceedings of 27th Asilomar Conference on Signals, Systems and Computers",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ipps/1991/9167/0/00153819",
"title": "Congestion and fault tolerance of binary tree embeddings on hypercube",
"doi": null,
"abstractUrl": "/proceedings-article/ipps/1991/00153819/12OmNCmpcTP",
"parentPublication": {
"id": "proceedings/ipps/1991/9167/0",
"title": "Parallel Processing Symposium, International",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/glsv/1991/2170/0/00143936",
"title": "Area efficient binary tree layout",
"doi": null,
"abstractUrl": "/proceedings-article/glsv/1991/00143936/12OmNxzMnW8",
"parentPublication": {
"id": "proceedings/glsv/1991/2170/0",
"title": "Proceedings First Great Lakes Symposium on VLSI",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ifcsta/2009/3930/3/3930c455",
"title": "A SVM Text Classification Approch Based on Binary Tree",
"doi": null,
"abstractUrl": "/proceedings-article/ifcsta/2009/3930c455/12OmNy6HQYf",
"parentPublication": {
"id": null,
"title": null,
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ipps/1991/9167/0/00153818",
"title": "Link augmented binary (LAB)-tree: its structure, routing, and fault tolerance properties",
"doi": null,
"abstractUrl": "/proceedings-article/ipps/1991/00153818/12OmNyL0Tpu",
"parentPublication": {
"id": "proceedings/ipps/1991/9167/0",
"title": "Parallel Processing Symposium, International",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tc/1996/04/t0475",
"title": "Embedding an Arbitrary Binary Tree into the Star Graph",
"doi": null,
"abstractUrl": "/journal/tc/1996/04/t0475/13rRUIJcWw4",
"parentPublication": {
"id": "trans/tc",
"title": "IEEE Transactions on Computers",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tc/1977/11/01674757",
"title": "Traversing Binary Tree Structures with Shift-Register Memories",
"doi": null,
"abstractUrl": "/journal/tc/1977/11/01674757/13rRUx0xPYy",
"parentPublication": {
"id": "trans/tc",
"title": "IEEE Transactions on Computers",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tc/1988/11/t1461",
"title": "Binary Decision Tree Test Functions",
"doi": null,
"abstractUrl": "/journal/tc/1988/11/t1461/13rRUxYrbTx",
"parentPublication": {
"id": "trans/tc",
"title": "IEEE Transactions on Computers",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tc/1984/06/01676483",
"title": "Fault Tolerance in Binary Tree Architectures",
"doi": null,
"abstractUrl": "/journal/tc/1984/06/01676483/13rRUyeTVgV",
"parentPublication": {
"id": "trans/tc",
"title": "IEEE Transactions on Computers",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNBqMDAX",
"title": "Proceedings., 33rd Annual Symposium on Foundations of Computer Science",
"acronym": "focs",
"groupId": "1000292",
"volume": "0",
"displayVolume": "0",
"year": "1992",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNvRU0fV",
"doi": "10.1109/SFCS.1992.267814",
"title": "Drawing planar graphs using the lmc-ordering",
"normalizedTitle": "Drawing planar graphs using the lmc-ordering",
"abstract": "The author introduces a method to optimize the required area, minimum angle and number of bends of planar drawings of graphs on a grid. The main tool is a new type of ordering on the vertices and faces of triconnected planar graphs. With this method linear time and space algorithms can be designed for many graph drawing problems. He shows that every triconnected planar graph G can be drawn convexly with straight lines on an (2n-4)*(n-2) grid. If G has maximum degree four (three), then G can be drawn orthogonal with at most (/sup 3n///sub 2/)+3 (at most (/sup n///sub 2/)+1) bends on an n*n grid ((/sup n///sub 2/)*(/sup n///sub 2/) grid, respectively). If G has maximum degree d, then G can be drawn planar on an (2n-6)*(3n-6) grid with minimum angle larger than /sup 1///sub d-2/ radians and at most 5n-15 bends. These results give in some cases considerable improvements over previous results, and give new bounds in other cases. Several other results, e.g. concerning visibility representations, are included.",
"abstracts": [
{
"abstractType": "Regular",
"content": "The author introduces a method to optimize the required area, minimum angle and number of bends of planar drawings of graphs on a grid. The main tool is a new type of ordering on the vertices and faces of triconnected planar graphs. With this method linear time and space algorithms can be designed for many graph drawing problems. He shows that every triconnected planar graph G can be drawn convexly with straight lines on an (2n-4)*(n-2) grid. If G has maximum degree four (three), then G can be drawn orthogonal with at most (/sup 3n///sub 2/)+3 (at most (/sup n///sub 2/)+1) bends on an n*n grid ((/sup n///sub 2/)*(/sup n///sub 2/) grid, respectively). If G has maximum degree d, then G can be drawn planar on an (2n-6)*(3n-6) grid with minimum angle larger than /sup 1///sub d-2/ radians and at most 5n-15 bends. These results give in some cases considerable improvements over previous results, and give new bounds in other cases. Several other results, e.g. concerning visibility representations, are included.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "The author introduces a method to optimize the required area, minimum angle and number of bends of planar drawings of graphs on a grid. The main tool is a new type of ordering on the vertices and faces of triconnected planar graphs. With this method linear time and space algorithms can be designed for many graph drawing problems. He shows that every triconnected planar graph G can be drawn convexly with straight lines on an (2n-4)*(n-2) grid. If G has maximum degree four (three), then G can be drawn orthogonal with at most (/sup 3n///sub 2/)+3 (at most (/sup n///sub 2/)+1) bends on an n*n grid ((/sup n///sub 2/)*(/sup n///sub 2/) grid, respectively). If G has maximum degree d, then G can be drawn planar on an (2n-6)*(3n-6) grid with minimum angle larger than /sup 1///sub d-2/ radians and at most 5n-15 bends. These results give in some cases considerable improvements over previous results, and give new bounds in other cases. Several other results, e.g. concerning visibility representations, are included.",
"fno": "0267814",
"keywords": [
"Visibility Representations",
"Planar Graphs",
"Lmc Ordering",
"Required Area",
"Minimum Angle",
"Number Of Bends",
"Planar Drawings",
"Vertices",
"Faces",
"Triconnected Planar Graphs"
],
"authors": [
{
"affiliation": "Utrech Univ., Netherlands",
"fullName": "G. Kant",
"givenName": "G.",
"surname": "Kant",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "focs",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "1992-10-01T00:00:00",
"pubType": "proceedings",
"pages": "101-110",
"year": "1992",
"issn": null,
"isbn": "0-8186-2900-2",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "0267813",
"articleId": "12OmNAolGVd",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "0267815",
"articleId": "12OmNvDZF5e",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/focs/1988/0877/0/021972",
"title": "Fully dynamic techniques for point location and transitive closure in planar structures",
"doi": null,
"abstractUrl": "/proceedings-article/focs/1988/021972/12OmNAS9zHr",
"parentPublication": {
"id": "proceedings/focs/1988/0877/0",
"title": "[Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/focs/1993/4370/0/0366861",
"title": "A linear-processor polylog-time algorithm for shortest paths in planar graphs",
"doi": null,
"abstractUrl": "/proceedings-article/focs/1993/0366861/12OmNAlvHxV",
"parentPublication": {
"id": "proceedings/focs/1993/4370/0",
"title": "Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/apvis/2007/0808/0/04126227",
"title": "Straight-line grid drawings of planar graphs with linear area",
"doi": null,
"abstractUrl": "/proceedings-article/apvis/2007/04126227/12OmNBOCWfN",
"parentPublication": {
"id": "proceedings/apvis/2007/0808/0",
"title": "Asia-Pacific Symposium on Visualisation 2007",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/spdp/1991/2310/0/0218215",
"title": "Lower bounds and parallel algorithms for planar orthogonal grid drawings",
"doi": null,
"abstractUrl": "/proceedings-article/spdp/1991/0218215/12OmNrK9q1y",
"parentPublication": {
"id": "proceedings/spdp/1991/2310/0",
"title": "Parallel and Distributed Processing, IEEE Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/focs/1990/2082/0/089568",
"title": "Coloring inductive graphs on-line",
"doi": null,
"abstractUrl": "/proceedings-article/focs/1990/089568/12OmNvjgWvt",
"parentPublication": {
"id": "proceedings/focs/1990/2082/0",
"title": "Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/focs/1991/2445/0/0185440",
"title": "A deterministic parallel algorithm for planar graphs isomorphism",
"doi": null,
"abstractUrl": "/proceedings-article/focs/1991/0185440/12OmNvmowSn",
"parentPublication": {
"id": "proceedings/focs/1991/2445/0",
"title": "[1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/focs/2011/4571/0/4571a423",
"title": "Planar Graphs: Random Walks and Bipartiteness Testing",
"doi": null,
"abstractUrl": "/proceedings-article/focs/2011/4571a423/12OmNxFJXVI",
"parentPublication": {
"id": "proceedings/focs/2011/4571/0",
"title": "2011 IEEE 52nd Annual Symposium on Foundations of Computer Science",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/focs/1989/1982/0/063464",
"title": "Flow in planar graphs with multiple sources and sinks",
"doi": null,
"abstractUrl": "/proceedings-article/focs/1989/063464/12OmNzIUg15",
"parentPublication": {
"id": "proceedings/focs/1989/1982/0",
"title": "30th Annual Symposium on Foundations of Computer Science",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ipps/1991/9167/0/00153761",
"title": "Optimal EREW parallel algorithms for connectivity, ear decomposition and st-numbering of planar graphs",
"doi": null,
"abstractUrl": "/proceedings-article/ipps/1991/00153761/12OmNzuZUA5",
"parentPublication": {
"id": "proceedings/ipps/1991/9167/0",
"title": "Parallel Processing Symposium, International",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/focs/2019/4952/0/495200a876",
"title": "Parametric Shortest Paths in Planar Graphs",
"doi": null,
"abstractUrl": "/proceedings-article/focs/2019/495200a876/1grNBhOIiGI",
"parentPublication": {
"id": "proceedings/focs/2019/4952/0",
"title": "2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNx8wTfL",
"title": "ICPR 2008 19th International Conference on Pattern Recognition",
"acronym": "icpr",
"groupId": "1000545",
"volume": "0",
"displayVolume": "0",
"year": "2008",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNwE9Olz",
"doi": "10.1109/ICPR.2008.4761171",
"title": "Automated stroke ending analysis for drawing tool classification",
"normalizedTitle": "Automated stroke ending analysis for drawing tool classification",
"abstract": "This paper proposes a drawing tool recognition method based on features calculated from the shape of stroke endings. The application for this method is to help art historians to identify the drawing tool used for a drawing. Since the style of a drawing depends on the drawing tool used, drawing tool recognition is an important step toward a style analysis. A dominant feature of a drawn stroke is its ending. Several features regarding curvature, proportions etc. are calculated out of the shape of the endings. These features are then used to classify stroke endings with a SVM classifier.",
"abstracts": [
{
"abstractType": "Regular",
"content": "This paper proposes a drawing tool recognition method based on features calculated from the shape of stroke endings. The application for this method is to help art historians to identify the drawing tool used for a drawing. Since the style of a drawing depends on the drawing tool used, drawing tool recognition is an important step toward a style analysis. A dominant feature of a drawn stroke is its ending. Several features regarding curvature, proportions etc. are calculated out of the shape of the endings. These features are then used to classify stroke endings with a SVM classifier.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "This paper proposes a drawing tool recognition method based on features calculated from the shape of stroke endings. The application for this method is to help art historians to identify the drawing tool used for a drawing. Since the style of a drawing depends on the drawing tool used, drawing tool recognition is an important step toward a style analysis. A dominant feature of a drawn stroke is its ending. Several features regarding curvature, proportions etc. are calculated out of the shape of the endings. These features are then used to classify stroke endings with a SVM classifier.",
"fno": "04761171",
"keywords": [
"Art",
"Image Classification",
"Image Segmentation",
"Image Texture",
"Object Recognition",
"Support Vector Machines",
"Automated Stroke Ending Analysis",
"Drawing Tool Classification",
"Historian Art",
"Drawing Tool Recognition",
"Image Classification",
"SVM Classifier",
"Image Segmentation",
"Stroke Texture Analysis",
"Skeleton",
"Shape",
"Pattern Recognition",
"Art",
"Painting",
"Image Segmentation",
"Gray Scale",
"Joining Processes",
"Image Analysis",
"Pattern Analysis"
],
"authors": [
{
"affiliation": "Pattern Recognition and Image Processing Group, Institute of Computer Aided Automation, Vienna University of Technology, 1040, Austria",
"fullName": "Maria C. Vill",
"givenName": "Maria C.",
"surname": "Vill",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Pattern Recognition and Image Processing Group, Institute of Computer Aided Automation, Vienna University of Technology, 1040, Austria",
"fullName": "Robert Sablatnig",
"givenName": "Robert",
"surname": "Sablatnig",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "icpr",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2008-12-01T00:00:00",
"pubType": "proceedings",
"pages": "",
"year": "2008",
"issn": "1051-4651",
"isbn": "978-1-4244-2174-9",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "04761170",
"articleId": "12OmNCcbEaN",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "04761172",
"articleId": "12OmNzV70D6",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/icmlc/2003/7865/5/01260129",
"title": "An effective stroke extraction model for Chinese characters",
"doi": null,
"abstractUrl": "/proceedings-article/icmlc/2003/01260129/12OmNwF0BTg",
"parentPublication": {
"id": "proceedings/icmlc/2003/7865/1",
"title": "Proceedings of the 2003 International Conference on Machine Learning and Cybernetics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdar/1995/7128/2/71281059",
"title": "On-line cursive Kanji character recognition as stroke correspondence problem",
"doi": null,
"abstractUrl": "/proceedings-article/icdar/1995/71281059/12OmNzYNN33",
"parentPublication": {
"id": "proceedings/icdar/1995/7128/2",
"title": "Proceedings of 3rd International Conference on Document Analysis and Recognition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icfhr/2012/2262/0/06424366",
"title": "On the possibility of instance-based stroke recovery",
"doi": null,
"abstractUrl": "/proceedings-article/icfhr/2012/06424366/12OmNzvz6Hk",
"parentPublication": {
"id": "proceedings/icfhr/2012/2262/0",
"title": "2012 International Conference on Frontiers in Handwriting Recognition (ICFHR 2012)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2000/09/i0938",
"title": "Recovery of Drawing Order from Single-Stroke Handwriting Images",
"doi": null,
"abstractUrl": "/journal/tp/2000/09/i0938/13rRUEgarkt",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2017/07/07452668",
"title": "DrawFromDrawings: 2D Drawing Assistance via Stroke Interpolation with a Sketch Database",
"doi": null,
"abstractUrl": "/journal/tg/2017/07/07452668/13rRUwbJD4Q",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2017/12/07726076",
"title": "Data-Driven NPR Illustrations of Natural Flows in Chinese Painting",
"doi": null,
"abstractUrl": "/journal/tg/2017/12/07726076/13rRUwkfAZk",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2017/03/mcg2017030070",
"title": "ColorSketch: A Drawing Assistant for Generating Color Sketches from Photos",
"doi": null,
"abstractUrl": "/magazine/cg/2017/03/mcg2017030070/13rRUwkfB20",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icme/2018/1737/0/08486504",
"title": "Mural2Sketch: A Combined Line Drawing Generation Method for Ancient Mural Painting",
"doi": null,
"abstractUrl": "/proceedings-article/icme/2018/08486504/14jQfMYohcz",
"parentPublication": {
"id": "proceedings/icme/2018/1737/0",
"title": "2018 IEEE International Conference on Multimedia and Expo (ICME)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/2021/2812/0/281200o4184",
"title": "Neural Strokes: Stylized Line Drawing of 3D Shapes",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2021/281200o4184/1BmI4k03VrG",
"parentPublication": {
"id": "proceedings/iccv/2021/2812/0",
"title": "2021 IEEE/CVF International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2019/3293/0/329300b467",
"title": "Attention-Aware Multi-Stroke Style Transfer",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2019/329300b467/1gyrAK80fHq",
"parentPublication": {
"id": "proceedings/cvpr/2019/3293/0",
"title": "2019 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNvTjZWG",
"title": "Proceedings of 12th International Conference on Pattern Recognition",
"acronym": "icpr",
"groupId": "1000545",
"volume": "2",
"displayVolume": "0",
"year": "1994",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNx5GTZs",
"doi": "10.1109/ICPR.1994.576935",
"title": "Precise line detection from an engineering drawing using a figure fitting method based on contours and skeletons",
"normalizedTitle": "Precise line detection from an engineering drawing using a figure fitting method based on contours and skeletons",
"abstract": "This paper presents a new precise line detection technique that works efficiently even for a complicated engineering drawing. Both the contours and skeletons of line regions in an image include crucial information for extracting lines precisely from a drawing. The usage of both contours and skeletons enables the following features: 1) the detected lines are hardly affected by intersecting or touching other lines; 2) the detected lines maintain the shape of the figures in the original drawing; and 3) the connectivity of lines in an image is preserved in the detected figures. Experiments on actually used drawings are discussed in order to evaluate the technique described.",
"abstracts": [
{
"abstractType": "Regular",
"content": "This paper presents a new precise line detection technique that works efficiently even for a complicated engineering drawing. Both the contours and skeletons of line regions in an image include crucial information for extracting lines precisely from a drawing. The usage of both contours and skeletons enables the following features: 1) the detected lines are hardly affected by intersecting or touching other lines; 2) the detected lines maintain the shape of the figures in the original drawing; and 3) the connectivity of lines in an image is preserved in the detected figures. Experiments on actually used drawings are discussed in order to evaluate the technique described.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "This paper presents a new precise line detection technique that works efficiently even for a complicated engineering drawing. Both the contours and skeletons of line regions in an image include crucial information for extracting lines precisely from a drawing. The usage of both contours and skeletons enables the following features: 1) the detected lines are hardly affected by intersecting or touching other lines; 2) the detected lines maintain the shape of the figures in the original drawing; and 3) the connectivity of lines in an image is preserved in the detected figures. Experiments on actually used drawings are discussed in order to evaluate the technique described.",
"fno": "00576935",
"keywords": [
"Edge Detection",
"Line Detection",
"Engineering Drawing",
"Figure Fitting Method",
"Contours",
"Skeletons",
"Lines Connectivity",
"Dominant Points Extraction",
"Engineering Drawings",
"Skeleton",
"Shape",
"Data Mining",
"Research And Development",
"Character Recognition",
"Image Converters"
],
"authors": [
{
"affiliation": "Res. & Dev. Center, Toshiba Corp., Kawasaki, Japan",
"fullName": "S. Tanigawa",
"givenName": "S.",
"surname": "Tanigawa",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "O. Hori",
"givenName": "O.",
"surname": "Hori",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "S. Shimotsuji",
"givenName": "S.",
"surname": "Shimotsuji",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "icpr",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "1994-01-01T00:00:00",
"pubType": "proceedings",
"pages": "356,357,358,359,360",
"year": "1994",
"issn": null,
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "00576934",
"articleId": "12OmNBzRNpm",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "00576936",
"articleId": "12OmNzxgHum",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/icpr/1990/2062/1/00118152",
"title": "Drawing image understanding framework using state transition models",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/1990/00118152/12OmNBO3K9v",
"parentPublication": {
"id": "proceedings/icpr/1990/2062/1",
"title": "Proceedings 10th International Conference on Pattern Recognition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/seaa/2014/5795/0/5795a459",
"title": "Workflow Skeletons: A Non-intrusive Approach for Facilitating Scientific Workflow Modeling",
"doi": null,
"abstractUrl": "/proceedings-article/seaa/2014/5795a459/12OmNBSSViB",
"parentPublication": {
"id": "proceedings/seaa/2014/5795/0",
"title": "2014 40th EUROMICRO Conference on Software Engineering and Advanced Applications (SEAA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdar/1993/4960/0/00395768",
"title": "Drawing image understanding system with capability of rule learning",
"doi": null,
"abstractUrl": "/proceedings-article/icdar/1993/00395768/12OmNC8uRmv",
"parentPublication": {
"id": "proceedings/icdar/1993/4960/0",
"title": "Proceedings of 2nd International Conference on Document Analysis and Recognition (ICDAR '93)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icme/2004/8603/2/01394339",
"title": "Copyright protection of architectural CAD drawing using the multiple watermarking scheme",
"doi": null,
"abstractUrl": "/proceedings-article/icme/2004/01394339/12OmNCcbEaM",
"parentPublication": {
"id": "proceedings/icme/2004/8603/2",
"title": "2004 IEEE International Conference on Multimedia and Expo (ICME)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/1990/2062/1/00118201",
"title": "A robust drawing recognition system based on contour shape analysis",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/1990/00118201/12OmNs0TKXt",
"parentPublication": {
"id": "proceedings/icpr/1990/2062/1",
"title": "Proceedings 10th International Conference on Pattern Recognition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/eait/2014/4272/0/4272a243",
"title": "A New Approach to Detect and Classify Graphic Primitives in Engineering Drawings",
"doi": null,
"abstractUrl": "/proceedings-article/eait/2014/4272a243/12OmNvB9FyR",
"parentPublication": {
"id": "proceedings/eait/2014/4272/0",
"title": "2014 Fourth International Conference of Emerging Applications of Information Technology (EAIT)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cbms/2015/6775/0/6775a054",
"title": "Stitched Multipanel Biomedical Figure Separation",
"doi": null,
"abstractUrl": "/proceedings-article/cbms/2015/6775a054/12OmNx6xHro",
"parentPublication": {
"id": "proceedings/cbms/2015/6775/0",
"title": "2015 IEEE 28th International Symposium on Computer-Based Medical Systems (CBMS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdar/1993/4960/0/00395716",
"title": "Raster-to-vector conversion by line fitting based on contours and skeletons",
"doi": null,
"abstractUrl": "/proceedings-article/icdar/1993/00395716/12OmNxG1yPC",
"parentPublication": {
"id": "proceedings/icdar/1993/4960/0",
"title": "Proceedings of 2nd International Conference on Document Analysis and Recognition (ICDAR '93)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ssiai/2006/0069/0/01633715",
"title": "On the Properties of Morphological Skeletons of Discrete Binary Image Using Double Structuring Elements",
"doi": null,
"abstractUrl": "/proceedings-article/ssiai/2006/01633715/12OmNy2rRWH",
"parentPublication": {
"id": "proceedings/ssiai/2006/0069/0",
"title": "7th IEEE Southwest Symposium on Image Analysis and Interpretation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icme/2007/1016/0/04284714",
"title": "Group Synchronization Control in a Remote Haptic Drawing System",
"doi": null,
"abstractUrl": "/proceedings-article/icme/2007/04284714/12OmNyjLoRT",
"parentPublication": {
"id": "proceedings/icme/2007/1016/0",
"title": "2007 International Conference on Multimedia & Expo",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNBpmDFm",
"title": "1988 IEEE Workshop on Languages for Automation@m_Symbiotic and Intelligent Robotics",
"acronym": "lfa",
"groupId": "1001853",
"volume": "0",
"displayVolume": "0",
"year": "1988",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNyGbIfh",
"doi": "10.1109/LFA.1988.24961",
"title": "Akrti: a system for drawing data structure",
"normalizedTitle": "Akrti: a system for drawing data structure",
"abstract": "A system for graphically displaying data structures created by programs during execution is described. Each built-in data type is displayed in a standard way. No additional programming on the part of the user is required to use the system. Special hints may be used, at run time, to declare record/point data structures as abstract data types (e.g. binary tree, linked list, stack, etc.). The drawing system uses these hints to invoke built-in algorithms to draw each abstract data type. If a record/point data structure does not fit into one of the special types, then it will be drawn as a graph. Picture attributes such as colors, orientation, and spacing can be changed by the user. Output can be displayed on either traditional terminals or through a window system.<>",
"abstracts": [
{
"abstractType": "Regular",
"content": "A system for graphically displaying data structures created by programs during execution is described. Each built-in data type is displayed in a standard way. No additional programming on the part of the user is required to use the system. Special hints may be used, at run time, to declare record/point data structures as abstract data types (e.g. binary tree, linked list, stack, etc.). The drawing system uses these hints to invoke built-in algorithms to draw each abstract data type. If a record/point data structure does not fit into one of the special types, then it will be drawn as a graph. Picture attributes such as colors, orientation, and spacing can be changed by the user. Output can be displayed on either traditional terminals or through a window system.<>",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "A system for graphically displaying data structures created by programs during execution is described. Each built-in data type is displayed in a standard way. No additional programming on the part of the user is required to use the system. Special hints may be used, at run time, to declare record/point data structures as abstract data types (e.g. binary tree, linked list, stack, etc.). The drawing system uses these hints to invoke built-in algorithms to draw each abstract data type. If a record/point data structure does not fit into one of the special types, then it will be drawn as a graph. Picture attributes such as colors, orientation, and spacing can be changed by the user. Output can be displayed on either traditional terminals or through a window system.",
"fno": "00024961",
"keywords": [
"Computer Graphics",
"Data Structures",
"Software Tools",
"Computer Graphics",
"Akrti",
"Data Structure",
"Built In Data Type",
"Abstract Data Types",
"Data Structures",
"Programming Profession",
"Debugging",
"Workstations",
"Engineering Drawings",
"Computer Displays",
"Data Engineering",
"Tree Data Structures",
"Binary Trees",
"Computer Architecture"
],
"authors": [
{
"affiliation": "Dept. of Comput. Eng. & Sci., Case Western Reserve Univ., Cleveland, OH, USA",
"fullName": "G.M. Radack",
"givenName": "G.M.",
"surname": "Radack",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Dept. of Comput. Eng. & Sci., Case Western Reserve Univ., Cleveland, OH, USA",
"fullName": "T. Desai",
"givenName": "T.",
"surname": "Desai",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "lfa",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "1988-01-01T00:00:00",
"pubType": "proceedings",
"pages": "116,117,118,119,120,121",
"year": "1988",
"issn": null,
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "00024960",
"articleId": "12OmNCwUmB1",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "00024962",
"articleId": "12OmNzahce2",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/aqsdt/1992/2620/0/00205858",
"title": "Graph visualization in software analysis",
"doi": null,
"abstractUrl": "/proceedings-article/aqsdt/1992/00205858/12OmNAlvHZD",
"parentPublication": {
"id": "proceedings/aqsdt/1992/2620/0",
"title": "Proceedings of the Second Symposium on Assessment of Quality Software Development Tools",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/1993/3880/0/00341067",
"title": "Interpreting the views in an engineering drawing",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/1993/00341067/12OmNAoUT0r",
"parentPublication": {
"id": "proceedings/cvpr/1993/3880/0",
"title": "Proceedings of IEEE Conference on Computer Vision and Pattern Recognition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/1988/0878/0/00028219",
"title": "A database capture system for mechanical drawings using an efficient multidimensional graphical data structure",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/1988/00028219/12OmNBSjJ6j",
"parentPublication": {
"id": "proceedings/icpr/1988/0878/0",
"title": "9th International Conference on Pattern Recognition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wcre/2013/2931/0/06671327",
"title": "MemPick: A tool for data structure detection",
"doi": null,
"abstractUrl": "/proceedings-article/wcre/2013/06671327/12OmNwdbVdX",
"parentPublication": {
"id": "proceedings/wcre/2013/2931/0",
"title": "2013 20th Working Conference on Reverse Engineering (WCRE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icde/2015/7964/0/07113307",
"title": "Bi-temporal Timeline Index: A data structure for Processing Queries on bi-temporal data",
"doi": null,
"abstractUrl": "/proceedings-article/icde/2015/07113307/12OmNx7ov1F",
"parentPublication": {
"id": "proceedings/icde/2015/7964/0",
"title": "2015 IEEE 31st International Conference on Data Engineering (ICDE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icci*cc/2017/0771/0/08109766",
"title": "Study on hydrocarbon of seismic data structure characteristics based on gray system theory",
"doi": null,
"abstractUrl": "/proceedings-article/icci*cc/2017/08109766/12OmNyUnEKZ",
"parentPublication": {
"id": "proceedings/icci*cc/2017/0771/0",
"title": "2017 IEEE 16th International Conference on Cognitive Informatics & Cognitive Computing (ICCI*CC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdar/1993/4960/0/00395599",
"title": "A multipurpose drawing understanding system with flexible object-oriented framework",
"doi": null,
"abstractUrl": "/proceedings-article/icdar/1993/00395599/12OmNyuPKXe",
"parentPublication": {
"id": "proceedings/icdar/1993/4960/0",
"title": "Proceedings of 2nd International Conference on Document Analysis and Recognition (ICDAR '93)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/jcit/1990/2078/0/00128270",
"title": "Programming the data structure accelerator",
"doi": null,
"abstractUrl": "/proceedings-article/jcit/1990/00128270/12OmNzV70n9",
"parentPublication": {
"id": "proceedings/jcit/1990/2078/0",
"title": "Proceedings of the 5th Jerusalem Conference on Information Technology 'Next Decade in Information Technology'",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/acssc/1988/9999/1/00754023",
"title": "A Hierarchical Data Structure To Support Diagnostic Testing",
"doi": null,
"abstractUrl": "/proceedings-article/acssc/1988/00754023/12OmNzdGnqO",
"parentPublication": {
"id": "proceedings/acssc/1988/9999/1",
"title": "Twenty-Second Asilomar Conference on Signals, Systems and Computers",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ts/1990/05/e0543",
"title": "A Framework for the Automated Drawing of Data Structure Diagrams",
"doi": null,
"abstractUrl": "/journal/ts/1990/05/e0543/13rRUB7a12C",
"parentPublication": {
"id": "trans/ts",
"title": "IEEE Transactions on Software Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNz2TCu6",
"title": "Computer Graphics International Conference",
"acronym": "cgi",
"groupId": "1000132",
"volume": "0",
"displayVolume": "0",
"year": "2003",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNyQ7FE8",
"doi": "10.1109/CGI.2003.1214484",
"title": "An Educational Tool for Basic Techniques in Beginner?s Pencil Drawing",
"normalizedTitle": "An Educational Tool for Basic Techniques in Beginner?s Pencil Drawing",
"abstract": "A picture is one of important research subjects in order to make our life spiritually rich. Most studies on pictures, however, only propose some substitute functions of actual drawing or painting materials. There is no system that evaluates pictures drawn by users and gives advice about them. We propose a learning support system for basic techniques in beginner?s pencil drawing. The proposed system receives a subject (motif) data set and an image of user?s sketch and returns advice to the user. The system is composed of the four subsystems: feature extraction of motifs, feature extraction of sketches, error identification, and generation and presentation of advice. We developed and experimented a prototype system limited to treat a basic motif and some principal advice. As a result, the validity of the proposed system was confirmed.",
"abstracts": [
{
"abstractType": "Regular",
"content": "A picture is one of important research subjects in order to make our life spiritually rich. Most studies on pictures, however, only propose some substitute functions of actual drawing or painting materials. There is no system that evaluates pictures drawn by users and gives advice about them. We propose a learning support system for basic techniques in beginner?s pencil drawing. The proposed system receives a subject (motif) data set and an image of user?s sketch and returns advice to the user. The system is composed of the four subsystems: feature extraction of motifs, feature extraction of sketches, error identification, and generation and presentation of advice. We developed and experimented a prototype system limited to treat a basic motif and some principal advice. As a result, the validity of the proposed system was confirmed.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "A picture is one of important research subjects in order to make our life spiritually rich. Most studies on pictures, however, only propose some substitute functions of actual drawing or painting materials. There is no system that evaluates pictures drawn by users and gives advice about them. We propose a learning support system for basic techniques in beginner?s pencil drawing. The proposed system receives a subject (motif) data set and an image of user?s sketch and returns advice to the user. The system is composed of the four subsystems: feature extraction of motifs, feature extraction of sketches, error identification, and generation and presentation of advice. We developed and experimented a prototype system limited to treat a basic motif and some principal advice. As a result, the validity of the proposed system was confirmed.",
"fno": "19460288",
"keywords": [
"Computer Aided Instruction In Sketching",
"Image Processing Of Pencil Drawings",
"Evaluation Of Pictures"
],
"authors": [
{
"affiliation": "Wakayama University",
"fullName": "Saeko Takagi",
"givenName": "Saeko",
"surname": "Takagi",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Wakayama University",
"fullName": "Noriyuki Matsuda",
"givenName": "Noriyuki",
"surname": "Matsuda",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Wakayama University",
"fullName": "Masato Soga",
"givenName": "Masato",
"surname": "Soga",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Wakayama University",
"fullName": "Hirokazu Taki",
"givenName": "Hirokazu",
"surname": "Taki",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "L.O.T Co., Ltd.",
"fullName": "Takashi Shima",
"givenName": "Takashi",
"surname": "Shima",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Wakayama University",
"fullName": "Fujiichi Yoshimoto",
"givenName": "Fujiichi",
"surname": "Yoshimoto",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "cgi",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2003-07-01T00:00:00",
"pubType": "proceedings",
"pages": "288",
"year": "2003",
"issn": "1530-1052",
"isbn": "0-7695-1946-6",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "19460282",
"articleId": "12OmNAXxWWD",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "19460294",
"articleId": "12OmNwdbV6F",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/icce/2002/1509/0/15090153",
"title": "The Proposal of the Technique of Error Visualization for a Learner?s Pencil Drawing",
"doi": null,
"abstractUrl": "/proceedings-article/icce/2002/15090153/12OmNAnMuu6",
"parentPublication": {
"id": "proceedings/icce/2002/1509/0",
"title": "Computers in Education, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/1990/2062/1/00118152",
"title": "Drawing image understanding framework using state transition models",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/1990/00118152/12OmNBO3K9v",
"parentPublication": {
"id": "proceedings/icpr/1990/2062/1",
"title": "Proceedings 10th International Conference on Pattern Recognition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccsee/2012/4647/3/4647c265",
"title": "B/S Based 2D Sketch System",
"doi": null,
"abstractUrl": "/proceedings-article/iccsee/2012/4647c265/12OmNBeRtOU",
"parentPublication": {
"id": "proceedings/iccsee/2012/4647/3",
"title": "Computer Science and Electronics Engineering, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ismvl/2016/9489/0/9489a200",
"title": "Study Support System of Character Drawing Considering Feeling Evaluation",
"doi": null,
"abstractUrl": "/proceedings-article/ismvl/2016/9489a200/12OmNBpmDBI",
"parentPublication": {
"id": "proceedings/ismvl/2016/9489/0",
"title": "2016 IEEE 46th International Symposium on Multiple-Valued Logic (ISMVL)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdar/1993/4960/0/00395768",
"title": "Drawing image understanding system with capability of rule learning",
"doi": null,
"abstractUrl": "/proceedings-article/icdar/1993/00395768/12OmNC8uRmv",
"parentPublication": {
"id": "proceedings/icdar/1993/4960/0",
"title": "Proceedings of 2nd International Conference on Document Analysis and Recognition (ICDAR '93)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icitcs/2013/2845/0/06717838",
"title": "Generation of Pencil Sketch Drawing",
"doi": null,
"abstractUrl": "/proceedings-article/icitcs/2013/06717838/12OmNx19jT5",
"parentPublication": {
"id": "proceedings/icitcs/2013/2845/0",
"title": "2013 International Conference on IT Convergence and Security (ICITCS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/itme/2015/8302/0/8302a448",
"title": "Discussion on Engineering Drawing Course Teaching Reform for Excellent Engineer Training",
"doi": null,
"abstractUrl": "/proceedings-article/itme/2015/8302a448/12OmNxG1yFy",
"parentPublication": {
"id": "proceedings/itme/2015/8302/0",
"title": "2015 7th International Conference on Information Technology in Medicine and Education (ITME)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/eidwt/2012/4734/0/4734a265",
"title": "Thinking Representation Tools for Science Education with Drawings",
"doi": null,
"abstractUrl": "/proceedings-article/eidwt/2012/4734a265/12OmNxuXcy4",
"parentPublication": {
"id": "proceedings/eidwt/2012/4734/0",
"title": "2012 Third International Conference on Emerging Intelligent Data and Web Technologies",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ccie/2010/4026/2/4026b166",
"title": "A Colored Pencil-Drawing Generating Method Based on Interactive Colorization",
"doi": null,
"abstractUrl": "/proceedings-article/ccie/2010/4026b166/12OmNzJbQRf",
"parentPublication": {
"id": "proceedings/ccie/2010/4026/2",
"title": "Computing, Control and Industrial Engineering, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/so/2009/03/mso2009030012",
"title": "Drawing Tools",
"doi": null,
"abstractUrl": "/magazine/so/2009/03/mso2009030012/13rRUILtJjL",
"parentPublication": {
"id": "mags/so",
"title": "IEEE Software",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNzw8jh9",
"title": "Proceedings of 1993 IEEE 17th International Computer Software and Applications Conference COMPSAC '93",
"acronym": "cmpsac",
"groupId": "1000143",
"volume": "0",
"displayVolume": "0",
"year": "1993",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNya72uS",
"doi": "10.1109/CMPSAC.1993.404192",
"title": "A method of drawing tree-structured program diagrams on the Euclidian plane",
"normalizedTitle": "A method of drawing tree-structured program diagrams on the Euclidian plane",
"abstract": "A tree-structured diagram is considered as a tree in which each node has four attributes: (1) width, (2) depth, (3) horizontal coordinate and (4) vertical coordinate. The placing problem of the tree-structured diagram satisfying certain given eumorphous conditions is called a tidy drawing problem. The eumorphous conditions of tree-structured diagrams, oriented to program diagrams, have been formulated by modifying the eumorphous conditions of trees. formalized eumorphous conditions and corresponding unformalized methods of placement on the integral lattice were developed by Ogura etal. (1992). In this paper, we introduce new eumorphous conditions on the Euclidian plane. We also formulate O(n)-time and O(n/sup 2/)-time practical algorithms to provide placements which satisfy new eumorphous conditions by modifying the former conditions on the integral lattice As a result, we have new relationships among the eurmorphous conditions.<>",
"abstracts": [
{
"abstractType": "Regular",
"content": "A tree-structured diagram is considered as a tree in which each node has four attributes: (1) width, (2) depth, (3) horizontal coordinate and (4) vertical coordinate. The placing problem of the tree-structured diagram satisfying certain given eumorphous conditions is called a tidy drawing problem. The eumorphous conditions of tree-structured diagrams, oriented to program diagrams, have been formulated by modifying the eumorphous conditions of trees. formalized eumorphous conditions and corresponding unformalized methods of placement on the integral lattice were developed by Ogura etal. (1992). In this paper, we introduce new eumorphous conditions on the Euclidian plane. We also formulate O(n)-time and O(n/sup 2/)-time practical algorithms to provide placements which satisfy new eumorphous conditions by modifying the former conditions on the integral lattice As a result, we have new relationships among the eurmorphous conditions.<>",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "A tree-structured diagram is considered as a tree in which each node has four attributes: (1) width, (2) depth, (3) horizontal coordinate and (4) vertical coordinate. The placing problem of the tree-structured diagram satisfying certain given eumorphous conditions is called a tidy drawing problem. The eumorphous conditions of tree-structured diagrams, oriented to program diagrams, have been formulated by modifying the eumorphous conditions of trees. formalized eumorphous conditions and corresponding unformalized methods of placement on the integral lattice were developed by Ogura etal. (1992). In this paper, we introduce new eumorphous conditions on the Euclidian plane. We also formulate O(n)-time and O(n/sup 2/)-time practical algorithms to provide placements which satisfy new eumorphous conditions by modifying the former conditions on the integral lattice As a result, we have new relationships among the eurmorphous conditions.",
"fno": "00404192",
"keywords": [
"Tree Data Structures",
"Computational Complexity",
"Graph Theory",
"Diagrams",
"Flowcharting",
"Computational Geometry",
"Tidy Drawing Problem",
"O N Time Practical Algorithms",
"Formalised Eumorphous Conditions",
"Tree Structured Program Diagrams",
"Euclidian Plane",
"Node",
"Attributes",
"Width",
"Depth",
"Horizontal Coordinate",
"Vertical Coordinate",
"Placing Problem",
"Eumorphous Conditions",
"Unformalized Methods",
"Integral Lattice",
"O N Sup 2 Time Practical Algorithms",
"Tree Graphs",
"Displays",
"Lattices",
"Binary Trees",
"Engineering Drawings",
"Mathematics",
"Shape",
"Graphics",
"Character Generation",
"Personal Communication Networks"
],
"authors": [
{
"affiliation": "Dept. of Inf. & Sci., Tokyo Denki Univ., Saitama, Japan",
"fullName": "Y. Miyadera",
"givenName": "Y.",
"surname": "Miyadera",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "K. Anzai",
"givenName": "K.",
"surname": "Anzai",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "H. Banba",
"givenName": "H.",
"surname": "Banba",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "cmpsac",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "1993-01-01T00:00:00",
"pubType": "proceedings",
"pages": "193,194,195,196,197,198,199,200,201",
"year": "1993",
"issn": null,
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "00404191",
"articleId": "12OmNAg7k19",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "00404193",
"articleId": "12OmNBKmXnz",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/icpr/1990/2062/2/00119339",
"title": "The extended binary tree representation of binary image and its application to engineering drawing entry",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/1990/00119339/12OmNB7LvIw",
"parentPublication": {
"id": "proceedings/icpr/1990/2062/2",
"title": "Proceedings 10th International Conference on Pattern Recognition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/acssc/1993/4120/0/00342359",
"title": "Unbalanced non-binary tree-structured vector quantizers",
"doi": null,
"abstractUrl": "/proceedings-article/acssc/1993/00342359/12OmNBgz4yO",
"parentPublication": {
"id": "proceedings/acssc/1993/4120/0",
"title": "Proceedings of 27th Asilomar Conference on Signals, Systems and Computers",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/snpd/2012/2120/0/06299333",
"title": "O(n) and O(n2) Time Algorithms for Drawing Problems of Tree-Structured Diagrams",
"doi": null,
"abstractUrl": "/proceedings-article/snpd/2012/06299333/12OmNBpmDMI",
"parentPublication": {
"id": "proceedings/snpd/2012/2120/0",
"title": "2012 13th ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel & Distributed Computing (SNPD 2012)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cec/2005/2277/0/22770050",
"title": "A Flexible Model for Tree-Structured Multi-commodity Markets",
"doi": null,
"abstractUrl": "/proceedings-article/cec/2005/22770050/12OmNwvDQxI",
"parentPublication": {
"id": "proceedings/cec/2005/2277/0",
"title": "Seventh IEEE International Conference on E-Commerce Technology (CEC'05)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdm/2003/1978/0/19780739",
"title": "Regulatory Element Discovery Using Tree-structured Models",
"doi": null,
"abstractUrl": "/proceedings-article/icdm/2003/19780739/12OmNxXl5AA",
"parentPublication": {
"id": "proceedings/icdm/2003/1978/0",
"title": "Third IEEE International Conference on Data Mining",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icip/1995/7310/3/73103292",
"title": "Vector quantization by packing of embedded truncated lattices",
"doi": null,
"abstractUrl": "/proceedings-article/icip/1995/73103292/12OmNySG3OZ",
"parentPublication": {
"id": "proceedings/icip/1995/7310/3",
"title": "Image Processing, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icassp/1991/0003/0/00150836",
"title": "A tree-structured piecewise linear adaptive filter",
"doi": null,
"abstractUrl": "/proceedings-article/icassp/1991/00150836/12OmNylKAMI",
"parentPublication": {
"id": "proceedings/icassp/1991/0003/0",
"title": "Acoustics, Speech, and Signal Processing, IEEE International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/snpd/2013/5005/0/5005a484",
"title": "Optimality and Complexity for Drawing Problems of Tree-Structured Diagrams",
"doi": null,
"abstractUrl": "/proceedings-article/snpd/2013/5005a484/12OmNzBOhT9",
"parentPublication": {
"id": "proceedings/snpd/2013/5005/0",
"title": "2013 14th ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing (SNPD)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/so/1989/02/s2031",
"title": "Design Specification in Japan: Tree-Structured Charts",
"doi": null,
"abstractUrl": "/magazine/so/1989/02/s2031/13rRUxN5eBj",
"parentPublication": {
"id": "mags/so",
"title": "IEEE Software",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icse/2022/9221/0/922100a150",
"title": "AST-Trans: Code Summarization with Efficient Tree-Structured Attention",
"doi": null,
"abstractUrl": "/proceedings-article/icse/2022/922100a150/1EmrVKRariU",
"parentPublication": {
"id": "proceedings/icse/2022/9221/0",
"title": "2022 IEEE/ACM 44th International Conference on Software Engineering (ICSE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNAo45Ci",
"title": "Proceedings of 2nd International Conference on Document Analysis and Recognition (ICDAR '93)",
"acronym": "icdar",
"groupId": "1000219",
"volume": "0",
"displayVolume": "0",
"year": "1993",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNyuPKXe",
"doi": "10.1109/ICDAR.1993.395599",
"title": "A multipurpose drawing understanding system with flexible object-oriented framework",
"normalizedTitle": "A multipurpose drawing understanding system with flexible object-oriented framework",
"abstract": "An object-oriented drawing understanding system named OO-Mudams, which can flexibly adapt to various types of drawings by defining their model, is proposed. OO-Mudams is a model-driven system, with reasoning engine, management of internal database for reasoning results, and model definition for users. By defining the models, the system can be customized to process various kinds of drawings including engineering drawings and layout drawings. In order to manage huge reasoning result space effectively, the system uses an efficient multidimensional data structure named BD-tree, and, to facilitate the reasoning process, the TMS (truth maintenance system) is used to maintain the dependency among reasoning results. OO-Mudams is characterized by its flexible object-oriented system structure and an object-oriented language for defining the model of target objects.<>",
"abstracts": [
{
"abstractType": "Regular",
"content": "An object-oriented drawing understanding system named OO-Mudams, which can flexibly adapt to various types of drawings by defining their model, is proposed. OO-Mudams is a model-driven system, with reasoning engine, management of internal database for reasoning results, and model definition for users. By defining the models, the system can be customized to process various kinds of drawings including engineering drawings and layout drawings. In order to manage huge reasoning result space effectively, the system uses an efficient multidimensional data structure named BD-tree, and, to facilitate the reasoning process, the TMS (truth maintenance system) is used to maintain the dependency among reasoning results. OO-Mudams is characterized by its flexible object-oriented system structure and an object-oriented language for defining the model of target objects.<>",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "An object-oriented drawing understanding system named OO-Mudams, which can flexibly adapt to various types of drawings by defining their model, is proposed. OO-Mudams is a model-driven system, with reasoning engine, management of internal database for reasoning results, and model definition for users. By defining the models, the system can be customized to process various kinds of drawings including engineering drawings and layout drawings. In order to manage huge reasoning result space effectively, the system uses an efficient multidimensional data structure named BD-tree, and, to facilitate the reasoning process, the TMS (truth maintenance system) is used to maintain the dependency among reasoning results. OO-Mudams is characterized by its flexible object-oriented system structure and an object-oriented language for defining the model of target objects.",
"fno": "00395599",
"keywords": [
"Object Oriented Programming",
"Object Oriented Databases",
"Tree Data Structures",
"Inference Mechanisms",
"Truth Maintenance",
"Engineering Graphics",
"Multipurpose Drawing Understanding System",
"Flexible Object Oriented Framework",
"OO Mudams",
"Model Driven System",
"Reasoning Engine",
"Reasoning Results",
"Model Definition",
"Engineering Drawings",
"Layout Drawings",
"Reasoning Result Space",
"Multidimensional Data Structure",
"BD Tree",
"TMS",
"Truth Maintenance System",
"Object Oriented Language",
"Engineering Drawings",
"Object Oriented Modeling",
"Object Oriented Databases",
"Image Databases",
"Image Converters",
"Data Mining",
"Engines",
"Data Structures",
"Multimedia Systems",
"Multimedia Databases"
],
"authors": [
{
"affiliation": "Tokyo Univ., Japan",
"fullName": "W. Wu",
"givenName": "W.",
"surname": "Wu",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Tokyo Univ., Japan",
"fullName": "M. Sakauchi",
"givenName": "M.",
"surname": "Sakauchi",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "icdar",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "1993-01-01T00:00:00",
"pubType": "proceedings",
"pages": "870,871,872,873",
"year": "1993",
"issn": null,
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "00395598",
"articleId": "12OmNA0vnRE",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "00395600",
"articleId": "12OmNz4SOs5",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/tools/1999/0393/0/03930471",
"title": "An Object-Oriented Design of a Multimedia Item Pool",
"doi": null,
"abstractUrl": "/proceedings-article/tools/1999/03930471/12OmNApu5ii",
"parentPublication": {
"id": "proceedings/tools/1999/0393/0",
"title": "Proceedings Technology of Object-Oriented Languages and Systems. TOOLS 31",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdar/1993/4960/0/00395715",
"title": "Adaptable drawing interpretation using object-oriented and constraint-based graphic specification",
"doi": null,
"abstractUrl": "/proceedings-article/icdar/1993/00395715/12OmNBO3K4i",
"parentPublication": {
"id": "proceedings/icdar/1993/4960/0",
"title": "Proceedings of 2nd International Conference on Document Analysis and Recognition (ICDAR '93)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/1990/2062/1/00118152",
"title": "Drawing image understanding framework using state transition models",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/1990/00118152/12OmNBO3K9v",
"parentPublication": {
"id": "proceedings/icpr/1990/2062/1",
"title": "Proceedings 10th International Conference on Pattern Recognition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/apsec/2000/0915/0/09150384",
"title": "Selecting an object-oriented process for student analysts",
"doi": null,
"abstractUrl": "/proceedings-article/apsec/2000/09150384/12OmNqC2uUm",
"parentPublication": {
"id": "proceedings/apsec/2000/0915/0",
"title": "Proceedings Seventh Asia-Pacific Software Engeering Conference. APSEC 2000",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wpc/1994/5647/0/00341244",
"title": "A tool for understanding object-oriented program dependencies",
"doi": null,
"abstractUrl": "/proceedings-article/wpc/1994/00341244/12OmNvA1hgR",
"parentPublication": {
"id": "proceedings/wpc/1994/5647/0",
"title": "Proceedings 1994 IEEE 3rd Workshop on Program Comprehension- WPC '94",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/apaqs/2000/0825/0/08250121",
"title": "Object Oriented Design Function Points",
"doi": null,
"abstractUrl": "/proceedings-article/apaqs/2000/08250121/12OmNvEQseX",
"parentPublication": {
"id": "proceedings/apaqs/2000/0825/0",
"title": "Asia-Pacific Conference on Quality Software",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdar/1995/7128/1/71280261",
"title": "An object-oriented model for drawing understanding and its ability of noise absorption",
"doi": null,
"abstractUrl": "/proceedings-article/icdar/1995/71280261/12OmNxcdG4e",
"parentPublication": {
"id": "proceedings/icdar/1995/7128/1",
"title": "Proceedings of 3rd International Conference on Document Analysis and Recognition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccl/1992/2585/0/00185494",
"title": "Constraint specification on object-oriented databases",
"doi": null,
"abstractUrl": "/proceedings-article/iccl/1992/00185494/12OmNyvoXgv",
"parentPublication": {
"id": "proceedings/iccl/1992/2585/0",
"title": "Proceedings of the 1992 International Conference on Computer Languages",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cmpsac/1993/4440/0/00404209",
"title": "Object-oriented database views for supporting multidisciplinary concurrent engineering",
"doi": null,
"abstractUrl": "/proceedings-article/cmpsac/1993/00404209/12OmNzxyiL5",
"parentPublication": {
"id": "proceedings/cmpsac/1993/4440/0",
"title": "Proceedings of 1993 IEEE 17th International Computer Software and Applications Conference COMPSAC '93",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ts/2000/07/e0594",
"title": "Toward Constraint-Object-Oriented Development",
"doi": null,
"abstractUrl": "/journal/ts/2000/07/e0594/13rRUwvT9hU",
"parentPublication": {
"id": "trans/ts",
"title": "IEEE Transactions on Software Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "1MrFLC1Kdb2",
"title": "2022 IEEE 34th International Conference on Tools with Artificial Intelligence (ICTAI)",
"acronym": "ictai",
"groupId": "10097829",
"volume": "0",
"displayVolume": "0",
"year": "2022",
"__typename": "ProceedingType"
},
"article": {
"id": "1MrG0VEcFKU",
"doi": "10.1109/ICTAI56018.2022.00171",
"title": "Automated Drawing Psychoanalysis via House-Tree-Person Test",
"normalizedTitle": "Automated Drawing Psychoanalysis via House-Tree-Person Test",
"abstract": "The increase of human psychological illness in today's fast paced and high stress world makes it essential to detect the warning signals of psychological problems. As the most representative drawing psychoanalysis method, House-Tree-Person (HTP) test is widely used in psychological assessment with the benefit of simplicity, non-verbal, and repeatability. HTP test can reveal the individual subconscious of the psychological state through the picture content of house, tree, and person drawn by the patient. Currently, HTP test is conducted by the therapist in person, which makes it time consuming and the results are mostly affected by the therapist's experience. Therefore, it is helpful and necessary to build an automated method to improve the objectivity, reliability, and efficiency of HTP test. In this paper, we propose an automated psychometric drawing screening method that forms the relationship between the psychological state and drawing feature. Specifically, we extract the key features including size, position, and shadow of the drawing, and then combine these features to construct a psychological state classifier. The proposed method can effectively screen out negative drawings for further diagnosis and treatment. Experiments are carried out on a builded dataset with the drawings from a psychological testing center of college. Experimental results demonstrate the effect and superiority of the proposed method.",
"abstracts": [
{
"abstractType": "Regular",
"content": "The increase of human psychological illness in today's fast paced and high stress world makes it essential to detect the warning signals of psychological problems. As the most representative drawing psychoanalysis method, House-Tree-Person (HTP) test is widely used in psychological assessment with the benefit of simplicity, non-verbal, and repeatability. HTP test can reveal the individual subconscious of the psychological state through the picture content of house, tree, and person drawn by the patient. Currently, HTP test is conducted by the therapist in person, which makes it time consuming and the results are mostly affected by the therapist's experience. Therefore, it is helpful and necessary to build an automated method to improve the objectivity, reliability, and efficiency of HTP test. In this paper, we propose an automated psychometric drawing screening method that forms the relationship between the psychological state and drawing feature. Specifically, we extract the key features including size, position, and shadow of the drawing, and then combine these features to construct a psychological state classifier. The proposed method can effectively screen out negative drawings for further diagnosis and treatment. Experiments are carried out on a builded dataset with the drawings from a psychological testing center of college. Experimental results demonstrate the effect and superiority of the proposed method.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "The increase of human psychological illness in today's fast paced and high stress world makes it essential to detect the warning signals of psychological problems. As the most representative drawing psychoanalysis method, House-Tree-Person (HTP) test is widely used in psychological assessment with the benefit of simplicity, non-verbal, and repeatability. HTP test can reveal the individual subconscious of the psychological state through the picture content of house, tree, and person drawn by the patient. Currently, HTP test is conducted by the therapist in person, which makes it time consuming and the results are mostly affected by the therapist's experience. Therefore, it is helpful and necessary to build an automated method to improve the objectivity, reliability, and efficiency of HTP test. In this paper, we propose an automated psychometric drawing screening method that forms the relationship between the psychological state and drawing feature. Specifically, we extract the key features including size, position, and shadow of the drawing, and then combine these features to construct a psychological state classifier. The proposed method can effectively screen out negative drawings for further diagnosis and treatment. Experiments are carried out on a builded dataset with the drawings from a psychological testing center of college. Experimental results demonstrate the effect and superiority of the proposed method.",
"fno": "974400b120",
"keywords": [],
"authors": [
{
"affiliation": "College of Control Science and Engineering, China University of Petroleum (East China),Qingdao,China",
"fullName": "Ting Pan",
"givenName": "Ting",
"surname": "Pan",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "College of Control Science and Engineering, China University of Petroleum (East China),Qingdao,China",
"fullName": "Xiaoming Zhao",
"givenName": "Xiaoming",
"surname": "Zhao",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "College of Control Science and Engineering, China University of Petroleum (East China),Qingdao,China",
"fullName": "Baodi Liu",
"givenName": "Baodi",
"surname": "Liu",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "College of Control Science and Engineering, China University of Petroleum (East China),Qingdao,China",
"fullName": "Weifeng Liu",
"givenName": "Weifeng",
"surname": "Liu",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "ictai",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2022-10-01T00:00:00",
"pubType": "proceedings",
"pages": "1120-1125",
"year": "2022",
"issn": null,
"isbn": "979-8-3503-9744-4",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "974400b112",
"articleId": "1MrG81oglfG",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "974400b126",
"articleId": "1MrFPg7wUH6",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/case/2007/1153/0/04341738",
"title": "Robot Drawing Techniques for Contoured Surface Using an Automated Sketching Platform",
"doi": null,
"abstractUrl": "/proceedings-article/case/2007/04341738/12OmNBOCWfO",
"parentPublication": {
"id": "proceedings/case/2007/1153/0",
"title": "3rd Annual IEEE Conference on Automation Science and Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/fit/2017/3567/0/356701a258",
"title": "Sketch-based Facial Expression Recognition for Human Figure Drawing Psychological Test",
"doi": null,
"abstractUrl": "/proceedings-article/fit/2017/356701a258/12OmNyKJihk",
"parentPublication": {
"id": "proceedings/fit/2017/3567/0",
"title": "2017 International Conference on Frontiers of Information Technology (FIT)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/snpd/2013/5005/0/5005a484",
"title": "Optimality and Complexity for Drawing Problems of Tree-Structured Diagrams",
"doi": null,
"abstractUrl": "/proceedings-article/snpd/2013/5005a484/12OmNzBOhT9",
"parentPublication": {
"id": "proceedings/snpd/2013/5005/0",
"title": "2013 14th ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing (SNPD)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/visapp/2014/8133/3/07295073",
"title": "Towards fully automated person re-identification",
"doi": null,
"abstractUrl": "/proceedings-article/visapp/2014/07295073/12OmNzSh19B",
"parentPublication": {
"id": "proceedings/visapp/2014/8133/2",
"title": "2014 International Conference on Computer Vision Theory and Applications (VISAPP)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icis/2010/4147/0/4147a395",
"title": "Development of a System for Drawing Test",
"doi": null,
"abstractUrl": "/proceedings-article/icis/2010/4147a395/12OmNzXWZDB",
"parentPublication": {
"id": "proceedings/icis/2010/4147/0",
"title": "Computer and Information Science, ACIS International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/rtcsa/2018/7759/0/775900a242",
"title": "Psychological Effects on Positional Relationships Between a Person and a Human-Following Robot",
"doi": null,
"abstractUrl": "/proceedings-article/rtcsa/2018/775900a242/17D45WrVg0W",
"parentPublication": {
"id": "proceedings/rtcsa/2018/7759/0",
"title": "2018 IEEE 24th International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdh/2022/8149/0/814900a001",
"title": "Automated Analysis of Drawing Process for Detecting Prodromal and Clinical Dementia",
"doi": null,
"abstractUrl": "/proceedings-article/icdh/2022/814900a001/1G6jH1RX61i",
"parentPublication": {
"id": "proceedings/icdh/2022/8149/0",
"title": "2022 IEEE International Conference on Digital Health (ICDH)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icemme/2019/5588/0/558800a240",
"title": "Does Leaders' Positive Emotion Increase Followers' Person-Job Fit: A Cross-Level Moderated Mediation Model",
"doi": null,
"abstractUrl": "/proceedings-article/icemme/2019/558800a240/1hrLnL9tqDu",
"parentPublication": {
"id": "proceedings/icemme/2019/5588/0",
"title": "2019 International Conference on Economic Management and Model Engineering (ICEMME)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ithings-greencom-cpscom-smartdata-cybermatics/2020/7647/0/764700a692",
"title": "Children's Drawing Psychological Analysis using Shallow Convolutional Neural Network",
"doi": null,
"abstractUrl": "/proceedings-article/ithings-greencom-cpscom-smartdata-cybermatics/2020/764700a692/1pVHl64Csz6",
"parentPublication": {
"id": "proceedings/ithings-greencom-cpscom-smartdata-cybermatics/2020/7647/0",
"title": "2020 International Conferences on Internet of Things (iThings) and IEEE Green Computing and Communications (GreenCom) and IEEE Cyber, Physical and Social Computing (CPSCom) and IEEE Smart Data (SmartData) and IEEE Congress on Cybermatics (Cybermatics)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2020/9134/0/913400a258",
"title": "An Indented Level-Based Tree Drawing Algorithm for Text Visualization",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2020/913400a258/1rSRebcByKs",
"parentPublication": {
"id": "proceedings/iv/2020/9134/0",
"title": "2020 24th International Conference Information Visualisation (IV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNzlD94V",
"title": "30th ACM/IEEE Design Automation Conference",
"acronym": "dac",
"groupId": "1000196",
"volume": "0",
"displayVolume": "0",
"year": "1993",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNApcuAQ",
"doi": "10.1109/DAC.1993.203982",
"title": "Optimal Graph Constraint Reduction for Symbolic Layout Compaction",
"normalizedTitle": "Optimal Graph Constraint Reduction for Symbolic Layout Compaction",
"abstract": "The symbolic layout compaction problem is often formulated as a linear program (LP). In order to reduce the execution time and memory usage, it is very important to reduce the size of the LP. Since most of the constraints in the LP are derived from physical separation and electrical connectivity requirements which can be expressed in the form of \"graph constraints\", we study the problem of graph constraint reduction, i.e. the problem of producing, for a given system of graph constraints, an \"equivalent\" system with fewer constraints. In this paper we first show a previous formulation of the graph constraint reduction problem is NP-complete. We also observe that such a formulation is overly restrictive in the sense that a maximum possible reduction is not always attainable. We then propose a new formulation of the problem and present a polynomial-time algorithm which always produces a maximum possible reduction.",
"abstracts": [
{
"abstractType": "Regular",
"content": "The symbolic layout compaction problem is often formulated as a linear program (LP). In order to reduce the execution time and memory usage, it is very important to reduce the size of the LP. Since most of the constraints in the LP are derived from physical separation and electrical connectivity requirements which can be expressed in the form of \"graph constraints\", we study the problem of graph constraint reduction, i.e. the problem of producing, for a given system of graph constraints, an \"equivalent\" system with fewer constraints. In this paper we first show a previous formulation of the graph constraint reduction problem is NP-complete. We also observe that such a formulation is overly restrictive in the sense that a maximum possible reduction is not always attainable. We then propose a new formulation of the problem and present a polynomial-time algorithm which always produces a maximum possible reduction.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "The symbolic layout compaction problem is often formulated as a linear program (LP). In order to reduce the execution time and memory usage, it is very important to reduce the size of the LP. Since most of the constraints in the LP are derived from physical separation and electrical connectivity requirements which can be expressed in the form of \"graph constraints\", we study the problem of graph constraint reduction, i.e. the problem of producing, for a given system of graph constraints, an \"equivalent\" system with fewer constraints. In this paper we first show a previous formulation of the graph constraint reduction problem is NP-complete. We also observe that such a formulation is overly restrictive in the sense that a maximum possible reduction is not always attainable. We then propose a new formulation of the problem and present a polynomial-time algorithm which always produces a maximum possible reduction.",
"fno": "01600255",
"keywords": [
"Compaction",
"Polynomials",
"Computer Science",
"Very Large Scale Integration",
"Equations"
],
"authors": [
{
"affiliation": "Department of Computer Science, University of Illinois at Urbana-Champaign, Urbana, IL",
"fullName": "Peichen Pan",
"givenName": null,
"surname": "Peichen Pan",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Sai-keung Dong",
"givenName": null,
"surname": "Sai-keung Dong",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "C.L. Liu",
"givenName": "C.L.",
"surname": "Liu",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "dac",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "1993-01-01T00:00:00",
"pubType": "proceedings",
"pages": "401,402,403,404,405,406",
"year": "1993",
"issn": "0738-100X",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "01600254",
"articleId": "12OmNB9t6jx",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "01600256",
"articleId": "12OmNxEjXW2",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/glsv/1991/2170/0/00143971",
"title": "Building block layout based on block compaction and two-adjacent-side channel router",
"doi": null,
"abstractUrl": "/proceedings-article/glsv/1991/00143971/12OmNBhpS1l",
"parentPublication": {
"id": "proceedings/glsv/1991/2170/0",
"title": "Proceedings First Great Lakes Symposium on VLSI",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/dac/1989/310/0/01586397",
"title": "Automatic Tub Region Generation for Symbolic Layout Compaction",
"doi": null,
"abstractUrl": "/proceedings-article/dac/1989/01586397/12OmNrJAe5D",
"parentPublication": {
"id": "proceedings/dac/1989/310/0",
"title": "26th ACM/IEEE Design Automation Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/dac/1986/0702/0/01586078",
"title": "Minplex - A Compactor that Minimizes the Bounding Rectangle and Individual Rectangles in a Layout",
"doi": null,
"abstractUrl": "/proceedings-article/dac/1986/01586078/12OmNvStcQK",
"parentPublication": {
"id": "proceedings/dac/1986/0702/0",
"title": "23rd ACM/IEEE Design Automation Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/dac/1993/577/0/01600253",
"title": "MSTC: A Method for Identifying Overconstraints during Hierarchical Compaction",
"doi": null,
"abstractUrl": "/proceedings-article/dac/1993/01600253/12OmNwE9ODh",
"parentPublication": {
"id": "proceedings/dac/1993/577/0",
"title": "30th ACM/IEEE Design Automation Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/date/2006/1/1/01657015",
"title": "Timing-Driven Cell Layout De-Compaction for Yield Optimization by Critical Area Minimization",
"doi": null,
"abstractUrl": "/proceedings-article/date/2006/01657015/12OmNx76THs",
"parentPublication": {
"id": "proceedings/date/2006/1/1",
"title": "2006 Design, Automation and Test in Europe",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/edac/1990/2024/0/00136644",
"title": "An efficient two-dimensional compaction algorithm for VLSI symbolic layout",
"doi": null,
"abstractUrl": "/proceedings-article/edac/1990/00136644/12OmNxEBzgT",
"parentPublication": {
"id": "proceedings/edac/1990/2024/0",
"title": "Proceedings of the European Design Automation Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccd/1989/1971/0/00063423",
"title": "A hierarchical constraint graph generation and compaction system for symbolic layout",
"doi": null,
"abstractUrl": "/proceedings-article/iccd/1989/00063423/12OmNxRF77M",
"parentPublication": {
"id": "proceedings/iccd/1989/1971/0",
"title": "Proceedings 1989 IEEE International Conference on Computer Design: VLSI in Computers and Processors",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/edac/1990/2024/0/00136642",
"title": "Optimal via-shifting in channel compaction",
"doi": null,
"abstractUrl": "/proceedings-article/edac/1990/00136642/12OmNxTmHJv",
"parentPublication": {
"id": "proceedings/edac/1990/2024/0",
"title": "Proceedings of the European Design Automation Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/dac/1983/0026/0/01585634",
"title": "An Algorithm to Compact a VLSI Symbolic Layout with Mixed Constraints",
"doi": null,
"abstractUrl": "/proceedings-article/dac/1983/01585634/12OmNxcMScD",
"parentPublication": {
"id": "proceedings/dac/1983/0026/0",
"title": "Design Automation Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccd/1991/2270/0/00139837",
"title": "A layout compaction algorithm with multiple grid constraints",
"doi": null,
"abstractUrl": "/proceedings-article/iccd/1991/00139837/12OmNzkuKFb",
"parentPublication": {
"id": "proceedings/iccd/1991/2270/0",
"title": "1991 IEEE International Conference on Computer Design: VLSI in Computers and Processors",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNBqMDAV",
"title": "Design Automation Conference",
"acronym": "dac",
"groupId": "1000196",
"volume": "0",
"displayVolume": "0",
"year": "1990",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNBSBkdV",
"doi": "10.1109/DAC.1990.114836",
"title": "A new min-cut placement algorithm for timing assurance layout design meeting net length constraint",
"normalizedTitle": "A new min-cut placement algorithm for timing assurance layout design meeting net length constraint",
"abstract": "A new VLSI min-cut placement algorithm is presented for timing assurance layout design. When critical nets are given net length constraints, the proposed algorithm can place cells so that the constraints may be met. This algorithm is built into the layout system for gate arrays, called GALOP. The application results are described for the case of clock skew control of an ECL 12K-gate array.",
"abstracts": [
{
"abstractType": "Regular",
"content": "A new VLSI min-cut placement algorithm is presented for timing assurance layout design. When critical nets are given net length constraints, the proposed algorithm can place cells so that the constraints may be met. This algorithm is built into the layout system for gate arrays, called GALOP. The application results are described for the case of clock skew control of an ECL 12K-gate array.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "A new VLSI min-cut placement algorithm is presented for timing assurance layout design. When critical nets are given net length constraints, the proposed algorithm can place cells so that the constraints may be met. This algorithm is built into the layout system for gate arrays, called GALOP. The application results are described for the case of clock skew control of an ECL 12K-gate array.",
"fno": "00114836",
"keywords": [
"Min Cut Placement Algorithm",
"Timing Assurance Layout Design",
"Net Length Constraint",
"GALOP",
"ECL 12 K Gate Array"
],
"authors": [
{
"affiliation": "Mitsubishi Electr. Corp., Hyogo, Japan",
"fullName": "Terai",
"givenName": null,
"surname": "Terai",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Mitsubishi Electr. Corp., Hyogo, Japan",
"fullName": "Takahashi",
"givenName": null,
"surname": "Takahashi",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Mitsubishi Electr. Corp., Hyogo, Japan",
"fullName": "Sato",
"givenName": null,
"surname": "Sato",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "dac",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "1990-06-01T00:00:00",
"pubType": "proceedings",
"pages": "96-102",
"year": "1990",
"issn": null,
"isbn": "0-89791-363-9",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "00114835",
"articleId": "12OmNBkfRju",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "00114837",
"articleId": "12OmNy3iFgg",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/iccad/1996/7597/0/75970205",
"title": "Minimum Replication Min-Cut Partitioning",
"doi": null,
"abstractUrl": "/proceedings-article/iccad/1996/75970205/12OmNAR1aZL",
"parentPublication": {
"id": "proceedings/iccad/1996/7597/0",
"title": "Computer-Aided Design, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icnc/2010/4277/0/4277a078",
"title": "Loop Performance Improvement for Min-cut Program Decomposition Method",
"doi": null,
"abstractUrl": "/proceedings-article/icnc/2010/4277a078/12OmNBO3Kaf",
"parentPublication": {
"id": "proceedings/icnc/2010/4277/0",
"title": "2010 First International Conference on Networking and Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/dac/1990/1363/0/00114912",
"title": "Automatic incorporation of on-chip testability circuits",
"doi": null,
"abstractUrl": "/proceedings-article/dac/1990/00114912/12OmNBUAvZq",
"parentPublication": {
"id": "proceedings/dac/1990/1363/0",
"title": "Design Automation Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdew/2005/2657/0/22851156",
"title": "Prediction of Protein Functions Based on Protein-Protein Interaction Networks: A Min-Cut Approach",
"doi": null,
"abstractUrl": "/proceedings-article/icdew/2005/22851156/12OmNClQ0Ai",
"parentPublication": {
"id": "proceedings/icdew/2005/2657/0",
"title": "21st International Conference on Data Engineering Workshops (ICDEW'05)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/dac/1988/0864/0/00014842",
"title": "The min-cut shuffle: toward a solution for the global effect problem of min-cut placement",
"doi": null,
"abstractUrl": "/proceedings-article/dac/1988/00014842/12OmNqHItFB",
"parentPublication": {
"id": "proceedings/dac/1988/0864/0",
"title": "Design Automation Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/dac/2004/2501/0/25010357",
"title": "Placement Feedback: A Concept and Method for Better Min-Cut Placements",
"doi": null,
"abstractUrl": "/proceedings-article/dac/2004/25010357/12OmNvDqsMN",
"parentPublication": {
"id": "proceedings/dac/2004/2501/0",
"title": "Design Automation Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/hpcasia/1997/7901/0/79010736",
"title": "Heuristic cell partitioning scheme based on min-cut scheme in cellular networks",
"doi": null,
"abstractUrl": "/proceedings-article/hpcasia/1997/79010736/12OmNxXUhQ4",
"parentPublication": {
"id": "proceedings/hpcasia/1997/7901/0",
"title": "High Performance Computing and Grid in Asia Pacific Region, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/codes/1997/7895/0/78950043",
"title": "Modifying Min-Cut for Hardware and Software Functional Partitioning",
"doi": null,
"abstractUrl": "/proceedings-article/codes/1997/78950043/12OmNyQpgV7",
"parentPublication": {
"id": "proceedings/codes/1997/7895/0",
"title": "Hardware/Software Co-Design, International Workshop on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/focs/1988/0877/0/021958",
"title": "An approximate max-flow min-cut theorem for uniform multicommodity flow problems with applications to approximation algorithms",
"doi": null,
"abstractUrl": "/proceedings-article/focs/1988/021958/12OmNzVXNZt",
"parentPublication": {
"id": "proceedings/focs/1988/0877/0",
"title": "[Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2010/06/ttp2010060988",
"title": "An Information-Theoretic Derivation of Min-Cut-Based Clustering",
"doi": null,
"abstractUrl": "/journal/tp/2010/06/ttp2010060988/13rRUwgQprM",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNzwpUaL",
"title": "2008 International Seminar on Business and Information Management (ISBIM 2008)",
"acronym": "isbim",
"groupId": "1002787",
"volume": "1",
"displayVolume": "1",
"year": "2008",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNBigFod",
"doi": "10.1109/ISBIM.2008.132",
"title": "Separation of Duty Constraint for Permission Based Delegation Model",
"normalizedTitle": "Separation of Duty Constraint for Permission Based Delegation Model",
"abstract": "In large enterprise software systems, users often need to delegate their authority to others. Permission base delegation model (PBDM) based on RBAC96 currently is the most attractive model to fulfill the delegation requirement since it supports partly delegation and multiple steps delegation. However in PBDM there is no explicit specification of the separation of duty (SOD) constraint, which is one of the most important constraints and is essential to the security of the system. In this paper, we analyze the SOD constraint in PBDM delegation model and give the formal definition for the constraint. We prove that the constraint violation will not happen at the stage of the delegation role definition whereas it can only happen at the stage of role assignment. We then propose a protective mechanism to prevent the illegal role delegation utilizing the prerequisite conditions which are a set of Boolean expressions. We also give the algorithm to check the prerequisite conditions to help the security administrator guarantee the safe role delegation.",
"abstracts": [
{
"abstractType": "Regular",
"content": "In large enterprise software systems, users often need to delegate their authority to others. Permission base delegation model (PBDM) based on RBAC96 currently is the most attractive model to fulfill the delegation requirement since it supports partly delegation and multiple steps delegation. However in PBDM there is no explicit specification of the separation of duty (SOD) constraint, which is one of the most important constraints and is essential to the security of the system. In this paper, we analyze the SOD constraint in PBDM delegation model and give the formal definition for the constraint. We prove that the constraint violation will not happen at the stage of the delegation role definition whereas it can only happen at the stage of role assignment. We then propose a protective mechanism to prevent the illegal role delegation utilizing the prerequisite conditions which are a set of Boolean expressions. We also give the algorithm to check the prerequisite conditions to help the security administrator guarantee the safe role delegation.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "In large enterprise software systems, users often need to delegate their authority to others. Permission base delegation model (PBDM) based on RBAC96 currently is the most attractive model to fulfill the delegation requirement since it supports partly delegation and multiple steps delegation. However in PBDM there is no explicit specification of the separation of duty (SOD) constraint, which is one of the most important constraints and is essential to the security of the system. In this paper, we analyze the SOD constraint in PBDM delegation model and give the formal definition for the constraint. We prove that the constraint violation will not happen at the stage of the delegation role definition whereas it can only happen at the stage of role assignment. We then propose a protective mechanism to prevent the illegal role delegation utilizing the prerequisite conditions which are a set of Boolean expressions. We also give the algorithm to check the prerequisite conditions to help the security administrator guarantee the safe role delegation.",
"fno": "3560a465",
"keywords": [
"PBDM",
"RBAC",
"SOD",
"Constraint",
"Security",
"Safe Delegation"
],
"authors": [
{
"affiliation": null,
"fullName": "Chao Huang",
"givenName": "Chao",
"surname": "Huang",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Jianling Sun",
"givenName": "Jianling",
"surname": "Sun",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Xinyu Wang",
"givenName": "Xinyu",
"surname": "Wang",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Yuanjie Si",
"givenName": "Yuanjie",
"surname": "Si",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "isbim",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2008-12-01T00:00:00",
"pubType": "proceedings",
"pages": "465-468",
"year": "2008",
"issn": null,
"isbn": "978-0-7695-3560-9",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "3560a461",
"articleId": "12OmNwseEYO",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "3560a473",
"articleId": "12OmNwF0BN3",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/compsacw/2010/4105/0/4105a189",
"title": "Delegation Pattern in Workflow System",
"doi": null,
"abstractUrl": "/proceedings-article/compsacw/2010/4105a189/12OmNB9t6n7",
"parentPublication": {
"id": "proceedings/compsacw/2010/4105/0",
"title": "2010 IEEE 34th Annual Computer Software and Applications Conference Workshops",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/npc/2008/3354/0/3354a042",
"title": "Attribute Delegation Authorization Based on Subjective Trust Evaluation",
"doi": null,
"abstractUrl": "/proceedings-article/npc/2008/3354a042/12OmNBh8gVP",
"parentPublication": {
"id": "proceedings/npc/2008/3354/0",
"title": "Network and Parallel Computing Workshops, IFIP International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cit/2005/2432/0/24320751",
"title": "Using XML and XACML to Support Attribute Based Delegation",
"doi": null,
"abstractUrl": "/proceedings-article/cit/2005/24320751/12OmNBigFy5",
"parentPublication": {
"id": "proceedings/cit/2005/2432/0",
"title": "The Fifth International Conference on Computer and Information Technology CIT 2005",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/citworkshops/2008/3242/0/3242a216",
"title": "Constraints for Permission-Based Delegations",
"doi": null,
"abstractUrl": "/proceedings-article/citworkshops/2008/3242a216/12OmNqIzh0o",
"parentPublication": {
"id": "proceedings/citworkshops/2008/3242/0",
"title": "Computer and Information Technology, IEEE 8th International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/euc/2010/4322/0/4322a711",
"title": "Capability-Role-Based Delegation in Workflow Systems",
"doi": null,
"abstractUrl": "/proceedings-article/euc/2010/4322a711/12OmNqyUUw9",
"parentPublication": {
"id": "proceedings/euc/2010/4322/0",
"title": "Embedded and Ubiquitous Computing, IEEE/IFIP International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icycs/2008/3398/0/3398a856",
"title": "Conditional Delegation Model Based on Weighted Roles for Workflow",
"doi": null,
"abstractUrl": "/proceedings-article/icycs/2008/3398a856/12OmNscOUie",
"parentPublication": {
"id": "proceedings/icycs/2008/3398/0",
"title": "2008 9th International Conference for Young Computer Scientists",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/acsac/2000/0859/0/08590168",
"title": "Framework for role-based delegation models",
"doi": null,
"abstractUrl": "/proceedings-article/acsac/2000/08590168/12OmNyNzhtg",
"parentPublication": {
"id": "proceedings/acsac/2000/0859/0",
"title": "Computer Security Applications Conference, Annual",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ares/2008/3102/0/3102a765",
"title": "Security Analysis of Role-based Separation of Duty with Workflows",
"doi": null,
"abstractUrl": "/proceedings-article/ares/2008/3102a765/12OmNykCcfh",
"parentPublication": {
"id": "proceedings/ares/2008/3102/0",
"title": "2008 Third International Conference on Availability, Reliability and Security",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/isise/2010/4360/0/4360a306",
"title": "An Improved Static Constraint RBAC Model",
"doi": null,
"abstractUrl": "/proceedings-article/isise/2010/4360a306/12OmNzBOhT5",
"parentPublication": {
"id": "proceedings/isise/2010/4360/0",
"title": "2010 Third International Symposium on Information Science and Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/csse/2008/3336/3/3336e696",
"title": "An Extended Permission-Based Delegation Authorization Model",
"doi": null,
"abstractUrl": "/proceedings-article/csse/2008/3336e696/12OmNzTH0IV",
"parentPublication": {
"id": "proceedings/csse/2008/3336/3",
"title": "Computer Science and Software Engineering, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNyPQ4vG",
"title": "2008 9th International Symposium on Quality Electronic Design (ISQED '08)",
"acronym": "isqed",
"groupId": "1000599",
"volume": "0",
"displayVolume": "0",
"year": "2008",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNwdL7qV",
"doi": "10.1109/ISQED.2008.115",
"title": "On Efficient and Robust Constraint Generation for Practical Layout Legalization",
"normalizedTitle": "On Efficient and Robust Constraint Generation for Practical Layout Legalization",
"abstract": "Sub-wavelength lithography in modern fabrication processes has resulted in a tremendous increase in the number of design rules. Of these, the context dependent design rules are especially hard to adhere to during manual layout creation. Layout legalization or automatic correction of design rule violation, therefore, has attained prime importance. Layout legalization can be modeled as a modified layout compaction problem. Generation of constraints from a given layout is a crucial step in compaction. In this paper, we propose a systematic framework for constraint generation that identifies context dependent rules and ensures legal layout upon compaction. In addition, we suggest practical schemes for reducing the legalization problem size that results in subsequent efficient solution.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Sub-wavelength lithography in modern fabrication processes has resulted in a tremendous increase in the number of design rules. Of these, the context dependent design rules are especially hard to adhere to during manual layout creation. Layout legalization or automatic correction of design rule violation, therefore, has attained prime importance. Layout legalization can be modeled as a modified layout compaction problem. Generation of constraints from a given layout is a crucial step in compaction. In this paper, we propose a systematic framework for constraint generation that identifies context dependent rules and ensures legal layout upon compaction. In addition, we suggest practical schemes for reducing the legalization problem size that results in subsequent efficient solution.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Sub-wavelength lithography in modern fabrication processes has resulted in a tremendous increase in the number of design rules. Of these, the context dependent design rules are especially hard to adhere to during manual layout creation. Layout legalization or automatic correction of design rule violation, therefore, has attained prime importance. Layout legalization can be modeled as a modified layout compaction problem. Generation of constraints from a given layout is a crucial step in compaction. In this paper, we propose a systematic framework for constraint generation that identifies context dependent rules and ensures legal layout upon compaction. In addition, we suggest practical schemes for reducing the legalization problem size that results in subsequent efficient solution.",
"fno": "3117a379",
"keywords": [
"Layout Legalization",
"Compaction",
"Constraint Generation",
"Constraint Reduction"
],
"authors": [
{
"affiliation": null,
"fullName": "Sambuddha Bhattacharya",
"givenName": "Sambuddha",
"surname": "Bhattacharya",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Shabbir H. Batterywala",
"givenName": "Shabbir H.",
"surname": "Batterywala",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Subramanian Rajagopalan",
"givenName": "Subramanian",
"surname": "Rajagopalan",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Hi-Keung Tony Ma",
"givenName": "Hi-Keung Tony",
"surname": "Ma",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Narendra V. Shenoy",
"givenName": "Narendra V.",
"surname": "Shenoy",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "isqed",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2008-03-01T00:00:00",
"pubType": "proceedings",
"pages": "379-384",
"year": "2008",
"issn": null,
"isbn": "978-0-7695-3117-5",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "3117a373",
"articleId": "12OmNwF0BIX",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "3117a385",
"articleId": "12OmNvStcKX",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/hicss/1989/1911/1/00047138",
"title": "A new method for two dimensional symbolic compaction of IC layout",
"doi": null,
"abstractUrl": "/proceedings-article/hicss/1989/00047138/12OmNARiM8F",
"parentPublication": {
"id": "proceedings/hicss/1989/1911/1",
"title": "Proceedings of the Twenty-Second Annual Hawaii International Conference on System Sciences. Volume 1: Architecture Track",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/dac/1984/0542/0/01585787",
"title": "Interactive Compaction Router for VLSI Layout",
"doi": null,
"abstractUrl": "/proceedings-article/dac/1984/01585787/12OmNArbG1M",
"parentPublication": {
"id": "proceedings/dac/1984/0542/0",
"title": "21st Design Automation Conference Proceedings",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/isqed/2008/3117/0/3117a450",
"title": "Cell Swapping Based Migration Methodology for Analog and Custom Layouts",
"doi": null,
"abstractUrl": "/proceedings-article/isqed/2008/3117a450/12OmNrJRPiW",
"parentPublication": {
"id": "proceedings/isqed/2008/3117/0",
"title": "2008 9th International Symposium on Quality Electronic Design (ISQED '08)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/dac/1983/0026/0/01585635",
"title": "Graph-Optimization Techniques for IC Layout and Compaction",
"doi": null,
"abstractUrl": "/proceedings-article/dac/1983/01585635/12OmNvjgWE0",
"parentPublication": {
"id": "proceedings/dac/1983/0026/0",
"title": "Design Automation Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/dac/1981/9999/0/01585356",
"title": "Virtual Grid Symbolic Layout",
"doi": null,
"abstractUrl": "/proceedings-article/dac/1981/01585356/12OmNvjyxzb",
"parentPublication": {
"id": "proceedings/dac/1981/9999/0",
"title": "18th Design Automation Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/edac/1990/2024/0/00136644",
"title": "An efficient two-dimensional compaction algorithm for VLSI symbolic layout",
"doi": null,
"abstractUrl": "/proceedings-article/edac/1990/00136644/12OmNxEBzgT",
"parentPublication": {
"id": "proceedings/edac/1990/2024/0",
"title": "Proceedings of the European Design Automation Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccd/1989/1971/0/00063423",
"title": "A hierarchical constraint graph generation and compaction system for symbolic layout",
"doi": null,
"abstractUrl": "/proceedings-article/iccd/1989/00063423/12OmNxRF77M",
"parentPublication": {
"id": "proceedings/iccd/1989/1971/0",
"title": "Proceedings 1989 IEEE International Conference on Computer Design: VLSI in Computers and Processors",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/dac/1983/0026/0/01585634",
"title": "An Algorithm to Compact a VLSI Symbolic Layout with Mixed Constraints",
"doi": null,
"abstractUrl": "/proceedings-article/dac/1983/01585634/12OmNxcMScD",
"parentPublication": {
"id": "proceedings/dac/1983/0026/0",
"title": "Design Automation Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/dac/1990/1363/0/00114885",
"title": "Layout compaction with attractive and repulsive constraints",
"doi": null,
"abstractUrl": "/proceedings-article/dac/1990/00114885/12OmNyfdOII",
"parentPublication": {
"id": "proceedings/dac/1990/1363/0",
"title": "Design Automation Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vlsid/2009/3506/0/3506a137",
"title": "Efficient Analog/RF Layout Closure with Compaction Based Legalization",
"doi": null,
"abstractUrl": "/proceedings-article/vlsid/2009/3506a137/12OmNzmtWGg",
"parentPublication": {
"id": "proceedings/vlsid/2009/3506/0",
"title": "2009 22nd International Conference on VLSI Design",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNAS9zxb",
"title": "Proceedings. 19th International Conference on Automated Software Engineering, 2004.",
"acronym": "ase",
"groupId": "1000064",
"volume": "0",
"displayVolume": "0",
"year": "2004",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNC2xhB5",
"doi": "10.1109/ASE.2004.1342728",
"title": "Modeling Web-based dialog flows for automatic dialog control",
"normalizedTitle": "Modeling Web-based dialog flows for automatic dialog control",
"abstract": "In Web-based applications, the dialog control logic is often hidden in or entwined with the presentation and/or application logic, even if the latter tiers are well-separated. This makes it difficult to control complex dialog structures like nested dialogs, and to reconcile the device-independent business logic with the device-specific interaction patterns required by different clients' I/O capabilities. To avoid continuous re-implementation of the dialog control logic, we present a dialog control framework that is separate from the presentation and business tiers, and manages arbitrarily nested dialog flows on different presentation channels. The framework relies on dialog specifications developed using the dialog flow notation, which are translated into an object-oriented dialog flow model for efficient run-time lookups. This way, the framework automates the dialog control aspect of Web-based application development and leaves only the tasks of implementing the business logic, designing the hypertext pages, and specifying the dialog flow to the developer",
"abstracts": [
{
"abstractType": "Regular",
"content": "In Web-based applications, the dialog control logic is often hidden in or entwined with the presentation and/or application logic, even if the latter tiers are well-separated. This makes it difficult to control complex dialog structures like nested dialogs, and to reconcile the device-independent business logic with the device-specific interaction patterns required by different clients' I/O capabilities. To avoid continuous re-implementation of the dialog control logic, we present a dialog control framework that is separate from the presentation and business tiers, and manages arbitrarily nested dialog flows on different presentation channels. The framework relies on dialog specifications developed using the dialog flow notation, which are translated into an object-oriented dialog flow model for efficient run-time lookups. This way, the framework automates the dialog control aspect of Web-based application development and leaves only the tasks of implementing the business logic, designing the hypertext pages, and specifying the dialog flow to the developer",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "In Web-based applications, the dialog control logic is often hidden in or entwined with the presentation and/or application logic, even if the latter tiers are well-separated. This makes it difficult to control complex dialog structures like nested dialogs, and to reconcile the device-independent business logic with the device-specific interaction patterns required by different clients' I/O capabilities. To avoid continuous re-implementation of the dialog control logic, we present a dialog control framework that is separate from the presentation and business tiers, and manages arbitrarily nested dialog flows on different presentation channels. The framework relies on dialog specifications developed using the dialog flow notation, which are translated into an object-oriented dialog flow model for efficient run-time lookups. This way, the framework automates the dialog control aspect of Web-based application development and leaves only the tasks of implementing the business logic, designing the hypertext pages, and specifying the dialog flow to the developer",
"fno": "01342728",
"keywords": [
"Formal Specification",
"Interactive Systems",
"Internet",
"Object Oriented Programming",
"User Interfaces",
"Web Based Dialog Flow Modeling",
"Automatic Dialog Control",
"Dialog Control Logic",
"Dialog Control Framework",
"Presentation Channels",
"Dialog Flow Specifications",
"Dialog Flow Notation",
"Object Oriented Dialog Flow Model",
"Run Time Lookups",
"Web Based Application Development",
"Complex Dialog Structure Control",
"Device Independent Business Logic",
"Device Specific Interaction Patterns",
"Nested Dialog Flows",
"Run Time Lookups",
"Hypertext Page Design",
"Automatic Control",
"Logic Devices",
"Application Software",
"Object Oriented Modeling",
"Books",
"Telematics",
"Computer Science",
"Runtime",
"Logic Design",
"Marketing And Sales"
],
"authors": [
{
"affiliation": "Dept. of Comput. Sci., Leipzig Univ., Germany",
"fullName": "M. Book",
"givenName": "M.",
"surname": "Book",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Dept. of Comput. Sci., Leipzig Univ., Germany",
"fullName": "V. Gruhn",
"givenName": "V.",
"surname": "Gruhn",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "ase",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2004-01-01T00:00:00",
"pubType": "proceedings",
"pages": "100-109",
"year": "2004",
"issn": "1938-4300",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "01342727",
"articleId": "12OmNvlPkG0",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "01342729",
"articleId": "12OmNzZEArC",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/hicss/1988/0843/3/00011941",
"title": "PM: a logic modeling language for production, distribution and inventory planning",
"doi": null,
"abstractUrl": "/proceedings-article/hicss/1988/00011941/12OmNBaBuTe",
"parentPublication": {
"id": "proceedings/hicss/1988/0843/3",
"title": "Proceedings of the Twenty-First Annual Hawaii International Conference on System Sciences. Volume III: Decision Support and Knowledge Based Systems Track",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/dexa/2012/2621/0/06327437",
"title": "Using Heterogeneous Mappings for Rewriting SPARQL Queries",
"doi": null,
"abstractUrl": "/proceedings-article/dexa/2012/06327437/12OmNC943z5",
"parentPublication": {
"id": "proceedings/dexa/2012/2621/0",
"title": "2012 23rd International Workshop on Database and Expert Systems Applications (DEXA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/compsac/2006/2655/1/26550161",
"title": "Efficient Modeling of Hierarchical Dialog Flows for Multi-ChannelWeb Applications",
"doi": null,
"abstractUrl": "/proceedings-article/compsac/2006/26550161/12OmNqJq4Fq",
"parentPublication": {
"id": "compsac/2006/2655/1",
"title": "30th Annual International Computer Software and Applications Conference (COMPSAC'06)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/qsic/2003/2015/0/20150170",
"title": "A Dialog Control Framework for Hypertext-Based Applications",
"doi": null,
"abstractUrl": "/proceedings-article/qsic/2003/20150170/12OmNvT2paP",
"parentPublication": {
"id": "proceedings/qsic/2003/2015/0",
"title": "Quality Software, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ase/2004/2131/0/21310100",
"title": "Modeling Web-Based Dialog Flows for Automatic Dialog Control",
"doi": null,
"abstractUrl": "/proceedings-article/ase/2004/21310100/12OmNwBjP1r",
"parentPublication": {
"id": "proceedings/ase/2004/2131/0",
"title": "Proceedings. 19th International Conference on Automated Software Engineering, 2004.",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/compsac/2005/2413/2/241320173",
"title": "Experiences with a Dialog-Driven Process Model for Web Application Development",
"doi": null,
"abstractUrl": "/proceedings-article/compsac/2005/241320173/12OmNwpoFDl",
"parentPublication": {
"id": "proceedings/compsac/2005/2413/2",
"title": "29th Annual International Computer Software and Applications Conference (COMPSAC'05)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/aqtr/2010/6724/3/05520737",
"title": "Centralized logging of multi tier applications over web Services with NLog custom targets",
"doi": null,
"abstractUrl": "/proceedings-article/aqtr/2010/05520737/12OmNz3bdE6",
"parentPublication": {
"id": "proceedings/aqtr/2010/6724/3",
"title": "2010 IEEE International Conference on Automation, Quality and Testing, Robotics (AQTR 2010)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icassp/2002/7402/1/05743834",
"title": "Turn-Based Language Modeling for spoken dialog systems",
"doi": null,
"abstractUrl": "/proceedings-article/icassp/2002/05743834/12OmNzzP5H2",
"parentPublication": {
"id": "proceedings/icassp/2002/7402/1",
"title": "Proceedings of International Conference on Acoustics, Speech and Signal Processing (CASSP'02)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/edoc/2006/2558/0/04031215",
"title": "Specifying and Controlling Multi-Channel Web Interfaces for Enterprise Applications",
"doi": null,
"abstractUrl": "/proceedings-article/edoc/2006/04031215/14dcEfU1kpc",
"parentPublication": {
"id": "proceedings/edoc/2006/2558/0",
"title": "2006 10th IEEE International Enterprise Distributed Object Computing Conference (EDOC'06)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icsm/2006/2354/0/04021371",
"title": "Reengineering User Interfaces of E-Commerce Applications Using Business Processes",
"doi": null,
"abstractUrl": "/proceedings-article/icsm/2006/04021371/17PYElpXYNs",
"parentPublication": {
"id": "proceedings/icsm/2006/2354/0",
"title": "2006 22nd IEEE International Conference on Software Maintenance",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNykCcdn",
"title": "2012 IIAI International Conference on Advanced Applied Informatics (IIAIAAI 2012)",
"acronym": "iiai-aai",
"groupId": "1801921",
"volume": "0",
"displayVolume": "0",
"year": "2012",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNC4eSHu",
"doi": "10.1109/IIAI-AAI.2012.62",
"title": "A Framework for Segmenting Customers Based on Probability Density of Transaction Data",
"normalizedTitle": "A Framework for Segmenting Customers Based on Probability Density of Transaction Data",
"abstract": "Segmenting customers based on transaction data contributes to better understanding and characterizing customers, and has drawn a great deal of attention in literature of various fields. Data mining literature has provided various clustering algorithms for customer segmentation, and distance measure plays an important role in many approaches. However, most distance measures are based on co-occurrence of items, and pay few attention to the sales volume or quantities of items in transactions. In this paper, the probability density of items is employed to gather the description information of transactions and calculate the distance between transactions. Based on distinguishing the difference between similarity measures for transactions and customers, set distance is employed to evaluate the similarity between customers. The whole process is introduced as a framework to reach the target of segmenting customers.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Segmenting customers based on transaction data contributes to better understanding and characterizing customers, and has drawn a great deal of attention in literature of various fields. Data mining literature has provided various clustering algorithms for customer segmentation, and distance measure plays an important role in many approaches. However, most distance measures are based on co-occurrence of items, and pay few attention to the sales volume or quantities of items in transactions. In this paper, the probability density of items is employed to gather the description information of transactions and calculate the distance between transactions. Based on distinguishing the difference between similarity measures for transactions and customers, set distance is employed to evaluate the similarity between customers. The whole process is introduced as a framework to reach the target of segmenting customers.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Segmenting customers based on transaction data contributes to better understanding and characterizing customers, and has drawn a great deal of attention in literature of various fields. Data mining literature has provided various clustering algorithms for customer segmentation, and distance measure plays an important role in many approaches. However, most distance measures are based on co-occurrence of items, and pay few attention to the sales volume or quantities of items in transactions. In this paper, the probability density of items is employed to gather the description information of transactions and calculate the distance between transactions. Based on distinguishing the difference between similarity measures for transactions and customers, set distance is employed to evaluate the similarity between customers. The whole process is introduced as a framework to reach the target of segmenting customers.",
"fno": "06337202",
"keywords": [
"Consumer Behaviour",
"Data Mining",
"Marketing Data Processing",
"Pattern Clustering",
"Probability",
"Customer Segmentation",
"Probability Density",
"Transaction Data",
"Data Mining Literature",
"Clustering Algorithms",
"Distance Measure",
"Similarity Measures",
"Set Distance",
"Customer Behavior Analysis",
"Marketing And Sales",
"Probability",
"Clustering Algorithms",
"Transaction Databases",
"Histograms",
"Vectors",
"Density Measurement",
"Customer Segmentation",
"Transaction Data",
"Probability Density"
],
"authors": [
{
"affiliation": null,
"fullName": "Ke Lu",
"givenName": "Ke",
"surname": "Lu",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Tetsuya Furukawa",
"givenName": "Tetsuya",
"surname": "Furukawa",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "iiai-aai",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2012-09-01T00:00:00",
"pubType": "proceedings",
"pages": "273-278",
"year": "2012",
"issn": null,
"isbn": "978-1-4673-2719-0",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "06337201",
"articleId": "12OmNApcu9H",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "06337203",
"articleId": "12OmNqBbI2A",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/icde/1995/6910/0/69100003",
"title": "Mining sequential patterns",
"doi": null,
"abstractUrl": "/proceedings-article/icde/1995/69100003/12OmNAkWvEm",
"parentPublication": {
"id": "proceedings/icde/1995/6910/0",
"title": "Proceedings of the Eleventh International Conference on Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icmb/2007/2803/0/28030042",
"title": "Segmenting Bank Customers by Resistance to Mobile Banking",
"doi": null,
"abstractUrl": "/proceedings-article/icmb/2007/28030042/12OmNAtK4hf",
"parentPublication": {
"id": "proceedings/icmb/2007/2803/0",
"title": "2007 International Conference on the Management of Mobile Business",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icccnt/2012/9999/0/06395967",
"title": "Rule-base data mining systems for customer queries",
"doi": null,
"abstractUrl": "/proceedings-article/icccnt/2012/06395967/12OmNBbaH7o",
"parentPublication": {
"id": "proceedings/icccnt/2012/9999/0",
"title": "2012 Third International Conference on Computing, Communication and Networking Technologies (ICCCNT 2012)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/aptc/2008/3363/0/3363a123",
"title": "Fine Grained Transaction Log for Data Recovery in Database Systems",
"doi": null,
"abstractUrl": "/proceedings-article/aptc/2008/3363a123/12OmNwc3wyM",
"parentPublication": {
"id": "proceedings/aptc/2008/3363/0",
"title": "Trusted Infrastructure Technologies Conference, Asia-Pacific /Trusted Infrastructure Technologies Conference, Third Asia-Pacific",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/waim/2008/3185/0/3185a373",
"title": "Outlier Detection for Transaction Databases Using Association Rules",
"doi": null,
"abstractUrl": "/proceedings-article/waim/2008/3185a373/12OmNx6PiFz",
"parentPublication": {
"id": "proceedings/waim/2008/3185/0",
"title": "Web-Age Information Management, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/apscc/2010/9396/0/05708593",
"title": "Customer-Item Category Based Knowledge Discovery Support System and Its Application to Department Store Service",
"doi": null,
"abstractUrl": "/proceedings-article/apscc/2010/05708593/12OmNy1SFHU",
"parentPublication": {
"id": "proceedings/apscc/2010/9396/0",
"title": "2010 Asia-Pacific Services Computing Conference (APSCC 2010)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/isecs/2008/3258/0/3258a603",
"title": "Exploring Influencing Factors in E-Commerce Transaction Behaviors",
"doi": null,
"abstractUrl": "/proceedings-article/isecs/2008/3258a603/12OmNyaGeDs",
"parentPublication": {
"id": "proceedings/isecs/2008/3258/0",
"title": "Electronic Commerce and Security, International Symposium",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wi/2016/4470/0/4470a449",
"title": "Generic Framework to Predict Repeat Behavior of Customers Using Their Transaction History",
"doi": null,
"abstractUrl": "/proceedings-article/wi/2016/4470a449/12OmNybfqUv",
"parentPublication": {
"id": "proceedings/wi/2016/4470/0",
"title": "2016 IEEE/WIC/ACM International Conference on Web Intelligence (WI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2006/10/k1297",
"title": "Segmenting Customers from Population to Individuals: Does 1-to-1 Keep Your Customers Forever?",
"doi": null,
"abstractUrl": "/journal/tk/2006/10/k1297/13rRUwh80BL",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2007/04/v0822",
"title": "Value-Cell Bar Charts for Visualizing Large Transaction Data Sets",
"doi": null,
"abstractUrl": "/journal/tg/2007/04/v0822/13rRUygBw71",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNwErpHu",
"title": "Requirements Engineering Visualization, First International Workshop on",
"acronym": "rev",
"groupId": "1001649",
"volume": "0",
"displayVolume": "0",
"year": "2007",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNClQ0qX",
"doi": "10.1109/REV.2007.2",
"title": "An Improved Fisheye Zoom Algorithm for Visualizing and Editing Hierarchical Models",
"normalizedTitle": "An Improved Fisheye Zoom Algorithm for Visualizing and Editing Hierarchical Models",
"abstract": "Hierarchical decomposition is an important means for organizing and understanding large requirements and design models. Fisheye zoom visualization is an attractive means for viewing, navigating and editing such hierarchical models, because local detail and its surrounding global context can be displayed in a single view. However, existing fisheye view approaches have deficiencies in terms of layout stability when model nodes are zoomed-in and zoomed-out. Furthermore, most of them do not support model editing (moving, adding and deleting nodes) well. In this paper, we present an improved fisheye zoom algorithm which supports viewing and manipulating hierarchical models. Our algorithm solves the problem of having a user-editable layout which is nevertheless stable under multiple zooming operations. Furthermore, it supports multiple focal points, and runs in real-time.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Hierarchical decomposition is an important means for organizing and understanding large requirements and design models. Fisheye zoom visualization is an attractive means for viewing, navigating and editing such hierarchical models, because local detail and its surrounding global context can be displayed in a single view. However, existing fisheye view approaches have deficiencies in terms of layout stability when model nodes are zoomed-in and zoomed-out. Furthermore, most of them do not support model editing (moving, adding and deleting nodes) well. In this paper, we present an improved fisheye zoom algorithm which supports viewing and manipulating hierarchical models. Our algorithm solves the problem of having a user-editable layout which is nevertheless stable under multiple zooming operations. Furthermore, it supports multiple focal points, and runs in real-time.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Hierarchical decomposition is an important means for organizing and understanding large requirements and design models. Fisheye zoom visualization is an attractive means for viewing, navigating and editing such hierarchical models, because local detail and its surrounding global context can be displayed in a single view. However, existing fisheye view approaches have deficiencies in terms of layout stability when model nodes are zoomed-in and zoomed-out. Furthermore, most of them do not support model editing (moving, adding and deleting nodes) well. In this paper, we present an improved fisheye zoom algorithm which supports viewing and manipulating hierarchical models. Our algorithm solves the problem of having a user-editable layout which is nevertheless stable under multiple zooming operations. Furthermore, it supports multiple focal points, and runs in real-time.",
"fno": "32480009",
"keywords": [],
"authors": [
{
"affiliation": null,
"fullName": "Tobias Reinhard",
"givenName": "Tobias",
"surname": "Reinhard",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Silvio Meier",
"givenName": "Silvio",
"surname": "Meier",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Martin Glinz",
"givenName": "Martin",
"surname": "Glinz",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "rev",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2007-03-01T00:00:00",
"pubType": "proceedings",
"pages": "9",
"year": "2007",
"issn": null,
"isbn": "0-7695-3248-9",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "32480008",
"articleId": "12OmNyQGS0Z",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "32480010",
"articleId": "12OmNzhna9b",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/mue/2008/3134/0/3134a282",
"title": "Audio-Based Video Editing with Two-Channel Microphone",
"doi": null,
"abstractUrl": "/proceedings-article/mue/2008/3134a282/12OmNApu5E0",
"parentPublication": {
"id": "proceedings/mue/2008/3134/0",
"title": "Multimedia and Ubiquitous Engineering, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/dmamh/2007/3065/0/30650123",
"title": "Navigating and Visualizing Long Lists with Fisheye View and Graphical Representation",
"doi": null,
"abstractUrl": "/proceedings-article/dmamh/2007/30650123/12OmNAqU4Ut",
"parentPublication": {
"id": "proceedings/dmamh/2007/3065/0",
"title": "Digital Media and its Application in Museum & Heritage/Digital Media and its Application in Museum & Heritage, Workshop on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-infovis/2004/8779/0/87790175",
"title": "Topological Fisheye Views for Visualizing Large Graphs",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-infovis/2004/87790175/12OmNBBhN3w",
"parentPublication": {
"id": "proceedings/ieee-infovis/2004/8779/0",
"title": "Information Visualization, IEEE Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/itcc/2002/1506/0/15060034",
"title": "Internet Browsing: Visualizing Category Map by Fisheye and Fractal Views",
"doi": null,
"abstractUrl": "/proceedings-article/itcc/2002/15060034/12OmNBCqbKg",
"parentPublication": {
"id": "proceedings/itcc/2002/1506/0",
"title": "Information Technology: Coding and Computing, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cit/2014/6239/0/6239a123",
"title": "Radar Signal Parameter Estimation with Sparse Bayesian Representation Based on Zoom-Dictionary",
"doi": null,
"abstractUrl": "/proceedings-article/cit/2014/6239a123/12OmNrIrPi2",
"parentPublication": {
"id": "proceedings/cit/2014/6239/0",
"title": "2014 IEEE International Conference on Computer and Information Technology (CIT)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icme/2005/9331/0/01521514",
"title": "Video quality analysis for an automated video capturing and editing system for conversation scenes",
"doi": null,
"abstractUrl": "/proceedings-article/icme/2005/01521514/12OmNzYNN7i",
"parentPublication": {
"id": "proceedings/icme/2005/9331/0",
"title": "2005 IEEE International Conference on Multimedia and Expo",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2005/04/v0457",
"title": "Topological Fisheye Views for Visualizing Large Graphs",
"doi": null,
"abstractUrl": "/journal/tg/2005/04/v0457/13rRUIM2VGU",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2006/05/v0829",
"title": "User Interaction with Scatterplots on Small Screens - A Comparative Evaluation of Geometric-Semantic Zoom and Fisheye Distortion",
"doi": null,
"abstractUrl": "/journal/tg/2006/05/v0829/13rRUxcKzVd",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/smartiot/2022/7952/0/795200a185",
"title": "Unsupervised Generated Image Editing Method Based on Multi-Scale Hierarchical Disentanglement",
"doi": null,
"abstractUrl": "/proceedings-article/smartiot/2022/795200a185/1Gvdk3nDSZa",
"parentPublication": {
"id": "proceedings/smartiot/2022/7952/0",
"title": "2022 IEEE International Conference on Smart Internet of Things (SmartIoT)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/msn/2020/9916/0/991600a410",
"title": "Simultaneous Multi-face Zoom Tracking for 3-D People-Flow Analysis with Face Identification",
"doi": null,
"abstractUrl": "/proceedings-article/msn/2020/991600a410/1sBO7hqOYCI",
"parentPublication": {
"id": "proceedings/msn/2020/9916/0",
"title": "2020 16th International Conference on Mobility, Sensing and Networking (MSN)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNAle6y0",
"title": "Proceedings of IEEE 9th International Conference on Data Engineering",
"acronym": "icde",
"groupId": "1000178",
"volume": "0",
"displayVolume": "0",
"year": "1993",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNvAiSMR",
"doi": "10.1109/ICDE.1993.344012",
"title": "Data quality requirements analysis and modeling",
"normalizedTitle": "Data quality requirements analysis and modeling",
"abstract": "A set or premises, terms, and definitions for data quality management are established, and a step-by-step methodology for defining and documenting data quality parameters important to users is developed. These quality parameters are used to determine quality indicators about the data manufacturing process, such as data source creation time, and collection method, that are tagged to data items. Given such tags, and the ability to query over them, users can filter out data having undesirable characteristics. The methodology provides a concrete approach to data quality requirements collection and documentation. It demonstrates that data quality can be an integral part of the database design process. A perspective on the migration towards quality management of data in a database environment is given.<>",
"abstracts": [
{
"abstractType": "Regular",
"content": "A set or premises, terms, and definitions for data quality management are established, and a step-by-step methodology for defining and documenting data quality parameters important to users is developed. These quality parameters are used to determine quality indicators about the data manufacturing process, such as data source creation time, and collection method, that are tagged to data items. Given such tags, and the ability to query over them, users can filter out data having undesirable characteristics. The methodology provides a concrete approach to data quality requirements collection and documentation. It demonstrates that data quality can be an integral part of the database design process. A perspective on the migration towards quality management of data in a database environment is given.<>",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "A set or premises, terms, and definitions for data quality management are established, and a step-by-step methodology for defining and documenting data quality parameters important to users is developed. These quality parameters are used to determine quality indicators about the data manufacturing process, such as data source creation time, and collection method, that are tagged to data items. Given such tags, and the ability to query over them, users can filter out data having undesirable characteristics. The methodology provides a concrete approach to data quality requirements collection and documentation. It demonstrates that data quality can be an integral part of the database design process. A perspective on the migration towards quality management of data in a database environment is given.",
"fno": "00344012",
"keywords": [
"Software Quality",
"Data Structures",
"Database Management Systems",
"Query Processing",
"Data Quality Management",
"Step By Step Methodology",
"Data Quality Parameters",
"Data Manufacturing Process",
"Data Source",
"Collection Method",
"Undesirable Characteristics",
"Database Design Process",
"Quality Management",
"Data Analysis",
"Quality Management",
"Databases",
"Manufacturing",
"Data Engineering",
"Engineering Management",
"Large Scale Systems",
"Marketing And Sales",
"Joining Processes",
"Resource Management"
],
"authors": [
{
"affiliation": "Sloan Sch. of Manage., MIT, Cambridge, MA, USA",
"fullName": "R.Y. Wang",
"givenName": "R.Y.",
"surname": "Wang",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Sloan Sch. of Manage., MIT, Cambridge, MA, USA",
"fullName": "H.B. Kon",
"givenName": "H.B.",
"surname": "Kon",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Sloan Sch. of Manage., MIT, Cambridge, MA, USA",
"fullName": "S.E. Madnick",
"givenName": "S.E.",
"surname": "Madnick",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "icde",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "1993-01-01T00:00:00",
"pubType": "proceedings",
"pages": "670,671,672,673,674,675,676,677",
"year": "1993",
"issn": null,
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "00344011",
"articleId": "12OmNvnfk9S",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "00344013",
"articleId": "12OmNxveNLz",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/icgse/2007/2920/0/29200300",
"title": "An Introduction to Global Product Line Requirements Engineering",
"doi": null,
"abstractUrl": "/proceedings-article/icgse/2007/29200300/12OmNBWzHQM",
"parentPublication": {
"id": "proceedings/icgse/2007/2920/0",
"title": "International Conference on Global Software Engineering (ICGSE 2007)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/spline/2006/2599/0/01691597",
"title": "Introduction to Product Line Requirements Engineering",
"doi": null,
"abstractUrl": "/proceedings-article/spline/2006/01691597/12OmNqI04YY",
"parentPublication": {
"id": "proceedings/spline/2006/2599/0",
"title": "10th International Software Product Line Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/fskd/2009/3735/5/3735e188",
"title": "Assuring the Information Quality in Data Mining for a Finance Company",
"doi": null,
"abstractUrl": "/proceedings-article/fskd/2009/3735e188/12OmNvUaNrf",
"parentPublication": {
"id": "proceedings/fskd/2009/3735/5",
"title": "Fuzzy Systems and Knowledge Discovery, Fourth International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icise/2009/3887/0/pid985076",
"title": "Modeling Information Quality for Data Mining to Medical Risk Management",
"doi": null,
"abstractUrl": "/proceedings-article/icise/2009/pid985076/12OmNxG1yNj",
"parentPublication": {
"id": "proceedings/icise/2009/3887/0",
"title": "Information Science and Engineering, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/fitme/2008/3480/0/3480a525",
"title": "A Method for Measuring Data Quality in Data Integration",
"doi": null,
"abstractUrl": "/proceedings-article/fitme/2008/3480a525/12OmNxHryix",
"parentPublication": {
"id": "proceedings/fitme/2008/3480/0",
"title": "Future Information Technology and Management Engineering, International Seminar on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cmpsac/1989/1964/0/00065133",
"title": "Quality feedback in software development management-methodology and practical application",
"doi": null,
"abstractUrl": "/proceedings-article/cmpsac/1989/00065133/12OmNyUWQTD",
"parentPublication": {
"id": "proceedings/cmpsac/1989/1964/0",
"title": "Proceedings of the Thirteenth Annual International Computer Software & Applications Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/dexa/2005/2424/0/01508238",
"title": "A Distributed Computation Model for Marketable Quality and Profitability Considering Unfair Relationship",
"doi": null,
"abstractUrl": "/proceedings-article/dexa/2005/01508238/12OmNzlD9eG",
"parentPublication": {
"id": "proceedings/dexa/2005/2424/0",
"title": "16th International Workshop on Database and Expert Systems Applications (DEXA'05)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icse-companion/2018/5663/0/566301a199",
"title": "Poster: Analysis of Requirements Quality Evolution",
"doi": null,
"abstractUrl": "/proceedings-article/icse-companion/2018/566301a199/13bd1gQYgEw",
"parentPublication": {
"id": "proceedings/icse-companion/2018/5663/0",
"title": "2018 IEEE/ACM 40th International Conference on Software Engineering: Companion Proceedings (ICSE-Companion)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/pc/2014/01/mpc2014010064",
"title": "ConvenienceProbe: A Phone-Based System for Retail Trade-Area Analysis",
"doi": null,
"abstractUrl": "/magazine/pc/2014/01/mpc2014010064/13rRUxCitGF",
"parentPublication": {
"id": "mags/pc",
"title": "IEEE Pervasive Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/re/2020/7438/0/09218203",
"title": "Improving the Quality of Requirements in Middleware Requirements Specifications",
"doi": null,
"abstractUrl": "/proceedings-article/re/2020/09218203/1nMQyz47Bdu",
"parentPublication": {
"id": "proceedings/re/2020/7438/0",
"title": "2020 IEEE 28th International Requirements Engineering Conference (RE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNxG1yTx",
"title": "Sixth International Conference on Data Mining (ICDM'06)",
"acronym": "icdm",
"groupId": "1000179",
"volume": "0",
"displayVolume": "0",
"year": "2006",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNwErpAD",
"doi": "10.1109/ICDM.2006.161",
"title": "TOP-COP: Mining TOP-K Strongly Correlated Pairs in Large Databases",
"normalizedTitle": "TOP-COP: Mining TOP-K Strongly Correlated Pairs in Large Databases",
"abstract": "Recently, there has been considerable interest in computing strongly correlated pairs in large databases. Most previous studies require the specification of a minimum correlation threshold to perform the computation. However, it may be difficult for users to provide an appropriate threshold in practice, since different data sets typically have different characteristics. To this end, we propose an alternative task: mining the top-k strongly correlated pairs. In this paper, we identify a 2-D monotone property of an upper bound of Pearson's correlation coefficient and develop an efficient algorithm, called TOP-COP to exploit this property to effectively prune many pairs even without computing their correlation coefficients. Our experimental results show that the TOP-COP algorithm can be orders of magnitude faster than brute-force alternatives for mining the top-k strongly correlated pairs.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Recently, there has been considerable interest in computing strongly correlated pairs in large databases. Most previous studies require the specification of a minimum correlation threshold to perform the computation. However, it may be difficult for users to provide an appropriate threshold in practice, since different data sets typically have different characteristics. To this end, we propose an alternative task: mining the top-k strongly correlated pairs. In this paper, we identify a 2-D monotone property of an upper bound of Pearson's correlation coefficient and develop an efficient algorithm, called TOP-COP to exploit this property to effectively prune many pairs even without computing their correlation coefficients. Our experimental results show that the TOP-COP algorithm can be orders of magnitude faster than brute-force alternatives for mining the top-k strongly correlated pairs.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Recently, there has been considerable interest in computing strongly correlated pairs in large databases. Most previous studies require the specification of a minimum correlation threshold to perform the computation. However, it may be difficult for users to provide an appropriate threshold in practice, since different data sets typically have different characteristics. To this end, we propose an alternative task: mining the top-k strongly correlated pairs. In this paper, we identify a 2-D monotone property of an upper bound of Pearson's correlation coefficient and develop an efficient algorithm, called TOP-COP to exploit this property to effectively prune many pairs even without computing their correlation coefficients. Our experimental results show that the TOP-COP algorithm can be orders of magnitude faster than brute-force alternatives for mining the top-k strongly correlated pairs.",
"fno": "04053172",
"keywords": [
"Data Mining",
"Database Management Systems",
"TOP COP",
"TOP K Strongly Correlated Pair Mining",
"Large Databases",
"Minimum Correlation Threshold",
"2 D Monotone Property",
"Pearson Correlation Coefficient",
"Data Mining",
"Transaction Databases",
"Upper Bound",
"Marketing And Sales",
"Algorithm Design And Analysis",
"Public Healthcare",
"Bioinformatics",
"Promotion Marketing",
"Computational Efficiency",
"Books"
],
"authors": [
{
"affiliation": "Rutgers University, USA",
"fullName": "Hui Xiong",
"givenName": "Hui",
"surname": "Xiong",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "IBM TJ Watson",
"fullName": "Mark Brodie",
"givenName": "Mark",
"surname": "Brodie",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Vivido Media Inc.",
"fullName": "Sheng Ma",
"givenName": "Sheng",
"surname": "Ma",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "icdm",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2006-12-01T00:00:00",
"pubType": "proceedings",
"pages": "1162-1166",
"year": "2006",
"issn": "1550-4786",
"isbn": "0-7695-2701-7",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "270101157",
"articleId": "12OmNyQGSiZ",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "270101167",
"articleId": "12OmNx38vLD",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/waim/2008/3185/0/3185a413",
"title": "Finding Correlated Item Pairs through Efficient Pruning with a Given Threshold",
"doi": null,
"abstractUrl": "/proceedings-article/waim/2008/3185a413/12OmNBDgZ1r",
"parentPublication": {
"id": "proceedings/waim/2008/3185/0",
"title": "Web-Age Information Management, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icit/2008/3513/0/3513a123",
"title": "SCOPE: An Efficient One Pass Approach to Find Strongly Correlated Item Pairs",
"doi": null,
"abstractUrl": "/proceedings-article/icit/2008/3513a123/12OmNCbU2WY",
"parentPublication": {
"id": "proceedings/icit/2008/3513/0",
"title": "2008 International Conference on Information Technology",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/dodugc/2004/2259/0/22590007",
"title": "Parallelizing the Keldysh Formalism for Strongly Correlated Electrons",
"doi": null,
"abstractUrl": "/proceedings-article/dodugc/2004/22590007/12OmNCwCLkU",
"parentPublication": {
"id": "proceedings/dodugc/2004/2259/0",
"title": "Proceedings. Users Group Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdmw/2008/3503/0/3503a275",
"title": "Mining Correlated Pairs of Patterns in Multidimensional Structured Databases",
"doi": null,
"abstractUrl": "/proceedings-article/icdmw/2008/3503a275/12OmNqOfftw",
"parentPublication": {
"id": "proceedings/icdmw/2008/3503/0",
"title": "2008 IEEE International Conference on Data Mining Workshops",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/eqec/2005/8973/0/01567419",
"title": "Photonic crystal fibre sources of correlated photon pairs",
"doi": null,
"abstractUrl": "/proceedings-article/eqec/2005/01567419/12OmNvUaNkb",
"parentPublication": {
"id": "proceedings/eqec/2005/8973/0",
"title": "2005 European Quantum Electronics Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icde/2012/4747/0/4747a798",
"title": "Efficiently Monitoring Top-k Pairs over Sliding Windows",
"doi": null,
"abstractUrl": "/proceedings-article/icde/2012/4747a798/12OmNwFicSU",
"parentPublication": {
"id": "proceedings/icde/2012/4747/0",
"title": "2012 IEEE 28th International Conference on Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/hpcmp-ugc/2006/2797/0/04134058",
"title": "Nonlinear Response of Strongly Correlated Materials to Large Electric Fields",
"doi": null,
"abstractUrl": "/proceedings-article/hpcmp-ugc/2006/04134058/12OmNya72nZ",
"parentPublication": {
"id": "proceedings/hpcmp-ugc/2006/2797/0",
"title": "HPCMP Users Group Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icicse/2009/4027/0/4027a152",
"title": "An Efficient Mining Algorithm for Top-k Strongly Correlated Item Pairs",
"doi": null,
"abstractUrl": "/proceedings-article/icicse/2009/4027a152/12OmNzYNNd6",
"parentPublication": {
"id": "proceedings/icicse/2009/4027/0",
"title": "2009 Fourth International Conference on Internet Computing for Science and Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/dodugc/2004/2259/0/01420845",
"title": "Parallelizing the Keldysh formalism for strongly correlated electrons",
"doi": null,
"abstractUrl": "/proceedings-article/dodugc/2004/01420845/12OmNzcxZho",
"parentPublication": {
"id": "proceedings/dodugc/2004/2259/0",
"title": "Proceedings. Users Group Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdm/2009/3895/0/3895a239",
"title": "Efficient Discovery of Frequent Correlated Subgraph Pairs",
"doi": null,
"abstractUrl": "/proceedings-article/icdm/2009/3895a239/12OmNzxPTMV",
"parentPublication": {
"id": "proceedings/icdm/2009/3895/0",
"title": "2009 Ninth IEEE International Conference on Data Mining",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNwkhTjd",
"title": "2010 Fifth International Workshop on Systematic Approaches to Digital Forensic Engineering (SADFE)",
"acronym": "sadfe",
"groupId": "1001100",
"volume": "0",
"displayVolume": "0",
"year": "2010",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNyywxDC",
"doi": "10.1109/SADFE.2010.15",
"title": "A Platform Independent Process Model for Smartphones Based on Invariants",
"normalizedTitle": "A Platform Independent Process Model for Smartphones Based on Invariants",
"abstract": "This paper introduces the concept of an extendable forensic process model applicable to smartphones regardless of platform. The intention is to develop the model using the property of invariance to construct a core components list which serves as the foundation of the proposed methodology. Given this list, an example of its application is specified using the components of the Verizon Samsung Omnia and the Blackberry Storm. The elements of each device are compared with the core components list. From this comparison, a forensic process model can be realized by addressing the items in this list.",
"abstracts": [
{
"abstractType": "Regular",
"content": "This paper introduces the concept of an extendable forensic process model applicable to smartphones regardless of platform. The intention is to develop the model using the property of invariance to construct a core components list which serves as the foundation of the proposed methodology. Given this list, an example of its application is specified using the components of the Verizon Samsung Omnia and the Blackberry Storm. The elements of each device are compared with the core components list. From this comparison, a forensic process model can be realized by addressing the items in this list.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "This paper introduces the concept of an extendable forensic process model applicable to smartphones regardless of platform. The intention is to develop the model using the property of invariance to construct a core components list which serves as the foundation of the proposed methodology. Given this list, an example of its application is specified using the components of the Verizon Samsung Omnia and the Blackberry Storm. The elements of each device are compared with the core components list. From this comparison, a forensic process model can be realized by addressing the items in this list.",
"fno": "4052a056",
"keywords": [
"Computer Forensics",
"Mobile Handsets",
"Platform Independent Process Model",
"Smartphones",
"Extendable Forensic Process Model",
"Core Components Construction",
"Verizon Samsung Omnia",
"Blackberry Storm",
"Smart Phones",
"Digital Forensics",
"Mobile Handsets",
"Mobile Communication",
"Personal Digital Assistants",
"Marketing And Sales",
"Testing",
"Connectors",
"Computer Science",
"Handheld Computers",
"Computer Forensics",
"Invariants",
"Process Model",
"Smartphone"
],
"authors": [
{
"affiliation": "Dept. of Comput. Sci. & Eng., Mississippi State Univ., Starkville, MS, USA",
"fullName": "F. Chevonne Thomas Dancer",
"givenName": "F. Chevonne Thomas",
"surname": "Dancer",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Dept. of Comput. Sci. & Eng., Mississippi State Univ., Starkville, MS, USA",
"fullName": "David A. Dampier",
"givenName": "David A.",
"surname": "Dampier",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "sadfe",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2010-05-01T00:00:00",
"pubType": "proceedings",
"pages": "56-60",
"year": "2010",
"issn": null,
"isbn": "978-0-7695-4052-8",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "05491956",
"articleId": "12OmNzZWbIH",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "4052a061",
"articleId": "12OmNyen1pd",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/dese/2016/5487/0/07930636",
"title": "Multimedia File Signature Analysis for Smartphone Forensics",
"doi": null,
"abstractUrl": "/proceedings-article/dese/2016/07930636/12OmNBV9Idx",
"parentPublication": {
"id": "proceedings/dese/2016/5487/0",
"title": "2016 9th International Conference on Developments in eSystems Engineering (DeSE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/asonam/2015/3854/0/07403640",
"title": "Fast community structure local uncovering by independent vertex-centred process",
"doi": null,
"abstractUrl": "/proceedings-article/asonam/2015/07403640/12OmNButq51",
"parentPublication": {
"id": "proceedings/asonam/2015/3854/0",
"title": "2015 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ares/2016/0990/0/0990a338",
"title": "Digital Forensic Artifacts of the Cortana Device Search Cache on Windows 10 Desktop",
"doi": null,
"abstractUrl": "/proceedings-article/ares/2016/0990a338/12OmNvmG7Z5",
"parentPublication": {
"id": "proceedings/ares/2016/0990/0",
"title": "2016 11th International Conference on Availability, Reliability and Security (ARES )",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ipdps/2008/1693/0/04536557",
"title": "Internal forensic acquisition for mobile equipments",
"doi": null,
"abstractUrl": "/proceedings-article/ipdps/2008/04536557/12OmNwBT1j6",
"parentPublication": {
"id": "proceedings/ipdps/2008/1693/0",
"title": "2008 IEEE International Parallel & Distributed Processing Symposium",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icmlc/2010/6006/0/05460764",
"title": "A Novel Data Generation Approach for Digital Forensic Application in Data Mining",
"doi": null,
"abstractUrl": "/proceedings-article/icmlc/2010/05460764/12OmNwE9OyC",
"parentPublication": {
"id": "proceedings/icmlc/2010/6006/0",
"title": "2nd International Conference on Machine Learning and Computing (ICMLC 2010)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sadfe/2007/2808/0/28080016",
"title": "Defining a Process Model for Forensic Analysis of Digital Devices and Storage Media",
"doi": null,
"abstractUrl": "/proceedings-article/sadfe/2007/28080016/12OmNxG1yVy",
"parentPublication": {
"id": "proceedings/sadfe/2007/2808/0",
"title": "Systematic Approaches to Digital Forensic Engineering, IEEE International Workshop on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icnc/2018/3652/0/08390330",
"title": "Digital Forensic Analysis of Instant Messaging Applications on Android Smartphones",
"doi": null,
"abstractUrl": "/proceedings-article/icnc/2018/08390330/12OmNyUWR2A",
"parentPublication": {
"id": "proceedings/icnc/2018/3652/0",
"title": "2018 International Conference on Computing, Networking and Communications (ICNC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/trustcom-bigdatase-i-spa/2015/7952/1/07345396",
"title": "Android Cache Taxonomy and Forensic Process",
"doi": null,
"abstractUrl": "/proceedings-article/trustcom-bigdatase-i-spa/2015/07345396/12OmNz5JCeo",
"parentPublication": {
"id": "proceedings/trustcom-bigdatase-i-spa/2015/7952/2",
"title": "2015 IEEE Trustcom/BigDataSE/ISPA",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/pc/2002/02/01012329",
"title": "The BlackBerry business",
"doi": null,
"abstractUrl": "/magazine/pc/2002/02/01012329/13rRUILtJoc",
"parentPublication": {
"id": "mags/pc",
"title": "IEEE Pervasive Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/sp/2009/02/msp2009020067",
"title": "A New Era of Presidential Security: The President and His BlackBerry",
"doi": null,
"abstractUrl": "/magazine/sp/2009/02/msp2009020067/13rRUyuvRvu",
"parentPublication": {
"id": "mags/sp",
"title": "IEEE Security & Privacy",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "1I1Pid9pIWs",
"title": "2022 IEEE International Symposium on Secure and Private Execution Environment Design (SEED)",
"acronym": "seed",
"groupId": "1843824",
"volume": "0",
"displayVolume": "0",
"year": "2022",
"__typename": "ProceedingType"
},
"article": {
"id": "1I1PjZKJhf2",
"doi": "10.1109/SEED55351.2022.00014",
"title": "Sequestered Encryption: A Hardware Technique for Comprehensive Data Privacy",
"normalizedTitle": "Sequestered Encryption: A Hardware Technique for Comprehensive Data Privacy",
"abstract": "Data breaches that penetrate web-facing servers and exfiltrate sensitive user data have become pervasive. Insulating these systems from attack is seemingly impossible due to the ubiquity of software vulnerabilities within cloud applications. It is simply insurmountable to adequately address all such vulnerabilities, and therefore imprudent to rely on software applications to protect user data. Rather, the ideal systems solution upholds data confidentiality, even in the presence of vulnerable or compromised software. Homomorphic encryption (HE) provides these capabilities, but its limited expressiveness and significant runtime overheads have inhibited its adoption. In this work, we explore how trusted hardware can be leveraged to provide data confidentiality in the presence of vulnerable software while achieving practical performance overheads. We present Sequestered Encryption (SE)—a hardware technique for data privacy that sequesters sensitive plaintext data into a small hardware root of trust and encrypts this data in all external microarchitectural structures, thereby rendering secret values inaccessible to software. With optimizations, SE achieves <2.5× performance slowdowns on average compared to native execution, demonstrating that architectural approaches can emerge as data privacy solutions that possess zero trust in software while being dynamic, expressive, and performant.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Data breaches that penetrate web-facing servers and exfiltrate sensitive user data have become pervasive. Insulating these systems from attack is seemingly impossible due to the ubiquity of software vulnerabilities within cloud applications. It is simply insurmountable to adequately address all such vulnerabilities, and therefore imprudent to rely on software applications to protect user data. Rather, the ideal systems solution upholds data confidentiality, even in the presence of vulnerable or compromised software. Homomorphic encryption (HE) provides these capabilities, but its limited expressiveness and significant runtime overheads have inhibited its adoption. In this work, we explore how trusted hardware can be leveraged to provide data confidentiality in the presence of vulnerable software while achieving practical performance overheads. We present Sequestered Encryption (SE)—a hardware technique for data privacy that sequesters sensitive plaintext data into a small hardware root of trust and encrypts this data in all external microarchitectural structures, thereby rendering secret values inaccessible to software. With optimizations, SE achieves <2.5× performance slowdowns on average compared to native execution, demonstrating that architectural approaches can emerge as data privacy solutions that possess zero trust in software while being dynamic, expressive, and performant.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Data breaches that penetrate web-facing servers and exfiltrate sensitive user data have become pervasive. Insulating these systems from attack is seemingly impossible due to the ubiquity of software vulnerabilities within cloud applications. It is simply insurmountable to adequately address all such vulnerabilities, and therefore imprudent to rely on software applications to protect user data. Rather, the ideal systems solution upholds data confidentiality, even in the presence of vulnerable or compromised software. Homomorphic encryption (HE) provides these capabilities, but its limited expressiveness and significant runtime overheads have inhibited its adoption. In this work, we explore how trusted hardware can be leveraged to provide data confidentiality in the presence of vulnerable software while achieving practical performance overheads. We present Sequestered Encryption (SE)—a hardware technique for data privacy that sequesters sensitive plaintext data into a small hardware root of trust and encrypts this data in all external microarchitectural structures, thereby rendering secret values inaccessible to software. With optimizations, SE achieves <2.5× performance slowdowns on average compared to native execution, demonstrating that architectural approaches can emerge as data privacy solutions that possess zero trust in software while being dynamic, expressive, and performant.",
"fno": "852600a073",
"keywords": [
"Cloud Computing",
"Computer Network Security",
"Cryptography",
"Data Privacy",
"Security Of Data",
"Sequestered Encryption",
"Hardware Technique",
"Comprehensive Data Privacy",
"Data Breaches",
"Web Facing Servers",
"Exfiltrate Sensitive User Data",
"Software Vulnerabilities",
"Cloud Applications",
"Software Applications",
"Ideal Systems Solution Upholds Data Confidentiality",
"Vulnerable Software",
"Compromised Software",
"Homomorphic Encryption",
"Significant Runtime Overheads",
"Trusted Hardware",
"Practical Performance Overheads",
"Sequestered Encryption",
"Sequesters Sensitive Plaintext Data",
"Data Privacy Solutions",
"Data Privacy",
"Microarchitecture",
"Runtime",
"Software Systems",
"Rendering Computer Graphics",
"Software",
"Hardware",
"Data Privacy",
"Privacy",
"Data Encryption",
"Secure Computation",
"Hardware Capability",
"Architecture"
],
"authors": [
{
"affiliation": "University of Michigan",
"fullName": "Lauren Biernacki",
"givenName": "Lauren",
"surname": "Biernacki",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "University of Michigan",
"fullName": "Meron Zerihun Demissie",
"givenName": "Meron Zerihun",
"surname": "Demissie",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "University of Colorado Boulder",
"fullName": "Kidus Birkayehu Workneh",
"givenName": "Kidus Birkayehu",
"surname": "Workneh",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Addis Ababa University",
"fullName": "Fitsum Assamnew Andargie",
"givenName": "Fitsum Assamnew",
"surname": "Andargie",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "University of Michigan",
"fullName": "Todd Austin",
"givenName": "Todd",
"surname": "Austin",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "seed",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2022-09-01T00:00:00",
"pubType": "proceedings",
"pages": "73-84",
"year": "2022",
"issn": null,
"isbn": "978-1-6654-8526-5",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "852600a061",
"articleId": "1I1Pk9IXCxy",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "852600a085",
"articleId": "1I1PlMOIjG8",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/wifs/2011/1017/0/06123130",
"title": "Smart selective encryption of CAVLC for H.264/AVC video",
"doi": null,
"abstractUrl": "/proceedings-article/wifs/2011/06123130/12OmNs0C9U2",
"parentPublication": {
"id": "proceedings/wifs/2011/1017/0",
"title": "Information Forensics and Security, IEEE International Workshop on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/seep/1996/7379/0/73790488",
"title": "Social issues in software engineering",
"doi": null,
"abstractUrl": "/proceedings-article/seep/1996/73790488/12OmNxVV5SO",
"parentPublication": {
"id": "proceedings/seep/1996/7379/0",
"title": "Proceedings 1996 International Conference Software Engineering: Education and Practice",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/candar/2017/2087/0/2087a068",
"title": "Semi-order Preserving Encryption Technique for Numeric Data to Enhance Privacy",
"doi": null,
"abstractUrl": "/proceedings-article/candar/2017/2087a068/12OmNyxFKlb",
"parentPublication": {
"id": "proceedings/candar/2017/2087/0",
"title": "2017 Fifth International Symposium on Computing and Networking (CANDAR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2014/03/ttk2014030752",
"title": "TrustedDB: A Trusted Hardware-Based Database with Privacy and Data Confidentiality",
"doi": null,
"abstractUrl": "/journal/tk/2014/03/ttk2014030752/13rRUytWF9H",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/seams/2018/5715/0/571501a172",
"title": "Defining, Enforcing and Checking Privacy Policies In Data-Intensive Applications",
"doi": null,
"abstractUrl": "/proceedings-article/seams/2018/571501a172/17D45WXIkGs",
"parentPublication": {
"id": "proceedings/seams/2018/5715/0",
"title": "2018 IEEE/ACM 13th International Symposium on Software Engineering for Adaptive and Self-Managing Systems (SEAMS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/smartcloud/2022/5179/0/517900a184",
"title": "Performance Impacts of JavaScript-Based Encryption of HTML5 Web Storage for Enhanced Privacy",
"doi": null,
"abstractUrl": "/proceedings-article/smartcloud/2022/517900a184/1JeFmpr8feg",
"parentPublication": {
"id": "proceedings/smartcloud/2022/5179/0",
"title": "2022 IEEE 7th International Conference on Smart Cloud (SmartCloud)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/trustcom/2022/9425/0/942500b054",
"title": "A formalization-based vulnerability detection method for cross-subject network components",
"doi": null,
"abstractUrl": "/proceedings-article/trustcom/2022/942500b054/1LFM5OEbRsY",
"parentPublication": {
"id": "proceedings/trustcom/2022/9425/0",
"title": "2022 IEEE International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ithings-greencom-cpscom-smartdata/2018/7975/0/08726560",
"title": "Privacy-Preserving Searchable Encryption Framework for Permissioned Blockchain Networks",
"doi": null,
"abstractUrl": "/proceedings-article/ithings-greencom-cpscom-smartdata/2018/08726560/1axfdVJ8ylO",
"parentPublication": {
"id": "proceedings/ithings-greencom-cpscom-smartdata/2018/7975/0",
"title": "2018 IEEE International Conference on Internet of Things (iThings) and IEEE Green Computing and Communications (GreenCom) and IEEE Cyber, Physical and Social Computing (CPSCom) and IEEE Smart Data (SmartData)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/msn/2020/9916/0/991600a630",
"title": "Verifiable Blockchain-Based Searchable Encryption with forward and backward privacy",
"doi": null,
"abstractUrl": "/proceedings-article/msn/2020/991600a630/1sBO3qQY9oI",
"parentPublication": {
"id": "proceedings/msn/2020/9916/0",
"title": "2020 16th International Conference on Mobility, Sensing and Networking (MSN)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdcs/2021/4513/0/451300a751",
"title": "Privacy-Preserving Neural Network Inference Framework via Homomorphic Encryption and SGX",
"doi": null,
"abstractUrl": "/proceedings-article/icdcs/2021/451300a751/1xqz39UTYpq",
"parentPublication": {
"id": "proceedings/icdcs/2021/4513/0",
"title": "2021 IEEE 41st International Conference on Distributed Computing Systems (ICDCS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNANTAy5",
"title": "2012 IEEE International Conference on Cluster Computing",
"acronym": "cluster",
"groupId": "1000095",
"volume": "0",
"displayVolume": "0",
"year": "2012",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNA14AbW",
"doi": "10.1109/CLUSTER.2012.78",
"title": "DisplayCluster: An Interactive Visualization Environment for Tiled Displays",
"normalizedTitle": "DisplayCluster: An Interactive Visualization Environment for Tiled Displays",
"abstract": "Display Cluster is an interactive visualization environment for cluster-driven tiled displays. It provides a dynamic, desktop-like windowing system with built-in media viewing capability that supports ultra high-resolution imagery and video content and streaming that allows arbitrary applications from remote sources (such as laptops or remote visualization machines) to be shown. This support extends to high-performance parallel visualization applications, enabling interactive streaming and display for hundred-mega pixel dynamic content. Display Cluster also supports multi-user, multi-modal interaction via devices such as joysticks, smart phones, and the Microsoft Kinect. Further, our environment provides a Python-based scripting interface to automate any set of interactions. In this paper, we describe the features and architecture of Display Cluster, compare it to existing tiled display environments, and present examples of how it can combine the capabilities of large-scale remote visualization clusters and high-resolution tiled display systems. In particular, we demonstrate that Display Cluster can stream and display up to 36 mega pixels in real time and as many as 144 mega pixels interactively, which is 3× faster and 4× larger than other available display environments. Further, we achieve over a gig pixel per second of aggregate bandwidth streaming between a remote visualization cluster and our tiled display system.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Display Cluster is an interactive visualization environment for cluster-driven tiled displays. It provides a dynamic, desktop-like windowing system with built-in media viewing capability that supports ultra high-resolution imagery and video content and streaming that allows arbitrary applications from remote sources (such as laptops or remote visualization machines) to be shown. This support extends to high-performance parallel visualization applications, enabling interactive streaming and display for hundred-mega pixel dynamic content. Display Cluster also supports multi-user, multi-modal interaction via devices such as joysticks, smart phones, and the Microsoft Kinect. Further, our environment provides a Python-based scripting interface to automate any set of interactions. In this paper, we describe the features and architecture of Display Cluster, compare it to existing tiled display environments, and present examples of how it can combine the capabilities of large-scale remote visualization clusters and high-resolution tiled display systems. In particular, we demonstrate that Display Cluster can stream and display up to 36 mega pixels in real time and as many as 144 mega pixels interactively, which is 3× faster and 4× larger than other available display environments. Further, we achieve over a gig pixel per second of aggregate bandwidth streaming between a remote visualization cluster and our tiled display system.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Display Cluster is an interactive visualization environment for cluster-driven tiled displays. It provides a dynamic, desktop-like windowing system with built-in media viewing capability that supports ultra high-resolution imagery and video content and streaming that allows arbitrary applications from remote sources (such as laptops or remote visualization machines) to be shown. This support extends to high-performance parallel visualization applications, enabling interactive streaming and display for hundred-mega pixel dynamic content. Display Cluster also supports multi-user, multi-modal interaction via devices such as joysticks, smart phones, and the Microsoft Kinect. Further, our environment provides a Python-based scripting interface to automate any set of interactions. In this paper, we describe the features and architecture of Display Cluster, compare it to existing tiled display environments, and present examples of how it can combine the capabilities of large-scale remote visualization clusters and high-resolution tiled display systems. In particular, we demonstrate that Display Cluster can stream and display up to 36 mega pixels in real time and as many as 144 mega pixels interactively, which is 3× faster and 4× larger than other available display environments. Further, we achieve over a gig pixel per second of aggregate bandwidth streaming between a remote visualization cluster and our tiled display system.",
"fno": "4807a239",
"keywords": [
"Streaming Media",
"Media",
"Libraries",
"Image Resolution",
"Rendering Computer Graphics",
"Image Coding",
"Bandwidth",
"Wide Area Networks",
"Visualization",
"Displays",
"High Performance Computing",
"Human Computer Interaction"
],
"authors": [
{
"affiliation": null,
"fullName": "Gregory P. Johnson",
"givenName": "Gregory P.",
"surname": "Johnson",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Gregory D. Abram",
"givenName": "Gregory D.",
"surname": "Abram",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Brandt Westing",
"givenName": "Brandt",
"surname": "Westing",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Paul Navr'til",
"givenName": "Paul",
"surname": "Navr'til",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Kelly Gaither",
"givenName": "Kelly",
"surname": "Gaither",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "cluster",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2012-09-01T00:00:00",
"pubType": "proceedings",
"pages": "239-247",
"year": "2012",
"issn": null,
"isbn": "978-1-4673-2422-9",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "4807a230",
"articleId": "12OmNxbW4UU",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "4807a248",
"articleId": "12OmNz5apGz",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/icig/2004/2244/0/01410480",
"title": "A survey of multi-projector tiled display wall construction",
"doi": null,
"abstractUrl": "/proceedings-article/icig/2004/01410480/12OmNAWH9up",
"parentPublication": {
"id": "proceedings/icig/2004/2244/0",
"title": "Proceedings. Third International Conference on Image and Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/grc/2011/0372/0/06122667",
"title": "A visualization adapter for SAGE-enabled tiled display wall",
"doi": null,
"abstractUrl": "/proceedings-article/grc/2011/06122667/12OmNAoDidx",
"parentPublication": {
"id": "proceedings/grc/2011/0372/0",
"title": "2011 IEEE International Conference on Granular Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/nbis/2011/4458/0/4458a456",
"title": "A New Interface for Large Scale Tiled Display System Considering Scalability",
"doi": null,
"abstractUrl": "/proceedings-article/nbis/2011/4458a456/12OmNBU1jQj",
"parentPublication": {
"id": "proceedings/nbis/2011/4458/0",
"title": "2011 14th International Conference on Network-Based Information Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cluster/2004/8694/0/8694411",
"title": "JuxtaView - a tool for interactive visualization of large imagery on scalable tiled displays",
"doi": null,
"abstractUrl": "/proceedings-article/cluster/2004/8694411/12OmNBdru8f",
"parentPublication": {
"id": "proceedings/cluster/2004/8694/0",
"title": "2004 IEEE International Conference on Cluster Computing (IEEE Cat. No.04EX935)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ldav/2015/8517/0/07348084",
"title": "Streaming ultra high resolution images to large tiled display at nearly interactive frame rate with vl3",
"doi": null,
"abstractUrl": "/proceedings-article/ldav/2015/07348084/12OmNBtl1xo",
"parentPublication": {
"id": "proceedings/ldav/2015/8517/0",
"title": "2015 IEEE 5th Symposium on Large Data Analysis and Visualization (LDAV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/nbis/2009/3767/0/3767a612",
"title": "Study on Realistic Communication Technology with Tiled Displays Wall",
"doi": null,
"abstractUrl": "/proceedings-article/nbis/2009/3767a612/12OmNqBKUf2",
"parentPublication": {
"id": "proceedings/nbis/2009/3767/0",
"title": "2009 International Conference on Network-Based Information Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/waina/2009/3639/0/3639a554",
"title": "An Experiment on Tele-immersive Communication with Tiled Displays Wall over JGN2plus Network",
"doi": null,
"abstractUrl": "/proceedings-article/waina/2009/3639a554/12OmNqJ8tuG",
"parentPublication": {
"id": "proceedings/waina/2009/3639/0",
"title": "2009 International Conference on Advanced Information Networking and Applications Workshops",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/nbis/2012/4779/0/4779a540",
"title": "Approaches to Display of Ultra-resolution Video Streaming by Multi-transmission on Tiled Display Environment",
"doi": null,
"abstractUrl": "/proceedings-article/nbis/2012/4779a540/12OmNqOOrKv",
"parentPublication": {
"id": "proceedings/nbis/2012/4779/0",
"title": "2012 15th International Conference on Network-Based Information Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ainaw/2007/2847/2/04224229",
"title": "Tele-Immersive Collaboration Using High-Resolution Video in Tiled Displays Environment",
"doi": null,
"abstractUrl": "/proceedings-article/ainaw/2007/04224229/12OmNwCsdLk",
"parentPublication": {
"id": "proceedings/ainaw/2007/2847/2",
"title": "Advanced Information Networking and Applications Workshops, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/nbis/2015/9942/0/9942a536",
"title": "Application of Tiled Display Environment for High Presence Informal Communication",
"doi": null,
"abstractUrl": "/proceedings-article/nbis/2015/9942a536/12OmNzC5SWM",
"parentPublication": {
"id": "proceedings/nbis/2015/9942/0",
"title": "2015 18th International Conference on Network-Based Information Systems (NBiS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNx8wTfL",
"title": "ICPR 2008 19th International Conference on Pattern Recognition",
"acronym": "icpr",
"groupId": "1000545",
"volume": "0",
"displayVolume": "0",
"year": "2008",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNAXglMB",
"doi": "10.1109/ICPR.2008.4761419",
"title": "Human action recognition using temporal-state shape contexts",
"normalizedTitle": "Human action recognition using temporal-state shape contexts",
"abstract": "In this paper, we present a temporal-state shape context (TSSC) method that exploits space-time shape variations for human action recognition. In our method, the silhouettes of objects in a video clip are organized into three temporal states. These states are defined by fuzzy time intervals, which can lessen the degradation of recognition performance caused by time warping effects. The TSSC features capture local characteristics of the space-time shape induced by consecutive changes of silhouettes. Experimental results show that our method is effective for human action recognition, and is reliable when there are various kinds of deformations. Moreover, our method can identify spatially inconsistent parts between two shapes of the actions, which could be useful in action analysis applications.",
"abstracts": [
{
"abstractType": "Regular",
"content": "In this paper, we present a temporal-state shape context (TSSC) method that exploits space-time shape variations for human action recognition. In our method, the silhouettes of objects in a video clip are organized into three temporal states. These states are defined by fuzzy time intervals, which can lessen the degradation of recognition performance caused by time warping effects. The TSSC features capture local characteristics of the space-time shape induced by consecutive changes of silhouettes. Experimental results show that our method is effective for human action recognition, and is reliable when there are various kinds of deformations. Moreover, our method can identify spatially inconsistent parts between two shapes of the actions, which could be useful in action analysis applications.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "In this paper, we present a temporal-state shape context (TSSC) method that exploits space-time shape variations for human action recognition. In our method, the silhouettes of objects in a video clip are organized into three temporal states. These states are defined by fuzzy time intervals, which can lessen the degradation of recognition performance caused by time warping effects. The TSSC features capture local characteristics of the space-time shape induced by consecutive changes of silhouettes. Experimental results show that our method is effective for human action recognition, and is reliable when there are various kinds of deformations. Moreover, our method can identify spatially inconsistent parts between two shapes of the actions, which could be useful in action analysis applications.",
"fno": "04761419",
"keywords": [
"Image Motion Analysis",
"Object Recognition",
"Video Signal Processing",
"Human Action Recognition",
"Temporal State Shape Contexts",
"Space Time Shape Variations",
"Video Clip",
"Fuzzy Time Intervals",
"Time Warping Effects",
"Action Analysis",
"Humans",
"Shape",
"Video Sequences",
"Degradation",
"Application Software",
"Image Motion Analysis",
"Feature Extraction",
"Information Science",
"Information Systems",
"Computer Vision"
],
"authors": [
{
"affiliation": "Institue of Information Science, Academia Sinica, Taipei, Taiwan",
"fullName": "Pei-Chi Hsiao",
"givenName": null,
"surname": "Pei-Chi Hsiao",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Institue of Information Science, Academia Sinica, Taipei, Taiwan",
"fullName": "Chu-Song Chen",
"givenName": null,
"surname": "Chu-Song Chen",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Institue of Information Systems and Application, National Tsing Hua University, Hsinchu, Taiwan",
"fullName": "Long-Wen Chang",
"givenName": null,
"surname": "Long-Wen Chang",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "icpr",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2008-12-01T00:00:00",
"pubType": "proceedings",
"pages": "",
"year": "2008",
"issn": "1051-4651",
"isbn": "978-1-4244-2174-9",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "04761418",
"articleId": "12OmNCmGNZA",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "04761420",
"articleId": "12OmNzBwGze",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/icpr/2008/2174/0/04761160",
"title": "Violence classification based on shape variations from multiple views",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2008/04761160/12OmNBhpRYq",
"parentPublication": {
"id": "proceedings/icpr/2008/2174/0",
"title": "ICPR 2008 19th International Conference on Pattern Recognition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccvw/2011/0063/0/06130399",
"title": "Probabilistic subspace-based learning of shape dynamics modes for multi-view action recognition",
"doi": null,
"abstractUrl": "/proceedings-article/iccvw/2011/06130399/12OmNBuL15d",
"parentPublication": {
"id": "proceedings/iccvw/2011/0063/0",
"title": "2011 IEEE International Conference on Computer Vision Workshops (ICCV Workshops)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2008/2174/0/04761435",
"title": "3D Shape Context and Distance Transform for action recognition",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2008/04761435/12OmNrJRPnA",
"parentPublication": {
"id": "proceedings/icpr/2008/2174/0",
"title": "ICPR 2008 19th International Conference on Pattern Recognition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2010/4109/0/4109b816",
"title": "A Global Spatio-Temporal Representation for Action Recognition",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2010/4109b816/12OmNwHz01F",
"parentPublication": {
"id": "proceedings/icpr/2010/4109/0",
"title": "Pattern Recognition, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccvw/2011/0063/0/06130403",
"title": "Temporal key poses for human action recognition",
"doi": null,
"abstractUrl": "/proceedings-article/iccvw/2011/06130403/12OmNxT56AE",
"parentPublication": {
"id": "proceedings/iccvw/2011/0063/0",
"title": "2011 IEEE International Conference on Computer Vision Workshops (ICCV Workshops)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cbaivl/2000/0695/0/06950020",
"title": "Matching with Shape Contexts",
"doi": null,
"abstractUrl": "/proceedings-article/cbaivl/2000/06950020/12OmNxaw5ek",
"parentPublication": {
"id": "proceedings/cbaivl/2000/0695/0",
"title": "Content-Based Access of Image and Video Libraries, IEEE Workshop on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2006/2521/2/252121266",
"title": "Informative Shape Representations for Human Action Recognition",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2006/252121266/12OmNy87Qyn",
"parentPublication": {
"id": "proceedings/icpr/2006/2521/2",
"title": "Pattern Recognition, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icme/2007/1016/0/04284738",
"title": "Human Action Recognition Using 2-D Spatio-Temporal Templates",
"doi": null,
"abstractUrl": "/proceedings-article/icme/2007/04284738/12OmNyoSbaC",
"parentPublication": {
"id": "proceedings/icme/2007/1016/0",
"title": "2007 International Conference on Multimedia & Expo",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sibgrapi/2009/3813/0/3813a299",
"title": "Action Recognition in Video by Covariance Matching of Silhouette Tunnels",
"doi": null,
"abstractUrl": "/proceedings-article/sibgrapi/2009/3813a299/12OmNzahc58",
"parentPublication": {
"id": "proceedings/sibgrapi/2009/3813/0",
"title": "2009 XXII Brazilian Symposium on Computer Graphics and Image Processing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sitis/2011/4635/0/4635a291",
"title": "Video Action Classification: A New Approach Combining Spatio-temporal Krawtchouk Moments and Laplacian Eigenmaps",
"doi": null,
"abstractUrl": "/proceedings-article/sitis/2011/4635a291/12OmNzgNXX9",
"parentPublication": {
"id": "proceedings/sitis/2011/4635/0",
"title": "2011 Seventh International Conference on Signal Image Technology & Internet-Based Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "17D45VtKirA",
"title": "2018 15th Conference on Computer and Robot Vision (CRV)",
"acronym": "crv",
"groupId": "1001794",
"volume": "0",
"displayVolume": "0",
"year": "2018",
"__typename": "ProceedingType"
},
"article": {
"id": "17D45W2Wyz8",
"doi": "10.1109/CRV.2018.00019",
"title": "Real-Time Large-Scale Fusion of High Resolution 3D Scans with Details Preservation",
"normalizedTitle": "Real-Time Large-Scale Fusion of High Resolution 3D Scans with Details Preservation",
"abstract": "This paper presents a real-time 3D shape fusion system that faithfully integrates very high resolution 3D scans with the goal of maximizing details preservation. The system fully maps complex shapes while allowing free movement similarly to dense SLAM systems in robotics where sensor fusion techniques map large environments. We propose a novel framework to integrate shapes into a volume with fine details preservation of the reconstructed shape which is an important aspect in many applications, especially for industrial inspection. The truncated signed distance function is generalized with a global variational scheme that controls edge preservation and leads to updating cumulative rules adapted for GPU implementation. The framework also embeds a map deformation method to online deform the shape and correct the system trajectory drift at few microns accuracy. Results are presented from the integrated system on two mechanical objects which illustrate the benefits of the proposed approach.",
"abstracts": [
{
"abstractType": "Regular",
"content": "This paper presents a real-time 3D shape fusion system that faithfully integrates very high resolution 3D scans with the goal of maximizing details preservation. The system fully maps complex shapes while allowing free movement similarly to dense SLAM systems in robotics where sensor fusion techniques map large environments. We propose a novel framework to integrate shapes into a volume with fine details preservation of the reconstructed shape which is an important aspect in many applications, especially for industrial inspection. The truncated signed distance function is generalized with a global variational scheme that controls edge preservation and leads to updating cumulative rules adapted for GPU implementation. The framework also embeds a map deformation method to online deform the shape and correct the system trajectory drift at few microns accuracy. Results are presented from the integrated system on two mechanical objects which illustrate the benefits of the proposed approach.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "This paper presents a real-time 3D shape fusion system that faithfully integrates very high resolution 3D scans with the goal of maximizing details preservation. The system fully maps complex shapes while allowing free movement similarly to dense SLAM systems in robotics where sensor fusion techniques map large environments. We propose a novel framework to integrate shapes into a volume with fine details preservation of the reconstructed shape which is an important aspect in many applications, especially for industrial inspection. The truncated signed distance function is generalized with a global variational scheme that controls edge preservation and leads to updating cumulative rules adapted for GPU implementation. The framework also embeds a map deformation method to online deform the shape and correct the system trajectory drift at few microns accuracy. Results are presented from the integrated system on two mechanical objects which illustrate the benefits of the proposed approach.",
"fno": "648101a063",
"keywords": [
"Graphics Processing Units",
"Image Fusion",
"Image Reconstruction",
"Mobile Robots",
"Robot Vision",
"SLAM Robots",
"Stereo Image Processing",
"Mechanical Objects",
"GPU Implementation",
"Industrial Inspection",
"Robotics",
"SLAM Systems",
"3 D Scans",
"Integrated System",
"System Trajectory Drift",
"Edge Preservation",
"Reconstructed Shape",
"Sensor Fusion Techniques",
"Three Dimensional Displays",
"Solid Modeling",
"Cameras",
"Graphics Processing Units",
"Real Time Systems",
"Shape",
"Simultaneous Localization And Mapping",
"RGB D",
"Real Time Fusion",
"Large Scale 3 D Scans",
"Volumetric Representation",
"Dense SLAM",
"GPU"
],
"authors": [
{
"affiliation": null,
"fullName": "Hicham Sekkati",
"givenName": "Hicham",
"surname": "Sekkati",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Jonathan Boisvert",
"givenName": "Jonathan",
"surname": "Boisvert",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Guy Godin",
"givenName": "Guy",
"surname": "Godin",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Louis Borgeat",
"givenName": "Louis",
"surname": "Borgeat",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "crv",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2018-05-01T00:00:00",
"pubType": "proceedings",
"pages": "63-70",
"year": "2018",
"issn": null,
"isbn": "978-1-5386-6481-0",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "648101a055",
"articleId": "17D45XvMcav",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "648101a071",
"articleId": "17D45WHONlp",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/sibgrapi/2013/5099/0/5099a210",
"title": "Visual and Inertial Data Fusion for Globally Consistent Point Cloud Registration",
"doi": null,
"abstractUrl": "/proceedings-article/sibgrapi/2013/5099a210/12OmNwGIcAY",
"parentPublication": {
"id": "proceedings/sibgrapi/2013/5099/0",
"title": "2013 XXVI Conference on Graphics, Patterns and Images",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wacv/2017/4822/0/07926687",
"title": "Gaussian Mixture Models for Temporal Depth Fusion",
"doi": null,
"abstractUrl": "/proceedings-article/wacv/2017/07926687/12OmNxzuMGW",
"parentPublication": {
"id": "proceedings/wacv/2017/4822/0",
"title": "2017 IEEE Winter Conference on Applications of Computer Vision (WACV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccvw/2017/1034/0/1034c418",
"title": "Probabilistic Surfel Fusion for Dense LiDAR Mapping",
"doi": null,
"abstractUrl": "/proceedings-article/iccvw/2017/1034c418/12OmNyQYtiq",
"parentPublication": {
"id": "proceedings/iccvw/2017/1034/0",
"title": "2017 IEEE International Conference on Computer Vision Workshop (ICCVW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wacv/2017/4822/0/07926634",
"title": "SAMP: Shape and Motion Priors for 4D Vehicle Reconstruction",
"doi": null,
"abstractUrl": "/proceedings-article/wacv/2017/07926634/12OmNzlUKlY",
"parentPublication": {
"id": "proceedings/wacv/2017/4822/0",
"title": "2017 IEEE Winter Conference on Applications of Computer Vision (WACV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/2021/2812/0/281200f926",
"title": "ELLIPSDF: Joint Object Pose and Shape Optimization with a Bi-level Ellipsoid and Signed Distance Function Description",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2021/281200f926/1BmGCDjScrC",
"parentPublication": {
"id": "proceedings/iccv/2021/2812/0",
"title": "2021 IEEE/CVF International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bigcomp/2020/6034/0/603400a459",
"title": "Multi-sensor Fusion Towards VINS: A Concise Tutorial, Survey, Framework and Challenges",
"doi": null,
"abstractUrl": "/proceedings-article/bigcomp/2020/603400a459/1jdDtY4Y5KE",
"parentPublication": {
"id": "proceedings/bigcomp/2020/6034/0",
"title": "2020 IEEE International Conference on Big Data and Smart Computing (BigComp)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/3dv/2020/8128/0/812800a949",
"title": "NodeSLAM: Neural Object Descriptors for Multi-View Shape Reconstruction",
"doi": null,
"abstractUrl": "/proceedings-article/3dv/2020/812800a949/1qyxnEJMyoo",
"parentPublication": {
"id": "proceedings/3dv/2020/8128/0",
"title": "2020 International Conference on 3D Vision (3DV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icceai/2021/3960/0/396000a335",
"title": "Infrared and Visible Image Fusion Based on Multi-scale Decomposition and Texture Preservation Model",
"doi": null,
"abstractUrl": "/proceedings-article/icceai/2021/396000a335/1xqyQaveMRG",
"parentPublication": {
"id": "proceedings/icceai/2021/3960/0",
"title": "2021 International Conference on Computer Engineering and Artificial Intelligence (ICCEAI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccnea/2021/4486/0/448600a289",
"title": "SLAM Method Based on Multi-Sensor Information Fusion",
"doi": null,
"abstractUrl": "/proceedings-article/iccnea/2021/448600a289/1yEZmK3PgZy",
"parentPublication": {
"id": "proceedings/iccnea/2021/4486/0",
"title": "2021 International Conference on Computer Network, Electronic and Automation (ICCNEA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/3dv/2021/2688/0/268800b362",
"title": "DSP-SLAM: Object Oriented SLAM with Deep Shape Priors",
"doi": null,
"abstractUrl": "/proceedings-article/3dv/2021/268800b362/1zWEhxN28YU",
"parentPublication": {
"id": "proceedings/3dv/2021/2688/0",
"title": "2021 International Conference on 3D Vision (3DV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "1m3n9N02qgE",
"title": "2020 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)",
"acronym": "cvpr",
"groupId": "1000147",
"volume": "0",
"displayVolume": "0",
"year": "2020",
"__typename": "ProceedingType"
},
"article": {
"id": "1m3nsjiR8Ck",
"doi": "10.1109/CVPR42600.2020.00082",
"title": "Lightweight Photometric Stereo for Facial Details Recovery",
"normalizedTitle": "Lightweight Photometric Stereo for Facial Details Recovery",
"abstract": "Recently, 3D face reconstruction from a single image has achieved great success with the help of deep learning and shape prior knowledge, but they often fail to produce accurate geometry details. On the other hand, photometric stereo methods can recover reliable geometry details, but require dense inputs and need to solve a complex optimization problem. In this paper, we present a lightweight strategy that only requires sparse inputs or even a single image to recover high-fidelity face shapes with images captured under near-field lights. To this end, we construct a dataset containing 84 different subjects with 29 expressions under 3 different lights. Data augmentation is applied to enrich the data in terms of diversity in identity, lighting, expression, etc. With this constructed dataset, we propose a novel neural network specially designed for photometric stereo based 3D face reconstruction. Extensive experiments and comparisons demonstrate that our method can generate high-quality reconstruction results with one to three facial images captured under near-field lights. Our full framework is available at https://github.com/Juyong/FacePSNet.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Recently, 3D face reconstruction from a single image has achieved great success with the help of deep learning and shape prior knowledge, but they often fail to produce accurate geometry details. On the other hand, photometric stereo methods can recover reliable geometry details, but require dense inputs and need to solve a complex optimization problem. In this paper, we present a lightweight strategy that only requires sparse inputs or even a single image to recover high-fidelity face shapes with images captured under near-field lights. To this end, we construct a dataset containing 84 different subjects with 29 expressions under 3 different lights. Data augmentation is applied to enrich the data in terms of diversity in identity, lighting, expression, etc. With this constructed dataset, we propose a novel neural network specially designed for photometric stereo based 3D face reconstruction. Extensive experiments and comparisons demonstrate that our method can generate high-quality reconstruction results with one to three facial images captured under near-field lights. Our full framework is available at https://github.com/Juyong/FacePSNet.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Recently, 3D face reconstruction from a single image has achieved great success with the help of deep learning and shape prior knowledge, but they often fail to produce accurate geometry details. On the other hand, photometric stereo methods can recover reliable geometry details, but require dense inputs and need to solve a complex optimization problem. In this paper, we present a lightweight strategy that only requires sparse inputs or even a single image to recover high-fidelity face shapes with images captured under near-field lights. To this end, we construct a dataset containing 84 different subjects with 29 expressions under 3 different lights. Data augmentation is applied to enrich the data in terms of diversity in identity, lighting, expression, etc. With this constructed dataset, we propose a novel neural network specially designed for photometric stereo based 3D face reconstruction. Extensive experiments and comparisons demonstrate that our method can generate high-quality reconstruction results with one to three facial images captured under near-field lights. Our full framework is available at https://github.com/Juyong/FacePSNet.",
"fno": "716800a737",
"keywords": [
"Emotion Recognition",
"Face Recognition",
"Image Capture",
"Image Reconstruction",
"Learning Artificial Intelligence",
"Neural Nets",
"Stereo Image Processing",
"Data Augmentation",
"3 D Face Reconstruction",
"Facial Images",
"Near Field Lights",
"Lightweight Photometric Stereo",
"Deep Learning",
"Shape Prior Knowledge",
"Photometric Stereo Methods",
"Complex Optimization Problem",
"Lightweight Strategy",
"Facial Detail Recovery",
"High Fidelity Face Shapes",
"Neural Network",
"Face",
"Three Dimensional Displays",
"Image Reconstruction",
"Lighting",
"Solid Modeling",
"Light Sources",
"Shape"
],
"authors": [
{
"affiliation": "University of Science and Technology of China",
"fullName": "Xueying Wang",
"givenName": "Xueying",
"surname": "Wang",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "University of Science and Technology of China",
"fullName": "Yudong Guo",
"givenName": "Yudong",
"surname": "Guo",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Cardiff University",
"fullName": "Bailin Deng",
"givenName": "Bailin",
"surname": "Deng",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "University of Science and Technology of China",
"fullName": "Juyong Zhang",
"givenName": "Juyong",
"surname": "Zhang",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "cvpr",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2020-06-01T00:00:00",
"pubType": "proceedings",
"pages": "737-746",
"year": "2020",
"issn": null,
"isbn": "978-1-7281-7168-5",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "716800a727",
"articleId": "1m3o6VvfzYk",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "716800a747",
"articleId": "1m3nK2tEm9G",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/3dv/2015/8332/0/8332a028",
"title": "x-Hour Outdoor Photometric Stereo",
"doi": null,
"abstractUrl": "/proceedings-article/3dv/2015/8332a028/12OmNCesr5K",
"parentPublication": {
"id": "proceedings/3dv/2015/8332/0",
"title": "2015 International Conference on 3D Vision (3DV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccp/2018/2526/0/08368465",
"title": "Near-light photometric stereo using circularly placed point light sources",
"doi": null,
"abstractUrl": "/proceedings-article/iccp/2018/08368465/12OmNqBbHSi",
"parentPublication": {
"id": "proceedings/iccp/2018/2526/0",
"title": "2018 IEEE International Conference on Computational Photography (ICCP)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/1989/1952/0/00037826",
"title": "A theory of photometric stereo for a general class of reflectance maps",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/1989/00037826/12OmNqJHFLT",
"parentPublication": {
"id": "proceedings/cvpr/1989/1952/0",
"title": "1989 IEEE Computer Society Conference on Computer Vision and Pattern Recognition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccp/2013/6463/0/06528306",
"title": "Outdoor photometric stereo",
"doi": null,
"abstractUrl": "/proceedings-article/iccp/2013/06528306/12OmNrNh0Dh",
"parentPublication": {
"id": "proceedings/iccp/2013/6463/0",
"title": "2013 IEEE International Conference on Computational Photography (ICCP)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/2015/8391/0/8391d478",
"title": "Photometric Stereo with Small Angular Variations",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2015/8391d478/12OmNwE9OqB",
"parentPublication": {
"id": "proceedings/iccv/2015/8391/0",
"title": "2015 IEEE International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wacv/2015/6683/0/6683a302",
"title": "Photometric Stereo in the Wild",
"doi": null,
"abstractUrl": "/proceedings-article/wacv/2015/6683a302/12OmNznkK53",
"parentPublication": {
"id": "proceedings/wacv/2015/6683/0",
"title": "2015 IEEE Winter Conference on Applications of Computer Vision (WACV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2018/6420/0/642000e635",
"title": "Sparse Photometric 3D Face Reconstruction Guided by Morphable Models",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2018/642000e635/17D45X2fUIW",
"parentPublication": {
"id": "proceedings/cvpr/2018/6420/0",
"title": "2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2019/03/08681452",
"title": "Mesh-Based Computation for Solving Photometric Stereo With Near Point Lighting",
"doi": null,
"abstractUrl": "/magazine/cg/2019/03/08681452/18XhxGhBiCs",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wacv/2022/0915/0/091500a317",
"title": "Symmetric-light Photometric Stereo",
"doi": null,
"abstractUrl": "/proceedings-article/wacv/2022/091500a317/1B12PputGEg",
"parentPublication": {
"id": "proceedings/wacv/2022/0915/0",
"title": "2022 IEEE/CVF Winter Conference on Applications of Computer Vision (WACV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/2019/4803/0/480300b052",
"title": "A Differential Volumetric Approach to Multi-View Photometric Stereo",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2019/480300b052/1hVlAZv5zfG",
"parentPublication": {
"id": "proceedings/iccv/2019/4803/0",
"title": "2019 IEEE/CVF International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "1uqGdWlamUo",
"title": "2021 IEEE Winter Conference on Applications of Computer Vision (WACV)",
"acronym": "wacv",
"groupId": "1000040",
"volume": "0",
"displayVolume": "0",
"year": "2021",
"__typename": "ProceedingType"
},
"article": {
"id": "1uqGvnSQkxi",
"doi": "10.1109/WACV48630.2021.00043",
"title": "Towards Enhancing Fine-grained Details for Image Matting",
"normalizedTitle": "Towards Enhancing Fine-grained Details for Image Matting",
"abstract": "In recent years, deep natural image matting has been rapidly evolved by extracting high-level contextual features into the model. However, most current methods still have difficulties with handling tiny details, like hairs or furs. In this paper, we argue that recovering these microscopic de-tails relies on low-level but high-definition texture features. However, these features are downsampled in a very early stage in current encoder-decoder-based models, resulting in the loss of microscopic details. To address this issue, we design a deep image matting model to enhance fine-grained details. Our model consists of two parallel paths: a conventional encoder-decoder Semantic Path and an independent downsampling-free Textural Compensate Path (TCP). The TCP is proposed to extract fine-grained details such as lines and edges in the original image size, which greatly enhances the fineness of prediction. Meanwhile, to lever-age the benefits of high-level context, we propose a feature fusion unit(FFU) to fuse multi-scale features from the se-mantic path and inject them into the TCP. In addition, we have observed that poorly annotated trimaps severely affect the performance of the model. Thus we further propose a novel term in loss function and a trimap generation method to improve our model’s robustness to the trimaps. The experiments show that our method outperforms previous start-of-the-art methods on the Composition-1k dataset.",
"abstracts": [
{
"abstractType": "Regular",
"content": "In recent years, deep natural image matting has been rapidly evolved by extracting high-level contextual features into the model. However, most current methods still have difficulties with handling tiny details, like hairs or furs. In this paper, we argue that recovering these microscopic de-tails relies on low-level but high-definition texture features. However, these features are downsampled in a very early stage in current encoder-decoder-based models, resulting in the loss of microscopic details. To address this issue, we design a deep image matting model to enhance fine-grained details. Our model consists of two parallel paths: a conventional encoder-decoder Semantic Path and an independent downsampling-free Textural Compensate Path (TCP). The TCP is proposed to extract fine-grained details such as lines and edges in the original image size, which greatly enhances the fineness of prediction. Meanwhile, to lever-age the benefits of high-level context, we propose a feature fusion unit(FFU) to fuse multi-scale features from the se-mantic path and inject them into the TCP. In addition, we have observed that poorly annotated trimaps severely affect the performance of the model. Thus we further propose a novel term in loss function and a trimap generation method to improve our model’s robustness to the trimaps. The experiments show that our method outperforms previous start-of-the-art methods on the Composition-1k dataset.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "In recent years, deep natural image matting has been rapidly evolved by extracting high-level contextual features into the model. However, most current methods still have difficulties with handling tiny details, like hairs or furs. In this paper, we argue that recovering these microscopic de-tails relies on low-level but high-definition texture features. However, these features are downsampled in a very early stage in current encoder-decoder-based models, resulting in the loss of microscopic details. To address this issue, we design a deep image matting model to enhance fine-grained details. Our model consists of two parallel paths: a conventional encoder-decoder Semantic Path and an independent downsampling-free Textural Compensate Path (TCP). The TCP is proposed to extract fine-grained details such as lines and edges in the original image size, which greatly enhances the fineness of prediction. Meanwhile, to lever-age the benefits of high-level context, we propose a feature fusion unit(FFU) to fuse multi-scale features from the se-mantic path and inject them into the TCP. In addition, we have observed that poorly annotated trimaps severely affect the performance of the model. Thus we further propose a novel term in loss function and a trimap generation method to improve our model’s robustness to the trimaps. The experiments show that our method outperforms previous start-of-the-art methods on the Composition-1k dataset.",
"fno": "047700a385",
"keywords": [
"Computer Graphics",
"Feature Extraction",
"Image Coding",
"Image Colour Analysis",
"Image Fusion",
"Image Reconstruction",
"Image Representation",
"Image Resolution",
"Image Sampling",
"Image Segmentation",
"Image Texture",
"Composition 1 K Dataset",
"Loss Function",
"Conventional Encoder Decoder Semantic Path",
"Independent Downsampling Free Textural Compensate Path",
"Deep Natural Image Matting",
"Trimap Generation Method",
"Semantic Path",
"Multiscale Features",
"High Level Context",
"Original Image Size",
"TCP",
"Parallel Paths",
"Deep Image Matting Model",
"Microscopic Details",
"High Definition Texture Features",
"High Level Contextual Features",
"Measurement",
"Hair",
"Fuses",
"Microscopy",
"Image Edge Detection",
"Conferences",
"Semantics"
],
"authors": [
{
"affiliation": "Nanyang Technological University,Singapore",
"fullName": "Chang Liu",
"givenName": "Chang",
"surname": "Liu",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Nanyang Technological University,Singapore",
"fullName": "Henghui Ding",
"givenName": "Henghui",
"surname": "Ding",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Nanyang Technological University,Singapore",
"fullName": "Xudong Jiang",
"givenName": "Xudong",
"surname": "Jiang",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "wacv",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2021-01-01T00:00:00",
"pubType": "proceedings",
"pages": "385-393",
"year": "2021",
"issn": null,
"isbn": "978-1-6654-0477-8",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "047700a375",
"articleId": "1uqGIbTZVks",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "047700a394",
"articleId": "1uqGj29TLAQ",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/cvpr/2022/6946/0/694600l1697",
"title": "Boosting Robustness of Image Matting with Context Assembling and Strong Data Augmentation",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2022/694600l1697/1H1j1iOs20U",
"parentPublication": {
"id": "proceedings/cvpr/2022/6946/0",
"title": "2022 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccia/2018/9571/0/652800a157",
"title": "Using Convolutional Neural Networks for Automated Fine Grained Image Classification of Acute Lymphoblastic Leukemia",
"doi": null,
"abstractUrl": "/proceedings-article/iccia/2018/652800a157/1a3xgI2qqKA",
"parentPublication": {
"id": "proceedings/iccia/2018/9571/0",
"title": "2018 3rd International Conference on Computational Intelligence and Applications (ICCIA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bigmm/2019/5527/0/552700a058",
"title": "Text2FaceGAN: Face Generation from Fine Grained Textual Descriptions",
"doi": null,
"abstractUrl": "/proceedings-article/bigmm/2019/552700a058/1fHjHIXW3Xa",
"parentPublication": {
"id": "proceedings/bigmm/2019/5527/0",
"title": "2019 IEEE Fifth International Conference on Multimedia Big Data (BigMM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/2019/4803/0/480300h392",
"title": "SkyScapes Fine-Grained Semantic Understanding of Aerial Scenes",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2019/480300h392/1hQqswrH62k",
"parentPublication": {
"id": "proceedings/iccv/2019/4803/0",
"title": "2019 IEEE/CVF International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/2019/4803/0/480300d265",
"title": "Indices Matter: Learning to Index for Deep Image Matting",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2019/480300d265/1hVlyJIMoZW",
"parentPublication": {
"id": "proceedings/iccv/2019/4803/0",
"title": "2019 IEEE/CVF International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2020/7168/0/716800i560",
"title": "Boosting Semantic Human Matting With Coarse Annotations",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2020/716800i560/1m3nGi8GNdC",
"parentPublication": {
"id": "proceedings/cvpr/2020/7168/0",
"title": "2020 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2020/7168/0/716800n3673",
"title": "Attention-Guided Hierarchical Structure Aggregation for Image Matting",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2020/716800n3673/1m3o1RHpGwg",
"parentPublication": {
"id": "proceedings/cvpr/2020/7168/0",
"title": "2020 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdh/2020/9234/0/923400a045",
"title": "A Controllable Spring Force Based Method for Fluid Surface Disturbance Details Simulation",
"doi": null,
"abstractUrl": "/proceedings-article/icdh/2020/923400a045/1uGXV1Qs8IU",
"parentPublication": {
"id": "proceedings/icdh/2020/9234/0",
"title": "2020 8th International Conference on Digital Home (ICDH)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2021/4509/0/450900l1115",
"title": "Semantic Image Matting",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2021/450900l1115/1yeHY2siKsg",
"parentPublication": {
"id": "proceedings/cvpr/2021/4509/0",
"title": "2021 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2021/4509/0/450900i758",
"title": "Real-Time High-Resolution Background Matting",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2021/450900i758/1yeIt6OtN28",
"parentPublication": {
"id": "proceedings/cvpr/2021/4509/0",
"title": "2021 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNzy7uOx",
"title": "Proceedings. SCCC'99 XIX International Conference of the Chilean Computer Science Society",
"acronym": "sccc",
"groupId": "1001489",
"volume": "0",
"displayVolume": "0",
"year": "1999",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNBziBcv",
"doi": "10.1109/SCCC.1999.810173",
"title": "Legacy Systems Reengineering Using Software Patterns",
"normalizedTitle": "Legacy Systems Reengineering Using Software Patterns",
"abstract": "In this work we present a case study for legacy systems reengineering using software patterns aiming at both easing the reengineering process and improving future maintenance. The approach used consists basically of three steps: apply reverse engineering, if necessary, to obtain an object model of the system; recognize software patterns present in the object model obtained; and re-implement the system in a more productive way, using toolkits or specific frameworks that implement the patterns found. Results of some experiments show that reengineering has been facilitated as well as system maintenance, because components became clearly delimited and larger chunks of design may now be understood as a whole and reused.",
"abstracts": [
{
"abstractType": "Regular",
"content": "In this work we present a case study for legacy systems reengineering using software patterns aiming at both easing the reengineering process and improving future maintenance. The approach used consists basically of three steps: apply reverse engineering, if necessary, to obtain an object model of the system; recognize software patterns present in the object model obtained; and re-implement the system in a more productive way, using toolkits or specific frameworks that implement the patterns found. Results of some experiments show that reengineering has been facilitated as well as system maintenance, because components became clearly delimited and larger chunks of design may now be understood as a whole and reused.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "In this work we present a case study for legacy systems reengineering using software patterns aiming at both easing the reengineering process and improving future maintenance. The approach used consists basically of three steps: apply reverse engineering, if necessary, to obtain an object model of the system; recognize software patterns present in the object model obtained; and re-implement the system in a more productive way, using toolkits or specific frameworks that implement the patterns found. Results of some experiments show that reengineering has been facilitated as well as system maintenance, because components became clearly delimited and larger chunks of design may now be understood as a whole and reused.",
"fno": "02960160",
"keywords": [
"Software Reengineering",
"Software Patterns",
"Legacy Systems",
"Reverse Engineering"
],
"authors": [
{
"affiliation": "University of Sao Paulo",
"fullName": "Paulo Cesar Masiero",
"givenName": "Paulo Cesar",
"surname": "Masiero",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "University of Sao Paulo",
"fullName": "Rosana T. Vaccare Braga",
"givenName": "Rosana T. Vaccare",
"surname": "Braga",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "sccc",
"isOpenAccess": false,
"showRecommendedArticles": false,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "1999-11-01T00:00:00",
"pubType": "proceedings",
"pages": "160",
"year": "1999",
"issn": "1522-4902",
"isbn": "0-7695-0296-2",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "02960150",
"articleId": "12OmNB8Cj18",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "02960170",
"articleId": "12OmNxTEiQe",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNwekjuD",
"title": "2011 33rd International Conference on Software Engineering (ICSE 2011)",
"acronym": "icse",
"groupId": "1000691",
"volume": "0",
"displayVolume": "0",
"year": "2011",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNvA1hnm",
"doi": "10.1145/1985793.1986026",
"title": "Building domain specific software architectures from software architectural design patterns",
"normalizedTitle": "Building domain specific software architectures from software architectural design patterns",
"abstract": "Software design patterns are best practice solutions to common software problems. However, applying design patterns in practice can be difficult since design pattern descriptions are general and can be applied at multiple levels of abstraction. In order to address the aforementioned issue, this research focuses on creating a systematic approach to designing domain specific distributed, real-time and embedded (DRE) software from software architectural design patterns. To address variability across a DRE domain, software product line concepts are used to categorize and organize the features and design patterns. The software architectures produced are also validated through design time simulation. This research is applied and validated using the space flight software (FSW) domain.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Software design patterns are best practice solutions to common software problems. However, applying design patterns in practice can be difficult since design pattern descriptions are general and can be applied at multiple levels of abstraction. In order to address the aforementioned issue, this research focuses on creating a systematic approach to designing domain specific distributed, real-time and embedded (DRE) software from software architectural design patterns. To address variability across a DRE domain, software product line concepts are used to categorize and organize the features and design patterns. The software architectures produced are also validated through design time simulation. This research is applied and validated using the space flight software (FSW) domain.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Software design patterns are best practice solutions to common software problems. However, applying design patterns in practice can be difficult since design pattern descriptions are general and can be applied at multiple levels of abstraction. In order to address the aforementioned issue, this research focuses on creating a systematic approach to designing domain specific distributed, real-time and embedded (DRE) software from software architectural design patterns. To address variability across a DRE domain, software product line concepts are used to categorize and organize the features and design patterns. The software architectures produced are also validated through design time simulation. This research is applied and validated using the space flight software (FSW) domain.",
"fno": "04451152",
"keywords": [
"Design Patterns",
"Distributed Real Timeand Embedded Software",
"Software Architectures",
"Space Flight Software",
"Uml"
],
"authors": [
{
"affiliation": "George Mason University, Fairfax, VA, USA",
"fullName": "Julie Street Fant",
"givenName": "Julie Street",
"surname": "Fant",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "icse",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2011-05-01T00:00:00",
"pubType": "proceedings",
"pages": "1152-1154",
"year": "2011",
"issn": null,
"isbn": "978-1-4503-0445-0",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "04451149",
"articleId": "12OmNCeaPZ7",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "04451155",
"articleId": "12OmNzYwbSB",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/dasc/2011/4612/0/4612a113",
"title": "A Natural Classification Scheme for Software Security Patterns",
"doi": null,
"abstractUrl": "/proceedings-article/dasc/2011/4612a113/12OmNAoDibA",
"parentPublication": {
"id": "proceedings/dasc/2011/4612/0",
"title": "Dependable, Autonomic and Secure Computing, IEEE International Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/compsac/1999/0368/0/03680312",
"title": "Looking Beyond Software to Understand Software Design Patterns",
"doi": null,
"abstractUrl": "/proceedings-article/compsac/1999/03680312/12OmNBU1jGi",
"parentPublication": {
"id": "proceedings/compsac/1999/0368/0",
"title": "Proceedings. Twenty-Third Annual International Computer Software and Applications Conference (Cat. No.99CB37032)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/isorcw/2011/4377/0/4377a097",
"title": "Architectural Design Patterns for Flight Software",
"doi": null,
"abstractUrl": "/proceedings-article/isorcw/2011/4377a097/12OmNwDj0WN",
"parentPublication": {
"id": "proceedings/isorcw/2011/4377/0",
"title": "2011 14th IEEE International Symposium on Object/Component/Service-Oriented Real-Time Distributed Computing Workshops",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/metrics/1998/9201/0/92010023",
"title": "Using Metrics to Identify Design Patterns in Object-Oriented Software",
"doi": null,
"abstractUrl": "/proceedings-article/metrics/1998/92010023/12OmNwdL7eC",
"parentPublication": {
"id": "proceedings/metrics/1998/9201/0",
"title": "Software Metrics, IEEE International Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/words/2005/2347/0/23470197",
"title": "Speci.cation, Analysis and Implementation of Architectural Patterns for Dependable Software Systems",
"doi": null,
"abstractUrl": "/proceedings-article/words/2005/23470197/12OmNwtWfH9",
"parentPublication": {
"id": "proceedings/words/2005/2347/0",
"title": "10th IEEE International Workshop on Object-Oriented Real-Time Dependable Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icsoft/2015/8139/1/07521131",
"title": "Integrating and applying architectural design patterns in space flight software product lines",
"doi": null,
"abstractUrl": "/proceedings-article/icsoft/2015/07521131/12OmNzahccx",
"parentPublication": {
"id": "proceedings/icsoft/2015/8139/1",
"title": "2015 10th International Joint Conference on Software Technologies (ICSOFT)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/csmr/2002/1438/0/14380108",
"title": "Architecture-Centric Software Evolution by Software Metrics and Design Patterns",
"doi": null,
"abstractUrl": "/proceedings-article/csmr/2002/14380108/12OmNzgwmS1",
"parentPublication": {
"id": "proceedings/csmr/2002/1438/0",
"title": "Proceedings of the Sixth European Conference on Software Maintenance and Reengineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/please/2012/1751/0/06229769",
"title": "Software product line engineering of space flight software",
"doi": null,
"abstractUrl": "/proceedings-article/please/2012/06229769/12OmNzllxVV",
"parentPublication": {
"id": "proceedings/please/2012/1751/0",
"title": "2012 3rd International Workshop on Product LinE Approaches in Software Engineering (PLEASE 2012)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tq/2008/03/ttq2008030129",
"title": "Architectural Risk Analysis of Software Systems Based on Security Patterns",
"doi": null,
"abstractUrl": "/journal/tq/2008/03/ttq2008030129/13rRUwdIOWe",
"parentPublication": {
"id": "trans/tq",
"title": "IEEE Transactions on Dependable and Secure Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/co/2009/06/mco2009060098",
"title": "In Search of Architectural Patterns for Software Security",
"doi": null,
"abstractUrl": "/magazine/co/2009/06/mco2009060098/13rRUwjXZNk",
"parentPublication": {
"id": "mags/co",
"title": "Computer",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.