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

8th IEEE International Conference on Industrial engineering and Applications, ICIEA 2021

作者： Fattouh, Anas Bohlin, Markus Sundmark, Daniel Mälardalen University Division of Computer Science and Software Engineering Västerås Sweden

ISBN: (纸本)9781665428958

A quarry site is used to produce gravel with different granularities based on the customer's needs. The production process consists of different stages that need to be planned in order to achieve high productivity and low cost. During the operation of the quarry site, the operating parameters change, and the site productivity could be affected, therefore, a replanning of the production is needed. This paper presents a real-time optimization model for production planning in a quarry site. The optimization model consists of three modules, a productivity monitoring module, a simulation model, and an optimization algorithm. The productivity monitoring module produces the site productivity based on the current operating parameters of the quarry site. Once the site productivity reaches a specific threshold, the optimization algorithm is run on an updated simulation model to find the optimal values of the site parameters. The proposed real-time optimization model is applied to a real quarry site simulated on a high-fidelity simulator. The case study shows that the proposed optimization model can effectively improve the productivity of the quarry site and hence reduces the wastes and improve environmental sustainability. © 2021 IEEE.

关键词： Productivity

来源：评论

学校读者我要写书评

暂无评论

A full-featured efficient clustering mechanism for improving QoS in MANETs

引用

International Journal of Networking and Virtual Organisations 2018年第2-4期19卷 105-132页

作者： Marcel, Gatete Kovalan, A. School of Computer Sciences and Applications Periyar Maniammai University ThanjavurTamil Nadu India Department of Mathematics and Computer Applications Division of Software Engineering Periyar Maniammai University ThanjavurTamil Nadu India

Due to the dynamicity of MANET’s topology and its infrastructureless nature, various problems arise from those inherent properties which degrade the QoS. Those negative issues are the energy constraints, problems related to broadcasting, high node mobility, unpartitioned network, and various challenges faced during the path discovery, route selection, packet scheduling and packet transmission processes, and security issues. To find an efficient solution to all those problems, in this paper, we propose a robust algorithm;Full-featured secure routing clustering algorithm with energy-aware and scheduling capabilities for highly increasing QoS in MANET (FSR-CAES), an efficient clustering technique which is a combination of numerous algorithms, each one containing one of the previously mentioned problems. The simulation results are provided with the NS-2 simulator varying the number of nodes and the evaluating parameters namely the routing overhead, packet delivery ratio, Normalised routing load, and the average end-to-end delay while comparing the performance of our proposed scheme with neighbour coverage-based probabilistic rebroadcast (NCPR), a routing protocol specialised in providing high QoS in MANETs as it is efficient in reducing the routing overhead in the network. The outcomes prove that our proposed scheme outperforms NCPR for all the studied scenarios for small, medium, and large MANETs. Copyright © 2018 Inderscience Enterprises Ltd.

关键词： Mobile ad hoc networks

来源：评论

学校读者我要写书评

暂无评论

HFSM: Hierarchical facial shape modeling algorithm for realistic facial expression animation

引用

International Journal of Shape Modeling 2003年第1期9卷 101-135页

作者： Zhang, Yu Prakash, Edmond Cyril Sung, Eric Sch. of Elec./Electronic Engineering Nanyang Technological University Singapore 639798 Singapore Division of Software System School of Computer Engineering Nanyang Technological University Singapore 639798 Singapore

We propose a hierarchical 3D facial modeling technique for realistic facial expression animation from the anatomical specification. We analyze the real human face to construct the facial model with a hierarchical biomechanical structure, incorporating a physically-based approximation to facial skin tissue, a set of anatomically-motivated facial muscle actuators and underlying skull structure. The deformable skin model has multi-layer structure to approximate different types of soft tissue. It takes into account the nonlinear stress-strain relationship of the skin and the fact that soft tissue is almost incompressible. Different kinds of muscle models have been developed to simulate the distribution of the muscle force exerted to the skin due to muscle contraction. The 3D face model incorporates a skull structure which extends the scope of facial motion and facilitates facial muscle construction. The facial muscle construction is achieved by a muscle mapping approach which efficiently locates facial muscles at the anatomically correct positions between the skin and skull layers. To generate facial expressions, the resulting hierarchical facial model is animated by solving the governing dynamic equation. For computational efficiency, we use a localized, semi-implicit integration method in the numerical simulation. The dynamic facial animation algorithm runs at an interactive rate and synthesizes various realistic facial expressions.

关键词： Geometry

来源：评论

学校读者我要写书评

暂无评论

Data-Driven Distributionally Robust Control for Interacting Agents under Logical Constraints

arXiv

引用

arXiv 2025年

