ppxscal/embedding_network huggingface dataset:
Enumeration of Perfect Sequences of Chordal Graph
Authors: Yasuko Matsui, Ryuhei Uehara, Takeaki Uno
Venue: Proceedings of the 19th International Symposium on Algorithms and Computation (2008)

A graph is chordal if and only if it has no chordless cycle of length more than three. The set of maximal cliques in a chordal graph admits special tree structures called clique trees. A perfect sequence is a sequence of maximal cliques obtained by using the reverse order of repeatedly removing the leaves of a clique tree. This paper addresses the problem of enumerating all the perfect sequences. Although this problem has statistical applications, no efficient algorithm has been proposed. There are two difficulties with developing this type of algorithms. First, a chordal graph does not generally have a unique clique tree. Second, a perfect sequence can normally be generated by two or more distinct clique trees. Thus it is hard using a straightforward way to generate perfect sequences from each possible clique tree. In this paper, we propose a method to enumerate perfect sequences without constructing clique trees. As a result, we have developed the first polynomial delay algorithm for dealing with this problem. In particular, the time complexity of the algorithm on average is O(1) for each perfect sequence.
Design of a Measurement System of End-User Information Competency and Its Applications
Authors: Chui Young Yoon
Venue: Computer Supported Cooperative Work in Design IV: 11th International Conference, CSCWD 2007, Melbourne, Australia, April 26-28, 2007. Revised Selected Papers (2008)

This paper develops a measurement system that can efficiently gauge an end-user information competency in an information environment. The validity and reliability of the developed tool construct was verified by factor analysis and reliability analysis through a pilot test. The application and utilization of the measurement system designed with a developed tool was confirmed by applying it to measurement of the information competency of end-users in an enterprise and presenting their measurement results.
The Organization of a Neurocomputational Control Model for Articulatory Speech Synthesis
Authors: Bernd J. Kröger, Anja Lowit, Ralph Schnitker
Venue: Verbal and Nonverbal Features of Human-Human and Human-Machine Interaction: COST Action 2102 International Conference, Patras, Greece, October 29-31, 2007. Revised Papers (2008)

The organization of a computational control model of articulatory speech synthesis is outlined in this paper. The model is based on general principles of neurophysiology and cognitive psychology. Thus it is based on such neural control circuits, neural maps and mappings as are hypothesized to exist in the human brain, and the model is based on learning or training mechanisms similar to those occurring during the human process of speech acquisition. The task of the control module is to generate articulatory data for controlling an articulatory-acoustic speech synthesizer. Thus a com plete "BIONIC" (i.e. BIOlogically motivated and techNICally realized) speech syn the sizer is described, capable of generating linguistic, sensory, and motor neural representations of sounds, syllables, and words, capable of generating articu latory speech movements from neuromuscular activation, and subse quently capable of generating acoustic speech signals by controlling an articu latory-acoustic vocal tract model. The module developed thus far is capable of producing single sounds (vowels and consonants), simple CV- and VC-syllables, and first sample words. In addition, processes of human-human interaction occurring during speech acquisition (mother-child or carer-child interactions) are briefly discussed in this paper.
Attacking 44 Rounds of the SHACAL-2 Block Cipher Using Related-Key Rectangle Cryptanalysis
Authors: Jiqiang Lu, Jongsung Kim
Venue: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (2008)

SHACAL-2 is a 64-round block cipher with a 256-bit block size and a variable length key of up to 512 bits. It is a NESSIE selected block cipher algorithm. In this paper, we observe that, when checking whether a candidate quartet is useful in a (related-key) rectangle attack, we can check the two pairs from the quartet one after the other, instead of checking them simultaneously; if the first pair does not meet the expected conditions, we can discard the quartet immediately. We next exploit a 35-round related-key rectangle distinguisher with probability 2-460 for the first 35 rounds of SHACAL-2, which is built on an existing 24-round related-key differential and a new 10-round differential. Finally, taking advantage of the above observation, we use the distinguisher to mount a related-key rectangle attack on the first 44 rounds of SHACAL-2. The attack requires 2233 related-key chosen plaintexts, and has a time complexity of 2497.2 computations. This is better than any previously published cryptanalytic results on SHACAL-2 in terms of the numbers of attacked rounds.
Balancing Population- and Individual-Level Adaptation in Changing Environments
Authors: Ingo Paenke, Yaochu Jin, Jürgen Branke
Venue: Adaptive Behavior - Animals, Animats, Software Agents, Robots, Adaptive Systems (2009)

