ppxscal/embedding_network huggingface dataset:
On the Study of Self-Configuration Neighbour Cell List for Mobile WiMAX
Authors: Juan Li, Riku Jantti
Venue: Proceedings of the The 2007 International Conference on Next Generation Mobile Applications, Services and Technologies (2007)

Mobile WiMAX faces challenge of developing base station with self-configuration feature. This paper studies the algorithms of self-configuring neighbour cell list (NCL) for the WiMAX base stations. Three categories of algorithms are proposed based on different antenna radiation approximations. With empirical estimation of cell coverage radius, the algorithms are tested and compared in terms of user SINR experience via computer simulation. Circlebased and sector-based algorithms are found to have the best performances of providing users with high SINR value and low SINR variation. Real-patternbased algorithm failed to achieve the expected performance. The possible reasons are analyzed. The algorithms are also inspected from the aspect of computational load. The results indicate that circlebased and sector-based algorithms present superior performances. Therefore, they are the most feasible candidates of self-configuration NCL algorithms.
Identifying active subgroups in online communities
Authors: Alvin Chin, Mark Chignell
Venue: Proceedings of the 2007 conference of the center for advanced studies on Collaborative research (2007)

As online communities proliferate, methods are needed to explore and capture patterns of activity within them. This paper focuses on the problem of identifying active subgroups within online communities. k-plex analysis and hierarchical clustering are used to identify and contrast subgroups, and the methodology is demonstrated in a case study involving the TorCamp Google group community. We assessed the validity of the subgroups obtained in the case study by comparing them with the members' experienced sense of community, and their self-reported acquaintanceships. Results suggest that active subgroups of people not only interact with each other at a higher rate, but also have a greater experienced sense of community. It is concluded that detection of active subgroups in online communities can be implemented widely using automated tools for analyzing the social networks implied by online interactions.
A Hole in Goal Trees: Some Guidance from Resolution Theory
Authors: D. W. Loveland
Venue: IEEE Transactions on Computers (1976)

The representation power of goal-subgoal trees and the adequacy of this form of problem reduction is considered. A number of inadequacies in the classical form are illustrated, and two versions of a syntactic procedure incorporating extensions are given. Although the form of the corrections are suggested from resolution theory results, and the value of this connection emphasized, the paper discusses the goal tree format and its extensions on an informal level.
Computerised Skin Lesion Surface Analysis for Pigment Asymmetry Quantification
Authors: K. M. Clawson, P. J. Morrow, B. W. Scotney, D. J. McKenna, O. M. Dolan
Venue: Proceedings of the International Machine Vision and Image Processing Conference (2007)

Malignant melanoma is the deadliest form of skin cancer and must be diagnosed and excised during its earliest stages. The development of computerised systems which accurately quantify features representative of this cancer aims to assist diagnosis and improve preoperative diagnostic accuracy. One clinical feature suggestive of malignancy is asymmetry, which considers lesion shape, colour distribution and texture. In this paper techniques for the detection of colour asymmetry are evaluated and a new method for visually displaying and quantifying colour asymmetry is proposed. Automatic induction methods and a neural network model are utilised to evaluate the diagnostic capability of our features and identify those of greatest relative importance. Results indicate that those features quantifying possible areas of regression are most indicative of colour asymmetry.
Statistical Fault Analysis
Authors: Sunil Jain, Vishwani Agrawal
Venue: IEEE Design Test (1985)

Statistical Fault Analysis, or Stafan, is proposed as an alternative to fault simulation of digital circuits. This methoddefines Controllabilities and observabilities of circuit nodes as probabilities estimated from signal statistics of fault-freesimulation. Special Procedures deal with these quantities at fanout and feedback nodes. The computed probabilities are usedto derive unbiased estimates of fault detection probabilities and overall fault coverage for the given set of input vectors.Among Stafan's advantages, fault coverage and the undetected fault data obtained for actual circuits are shown to agree withinfive percent of fault simulator results, yet CPU time and memory demands fall far short of those required in fault simulation.The Computational complexity added to a fault-free simulator by Stafan grows only linearly with the number of circuit nodes.
Towards supporting awareness of indirect conflicts across software configuration management workspaces
Authors: Anita Sarma, Gerald Bortis, Andre van der Hoek
Venue: Proceedings of the twenty-second IEEE/ACM international conference on Automated software engineering (2007)

