ppxscal/embedding_network huggingface dataset:
Reconfigurable architectures for VLSI processing arrays
Authors: Mariagiovanna Sami, Renato Stefanelli
Venue: Proceedings of the May 16-19, 1983, national computer conference (1983)

Definition of architectures capable of fault tolerance and reconfiguration, suitable for very large scale integration (VLSI) implementation, is an important problem with regard to both production yield and run-time availability of VLSI devices. The case considered in the present paper concerns regular arrays of processing elements, such as the ones found in signal processing and other dedicated structures. It is proposed to achieve fault tolerance through the introduction of spare elements and reconfiguration algorithms implemented by suitable dedicated circuits and signals. A number of reconfigurable structures are presented, with different numbers and patterns of spare elements and with varying degrees of fault tolerance. Underlying fault assumptions are discussed and performances are analyzed; while architectures examined in detail consist of combinatorial elements with fairly simple interconnection schemes, extension to a wider class of structures is also considered. Implementation of diagnosis and reconfiguration is carried out at gate level: the resulting complexity is seen to be minor, as compared to the overall architecture complexity.
The complexity of the matroid–greedoid partition problem
Authors: Vera Asodi, Christopher Umans
Venue: Theoretical Computer Science (2009)

We show that the maximum matroid-greedoid partition problem is NP-hard to approximate to within 1/2+&epsilon; for any &epsilon;>0, which matches the trivial factor 1/2 approximation algorithm. The main tool in our hardness of approximation result is an extractor code with polynomial rate, alphabet size and list size, together with an efficient algorithm for list-decoding. We show that the recent extractor construction of Guruswami, Umans and Vadhan [V. Guruswami, C. Umans, S.P. Vadhan, Unbalanced expanders and randomness extractors from Parvaresh-Vardy codes, in: IEEE Conference on Computational Complexity, IEEE Computer Society, 2007, pp. 96-108] can be used to obtain a code with these properties. We also show that the parameterized matroid-greedoid partition problem is fixed-parameter tractable.
Nifty assignments
Authors: Nick Parlante, Thomas P. Murtagh, Mehran Sahami, Owen Astrachan, David Reed, Christopher A. Stone, Brent Heeringa, Karen Reid
Venue: ACM SIGCSE Bulletin (2009)

Assignments determine much of what students actually take away from a course. Sadly, creating successful assignments is difficult and error prone. With that in mind, the Nifty Assignments session is about promoting and sharing successful assignment ideas, and more importantly, making the assignment materials available for others to adopt.
ePet: A Physical Game Based on Wireless Sensor Networks
Authors: Wei-hua Tan, Wen-jun Li, Yao-zhan Zheng, Xiao-cong Zhou
Venue: International Journal of Distributed Sensor Networks (2009)

This paper describes ePet, a novel multi-player physical game based on the WSN (Wireless Sensor Network). ePet shifts the traditional virtual pet games to the real world, featuring with the popular RPG (Role-Playing Game) elements. The game, capitalizing on the wireless communication, mobile computing, and sensing ability, can be played both indoors and outdoors, and thus gives players a new exciting gaming experience that profits by the blend of real and virtual game elements. The physical game acquires physical interactions among players, which can bring exciting and novel features to the game and more importantly, avoids some problems caused by traditional computer games such as health problems. The WSN is a promising technology for developing physical games. Although there is already some research and applications of WSN based physical games, the major advantages of the WSN (e.g. wireless communication, mobile computing, and sensing ability) are not fully cultivated in these gaming applications. ePet, which takes good advantages of both the WSN and traditional computer games, simulates a pet both indoors and outdoors. The pet has two life modes: Peaceful Life Mode (PLM) and Aggressive Life Mode (ALM). In the PLM, ePet simulates the physiological activities of a real pet such as hunger and easily getting flu when it is cold in the real world. Moreover, the pet can date with other pets to increase its physiological values. In the ALM, the pet is a character of an RPG controlled by the player and the pet can have a fight with other pets, from which the pet gains experience for level up. This ALM is similar to the computer RPG games but relatively novel in WSN based games. All of the above features are enabled by the WSN technology. For the two life modes, a friend-making protocol and an RPG battle protocol are designed respectively. The architecture design and implementation of ePet are described in detailed. Unlike traditional WSN based games, ePet does not need a centralized base station to organize the network. To implement a self-adaptive wireless sensor network in which each node has a similar functionality, and solve the network conflict problems in the WSN communications, a multi-hop communication routing protocol is designed for ePet. Furthermore, a PC application was developed as the game interface, from which players can check out the ePet's properties and interact with ePet. It makes ePet more attractive than traditional WSN based games without losing WSN's advantages.
Fast Optical Reconfiguration of a Nine-Context DORGA
Authors: Mao Nakajima, Minoru Watanabe
Venue: Proceedings of the 5th International Workshop on Reconfigurable Computing: Architectures, Tools and Applications (2009)

