Filters








1,713 Hits in 2.1 sec

Intention Recognition for Multiple Agents [article]

Zhang Zhang, Yifeng Zeng, Yingke Chen
2021 arXiv   pre-print
Intention Recognition for Multiple Agents Zhang Zhanga , Yifeng  ...  designing a timely counter-strategy to ∗ Corresponding author Email addresses: Yifeng.Zeng@northumbria.ac.uk (Yifeng  ... 
arXiv:2112.02513v1 fatcat:vkttoiaaqzhv5n3rnbnfp2dz4a

PARRAY

Yifeng Chen, Xiang Cui, Hong Mei
2012 SIGPLAN notices  
This paper introduces a programming interface called PARRAY (or Parallelizing ARRAYs) that supports system-level succinct programming for heterogeneous parallel systems like GPU clusters. The current practice of software development requires combining several low-level libraries like Pthread, OpenMP, CUDA and MPI. Achieving productivity and portability is hard with different numbers and models of GPUs. PARRAY extends mainstream C programming with novel array types of the following features: 1)
more » ... he dimensions of an array type are nested in a tree structure, conceptually reflecting the memory hierarchy; 2) the definition of an array type may contain references to other array types, allowing sophisticated array types to be created for parallelization; 3) threads also form arrays that allow programming in a Single-Program-Multiple-Codeblock (SPMC) style to unify various sophisticated communication patterns. This leads to shorter, more portable and maintainable parallel codes, while the programmer still has control over performance-related features necessary for deep manual optimization. Although the source-to-source code generator only faithfully generates low-level library calls according to the type information, higher-level programming and automatic performance optimization are still possible through building libraries of subprograms on top of PARRAY. The case study on cluster FFT illustrates a simple 30-line code that 2x-outperforms Intel Cluster MKL on the Tianhe-1A system with 7168 Fermi GPUs and 14336 CPUs. The design of PARRAY follows the approach of bottom-up abstraction. That means if a basic operation's algorithm or implementation is not unique (with considerable performance differences), the inclination is to provide more basic operations at a lower level. Our purpose is not to solve all the programmability issues but to provide a bottom level of abstraction on which performance-minded programmers can directly write succinct high-performance code and on which higher-level language features can be implemented without unnecessary performance overheads. This kind of "performance transparency" allows other software layers to be built on top of this layer, and the implementation will not be performance-wise penalized because of choosing PARRAY instead of using low-level libraries directly. A programmer can then choose the right programming level to work with. A common means to achieve abstraction is to adopt a unifying communication mechanism, e.g. synchronous message passing in process algebra [14] , distributed memory sharing or Partitioned Global Address Space (PGAS). However, heterogeneous parallel systems are often equipped with different kinds of hardware-based communication mechanisms such as sequentially-consistent shared memory for multicore parallelism, asynchronous message-passing or RDMA for clustering, inconsistent shared memory (with explicit but expensive consistency-enforcing synchronization) for many-
doi:10.1145/2370036.2145838 fatcat:7hb6ai6bsfb3rhkdnz244vyg6e

RRXS [chapter]

Yi Chen, Susan Davidson, Carmem Hara, Yifeng Zheng
2003 Proceedings 2003 VLDB Conference  
Current techniques for storing XML using relational technology consider the structure of an XML document but ignore its semantics as expressed by keys or functional dependencies. However, when the semantics of a document are considered redundancy may be reduced, node identifiers removed where value-based keys are available, and semantic constraints validated using relational primary key technology. In this paper, we propose a novel constraint definition called XFDs that capture structural as
more » ... l as semantic information. We present a set of rewriting rules for XFDs, and use them to design a polynomial time algorithm which, given an input set of XFDs, computes a reduced set of XFDs. Based on this algorithm, we present a redundancy removing storage mapping from XML to relations called RRXS. The effectiveness of the mapping is demonstrated by experiments on three data sets.
doi:10.1016/b978-012722442-8/50025-2 dblp:conf/vldb/ChenDZ03 fatcat:onnewnplb5bivmaxcgn35iul6y

Cumulative Computing

Yifeng Chen
2003 Electronical Notes in Theoretical Computer Science  
For example we have ("Chen","Yifeng") ("Sanders","Jeff") where is the order of the combined cumulator. In most applications, resources are bounded.  ...  For example we have "Yifeng" "Jeff" and "Chen" "Sanders". (v) The cumulator Optimization = ([0, ∞], ; ∞, min ; 1/x) represents an optimization process. We assume that 1/0 = ∞ and 1/∞ = 0.  ... 
doi:10.1016/s1571-0661(03)50002-0 fatcat:ua6q3dsdzrgmriscrl5rt4gize

UTP and Sustainability [chapter]

