检索结果-内蒙古大学图书馆

A NONPARAMETRIC ROBUST OPTIMIZATION APPROACH FOR CHANCE-CONSTRAINED KNAPSACK PROBLEM

SIAM Journal on Optimization 2025年第2期35卷 739-766页

作者： Xu, Liang Zhang, Chao Xu, Zhou Long, Daniel Zhuoyu School of Business Administration Southwestern University of Finance and Economics Chengdu China Big Data Laboratory on Financial Security and Behavior SWUEF Laboratory of Philosophy and Social Sciences Ministry of Education Chengdu China School of Medical Informatics Chongqing Medical University Chongqing China Department of Logistics Management and Maritime Studies Hong Kong Polytechnic University Hong Kong Department of System Engineering and Engineering Management Chinese University of Hong Kong Hong Kong

A chance-constrained knapsack problem (CCKP) is a knapsack problem restricted by a chance constraint, which ensures that the total capacity constraint under uncertain volume can be violated only up to a given probability threshold. CCKP is challenging to solve due to its combinatorial nature and the involvement of its chance constraint. Existing solution methods for CCKP with tractability guarantees mainly focus on two approaches: (1) a full-information approach (stochastic programming) that assumes the uncertain volume follows certain distributions, such as normal or empirical distribution;(2) a partial-information approach (robust optimization) that adopts specific statistics of the unknown distribution, such as the mean and variance. The existing full-information approach lacks robustness under limited samples due to its strong assumption;the existing partial-information approach can be further improved, as the uncertainty set or distributional ambiguity set can be ameliorated. With these concerns in mind, we propose a nonparametric robust approach for CCKP by involving a novel nonparametric statistic to form a new distributional ambiguity set. Furthermore, we develop an upper bound on the violation probability of the chance constraint under the distributional ambiguity set to approximate CCKP by a deterministic robust counterpart. In terms of solution methodology, we decompose the deterministic robust counterpart into cardinality-constrained knapsack problems, which can be efficiently solved by the proposed dynamic programming algorithm. Computational results show that our proposed solution methods produce better solutions to CCKP compared with existing approaches. © 2025 Society for Industrial and Applied Mathematics.

关键词： Stochastic programming

来源：评论

学校读者我要写书评

暂无评论

A Bibliometric and Social Media Analysis of the Nexus Between Blockchain Technology and Finance 2nd

A Bibliometric and Social Media Analysis of the Nexus Betwee...

引用

2nd International Conference on Intelligent Manufacturing and Robotics, ICIMR 2024

作者： Ayodele, Olamide Emmanuel Ajibade, Temiloluwa Iyanuoluwa Oyebode, Oluwadare Joshua Akintoye, Kayode Akinlekan Ajayi, Babatunde Adedotun Adediran, Anthonia Oluwatosin Ajibade, Samuel-Soma M. Majeed, Anwar P. P. Abdul Luo, Yang Department of Banking and Finance Ekiti State University Ekiti State Ado Ekiti Nigeria Department of Business Management Scholar School System Birmingham United Kingdom Civil and Environmental Engineering Afe Babalola University Ekiti State Ado Ekiti Nigeria Department of Computer Science The Federal Polytechnic Ekiti State Ado Ekiti Nigeria Department of Cyber Security Faculty of Computing and Informatics Ladoke Akintola University of Technology Ogbomoso Nigeria Department of Real Estate Faculty of Built Environment Universiti Malaya KL Kuala Lumpur Malaysia Department of Data Science and Artificial Intelligence Faculty of Engineering and Technology Sunway University Selangor Malaysia Department of Computer Engineering Istanbul Ticaret University Istanbul Turkey Suzhou Taicang215400 China

ISBN: (纸本)9789819639489

