ppxscal/embedding_network huggingface dataset:
A continuous time markov decision process based on-chip buffer allocation methodology
Authors: S. Kallakuri, N. Thepayasuwan, A. Doboli, E. A. Feinberg
Venue: Proceedings of the 15th ACM Great Lakes symposium on VLSI (2005)

We have presented an optimal on-chip buffer allocation and buffer insertion methodology which uses stochastic models of the architecture. This methodology uses finite buffer space and presents a method to distribute this finite space in an optimal fashion. Such a methodology is useful in managing the scarce buffer resources available on chip as compared to network based data communication which can have large buffer space. The methodology also uses Continuous Time Markov Decision Processes CTMDPs. The modeling of this problem in terms of a CTMDP framework lead to a nonlinear formulation due to usage of bridges in the bus architecture. We present a methodology to split the problem into several smaller, though linear systems and we then solve these subsystems.
Distributed oblivious function evaluation and its applications
Authors: Hong-Da Li, Xiong Yang, Deng-Guo Feng, Bao Li
Venue: Journal of Computer Science and Technology (2004)

This paper is about distributed oblivious function evaluation (DOFE). In this setting one party (Alice) has a function f(x), and the other party (Bob) with an input α wants to learn f(α) in an oblivious way with the help of a set of servers. What Alice should do is to share her secret function f(x) among the servers. Bob obtains what he should get by interacting with the servers. This paper proposes the model and security requirements for DOFE and analyzes three distributed oblivious polynomial evaluation protocols presented in the paper.
Drawing in three dimensions: a paradigm shift
Authors: Stuart Mealing
Venue: Proceedings of the 5th conference on Creativity cognition (2005)

This paper considers issues explored during the inaugural project of the Feral Drawing Group (University of Plymouth, Exeter) in which rapid prototyping technology was investigated as a potential drawing environment. It concentrates on a paradigm shift in the grammar of traditional objective drawing that was found to occur when the drawing device is not constrained to a flat surface but can move freely in a three dimensional space. It also describes practical and conceptual considerations arising from the translation of a virtual 3D drawing into a real-world object.
Simulation of Vector Nonlinear Time Series Models on Clusters
Authors: Ioana Banicescu, Ricolindo L. Carino, Jane L. Harvill, John Patrick Lestrade
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 13 - Volume 14 (2005)

Vector functional coefficient autoregressive (VFCAR) models are powerful nonlinear times series models. Statistical estimation and inference involving VFCAR models are computationally intensive so that simulations to study statistical properties take weeks, or even months. As a consequence, empirical results are often based on a relatively small number of simulation replications, sacrificing precision, accuracy and reliability in the interest of "computational expediency." The simulations are amenable for parallelization; however, parallel computing technology has not been implemented in the VFCAR literature. This paper proposes an approach to the parallelization of statistical simulation codes to address long running times, without resorting to extensive code revisions. This approach takes advantage of recent advances in dynamic loop scheduling on workstation clusters to achieve high performance, even with the presence of unpredictable load imbalance factors. Preliminary results indicate that efficiencies in the range 95-99% on 32 processors of a Sun Solaris cluster are achievable.
A shared service terminology for online service provisioning
Authors: Ziv Baida, Jaap Gordijn, Borys Omelayenko
Venue: Proceedings of the 6th international conference on Electronic commerce (2004)

An extensive literature research in the fields of IT and business science reveals that service-related terms as service and e-service have multiple interpretations within business science, information science and computer science, resulting in confusion. These three communities take part in the multi-disciplinary process of realizing e-Commerce scenarios for services. Each community has its own role in e-service offering, and uses its own terminology. In this paper we analyze the different perspectives that these three communities have on the online service provisioning concept. We introduce different meanings of service-related terms in the three communities, and use a real-world case study to show how all three perspectives and terminologies need to be joined with each other for the realization of collaborative e-Commerce scenarios for service offerings on the Semantic Web.An extensive literature research in the fields of IT and business science reveals that service-related terms as service and e-service have multiple interpretations within business science, information science and computer science, resulting in confusion. These three communities take part in the multi-disciplinary process of realizing e-Commerce scenarios for services. Each community has its own role in e-service offering, and uses its own terminology. In this paper we analyze the different perspectives that these three communities have on the online service provisioning concept. We introduce different meanings of service-related terms in the three communities, and use a real-world case study to show how all three perspectives and terminologies need to be joined with each other for the realization of collaborative e-Commerce scenarios for service offerings on the Semantic Web.
Face Recognition with Weighted Locally Linear Embedding
Authors: Nathan Mekuz, Christian Bauckhage, John K. Tsotsos
Venue: Proceedings of the 2nd Canadian conference on Computer and Robot Vision (2005)

