ppxscal/embedding_network huggingface dataset:
Continuing Education for the Computer Professional: * The Role of the Professional Society
Authors: R. Chattergy
Venue: Computer (1977)

Education-the structured part of it, at any rate-of a computer professional has traditionally ended with undergraduate training at a university. After that, and for the major part of his productive life, his learning seems to occur chiefly through peer group osmosis. This process is failing to keep pace with the rapid development of the computer industry.
SenCar: An Energy-Efficient Data Gathering Mechanism for Large-Scale Multihop Sensor Networks
Authors: Ming Ma, Yuanyuan Yang
Venue: IEEE Transactions on Parallel and Distributed Systems (2007)

In this paper, we propose a new data gathering mechanism for large scale multihop sensor networks. A mobile data observer, called SenCar, which could be a mobile robot or a vehicle equipped with a powerful transceiver and battery, works like a mobile base station in the network. SenCar starts the data gathering tour periodically from the static data processing center, traverses the entire sensor network, gathers the data from sensors while moving, returns to the starting point, and finally uploads data to the data processing center. Unlike SenCar, sensors in the network are static, and can be made very simple and inexpensive. They upload sensed data to SenCar when SenCar moves close to them. Since sensors can only communicate with others within a very limited range, packets from some sensors may need multihop relays to reach SenCar. We first show that the moving path of SenCar can greatly affect network lifetime. We then present heuristic algorithms for planning the moving path/circle of SenCar and balancing traffic load in the network. We show that by driving SenCar along a better path and balancing the traffic load from sensors to SenCar, network lifetime can be prolonged significantly. Our moving planning algorithm can be used in both connected networks and disconnected networks. In addition, SenCar can avoid obstacles while moving. Our simulation results demonstrate that the proposed data gathering mechanism can prolong network lifetime significantly compared to a network which has only a static observer, or a network in which mobile observer can only move along straight lines.
A Secure Authenticated Key Agreement Protocol For Wireless Security
Authors: Pierre E. Abi-Char, Abdallah Mhamed, Bachar El-Hassan
Venue: Proceedings of the Third International Symposium on Information Assurance and Security (2007)

Several protocols have been proposed to provide robust mutual authentication and key establishment for wireless local area network (WLAN). In this paper we present a new Secure Authenticated Key Agreement (SAKA) protocol that provides secure mutual authentication, key establishment and key confirmation over an untrusted network. The new protocol achieves many of the required security and performance properties. It can resist dictionary attacks mounted by either passive or active networks intruders. It can resist Man-In-The Middle attack, and Impersonate attack. It also offers perfect forward secrecy which protects past sessions and passwords against future compromise. In addition, it can resist known-key and resilience to server attack. Our proposed protocol combines techniques of challenge-response protocols with symmetric key agreement protocols and offers significantly improved performance in computational and communication load over comparably many authenticated key agreement protocols such as B-SPEKE, SRP, AMP, PAK-RY, PAK-X, SKA and LR-AKE.
Strong tractability of multivariate integration of arbitrary high order using digitally shifted polynomial lattice rules
Authors: Josef Dick, Friedrich Pillichshammer
Venue: Journal of Complexity (2007)

In this paper we prove the existence of digitally shifted polynomial lattice rules which achieve strong tractability results for Sobolev spaces of arbitrary high smoothness. The convergence rate is shown to be the best possible up to a given degree of smoothness of the integrand. Indeed we even show the existence of polynomial lattice rules which automatically adjust themselves to the smoothness of the integrand up to a certain given degree. Further we show that strong tractability under certain conditions on the weights can be obtained and that polynomial lattice rules exist for which the worst-case error can be bounded independently of the dimension. These results hold independent of the smoothness.
Advanced lexical ontologies and hybrid knowledge based systems: first steps to a dynamic legal electronic commentary
Authors: Erich Schweighofer, Doris Liebwald
Venue: Artificial Intelligence and Law (2007)

