ppxscal/embedding_network huggingface dataset:
Anisotropic Filter Based Modified Canny Algorithm
Authors: Ying Huang, Weixing Wang, Weisheng Li
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 01 (2007)

Canny algorithm is a classical edge detection algo- rithm, but the decision is based on incomplete information and the presupposition that the image is isotropic every- where, which will give rise to low accuracy or wrong re- sult. Based on directional filter, more adjacent pixels are introduced into Canny algorithm, unified matrix representa- tion and triangular masks provide a instinct understanding and groundwork for the further application such as three- dimension edge detection of Canny algorithm. The new algorithm is described with some examples and the com- parison between the old method and the proposed method proves that the proposed algorithm has advantage in the ability to detect edges and suppress noises. And the change of parameters has a slight effect on the proposed algorithm.
Power and reliability management of SoCs
Authors: Tajana Simunic Rosing, Kresimir Mihic, Giovanni De Micheli
Venue: IEEE Transactions on Very Large Scale Integration (VLSI) Systems (2007)

Today's embedded systems integrate multiple IP cores for processing, communication, and sensing on a single die as systems-on-chip (SoCs). Aggressive transistor scaling, decreased voltage margins and increased processor power and temperature have made reliability assessment a much more significant issue. Although reliability of devices and interconnect has been broadly studied, in this work, we study a tradeoff between reliability and power consumption for component-based SoC designs. We specifically focus on hard error rates as they cause a device to permanently stop operating. We also present a joint reliability and power management optimization problem whose solution is an optimal management policy. When careful joint policy optimization is performed, we obtain a significant improvement in energy consumption (40%) in tandem with meeting a reliability constraint for all SoC operating temperatures.
A Theoretical Basis for the Analysis of Multiversion Software Subject to Coincident Errors
Authors: D. E. Eckhardt
Venue: IEEE Transactions on Software Engineering (1985)

Fundamental to the development of redundant software techniques (known as fault-tolerant software) is an understanding of the impact of multiple joint occurrences of errors, referred to here as coincident errors. A theoretical basis for the study of redundant software is developed which 1) provides a probabilistic framework for empirically evaluating the effectiveness of a general multiversion strategy when component versions are subject to coincident errors, and 2) permits an analytical study of the effects of these errors. An intensity function, called the intensity of coincident errors, has a central role in this analysis. This function describes the propensity of programmers to introduce design faults in such a way that software components fail together when executing in the application environment. We give a condition under which a multiversion system is a better strategy than relying on a single version and we study some differences between the coincident errors model developed here and the model that assumes independent failures of component verions.
Design of a High-speed FPGA-based 32-bit Floating-point FFT Processor
Authors: Shengmei Mou, Xiaodong Yang
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 01 (2007)

In this paper, we design and implement a 32-bit IEEE 754 single precision floating-point FFT processor. Usually, limited by long pipeline latency of floating-point operations and multi-port RAM access the throughput of FFT processors can only reach approximately one result per cycle. Through making some improvements on the design of butterfly unit and reorganization of the RAM access, almost a throughput of 2 complex results per cycle can be gotten and twice performance as traditional FFT processors can be achieved. As to a 1024-point FFT transform, it can be finished in (512+10)*10=5220 cycles.
TRFMA
Authors: Yoshio Nakano, Toru Takeshita, Yoshihisa Yamashita
Venue: Bioinformatics (2006)

Summary: TRFMA provides a Web environment for analyzing T-RFLP results based on molecular weights of the fragments, rather than the numbers of nucleotides, to increase accuracy. The 16S rRNA data are saved as an XML file containing around 650 sequences (light version) and a MySQL database containing around 50 000 sequences (full version), which are connected to Web server via PHP5 and manipulated on an Internet browser. Availability: TRFMA is freely available at and can be downloaded from the same site. Contact: yosh@dent.kyushu-u.ac.jp
Skin Detection Using Color, Texture and Space Information
Authors: Zhiwei Jiang, Min Yao, Wei Jiang
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 03 (2007)

Among various skin detection methods, Skin Probability Map (SPM) method is an effective one. Though SPM method possesses high true acceptance rate (TAR), its false acceptance rate (FAR) is unacceptable in some cases. The reason is that SPM method only use pixel-level color information. This paper proposes an improved skin detection method that integrates color, texture and space information. After color filter, a texture filter is constructed based on texture features extracted form Gabor wavelet transform. Texture filter will further filter non-skin pixels, meanwhile, it may also filter some skin pixel. To compensate the loss, after texture filter, a marker driven watershed transform is then used to grow already obtained skin regions. Experimental results show that the proposed method can achieve better performance than that of SPM.
Introductory Computing Construct Use in an End-User Programming Community
Authors: Brian Dorn, Allison Elliott Tew, Mark Guzdial
Venue: Proceedings of the IEEE Symposium on Visual Languages and Human-Centric Computing (2007)

