ppxscal/embedding_network huggingface dataset:
Painterly animation using motion maps
Authors: Youngsup Park, Kyunghyun Yoon
Venue: Graphical Models (2008)

Starting from an input video, we replicate the manual technique of paint-on-glass animation. Motion maps are used to represent the regions where changes occur between frames. Edges are the key to identifying frame-to-frame changes, and a strong motion map is constructed from the edges in each frame, displaced by the motion vector. A second, weak motion map records the other pixels where there is significant movement between frames. These maps are used to generate the brush strokes necessary to convert one 'painted' frame into the next. Local gradient interpolation, based robustly on the edges, is used to determine the orientation of the brush strokes, and we avoid holes in the image by making additional strokes with smaller brushes. We also employ MSE data in evaluating temporal coherence between frames.
The Future IS Organization in a Flat World
Authors: Anthony B. Gerth, Steve Rothman
Venue: Information Systems Management (2007)

The business world is becoming increasingly "flat" with regard to access to global markets and a global workforce. New operational priorities are emerging that require new IS capabilities. The linkage between these operational shifts and the changes required by an IS organization to develop new IS capabilities for a flattening world are identified and discussed.
An approach of cluster validity on Gabor wavelet based adaptive face recognition
Authors: Rezaul Bashar, Pankaj Raj Dawadi, Eun Sung Jung, Phill Kyu Rhee
Venue: International Journal of Knowledge-based and Intelligent Engineering Systems (2007)

Though research on face recognition has been carried out for a decade, it has in trouble with different situations i.e. facial expression, view point, illumination conditions, noise, etc. To solve this problem, we propose to define situation specific actions for face recognition in this paper. The proposed system partitions face images into several image contexts (groups) based on cluster validity, and takes adaptation to individual partitioned groups. As there is no formal way to select whether the clustering algorithm is suitable or not, we propose a new adaptive cluster validity approach in comparison with Dunn's cluster validity measurement. After selecting proper image context, we train using genetic algorithm to individual feature elements generated by Gabor wavelet of a face image to produce weights. In Gabor wavelet based face recognition, we apply weights to individual elements of facial feature, and those weights are trained by Genetic algorithm. These weights are applied for classifying face images during face recognition time. We applied this concept to face recognition field in different situations and we achieved encouraging results in comparison with Dunn's measuring.
A comparative evaluation of different link types on enhancing document clustering
Authors: Xiaodan Zhang, Xiaohua Hu, Xiaohua Zhou
Venue: Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval (2008)

With a growing number of works utilizing link information in enhancing document clustering, it becomes necessary to make a comparative evaluation of the impacts of different link types on document clustering. Various types of links between text documents, including explicit links such as citation links and hyperlinks, implicit links such as co-authorship links, and pseudo links such as content similarity links, convey topic similarity or topic transferring patterns, which is very useful for document clustering. In this study, we adopt a Relaxation Labeling (RL)-based clustering algorithm, which employs both content and linkage information, to evaluate the effectiveness of the aforementioned types of links for document clustering on eight datasets. The experimental results show that linkage is quite effective in improving content-based document clustering. Furthermore, a series of interesting findings regarding the impacts of different link types on document clustering are discovered through our experiments.
Moving the OS to the Web
Authors: George Lawton
Venue: Computer (2008)

The proliferation of users and applications distributed over the Web, including those at scattered corporate sites, has made Web-based operating systems more interesting, relevant, and, vendors hope, commercially viable.
MAVIS: A multi-level algorithm visualization system within a collaborative distance learning environment
Authors: Igal Koifman, Ilan Shimshoni, Ayellet Tal
Venue: Journal of Visual Languages and Computing (2008)