This article examines the interdependency of population-level adaptation (evolution) and individual-level adaptation (learning). More specifically, we assume a trade-off between the two means of adaptation, that is, a higher individual-level adaptation can only be achieved with a reduced population level adaptation and vice versa. This trade-off is apparent in computational evolutionary systems, and there is also evidence that it exists in nature. As we show, despite this considered trade-off, there exist environments in which a combined adaptation scheme is optimal. Furthermore, we demonstrate that the optimal adaptive behavior produced by a particular distribution of population- and individual-level adaptation depends on the environmental dynamics. Finally, we verify that the optimal balance (i.e., an optimal learning effort) can emerge from evolution when there is a trade-off between reproduction and lifetime.
Cooperative Surveillance System with Fixed Camera Object Localization and Mobile Robot Target Tracking
Authors: Chih-Chun Chia, Wei-Kai Chan, Shao-Yi Chien
Venue: Proceedings of the 3rd Pacific Rim Symposium on Advances in Image and Video Technology (2009)

This paper presents a cooperative surveillance system. It presents a cooperation scheme between fixed cameras and a mobile robot. The fixed cameras detect the objects with background subtraction and locate the objects on a map with homography transform. At the same time, the information of the target to track, including the position and the appearance, is transmitted to the mobile robot. After Breadth First Search in a map of boolean array, the mobile robot finds the target in its view by use of a stochastic scheme with the information given, then the mobile robot will track the target and keep it in the robot's view wherever he or she goes. By proposing this system, the dead spot problem in typical surveillance systems with only fixed cameras is considered and resolved.
A stigmergic approach for dynamic routing of active products in FMS
Authors: Yves Sallez, Thierry Berger, Damien Trentesaux
Venue: Computers in Industry (2009)

This paper illustrates the capacity of a stigmergic routing control model to automatically find efficient routing paths for active products in flexible manufacturing systems (FMSs) undergoing perturbations. The proposed model is based upon a functional architecture with two levels: a virtual level in which virtual active products (VAPs) evolve stochastically in accelerated time, and a physical level in which physical active products (PAPs) evolve deterministically in real-time. The physical active products follow the best paths that have been detected on the virtual level, with a virtual level exploration being triggered when a perturbation is diagnosed in the transportation system. The data used for the simulation on the virtual level is then updated to reflect the real state of the transportation system. The model's adaptive capabilities are illustrated with several simulation scenarios using NetLogo software, and an on-going real implementation is presented.
A compiler intermediate representation for reconfigurable fabrics
Authors: Zhi Guo, Betul Buyukkurt, John Cortes, Abhishek Mitra, Walild Najjar
Venue: International Journal of Parallel Programming (2008)

Configurable computing relies on the expression of a computation as a circuit. Its main purpose is the hardware based acceleration of programs. Configurable computing has received renewed interest with the recent rapid increase in both size and speed of FPGAs. One of the major obstacles in the way of wider adoption of (re)configurable computing is the lack of high-level tools that support the efficient mapping of programs expressed in high-level languages (HLL) to reconfigurable fabrics. The major difficulty in such a mapping is the translation from a temporal execution model to a spatial execution model. An intermediate representation (IR) is the central structure around which tools such as compilers and synthesis tools are built. In this paper we propose an IR specifically designed for reconfigurable fabrics: CIRRF (Compiler Intermediate Representation for Reconfigurable Fabrics). We describe the design of CIRRF and its initial implementation as part of the ROCCC compiler for translating C code to VHDL. CIRRF is designed to support the creation of a datapath and the scheduling of operations on it. It provides support for buffers, look-up tables, predication and pipelining in the datapath. One of the important features of CIRRF, and ROCCC, is its support for the import of pre-designed IP cores into the original C source code allowing the user to leverage the huge wealth of existing IP cores while programming the configurable platform using a HLL. Using experiments and examples we show that CIRRF is a solid foundation to generate high-performance hardware.
Implementation considerations in electronic mail
Authors: Walter E. Ulrich
Venue: Proceedings of the May 19-22, 1980, national computer conference (1980)