We present an approach to recognizing faces with varying appearances which also considers the relative probability of occurrence for each appearance. We propose and demonstrate extending dimensionality reduction using locally linear embedding (LLE), to model the local shape of the manifold using neighboring nodes of the graph, where the probability associated with each node is also considered. The approach has been implemented in software and evaluated on the Yale database of face images. Recognition rates are compared with non-weighted LLE and principal component analysis (PCA), and in our setting, weighted LLE achieves superior performance.
Research on DRM-Enabled Learning Objects Model
Authors: Qingtang Liu, Zongkai Yang, Kun Yan, Jing Jin, Wanting Deng
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II - Volume 02 (2005)

The paper mainly discusses the DRM-enabled learning object model. Firstly, it analyses the art-of-status of Intellectual Property Rights in e-learning. Secondly, according to application scenarios, granularity and e-commercial model, the paper probes into DRM-enabled learning object model based on Learning Object Model or Content Packaging standard. Following this, it describes the DRM-enabled learning object model by using MPEG21 Rights Expression Language. At last, it also evaluates the features of different DRM-enabled learning object models according to granularity, complexity, flexibility and instructional meaning.
Run-time support for heterogeneous multitasking on reconfigurable SoCs
Authors: T. Marescaux, V. Nollet, J.-Y. Mignolet, A. Bartic, W. Moffat, P. Avasare, P. Coene, D. Verkest, S. Vernalde, R. Lauwereins
Venue: Integration, the VLSI Journal (2004)

In complex reconfigurable systems on chip (SoC), the dynamism of applications requires an efficient management of the platform. To allow run-time management of heterogeneous resources, operating systems (OS) and reconfigurable SoC platforms should be developed together. For run-time support of reconfigurable architectures, the OS must abstract the reconfigurable computing resources and provide an efficient communication layer. This paper presents our efforts to simultaneously develop the run-time support and the communication layer of reconfigurable SoCs. We show that networks-on-chip (NoC) are an ideal communication layer for dynamically reconfigurable SoCs, explain how our OS provides run-time support for dynamic task relocation and detail how hardware parts of the OS are integrated into the higher layers of the NoC. An implementation of the OS and of the dedicated communication layer on our reconfigurable architecture supports the concepts we describe.
Accurate optical flow computation under non-uniform brightness variations
Authors: Chin-Hung Teng, Shang-Hong Lai, Yung-Sheng Chen, Wen-Hsing Hsu
Venue: Computer Vision and Image Understanding (2005)

In this paper, we present a very accurate algorithm for computing optical flow with non-uniform brightness variations. The proposed algorithm is based on a generalized dynamic image model (GDIM) in conjunction with a regularization framework to cope with the problem of non-uniform brightness variations. To alleviate flow constraint errors due to image aliasing and noise, we employ a reweighted least-squares method to suppress unreliable flow constraints, thus leading to robust estimation of optical flow. In addition, a dynamic smoothness adjustment scheme is proposed to efficiently suppress the smoothness constraint in the vicinity of the motion and brightness variation discontinuities, thereby preserving motion boundaries. We also employ a constraint refinement scheme, which aims at reducing the approximation errors in the first-order differential flow equation, to refine the optical flow estimation especially for large image motions. To efficiently minimize the resulting energy function for optical flow computation, we utilize an incomplete Cholesky preconditioned conjugate gradient algorithm to solve the large linear system. Experimental results on some synthetic and real image sequences show that the proposed algorithm compares favorably to most existing techniques reported in literature in terms of accuracy in optical flow computation with 100% density.
Cell-DEVS/GDEVS for Complex Continuous Systems
Authors: Gabriel A. Wainer, Norbert Giambiasi
Venue: Simulation (2005)

The Cell-Discrete Event System Specification (Cell-DEVS) formalism allows defining asynchronous cell spaces with explicit timing delays (based on the specifications of the DEVS formalism). The authors used Cell-DEVS to solve different applications and go one step further in the definition of complex continuous systems by combining Cell-DEVS and Generalized DEVS (GDEVS). They focus on a model describing the electrical behavior of the heart tissue, as previous research in this field has thoroughly studied this problem using differential equations and cellular automata. The authors show that they can provide adequate levels of precision at a fraction of the computing cost of differential equations. Their thesis is that the use of the GDEVS formalism is perfectly suited to attack problems such as this one, improving complex systems analysis. The authors show that their approach permits making models easily extensible to provide different actions in different cells while not affecting performance.
Dynamic dimensional feedback: an interface aid to business rule creation
Authors: Sharon L. Greene, Tracy Lou, Paul Matchen
Venue: CHI '05 extended abstracts on Human factors in computing systems (2005)