Demand for fast dynamic reconfiguration has increased since dynamic reconfiguration can accelerate the performance of implementation circuits. Such dynamic reconfiguration requires two important features: fast reconfiguration and numerous contexts. However, fast reconfigurations and numerous contexts share a trade-off relation on current VLSIs. Therefore, optically reconfigurable gate arrays (ORGAs) have been developed to resolve this dilemma. ORGAs can realize a large virtual gate count that is much larger than those of current VLSI chips by exploiting the large storage capacity of a holographic memory. Also, ORGAs can realize fast reconfiguration through use of large bandwidth optical connections between a holographic memory and a programmable gate array VLSI. Among such developments, we have been developing dynamic optically reconfigurable gate arrays (DORGAs) that realize a high gate density VLSI using a photodiode memory architecture. This paper presents the first demonstration of a nine-context DORGA architecture. Furthermore, this paper presents experimental results: 1.2-8.97μs reconfiguration times and 66-221μs retention times.
Execution of semantic services in enterprise application integration
Authors: Peter Martinek, Balazs Tothfalussy, Bela Szikora
Venue: Proceedings of the 12th WSEAS international conference on Computers (2008)

In this paper, we present an approach for the execution of semantically enriched services in Enterprise Application Integration (EAI). After the brief overview of current researches and literature the basic definitions and concepts are revealed. Our integration platform is based on a typical Service Oriented Architecture (SOA) solution, which consists of a service registry, a process designer and a run-time engine. Furthermore there are some additional components for realizing semantic enrichment e.g. the semantic profiler and the Ontology. The focus of the paper is the preparation for the process run-time. We propose a mediator based approach where two data transformations are assigned to each service during a so called annotation process. The standard services of ERP, CRM, SCM etc. systems are encapsulated into these mediator services which makes possible to apply them in our semantic integration framework. Furthermore our method enables that our semantically composed processes and their services remain executable on current process run-time standards.
CRM to improve the avoidance tendency in science and engineering college in Korea
Authors: So Young Sohn, In Sang Chang
Venue: Expert Systems with Applications: An International Journal (2009)

For the continuous development in science and engineering, strategic manpower planning is essential. Korea, like many other countries, has been experiencing difficulty in recruiting and retaining a good quality of manpower in the fields of science and engineering. Success in recruiting science and engineering students can be related to multiple factors such as governmental policy, social culture, educational environment, and financial incentives. In this paper, we use a structural equation model (SEM) to analyze the effects of these factors on increasing the science and engineering population. The proposed SEM is fitted based on a partial least square (PLS) estimation. Also, we assess the satisfaction index with respect to gender, age, and major of scientists and engineers. Our study indicated that exemption from compulsory military service may not work but support for a better financial environment for science and engineering students appears to be the best long-term goal.
Subsampling tests for the mean change point with heavy-tailed innovations
Authors: Hao Jin, Zheng Tian, Ruibing Qin
Venue: Mathematics and Computers in Simulation (2009)