Yifeng Chen, Jeff W. Sanders
2010 Lecture Notes in Computer Science  
UNU-IIST is jointly funded by the government of Macao and the governments of the People's Republic of China and Portugal through a contribution to the UNU Endowment Fund. As well as providing twothirds of the endowment fund, the Macao authorities also supply UNU-IIST with its office premises and furniture and subsidise fellow accommodation. The mission of UNU-IIST is to assist developing countries in the application and development of software technology. UNU-IIST contributes through its
more » ... matic activities: 1. Advanced development projects, in which software techniques supported by tools are applied, 2. Research projects, in which new techniques for software development are investigated, 3. Curriculum development projects, in which courses of software technology for universities in developing countries are developed, 4. University development projects, which complement the curriculum development projects by aiming to strengthen all aspects of computer science teaching in universities in developing countries, 5. Schools and Courses, which typically teach advanced software development techniques, 6. Events, in which conferences and workshops are organised or supported by UNU-IIST, and 7. Dissemination, in which UNU-IIST regularly distributes to developing countries information on international progress of software technology. Fellows, who are young scientists and engineers from developing countries, are invited to actively participate in all these projects. By doing the projects they are trained. At present, the technical focus of UNU-IIST is on formal methods for software development. UNU-IIST is an internationally recognised center in the area of formal methods. However, no software technique is universally applicable. We are prepared to choose complementary techniques for our projects, if necessary. UNU-IIST produces a report series. Reports are either Research R , Technical T , Compendia C or Administrative A . They are records of UNU-IIST activities and research and development achievements. Many of the reports are also published in conference proceedings and journals. Abstract Hoare and He's approach to unifying theories of programming, UTP, is a dozen years old. In spite of the importance of its ideas, UTP does not seem to be attracting due interest. The purpose of this article is to discuss why that is the case, and to consider UTP's destiny. To do so it analyses the nature of UTP, focusing primarily on unification, and makes suggestions to expand its use.
doi:10.1007/978-3-642-16690-7_2 fatcat:2rls3o2y7fhwjdueirysdh4nvy

Palladium-catalyzed highly efficient synthesis of tetracenes and pentacenes

Ming Chen, Yifeng Chen, Yuanhong Liu
2012 Chemical Communications  
doi:10.1039/c2cc36700a pmid:23145434 fatcat:ohrwmvobl5gireocbadlbpzqce

Logic of Global Synchrony [chapter]