作者： Kordabad, Arash Bahari Vlahakis, Eleftherios E. Lindemann, Lars Gros, Sebastien Dimarogonas, Dimos V. Soudjani, Sadegh The Max Planck Institute for Software Systems Kaiserslautern Germany The Division of Decision and Control Systems KTH Royal Institute of Technology Stockholm Sweden The Thomas Lord Department of Computer Science the Ming Hsieh Department of Electrical and Computer Engineering Viterbi School of Engineering University of Southern California Los Angeles United States Trondheim Norway

In this paper, we propose a distributionally robust control synthesis for an agent with stochastic dynamics that interacts with other agents under uncertainties and constraints expressed by signal temporal logic (STL). We formulate the control synthesis as a chance-constrained program (CCP) with STL specifications that must be satisfied with high probability under all uncertainty tubes induced by the other agents. To tackle the CCP, we propose two methods based on concentration of measure (CoM) theory and conditional value at risk (CVaR) and compare the required assumptions and resulting optimizations. These approaches convert the CCP into an expectation-constrained program (ECP), which is simpler to solve than the original CCP. To estimate the expectation using a finite set of observed data, we adopt a distributionally robust optimization (DRO) approach. The underlying DRO can be approximated as a robust data-driven optimization that provides a probabilistic under-approximation to the original ECP, where the probability depends on the number of samples. Therefore, under feasibility, the original STL constraints are satisfied with two layers of designed confidence: the confidence of the chance constraint and the confidence of the approximated data-driven optimization, which depends on the number of samples. We then provide details on solving the resulting robust data-driven optimization numerically. Finally, we compare the two proposed approaches through case studies. Copyright © 2025, The Authors. All rights reserved.

关键词： Constrained optimization

来源：评论

学校读者我要写书评

暂无评论

A Distributed Covert Channel of the Packet Ordering Enhancement Model Based on Data Compression

引用

computers, Materials & Continua 2020年第9期64卷 2013-2030页

作者： Lejun Zhang Xiaoyan Hu Zhijie Zhang Weizheng Wang Tianwen Huang Donghai Guan Chunhui Zhao Seokhoon Kim College of Information Engineering Yangzhou UniversityYangzhou225127China Division of Computer Science University of AizuAizu-Wakamatsu9658580Japan College of Computer Science and Technology Nanjing University of Aeronautics and AstronauticsNanjing211106China College of Information and Communication Engineering Harbin Engineering UniversityHarbin150001China Department of Computer Software Engineering Soonchunhyang UniversityAsanKorea

Covert channel of the packet ordering is a hot research *** technology is not enough to protect the security of both sides of *** channel needs to hide the transmission data and protect content of *** traditional methods are usually to use proxy technology such as tor anonymous tracking technology to achieve hiding from the ***,because the establishment of proxy communication needs to consume traffic,the communication capacity will be reduced,and in recent years,the tor technology often has vulnerabilities that led to the leakage of secret *** this paper,the covert channel model of the packet ordering is applied into the distributed system,and a distributed covert channel of the packet ordering enhancement model based on data compression(DCCPOEDC)is *** data compression algorithms are used to reduce the amount of data and transmission *** distributed system and data compression algorithms can weaken the hidden statistical probability of ***,they can enhance the unknowability of the data and weaken the time distribution characteristics of the data *** paper selected a compression algorithm suitable for DCCPOEDC and analyzed DCCPOEDC from anonymity,transmission efficiency,and transmission *** to the analysis results,it can be seen that DCCPOEDC optimizes the covert channel of the packet ordering,which saves the transmission time and improves the concealment compared with the original covert channel.

关键词： Covert channels information hiding data compression distributed system

来源：评论

学校读者我要写书评

暂无评论

Preserving privacy for moving objects data mining

Preserving privacy for moving objects data mining

引用

2012 10th IEEE International Conference on Intelligence and Security Informatics, ISI 2012

作者： Ho, Shen-Shyang Division of Software and Information Systems School of Computer Engineering Nanyang Technological University Singapore 639798 Singapore

ISBN: (纸本)9781467321037

The prevalence of mobile devices with geopositioning capability has resulted in the rapid growth in the amount of moving object trajectories. These data have been collected and analyzed for both commercial (e.g., recommendation system) and security (e.g. surveillance and monitoring system) purposes. One needs to ensure the privacy of these raw trajectory data and the derived knowledge by not disclosing or releasing them to adversary. In this paper, we propose a practical implementation of a (∈, δ)-differentially private mechanism for moving objects data mining;in particular, we apply it to the frequent location pattern mining algorithm. Experimental results on the real-world GeoLife dataset are used to compare the performance of the (∈, δ)-differential privacy mechanism with the standard ∈-differential privacy mechanism. © 2012 IEEE.

关键词： Data mining

来源：评论

学校读者我要写书评