Previous studies of end-user programmers have indicated a reliance on related examples for learning. Accordingly, we analyzed the projects contained in an online community with respect to their use of introductory computing constructs. In general, the projects resemble those of novice programmers, implying the opportunity for supporting additional learning. Project authors' attention to matters of intellectual property may also directly impact other end-users' willingness to learn.
Hybrid Overloading and Stochastic Analysis for Redundant Real-time Multiprocessor Systems
Authors: Wei Sun, Yuanyuan Zhang, Chen Yu, Xavier Defago, Yasushi Inoguchi
Venue: Proceedings of the 26th IEEE International Symposium on Reliable Distributed Systems (2007)

In multiprocessor systems, redundant scheduling is a technique that trades processing power for increased reliability. One approach, called primary-backup task scheduling, is often used in real-time multiprocessor systems to ensure that deadlines are met in spite of faults. Briefly, it consists in scheduling a secondary task conditionally, in such a way that the secondary task actually gets executed only if the primary task (or the processor executing it) fails to terminate properly. Doing so avoids wasting CPU resources in the failure- free case, but primary and secondary tasks must then compete for resources in case of failure. To overcome this, overloading strategies, such as primary and backup overloading (PB) and backup-backup overloading (BB), aim at improving schedulability while retaining a certain level of reliability. In this paper, we propose a hybrid overloading technique based on extended PB overloading, which combines advantages of both PB and BB overloading. The three overloading strategies are then compared through a stochastic analysis, and by simulating them under diverse system conditions. The analysis shows that hybrid overloading provides an excellent tradeoff between schedulability and reliability.
Competitive and cooperative adaptive reasoning with fuzzy causal knowledge
Authors: Hong Ding, Madan M. Gupta
Venue: Journal of Intelligent Fuzzy Systems: Applications in Engineering and Technology (2000)

In the current literature on knowledge-based diagnostic reasoning, two kinds of knowledge, experiential knowledge and causal knowledge, are generally acquired and widely used. In 1995, Ding and Gupta [8] proposed a new approach to fuzzy neural network-based adaptive reasoning with experiential knowledge. In that paper a fuzzy neuronal model with composite fuzzy MAX-MIN neurons was presented for the acquisition of experiential knowledge and fuzzy reasoning. In this paper, we present an architecture for a dynamic fuzzy causal neural network for dealing with fuzzy causal knowledge for diagnostic problems. The inhibitory and excitatory mechanism of computational neurons are employed to model the complex competitive and cooperative behaviors between disorders in the process of causal fuzzy reasoning.
Remote Experiments as SemanticWeb Services
Authors: Cassio V. S. Prazeres, Maria da Graca C. Pimentel, Cesar A. C. Teixeira
Venue: Proceedings of the International Conference on Semantic Computing (2007)

Online experimentation allows users to operate remote instruments from anywhere and, usually, at any time. The amount of experiments that can be accessed trough the Web is growing quickly. These remote experiments have distinct characteristics, need a variety of resources, as well as present different availability and access procedures. Remote experiments can be supported as Semantic Web Services, demanding special attention in terms of discovering, selection, composition, scheduling, monitoring and making available the results. In order to allow the integration of remote experiments in Web-based environments, we propose supporting remote experiments as Semantic Web Services. Our approach, which we call RALOWS - Remote Access Laboratory Ontology and Web Service, reuse and extend known ontologies to provide formal description for experiments. More specifically, we combine temporal concepts to service and resource descriptions so as to make possible to specify scheduling and to impose restrictions in the use of the resources involved in the experimentation.
Residue Number Scaling and Other Operations Using ROM Arrays
Authors: G. A. Jullien
Venue: IEEE Transactions on Computers (1978)

Over the last two decades there has been considerable interest in the implementation of digital computer elements using hardware based on the residue number system. This paper considers implementing such systems with arrays of look-up tables placed in high density read-only memories. The type of system discussed is restricted to one in which the only operations are addition, subtraction, multiplication, and scaling by a predetermined constant. Special attention is given to the scaling algorithm, and two different scaling algorithms are developed.
An Alternative to the Graham-Glanville Code-Generation Method
Authors: R. N. Horspool
Venue: IEEE Software (1987)

A major advance in compiler technology attacks code generation from the wrong direction. This table-based approach produced better code more flexibly.
Local Histogram Equalization Based on the Minimum Brightness Error
Authors: Yafei Tian, Qingtao Wan, Fengjun Wu
Venue: Proceedings of the Fourth International Conference on Image and Graphics (2007)

