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

JOURNAL OF THE ACM 1972年第2期19卷 193-&页

作者： GREIBACH, S GINSBURG, S University of California at Los Angeles Los Angeles California Department of System Science Los Angeles CA University of Southern California Computer Science Program Olin Hall of Engineering Los Angeles CA

Device representations, via multitape AFA (abstract families of acceptors), are given for the families of languages which result from applying the wedge (A) m)d the substitution operations to AFL (abstract families of languages). In particular, if ~ and ~2 are multitape AFA (i.e. certain families of multistorage tape acceptors), then 5)~ A ~2 is defined as the family of multitape acceptors which results when the tapes of ~ and ~2 are coalesced, with the ~-tapes preceding those in ~2. It is shown that the smallest full AFL containing 2(~) A 2 (~D2) = {L~ N L2 ILi in2 (~Di) } is, 12 (~ h~:). For each multitape AFAr, aset ~.v of “nested” multitape acceptors is defined. It is shown that if ~ and ~2 are single-tape AFA, then the family of languages obtained from (~ A ~2) N is the family of langnages obtained by substituting the AFL defined by ~2 into the AFL defined by ~D~. © 1972, ACM. All rights reserved.

关键词： acceptors AFL theory formal languages intersection multistorage tapes substitution

来源：评论

学校读者我要写书评

暂无评论

Initial Study of Oil Palm Crop Condition Detection Through Drone Imagery: A YOLO Approach

Initial Study of Oil Palm Crop Condition Detection Through D...

引用

International Conference on Informatics, Multimedia, Cyber and Information system (ICIMCIS)

作者： Winata Nugraha Ermatita Deris Stiawan Faculty of Computer Science Doctoral Program Faculty of Engineering Universitas Sriwijaya Palembang Indonesia Department of Information System Universitas Sriwijaya Palembang Indonesia Faculty of Computer Science Universitas Sriwijaya Palembang Indonesia

ISBN: (数字)9798331533243

ISBN: (纸本)9798331533250

Oil palm plantations in Indonesia still have many challenges, especially in terms of monitoring and mapping technology. One of the important aspects in the monitoring stage of oil palm plantations is monitoring the productivity of oil palm plants. To identify the oil palm plants, many previous studies have utilized image analysis to solve the problem. The problem is that poor image conditions can affect the architecture model to be built.[1] So in this research we do tune mapping on the image to produce a quality image. Each image data that has been improved will be feature extracted using ResNet and VGG to produce the best model. Furthermore, the classification model development process is carried out using CNN architecture as the model architecture. We also provide innovation by using object detection technology. Which uses artificial neural networks. Here we train the model using aerial video datasets of oil palm plants obtained from drones. Furthermore, to evaluate the performance of the above technique, it is proposed to use the mapping model, precision and accuracy evaluation obtained in the test phase[2]

关键词： YOLO Productivity Technological innovation Oils Multimedia systems Plantations Feature extraction Informatics Monitoring Drones

来源：评论

学校读者我要写书评

暂无评论

PAPR reduction in an OFDM system using recursive clipping and filtering technique

引用

WSEAS Transactions on Communications 2014年第1期13卷 291-297页

作者： Islam, Anamul Ahmed, N. Ahamed, Nizam Uddin Rahman, Matiur Aljunid, S.A. Dept. of Applied Physics and Electronic Engineering University of Rajshahi Bangladesh School of Computer and Communication Engineering University Malaysia Perlis Malaysia Biomedical Engineering Program Mechatronic Engineering University Malaysia Perlis Malaysia College of Computer Science and Information System Najran University Saudi Arabia