Legal Information Retrieval (IR) research has stressed the fact that legal knowledge systems should be sufficiently capable to interpret and handle the semantics of a database. Modeling (expert-) knowledge by using ontologies enhances the ability to extract and exploit information from documents. This contribution presents theories, ideas and notions regarding the development of dynamic electronic commentaries based on a comprehensive legal ontology.
Bloom Filters: One Size Fits All?
Authors: Paul Hurley, Marcel Waldvogel
Venue: Proceedings of the 32nd IEEE Conference on Local Computer Networks (2007)

Bloom filters impress by their sheer elegance and have become a widely and, perhaps, indiscriminately used tool in network applications, although, as we show, their performance can often be far from optimal. Notably in application areas where false negatives are tolerable, other techniques can clearly be better. We show that, at least for a specific area in the parameter space, Bloom filters are significantly outperformed even by a simple scheme. We show that many application areas where Bloom filters are deployed do not require the strong policy of no false negatives and sometimes even prefer false negatives. We analyze, through modelling, how far Bloom filters are from the optimal and then examine application specific issues in a distributed web caching scenario. We hope to open up and seed discussion towards domain-specific alternatives to Bloom filters while perhaps sparking ideas for a general-purpose alternative.
Online balancing of range-partitioned data with applications to peer-to-peer systems
Authors: Prasanna Ganesan, Mayank Bawa, Hector Garcia-Molina
Venue: Proceedings of the Thirtieth international conference on Very large data bases - Volume 30 (2004)

We consider the problem of horizontally partitioning a dynamic relation across a large number of disks/nodes by the use of range partitioning. Such partitioning is often desirable in large-scale parallel databases, as well as in peer-to-peer (P2P) systems. As tuples are inserted and deleted, the partitions may need to be adjusted, and data moved, in order to achieve storage balance across the participant disks/nodes. We propose efficient, asymptotically optimal algorithms that ensure storage balance at all times, even against an adversarial insertion and deletion of tuples. We combine the above algorithms with distributed routing structures to architect a P2P system that supports efficient range queries, while simultaneously guaranteeing storage balance.
Hierarchical Clustering for Software Architecture Recovery
Authors: Onaiza Maqbool, Haroon Babri
Venue: IEEE Transactions on Software Engineering (2007)

Abstract-Gaining an architectural level understanding of a software system is important for many reasons. When the description of a system's architecture does not exist, attempts must be made to recover it. In recent years, researchers have explored the use of clustering for recovering a software system's architecture, given only its source code. The main contributions of this paper are as follows. First, we review hierarchical clustering research in the context of software architecture recovery and modularization. Second, to employ clustering meaningfully, it is necessary to understand the peculiarities of the software domain, and the behavior of clustering measures and algorithms in this domain. To this end, we provide a detailed analysis of the behavior of various similarity and distance measures that may be employed for software clustering. Thirdly, we analyze the clustering process of various well-known clustering algorithms using multiple criteria, and show how arbitrary decisions taken by these algorithms during clustering affect the quality of their results. Finally, we present an analysis of two recently proposed clustering algorithms, revealing close similarities in their apparently different clustering approaches. Experiments on four legacy software systems provide insight into the behavior of well-known clustering algorithms, and their characteristics in the software domain.
The existence of periodic solutions for a class impulsive differential equations
Authors: Yanping Guo, Wei Xiang, Xiujun Liu
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 03 (2007)

This paper is devoted to study existence of multiple periodic positive solutions for a class of nonautonomous functional differential equations with impulse actions at fixed moments. The main results here is established by employing the theory of fixed point index in cones.
State-based Testing is Functional Testing
Authors: Florentin Ipate, Raluca Lefticaru
Venue: Proceedings of the Testing: Academic and Industrial Conference Practice and Research Techniques - MUTATION (2007)