We examined the efficacy of providing dimensional feedback in the user interface as people construct business rules. Business rules often involve objects that have dimensions (e.g., area, cost, weight) and may entail complex calculations on these objects. Such mathematical expressions are error prone. We designed and tested a novel interface utilizing dimensional analysis to provide advice on expected dimensions, and error feedback on incorrect usage of dimensional objects. Experimental studies were carried out in which subjects used the interface to create rules based on word problems. In a balanced design, rule creation with dimensional feedback was compared to rule creation without such feedback. We found evidence for the usefulness of such feedback. In addition we observed the need to support higher level 'proxy variables' and stepwise definition of complex rules. The findings have implications beyond business rules tools and may be applied to any system requiring mathematical expressions with dimensional objects.
Robust Active Super Tier Systems
Authors: Shlomi Dolev, Ori Gersten
Venue: Proceedings of the IEEE International Conference on Software - Science, Technology & Engineering (2005)

This paper proposes a framework for designing tier systems. First we suggest to implement robust tier automata for each tier ¿_{i} implemented by the processors that the tier consists.The robust tier automata is a useful abstraction that allows the distribution of the tasks of a tier (and its stubs) in a way that ensures availability, consistency, and recovery in the presence of faults. Then we suggest the active tier framework where the computation of a user request is progressing in several paths in the tier system which may intersect, leaving footprints for each other. At last we propose the super tier architecture, which correlates equivalent tiers in order to gain more robustness and load balancing.We present and analyze optimistic, pessimistic and semi-optimistic approaches for computing over the active tier system with super tiers.
On the abstraction of conventional dynamic systems: from numerical analysis to linguistic analysis
Authors: Fei-Yue Wang
Venue: Information Sciences&mdash;Informatics and Computer Science: An International Journal (2005)

Linguistic dynamic systems (LDS) are dynamic processes involving mainly computing with words instead of numbers for modeling and analysis of complex systems and human-machine interfaces. The goal of studying LDS is to establish a methodology of design, modeling, and analysis of complex decision-making processes bridging the machine world in numbers and the human world in words. Specifically in this paper, conventional dynamic systems are converted to different types of LDS for the purpose of verification and comparison. The evolving laws of a type-I LDS are constructed by applying the fuzzy extension principle to those of its conventional counterpart with linguistic states. The evolution of type-I LDS represents the dynamics of state uncertainty derived from the corresponding conventional dynamic process. In addition to linguistic states, the evolving laws of type-II LDS are modeled by a finite number of linguistic decision rules. Analysis of fixed points is conducted based on point-to-fuzzyset mappings and linguistic controllers are designed for goals specified in words for type-II LDS. An efficient numerical procedure called α-cuts mapping is developed and applied to obtain extensive simulation results.
ViteX: A Streaming XPath Processing System
Authors: Yi Chen, Susan B. Davidson, Yifeng Zheng
Venue: Proceedings of the 21st International Conference on Data Engineering (2005)

We present ViteX, an XPath processing system on XML streams with polynomial time complexity. ViteX uses a polynomial-space data structure to encode an exponential number of pattern matches (in the query size) which are required to process queries correctly during a single sequential scan of XML. Then ViteX computes query solutions by probing the data structure in a lazy fashion without enumerating pattern matches.
Personalised Indexing and Retrieval of Heterogeneous Structured Documents
Authors: Gloria Bordogna, Gabriella Pasi
Venue: Information Retrieval (2005)

In this paper the problem of indexing heterogeneous structured documents and of retrieving semi-structured documents is considered. We propose a flexible paradigm for both indexing such documents and formulating user queries specifying soft constraints on both documents' structure and content. At the indexing level we propose a model that achieves flexibility by constructing personalised document representations based on users' views of the documents. This is obtained by allowing users to specify their preferences on the documents' sections that they estimate to bear the most interesting information, as well as to linguistically quantify the number of sections which determine the global potential interest of the documents. At the query language level, a flexible query language for expressing soft selection conditions on both the documents' structure and content is proposed.
On the Counting Process for a Class of Markovian Arrival Processes with an Application to a Queueing System
Authors: Ken'Ichi Kawanishi
Venue: Queueing Systems: Theory and Applications (2005)

