ppxscal/embedding_network huggingface dataset:
Xylem: An Operating System for the Cedar Multiprocessor
Authors: P. Emrath
Venue: IEEE Software (1985)

Based on version 4.2 of Unix, this system is being implemented in an extended version of C and features systems calls to support multiprocessing within individual programs.
New Strategy for the On-Line Handwriting Modelling
Authors: H. Boubaker, M. Kherallah, A. Alimi
Venue: Proceedings of the Ninth International Conference on Document Analysis and Recognition - Volume 02 (2007)

In this article, we present initially arguments supporting the idea of the approximation of a cursive handwriting trajectory by arcs of ellipses. Then, we introduce a new strategy which improves the dynamic and geometrical features of the online handwritten trajectory modeling. We show that the curvilinear velocity can be rebuilt with the superposition of two components successively named the "Beta" model and the "Carrying" dragged component. After that, we integrated the geometrical characteristics as the arcs of ellipses for the layout modeling.
Statistical Evaluation of Measure and Distance on Document Classification Problems in Text Mining
Authors: Masayuki Goto, Takashi Ishida, Shigeichi Hirasawa
Venue: Proceedings of the 7th IEEE International Conference on Computer and Information Technology (2007)

This paper discusses the document classification prob- lems in text mining from the viewpoint of asymptotic statis- tical analysis. By formulation of statistical hypotheses test which is specified as a problem of text mining, some inter- esting properties can be visualized. In the problem of text mining, the several heuristics are applied to practical anal- ysis because of its experimental effectiveness in many case studies. The theoretical explanation about the performance of text mining techniques is required and this approach will give us very clear idea. The distance measure in word vec- tor space is used to classify the documents. In this paper, the performance of distance measure is also analized from the new viewpoint of asymptotic analysis.
Extension of Intelligent Engineering and its Model Theory Expression
Authors: Yuan Jiahai, Zhao Changhong, Xiong MinPeng, Gao Jianwei
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 05 (2007)

Intelligent engineering has been proposed and many real world applications have preliminarily demonstrated its viability. The main idea of intelligent engineering is multi-space operation for complex problem solving. This paper gives a further discussion on intelligent engineering. Particularly we introduce matter-element for system state expression. Two algorithms generalized addition and generalized multiply, for inter subspace and within subspace operation is defined. Finally we give a preliminary demonstration of the viability of IE by model theory.
On-Die Interconnect and Other Challenges for Chip-Level Multi-Processing
Authors: Tryggve Fossum
Venue: Proceedings of the 15th Annual IEEE Symposium on High-Performance Interconnects (2007)

There is increasing interest in chip-level multi-processing, and in this talk I will discuss some the motivations, and some of the challenges in designing such chips. A key component is the on-die interconnect, and we will look at this along with some thoughts on core design, cache architecture, memory bandwidth, power management, error handling, and system scaling.
A Note on State Minimization of a Special Class of Incomplete Sequential Machines
Authors: H. -D. Ehrich
Venue: IEEE Transactions on Computers (1972)

In this note a necessary and sufficient condition is supplied for a flow table to have the property that every cover composed of maximal compatibles is closed. An example of such a flow table is given to which all sufficient conditions known before do not apply.
An Adaptive Tool Integration Framework to Enable Coordination in Distributed Software Development
Authors: Vibha S. Sinha, Bikram Sengupta, Sugata Ghosal
Venue: Proceedings of the International Conference on Global Software Engineering (2007)

In this position paper we argue that to effectively address coordination challenges in distributed software development, we need to go beyond making individual development tools more collaborative and design a framework that enables common understanding of the information from different tools and supports loose coupling between them. Stakeholders can go about doing their work in their choice of tools, and as long as these tools adhere to certain interface requirements imposed by the framework, information may be shared across tools in a seamless fashion. The framework should also be able to pick up on cues within the project execution environment, analyze them, and provide useful information as alerts and advisories to stakeholders. Finally, the framework should be adaptive to new tools introduced in the development process as well as to changing project governance needs. We present a preliminary architecture of the framework and discuss candidate technologies to realize it.
Predicting vulnerable software components
Authors: Stephan Neuhaus, Thomas Zimmermann, Christian Holler, Andreas Zeller
Venue: Proceedings of the 14th ACM conference on Computer and communications security (2007)

Where do most vulnerabilities occur in software? Our Vulture tool automatically mines existing vulnerability databases and version archives to map past vulnerabilities to components. The resulting ranking of the most vulnerable components is a perfect base for further investigations on what makes components vulnerable. In an investigation of the Mozilla vulnerability history, we surprisingly found that components that had a single vulnerability in the past were generally not likely to have further vulnerabilities. However, components that had similar imports or function calls were likely to be vulnerable. Based on this observation, we were able to extend Vulture by a simple predictor that correctly predicts about half of all vulnerable components, and about two thirds of all predictions are correct. This allows developers and project managers to focus their their efforts where it is needed most: "We should look at nsXPInstallManager because it is likely to contain yet unknown vulnerabilities.".
A Multiresolution Image Fusion Based on Principle Component Analysis
Authors: Huaixin Chen
Venue: Proceedings of the Fourth International Conference on Image and Graphics (2007)