暂无评论

Analysis of binary code topology for dynamic analysis 14

Analysis of binary code topology for dynamic analysis

引用

29th Annual ACM Symposium on Applied Computing, SAC 2014

作者： Kang, Byeongho Im, Eul Gyu Department of Computer and Software Hanyang University Seoul Korea Republic of Division of Computer Science and Engineering Hanyang University Seoul Korea Republic of

ISBN: (纸本)9781450324694

A better understanding of binary code topology is essential in making execution path exploration method. The execution path exploration is closely related to code coverage in binary code dynamic analysis. Since the number of execution paths in a program is astronomically high, the efficient exploration strategy is needed. In this paper, we analyze binary code topology in a viewpoint of basic blocks. We find that the incoming edges show unbalanced distribution which follows power law, instead of balanced distribution. This unbalanced distribution of incoming edges can help understanding binary code topology, and we propose our study for deciding efficient execution path exploration strategy of dynamic binary code analysis. Copyright 2014 ACM.

关键词： Topology

来源：评论

学校读者我要写书评

暂无评论

Logarithmic opinion pools for conditional random fields 05

Logarithmic opinion pools for conditional random fields

引用

43rd Annual Meeting of the Association for Computational Linguistics, ACL-05

作者： Smith, Andrew Cohn, Trevor Osborne, Miles Division of Informatics University of Edinburgh United Kingdom Department of Computer Science and Software Engineering University of Melbourne Australia

ISBN: (纸本)1932432515

Recent work on Conditional Random Fields (CRFs) has demonstrated the need for regularisation to counter the tendency of these models to overfit. The standard approach to regularising CRFs involves a prior distribution over the model parameters, typically requiring search over a hyperparameter space. In this paper we address the overfitting problem from a different perspective, by factoring the CRF distribution into a weighted product of individual .expert. CRF distributions. We call this model a logarithmic opinion pool (LOP) of CRFs (LOP-CRFs). We apply the LOP-CRF to two sequencing tasks. Our results show that unregularised expert CRFs with an unregularised CRF under a LOP can outperform the unregularised CRF, and attain a performance level close to the regularised CRF. LOP-CRFs therefore provide a viable alternative to CRF regularisation without the need for hyperparameter search. © 2005 Association for Computational Linguistics.

关键词： Random processes

来源：评论

学校读者我要写书评

暂无评论

Conscience algorithm in neural network 9

Conscience algorithm in neural network

引用

9th International Conference on Neural Information Processing, ICONIP 2002

作者： Ng, Geok See Tan, Loo See Nanyang Technological University School of Computer Engineering Division of Software Systems Nanyang Avenue Singapore639798 Singapore

ISBN: (纸本)9810475241

A type of network called the Contender Network (CN) was earlier proposed by Ng, Erdogan and Ng (1995). A classification algorithm is used to assign weighted vote in a monotonically decreasing function of the rank in CN. Modification to the CN classification algorithm known as the conscience algorithm is presented. However, a new problem is encountered when the conscience algorithm is used in CN. We name this problem as saturation problem (i.e. when saturation stage of the neural network is reached). This saturation problem is solved by introducing a count threshold. The threshold is decided rigorously through many experiments based on the criteria of the accuracy, error and confusion rates of the network performance. We present experiments that show that conscience algorithm introduced during training with appropriate count threshold can improve the network performance. Experimental results of this approach are presented and discussed through the application of the neural network in digit classification. © 2002 Nanyang Technological University.

关键词： Network performance

来源：评论

学校读者我要写书评

暂无评论

Scaling conditional random fields using error-correcting codes 05

Scaling conditional random fields using error-correcting cod...

引用

43rd Annual Meeting of the Association for Computational Linguistics, ACL-05

作者： Cohn, Trevor Smith, Andrew Osborne, Miles Department of Computer Science and Software Engineering University of Melbourne Australia Division of Informatics University of Edinburgh United Kingdom

ISBN: (纸本)1932432515

Conditional Random Fields (CRFs) have been applied with considerable success to a number of natural language processing tasks. However, these tasks have mostly involved very small label sets. When deployed on tasks with larger label sets, the requirements for computational resources mean that training becomes intractable. This paper describes a method for training CRFs on such tasks, using error correcting output codes (ECOC). A number of CRFs are independently trained on the separate binary labelling tasks of distinguishing between a subset of the labels and its complement. During decoding, these models are combined to produce a predicted label sequence which is resilient to errors by individual models. Error-correcting CRF training is much less resource intensive and has a much faster training time than a standardly formulated CRF, while decoding performance remains quite comparable. This allows us to scale CRFs to previously impossible tasks, as demonstrated by our experiments with large label sets. © 2005 Association for Computational Linguistics.

关键词： Random processes

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：