Electronic Mail is the transmission of text or a document by electronic means. Examples of Electronic Mail Systems (EMS) include traditional teletype services, facsimile, and computer message systems (CMS).
Simulating the performance of a class-based weighted fair queueing system
Authors: Martin J. Fischer, Denise M. Bevilacqua Masi, John F. Shortle
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

Class Based Weighted Fair Queueing (CBWFQ) is a very important router discipline that allows different types of Internet Protocol (IP) traffic like voice, video, and best effort data to receive the required quality of service measures they individually need. CBWFQ dynamically allocates the available bandwidth to each traffic class based on the class's weight. This discipline is playing a vital role as IP brings these traffic classes together in a truly converged network. Under stress and in extreme emergencies, it is critical to be able to determine how the CBWFQ discipline will perform. In this paper, we present and discuss the critical role simulation has played in our development of performance analysis tools for the CBWFQ discipline.
How to build programmable multi-core chips
Authors: Jack B. Dennis
Venue: ACM SIGPLAN Notices (2009)

The arrival of multi-core chips has heightened interest in the discipline of parallel programming, a topic that has received much attention for many years. Computer architects have much to learn from sound principles for structuring software and expressing parallel computation. This talk will cover principles for the design of computer systems to support composable parallel software - the idea that any parallel program is usable, without change, as a component of larger parallel programs. By following these principles, a revolution in the ease of building robust and high-performance parallel software can be achieved. The principles suggest interesting directions for computer architecture; the tools to experiment with new architecture concepts are ready and waiting for the savvy and ambitious researcher
Determination of management zones for a tobacco field based on soil fertility
Authors: Wang Xin-Zhong, Liu Guo-Shun, Hu Hong-Chao, Wang Zhen-Hai, Liu Qing-Hua, Liu Xu-Feng, Hao Wei-Hong, Li Yan-Tao
Venue: Computers and Electronics in Agriculture (2009)

Present nutrient management recommendations for flue-cured tobacco (Nicotiana tabacum) in Central China are typically uniform for large regions. This results in over-application in areas with high nutrient levels and under-application in areas with low nutrient levels. An 87-ha tobacco field was selected to define management zones (MZs) for more precise soil nutrient management. Our objectives were to: (1) quantify the spatial variability of soil fertility variables, and (2) delineate the MZs by the combined usage of principal component analysis (PCA) and fuzzy cluster algorithm. To achieve these objectives, soil samples (0-20cm) were taken from 81 points on an approximately 100-m grid in March 2007. Soil samples were analyzed for pH, organic matter (OM), total nitrogen (TN), alkalytic nitrogen (AN), available phosphorous (AP), available potassium (AK), and cation exchange capacity (CEC). Spatial variability was assessed and spatial distribution maps constructed using geostatistical techniques. PCA and fuzzy cluster algorithm were then performed to delineate MZs; fuzzy performance index (FPI) and normalized classification entropy (NCE) were used to determine the optimum cluster number. Results showed that the optimum number of MZs for this study area was three and analysis of variance indicated the heterogeneity of soil fertility among different MZs. The defined MZs provide a basis of information for site-specific fertilizer management in the tobacco-planted field.
Efficient Access to Video Content in a Unified Framework
Authors: Yong Rui, Sean X. Zhou, Thomas S. Huang
Venue: Proceedings of the 1999 IEEE International Conference on Multimedia Computing and Systems - Volume 02 (1999)