This paper presents a new model for an algorithm visualization system. Our model views the visualization system as an integral part of a broader distance learning environment. As such, it supports the heterogeneity of the Internet the visualization is expected to run on and the diversity of the expected users. It does so by defining several ways for handling multi-level visualizations. First, a visualization can run in various abstraction levels of the algorithm, depending on the familiarity of the students with the studied materials. Second, a visualization can use various levels of graphics, depending on the capabilities of the client machines. Third, the messages sent between the machines can be of various levels, depending on the communication loads. Another important aspect of a distance learning environment is collaboration and data sharing. Our model facilitates the collaboration between the students and the instructor and between the students themselves. Finally, this paper presents a system, MAVIS, that realizes the model, and demonstrates its use on several algorithms.
Articulatory inversion of spanish speech signals by means of machine learning techniques
Authors: José Brito, Wladimir Rodríguez
Venue: Proceedings of the 5th WSEAS International Conference on Circuits, Systems, Electronics, Control & Signal Processing (2006)

The speech inverse problem focuses on retrieving the best articulatory vectors for the task of synthesizing a target voice signal. In this research the problem is approached from a neuromotor level, and by means of some machine learning techniques. Specifically, speech articulators are represented on the midsagittal plane, and controlled by muscular activations grouped in the articulatory vector. The movement of the tongue, by effect of muscular contraction, is derived from a TSK Fuzzy Inference System. On its side, an Echo State Network is used to model the glottal airflow. Later, Continuous Genetic Algorithms evolve populations of articulatory configurations in order to approximate acoustic features of target spanish vowels, and of consonants /m/,/n/,/f/ and/s/. The recovered midsagittal configurations along with subjective tests performed by a group of evaluators, positively verify the effectiveness of these techniques.
A language for high-level description of adaptive web systems
Authors: S. Hossein Sadat-Mohtasham, Ali A. Ghorbani
Venue: Journal of Systems and Software (2008)

Adaptive Web systems (AWS) are Web-based systems that can adapt their features such as, presentation, content, and structure, based on users' behaviour and preferences, device capabilities, and environment attributes. A framework was developed in our research group to provide the necessary components and protocols for the development of adaptive Web systems; however, there were several issues and shortcomings (e.g. low productivity, lack of verification mechanisms, etc.) in using the framework that inspired the development of a domain-specific language for the framework. This paper focuses on the proposal, design, and implementation of AWL, the Adaptive Web Language, which is used to develop adaptive Web systems within our framework. Not only does AWL address the existing issues in the framework, but it also offers mechanisms to increase software quality attributes, especially, reusability. An example application named PENS (a personalized e-News system) is explained and implemented in AWL. AWL has been designed based on the analysis of the adaptive Web domain, having taken into account the principles of reuse-based software engineering (product-lines), domain-specific languages, and aspect-oriented programming. Specially, a novel design decision, inspired by aspect-oriented programming paradigm, allows separate specification of presentation features in an application from its adaptation features. The AWL's design decisions and their benefits are explained.
The dspace repository: can multiple institutions live in one space? a different approach
Authors: Christina Richison
Venue: Proceedings of the 8th ACM/IEEE-CS joint conference on Digital libraries (2008)

In late 2006, NITLE launched a pilot program for managed institutional repository services designed for smaller colleges and universities and the non-profit organizations that serve them. Twenty-six participating institutions helped pioneer this pilot effort, which laid the foundation for the development of production-level DSpace Services. These DSpace Services allowed campuses to start and grow their digital repositories with a minimal level of investment, with no hardware to purchase and very little application support expertise to develop. Campuses were able to focus on the work of building digital repositories within the context of a community of campuses sharing ideas and best practices. Lessons learned and next steps will be discussed.
Robust control methodologies for dc/dc PWM converters under wide changes in operating conditions
Authors: Mohammadreza Rafiei, Reza Ghazi, Radjab Asgharian, Hamid A. Toliyat, Masoud Barakati
Venue: Proceedings of the 6th WSEAS International Conference on Systems Theory & Scientific Computation (2006)