This study explores Blockchain technology in the global financial industry using trends analysis, bibliometric analysis, and a literature appraisal using Elsevier Scopus data from 2016 to 2023. The Blockchain in Finance (BCF) study produced 185 publications: 53.5% papers, 45.4% conference proceedings, and 1.1% reviews. Analysis of the subject area revealed three important Computer Science, engineering, and Decision Sciences articles. However, source title analysis showed that ACM International Conference Proceeding Series, Sustainability Switzerland, and E3S Web of Conferences publish BCF research most often. According to the stakeholders study, Jon M. Truby and Qatar University (Qatar) are the top BCFin researchers and affiliations with 4% and % publications, respectively. China produces the most research on the topic. Due to active support from funding sources like the Chinese National Natural Science Foundation (NNSF), 18 publications have been funded. Co-occurrence of keywords The investigation indicated that BCFin’s top keywords include Blockchain, Finance, and Supply Chain Finance. Three clusters with 4–8 keywords, 132 linkages, and 866 TLS were found via cluster analysis. Keywords classify the clusters as Integrated business Solutions (Cluster 1), Digital Commerce Infrastructure (Cluster 2), and Decentralized Financial Network (Cluster 3). The findings indicate that BCFin is a dynamic and influential multidisciplinary study field. BCFin has transformed the global financial sector by improving trust, transaction security, and communication. It still struggles with interoperability, system integration, and sustainability. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Decentralized finance

来源：评论

学校读者我要写书评

暂无评论

Abstract vs concrete clabjects in Dual Deep Instantiation

Abstract vs concrete clabjects in Dual Deep Instantiation

引用

Workshop on Multi-Level Modelling, MULTI 2014, Co-located with ACM/IEEE 17th International Conference on Model Driven engineering Languages and Systems, MoDELS 2014

作者： Neumayr, Bernd Schrefl, Michael Department of Business Informatics - Data and Knowledge Engineering Johannes Kepler University Linz Austria

Deep Instantiation allows for a compact representation of models with multiple instantiation levels where clabjects combine object and class facets and allow to characterize the schema of model elements several instantiation levels below. Clabjects with common properties may be generalized to superclabjects. In order to clarify the exact nature of superclabjects, Dual Deep Instantiation, a variation of Deep Instantiation, distinguishes between abstract and concrete clabjects and demands that superclabjects are abstract. An abstract clabject combines the notion of abstract class, i.e., it may not be instantiated by concrete objects, and of abstract object, i.e., is does not represent a single concrete object but properties common to a set of concrete objects. This paper clarifies the distinction between abstract and concrete clabjects and discusses the role of concrete clabjects for mandatory constraints at multiple levels and for coping with dual inheritance introduced with the combination of generalization and deep instantiation. The reflections in this paper are formalized based on a simplified form of dual deep instantiation but should be relevant to deep characterization in general.

关键词： Concretes

来源：评论

学校读者我要写书评

暂无评论

Multi-level domain modeling with m-objects and m-relationships

Multi-level domain modeling with m-objects and m-relationshi...

引用

6th Asia-Pacific Conference on Conceptual Modelling, APCCM 2009

作者： Neumayr, Bernd Grün, Katharina Schrefl, Michael Department of Business Informatics - Data and Knowledge Engineering Johannes Kepler University Linz Austria

ISBN: (纸本)9781920682774

Using traditional semantic data modeling, multi-level modeling can be achieved by representing objects in different abstraction hierarchies, namely classification, aggregation and generalization. This, however, leads to accidental complexity, complicating maintenance and extension. Several modeling techniques, like deep instantiation, powertypes and materialization, have been proposed to reduce unnecessary complexity in modeling objects at multiple levels. Multilevel objects (m-objects) and multi-level relationships (m-relationships) build on these results and provide a natural, intuitive representation of the concretization of objects and relationships along multiple levels of abstraction. By integrating aspects of the different abstraction hierarchies in a single concretization hierarchy, they improve readability and simplify maintenance and extension as compared to previous approaches. The discussion on conceptual modeling is complemented by a brief presentation of M-SQL, a data manipulation and query language for working with m-objects and m-relationships in an object-relational setting. Copyright © 2009, Australian Computer Society, Inc.

关键词： Query languages

来源：评论

学校读者我要写书评

暂无评论