Empirical studies report unsatisfactory fault detection of state-based methods in class testing and advocate the use of functional methods to complement state-based testing. In this paper, we take the view that the modest fault detection of state-based class testing reported in the literature is actually due to the inappropriate state diagram used. We show that functional testing of a class can be reduced to state-based testing, provided that the right state model is produced. We present a strategy for constructing a state diagram for a class method, based on a domain partition derived through functional techniques. We also describe a method for deriving test sequences from the resulting state diagrams, essentially a variant of the W-method. The paper also reports results from an experimental evaluation of the proposed approach, based on mutants generated by Mu- Java.
Equiprojective polyhedra
Authors: Masud Hasan, Anna Lubiw
Venue: Computational Geometry: Theory and Applications (2008)

A convex polyhedron P is equiprojective if, for some k, the orthogonal projection (or ''shadow'') of P in every direction, except those directions parallel to faces of P, is a k-gon. We address an open question posed by Shepherd and reported in Croft, Falconer, and Guy's ''Unsolved Problems in Geometry'', by characterizing equiprojective polyhedra, and giving an O(nlogn)-time recognition algorithm.
Design and Realization of CGI in Embedded Dynamic Web Technology
Authors: CHEN Tian-huang, HUANG Jia-xi
Venue: Proceedings of the 2007 IFIP International Conference on Network and Parallel Computing Workshops (2007)

A new method, CGI (Common Gateway Interface), based on CSP(C Language Service Page) was developed by analyzing the realized method of CGI as well as comparing the advantages and disadvantages. At last, according to this new approach, a new design of dynamic Web server based on S3C44B0X and uClinux was given, which was used to manage and control the embedded devices by browser connected to the Web server.
Research on Data Encryption Technology Based on Chaos Theory
Authors: Gannan Yuan, Fuyou Wang, Yanling Hao
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 01 (2007)

Data encryption is one of the active strategy of information security, which can provide strong protection. A chaos dynamic logistic model was chosen as the data encryption algorithm in this paper, then randomness, correlation, complexity of Logistic chaotic series were verified through power spectrum, Lyapunov exponent mathematical analysis and it meets the needs of cryptology. Meanwhile, in theory and experiment, we know this algorithm has high security and robustness, it can resist differential analysis and linearity cypher analysis.
Authors' Reply5
Authors: E. G. Henrichon
Venue: IEEE Transactions on Computers (1970)

The authors wish to thank G. W. Beakley and F. B. Tuteur for their identification of a source of difficulty in the analysis of the non- parametric procedure as originally proposed. We shall reexamine our analysis in the light of this new development and will report on any modifications at a later date.
Scalable rate control for video transmission over UMTS
Authors: Antonios Alexiou, Christos Bouras, Vaggelis Igglesis
Venue: International Journal of Communication Systems (2007)

This paper proposes a mechanism for the congestion control for video transmission over Universal Mobile Telecommunications System (UMTS). Our scheme is applied when the mobile user experiences real time multimedia content and adopts the theory of a widely accepted rate control method in wired networks, namely equation-based rate control. In this approach, the transmission rate of the multimedia data is determined as a function of the packet loss rate, the round trip time and the packet size and the server explicitly adjusts its sending rate as a function of these parameters. Through a number of simulations and experiments we validate the correctness and measure the performance and efficiency of the mechanism. A first level of evaluation is carried out using the ns-2 simulator. A second level then validates the proposed mechanism in real world traffic scenarios by performing experiments in a commercial UMTS network. Copyright &copy; 2006 John Wiley & Sons, Ltd.
Cooperative Keep-Alives: An Efficient Outage Detection Algorithm for P2P Overlay Networks
Authors: Ivan Dedinski, Alexander Hofmann, Bernhard Sick
Venue: Proceedings of the Seventh IEEE International Conference on Peer-to-Peer Computing (2007)