In this paper, a comparative study on the subject of robust control of dc/dc PWM converters is presented. Considering a wide range of possible changes for the converter's operating conditions, robust control of dc/dc PWM converters using some state of the art robust controllers i.e., H∞, µ, and fuzzy controllers is studied. The system under study is a CUK converter as a non-linear, variable structure, and non-minimum phase plant with complex and potentially chaotic behavior. The results confirm successful performance of the H∞ and µ controllers in providing wonderful robustness to even wide changes in the operating point. The results also prove that in compare with the H∞, the µ controller can by far provide superior results. As will be shown, while the results are quit interesting, the ability of such linear controllers is restricted to the situations where a linear model for the under study system is considered. They may fall down to control the exact physical system, especially where the large signal behavior of the converter is studied. To overcome the aforementioned issues, a simple robust fuzzy controller accompanied with a non-linear / time varying feed-forward controller is proposed. The results clearly prove the relative superiority of fuzzy controller design framework, which lead to a non-linear controller, to overcome the stability issues of the complex dc/dc converters.
An Efficient Time-Bound Hierarchical Key Management Scheme for Secure Broadcasting
Authors: Elisa Bertino, Ning Shang, Samuel S. Wagstaff Jr.
Venue: IEEE Transactions on Dependable and Secure Computing (2008)

In electronic subscription and pay TV systems, data can be organized and encrypted using symmetric key algorithms according to predefined time periods and user privileges, then broadcast to users. This requires an efficient way to manage the encryption keys. In this scenario, time-bound key management schemes for a hierarchy were proposed by Tzeng and Chien in 2002 and 2005, respectively. Both schemes are insecure against collusion attacks. In this paper, we propose a new key assignment scheme for access control which is both efficient and secure. Elliptic curve cryptography is deployed in this scheme. We also provide analysis of the scheme with respect to security and efficiency issues.
Dynamic behavior of the tuning fork AFM probe
Authors: Dara Bayat, Terunobu Akiyama, Nicolaas F. de Rooij, Urs Staufer
Venue: Microelectronic Engineering (2008)

We recently introduced a new self-actuating and self-sensing atomic force microscope (AFM) probe based on a quartz tuning fork and a micro-fabricated cantilever. This system has two degrees of freedom, associated with its two components. We developed a model for describing how the sample-tip interaction is transduced to the tuning fork. It is based on two coupled spring-mass systems. In a first step, the coupling between the tuning fork and the cantilever was investigated to reveal the influential factors. The analysis of these factors enabled us to deduce their effect on the whole system and to optimize the sensitivity of this novel probe. The theoretical analysis was compared with experimental results and it was found that the model appropriately describes the probe in a qualitative manner while further refinement will be needed for achieving a correct quantitative description.
Accelerating Clock Mesh Simulation Using Matrix-Level Macromodels and Dynamic Time Step Rounding
Authors: Xiaoji Ye, Min Zhao, Rajendran Panda, Peng Li, Jiang Hu
Venue: Proceedings of the 9th international symposium on Quality Electronic Design (2008)

Clock meshes have found increasingly wide applications in today's high-performance IC designs. The inherent routing redundancies associated with clock meshes lead to improved clock skews and reliability. However, the high complexity of clock meshes in modern chip designs has made its verification very challenging. A typical clock distribution network may consist of millions of coupled/interconnected linear elements and hundreds of nonlinear clock drivers attached at different locations on the mesh. Such a large network is often too complex for feasible SPICE-like simulation. In this paper, we present a new simulation methodology which decomposes a clock mesh into linear and nonlinear parts. By exploiting the special matrix property of the linear subsystem resulting from modified nodal analysis (MNA) formulation, the linear subsystem is represented as a matrix-level macro model,which greatly simplifies the overall simulation task. These macromodels can be efficiently computed using Cholesky factorization and significantly speedup the nonlinear Newton-Raphson iterations used inthe transient simulation for the complete clock mesh. Furthermore, a dynamic time step rounding technique is proposed to limit the number of passive macromodels needed in the entire transient simulation which further improves the efficiency of the proposed approach.
Inducing multiscale clustering using multistage MAC contention in CDMA ad hoc networks
Authors: Xiangying Yang, Gustavo de Veciana
Venue: IEEE/ACM Transactions on Networking (TON) (2007)