An Orthogonal Frequency Division Multiplexing (OFDM) scheme is expected as an efficient technique for next generation wireless communications. However, high Peak to Average Power Ration (PAPR) of OFDM system is the main drawback which degrades the transmitter power efficiency causes poor performance of the system. To reduce PAPR of OFDM signal, several works on clipping technique have been proposed. This paper is incorporated the improvement of the PAPR and Bit Error Rate (BER) performance using clipping method. It has been shown from the result that by employing the recursive clipping and filtering, 11.45 dB of PAPR of original OFDM signal is reduced down to 4.77 dB. Hence, BER is also increased significantly. This research is carried out through MATLAB simulation and gradually measured the effect of PAPR on BER under AWGN channel for 16QAM scheme with 256 points OFDM. Moreover, it is studied the effect of OFDM signal while passing through High Power Amplifier (HPA). Finally, the PAPR reduction technique such as recursive clipping and filtering (RCF) is implemented.

关键词： Orthogonal frequency division multiplexing

来源：评论

学校读者我要写书评

暂无评论

Hotel Information system Management Audit Using COBIT 2019 - APO12

Hotel Information System Management Audit Using COBIT 2019 -...

引用

Innovation in Technology (INOCON), IEEE International Conference for

作者： Joy Nashar Utamajaya Suhono Harso Supangat Ford Lumban Gaol Benny Ranti BINUS Graduate Program School of Information System BINUS University Jakarta Indonesia School of Electrical Engineering and Informatic Bandung Institute of Technology Bandung Indonesia Computer Science Department BINUS Graduate Program Computer Science Bina Nusantara University Jakarta Indonesia Computer Science Department Faculty of Computer Science University of Indonesia Depok Indonesia

In general, public or private organizations or companies have used information-based technology as a support to improve business performance to be more effective and efficient in order to achieve a company’s business goals. Given the large contribution of information technology in the application of hotel applications as a supporting information system, it is a vital system that must avoid risks that can hinder and cause harm to the hotel management business processes. Therefore, it is necessary to carry out risk management using the COBIT 5 framework to manage possible risks that may occur based on the APO12 (Manage Risk) domain. From the evaluation results of the data obtained through observation and interviews as well as the calculation of the results of the questionnaire based on 6 APO12 subdomains, the results of the risk management level capability assessment in hotel applications are still at level 3 or have reached the level of established process with the target to be achieved at level 4 resulting in a gap of 1 level. Based on the results obtained, it is necessary to propose recommendations that can be used by hotels in improving the application of information technology risk management so that in the future it can achieve the expected target level so that the APO12 level of capability can increase and become more optimal.

关键词： Technological innovation Companies Risk management Information technology Interviews Information systems

来源：评论

学校读者我要写书评

暂无评论

On nonrepetitive colorings of paths and cycles

arXiv

引用

arXiv 2023年

作者： Botler, Fábio Lomenha, Wanderson de Souza, João Pedro Program System Engineering and Computer Science COPPE Brazil Universidade Federal do Rio de Janeiro Brazil Colégio Pedro II Brazil

