ppxscal/embedding_network huggingface dataset:
Maryanski's Grammatical Inferencer
Authors: B. R. Gaines
Venue: IEEE Transactions on Computers (1979)

A recent paper in this TRANSACTIONS1on an automatic inference procedure for probabilistic grammars contained major anomalies between the technique proposed and the computational examples given. These would mislead others attempting to reproduce the results and also undermine the apparent validity of what is in fact a sound technique. This letter details and corrects the anomalies.
Applying Expert Experience to Interpretable Fuzzy Classification System Using Genetic Algorithms
Authors: Ji-Dong Li, Xue-Jie Zhang, Yun-Shan Chen
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 02 (2007)

Accuracy and interpretability are two important objectives in the design of fuzzy classification system. In many real-world applications, expert experiences usually have good interpretability, but their accuracy is not always high. Applying expert experiences to fuzzy classification system can obtain better accuracy and preserve interpretability. In this paper, we present a method to translate expert experiences into fuzzy sets by similarity measure. Meanwhile reasonable experiences are integrated into a fuzzy genetic-based learning mechanism. Finally, experimental results with performance evaluation on benchmark classification problems demonstrate that the learning mechanism is able to achieve accurate performance for interpretable fuzzy classification systems.
Study and Implementation of a Improved Group Key Protocol for Mobile Ad Hoc Networks
Authors: Qiuna Niu
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 01 (2007)

In Ad Hoc networks it is very difficult to gain the same security as wired networks without the support of infrastructure. To save network's resources, a group key agreement method using ECDH (Elliptic Curve Diffie- Helleman) based on GDH.3 (Group Diffie-Hellman) protocol is presented, replacing original Diffie-Hellman in GDH.3. Using ECDH in GDH.3 does not change the security performance that's inherence for GDH.3, but it could save network resource consumption during key agreement. How to implement the improved protocol and the simulation environment are given subsequently. Results from that illustrate the correctness of proposed method.
A new JAVA interface implementation of THESIAS
Authors: D. A. Tregouet, V. Garelle
Venue: Bioinformatics (2007)

Summary: THESIAS (Testing Haplotype EffectS In Association Studies) is a popular software for carrying haplotype association analysis in unrelated individuals. In addition to the command line interface, a graphical JAVA interface is now proposed allowing one to run THESIAS in a user-friendly manner. Besides, new functionalities have been added to THESIAS including the possibility to analyze polychotomous phenotype and X-linked polymorphisms. Availability: The software package including documentation and example data files is freely available at http://genecanvas.ecgene.net. The source codes are also available upon request. Contact: david.tregouet@chups.jussieu.fr
Performance evaluation of a new backoff method for IEEE 802.11
Authors: Hadi Minooei, Hassan Nojumi
Venue: Computer Communications (2007)

Since DCF is the main protocol of accessing other mobile stations in ad hoc networks such as IEEE 802.11 WLANs, a self-controlling method for each station is necessary, called the backoff algorithm. An exponential backoff method has been used in WLANs and significant efforts have been made to analyze its throughput and other important properties such as delay and jitter. In this article, we propose a new backoff algorithm and model it with a discrete-time Markov chain; measuring its saturation throughput under several conditions and several set of parameters which are to be adjusted according to the network condition, with the aim of approaching maximum throughput when stations are saturated.
Analysis of Asynchronous Circuits Under Different Delay Assumptions
Authors: G. G. Langdon
Venue: IEEE Transactions on Computers (1968)

Abstract Asynchronous circuits are analyzed from the stand- point of different constraints which may apply to the stray delays (zero-line delays, bounded delays, and the use of delay elements). The relationship between "hazard-free" sequential networks and "speed independent" circuits is illuminated. Speed independence is defined relative to a fundamental mode circuit (which in turn may be described by a flow table); the analysis is carried out from this stand- point. The allowed sequence graph may be used to detect critical races. A circuit is seen to be speed independent if and only if its circuit-derived excitation matrix has no 1-input change critical races. The generalization of the essential hazard has been studied in detail and is shown to be an obstacle to hazard-free realizations when line delays can be arbitrarily large.
The Hall-Janko graph and the Witt system W10
Authors: Naoyuki Horiguchi, Masaaki Kitazume, Hiroyuki Nakasora
Venue: European Journal of Combinatorics (2008)

In this paper, we consider a relation between the Hall-Janko graph and the Witt system W"1"0. We will reconstruct the Hall-Janko graph from the group 3.S"6 and the hexacode.
Route Investigation for Secure Routing in Mobile Ad-hoc Networks
Authors: Han-Shik Kim, Byung-Seok Kang, Sangheon Pack, Chul-Hee Kang
Venue: Proceedings of the The International Conference on Emerging Security Information, Systems, and Technologies (2007)