This paper proposes a new principle for designing MAC protocols for CDMA-based ad hoc networks-inducing spatial clustering in contending transmitters/receivers. We first highlight the advantages of CDMA in handling quality of service (QoS) requirements, enhancing energy efficiency, and enabling spatial multiplexing of bursty traffic. Then, based on stochastic geometric models and simulation, we show how idealized contention resolution among randomly distributed nodes results in clustering of successful transmitters and receivers, in turn leading to efficient spatial reuse. This motivates the central idea of the paper which is to explicitly induce clustering among contending nodes to achieve even better spatial reuse. We propose two distributed mechanisms to realize such clustering and show substantial capacity gains over simple random access/ALOHA-like and even RTS/CTS-based protocols. We examine under what regimes such gains can be achieved, and how clustering and contention resolution mechanisms should be optimized to do so. We propose the design of ad hoc networks supporting hop-by-hop relaying on different spatial scales. By allowing nodes to relay beyond the set of nearest neighbors using varying transmission distances (scales), one can reduce the number of hops between a source and destination so as to meet end-to-end delay requirements. To that end we propose a multi-scale MAC clustering and power control mechanism to support transmissions with different ranges while achieving high spatial reuse. The considerations, analysis and simulations included in this paper suggest that the principle of inducing spatial clustering in contention has substantial promise towards achieving high spatial reuse, QoS, and energy efficiency in CDMA ad hoc networks.
Accurate method for including solid-fluid boundary interactions in mesoscopic model fluids
Authors: A. Berkenbos, C. P. Lowe
Venue: Journal of Computational Physics (2008)

Particle models are attractive methods for simulating the dynamics of complex mesoscopic fluids. Many practical applications of this methodology involve flow through a solid geometry. As the system is modeled using particles whose positions move continuously in space, one might expect that implementing the correct stick boundary condition exactly at the solid-fluid interface is straightforward. After all, unlike discrete methods there is no mapping onto a grid to contend with. In this article we describe a method that, for axisymmetric flows, imposes both the no-slip condition and continuity of stress at the interface. We show that the new method then accurately reproduces correct hydrodynamic behavior right up to the location of the interface. As such, computed flow profiles are correct even using a relatively small number of particles to model the fluid.
On the Complexity of Convex Hulls of Subsets of the Two-Dimensional Plane
Authors: Ker-I Ko, Fuxiang Yu
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2008)

We investigate the computational complexity of computing the convex hull of a two-dimensional set. We study this problem in the polynomial-time complexity theory of real functions based on the oracle Turing machine model. We show that the convex hull of a two-dimensional Jordan domain S is not necessarily recursively recognizable even if S is polynomial-time recognizable. On the other hand, if the boundary of a Jordan domain S is polynomial-time computable, then the convex hull of S must be NP-recognizable, and it is not necessarily polynomial-time recognizable if P
A Decentralized and Cooperative Workflow Scheduling Algorithm
Authors: Rajiv Ranjan, Mustafizur Rahman, Rajkumar Buyya
Venue: Proceedings of the 2008 Eighth IEEE International Symposium on Cluster Computing and the Grid (2008)

In the current approaches to workflow scheduling,there is no cooperation between the distributed workflow brokers and as a result, the problem of conflicting schedules occur. To overcome this problem, in this paper, we propose a decentralized and cooperative workflow scheduling algorithm. The proposed approach utilizes a Peer-to-Peer (P2P) coordination space with respect to coordinating the application schedules among the Grid wide distributed workflow brokers. The proposed algorithm is completely decentralized in the sense that there is no central point of contact in the system, the responsibility of the key functionalities such as resource discovery and scheduling coordination are delegated to the P2P coordination space. With the implementation of our approach, not only the performance bottlenecks are likely to be eliminated but also efficient scheduling with enhanced scalability and better autonomy for the users are likely to be achieved. We prove the feasibility of our approach through an extensive trace driven simulation study.
Polymer geometry and Li+ conduction in poly(ethylene oxide)
Authors: L. Gitelman, M. Israeli, A. Averbuch, M. Nathan, Z. Schuss, D. Golodnitsky
Venue: Journal of Computational Physics (2008)