In this paper, we consider the counting process for a class of Markovian arrival processes (MAPs). We assume that the representing matrices in such MAPs are expanded in terms of matrix representations of the standard generators in the Lie algebra of the special linear group. The primary purpose of this paper is to construct an explicit solution of the time-dependent distribution and factorial moments of the number of arrival events in (0,t] of the counting process for this class of MAPs. Our construction relies on the Baker--Hausdorff lemma and the specific structure of the representing matrices. To investigate the efficiency of CPU usage with the explicit solution, we have conducted numerical experiments on computing the time-dependent distribution of the counting process through the explicit solution and uniformization-based method. We show that the CPU times required to compute the time-dependent distribution of the number of arrival events in (0,t] through the explicit solution have little sensitivity to t, while the consumption of CPU times with the uniformization-based method becomes greater as t increases. For illustrative purposes, we present a system performance analysis of a queueing system for possible use in automatic call distribution (ACD) systems. As an application of the explicit solution, we use it to express the waiting time distribution of the queueing system. Some numerical examples are also given with comparisons to computer simulations.
Magic land: live 3D human capture mixed reality interactive system
Authors: Tran Cong Thien Qui, Ta Huynh Duy Nguyen, Asitha Mallawaarachchi, Ke Xu, Wei Liu, Shang Ping Lee, Zhi Ying Zhou, Sze Lee Teo, Hui Siang Teo, Le Nam Thang, Yu Li, Adrian David Cheok, Hirokazu Kato
Venue: CHI '05 extended abstracts on Human factors in computing systems (2005)

"Magic Land" is a cross-section of art and technology. It not only demonstrates the latest advances in human-computer interaction and human-human communication: mixed reality, tangible interaction, and 3D-live human capture technology; but also defines new approaches of dealing with live mixed reality content for artists of any discipline. In this system, the user is captured by cameras from many angles and her live 3D avatar is created to be confronted with 3D computer-generated virtual animations. The avatars and virtual objects can interact with each other in a virtual scenery in the mixed reality context; and users can tangibly interact with these characters using their own hands.
Towards an effective software engineering course project
Authors: Zakarya Alzamil
Venue: Proceedings of the 27th international conference on Software engineering (2005)

Software engineering instructors face many challenges. Among these challenges is the course project. Instructors are required to train their students on the professional skills to be ready for the real world business, which requires the students to work on real projects. However, because of the low quality of the students' work, not all of the professional organizations are cooperating to offer a chance for the software engineering students to work on a real project. Therefore, most of the software engineering courses' projects are in-class project, in which the instructors represent the clients. In this paper, I proposed a solution to this problem based on my experience in involving my software engineering students in real world projects.
Conditions for Singular Incidence Matrices
Authors: Willem H. Haemers
Venue: Journal of Algebraic Combinatorics: An International Journal (2005)

Suppose one looks for a square integral matrix N, for which NNT has a prescribed form. Then the Hasse-Minkowski invariants and the determinant of NNT lead to necessary conditions for existence. The Bruck-Ryser-Chowla theorem gives a famous example of such conditions in case N is the incidence matrix of a square block design. This approach fails when N is singular. In this paper it is shown that in some cases conditions can still be obtained if the kernels of N and NT are known, or known to be rationally equivalent. This leads for example to non-existence conditions for self-dual generalised polygons, semi-regular square divisible designs and distance-regular graphs.
On the Use of Wavelet Decomposition for String Classification
Authors: Charu C. Aggarwal, Paul S. Bradley
Venue: Data Mining and Knowledge Discovery (2005)

In recent years, the technological advances in mapping genes have made it increasingly easy to store and use a wide variety of biological data. Such data are usually in the form of very long strings for which it is difficult to determine the most relevant features for a classification task. For example, a typical DNA string may be millions of characters long, and there may be thousands of such strings in a database. In many cases, the classification behavior of the data may be hidden in the compositional behavior of certain segments of the string which cannot be easily determined apriori. Another problem which complicates the classification task is that in some cases the classification behavior is reflected in global be havior of the string, whereas in others it is reflected in local patterns. Given the enormous variation in the behavior of the strings over different data sets, it is useful to develop an approach which is sensitive to both the global and local behavior of the strings for the purpose of classification. For this purpose, we will exploit the multi-resolution property of wavelet decomposition in order to create a scheme which can mine classification characteristics at different levels of granularity. The resulting scheme turns out to be very effective in practice on a wide range of problems.
Features from functional programming for a C++ skeleton library: Research Articles
Authors: H. Kuchen, J. Striegnitz
Venue: Concurrency and Computation: Practice Experience (2005)

Message passing based on libraries such as MPI is typically used to program parallel machines with distributed memory. This is efficient, but error prone. Algorithmic skeletons are intended to simplify parallel programming by increasing expressive power. The idea is to offer typical parallel programming patterns as polymorphic higher-order functions which are efficiently implemented in parallel. The present paper describes how C++ templates and operator overloading can be used in order to provide the main features needed for algorithmic skeletons, namely higher-order functions, partial applications and parametric polymorphism. Experimental results based on a draft implementation of our C++ skeleton library show that higher expressive power can be gained without a significant performance penalty. Copyright &copy; 2005 John Wiley & Sons, Ltd.