ppxscal/embedding_network huggingface dataset:
On the number of contractible triples in 3-connected graphs
Authors: Matthias Kriesell
Venue: Journal of Combinatorial Theory Series B (2008)

McCuaig and Ota proved that every 3-connected graph G on at least 9 vertices admits a contractible triple, i.e. a connected subgraph H on three vertices such that G-V(H) is 2-connected. Here we show that every 3-connected graph G on at least 9 vertices has more than |V(G)|/10 many contractible triples. If, moreover, G is cubic, then there are at least |V(G)|/3 many contractible triples, which is best possible.
The Application of Optimal Searching Algorithms in the Flight Decision
Authors: Chunxun Xie, Hongguang Yao, Cheng Li, Yan Lin, Jiani Zhao
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 05 (2007)

This paper gives the best method which combine the layer analysis method and algorithms of DIJKSTRAs. We use the layer analysis method to establish the layer structure model, analyze factor which will affect the decision of the flight route .To determine various price factor, we could solve each price of flight route .In the searching process, the most important part of DIJKSTRA is how to determine the flight price .We could take this price as the price of the shortest route problem, the DIJKSTRA Algorithms way will give the superior flight route in a comprehensive function.
Displays on Display
Authors: Frank Crow, Charles Csuri
Venue: IEEE Computer Graphics and Applications (1983)

Free-lance artist Larry Gartel has been active in computer painting for 10 years and looks back on a long struggle to gain acceptance for the medium. He finally saw the tide turn in about 1980, when he stopped feeling like ¿a pioneer in a covered wagon.¿ Recently, he received a grant from Polaroid Corporation to create huge computer-generated murals.
Defining categories to select representative attack test-cases
Authors: Mohammed S. GADELRAB, Anas Abou El Kalam, Yves Deswarte
Venue: Proceedings of the 2007 ACM workshop on Quality of protection (2007)

To ameliorate the quality of protection provided by intrusion detection systems (IDS) we strongly need more effective evaluation and testing procedures. Evaluating an IDS against all known and unknown attacks is probably impossible. Nevertheless, a sensible selection of representative attacks is necessary to obtain an unbiased evaluation of such systems. To overcome the problem of an unmanageably large set of possible inputs, software testers usually divide the data input domain into categories (or equivalence classes), and select representative instances from each category as test cases. We believe that the same principle could be applied to IDS testing if we have a reasonable classification. In this paper we make a thorough analysis of existing attack classifications in order to determine whether they could be helpful in selecting attack test cases. Then, we construct a new scheme to classify attacks relying on those attributes that appear to be the best classification criteria.
Threshold Cryptography and Authentication in Ad Hoc Networks Survey and Challenges
Authors: Marianne A. Azer, Sherif M. El-Kassas, Magdy S. El-Soudani
Venue: Proceedings of the Second International Conference on Systems and Networks Communications (2007)

The dynamic and cooperative nature of ad hoc networks present challenges in securing these networks. There are recent research efforts in securing ad hoc networks. Amongst security approaches, there are threshold cryptography and authentication. In this paper we survey the threshold cryptography based schemes and the authentication schemes that have been proposed to secure ad hoc networks. We conclude this paper and identify the challenges and open research areas associated with each of these approaches.
Segmented virtual ground architecture for low-power embedded SRAM
Authors: Mohammad Sharifkhani, Manoj Sachdev
Venue: IEEE Transactions on Very Large Scale Integration (VLSI) Systems (2007)

A new scheme to reduce the power consumption of static random access memories is presented. It is shown that using segmented virtual grounding (SVGND), it is possible to reduce both dynamic and static power consumption. The leakage power of the cells is reduced by reducing the voltage drop over a cell. The dynamic power dissipation is also reduced by eliminating the power consumption due to the discharge of the nondesired neighboring bitlines. The effectiveness of this scheme is compared to recently reported low-power schemes. It is shown that unlike those schemes, SVGND can accommodate multiple words in one row; a significant improvement in soft error rate tolerance.
The Printing of Octal Numerals
Authors: Chung-Kwong Yuen
Venue: IEEE Transactions on Computers (1973)

Although the conversion from octal to binary is a trivially simple process, it is still somewhat trying to have to mentally perform the conversion when reading a long list of octal numbers. The problem becomes especially annoying when one is examining the memory dump of the word contents of a machine which has a byte size not divisible by three (e.g., PDP-11). In such cases some of the octal digits contain portions of neighboring bytes. For example, in the octal representation of a 16-bit word made up of two 8-bit bytes the third digit from the right contains two bits of the right-hand byte and one bit of the left-hand byte. Unless one is very experienced in mental conversions it is very difficult to know the contents of the bytes without actually writin, down the binary representation. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
FISCHERPLOTS: An Excel spreadsheet for computing Fischer plots of accommodation change in cyclic carbonate successions in both the time and depth domains
Authors: Antun Husinec, Danko Basch, Brett Rose, J. Fred Read
Venue: Computers Geosciences (2008)

