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

From standard to non-standard semantics by semantics modifiers

International Journal of Foundations of computer science 2001年第2期12卷 171-211页

作者： Abramov, Sergei Glück, Robert Program Systems Institute Russian Academy of Sciences RU-152140 Pereslavl-Zalessky Russian Federation Department of Information and Computer Science School of Science and Engineering Waseda University Shinjuku-ku Tokyo 169-8555 Japan

An approach for systematically modifying the semantics of programming languages by semantics modifiers is described. Semantics modifiers are a class of programs that allow the development of general and reusable semantics components. Language independence is achieved through the interpretive approach: an interpreter serves as a mediator between the new language and the language for which the non-standard semantics was implemented. Inverse computation, equivalence transformation and neighborhood analysis are shown to be semantics modifiers. Experiments with these modifiers show the computational feasibility of this approach. Seven modifier projections are given which allow the efficient implementation of non-standard interpreters and non-standard compilers by program specialization or other powerful program transformation methods. © 2001 World Scientific Publishing Company.

关键词： interpreters non-standard semantics partial evaluation program transformation programming languages supercompilation

来源：评论

学校读者我要写书评

暂无评论

Dynamic process adaptation: A context-aware approach

Dynamic process adaptation: A context-aware approach

引用

International Conference on computer Supported Cooperative Work in Design

作者： Nunes, Vanessa Tavares Werner, Cláudia M. Lima Santoro, Flávia Maria COPPE/PESC - Systems Engineering and Computer Science Program - UFRJ PO Box 68511 21945-970 Rio de Janeiro Brazil NP2Tec and Postgraduate Information Systems Program UNIRIO Rio de Janeiro Brazil

ISBN: (纸本)9781457703874

Dynamism of day-to-day activities in organizations is inextricably linked and there is a variety of information, insight and reasoning being processed between people and systems, in carrying out a business process. We argue that flexibility in processes could be managed in real time, using context information collected in the work environment. This paper proposes a context management architecture approach that aims to improve and automate dynamic process adaptation. We explain how process adaptation may occur in real time and discuss a scenario for this proposal © 2011 IEEE.

关键词： Process design

来源：评论

学校读者我要写书评

暂无评论

Mediating process adaptation through a goal-oriented context-aware approach

Mediating process adaptation through a goal-oriented context...

引用

2012 IEEE 16th International Conference on computer Supported Cooperative Work in Design, CSCWD 2012

作者： Nunes, Vanessa Tavares Werner, Cláudia M. Lima Santoro, Flávia Maria COPPE/PESC - Systems Engineering and Computer Science Program UFRJ PO Box 68511 21945-970 Rio de Janeiro Brazil NP2Tec and Postgraduate Information Systems Program UNIRIO Rio de Janeiro Brazil

ISBN: (纸本)9781467312127

Complexity and dynamism of day-to-day activities in organizations are inextricably linked, one impacting the other, increasing the challenges for constant adaptation on the way to organize work to address emerging demands. Market is demanding systems that are aware of organizations processes and able to evolve and adapt to new situations in everyday working activities. We argue that flexibility in processes could be managed in real time, by PAIS (Process-aware Information systems), using context information collected in the work environment. This paper proposes CGAdapt, a context management architecture approach that aims to improve and automate dynamic process adaptation. We explain how process adaptation may occur in real time through an existent scenario using this proposal and discuss the value of context-awareness to reason about process alternative adaptations in a goal oriented approach. © 2012 IEEE.

关键词： Real time systems

来源：评论

学校读者我要写书评

暂无评论

Intelligent Constellation Generation based on Autoencoder Communication System 2

Intelligent Constellation Generation based on Autoencoder Co...

引用

2nd IEEE International Conference on computer Vision and Machine Intelligence, CVMI 2023

作者： Matsumoto, Kaisei Toma, Takao Oshiro, Shiho Wada, Tomohisa Computer Science and Intelligent Systems Program University of the Ryukyus Okinawa Japan Magna Design Net Inc Okinawa Japan Information Technology Center University of the Ryukyus Okinawa Japan Area of Computer Science and Intelligent Systems University of the Ryukyus Dept. of Engineering Okinawa Japan

ISBN: (纸本)9798350305142

This paper discusses intelligent constellation generation based on autoencoder communication system. In previous studies, the amplitude was set to fluctuate between r=0.0 and 1.0. However, when checking the generated constellation, distortion was confirmed instead of the conventional symbol arrangement. Therefore, in this paper, it compares the case where the amplitude is constant, the case where the average amplitude within a Minibatch is 1, and the case where the average amplitude is 1 for Interval time. The communication standard used in this research is IEEE 802.11a, assuming wireless Local Area Network (LAN) specifications. The IEEE 802.11a standard has an Fast Fourier Transform (FFT) length of 64, a subcarrier number of 52, and Quadrature Phase Shift Keying (QPSK) and 16 Quadrature Amplitude Modulation (QAM), modulation methods. A guard interval of 800 ns is added and the symbol length is 4000 ns. First, a simulation was performed under the condition that the amplitude was kept constant. QPSK with 4 symbols, constant amplitude model is rounded more than previous research result. 16QAM with 16 symbols is arranged regularly like lined up on a line. Second, the simulation was performed under the condition that the average amplitude within the minibatch was set to 1. QPSK with 4 symbols, appears to rotate clockwise. 16QAM with 16 symbols has a more uniform symbol placement than previous research result. Third, a simulation was performed under the condition that the average amplitude within Interval time was set to 1. QPSK with 4 symbols, is the closest to square among QPSK output results so far. The direction is slightly tilted, but if it can be rotated a little more, it may be possible to reproduce the same symbol arrangement as before. 16QAM with 16 symbols, the symbol arrangement is biased as a whole. However, it can be seen that are arranged in line on the line, perhaps due to regularity. As future work, in addition to the conditions set this time, it will exa