Secure routing protocols in Mobile ad-hoc networks (MANET) have been extensively studied in recent years. Most Routing Protocol, however, are based on authentication, cryptographic schemes, security association and key distribution and so on. In this paper, we propose an enhanced MANET routing protocol, which prevents security threats, especially by employing route investigation. When an intermediate node that is on a path between source and destination receives two types of control messages (RREP and RERR), the intermediate node sends them to the source in pure AODV. However, in our method, the node which receives the control messages confirms it using Route Investigation Request (IREQ) and Route Investigation Reply (IREP). Through this investigation procedure, we can gain reliability of path for transmitting data packets in MANET. Simulation results show considerable improvement in the packet delivery ratio and the end-to-end latency at the expense of the moderate increase of control message overhead.
Transactional issues in sensor data management
Authors: Levent Gürgen, Claudia Roncancio, Cyril Labbé, Vincent Olive
Venue: Proceedings of the 3rd workshop on Data management for sensor networks: in conjunction with VLDB 2006 (2006)

This paper presents a novel research direction in the field of sensor data management. It concerns transactional support in heterogeneous large scale sensor systems. Besides well-known continuous queries on sensor data, system management queries should be supported in these systems. Indeed, with increasing capacity and diversity of sensors, new applications which require complex read-only and update queries are likely to appear. Those applications will require challenging properties such as ACID properties. This paper discusses the relevance of ACID properties in sensor data management context. It then focuses on the isolation property and proposes a concurrency control mechanism to support concurrent execution of continuous queries and update transactions on sensor properties.
Cellular-Logic Devices: Concepts and Applications
Authors: S. Y. W. Su
Venue: Computer (1979)

Cellular-logic devices, using a parallel processing element for each element of a rotating memory, allow fast data search and manipulation.
Latency evaluation of networking mechanisms for game traffic
Authors: Szabolcs Harcsik, Andreas Petlund, Carsten Griwodz, Pål Halvorsen
Venue: Proceedings of the 6th ACM SIGCOMM workshop on Network and system support for games (2007)

Large improvements in computer technology allow thousands of users to concurrently interact in a virtual game. Due to this development, the body of work analyzing game traffic has grown considerably in the recent past. However, little work has been done to examine and compare networking techniques with respect to meeting the stringent latency requirements that are common for networked games. Most interactive games need response times between 100 and 1000 ms depending on the game genre [6]. In this paper, we evaluate different techniques for delivering packets in a timely manner. In particular, we compare existing user-space middleware running on top of UDP and reliable, fair transport protocols like TCP and SCTP. In addition, we evaluate some "low latency" extensions to TCP, SCTP and one of the middleware platforms. We present results concerning packet latency and bandwidth requirements for the different approaches.
An End-to-End Solution to Scalable Unstructured P2P Networking
Authors: Nima Sarshar, Vwani P. Roychowdhury
Venue: Proceedings of the Seventh IEEE International Conference on Peer-to-Peer Computing (2007)

Despite many improvements on original unstructured P2P networks, these systems still suffer from many problems, the most important of which are, (a) lack of guarantees on the integrity of the network topology in the face of churns, (b) excessive traffic cost, and (c) poor quality of search results. This paper introduces an end-to-end scalable unstructured P2P networking solution called SUPNET to address many of these issues. The solution consists of two sub-protocols, SUPNETT and SUPNET-S, which are, respectively, responsible for network management and search. We investigate the end-to-end performance of our solution, both analytically and empirically. SUPNET-T is a scalable, highly robust protocol, capable of utilizing the heterogenous distribution of network resources. The high stability of SUPNET-T is the result of implementation of a novel distributed feedback mechanism. SUPNET-S, on the other hand, is capable of locating every item, even if a single copy of that item exists in the network. SUPNET-S does this while producing a traffic that scales provably sub-linear with the network size. The protocol also contains mechanisms for efficient search of popular items as well as distributed tuning algorithms. All this, along with a relative ease of implementation and a solid analytical foundation, make SUPNET a compelling solution for unstructured P2P networking.
Security Requirements Elicitation via Weaving Scenarios Based on Security Evaluation Criteria
Authors: Hiroya Itoga, Atsushi Ohnishi
Venue: Proceedings of the Seventh International Conference on Quality Software (2007)