Book contents' browsing and retrieval have been greatly facilitated by its Table-of-Contents (ToC) and Index, respectively. Unfortunately, today's video lacks such powerful mechanisms. In this paper, we explore and present novel techniques for constructing video ToC and Index. Furthermore, we explore the relationship between video browsing and retrieval and propose a unified framework to incorporate both entities in a seamless way. Experimental results on real-world video clips justify our proposed framework for providing efficient access to video content.
Quality-of-service trade-off analysis for wireless sensor networks
Authors: Rob Hoes, Twan Basten, Chen-Khong Tham, Marc Geilen, Henk Corporaal
Venue: Performance Evaluation (2009)

Quality of Service (QoS) support for wireless sensor networks (WSN) is a fairly new topic that is gaining more and more interest. This paper introduces a method for determining the node configurations of a WSN such that application-level QoS constraints are met. This is a complex task, since the search space is typically extremely large. The method is based on a recent algebraic approach to Pareto analysis, that we use to reason about QoS trade-offs. It features an algorithm that keeps the working set of possible configurations small, by analysing parts of the network in a modular fashion, and meanwhile discarding configurations that are inferior to other configurations. Furthermore, we give WSN models for two different applications, spatial mapping and target tracking, in which QoS trade-offs are made explicit. Test results for these applications and a heterogeneous WSN combining these two applications show that the models are accurate and that the method is scalable and thus practically usable for WSN, even with large numbers of nodes. Details are given on how to efficiently implement the algorithm.
A New Chinese Text Digital Watermarking for Copyright Protecting Word Document
Authors: He Lu, Fang DingYi, Gui XiaoLin, Chen XiaoJiang, Xu XinBai, Liu Jin' An
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 03 (2009)

More and more entriprises, organsizaions and goverments have used and distrubed information in word documents, pdf etc.. It makes easily to unauthorized copying and dissemination. According to DRM's requirements, we evaluated several text watermarking methods for instructing practical applications, and proposed a new approach in text watermarking where inter-character spaces are slightly modified for coding and using background texture for introducing noise against OCR attack. The capacity is improved to 1/3 bit/character and robust to screen capture. It is efficient extracting watermarking from document or screen-capture-image. Our experiments suggest it is suitable for word documents and chinese language.
Ontology Engineering --- The DOGMA Approach
Authors: Mustafa Jarrar, Robert Meersman
Venue: Advances in Web Semantics I: Ontologies, Web Services and Applied Semantic Web (2008)

This chapter presents a methodological framework for ontology engineering (called DOGMA), which is aimed to guide ontology builders towards building ontologies that are both highly reusable and usable, easier to build and to maintain. We survey the main foundational challenges in ontology engineering and analyse to what extent one can build an ontology independently of application requirements at hand. We discuss ontology reusability verses ontology usability and present the DOGMA approach, its philosophy and formalization, which prescribe that an ontology be built as separate domain axiomatization and application axiomatizations. While a domain axiomatization focuses on the characterization of the intended meaning (i.e. intended models) of a vocabulary at the domain level, application axiomatizations focus on the usability of this vocabulary according to certain application/usability perspectives and specify the legal models (a subset of the intended models) of the application(s)' interest. We show how specification languages (such as ORM, UML, EER, and OWL) can be effectively (re)used in ontology engineering.
Renal tumor quantification and classification in contrast-enhanced abdominal CT
Authors: Marius George Linguraru, Jianhua Yao, Rabindra Gautam, James Peterson, Zhixi Li, W. Marston Linehan, Ronald M. Summers
Venue: Pattern Recognition (2009)