关键词： Quadrature phase shift keying

来源：评论

学校读者我要写书评

暂无评论

Scalability in Autoencoder-based OFDM Communication System 2

Scalability in Autoencoder-based OFDM Communication System

引用

2nd IEEE International Conference on computer Vision and Machine Intelligence, CVMI 2023

作者： Tsugawa, Seizan Toma, Takao Oshiro, Shiho Wada, Tomohisa University of the Ryukyus Computer Science and Intelligent Systems Program Okinawa Japan Magna Design Net Inc Okinawa Japan University of the Ryukyus Information Technology Center Okinawa Japan University of the Ryukyus Area of Computer Science and Intelligent Systems Dept. of Engineering Okinawa Japan

ISBN: (纸本)9798350305142

This paper proposed Scalability in Autoencoder-based Orthogonal Frequency Division Multiplexing(OFDM) communication system. In the previous research, only the comparison between IEEE802.11a and Autoencoder by the conventional OFDM communication system was performed, and it was proved that the communication system created by Autoencoder exceeded the performance of the conventional system. Therefore, in this paper, it uses IEEE802.11n and compare whether it can be improved by expanding the bandwidth and using ***802.11n standard has an FFT length of 128, a subcarrier number of 114 (108 for data), and modulation schemes of Quadrature Phase Shift Keying(QPSK), 16 Quadrature Amplitude Modulation (16QAM). The GI length is 800ns and the symbol length is 4000ns. In the simulation, a computer simulation was performed using a conventional OFDM communication system and a communication system generated by Autoencoder. Assuming that the simulation environment had an Signal-to-Noise Ratio (SNR) of 0 to 30 and an amplitude r of 0.0 to 1.0, the Symbol Error Rate (SER) status for each SNR was output. As a result of computer simulation, QPSK converged at SNR 27 at IEEE 802.11a, but was able to reduce SER overwhelmingly to SNR 12 at IEEE 802.11n. Also, in 16QAM the convergence at r=0.0 is the same as for SNR22 , but in IEEE 802.11a it does not converge after r=0.6, but in IEEE 802.11n it does not converge only at r=0.9 and r=1.0. As a future task, it will use IEEE802.11ac, which enables communication speeds several times faster than IEEE802.11n, examine whether it is possible to further improve accuracy. And it will continue our research to correspond MIMO communication. © 2023 IEEE.

关键词： Orthogonal frequency division multiplexing

来源：评论

学校读者我要写书评

暂无评论

A parallel Ray Tracing architecture suitable for application-specific hardware and GPGPU implementations

A parallel Ray Tracing architecture suitable for application...

引用

2011 14th Euromicro Conference on Digital System Design: Architectures, Methods and Tools, DSD 2011

作者： Nery, Alexandre S. Nedjah, Nadia Franca, Felipe M.G. Jozwiak, Lech LAM - Computer Architecture and Microelectronics Laboratory Systems Engineering and Computer Science Program COPPE Universidade Federal Rio de Janeiro Brazil Department of Electronics Engineering and Telecommunications Faculty of Engineering Universidade do Estado Rio de Janeiro Brazil Department of Electrical Engineering - Electronic Systems Eindhoven University of Technology Netherlands

ISBN: (纸本)9780769544946

The Ray Tracing rendering algorithm can produce high-fidelity images of 3-D scenes, including shadow effects, as well as reflections and transparencies. This is currently done at a processing speed of at most 30 frames per second. Therefore, actual implementations of the algorithm are not yet suitable for interactive real-time rendering, which is required in games and virtual reality based applications. Fortunately, the algorithm allows for massive parallelization of its computations. In this paper, we present a parallel architecture for ray tracing based on a uniform spatial subdivision of the scene and exploiting an embedded computation of ray-triangle intersections. This approach allows for a significant acceleration of intersection computations, as well as, a reduction of the total number of the required intersections checks. Furthermore, it allows for these checks to be performed in parallel and in advance for each ray. In this paper we discuss and analyze an ASIP-based implementation using FPGAs and a GPGPU-based parallel implementation of the proposed architecture. The performance of both implementations are reported and compared." © 2011 IEEE.

关键词： Ray tracing

来源：评论

学校读者我要写书评

暂无评论

On Efficient Processing of Queries for Live Multi-Streaming Soiree Organization

引用

IEEE Transactions on Services Computing 2023年第4期16卷 2812-2826页