Software is required to comply with the laws and standards of software security. However, stakeholders with less concern regarding security can neither de- scribe the behaviour of the system with regard to secu- rity nor validate the system's behaviour when the secu- rity function conflicts with usability. Scenarios or use- case specifications are common in requirements elici- tation and are useful to analyse the usability of the system from a behavioural point of view. In this paper, the authors propose a method to weave scenario frag- ments based on security evaluation criteria into sce- narios. The experiments showed that the weaving method led to a better scenario than the method in- volving writing or modifying the scenario with refer- ence to security evaluation criteria. Keywords: requirements elicitation, security require- ments, scenario analysis, aspect-oriented software de- velopment
Automatic Recognition of Chemical Images
Authors: Maria-Elena Algorri, Marc Zimmermann, Martin Hofmann-Apitius
Venue: Proceedings of the Eighth Mexican International Conference on Current Trends in Computer Science (2007)

Images of chemical molecules can be produced, manipulated, simulated and analyzed using sophisticated chemical software. However, in the process of publishing such images into scientific literature, all their chemical significance is lost. Although images of chemical molecules can be easily analyzed by the human expert, they cannot be fed back into chemical software and loose much of their potential use. We have developed a system that can automatically reconstruct the chemical information associated to the images of chemical molecules thus rendering them computer readable. We have benchmarked our system against a commercially available product and have also tested it using chemical databases of several thousand images with very encouraging results.
Local Discriminant Wavelet Packet Coordinates for Face Recognition
Authors: Chao-Chun Liu, Dao-Qing Dai, Hong Yan
Venue: The Journal of Machine Learning Research (2007)

Face recognition is a challenging problem due to variations in pose, illumination, and expression. Techniques that can provide effective feature representation with enhanced discriminability are crucial. Wavelets have played an important role in image processing for its ability to capture localized spatial-frequency information of images. In this paper, we propose a novel local discriminant coordinates method based on wavelet packet for face recognition to compensate for these variations. Traditional wavelet-based methods for face recognition select or operate on the most discriminant subband, and neglect the scattered characteristic of discriminant features. The proposed method selects the most discriminant coordinates uniformly from all spatial frequency subbands to overcome the deficiency of traditional wavelet-based methods. To measure the discriminability of coordinates, a new dilation invariant entropy and a maximum a posterior logistic model are put forward. Moreover, a new triangle square ratio criterion is used to improve classification using the Euclidean distance and the cosine criterion. Experimental results show that the proposed method is robust for face recognition under variations in illumination, pose and expression.
Solid-State Area Scanning Arrays as Interface Devices Between Optical and Digital Computing Systems-A Simulation Study
Authors: P. Stucki
Venue: IEEE Transactions on Computers (1975)

This paper describes how, in spite of occasional performance limitations generally due to process defects, large-area solid-state image sensors can be applied to scan pictorial data. First, it is estimated to what extent the direct imaging of pictorial matter onto a defective area-scanning device for acceptable scanning quality is possible. A novel concept is then proposed in which the optically generated Fourier-transform hologram of a picture rather than the picture itself is imaged onto a defective solid-state photosensitive array, scanned, digitized, filtered, and reconstructed by fast Fourier transform (FFT) techniques on a digital processor. The operating principle is discussed and the effects of scanner defects, digitization, and filtering on the scanning quality are investigated by computer simulation.
Effect of packing on the cluster nature of C nanotubes: An information entropy analysis
Authors: Francisco Torrens, Gloria Castellano
Venue: Microelectronics Journal (2007)

The possibility of the existence of single-wall carbon nanotubes (SWNTs) in organic solvents in the form of clusters is discussed. A theory is developed based on a bundlet model for clusters, which enables describing the distribution function of clusters by size. Comparison of the calculated values of solubility with experiments would permit obtaining energetic parameters characterizing the interaction of an SWNT with its surrounding, in a solid or solution. Fullerenes and SWNTs are unique objects, whose behaviour in many physical situations is characterized by remarkable peculiarities. Peculiarities in solutions show up first in that fullerenes and SWNTs represent the only soluble forms of carbon, what is related to the originality in the molecular structure of fullerenes and SWNTs. The fullerene molecule is a virtually uniform closed spherical or spheroidal surface, and an SWNT is a smooth cylindrical unit. Both structures give rise to the relatively weak interaction between the neighbouring molecules in a crystal and promote interaction of the molecules with those of a solvent. Another peculiarity in solutions is related to their trend to form clusters, consisting of a number of fullerene molecules or SWNTs. The energy of interaction of a fullerene molecule or SWNT with solvent molecules is proportional to the surface of the former molecule and roughly independent of the orientation of solvent molecules. All these phenomena have a unified explanation in the framework of the bundlet model of a cluster, in accordance with which the free energy of an SWNT involved in a cluster is combined from two components, viz. a volume one proportional to the number of molecules n in a cluster, and a surface one proportional to n^1^/^2. Algorithms for classification are proposed based on the criteria information entropy and its production. Many classification algorithms are based on information entropy. When applying these procedures to sets of moderate size, an excessive number of results appear compatible with data, and this number suffers a combinatorial explosion. However, after the equipartition conjecture, one has a selection criterion between different variants resulting from classification between hierarchical trees. According to this conjecture, for a given charge or duty, the best configuration of a flowsheet is the one in which the entropy production is most uniformly distributed. Information entropy, cluster and principal component analyses agree.
The Case for Dynamic Execution on Dynamic Hardware
Authors: Charles Ross, Wim Bohm
Venue: Proceedings of the 15th Annual IEEE Symposium on Field-Programmable Custom Computing Machines (2007)