A multiresolution image fusion method based on principle component analysis (PCA) is presented. A pairs of registered images are decomposed and of multi-resolution representation by wavelet transform, adaptive fusion weight value of the low frequency wavelet coefficients are resolved using PCA, the high frequency wavelet coefficients are fused by local wavelet energy maximum, then fused images is formed by inverse transforming and combining all wavelet coefficients, the proposed algorithm should keep the information of global structure and significant features from the input images. The experimental results show the proposed procedure work well in the precise feature, visibility and structure information of fused image.
Collaborative vendor-buyer inventory system with declining market
Authors: P. C. Yang, H. M. Wee, P. H. Hsu
Venue: Computers and Industrial Engineering (2008)

Due to rapid technological innovation, shortening product life cycle and severe competition, product demand rate will decrease. In this study, we develop a collaborative vendor-buyer inventory system with exponentially decreasing market, finite horizon and constant replenishment interval. The result of this study shows an impressive cost reduction as a result of collaboration. The result is even more significant for products with decreasing demand. High-tech products (e.g., microcomputer chip), which is being substituted by another, has the characteristic of declining market demand with negatively exponential distribution. A numerical example and sensitivity analysis are provided to illustrate the theory and to derive the percentage total cost reduction of the collaborative vendor-buyer system.
Classification of analog synthesis tools based on their architecture selection mechanisms
Authors: E. Martens, G. Gielen
Venue: Integration, the VLSI Journal (2008)

This overview paper presents a classification and brief descriptions of design strategies supported by analog EDA tools developed by researchers and companies in recent history over more than 20 years. In contrast to other classification systems, the method used to obtain the topology or architecture is taken as base for the classification. Different methods may be preferred depending on the type of system, the abstraction level, the experience of the designer or the need for extensive exploration of different architectures. Therefore, this overview helps the analog designer to select the right approach for the right task.
Performance analysis of a novel traffic scheduling algorithm in slotted optical networks
Authors: Daojun Xue, Yang Qin, Chee Kheong Siew
Venue: Computer Communications (2007)

This paper considers the scheduling problem in a new slotted optical network called Time-Domain Wavelength Interleaved network (TWIN). The TWIN architecture possesses interesting properties, which may offer solutions for next-generation optical networks. Besides, better Quality of Service (QoS) could be achieved in TWIN by minimizing two parameters: queueing delay and delay variance. However, to the best of our knowledge, most of the existing scheduling algorithms in TWIN ignored consideration of QoS and focused mainly on maximizing the throughput. In this paper, we formulate the scheduling problem into an Integer Linear Programming (ILP) problem and propose a novel heuristic - Destination Slot Set (DSS) algorithm to solve it fast and efficiently. Besides, we derive an analytical model for TWIN and investigate the performance of DSS in it. By means of simulations, we demonstrate that our analytical model approximates the TWIN network very well; moreover, DSS incurs smaller queueing delay and delay variance, which ensures better QoS.
Evaluation of the cognitive goals of OZNAKI: enhancement of spatial projective abilities
Authors: Harvey A. Cohen, David G. Green
Venue: ACM SIGCUE Outlook (1978)

The OZNAKI Project applies cognitive goals to the design of TINY robotics languages and sequences of lessons in which students program simple robots and TV "block" graphics. One such lesson sequence, the "Projection Module", has been designed to emphasise "projection", a fundamental spatial ability. The course was evaluated in a study involving students aged 8 to 13 years. Experimental and control groups consisted of students matched by age, class, and spatial ability (measured by pre-test), with no previous OZNAKI experience. While the experimental group participated in OZNAKI lessons the control group had only their usual maths lessons. The pre- and post-tests took the form of individual Piagetian interviews with the primary school students, and multi-choice questionnaires with the junior high school students, thus giving two distinct studies. Significant enhancement of spatial abilities was found for the experimental group in both the primary and the secondary studies.
Distribution of path durations in mobile ad hoc networks and path selection
Authors: Richard J. La, Yijie Han
Venue: IEEE/ACM Transactions on Networking (TON) (2007)