Workspace awareness techniques have been proposed to enhance the effectiveness of software configuration management systems in coordinating parallel work. These techniques share information regarding ongoing changes, so potential conflicts can be detected during development, instead of when changes are completed and committed to a repository. To date, however, workspace awareness techniques only address direct conflicts, which arise due to concurrent changes to the same artifact, but are unable to support indirect conflicts, which arise due to ongoing changes in one artifact affecting concurrent changes in an-other artifact. In this paper, we present a new, cross-workspace awareness technique that supports one particular kind of indirect conflict, namely those indirect conflicts caused by changes to class signatures. We introduce our approach, discuss its implementation in our workspace awareness tool Palantír, illustrate its potential through two pilot studies, and lay out how to generalize the technique to a broader set of indirect conflicts
Hierarchical two-tier ensemble learning: a new paradigm for network intrusion detection
Authors: Morteza Analoui, Behrouz Minaei Bidgoli, Mohammad Hossein Rezvani
Venue: Proceedings of the ACM first Ph.D. workshop in CIKM (2007)

Intrusion detection is a mechanism of providing security to computer networks. Almost all of traditional intelligent intrusion detection systems (IDSs) use a single approach to distinguish normal behavior patterns from attack signatures. Moreover these systems have a high false alarm rate and high cost. The combination of multiple classifiers usually exhibits lower false alarm and overall error rate than individual decisions. On the other hand, the combination of classifiers trained on different feature sets could provide better performances than each single classifier. In this paper, a hierarchical two-level combiner is proposed to detect network intrusions using multiple well-known and efficient base classifiers. The proposed combiner exploits the different recognition capabilities provided by the independent feature representations in the first level as well as the agreement among the classifiers in the second level.
Multicast Communication on Network Computers
Authors: A. J. Frank
Venue: IEEE Software (1985)

Channel-oriented packet casting is a predominant feature of Micros, an operating system designed to explore control and communication techniques for network computers containing thousands of hosts.
Personal Thoughts on Personal Computing
Authors: T. E. Osborne
Venue: Computer (1976)

When I talk about a subject like this one, I find myself discussing a world in which one hand is filled with ill-defined problems while the other hand overflows with solutions in search of a problem, a world in which the only thing wrong with a solution is the problems it creates. It is this world I want to talk about, not whether we can build electronic note pads, read our newspaper on a video screen, or get mail via a data net. We can build, at a reasonable cost, almost anything we want. Only recently has our problem become one of what to do with a product after it is built. 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
Modeling and Forecasting Aurora
Authors: Dirk Lummerzheim
Venue: Computing in Science and Engineering (2007)

Modeling the physical processes needed for forecasting space-weather events requires multiscale modeling. This article discusses several models researchers use to treat the various auroral processes that influence space weather.
An Efficient Diagnostic Test Pattern Generation Framework Using Boolean Satisfiability
Authors: Feijun Zheng, Kwang-Ting Cheng, Xiaolang Yan, John Moondanos, Ziyad Hanna
Venue: Proceedings of the 16th Asian Test Symposium (2007)

This paper presents a diagnostic test pattern generation (DTPG) framework based upon a Boolean Satisfiability engine. We first propose an enhanced miter-based model for distinguishing fault candidates that can achieve greater efficiency as well as can prove a group of un-differentiable faults. The model can also be used to generate diagnostic tests for distinguishing faults of different fault types. Based on this model, we propose a diagnostic pattern compaction strategy. By exploring "don't cares" at the primary inputs, the number of required diagnostic patterns can be reduced. Experimental results show that the proposed method achieves a greater diagnosis resolution when combined with existing approaches. Also, fewer diagnostic test patterns are needed.
Breaking and fixing the inline approach
Authors: Sebastian Gajek, Lijun Liao, Jörg Schwenk
Venue: Proceedings of the 2007 ACM workshop on Secure web services (2007)

McIntosh and Austel (SWS 2005, [12] ) have shown that standard semantics of digital signatures in context of WS-Security fail: If parts of the document are signed and the signature verification applied to the whole document returns a Boolean value, then the document can be significantly altered without invalidating the signature. Rahaman, Schaad and Rits (SWS 2006, [15] ) introduce the inline approach against the flaw. We analyze the inline approach and demonstrate weaknesses by the construction of counterexamples. Finally, we study solution ideas that mitigate XML wrapping attacks.
Introduction
Authors: Jorge Real, Stephen Michell
Venue: Proceedings of the 13th international workshop on Real-time Ada (2007)

To consider future directions in computing, and what changes would be required for Ada to effectively use new features.
A software for simulating steady-state properties of passive dendrites based on the cable theory
Authors: Yalcin Isler
Venue: Computer Methods and Programs in Biomedicine (2007)

In this study, a computer software, CableTeo, is introduced for simulating the steady-state electrical properties of passive dendrite based on the cable theory. The cable theory for dendritic neurons addresses to current-voltage relations in a continuous passive dendritic tree. It is briefly summarized that the cable theory related to passive cables and dendrites, which is a useful approximation and an important reference for excitable cases. The proposed software can be used to construct user-defined dendritic tree model. The user can define the model in detail, display the constructed dendritic tree, and examine the basic electrical properties of the dendritic tree using transfer impedance approach. The software addresses to ones who want to run simple simulations of the cable theory without need to any programming language skills or expensive software. It can also be used for educational purposes.
Swap-Aware Garbage Collection for NAND Flash Memory Based Embedded Systems
Authors: Ohhoon Kwon, Kern Koh
Venue: Proceedings of the 7th IEEE International Conference on Computer and Information Technology (2007)