We say that a sequence a1 · · · a2t of integers is repetitive if ai = ai+t for every i ∈ {1, ..., t}. A walk in a graph G is a sequence v1 · · · vr of vertices of G in which vivi+1 ∈ E(...

We say that a sequence a1 · · · a2t of integers is repetitive if ai = ai+t for every i ∈ {1, ..., t}. A walk in a graph G is a sequence v1 · · · vr of vertices of G in which vivi+1 ∈ E(G) for every i ∈ {1, ..., r − 1}. Given a k-coloring c: V (G) → {1, ..., k} of V (G), we say that c is walk-nonrepetitive (resp. stroll-nonrepetitive) if for every t ∈ N and every walk v1 · · · v2t the sequence c(v1) · · · c(v2t) is not repetitive unless vi = vi+t for every i ∈ {1, ..., t} (resp. unless vi = vi+t for some i ∈ {1, ..., t}). The walk (resp. stroll) chromatic number σ(G) (resp. ρ(G)) of G is the minimum k for which G has a walk-nonrepetitive (resp. stroll-nonrepetitive) k-coloring. Let Cn and Pn denote, respectively, the cycle and the path with n vertices. In this paper we present three results that answer questions posed by Barát and Wood in 2008: (i) σ(Cn) = 4 whenever n ≥ 4 and n ∈/{5, 7};(ii) ρ(Pn) = 3 if 3 ≤ n ≤ 21 and ρ(Pn) = 4 otherwise;and (iii) ρ(Cn) = 4, whenever n ∈/{3, 4, 6, 8}, and ρ(Cn) = 3 otherwise. In particular, (ii) improves bounds on n obtained by Tao in *** Codes 05C15, 05C38 Copyright © 2023, The Authors. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Ranking in Collaboration Networks Using a Relationship Intensity Metric

Ranking in Collaboration Networks Using a Relationship Inten...

引用

Simpósio Brasileiro de Sistemas Colaborativos

作者： Vinicius Pires M. Freire Daniel R. Figueiredo COPPE/System Engineering and Computer Science Program (PESC) Federal University of Rio de Janeiro Rio de Janeiro Rio de Janeiro Brazil

Collaboration networks are social networks in which relationships represent some kind of professional collaboration. The study of collaboration networks can help identify members that are important or influential within a given community. This work is divided into two parts. The first part is a study of the topological properties of two collaboration networks: the global collaboration network and the Brazilian collaboration network of authors of scientific papers within the area of computer science. The second part presents a ranking metric for vertices based on the intensities of their relationships. Using the proposed metric and other more classical metrics, we rank the researchers in Brazil in computer science. The proposed metric was compared with subjective evaluation of researchers made by CNPq. The results show the effectiveness of the proposed metric in identifying influential researchers when compared to another metrics in the literature.

关键词： Measurement Collaboration computer science Manuals Biology Communities Computational modeling

来源：评论

学校读者我要写书评

暂无评论

A Q-Learning Hybrid BRKGA Applied to the Knapsack Problem with Forfeits

A Q-Learning Hybrid BRKGA Applied to the Knapsack Problem wi...

引用

Congress on Evolutionary Computation

作者： Gabriel Souto Masayoshi Aritsugi Israel Mendonça Luidi Simonetti Pedro Henrique González System Engineering and Computer Science Program Federal University of Rio de Janeiro Rio de Janeiro Brazil Faculty of Advanced Science and Technology Kumamoto University Kumamoto Japan

ISBN: (数字)9798350308365

ISBN: (纸本)9798350308372

This paper presents a hybrid BRKGA (Q-HBRKGA) that combines BRKGA with Q-learning and a Local Branching technique to solve the Knapsack Problem with Forfeits(KPF). The aim is to tackle this problem, a vari-ant of the 0–1 Knapsack Problem, where a penalty cost is imposed when both items of a forfeit pair are included in the solution. Notably, Q-HBRKGA achieves superior results compared to existing approaches, establishing a valid strategy for KPF problem-solving. Computational experiments, utilizing benchmark instances, demonstrate the efficacy of Q-HBRKGA by outperforming state-of-the-art methods documented in the literature.

关键词： Q-learning Costs Evolutionary computation Benchmark testing Problem-solving

来源：评论

学校读者我要写书评

暂无评论

An approach to blind equalization of non-minimum phase systems

An approach to blind equalization of non-minimum phase syste...

引用

International Conference on Acoustics, Speech, and Signal Processing (ICASSP)

作者： W.A. Sethares R.A. Kennedy Z. Gu Department of Electrical and Computer Engineering University of Wisconsin Madison WI USA Department of System Engineering RSPhysSE and Interdisciplinary Engineering Program Faculty of Science Australian National University Canberra ACT Australia

Blind equalization of systems which contain a nonminimum phase component is a difficult task. Minimizing the energy (l/sub 2/ minimization) of the equalizer output (under a fixed tap constraint) cannot be guaranteed to open the eye (to reliably unscramble the message) because it tends to converge to an equalizer setting that contains a reflection of the unstable zeros inside the unit circle. It is shown that, in at least one simple setup involving a mixture of minimum and nonminimum phase elements, an l/sub infinity / minimization of the equalizer output is the appropriate criterion which should be minimized in order to successfully open the eye. Utilizing a finite impulse response equalizer constrained to have a unity coefficient on the center tap, it is shown that for a large enough dimension (depending on the closeness of the zeros of the channel to the unit circle) the eye will be opened. There is no simple (gradient) scheme to exactly implement the l/sub infinity / minimization. The use of a gradient l/sub p/ scheme for large p is proposed.< >

关键词： Blind equalizers Finite impulse response filter Australia Council Information science Predistortion Distortion Cellular neural networks Quadrature amplitude modulation Stability

来源：评论

学校读者我要写书评

暂无评论

A Hybrid Approach with BRKGA and Data Mining for the Early/Tardy Scheduling Problem

A Hybrid Approach with BRKGA and Data Mining for the Early/T...

引用

Congress on Evolutionary Computation

作者： Israel Mendonça Tirana Noor Fatyanosa Masayoshi Aritsugi Pedro Henrique González Silva Faculty of Advanced Science and Technology Kumamoto University Kumamoto Japan Faculty of Computer Science Brawijaya University Malang Indonesia System Engineering and Computer Science Program Federal University of Rio de Janeiro Rio de Janeiro Brazil

ISBN: (数字)9798350308365

ISBN: (纸本)9798350308372

This paper introduces a novel hybrid genetic algorithm combined with data mining to solve a version of the early/tardy scheduling problem in which no unforced idle time may be inserted in a sequence. The chromosome representation of the problem is based on random keys and we use the Biased Random-Key Genetic Algorithm (BRKGA) to establish an order in which jobs are scheduled. A data mining component gathers data from the evolutionary steps of BRKGA and suggests chromosomes based on past observations. In this way, we address a key challenge in BRKGA - the exploration of solutions near an individual gene - by leveraging data-driven insights to refine and enhance the search space. Comparative analysis reveals that our hybrid algorithm significantly benefits from the pattern recognition capabilities of data mining, leading to improved scheduled efficiency. The results of a series of computational experiments underscore the potential of this hybrid approach that, although requiring slightly longer computational times, is better than the previous baseline BRKGA algorithm in terms of solution quality.

关键词： Processor scheduling Evolutionary computation Scheduling Data mining Biological cells Genetic algorithms

来源：评论

学校读者我要写书评

暂无评论

Dynamic screen division for load balancing the raycasting of irregular data

Dynamic screen division for load balancing the raycasting of...

引用

IEEE International Conference on Cluster Computing

作者： Bernardo B. Labronici Cristiana Bentest Lucia Maria A. Drummond Ricardo Farias Computer Science Department Federal Fluminense University Niterói RJ Brazil Department of System Engineering State University of Rio de Janeiro Rio de Janeiro RJ Brazil System Engineering and Computer Science Program-COPPE Centro de Tecnologia Rio de Janeiro RJ Brazil

Parallel rendering algorithms usually suffer from high load imbalance during execution, due to the irregular nature of the datasets. In this paper, we propose a new load balancing scheme for tile-based parallel rendering that includes strategies for load estimation, tile decomposition and tile assignment. The load estimation strategy computes the rendering cost for each pixel, and uses it as a prediction for the next frame. The tile decomposition strategy adaptively divides the screen into tiles based on the computed costs, until an evenly tile partition is achieved. The tile assignment strategy distributes the tiles among rendering processors, based on a 2-optimal scheduling. Experimental results show that our scheme achieves significant performance gains by reducing the load imbalance when compared to the traditional tile subdivision and static random distribution schemes.

关键词： Load management Tiles Rendering (computer graphics) Concurrent computing Parallel processing computer science Costs Data visualization Data engineering systems engineering and theory

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：