Histogram equalization is a very useful method for contrast enhancement. The brightness of the output image has nothing to do with the brightness of the input image. The paper proposed a new algorithm which based on the minimum mean brightness error bi-histogram equalization and the local histogram equalization. Simulation results prove that the new algorithm is better than other algorithms.
A hypervisor based security testbed
Authors: Dan Duchamp, Greg De Angelis
Venue: Proceedings of the DETER Community Workshop on Cyber Security Experimentation and Test on DETER Community Workshop on Cyber Security Experimentation and Test 2007 (2007)

We are developing an experimental testbed intended to help support security research. The testbed allows a network of unmodified hosts, running any of several of unmodified operating systems, to execute in a controlled and reproducible manner. The network is implemented on a hypervisor that is instrumented to observe and control security-relevant events. These events are securely logged to a relational database for later analysis.
Lexical and Discourse Analysis of Online Chat Dialog
Authors: Eric N. Forsythand, Craig H. Martell
Venue: Proceedings of the International Conference on Semantic Computing (2007)

One of the ultimate goals of natural language processing (NLP) systems is understanding the meaning of what is being transmitted, irrespective of the medium (e.g., written versus spoken) or the form (e.g., static documents versus dynamic dialogues). Although much work has been done in traditional language domains such as speech and static written text, little has yet been done in the newer communication domains enabled by the Internet, e.g., online chat and instant messaging. This is in part due to the fact that there are no annotated chat corpora available to the broader research community. The purpose of this research is to build a chat corpus, tagged with lexical (token part-of-speech labels), syntactic (post parse tree), and discourse (post classification) information. Such a corpus can then be used to develop more complex, statistical-based NLP applications that perform tasks such as author profiling, entity identification, and social network analysis.
The Simulation of Train Separation Control Algorithm by Movement Authority Using Beacon
Authors: Jonghyen baek, Changgu lee
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 03 (2007)

Korean National Railroad is planning using the on- board signaling system for putting KTX and existing equipment to a good. If we use a on-board signal mode, we can improve headway more than the classical ground signal mode but there can be places where the improvement of headway is impossible in a certain section because of physical constraints. So a new algorithm for train separation control is necessary to beacon. Train separation control system by movement authority and beacon does not depend on conventional track circuit. Therefore, position and distance control of train to prevent collision with leading train may become important safety factor. This paper suggests an investigation of train separation control algorithm using movement authority of several units efficiently for this. This paper is come up with an algorithm for this situation.
POPI
Authors: Chun-Wei Tung, Shinn-Ying Ho
Venue: Bioinformatics (2007)

Motivation: Both modeling of antigen-processing pathway including major histocompatibility complex (MHC) binding and immunogenicity prediction of those MHC-binding peptides are essential to develop a computer-aided system of peptide-based vaccine design that is one goal of immunoinformatics. Numerous studies have dealt with modeling the immunogenic pathway but not the intractable problem of immunogenicity prediction due to complex effects of many intrinsic and extrinsic factors. Moderate affinity of the MHC–peptide complex is essential to induce immune responses, but the relationship between the affinity and peptide immunogenicity is too weak to use for predicting immunogenicity. This study focuses on mining informative physicochemical properties from known experimental immunogenicity data to understand immune responses and predict immunogenicity of MHC-binding peptides accurately. Results: This study proposes a computational method to mine a feature set of informative physicochemical properties from MHC class I binding peptides to design a support vector machine (SVM) based system (named POPI) for the prediction of peptide immunogenicity. High performance of POPI arises mainly from an inheritable bi-objective genetic algorithm, which aims to automatically determine the best number m out of 531 physicochemical properties, identify these m properties and tune SVM parameters simultaneously. The dataset consisting of 428 human MHC class I binding peptides belonging to four classes of immunogenicity was established from MHCPEP, a database of MHC-binding peptides (Brusic et al., 1998). POPI, utilizing the m = 23 selected properties, performs well with the accuracy of 64.72% using leave-one-out cross-validation, compared with two sequence alignment-based prediction methods ALIGN (54.91%) and PSI-BLAST (53.23%). POPI is the first computational system for prediction of peptide immunogenicity based on physicochemical properties. Availability: A web server for prediction of peptide immunogenicity (POPI) and the used dataset of MHC class I binding peptides (PEPMHCI) are available at http://iclab.life.nctu.edu.tw/POPI Contact: syho@mail.nctu.edu.tw
An Aggregation Tree Constructing Algorithm Based on Energy Consumption Assessment
Authors: Dayang Sun, Yanheng Liu, Aimin Wang
Venue: Proceedings of the 7th IEEE International Conference on Computer and Information Technology (2007)