We investigate the issue of path selection in multihop wireless networks with the goal of identifying a scheme that can select a path with the largest expected duration. To this end, we first study the distribution of path duration. We show that, under a set of mild conditions, when the hop count along a path is large, the distribution of path duration can be well approximated by an exponential distribution even when the distributions of link durations are dependent and heterogeneous. Second, we investigate the statistical relation between a path duration and the durations of the links along the path. We prove that the parameter of the exponential distribution, which determines the expected duration of the path, is related to the link durations only through their means and is given by the sum of the inverses of the expected link durations. Based on our analytical results, we propose a scheme that can be implemented with existing routing protocols and select the paths with the largest expected durations. We evaluate the performance of the proposed scheme using ns-2 simulation.
Efficient Visualization of Lagrangian Coherent Structures by Filtered AMR Ridge Extraction
Authors: Filip Sadlo Ronald Peikert
Venue: IEEE Transactions on Visualization and Computer Graphics (2007)

This paper presents a method for filtered ridge extraction based on adaptive mesh refinement. It is applicable in situations where the underlying scalar field can be refined during ridge extraction. This requirement is met by the concept of Lagrangian coherent structures which is based on trajectories started at arbitrary sampling grids that are independent of the underlying vector field. The Lagrangian coherent structures are extracted as ridges in finite Lyapunov exponent fields computed from these grids of trajectories. The method is applied to several variants of finite Lyapunov exponents, one of which is newly introduced. High computation time due to the high number of required trajectories is a main drawback when computing Lyapunov exponents of 3-dimensional vector fields. The presented method allows a substantial speed-up by avoiding the seeding of trajectories in regions where no ridges are present or do not satisfy the prescribed filter criteria such as a minimum finite Lyapunov exponent.
Eliciting, capturing and tagging spontaneous facialaffect in autism spectrum disorder
Authors: Rana el Kaliouby, Alea Teeters
Venue: Proceedings of the 9th international conference on Multimodal interfaces (2007)

The emergence of novel affective technologies such as wearable interventions for individuals who have difficulties with social-emotional communication requires reliable, real-time processing of spontaneous expressions. This paper describes a novel wearable camera and a systematic methodology to elicit, capture and tag natural, yet experimentally controlled face videos in dyadic conversations. The MIT-Groden-Autism corpus is the first corpus of naturally-evoked facial expressions of individuals with and without Autism Spectrum Dis-orders (ASD), a growing population who have difficulties with social-emotion communication. It is also the largest in number and duration of the videos, and represents affective-cognitive states that extend beyond the basic emotions. We highlight the machine vision challenges inherent in processing such a corpus, including pose changes and pathological affective displays.
An Efficient Goalie Strategy Using Twin Hidden Markov Models
Authors: T. Srinivasan, Srikanth P. Srinivasan, Shravan Kumar Alur, Pravin Chandrasekaran
Venue: Proceedings of the 7th IEEE International Conference on Computer and Information Technology (2007)

Recently robosoccer has proved to be one of the most successful test beds for multi-agent behavior. In robosoccer, agents take actions based on the feedback they receive from the environment. In this paper, we propose a novel concept to select high level actions in a multi-agent environment. We conduce the whole problem to that of a defense strategy of goalie as it has got more scope for behavior recognition and action selection. We first characterize the various behaviors and actions so as to suit the HMM model. We then describe how these twin HMMs (Behavior Hidden Markov Model and Action Hidden Markov Model) are used in two different phases to recognize behaviors and select actions. Finally we present an algorithm that would implement the complete defense strategy of a goalie in key game situations.
Survivable and Efficient Clustered Keying in Wireless Sensor Network
Authors: Zhang Xizheng
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 03 (2007)

Large-scale wireless sensor networks (WSNs) are highly vulnerable to attacks because they consist of numerous resource-constrained devices and communicate via wireless links. It is necessary to provide security services to these networks to ensure their survival. Providing security for WSN presents unique challenges. Existing key management are more appropriate for short -lifetime WSNs rather than longlived WSNs. We propose a novel, self-organizing key management scheme for large-scale and long-lived WSNs, called LIghtweight Key Administration Layer (LIKAL). LIKAL provides administrative services that ensures the survivability of the network. Analytical and simulation results show that LIKAL is robust against the attacks and efficient with low communication and storage overhead on the sensor nodes.
An e-Learning System Supporting the Problem-Based-Learning Approach: the Case of "Virtual eBMS"
Authors: G. Secundo, G. Elia, C. Taurino
Venue: Proceedings of the 18th International Conference on Database and Expert Systems Applications (2007)

This paper presents a case study of applying the Problem Based Learning (PBL) approach in a Web-based environment. The application domain concerns Business Management and Technology Management topics. At first, the paper describes the rationale and the main features behind the PBL for creating Business Leaders in the Emerging Competitive Environment. Then, it introduces the Web-based system called "Virtual eBMS" that has been designed and implemented at the e-Business Management Section (eBMS) of the Scuola Superiore ISUFI. The system is illustrated by highlighting the operational framework allowing an author to design PBL-based curricula; moreover the two main learning approaches (structured and unstructured) referred to the learner access to the curricula are proposed, allowing him to capture the most suitable learning resources for solving complex problems. Finally, the main benefits from the learner perspective, together with some indications for future research will end the paper.
RNA Secondary Structure Prediction Based on Forest Representation and Genetic Algorithm
Authors: Taotao Zhang, Maozu Guo, Quan Zou
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 04 (2007)