Using domain ontologies as semantic dimensions in data warehouses

Using domain ontologies as semantic dimensions in data wareh...

引用

31st International Conference on Conceptual Modeling, ER 2012

作者： Anderlik, Stefan Neumayr, Bernd Schrefl, Michael Department of Business Informatics - Data and Knowledge Engineering Johannes Kepler University Linz Austria

ISBN: (纸本)9783642340017

More and more transaction systems collect records that reference concepts of domain ontologies in so-called semantic attributes. This paper investigates how such semantic attributes together with their referenced domain ontology can be best exploited for data analysis in data warehouses. This gives rise to two challenges: first, exploit the rich knowledge represented in domain ontologies for targeted analysis and, second, aggregate data along the subsumption hierarchy of concepts and ensuring summarizability in the absence of predefined aggregation levels. To meet these challenges, the paper extends OLAP (OnLine Analytical Processing) by integrating concept expressions and proper level definitions over domain ontologies into OLAP operations. A prototype demonstrates the feasibility of the approach. © 2012 Springer-Verlag.

关键词： data warehouses

来源：评论

学校读者我要写书评

暂无评论

An OLAP endpoint for RDF data analysis using analysis graphs

An OLAP endpoint for RDF data analysis using analysis graphs

引用

2017 ISWC Posters and Demonstrations and Industry Tracks, ISWC-P and D-Industry 2017

作者： Hilal, Median Schuetz, Christoph G. Schre, Michael Department of Business Informatics - Data and Knowledge Engineering Johannes Kepler University Linz Austria

Exploiting Resource Description Framework (RDF) data for Online Analytical Processing (OLAP), especially Linked Open data (LOD), could allow analysts to obtain interesting insights. To conduct OLAP analysis over RDF data, analysts should know the specific semantics, structure, and querying mechanisms of such data. Furthermore, these data should ideally adhere to a multidimensional structure to be accessible to OLAP. In this demo paper, we present an OLAP endpoint that allows casual analysts to perform self-service OLAP analysis over RDF datasets. Specifically, analysts can instantiate semantic web analysis graphs, which are predefined models of the analysis processes. Semantic web analysis graphs are built on top of multidimensional structures that can be superimposed over arbitrary RDF datasets.

关键词： Resource Description Framework (RDF)

来源：评论

学校读者我要写书评

暂无评论

Towards contextualized rule repositories for the semantic web

Towards contextualized rule repositories for the semantic we...

引用

2017 Joint Web Stream Processing Workshop and the 2nd International Workshop on Ontology Modularity, Contextuality, and Evolution, WSP+WOMoCoE 2017

作者： Burgstaller, Felix Schuetz, Christoph G. Neumayr, Bernd Steiner, Dieter Schrefl, Michael Department for Business Informatics - Data and Knowledge Engineering Johannes Kepler University Linz Austria

Central to the semantic web are ontologies: shared conceptualizations of domains of interest expressed in an ontology language such as OWL. Rule languages complement ontology languages. For large heterogeneous bodies of knowledge on the semantic web, contextualized knowledge repositories facilitate the organization of ontological concepts. In this paper we propose a similar mechanism - contextualized rule repositories - for organizing and executing large sets of context-specific rules. We investigate feasibility of a SPARQL Inferencing Notation (SPIN) based implementation using a real-world use case from the aeronautical domain. Furthermore, we compare SPIN-based contextualized rule repositories to a context-unaware SPIN implementation.

关键词： Ontology

来源：评论

学校读者我要写书评

暂无评论

Variability in artifact-centric process modeling: The hetero-homogeneous approach 10th

Variability in artifact-centric process modeling: The hetero...

引用

10th Asia-Pacific Conference on Conceptual Modelling APCCM 2014

作者： Schütz, Christoph Schrefl, Michael Department of Business Informatics-Data and Knowledge Engineering Johannes Kepler University Linz Austria

ISBN: (纸本)9781921770364