Yifeng Chen, J. W. Sanders
2001 Lecture Notes in Computer Science  
For details we refer the reader to Hoare and He [1998] and Chen [2001 Chen [ , 2002 . We apply that approach now to LOGS.  ...  For a thorough analysis of partitioned fixpoints, see Chen [2003] .  ... 
doi:10.1007/3-540-44685-0_33 fatcat:dshruu3ymze4pa34ybvgg4xi7y

Unifying Probability with Nondeterminism [chapter]

Yifeng Chen, J. W. Sanders
2009 Lecture Notes in Computer Science  
UNU). It is based in Macao, and was founded in 1991. It started operations in July 1992. UNU-IIST is jointly funded by the government of Macao and the governments of the People's Republic of China and Portugal through a contribution to the UNU Endowment Fund. As well as providing twothirds of the endowment fund, the Macao authorities also supply UNU-IIST with its office premises and furniture and subsidise fellow accommodation. The mission of UNU-IIST is to assist developing countries in the
more » ... lication and development of software technology. UNU-IIST contributes through its programmatic activities: 1. Advanced development projects, in which software techniques supported by tools are applied, 2. Research projects, in which new techniques for software development are investigated, 3. Curriculum development projects, in which courses of software technology for universities in developing countries are developed, 4. University development projects, which complement the curriculum development projects by aiming to strengthen all aspects of computer science teaching in universities in developing countries, 5. Schools and Courses, which typically teach advanced software development techniques, 6. Events, in which conferences and workshops are organised or supported by UNU-IIST, and 7. Dissemination, in which UNU-IIST regularly distributes to developing countries information on international progress of software technology. Fellows, who are young scientists and engineers from developing countries, are invited to actively participate in all these projects. By doing the projects they are trained. At present, the technical focus of UNU-IIST is on formal methods for software development. UNU-IIST is an internationally recognised center in the area of formal methods. However, no software technique is universally applicable. We are prepared to choose complementary techniques for our projects, if necessary. UNU-IIST produces a report series. Reports are either Research R , Technical T , Compendia C or Administrative A . They are records of UNU-IIST activities and research and development achievements. Many of the reports are also published in conference proceedings and journals. Please write to UNU-IIST at P.O. Box 3058, Macao or visit UNU-IIST's home page: http://www.iist.unu.edu, if you would like to know more about UNU-IIST and its report series.
doi:10.1007/978-3-642-05089-3_30 fatcat:vu64y4p6avhsvepdje7nqhknh4

Tensor Decomposition for Multi-agent Predictive State Representation [article]

Bilian Chen, Biyang Ma, Yifeng Zeng, Langcai Cao, Jing Tang
2020 arXiv   pre-print
Predictive state representation~(PSR) uses a vector of action-observation sequence to represent the system dynamics and subsequently predicts the probability of future events. It is a concise knowledge representation that is well studied in a single-agent planning problem domain. To the best of our knowledge, there is no existing work on using PSR to solve multi-agent planning problems. Learning a multi-agent PSR model is quite difficult especially with the increasing number of agents, not to
more » ... ntion the complexity of a problem domain. In this paper, we resort to tensor techniques to tackle the challenging task of multi-agent PSR model development problems. By first focusing on a two-agent setting, we construct the system dynamics matrix as a high order tensor for a PSR model, learn the prediction parameters and deduce state vectors directly through two different tensor decomposition methods respectively, and derive the transition parameters via linear regression. Subsequently, we generalize the PSR learning approaches in a multi-agent setting. Experimental results show that our methods can effectively solve multi-agent PSR modelling problems in multiple problem domains.
arXiv:2005.13706v1 fatcat:hj7hqhvk4zhtrj27lpmzizpevy

Compositional Reasoning for Pointer Structures [chapter]

Yifeng Chen, J. W. Sanders
2006 Lecture Notes in Computer Science  
Chen [3] has defined a more general such combinator, parallelvia-medium not restricted to sequential processes.  ... 
doi:10.1007/11783596_10 fatcat:x2ixxvynynbm5khpi7kvgpd5wu

Large-Scale Fast Fourier Transform [chapter]

Yifeng Chen, Xiang Cui, Hong Mei
2011 GPU Computing Gems Emerald Edition  
Bandwidth-intensive tasks such as large-scale fast Fourier transfers (FFTs) without data locality are hard to accelerate on GPU clusters because the bottleneck often lies with the PCI bus or the communication network. Optimizing FFT for a single-GPU device will not improve the overall performance. This chapter shows how to achieve substantial speedups for these tasks. Three GPU-related factors contribute to better performance: first, the use of GPU devices improves the sustained memory
more » ... for processing large-size data; second, GPU device memory allows larger subtasks to be processed in whole and hence reduces repeated data transfers between memory and processors; and finally some costly main-memory operations such as matrix transposition can be significantly sped up by GPUs if necessary data adjustment is performed during data transfers. The technique of manipulating array dimensions during data transfer is the main technical contribution. These factors (as well as the improved communication library in our implementation) attribute to 24.3x speedup with respect to FFTW and 7x speedup with respect to Intel MKL for 4096 3-D single-precision FFT on a 16-node cluster with 32 GPUs. Around 5x speedups with respect to both standard libraries are achieved for double precision.
doi:10.1016/b978-0-12-384988-5.00039-5 fatcat:pvtrjwj33ne3pc6abkzbs5eriu

Conflict and Trust: Partners in Developing Organizations

Dean Tjosvold, Yifeng Chen
2010 Social Science Research Network  
Managers from Shanghai, China, were interviewed about specific times that they had conflicts with their Western superior (Chen & Tjosvold, 2007) .  ...  Experimental findings also support that cooperative goals and openness promote effective decisionmaking between Chinese people and foreign managers (Chen, Tjosvold, & Wu, 2008) .  ... 
doi:10.2139/ssrn.1615195 fatcat:cvuce6iiovdjxevw4jqfozzy3q

A Fixpoint Theory for Non-monotonic Parallelism [chapter]

Yifeng Chen
2002 Lecture Notes in Computer Science  
Chen / Theoretical Computer Science ( ) - 9 monotonic.  ...  Chen / Theoretical Computer Science ( ) - Proof. L 1 is the 1 -least ÿxpoint. Thus, L 1 1 L 2 . If 1 ⊆ 2 , then we have L 1 2 L 2 .  ... 
doi:10.1007/3-540-45793-3_9 fatcat:owny4fnop5hz3mkovhnxdec6eu

A Survey of Robot Swarms' Relative Localization Method

Siyuan Chen, Dong Yin, Yifeng Niu
2022 Sensors  
Chen et al.  ...  Chen et al. [58] proposed an unsupervised indoor positioning system.  ... 
doi:10.3390/s22124424 pmid:35746206 pmcid:PMC9230124 fatcat:kvh2ppntvfcqte5ujskpvtxasq

Immunotherapy for Triple-Negative Breast Cancer

Yifeng Cao, Chuyang Chen, Yi Tao, Weifeng Lin, Ping Wang
2021 Pharmaceutics  
Considering there are more expressed CD155 and PD-L1 in TNBC than in other types of breast cancers, Chen et al.  ...  In TNBC therapy, Chen et al. [110] designed a liposome-encapsulated anganeseprotoporphyrin complex (MnP) and modified with folic acid (FA).  ... 
doi:10.3390/pharmaceutics13122003 pmid:34959285 pmcid:PMC8705248 fatcat:itnvy22bgne37nhv66icgw4xr4
« Previous Showing results 1 — 15 out of 1,713 results