Fischer plots are plots of accommodation (derived by calculating cumulative departure from mean cycle thickness) versus cycle number or stratigraphic distance (proxies for time), for cyclic carbonate platforms. Although many workers have derived programs to do this, there are currently no published, easily accessible programs that utilize Excel. In this paper, we present an Excel-based spreadsheet program for Fischer plots, illustrate how the data are input, and how the resulting plots may be interpreted. The plots can be used to derive periods of increased accommodation, shown on the plots as a rising limb (which commonly matches times of more open marine, subtidal parasequence development). Times of decreased accommodation, shown on the plots as a falling limb, generally are coincident with thin, shallow, peritidal parasequences.
Optimized Local Kernel Machines for Fast Time Series Forecasting
Authors: Wen wu He, Zhizhong Wang
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 01 (2007)

In practices we often expect a fast learning such as real-time or online time series forecasting. However standard algorithms learning the machines from the whole data set are often time consuming. To this end, in this paper we introduce local learning strategy considering only a subset of candidates in the neighborhood of the test point and present a general form of local kernel machines for regression. To optimize these machines, based on leave-one-out errors or bounds of the kernel machines, pattern search method is adopted for model selecting. In addition, multiple-kernels are developed for performance improving. Intensive experiments on a real world electricity load forecasting have been carried out and the results demonstrate the feasibility of our methods of obtaining an improved generalization performance at a reduced computation cost.
A Hybrid Approach to Intelligent Living Assistance
Authors: Markus Nick, Martin Becker
Venue: Proceedings of the 7th International Conference on Hybrid Intelligent Systems (2007)

IT-based living assistance systems focusing on the support of people with special needs in their daily routine have to continuously monitor and assist them in an appropriate way. To this end, we have developed a Monitoring and Assistance component including a hybrid reasoner that is able to adapt planned and running treatments according to the current situation and context. In this paper, we explain the underlying approaches followed in the reasoner, describe the reasoning technologies used for this task and its subtasks, and present some first evaluation results.
Application of Policies in Autonomic Computing System based on Partitionable Server
Authors: Wen-jie Liu, Zhan-huai Li
Venue: Proceedings of the 2007 International Conference on Parallel Processing Workshops (2007)

With the increase of application servers in enterprises, the network management becomes more and more complex. How to decrease the cost of network management becomes the new topic in IT industry. Autonomic computing is the key technique of grid computing, which can lower the cost of management effectively, whereas its implementation is very difficult. This paper takes the partition-able server as management object, on the basis of studying the autonomic computing and hardware features of partition-able server, a method based on policies is proposed to realize the autonomic computing system. After defining the policy type and action type, a series of measures are proposed to configure resources of servers, which achieves the self-management of system and lowers the management cost.
Permutations of cooperative work practices: a study of two oncology clinics
Authors: Kjeld Schmidt, Ina Wagner, Marianne Tolar
Venue: Proceedings of the 2007 international ACM conference on Supporting group work (2007)

Based on a comparative study of cooperative work practices at two oncology clinics, the paper shows that work practices across these otherwise comparable settings vary significantly. Asking, how can ethnographic studies of local work practices then provide a dependable basis for design, the paper discusses how we may conceive of the relationship between ethnographic studies and systems development and suggests that a way out of the dilemma might be found in developing an analysis of the 'higher-order' practices of endless combination and recombination of artifacts, formats, notations, etc. that are found across such sites.
AR fa&ccedil;ade: an augmented reality interactve drama
Authors: Steven Dow, Manish Mehta, Blair MacIntyre, Michael Mateas
Venue: Proceedings of the 2007 ACM symposium on Virtual reality software and technology (2007)

Our demonstration presents AR Fa&ccedil;ade, a phyiscally embodied version of the interactive drama Fa&ccedil;ade, at the Beall Center in Irvine, CA. In this drama, players are situated in a married couple's apartment, and interact primarily through conversation with the characters and manipulation of objects in the space. Our demonstration will include two versions of the experience - an immersive augmented reality (AR) version and a desktop computing based implementation, where players communicate using typed keyboard input. Our recent study cross media study revealled emperical differences between the versions [Dow et al. 2007]. Through interviews and observations of players, we found that immersive AR can create an increased sense of presence, confirming generally held expectations. However, we learned that increased presence does not necessarily lead to more engagement. Rather, mediation may be necessary for some players to fully engage with certain immersive media experiences.
Formal Embedded Operating System Model Based on Resource-Based Design Framework
Authors: Jin-Hyun Kim, Jae-Hwan Sim, Chang-Jin Kim, Jin-Young Choi
Venue: Proceedings of the Seventh International Conference on Quality Software (2007)