The quest of the mean change point with innovations in the domain of attraction of a &kappa;-stable law appears to still be ongoing. We adopt the residual CUSUM of squares test (RCUSQ) and derive its null asymptotic distribution, which is dependent on stable index &kappa;. Then a residual-based subsampling is proposed to approximate the null distribution when stable index &kappa; is unknown. Consistency and the rate of convergence for the estimated change point are also obtained. We establish the asymptotic validity of this method and assess its performance both theoretically and numerically.
Enumeration aspects of maximal cliques and bicliques
Authors: Alain Gély, Lhouari Nourine, Bachir Sadi
Venue: Discrete Applied Mathematics (2009)

We present a general framework to study enumeration algorithms for maximal cliques and maximal bicliques of a graph. Given a graph G, we introduce the notion of the transition graph T(G) whose vertices are maximal cliques of G and arcs are transitions between cliques. We show that T(G) is a strongly connected graph and characterize a rooted cover tree of T(G) which appears implicitly in [D.S. Johnson, M. Yannakakis, C.H. Papadimitriou, On generating all maximal independent sets, Information Processing Letters 27 (1988) 119-123; S. Tsukiyama, M. Ide, M. Aiyoshi, I. Shirawaka, A new algorithm for generating all the independent sets, SIAM Journal on Computing 6 (1977) 505-517]. When G is a bipartite graph, we show that the Galois lattice of G is a partial graph of T(G) and we deduce that algorithms based on the Galois lattice are a particular search of T(G). Moreover, we show that algorithms in [G. Alexe, S. Alexe, Y. Crama, S. Foldes, P.L. Hammer, B. Simeone, Consensus algorithms for the generation of all maximal bicliques, Discrete Applied Mathematics 145 (1) (2004) 11-21; L. Nourine, O. Raynaud, A fast algorithm for building lattices, Information Processing Letters 71 (1999) 199-204] generate maximal bicliques of a bipartite graph in O(n^2) per maximal biclique, where n is the number of vertices in G. Finally, we show that under some specific numbering, the transition graph T(G) has a hamiltonian path for chordal and comparability graphs.
A generalized parallel algorithm for frequent itemset mining
Authors: Mitica Craus, Alexandru Archip
Venue: Proceedings of the 12th WSEAS international conference on Computers (2008)

A parallel algorithm for finding the frequent itemsets in a set of transactions is presented. The frequent individual items are identified by their index. We assume that processors number (m) is less than the frequent items number (n). At the first stage, every processor Pi, i isin; {1, ...,m - 1} sequentially computes the frequent itemsets from the interval Ii = [(i - 1) cdot; p + 1, i cdot; p], where p = lfloor;n/mrfloor;. The processor Pm computes frequent itemsets from the interval Im = [(m - 1) cdot; p + 1, n]. In the second stage, the parallel algorithm is applied. The processor Pi computes, step by step, the sets FIi,Ij of the frequent itemsets with individual items from the intervals Ii,j = Ii∪Ii+1∪...∪Ij, j = i+1,...,m. In order to compute the set FIi,Ij, the processor Pi uses FIi,Ij-1 obtained in the previous step and FIi+1,Ij received from the processor Pi+1. The main advantage of our parallel algorithm is that it uses a communication pattern known before algorithm start, which permits to map the communication to hardware. Another major advantage is that the set of the transactions can be distributed to processors before the beginning of the algorithm. This is possible because a processor Pi has to compute FIi,Ij, j = i + 1, ..., m and therefore only the transactions containing the frequent items starting with Ii are needed.
Learning weighted linguistic rules to control an autonomous robot
Authors: M. Mucientes, R. Alcalá, J. Alcalá-Fdez, J. Casillas
Venue: International Journal of Intelligent Systems (2009)