RNA secondary structure prediction is one of the most important research areas in bioinformatics. This paper presents an improved genetic algorithm to predict RNA secondary structure. Firstly, we introduce the forest representation of RNA secondary structure. Next, we present a permutation-based genetic algorithm for predicting RNA secondary structures. We compute all possible helices of the RNA molecule and select the helices which have the highest similarity with the helices of a given homologous molecular structure. Finally, we select the structure which has the highest structure stability and similarity as predicted structure. Experiments have proved that the precise rates are improved.
Instance-based schema matching for web databases by domain-specific query probing
Authors: Jiying Wang, Ji-Rong Wen, Fred Lochovsky, Wei-Ying Ma
Venue: Proceedings of the Thirtieth international conference on Very large data bases - Volume 30 (2004)

In a Web database that dynamically provides information in response to user queries, two distinct schemas, interface schema (the schema users can query) and result schema (the schema users can browse), are presented to users. Each partially reflects the actual schema of the Web database. Most previous work only studied the problem of schema matching across query interfaces of Web databases. In this paper, we propose a novel schema model that distinguishes the interface and the result schema of a Web database in a specific domain. In this model, we address two significant Web database schema-matching problems: intra-site and inter-site. The first problem is crucial in automatically extracting data from Web databases, while the second problem plays a significant role in meta-retrieving and integrating data from different Web databases. We also investigate a unified solution to the two problems based on query probing and instance-based schema matching techniques. Using the model, a cross validation technique is also proposed to improve the accuracy of the schema matching. Our experiments on real Web databases demonstrate that the two problems can be solved simultaneously with high precision and recall.
Convolution Morphological Filters
Authors: Shan Duan, Qian-Qing Qin
Venue: Proceedings of the Fourth International Conference on Image and Graphics (2007)

In this paper, we present a novel morphological filter, called convolution morphological filters (CMF), using the linear convolution theory and method. The newly introduced filters employ a weighted convolution kernel and apply multiplication and division in place of addition and subtraction in ordinary morphological operations. The property of CMF indicates that it can smooth image and using to remove noise contained in images. An automatic generation algorithm of convolution morphological kernel is proposed, which is important to the function of CMF. Experimental results prove that an algorithm to smooth image or remove image noise is feasible and available. For some cases, the CMF act better than ordinary morphological filters.
High Efficient and Real Time Huffman Codec Used In Handwriting Short Message Service
Authors: Zhengyou Wang
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 03 (2007)

The author presents in this paper an enhanced Huffman Codec with high speed, high efficiency, and low memory usage for use with a camera-equipped mobile telephone in a "Handwriting Short Message Service" (HSMS) system. The proposed codec relies on the fact that images transferred using HSMS usually consist of long runs of white pixels and short runs of back pixels. In the encoding process, a single-side growing 12-bit Huffman code-table is defined to efficiently reduce the amount of redundant data, and the number of necessary flags within the bit stream minimized. Real-time Huffman decoding is achieved through a group-based fast matching algorithm to accelerate searching for a symbol in the continuous coding bit stream by dividing the code tree into clusters, and by avoiding memory sparsity. The experimental results show that the new Huffman coding method performs significantly better. The compression ratio is 5 times higher than that of the JPEG standard, the computation speed is 4 times faster than that of classical Huffman decoding and the entire memory space requires only 84 words.
Mapping speech spectra from throat microphone to close-speaking microphone: a neural network approach
Authors: A. Shahina, B. Yegnanarayana
Venue: EURASIP Journal on Advances in Signal Processing (2007)

Speech recorded from a throat microphone is robust to the surrounding noise, but sounds unnatural unlike the speech recorded from a close-speaking microphone. This paper addresses the issue of improving the perceptual quality of the throat microphone speech by mapping the speech spectra from the throat microphone to the close-speaking microphone. A neural network model is used to capture the speaker-dependent functional relationship between the feature vectors (cepstral coefficients) of the two speech signals. A method is proposed to ensure the stability of the all-pole synthesis filter. Objective evaluations indicate the effectiveness of the proposed mapping scheme. The advantage of this method is that the model gives a smooth estimate of the spectra of the close-speaking microphone speech. No distortions are perceived in the reconstructed speech. This mapping technique is also used for bandwidth extension of telephone speech.
Technology Scapegoats and Policy Saviors
Authors: Fred B. Schneider
Venue: IEEE Security and Privacy (2007)

IEEE Security & Privacy's associate editor in chief discusses technology's role in identity fraud and identity theft.