Embedded operating system(OS) is one of most critical software in safety-critical systems. To certify it to a certifi- cation organization, it is recommended that specifications for systems are formally described nowadays. This pa- per introduces an executable model of embedded real-time OS of which purpose is to certify an embedded OS, called pCOS, to a certification organization in Korean nuclear so- ciety. The behavioral model of embedded OS is built by a design framework, called resource-oriented design. In this framework, we would aim at capturing the behavioral mod- els of embedded OS requirement and design separately and verifying them incrementally from functionality and hard- ware's constraints. By means of resource-oriented design, we can identify the property of hardware resources and ac- quire a formally verifiable and executable model of embed- ded OS that can be a proof of its safety.
Strategies for Large Handwritten Farsi/Arabic Lexicon Reduction
Authors: S. Mozaffari, K. Faez, V. Margner, H. El-Abed
Venue: Proceedings of the Ninth International Conference on Document Analysis and Recognition - Volume 01 (2007)

Given large number of words to be recognized, lexicon reduction strategy for eliminating unlikely candidates before recognition can be a reasonable and powerful approach for increasing the recognition speed. In this paper, we describe a holistic approach for large Arabic handwritten lexicon reduction which is based on inherent properties of Arabic writing. The principal of this technique involves extraction of dots, diacritics and subwords from the cursive Arabic word image to describe its shape. In the first stage of lexicon reduction, the number of subwords in the input word is estimated. Then, in the second stage, the word descriptor, based on the dots and diacritics information, is used while taking into account only the candidates selected in the first stage. Experimental results on IFN/ENIT database, consisting of 26,459 cursive Arabic word images, show a lexicon reduction of 92.5% with accuracy of 74%.
Streaming Algorithms for Biological Sequence Alignment on GPUs
Authors: Weiguo Liu, Bertil Schmidt, Gerrit Voss, Wolfgang Muller-Wittig
Venue: IEEE Transactions on Parallel and Distributed Systems (2007)

Sequence alignment is a common and often repeated task in molecular biology. Typical alignment operations consist of finding similarities between a pair of sequences (pairwise sequence alignment) or a family of sequences (multiple sequence alignment). The need for speeding up this treatment comes from the rapid growth rate of biological sequence databases: every year their size increases by a factor 1.5 to 2. In this paper we present a new approach to high performance biological sequence alignment based on commodity PC graphics hardware. Using modern graphics processing units (GPUs) for high performance computing is facilitated by their enhanced programmability and motivated by their attractive price/performance ratio and incredible growth in speed. To derive an efficient mapping onto this type of architecture, we have reformulated dynamic programming based alignment algorithms as streaming algorithms in terms of computer graphics primitives. Our experimental results show that the GPU-based approach allows speedups of over one order of magnitude with respect to optimized CPU implementations.
On macroeconomic characteristics of pharmaceutical generics and the potential for manufacturing and consumption under fuzzy conditions
Authors: Fernando Gascón, David de la Fuente, Javier Puente, Jesús Lozano
Venue: Artificial Intelligence in Medicine (2007)

Objective: The aim of this paper is to develop a methodology that is useful for analyzing, from a macroeconomic perspective, the aggregate demand and the aggregate supply features of the market of pharmaceutical generics. In order to determine the potential consumption and the potential production of pharmaceutical generics in different countries, two fuzzy decision support systems are proposed. Methods and materials: Two fuzzy decision support systems, both based on the Mamdani model, were applied in this paper. These systems, generated by Matlab Toolbox 'Fuzzy' (v. 2.0), are able to determine the potential of a country for the manufacturing or the consumption of pharmaceutical generics. The systems make use of three macroeconomic input variables. Results: In an empirical application of our proposed methodology, the potential towards consumption and manufacturing in Holland, Sweden, Italy and Spain has been estimated from national indicators. Cross-country comparisons are made and graphical surfaces are analyzed in order to interpret the results. Conclusions: The main contribution of this work is the development of a methodology that is useful for analyzing aggregate demand and aggregate supply characteristics of pharmaceutical generics. The methodology is valid for carrying out a systematic analysis of the potential generics have at a macrolevel in different countries. The main advantages of the use of fuzzy decision support systems in the context of pharmaceutical generics are the flexibility in the construction of the system, the speed in interpreting the results offered by the inference and surface maps and the ease with which a sensitivity analysis of the potential behavior of a given country may be performed.
Using genetic algorithms to explore pattern recognition in the immune system
Authors: Stephanie Forrest, Brenda Javornik, Robert E. Smith, Alan S. Perelson
Venue: Evolutionary Computation (1993)