A methodology for learning behaviors in mobile robotics has been developed. It consists of a technique to automatically generate input&ndash;output data plus a genetic fuzzy system that obtains cooperative weighted rules. The advantages of our methodology over other approaches are that the designer has to choose the values of only a few parameters, the obtained controllers are general (the quality of the controller does not depend on the environment), and the learning process takes place in simulation, but the controllers work also on the real robot with good performance. The methodology has been used to learn the wall-following behavior, and the obtained controller has been tested using a Nomad 200 robot in both simulated and real environments. &copy; 2009 Wiley Periodicals, Inc.
Latent Semantic Analysis --- The Dynamics of Semantics Web Services Discovery
Authors: Chen Wu, Vidyasagar Potdar, Elizabeth Chang
Venue: Advances in Web Semantics I: Ontologies, Web Services and Applied Semantic Web (2008)

Semantic Web Services (SWS) have currently drawn much momentum in both academia and industry. Most of the solutions and specifications for SWS rely on ontology building, a task needs much human (e.g. domain experts) involvement, and hence cannot scale very well in face of vast amount of web information and myriad of services providers. The recent proliferation of SOA applications exacerbates this issue by allowing loosely-coupled services to dynamically collaborate with each other, each of which might maintain a different set of ontology. This chapter presents the fundamental mechanism of Latent Semantic Analysis (LSA), an extended vector space model for Information Retrieval (IR), and its application in semantic web services discovery, selection, and aggregation for digital ecosystems. First, we explore the nature of current semantic web services within the principle of ubiquity and simplicity. This is followed by a succinct literature overview of current approaches for semantic services/software component (e.g. ontology-based OWL-s) discovery and the motivation for introducing LSA into the user-driven scenarios for service discovery and aggregation. We then direct the readers to the mathematical foundation of LSA - SVD of data matrices for calculating statistics distribution and thus capturing the `hidden' semantics of web services concepts. Some existing applications of LSA in various research fields are briefly presented, which gives rise to the analysis of the uniqueness (i.e. strength, limitations, parameter settings) of LSA application in semantic web services. We provide a conceptual level solution with a proof-of-concept prototype to address such uniqueness. Finally we propose an LSA-enabled semantic web services architecture fostering service discovery, selection, and aggregation in a digital ecosystem.
Multiview trajectory mapping using homography with lens distortion correction
Authors: Gabin Kayumbi, Andrea Cavallaro
Venue: Journal on Image and Video Processing (2008)

We present a trajectory mapping algorithm for a distributed camera setting that is based on statistical homography estimation accounting for the distortion introduced by camera lenses. Unlike traditional approaches based on the direct linear transformation (DLT) algorithm and singular value decomposition (SVD), the planar homography estimation is derived from renormalization. In addition to this, the algorithm explicitly introduces a correction parameter to account for the nonlinear radial lens distortion, thus improving the accuracy of the transformation. We demonstrate the proposed algorithm by generating mosaics of the observed scenes and by registering the spatial locations of moving objects (trajectories) from multiple cameras on the mosaics. Moreover, we objectively compare the transformed trajectories with those obtained by SVD and least mean square (LMS) methods on standard datasets and demonstrate the advantages of the renormalization and the lens distortion correction.
Extended MPEG Video Format for Efficient Dynamic Voltage Scaling
Authors: Kwanhu Bang, Sung-Yong Bang, Eui-Young Chung
Venue: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (2008)

We present an extended MPEG video format for efficient Dynamic Voltage Scaling (DVS). DVS technique has been widely researched, but the execution time variation of a periodic task (i.e. MPEG decoding) is still a challenge to be tackled. Unlike previous works, we focus on the data (video stream) rather than the execution code to overcome such limitation. The proposed video format provides the decoding costs of frames to help the precise prediction of their execution times at client machines. The experimental results show that the extended format only increases the data size less than 1% by adding about 10 bits representing the decoding cost of each frame. Also, a DVS technique adjusted for the proposed format achieves 90% of efficiency compared to the oracle case, while keeping the run time overhead of the technique negligible.
Development of laser communication terminal for OICETS
Authors: Y. Koyama, K. Shiratama
Venue: Space Communications (1998)

Engineering Model of LUCE (Laser Utilizing Communications Equipment) is now under production in the frame of OICETS (Optical Inter-Orbit Communications Engineering Satellite) NASDA program. Many devices and components to realize required functions of LUCE have been developed and characterized. This paper describes the design and measured performances of devices and components for LUCE EM and Optical Antenna STM.
Dynamically Adapted Low Power ASIPs
Authors: Mateus B. Rutzig, Antonio Carlos Beck, Luigi Carro
Venue: Proceedings of the 5th International Workshop on Reconfigurable Computing: Architectures, Tools and Applications (2009)

New generations of embedded devices, following the trend found in personal computers, are becoming computationally powerful. A current embedded scenario presents a large amount of complex and heterogeneous functionalities, which have been forcing designers to create novel solutions to increase the performance of embedded processors while, at the same time, maintain power dissipation as low as possible. Former embedded devices could have been designed to execute a defined application set. Nowadays, in the new generation of these devices, some applications are unknown at design time. For example, in portable phones, the client is able to download new applications during the product lifetime. Hence, traditional designs can fail to deliver the required performance while executing an application behavior that has not been previously defined. On the other hand, reconfigurable architectures appear to be a possible solution to increase the processor performance, but their employment in embedded devices faces two main design constraints: power and area. In this work, we propose an ASIP reconfigurable development flow that aggregates design area optimization and a run-time technique that reduces energy consumption. The coupling of both methods builds an area optimized reconfigurable architecture to provide a high-performance and energy-efficient execution of a defined application set. Moreover, thanks to the adaptability provided by the reconfigurable ASIP approach, the execution of new application not foreseen at design time still shows high speedups rates with low energy consumption.
Upper and Lower Grey-Level Adaptive Morphological Operators
Authors: Corinne Vachier
Venue: Proceedings of the 2009 Seventh International Conference on Advances in Pattern Recognition (2009)

Morphological operators designed for grey-scale functions process every points of the space identically whatever their luminance. In many situations however, it is interesting to modulate the amount of processing according to the local grey-level. This leads to the idea of intensity-adaptive morphological operators. A simple way to construct such operators is to threshold the function at every grey-value, then to apply set operators to the level sets obtained in this way, and finally to reconstruct a new transformed function from the transformed level sets. The reconstruction's step is not straightforward since the transformed level sets are not obligatorily nested. Two schemes of stacking reinvestigated in the present paper that lead to two kinds of intensity-adaptive operators: the upper and lower adaptive operators. Those operators are complementary in the sense that, by coupling, one defines adjunctions and consequently, by composition, one defines intensity-adaptive morphological openings and closings. The theoretical study of grey-level adaptive morphological operators is supplemented of some examples that illustrate the potential of the investigated operators in image filtering applications.
Elaboration and characterization of Co-doped ZnO thin films deposited by spray pyrolysis technique
Authors: Y. Belghazi, M. Ait Aouaj, M. El Yadari, G. Schmerber, C. Ulhaq-Bouillet, C. Leuvrey, S. Colis, M. Abd-lefdil, A. Berrada, A. Dinia
Venue: Microelectronics Journal (2009)

The structure and the nature of magnetism of ZnO and Zn"1"-"xCo"xO (CZO) thin films (0=
A robust object category detection system using deformable shapes
Authors: Robert Smith, Binh Pham
Venue: Machine Vision and Applications (2009)

An object can often be uniquely identified by its shape, which is usually fairly invariant. However, when the search is for a type of object or an object category, there can be variations in object deformation (i.e. variations in body shapes) and articulation (i.e. joint movement by limbs) that complicate their detection. We present a system that can account for this articulation variation to improve the robustness of its object detection by using deformable shapes as its main search criteria. However, existing search techniques based on deformable shapes suffer from slow search times and poor best matches when images are cluttered and the search is not initialised. To overcome these drawbacks, our object detection system uses flexible shape templates that are augmented by salient object features and user-defined heuristics. Our approach reduces computation time by prioritising the search around these salient features and uses the template heuristics to find truer positive matches.