Today's dynamic business environment demands from companies variable and flexible processes. Rather than imposing a single fixed process, process models must account for the variability of real-world business problems. Many companies are hierarchically organized with top-down decision making processes. On the one hand, company policies and legal regulations often require compliance with standard process models prescribed by higher-level management. On the other hand, lower-level employees should be flexible within the prescribed boundaries. In this paper, we propose a hetero-homogeneous approach to modeling process variability. We employ the multilevel business artifact (MBA) in order to represent within a single object the homogeneous schema of an abstraction hierarchy of processes. We employ multilevel concretization for the introduction of heterogeneities into sub-hierarchies which comply with the homogeneous global schema. © 2014, Australian Computer Society, Inc.

关键词： Regulatory compliance

来源：评论

学校读者我要写书评

暂无评论

Judgement and analysis rules for ontology-driven comparative data analysis in data warehouses 11

Judgement and analysis rules for ontology-driven comparative...

引用

11th Asia-Pacific Conference on Conceptual Modelling, APCCM 2015

作者： Steiner, Dieter Neumayr, Bernd Schrefl, Michael Department of Business Informatics - Data and Knowledge Engineering Johannes Kepler University Linz Austria

ISBN: (纸本)9781921770470

Online analytical processing tools facilitate interactive inspection of aggregated measures of groups of data in data warehouses. In comparative data analysis, business analysts assess measures of a group of interest against measures of a group of comparison. Judgement rules annotate comparisons with background knowledge otherwise tacit to the business analyst. Analysis rules specify comparisons at different granularities and result in recommendations for further analyses. Judgement and analysis rules build on multidimensional ontologies, which simplify definition, reuse, and sharing of comparisons, and on comparative scores, which make explicit the results of comparisons. In this paper, we introduce conceptual modelling of judgement and analysis rules together with their organisation and multidimensional contextualisation in rule families, explain different rule evaluation strategies, and brie y report on the implementation of the approach. © 2015, Australian Computer Society, Inc.

关键词： Ontology

来源：评论

学校读者我要写书评

暂无评论

SoAy: A Solution-based LLM API-using Methodology for Academic Information Seeking 25

SoAy: A Solution-based LLM API-using Methodology for Academi...

引用

Proceedings of the 31st ACM SIGKDD Conference on knowledge Discovery and data Mining V.1

作者： Yuanchun Wang Jifan Yu Zijun Yao Jing Zhang Yuyang Xie Shangqing Tu Yiyang Fu Youhe Feng Jinkai Zhang Jingyao Zhang Bowen Huang Yuanyao Li Huihui Yuan Lei Hou Juanzi Li Jie Tang School of Information Renmin University of China Beijing China & Key Laboratory of Data Engineering and Knowledge Engineering MOE Beijing China Institute of Education Tsinghua University Beijing China Department of Computer Science and Technology Tsinghua University Beijing China School of Information Renmin University of China Beijing China & Engineering Research Center of Database and Business Intelligence MOE Beijing China School of Information Renmin University of China Beijing China Zhipu AI Beijing China

ISBN: (纸本)9798400712456

Applying large language models (LLMs) to academic API usage shows promise in reducing researchers' efforts to seek academic information. However, current LLM methods for using APIs struggle with the complex API coupling commonly encountered in academic queries. To address this, we introduce SoAy, a solution-based LLM methodology for academic information seeking. SoAy enables LLMs to generate code for invoking APIs, guided by a pre-constructed API calling sequence referred to as a solution. This solution simplifies the model's understanding of complex API relationships, while the generated code enhances reasoning efficiency. LLMs are aligned with this solution-oriented, code-based reasoning method by automatically enumerating valid API coupling sequences and transforming them into queries and executable *** evaluate SoAy, we introduce SoAyBench, an evaluation benchmark accompanied by SoAyEval, built upon a cloned environment of APIs from AMiner. Experimental results demonstrate a 34.58-75.99% performance improvement compared to state-of-the-art LLM API-based baselines. All datasets, codes, tuned models, and deployed online services are publicly accessible at https://***/RUCKBReasoning/SoAy.

关键词： academic information seeking

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：