This paper describes an immune system model based on binary strings. The purpose of the model is to study the pattern-recognition processes and learning that take place at both the individual and species levels in the immune system. The genetic algorithm (GA) is a central component of the model. The paper reports simulation experiments on two pattern-recognition problems that are relevant to natural immune systems. Finally, it reviews the relation between the model and explicit fitness-sharing techniques for genetic algorithms, showing that the immune system model implements a form of implicit fitness sharing.
Discovering Protein Complexes from Protein-Protein Interaction Data by Local Cluster Detecting Algorithm
Authors: Juan Liu, Bin Liu, Deyi Li
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 04 (2007)

Proteins are usually grouped into complexes to perform functional tasks in organisms. So discovery of protein complexes is critical to understand principles of cellular organization and function. Recently high-throughput techniques have produced large amount of protein-protein interaction (PPI) data, which make it possible to detect protein complexes automatically from PPI data by using computational method. In this paper, we propose a local cluster detection algorithm (LCDA) to find the protein complexes. Super to other methods existed, LCDA is able to find both non-overlapping and overlapping clusters. The experiment results show that LCDA can detect protein complexes with very high accuracies.
Temporal Predicate Detection Using Synchronized Clocks
Authors: Ajay D. Kshemkalyani
Venue: IEEE Transactions on Computers (2007)

Advances in clock synchronization techniques allowan approximated global time in ubiquitous environments. Thispaper presents an event stream based on-line algorithm that fusesthe data reported from the processors in such a network to detecttime-based predicates. The algorithm has low space, time, andmessage complexities. The paper also considers the detection ofsimultaneous events, as a special case.
An Algorithm for SAR Image Embedded Compression Based on Wavelet Transform
Authors: Li Kun, Wang Shuang, Hou Biao, Jiao Licheng
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 01 (2007)

Synthetic Aperture Radar (SAR) image compression is important in image transmission and archiving. In this paper, SAR image compression using embedded zerotree wavelets algorithm, based on discrete wavelet transform (DWT), is researched. Aiming at special characteristics of SAR image such as speckle noise, the author added a denoise step in the flow of compression, trying to do some meaningful attempt in SAR image compression. Experiments carried out show that the improvement can reduce the speckle noise and improve the computation precision and time.
High-Level Broadcast Communication for Local Area Networks
Authors: T. J. LeBlanc
Venue: IEEE Software (1985)

Even for LANs without collision-detection hardware, this implementation of StarMod offers improvements of from 1.1 to 7.8 over pointto-point message transmission-and that's the worst-case gain.
On specification of Read/Write shared variables
Authors: Sibsankar Haldar, K. Vidyasankar
Venue: Journal of the ACM (JACM) (2007)

A shared variable is an abstraction of persistent interprocess communication. Processors execute operations, often concurrently, on shared variables to exchange information among themselves. The behavior of operation executions is required to be &ldquo;consistent&rdquo; for effective interprocess communication. Consequently, a consistency specification of a shared variable describes some guarantees on the behavior of the operation executions. A Read/Write shared variable has two operations: a Write stores a specified value in the variable and a Read returns a value from the variable. For Read/Write variables, a consistency specification describes what values Reads may return. Using an intuitive notion of illegality of Reads, we propose a framework that facilitates specifying a large variety of Read/Write variables.
Dynamical Evolution in Function Finding
Authors: Zhijian Wu, Dazhi Jiang, Ming Wei, Yuanxiang Li
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 05 (2007)

As a branch of evolutionary computation (EC), genetic programming (GP) and genetic expression programming (GEP) have been applied widely in auto-programming. Inspired by the statistical mechanism, a new selection operator based on statistical mechanics is proposed, an algorithm dynamical evolutionary programming (DEP) algorithm is constructed by applying this new selection operator. The experimental results show that DEP is better than GEP in terms of the quality of average fitness.
A Classification of Differences between Similar BusinessProcesses
Authors: Remco Dijkman
Venue: Proceedings of the 11th IEEE International Enterprise Distributed Object Computing Conference (2007)

To unify similar business processes, such as processes of similar business units or similar organizations, the similarities and differences between these business processes must be detected and the differences must be resolved. This paper presents a classification that describes frequently occurring differences between business processes. This classification is helpful in the difference detection step. We discovered the differences in practice by comparing processes that we obtained from different business units in two organizations. The classification helps when merging processes in case of a merger between organizations. It also helps when merging processes to construct a standardized process and when verifying whether a party adheres to that standardized process.