We present a dynamic dataflow execution model, called the Aggregated Hierarchical Abstract Hardware Architecture (or AHAHA), for use in FPGA based appli- cations. High level language implementations targetting FPGAs use either handshaking or control-path solutions to schedule computations. Among the handshaking vari- ety are the Compaan VHDL Visitor [1]; the control-path solution uses a simplified form of handshaking which op- erates only in the same direction as the data flows and is used for example in MAP-C[2].
Unsupervised Alternating Projection Neural Network with Convex Constraint
Authors: Hengqing Tong, Tianzhen Liu, Yang Liu, Qiaoling Tong
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 01 (2007)

Alternating projection neural networks(APNN) have been researched for many years. This paper proposes a kind of APNN which is also a unsupervised neural network(UAPNN) with convex constraint. A linear regression model with unknown dependent variable and constrained regression coefficients is constructed. The dependent variables of the model is unknown, but it can be expressed as a linear combination according to the evaluation groups. The main characteristics of the samples are learned after training. In order to realize unsupervised learning of the neural network with convex constraint, an iterative computation method that makes use of alternating projection between two convex sets is proposed. The final example shows that the computation converges very fast.Our work may enrich the theory of neural network and also expand the evaluation method.
Reducing Spatial Resolution for MPEG-4 / H.264 Transcoding with Efficient Motion Reusing
Authors: Toan Nguyen Dinh, JaeMyung Yoo, Sungchan Park, GueeSang Lee, June-Young Chang, Han-Jin Cho
Venue: Proceedings of the 7th IEEE International Conference on Computer and Information Technology (2007)

when the output video should be converted to a lower resolution video. In this paper, we present a fast MPEG-4 Simple Profile (SP) to H.264 transcoder with reducing spatial resolution from CIF to QCIF video format. Based on frame image characteristics and motion information in MPEG-4 decoder, we limit motion modes, generate prediction motion vectors and build an adaptive search range for motion estimation in H.264 encoder. Simulation results show that our transcoder reduces transcoding time considerably while video quality is kept almost optimal. Index Terms------MPEG-4, H.264, transcoder, motion estimation, spatial downscale, PSNR
Registers for phase difference based logic
Authors: D. Shang, A. Yakovlev, A. Koelmans, D. Sokolov, A. Bystrov
Venue: IEEE Transactions on Very Large Scale Integration (VLSI) Systems (2007)

A logic design style known as phase difference-based logic (PDBL) has several benefits with respect to security and testing. An existing design method for PDBL circuits has so far been lacking an important component, a register. In this paper, we present the design of a speed independent PDBL register and a timed PDBL register, which can be used in asynchronous or synchronous circuits. Comparisons are presented in terms of speed, size, and power consumption.
Combining Genetic Algorithm and Simulation for the Mixed-Model Assembly Line Balancing Problem
Authors: Ping Su, Ye Lu
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 04 (2007)

In this paper, the mixed-model assembly line balancing problem is addressed. The aim of the research is to smooth the workload balance within each workstation. A genetic algorithm is proposed to search a solution of the assignment of tasks for line balancing problem. Based on the solution of the assignment of tasks, the optimal sequence for different models to minimize cycle time of the line is solved with a genetic algorithm. The farther research on line balancing problem is carried out with simulation experiment. A numerical example is used to illustrate the approach proposed in this paper, and it shows that the approach is efficient for the mixed-model assembly line balancing problem.
A comparative analysis of online grocery pricing in Singapore
Authors: Lydia Gan, Shujia He, Tingli Huang, Jiebin Tan
Venue: Electronic Commerce Research and Applications (2007)

Our study of the pricing strategies of the dot-bams (brick-and-mortars) and dot-coms of the grocery trade in Singapore differs from other empirical studies. Dot-coms were found to exhibit higher price dispersion than the dot-bams which can be explained by the different marketing strategies of the two types of retailers. We also found that dot-bams change their prices more frequently than the dot-coms, thus implying that online markets will not always have lower menu costs. Moreover, we found no statistically significant difference between the average price level of dot-bams and that of the dot-coms, suggesting that price convergence occurs due to reduced search costs among consumers and thus lower information asymmetries in the grocery market.