This paper first gives an analysis of Data Aggregation and Data Compression based on the energy consumption of sensor nodes, after which an approach is proposed to construct an aggregation tree in the case of non-perfect aggregation since GIT considers only the case of perfect aggregation and it does not work well if the aggregation is non-perfect. An assessment scheme that can get the information of hops from the aggregation point to the sink and the hops from the aggregation point to the source node is used to construct such an aggregation tree. Moreover, the energy consumption of the aggregation is also considered. This scheme can be used when perfect aggregation cannot be performed. In this paper, an approach to reduce the cost of reinforcement is also proposed, in which the reinforcement work is done by the source nodes themselves, not by the sink node. Simulation result shows that this approach can save more energy than GIT when the aggregation ratio is small. This result also provides a theoretical limit of aggregation to tell when GIT will lose its superiority and thus gives us a direction to choose among the aggregation algorisms. Another result shows that the further the sources are away from the sink, the less reinforcement messages are needed.
Privacy in the open: how attention mediates awareness and privacy in open-plan offices
Authors: Jeremy P. Birnholtz, Carl Gutwin, Kirstie Hawkey
Venue: Proceedings of the 2007 international ACM conference on Supporting group work (2007)

The tension between privacy and awareness has been a persistent difficulty in distributed environments that support opportunistic and informal interaction. For example, many awareness systems that display 'always-on' video links or PC screen contents have been perceived as too invasive, even though functional real-world analogues, like open-plan offices, may provide even less privacy than their online counterparts. In this paper we explore the notion of privacy in open-plan real-world environments, in order to learn more about how it might be supported in distributed systems. From interviews and observations in four open-plan offices, we found that attention plays an important role in the management of both confidentiality and solitude. The public nature of paying attention allows people to build understandings of what objects in a space are legitimate targets for attention and allows people to advertise their interest in interaction. Our results add to what is known about how privacy works in real-world spaces, and suggest valuable design ideas that can help improve support for natural privacy control and interaction in distributed awareness systems.
A Service Selection Model with Multiple QoS Constraints on the MMKP
Authors: Hefeng Cao, Xingzhi Feng, Yang Sun, Zhiwei Zhang, Quanyuan Wu
Venue: Proceedings of the 2007 IFIP International Conference on Network and Parallel Computing Workshops (2007)

Web Service Composition (WSC) has become core Service-Oriented Computing technology. It is important for business process to construct a complex one with multi-dimensional QoS assurance. But there exist some problems, such as evaluation for QoS properties of service is not full-scale and the criteria is not clear, the weight for each QoS metric doesn't consider both subjective sensations and objective facts. In this paper we propose a model to provide multi-dimensional QoS support in service selection and replacement. We define a utility function as the evaluation standard, which aggregates all QoS metrics after normalizing their values. Then we use Subjective-Objective Weight Mode (SOWM) to set the weight of each QoS metric. Also we propose a heuristic algorithm on the Multichoice, Multi-dimension 0-1 Knapsack Problem (MMKP) using the rule-library. Finally we test the efficiency of the algorithm and the results prove it is predominant compared with other algorithms.
A VNS-ANT Algorithm to QAP
Authors: Hongbo Han, Jun Ye, Qiang Lv
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 03 (2007)

Quadratic Assignment Problem (QAP) is one of the most difficult combinatorial optimization problems which has been tackled by many metaheuristic algorithms. This paper proposes a new algorithm, VNS-ANT, to solve QAP. The main idea is to hybridize a VNS (Variable neighborhood search) mechanism and an Ant Algorithm (FANT). VNS-ANT enhances the local search in ANT with a VNS search in k-distance space guided by ant pheromone. In this way, VNS-ANT algorithm can not only efficiently speedup the improvement procedure in ANT, but sufficiently improve the veracity of VNS. The paper tests VNS-ANT on famous instances of QAPLIB. The experimental results show that VNS-ANT obtains better solutions than FANT with average 14.4% higher in solution quality.
An educational interactive numerical model of the Chesapeake Bay
Authors: Jessica R. Crouch, Yuzhong Shen, Jay A. Austin, Michael S. Dinniman
Venue: Computers Geosciences (2008)

Scientists use sophisticated numerical models to study ocean circulation and other physical systems, but the complex nature of such simulation software generally make them inaccessible to non-expert users. In principle, however, numerical models represent an ideal teaching tool, allowing users to model the response of a complex system to changing conditions. We have designed an interactive simulation program that allows a casual user to control the forcing conditions applied to a numerical ocean circulation model using a graphical user interface, and to observe the results in real-time. This program is implemented using the Regional Ocean Modeling System (ROMS) applied to the Chesapeake Bay. Portions of ROMS were modified to facilitate user interaction, and the user interface and visualization capabilities represent new software development. The result is an interactive simulation of the Chesapeake Bay environment that allows a user to control wind speed and direction along with the rate of flow from the rivers that feed the bay. The simulation provides a variety of visualizations of the response of the system, including water height, velocity, and salinity across horizontal and vertical planes.