Embedded systems use NAND flash memory as a secondary storage device because it has many attractive features such as small size, fast access speeds, shock resistance, and light weight. NAND flash memory based embedded systems exploit a "demand paging" to run applications and also use a "swapping" to extend a limited main memory space. Because the embedded systems use NAND flash memory as swap space, it should perform garbage collection, which is a time-consuming operation. Besides, the number of the erase operations allowed to each block is also limited. In this paper, we propose a new garbage collection policy for embedded systems with the swap system. The proposed garbage collection policy focuses on minimizing the garbage collection time and even wear-leveling. Trace-driven simulations show that the proposed policy performs better than existing garbage collection policies in terms of the garbage collection time and the endurance of flash memory.
Wavelength Assignment of Matrix Multiplication Communication Pattern on a Class of Regular Optical WDM Networks
Authors: Fang-ai LIU, Lei Xia
Venue: Proceedings of the 2007 IFIP International Conference on Network and Parallel Computing Workshops (2007)

Wavelength assignment is a key topic in optical WDM networks. How to realize different parallel communication patterns on optical interconnection networks is a hot research field. In this paper, we address the problem of wavelength assignment for realizing parallel matrix multiplication on a class of regular optical WDM networks. Based on the algorithm already proposed, a data partition pattern MRDR is proposed. Then the wavelength assignments of realizing parallel matrix multiplication communication pattern on WDM array, ring, mesh and double-loop network are discussed, and the wavelength numbers are also given, which are 2min(q,r)+2, min(q,r)+2,2 and 2 respectively for a q*r submatrixes.
Projecting XML documents
Authors: Amélie Marian, Jérôme Siméon
Venue: Proceedings of the 29th international conference on Very large data bases - Volume 29 (2003)

XQuery is not only useful to query XML in databases, but also to applications that must process XML documents as files or streams. These applications suffer from the limitations of current main-memory XQuery processors which break for rather small documents. In this paper we propose techniques, based on a notion of projection for XML, which can be used to drastically reduce memory requirements in XQuery processors. The main contribution of the paper is a static analysis technique that can identify at compile time which parts of the input document are needed to answer an arbitrary XQuery. We present a loading algorithm that takes the resulting information to build a projected document, which is smaller than the original document, and on which the query yields the same result. We implemented projection in the Galax XQuery processor. Our experiments show that projection reduces memory requirements by a factor of 20 on average, and is effective for a wide variety of queries. In addition, projection results in some speedup during query evaluation.
Direct data-driven recursive controller unfalsification with analytic update
Authors: Jeroen van Helvoort, Bram de Jager, Maarten Steinbuch
Venue: Automatica (Journal of IFAC) (2007)

Unfalsified control is a data-driven, plant-model-free controller design method, which recursively falsifies controllers that fail to meet the specified performance requirement. In ellipsoidal unfalsified control, the region of controllers that are unfalsified, the unfalsified set, is described by an ellipsoid. Due to the combination of the performance requirement and controller structure, the approximate update of the unfalsified set can be computed analytically, resulting in a computationally cheap algorithm. Conditions for stability of ellipsoidal unfalsified control are presented, and the effectiveness of the proposed algorithm is shown in a simulation.
On Uniquely Decipherable Codes with Two Codewords
Authors: R. V. Book
Venue: IEEE Transactions on Computers (1980)

It is shown that every uniquely decipherable code with just two codewords has finite delay. In addition, if a uniquely decipherable code with just two codewords is full, then it is trivial.
A relation-based method combining functional and structural testing for test case generation
Authors: Shaoying Liu, Yuting Chen
Venue: Journal of Systems and Software (2008)

Specification-based (or functional) testing enables us to detect errors in the implementation of functions defined in specifications, but since specifications are often incomplete in practice for some reasons (e.g., lack of ideas, no time to write), it is unlikely to be sufficient for testing all parts of corresponding programs. On the other hand, implementation-based (or structural) testing focuses on the examination of program structures, which allows us to test all parts of the programs, but may not be effective to show whether the programs properly implement the corresponding specifications. To perform a comprehensive testing of a program in practice, it is important to adopt both specification-based and implementation-based testing. In this paper we describe a relation-based test method that combines the specification-based and the implementation-based testing approaches. We establish a set of relations for test case generation, illustrate how the method is used with an example, and investigate the effectiveness and weakness of the method through an experiment on testing a software tool system.
A Multi-Stage Strategy to Perspective Rectification for Mobile Phone Camera-Based Document Images
Authors: X. C. Yin, J. Sun, S. Naoi, K. Fujimoto, Y. Fujii, K. Kurokawa, H. Takebe
Venue: Proceedings of the Ninth International Conference on Document Analysis and Recognition - Volume 02 (2007)

