Catalogue Search | MBRL
Search Results Heading
Explore the vast range of titles available.
MBRLSearchResults
-
DisciplineDiscipline
-
Is Peer ReviewedIs Peer Reviewed
-
Reading LevelReading Level
-
Content TypeContent Type
-
YearFrom:-To:
-
More FiltersMore FiltersItem TypeIs Full-Text AvailableSubjectPublisherSourceDonorLanguagePlace of PublicationContributorsLocation
Done
Filters
Reset
125
result(s) for
"Transaction systems (Computer systems) Mathematical models."
Sort by:
Performance modeling and design of computer systems : queueing theory in action
\"Computer systems design is full of conundrums. Tackling the questions that systems designers care about, this book brings queueing theory decisively back to computer science. The book is written with computer scientists and engineers in mind and is full of examples from computer systems, as well as manufacturing and operations research. Fun and readable, the book is highly approachable, even for undergraduates, while still being thoroughly rigorous and also covering a much wider span of topics than many queueing books. Readers benefit from a lively mix of motivation and intuition, with illustrations, examples and more than 300 exercises - all while acquiring the skills needed to model, analyze and design large-scale systems with good performance and low cost. The exercises are an important feature, teaching research-level counterintuitive lessons in the design of computer systems. The goal is to train readers not only to customize existing analyses but also to invent their own\"-- Provided by publisher.
Performance Modeling and Design of Computer Systems
by
Harchol-Balter, Mor
in
Computer systems
,
Computer systems -- Design and construction -- Mathematics
,
COMPUTERS / General. bisacsh
2013
Tackling the questions that systems designers care about, this book brings queueing theory decisively back to computer science. The book is written with computer scientists and engineers in mind and is full of examples from computer systems, as well as manufacturing and operations research. Fun and readable, the book is highly approachable, even for undergraduates, while still being thoroughly rigorous and also covering a much wider span of topics than many queueing books. Readers benefit from a lively mix of motivation and intuition, with illustrations, examples and more than 300 exercises – all while acquiring the skills needed to model, analyze and design large-scale systems with good performance and low cost. The exercises are an important feature, teaching research-level counterintuitive lessons in the design of computer systems. The goal is to train readers not only to customize existing analyses but also to invent their own.
Analyzing Consumer-Product Graphs: Empirical Findings and Applications in Recommender Systems
2007
We apply random graph modeling methodology to analyze bipartite consumer-product graphs that represent sales transactions to better understand consumer purchase behavior in e-commerce settings. Based on two real-world e-commerce data sets, we found that such graphs demonstrate topological features that deviate significantly from theoretical predictions based on standard random graph models. In particular, we observed consistently larger-than-expected average path lengths and a greater-than-expected tendency to cluster. Such deviations suggest that the consumers' product choices are not random even with the consumer and product attributes hidden. Our findings provide justification for a large family of collaborative filtering-based recommendation algorithms that make product recommendations based only on previous sales transactions. By analyzing the simulated consumer-product graphs generated by models that embed two representative recommendation algorithms, we found that these recommendation algorithm-induced graphs generally provided a better match with the real-world consumer-product graphs than purely random graphs. However, consistent deviations in topological features remained. These findings motivated the development of a new recommendation algorithm based on graph partitioning, which aims to achieve high clustering coefficients similar to those observed in the real-world e-commerce data sets. We show empirically that this algorithm significantly outperforms representative collaborative filtering algorithms in situations where the observed clustering coefficients of the consumer-product graphs are sufficiently larger than can be accounted for by these standard algorithms.
Journal Article
A new vertical fragmentation algorithm based on ant collective behavior in distributed database systems
by
Goli, Mehdi
,
Rouhani Rankoohi, Seyed Mohammad Taghi
in
Algorithmics. Computability. Computer arithmetics
,
Algorithms
,
Applied sciences
2012
Considering the existing massive volumes of data processed nowadays and the distributed nature of many organizations, there is no doubt how vital the need is for distributed database systems. In such systems, the response time to a transaction or a query is highly affected by the distribution design of the database system, particularly its methods for fragmentation, replication, and allocation data. According to the relevant literature, from the two approaches to fragmentation, namely horizontal and vertical fragmentation, the latter requires the use of heuristic methods due to it being NP-Hard. Currently, there are a number of different methods of providing vertical fragmentation, which normally introduce a relatively high computational complexity or do not yield optimal results, particularly for large-scale problems. In this paper, because of their distributed and scalable nature, we apply swarm intelligence algorithms to present an algorithm for finding a solution to vertical fragmentation problem, which is optimal in most cases. In our proposed algorithm, the relations are tried to be fragmented in such a way so as not only to make transaction processing at each site as much localized as possible, but also to reduce the costs of operations. Moreover, we report on the experimental results of comparing our algorithm with several other similar algorithms to show that ours outperforms the other algorithms and is able to generate a better solution in terms of the optimality of results and computational complexity.
Journal Article
Malware Threat Affecting Financial Organization Analysis Using Machine Learning Approach
by
Rimal, Yagya Nath
,
Dahima, Snehil
,
Sarangi, Sanjaya Kumar
in
Algorithms
,
Banks (Finance)
,
Classifiers
2022
Since 2014, Emotet has been using man-in-the-browsers (MITB) attacks to target companies in the finance industry and their clients. Its key aim is to steal victims' online money-lending records and vital credentials as they go to their banks' websites. Without analyzing network packet payload computing (PPC), IP address labels, port number traces, or protocol knowledge, the authors have used machine learning (ML) modeling to detect Emotet malware infections and recognize Emotet-related congestion flows in this work. To classify Emotet-associated flows and detect Emotet infections, the output outcome values are compared by four separate popular ML algorithms: RF (random forest), MLP (multi-layer perceptron), SMO (sequential minimal optimization technique), and the LRM (logistic regression model). The suggested classifier is then improved by determining the right hyperparameter and attribute set range. Using network packet (computation) identifiers, the random forest classifier detects Emotet-based flows with 99.9726% precision and a 92.3% true positive rating.
Journal Article
Electronic business adoption by European firms: a cross-country assessment of the facilitators and inhibitors
by
Zhu, Kevin
,
Kraemer, Kenneth
,
Xu, Sean
in
Adoption of innovations
,
Business
,
Business and Management
2003
In this study, we developed a conceptual model for studying the adoption of electronic business (e-business or EB) at the firm level, incorporating six adoption facilitators and inhibitors, based on the technology–organization–environment theoretical framework. Survey data from 3100 businesses and 7500 consumers in eight European countries were used to test the proposed adoption model. We conducted confirmatory factor analysis to assess the reliability and validity of constructs. To examine whether adoption patterns differ across different e-business environments, we divided the full sample into high EB-intensity and low EB-intensity countries. After controlling for variations of industry and country effects, the fitted logit models demonstrated four findings: (1)
Technology competence, firm scope and size, consumer readiness
, and
competitive pressure
are significant adoption drivers, while
lack of trading partner readiness
is a significant adoption inhibitor. (2) As EB-intensity increases, two environmental factors – consumer readiness and lack of trading partner readiness – become less important, while competitive pressure remains significant. (3) In high EB-intensity countries, e-business is no longer a phenomenon dominated by large firms; as more and more firms engage in e-business, network effect works to the advantage of small firms. (4) Firms are more cautious in adopting e-business in high EB-intensity countries – it seems to suggest that the more informed firms are less aggressive in adopting e-business, a somehow surprising result. Explanations and implications are offered.
Journal Article
Credit Card Fraud Detection Using Hidden Markov Model
2008
Due to a rapid advancement in the electronic commerce technology, the use of credit cards has dramatically increased. As credit card becomes the most popular mode of payment for both online as well as regular purchase, cases of fraud associated with it are also rising. In this paper, we model the sequence of operations in credit card transaction processing using a hidden Markov model (HMM) and show how it can be used for the detection of frauds. An HMM is initially trained with the normal behavior of a cardholder. If an incoming credit card transaction is not accepted by the trained HMM with sufficiently high probability, it is considered to be fraudulent. At the same time, we try to ensure that genuine transactions are not rejected. We present detailed experimental results to show the effectiveness of our approach and compare it with other techniques available in the literature.
Journal Article
Enhanced Scalability and Security in Blockchain-Based Transportation Systems for Mass Gatherings
by
Mutahhar, Ahmad
,
Shahid, Muhammad Farrukh
,
Khanzada, Tariq J. S.
in
Access control
,
Artificial intelligence
,
Blockchain
2025
Large-scale events, such as festivals and public gatherings, pose serious problems in terms of traffic congestion, slow transaction processing, and security risks to transportation planning. This study proposes a blockchain-based solution for enhancing the efficiency and security of intelligent transport systems (ITS) by utilizing state channels and rollups. Throughput is optimized, enabling transaction speeds of 800 to 3500 transactions per second (TPS) and delays of 5 to 1.5 s. Prevent data tampering, strengthen security, and enhance data integrity from 89% to 99.999%, as well as encryption efficacy from 90% to 98%. Furthermore, our system reduces congestion, optimizes vehicle movement, and shares real-time, secure data with stakeholders. Practical applications include fast and safe road toll payments, faster public transit ticketing, improved emergency response coordination, and enhanced urban mobility. The decentralized blockchain helps maintain trust among users, transportation authorities, and event organizers. Our approach extends beyond large-scale events and proposes a path toward ubiquitous, Artificial Intelligence (AI)-driven decision-making in a broader urban transit network, informing future operations in dynamic traffic optimization. This study demonstrates the potential of blockchain to create more intelligent, more secure, and scalable transportation systems, which will help reduce urban mobility inefficiencies and contribute to the development of resilient smart cities.
Journal Article
Location, Location, Location: The Power of Neighborhoods for Apartment Price Predictions Based on Transaction Data
2024
Land and real estate have long been regarded as stable investments, with property prices steadily rising, underscoring the need for accurate predictive models to capture the varying rates of price growth across different locations. This study leverages a decade-long dataset of 83,527 apartment transactions in Vienna, Austria, to train machine learning models using XGBoost. Unlike most prior research, the extended time span of the dataset enables predictions for multiple future years, providing a more robust long-term prediction. The primary objective is to examine how spatial factors can enhance real estate price predictions. In addition to transaction data, socio-demographic and geographic variables were collected to characterize the neighborhoods surrounding each apartment. Ten models, each varying in the number of input years, were trained to predict the price per square meter. The model performance was assessed using the mean absolute percentage error (MAPE), offering insights into their predictive accuracy for both short-term and long-term predictions. This study underscores the importance of distinguishing between newly built and existing apartments in real estate price modeling. By splitting the dataset prior to training, predictive models focusing solely on newly built properties achieved an average reduction of about 6% in MAPE. The best-performing models achieved an average MAPE of 15% for one-year-ahead predictions and maintained a MAPE below 20% for predictions up to three years ahead, demonstrating the effectiveness of leveraging spatial features to enhance real estate price prediction accuracy.
Journal Article
Correlation Financial Option Pricing Model and Computer Simulation under a Stochastic Interest Rate
2022
With the continuous expansion of the consumer interest rate market today, the risks brought by interest rate fluctuations have had a huge and far-reaching impact on the financial markets of many countries and it is becoming more and more important to simulate the pricing of financial options. In the traditional pricing model of financial options, the pricing standard of the pricing model is generally set as a financial product with random disturbance characteristics and the market price of its transaction does not follow the arbitrage principle of financial product pricing. It is easy to generate errors and cause risks, and the accuracy of traditional financial option pricing models is not high, and the simulation time is long, which greatly reduces the rate of financial transactions. To improve the accuracy of option pricing models, this paper uses computer simulation technology to simulate the pricing of correlated financial options under stochastic interest rates. From the four aspects of error, risk parameters, success rate, and simulation time, it is tested to observe the influence of computer simulation technology on the financial option pricing model. The final results show that by using computer simulation technology, the error of the correlation financial option pricing model under the random interest rate is reduced, the success rate is improved, the risk parameter is reduced by 3.03%, and the simulation time is reduced by 0.605 seconds.
Journal Article