作者： Kankeu Fotsing, C.P. Shen, Chih-Ya Huang, Liang-Hao Chen, Yi-Shin Lee, Wang-Chien Yang, De-Nian International Graduate Program Academia Sinica Social Networks and Human-Centered Computing Program Taipei115 Taiwan National Tsing Hua University Institute of Information Systems and Applications Hsinchu300 Taiwan National Tsing Hua University Department of Computer Science Hsinchu300 Taiwan Academia Sinica Institute of Information Science Taipei115 Taiwan Pennsylvania State University Department of Computer Science and Engineering State CollegePA16801 United States

Real-time social interactions and multi-streaming are two critical features of live streaming services. In this paper, we formulate a new fundamental service query, Social-aware Diverse and Preferred Organization Query (SDSQ), that jointly selects a set of diverse and preferred live streaming channels and a group of socially tight viewers for organization of a live multi-streaming soiree. We prove that SDSQ is NP-hard and inapproximable within any factor, and design SDSSel, a 2-approximation algorithm with a guaranteed error bound. Moreover, we study SDSQ-T, a special case of SDSQ, where the social graph is a threshold graph, and propose TDSSel, a 2-approximation algorithm without any error to SDSQ-T. We propose two pruning strategies, PCP and CDP to boost SDSSel and TDSSel. We further propose a more challenging but practical service query, Generalized Social-aware Maximum Preferred and Diverse Query (GSPQ), a generalization of SDSQ. We design GPDSel, a 4-approximation algorithm for GSPQ with a guaranteed error bound. We propose a strategy to improve the approximation ratios of the proposed algorithms. A user study on Twitch validates SDSQ, and the large-scale experiments on real datasets demonstrate the superiority of the proposed algorithms over several baselines for live-streaming services. © 2008-2012 IEEE.

关键词： Approximation algorithms

来源：评论

学校读者我要写书评

暂无评论

An information visualization feature model for supporting the selection of software visualizations 22

An information visualization feature model for supporting th...

引用

22nd International Conference on program Comprehension, ICPC 2014

作者： Vasconcelos, Renan Schots, Marcelo Werner, Cláudia Systems Engineering and Computer Science Program COPPE/UFRJ PO Box 68511 Rio de Janeiro RJCEP21945-970 Brazil

ISBN: (纸本)9781450328791

Software development comprises the execution of a variety of tasks, such as bug discovery, finding reusable assets, dependency analysis etc. A better understanding of the task at hand and its surroundings can improve the development performance in general. Software visualizations can support such understanding by addressing different issues according to the necessity of stakeholders. However, knowing which visualizations better fit a given task in progress is not a trivial skill. In this sense, a feature model, intended for organizing the knowledge of a given domain and allowing the reuse of components, can support the identification, categorization and selection of information visualization elements. This work presents an ongoing domain analysis performed for building an information visualization feature model, whose goal is to support the process of choosing and building proper, suitable software visualizations. Copyright © 2014 ACM.

关键词： Visualization

来源：评论

学校读者我要写书评

暂无评论

Investigating the user mobility in wireless mobile networks through real measurements 06

Investigating the user mobility in wireless mobile networks ...

引用

2nd Conference on Future Networking Technologies, CoNEXT'06

作者： Campos, Carlos Alberto V. De Moraes, Luis Felipe M. Systems Engineering and Computer Science Program-COPPE HighSpeed Networks Laboratory RAVEL Federal University of Rio de Janeiro/UFRJ Rio de Janeiro RJ Brazil

In this paper is proposed a real mobility characterization study for wireless devices. For this, we use mobility metrics and statistic analysis to evaluate the behavior of device movement components.

ISBN: (纸本)1595934561

In this paper is proposed a real mobility characterization study for wireless devices. For this, we use mobility metrics and statistic analysis to evaluate the behavior of device movement components.

关键词： Wireless networks

来源：评论

学校读者我要写书评

暂无评论

Static packet routing in NoC platform using ACO-based algorithms

Static packet routing in NoC platform using ACO-based algori...

引用

13th International Conference on Intelligent Data engineering and Automated Learning, IDEAL 2012

作者： Silva Jr., Luneque Nedjah, Nadia De Macedo Mourelle, Luiza Systems Engineering and Computer Science Program COPPE Federal University of Rio de Janeiro Brazil Department of Electronics Engineering and Telecommunications State University of Rio de Janeiro Brazil Department of Systems Engineering and Computation State University of Rio de Janeiro Brazil

ISBN: (纸本)9783642326387

Networks-on-Chip (NoC) have been used as an interesting option in design of communication infrastructures for embedded systems, providing a scalable structure and balancing the communication between cores. Because several data packets can be transmitted simultaneously through the network, an efficient routing strategy must be used in order to avoid congestion delays. In this paper, ant colony algorithms were used to find and optimize routes in a mesh-based NoC, where several randomly generated applications have been mapped. The routing optimization is driven by the minimization of total latency in packets transmission between tasks. The simulation results show the effectiveness of the ant colony inspired routing by comparing it with general purpose algorithms for deadlock free routing. © 2012 Springer-Verlag.

关键词： Ant colony optimization

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：