Document images captured by a mobile phone camera often have perspective distortions. Efficiency and accuracy are two important issues in designing a rectification system for such perspective documents. In this paper, we propose a new perspective rectification system based on vanishing point detection. This system achieves both the desired ef- ficiency and accuracy using a multi-stage strategy: at the first stage, document boundaries and straight lines are used to compute vanishing points; at the second stage, text base- lines and block aligns are utilized; and at the last stage, character tilt orientations are voted for the vertical vanish- ing point. A profit function is introduced to evaluate the reliability of detected vanishing points at each stage. If van- ishing points at one stage are reliable, then rectification is ended at that stage. Otherwise, our method continues to seek more reliable vanishing points in the next stage. We have tested this method with more than 400 images includ- ing paper documents, signboards and posters. The image acceptance rate is more than 98.5% with an average speed of only about 60ms.
Delay-dependent robust stability analysis for interval linear time-variant systems with delays and application to delayed neural networks
Authors: Zhong Zhang, Chuandong Li, Xiaofeng Liao
Venue: Neurocomputing (2007)

Some delay-dependent robust asymptotical stability criteria for uncertain linear time-variant systems with multiple delays are established by means of parameterized first-order model transformation and the transformation of the interval uncertainty into the norm-bounded uncertainty. The stable regions with respect to the delay parameters are also formulated. Based on these results, we investigate the stability issue of a class of delayed neural networks that can be transformed into linear time-variant systems, and then several new global asymptotical stability criteria are exploited. Numerical examples are presented to illustrate the effectiveness of our results.
Segmentation of Very Low Resolution Screen-Rendered Text
Authors: S. Wachenfeld, S. Fleischer, H.-U. Klein, X. Jiang
Venue: Proceedings of the Ninth International Conference on Document Analysis and Recognition - Volume 02 (2007)

The lower the resolution of a given text is, the more dif- ficult it becomes to segment it into single characters. The resolution of screen-rendered text can be very low. This pa- per focuses on smoothed screen-rendered text of very low resolution with typical x-heights of 4 to 7 pixels which is much lower than in other low resolution OCR situations. We propose a recognition-based segmentation algorithm which makes use of oversegmentation by dynamic programming, candidate rating by single character classifiers and a graph based search algorithm for an optimal cut sequence. The al- gorithm is described in detail and experimental results are presented which show the performance on example screen- shot images taken from the public Screen-Word database.
Soft Error Hardened Latch Scheme for Enhanced Scan Based Delay Fault Testing
Authors: Takashi IKEDA, Kazuteru NAMBA, Hideo ITO
Venue: Proceedings of the 22nd IEEE International Symposium on Defect and Fault-Tolerance in VLSI Systems (2007)

In recent high-density, high-speed and low-power VLSIs, soft errors (SEs) and delay faults (DFs) frequently occur. Therefore, SE hardened design and DF testing are essential. This paper proposes three types of scan flip-flops (FFs) which have SE tolerant capability and allow enhanced scan shifting for DF testing, i.e. arbitrary two-pattern testing. The slave latches used in these FFs are constructed by adding some extra transistors which make enhanced scan shifting possible for DF testing on an existing SE hardened latch. The areas and time overheads of the proposed latches are up to 33.3% and 31.4% larger than those of the existing SE hardened latch respectively. However, the areas of the proposed FFs are about 30% smaller than existing FFs which have SE tolerant capability and allow enhanced scan shifting for DF testing.
Application and development of palm print research
Authors: Yunyu Zhou, Yanjun Zeng, Lizhen, Wenlei Hu
Venue: Technology and Health Care (2002)

The palm print contains a great deal of information which is of great research and application value. This paper provides palm print research methods, application, and the relationship between the palm print and cancer.
The Effects of Modeling on Simulator Performance
Authors: Alexander Miczo, Dipti Mohapatra, Scott Perkins, Katie Kaufman, Ken Huang
Venue: IEEE Design Test (1987)

Gate-level simulators are usually thought of in terms of their benefits to logic designers, while behavioral simulators areconsidered to be the province of system architects. However, the behavioral modeling capabilities of a multilevel gate/behavioralsimulator significantly enhanced the performance and accuracy of what are essentially gate-level simulations. The Behave simulatoris a multilevel simulator that can simulate circuits at several levels of abstraction?behavioral level, gate level, or a mixture.Zero delay and rank order capability are also available in Behave and can be used to advantage. For example, in a simulationof an array multiplier involving 10,000 vectors, the time decreased from 16 hours to 38 minutes, simply because the elementswere rank ordered. This range of processing is possible because of the flexibility in software for general-purpose CPUs.