We study the effect of molecular shape on Li^+ conduction in dilute and concentrated polymer electrolytes (LiI:P(EO)"n(3=
Solutions for Supporting Composition of Service-Based Real-Time Applications
Authors: Iria Estévez-Ayres, Marisol García-Valls, Luís Almeida, Pablo Basanta-Val
Venue: Proceedings of the 2008 11th IEEE Symposium on Object Oriented Real-Time Distributed Computing (2008)

Recently, the application domains where the development of systems with temporal guarantees is needed have increased. The majority of such domains are dynamic environments where the classical design approach is no longer applicable since it is too pessimistic. Thus, new challenges arise to adapt the current methodologies used in different architectural levels to these new environments. New directions and paradigms are needed to allow combining functional flexibility and dynamism with temporal predictability. The current work addresses these new challenges through the exploration of the applicability of concepts from the service oriented paradigm to distributed real-time systems. We propose a concrete system model based on a holistic time-triggered-based approach for design and configuration. Based on this model, we analyse the architectural entities required for two different architectural design approaches: static, when no reconfigurations at run-time are admitted, and dynamic, when these reconfigurations are possible. An exhaustive composition algorithm is also proposed.
Supply chain simulator: A scenario-based educational tool to enhance student learning
Authors: Atiq Siddiqui, Mehmood Khan, Sohail Akhtar
Venue: Computers Education (2008)

Simulation-based educational products are excellent set of illustrative tools that proffer features like visualization of the dynamic behavior of a real system, etc. Such products have great efficacy in education and are known to be one of the first-rate student centered learning methodologies. These products allow students to practice skills such as critical thinking and decision-making. In this paper, a case is presented where a scenario-based e-learning product namely 'supply chain simulator' is developed at KFUPM for an introductory technology course. The product simulates a supply chain - a network of facilities and distribution systems that carries out the task of procurement and transformation of materials from manufacturer to customer. The product was put to test during four semesters and results of the survey conducted by the instructors and the students are presented. The results clearly suggest the benefits of using such a tool in enhancing student learning.
Considering users and their opinions in knowledge management systems
Authors: Katharina Probst, Kelly Dempski
Venue: Proceedings of the 8th ACM/IEEE-CS joint conference on Digital libraries (2008)

We describe a Knowledge Management System that shifts the focus from the traditional document-centric to a user-centric view. It takes into account users' query and download behavior, opinions, reputations, and social connections.
The application of hidden Markov models in speech recognition
Authors: Mark Gales, Steve Young
Venue: Foundations and Trends in Signal Processing (2008)

Hidden Markov Models (HMMs) provide a simple and effective framework for modelling time-varying spectral vector sequences. As a consequence, almost all present day large vocabulary continuous speech recognition (LVCSR) systems are based on HMMs. Whereas the basic principles underlying HMM-based LVCSR are rather straightforward, the approximations and simplifying assumptions involved in a direct implementation of these principles would result in a system which has poor accuracy and unacceptable sensitivity to changes in operating environment. Thus, the practical application of HMMs in modern systems involves considerable sophistication. The aim of this review is first to present the core architecture of a HMM-based LVCSR system and then describe the various refinements which are needed to achieve state-of-the-art performance. These refinements include feature projection, improved covariance modelling, discriminative parameter estimation, adaptation and normalisation, noise compensation and multi-pass system combination. The review concludes with a case study of LVCSR for Broadcast News and Conversation transcription in order to illustrate the techniques described.