One of the challenges of today's overlay networks, especially P2P, is still scalability. A key issue in almost all of the current overlay architectures is the link count per single node. If the link count is too high, the management overhead in terms of keep-alive messages increases. If the amount of links per node is too low, the resilience of the system against network splits decreases and the system can hardly route in an optimal way. Moreover, if keep-alive messages are not sent frequently enough, outdated information could be propagated, which again could cause net splits. This paper presents a new cooperative keep-alive algorithm that strongly reduces the costs for sending keepalive messages and, at the same time, preserves the effectiveness and reliability of standard keep-alive mechanisms in today's overlay networks. The algorithm allows to increase the number of links per node, and, thus, to improve the connectivity and routing efficiency in the network, while keeping the keep-alive overhead low. When used without increasing the link count, the algorithm reduces drastically the keep-alive traffic. The properties of the algorithm are evaluated analytically and simulatively and compared to existing keep-alive techniques.
An AOP Extended Lambda-Calculus
Authors: Dima Alhadidi, Nadia Belblidia, Mourad Debbabi, Prabir Bhattacharya
Venue: Proceedings of the Fifth IEEE International Conference on Software Engineering and Formal Methods (2007)

This paper presents an implicitly-typed functional, aspect-oriented programming language: AOP. The main contribution of the paper is a semantics for AOP advice weaving. The weaving is type-based and implemented statically. We extend the Hindley-Milner type inference system to inject applicable advices into lambda expressions during typing. The proposed semantics for advice weaving is close to the spirit of AspectJ, the most popular AOP language, where advices are injected before, after, or around points that match their respective pointcuts. For this purpose, the sequence construct of the extended calculus is used.
Sampling numbers and function spaces
Authors: Jan Vybíral
Venue: Journal of Complexity (2007)

We want to recover a continuous function f:(0,1)^d->C using only its function values. Let us assume, that f is from the unit ball of some function space (for example a fractional Sobolev space or a Besov space) and the precision of the reconstruction is measured in the norm of another function space of this type. We describe the rate of convergence of the optimal sampling method (linear as well as nonlinear) in this setting.
Visualization of Message Races in MPI Parallel Programs
Authors: Mi-Young Park, Nguyen Cao Truong Hai, Yong-Kee Jun, Hyuk-Ro Park
Venue: Proceedings of the 7th IEEE International Conference on Computer and Information Technology (2007)

As parallel programs become larger and more complex, it is harder to understand and debug parallel programs. If those programs have race conditions, intended or other- wise, it is more difficult to understand and debug. Visual- ization is widely accepted as a powerful technique to un- derstand and manage the complexity of parallel programs as well as to detect race conditions. This paper presents a new visualization tool for debugging race conditions in message-passing programs. Our visualization aims to pro- vide effective and useful visualization for programmers to understand complex phenomena such as the interaction of concurrent processes, to handle enormous visual informa- tion, and to debug message races in MPI parallel programs.
A Hybrid Model for Hydroturbine Generating Unit Trend Analysis
Authors: Min Zou, Jianzhong Zhou, Zhong Liu, Liangliang Zhan
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 02 (2007)

According to the nonlinear and nonstationary characteristics of hydroelectricity systems, an hybrid prediction model based on wavelet transform and support vector machines is proposed in this paper for the trend analysis of hydroturbine generating unit (HGU). Firstly, the nonlinear and nonstationary time series are decomposed through wavelet transform into several subseries with obvious tendency characteristics. Then the tendency of these subseries is forecasted respectively with least squares support vector machines (LS-SVM), an extension of standard support vector machines, in which the kernel functions and model parameters are chosen appropriately. Finally, these prediction outputs are summed as the prediction results of original time series. The hybrid prediction model is applied in the peak-peak value of vibration time series of some HGU. The comparison between method based only on LS-SVM and hybrid model shows that the performance of hybrid method outperforms the former.
The neuronal correlate of bidirectional synesthesia: A combined event-related potential and functional magnetic resonance imaging study
Authors: Roi Cohen Kadosh, Kathrin Cohen Kadosh, Avishai Henik
Venue: Journal of Cognitive Neuroscience (2007)