Kidney cancer occurs in both hereditary (inherited) and sporadic (non-inherited) form. It is estimated that almost a quarter of a million people in the USA are living with kidney cancer and their number increases, with 51,000 diagnosed with the disease every year. In clinical practice, the response to treatment is monitored by manual measurements of tumor size, which are 2D, do not reflect the 3D geometry and enhancement of tumors, and show high intra- and inter-operator variability. We propose a computer-assisted radiology tool to assess renal tumors in contrast-enhanced CT for the management of tumor diagnoses and responses to new treatments. The algorithm employs anisotropic diffusion (for smoothing), a combination of fast-marching and geodesic level-sets (for segmentation), and a novel statistical refinement step to adapt to the shape of the lesions. It also quantifies the 3D size, volume and enhancement of the lesion, and allows serial management over time. Tumors are robustly segmented and the comparison between manual and semi-automated quantifications shows disparity within the limits of inter-observer variability. The analysis of lesion enhancement for tumor classification shows great separation between cysts, von Hippel-Lindau syndrome lesions, and hereditary papillary renal carcinomas (HPRC) with p-values inferior to 0.004. The results on temporal evaluation of tumors from serial scans illustrate the potential of the method to become an important tool for disease monitoring, drug trials, and non-invasive clinical surveillance.
Effective identification of failure-inducing changes: a hybrid approach
Authors: Sai Zhang, Yu Lin, Zhongxian Gu, Jianjun Zhao
Venue: Proceedings of the 8th ACM SIGPLAN-SIGSOFT workshop on Program analysis for software tools and engineering (2008)

When regression tests fail unexpectedly after a long session of editing, it may be tedious for programmers to find out the failure-inducing changes by manually inspecting all code edits. To eliminate the expensive effort spent on debugging, we present a hybrid approach, which combines both static and dynamic analysis techniques, to automatically identify the faulty changes. Our approach first uses static change impact analysis to isolate a subset of responsible changes for a failed test, then utilizes the dynamic test execution information to rank these changes according to our proposed heuristic (indicating the likelihood that they may have contributed to the failure), and finally employs an improved Three-Phase delta debugging algorithm, working from the coarse method level to the fine statement level, to find a minimal set of faulty statements. We implemented the proposed approach for both Java and AspectJ programs in our AutoFlow prototype. In our evaluation with two third-party applications, we demonstrate that this hybrid approach can be very effective: at least for the subjective programs we investigated, it takes significantly (almost 4X) fewer tests than the original delta debugging algorithm to locate the faulty code.
An improved SPIHT algorithm for lossless image coding
Authors: Tahar Brahimi, Ali Melit, Fouad Khelifi
Venue: Digital Signal Processing (2009)

In this paper, we propose a new wavelet-based lossless image coder that is based on a state-of-the-art algorithm, namely SPIHT (set partitioning in hierarchical trees). An algorithmic modification is introduced in order to increase its efficiency. This consists of adding a new test on direct descendants in the sets of type A to process the parent coefficients that are significant due to their nondirect descendants. Also, new sets of type C are defined to perform a separate sorting of the sets that have insignificant children. The idea behind the second proposition is to remove all tests over the entries (A, B and C) since the number of significant sets is much higher than that of insignificant sets. A number of experiments, carried out on various test images, demonstrates significant improvement over the conventional SPIHT for both greyscale and colour images.
An enhanced musical experience for the deaf: design and evaluation of a music display and a haptic chair
Authors: Suranga Nanayakkara, Elizabeth Taylor, Lonce Wyse, S H. Ong
Venue: Proceedings of the 27th international conference on Human factors in computing systems (2009)

Music is a multi-dimensional experience informed by much more than hearing alone, and is thus accessible to people of all hearing abilities. In this paper we describe a prototype system designed to enrich the experience of music for the deaf by enhancing sensory input of information via channels other than in-air audio reception by the ear. The system has two main components-a vibrating 'Haptic Chair' and a computer display of informative visual effects that correspond to features of the music. The Haptic Chair provides sensory input of vibrations via touch. This system was developed based on an initial concept guided by information obtained from a background survey conducted with deaf people from multi-ethnic backgrounds and feedback received from two profoundly deaf musicians. A formal user study with 43 deaf participants suggested that the prototype system enhances the musical experience of a deaf person. All of the users preferred either the Haptic Chair alone (54%) or the Haptic Chair with the visual display (46%). The prototype system, especially the Haptic Chair was so enthusiastically received by our subjects that it is possible this system might significantly change the way the deaf community experiences music.