The neuronal correlate of a rare explicit bidirectional synesthesia was investigated with numerical and physical size comparison tasks using both functional magnetic resonance imaging and event-related potentials. Interestingly, although participant I.S. exhibited similar congruity effects for both tasks at the behavioral level, subsequent analyses of the imaging data revealed that different brain areas were recruited for each task, and in different time windows. The results support: (1) the genuineness of bidirectional synesthesia at the neuronal level, (2) the possibility that discrepancy in the neuronal correlates of synesthesia between previous studies might be task-related, and (3) the possibility that synesthesia might not be a unitary phenomenon.
Fault Diagnosis of Power Transformers Based on BP Network with Clonal Selection Algorithm
Authors: Chenhao Wang, Huixian Huang, Yewei Xiao, Weiwei Li
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 02 (2007)

In this paper, a novel approach based on BP network (BPN) for fault diagnosis of power transformers is proposed. Optimization of BPN weights is achieved by using clonal selection algorithms (CSA). In addition, the mutation probability is adjusted adaptively according to the affinity of antibody. Compared with previous approaches, this one can avoid prematurity effectively, with good self-learning and self-memory ability. The experiment results show that the presented approach outperforms previous ones in both classification accuracy and computational efficiency.
Shared Cache for Multiple-Stream Computer Systems
Authors: P. C. C. Yeh
Venue: IEEE Transactions on Computers (1983)

Cache memory organization for parallel-pipelined multiprocessor systems is evaluated. Private caches have a cache coherence problem. A shared cache avoids this problem and can attain a higher hit ratio due to sharing of single copies of common blocks and dynamic allocation of cache space among the processes. However, a shared cache suffers performance degradation due to access conflicts.
A Statistical Approach to the Computation of Delays in Logic Circuits
Authors: H. D. Schnurmann, K. Maling
Venue: IEEE Transactions on Computers (1969)

This paper describes a method whereby multiple regression techniques are used to predict the delay between input and output signals through a combinatorial logic chain.
Ant Colony Optimization: Introduction and Hybridizations
Authors: Christian Blum
Venue: Proceedings of the 7th International Conference on Hybrid Intelligent Systems (2007)

This paper contains complimentary material to the tutorial "ant colony optimization: introduction and hybridizations" given by the author at HIS 2007, Kaiserslautern, Germany. First, ant colony optimization is shortly introduced. Then, successful recent hybridizations of ant colony optimization algorithms with other techniques for optimization are reviewed.
Comparison of Two Feature Selection Methods in Intrusion Detection Systems
Authors: M. J. Fadaeieslam, B. Minaei-Bidgoli, M. Fathy, M. Soryani
Venue: Proceedings of the 7th IEEE International Conference on Computer and Information Technology (2007)

The quality of features directly affects the performance of classification. Many feature selection methods introduced to remove redundant and irrelevant features, because raw features may reduce accuracy or robustness of classification. In this paper we proposed a new method for feature selection based on Decision Dependent Correlation (DDC). We have used SVM classifier and the results on DARPA KDD99 benchmark dataset indicate that the proposed method outperforms Principal Component Analysis (PCA).
Browsing Zoomable Treemaps: Structure-Aware Multi-Scale Navigation Techniques
Authors: Renaud Blanch, Eric Lecolinet
Venue: IEEE Transactions on Visualization and Computer Graphics (2007)

Treemaps provide an interesting solution for representing hierarchical data. However, most studies have mainly focused on layout algorithms and paid limited attention to the interaction with treemaps. This makes it difficult to explore large data sets and to get access to details, especially to those related to the leaves of the trees. We propose the notion of *zoomable treemaps* (ZTMs), an hybridization between treemaps and zoomable user interfaces that facilitates the navigation in large hierarchical data sets. By providing a consistent set of interaction techniques, ZTMs make it possible for users to browse through very large data sets (e.g., 700,000 nodes dispatched amongst 13 levels). These techniques use the structure of the displayed data to guide the interaction and provide a way to improve interactive navigation in treemaps.
The Rolm Computerized Branch Exchange: An Advanced Digital PBX
Authors: J. M. Kasson
Venue: Computer (1979)

The private branch exchange, employing pulse-code modulation and computer-controlled time-division multiplexing, is an increasingly popular tool for enhancing the flexibility and reducing the cost of business telephone operations.