ppxscal/embedding_network huggingface dataset:
Sigma encoded inverted files
Authors: Andrew Trotman, Vikram Subramanya
Venue: Proceedings of the sixteenth ACM conference on Conference on information and knowledge management (2007)

Compression of term frequency lists and very long document-id lists within an inverted file search engine are examined. Several compression schemes are compared including Elias γ and δ codes, Golomb Encoding, Variable Byte Encoding, and a class of word-based encoding schemes including Simple-9, Relative-10 and Carryover-12. It is shown that these compression methods are not well suited to compressing these kinds of lists of numbers. Of those tested, Carryover-12 is preferred because it is both effective at compression and fast at decompression. A novel technique, Sigma Encoding prior to compression, is proposed and tested. Sigma Encoding utilizes a parameterized dictionary to reduce the number of bits necessary to store an integer. This method shows an about 0.3 bit per integer improvement over Carryover-12 while costing only about 3 extra clock cycles per integer to decompress.
Nonsmooth Optimization Techniques for Semisupervised Classification
Authors: Annabella Astorino, Antonio Fuduli
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2007)

We apply nonsmooth optimization techniques to classification problems, with particular reference to the TSVM (Transductive Support Vector Machine) approach, where the considered decision function is nonconvex and nondifferentiable and then difficult to minimize. We present some numerical results obtained by running the proposed method on some standard test problems drawn from the binary classification literature.
Large scale genotype–phenotype correlation analysis based on phylogenetic trees
Authors: Farhat Habib, Andrew D. Johnson, Ralf Bundschuh, Daniel Janies
Venue: Bioinformatics (2007)

We provide two methods for identifying changes in genotype that are correlated with changes in a phenotype implied by phylogenetic trees. The first method, VENN, works when the number of branches over which the change occurred are modest. VENN looks for genetic changes that are completely penetrant with phenotype changes on a tree. The second method, CCTSWEEP, allows for a partial matching between changes in phenotypes and genotypes and provides a score for each change using Maddison's concentrated changes test. The mutations that are highly correlated with phenotypic change can be ranked by score. We use these methods to find SNPs correlated with resistance to Bacillus anthracis in inbred mouse strains. Our findings are consistent with the current biological literature, and also suggest potential novel candidate genes. Contact:farhat@pacific.mps.ohio-state.edu for software requests.
Teaching Computer Structures
Authors: Z. G. Vranesic
Venue: Computer (1980)

The proliferation of microprocessors has intensified the demand for graduates who have had strong course work in the practical hardware details of computer organization.
Simulation and experimental results on the forward J-V characteristic of Al implanted 4H-SiC p-i-n diodes
Authors: Francesco G. Della Corte, Fortunato Pezzimenti, Roberta Nipoti
Venue: Microelectronics Journal (2007)

In this work the forward J-V characteristics of 4H-SiC p-i-n diodes are analysed by means of a physics based device simulator tuned by comparison to experimental results. The circular devices have a diameter of 350@mm. The implanted anode region showed a plateau aluminium concentration of 6x10^1^9cm^-^3 located at the surface with a profile edge located at 0.2@mm and a profile tail crossing the n-type epilayer doping at 1.35@mm. Al atom ionization efficiency was carefully taken into account during the simulations. The final devices showed good rectifying properties and at room temperature a diode current density close to 370A/cm^2 could be measured at 5V. The simulation results were in good agreement with the experimental data taken at temperatures up to about 523K in the whole explored current range extending over nine orders of magnitude. Simulations also allowed to estimate the effect of a different p^+ doping electrically effective profile on the device current handling capabilities.
Crown Structures for Vertex Cover Kernelization
Authors: Faisal N. Abu-Khzam, Michael R. Fellows, Michael A. Langston, W. Henry Suters
Venue: Theory of Computing Systems (2007)

Crown structures in a graph are defined and shown to be useful in kernelization algorithms for the classic vertex cover problem. Two vertex cover kernelization methods are discussed. One, based on linear programming, has been in prior use and is known to produce predictable results, although it was not previously associated with crowns. The second, based on crown structures, is newer and much faster, but produces somewhat variable results. These two methods are studied and compared both theoretically and experimentally with each other and with older, more primitive kernelization algorithms. Properties of crowns and methods for identifying them are discussed. Logical connections between linear programming and crown reductions are established. It is shown that the problem of finding an induced crown-free subgraph, and the problem of finding a crown of maximum size in an arbitrary graph, are solvable in polynomial time.
Birdsong recognition using prediction-based recurrent neural fuzzy networks
Authors: Chia-Feng Juang, Tai-Mou Chen
Venue: Neurocomputing (2007)

Automatic birdsong recognition using prediction-based singleton-type recurrent neural fuzzy networks (SRNFNs) is proposed in this paper. The recognition task consists of two stages. The first stage segments a significant portion from a birdsong sequence and the second stage performs recognition. For birdsong segmentation, an easy but effective segmentation approach based on time domain energy is proposed. For recognition, the linear predictive coding (LPC) coefficients of each frame in a segmented birdsong are extracted and used as features. These features are fed as inputs to SRNFN recognizers. The SRNFN is constructed by recurrent fuzzy if-then rules with fuzzy singletons in the consequences, and its recurrent aspect makes it suitable for processing patterns with temporal characteristics. In birdsong recognition, the sample prediction technique is used, where one SRNFN is responsible for learning the temporal birdsong relationships of only one species. The prediction error of each SRNFN is then used as a criterion for recognition. Experiments with 10 species of birds and their songs are performed, and a high recognition rate is achieved. Comparisons with a Takagi-Sugeno-Kang (TSK)-type recurrent fuzzy network (TRFN) and backpropagation neural network are also made in the experiments.
Adaptive query processing: why, how, when, what next?
Authors: Amol Deshpande, Zachary Ives, Vijayshankar Raman
Venue: Proceedings of the 33rd international conference on Very large data bases (2007)

Adaptive query processing has been the subject of a great deal of recent work, particularly in emerging data management environments such as data integration and data streams. We provide an overview of the work in this area, identifying its common themes, laying out the space of query plans, and discussing open research problems. We discuss why adaptive query processing is needed, how it is being implemented, where it is most appropriately used, and finally, what next, i.e., open research problems.
Defect Detection Efficiency: Test Case Based vs. Exploratory Testing
Authors: Juha Itkonen, Mika V. Mantyla, Casper Lassenius
Venue: Proceedings of the First International Symposium on Empirical Software Engineering and Measurement (2007)

This paper presents a controlled experiment comparing the defect detection efficiency of exploratory testing (ET) and test case based testing (TCT). While traditional testing literature emphasizes test cases, ET stresses the individual tester's skills during test execution and does not rely upon predesigned test cases. In the experiment, 79 advanced software engineering students performed manual functional testing on an open-source application with actual and seeded defects. Each student participated in two 90-minute controlled sessions, using ET in one and TCT in the other. We found no significant differences in defect detection efficiency between TCT and ET. The distributions of detected defects did not differ significantly regarding technical type, detection difficulty, or severity. However, TCT produced significantly more false defect reports than ET. Surprisingly, our results show no benefit of using predesigned test cases in terms of defect detection efficiency, emphasizing the need for further studies of manual testing.
Hardware implementation of a novel genetic algorithm
Authors: Z. Zhu, D. J. Mulvaney, V. A. Chouliaras
Venue: Neurocomputing (2007)

This paper introduces a novel genetic algorithm whose features have been purposely designed to be suited to hardware implementation. This is distinct from previous hardware designs that have been realized directly from conventional genetic algorithm approaches. To be suitable for hardware implementation, we propose that a genetic algorithm should attempt to both minimize final layout dimensions and reduce execution time while remaining a valid implementation. Consequently, the new genetic algorithm specifically aims to keep the requisite silicon area to a minimum by incorporating a monogenetic strategy that retains only the optimal individual, resulting in a dramatic reduction in the memory requirement and obviating the need for crossover circuitry. The results given in this paper demonstrate that new approach improves on a number of existing hardware genetic algorithm implementations in terms of the quality of the solution produced, the calculation time and the hardware component requirements.
The development of a collaborative learning environment through the TE3 funding initiative
Authors: Robert Harris
Venue: Proceedings of the sixth conference on IASTED International Conference Web-Based Education - Volume 2 (2007)

Knowledge is critical to developing competency within small businesses (SMEs) and firms that efficiently tap into all relevant sources of knowledge are likely to grow, whilst those that can't may struggle. However, an obstacle to SME development is often an inability to access technical and business knowledge, although the widespread adoption of broadband internet connectivity has increased the potential for successful business support. The availability of software platforms such as Web CT have proved effective for delivering formal learning opportunities, but from a pedagogical perspective these technology applications can be questioned in terms of their impact on learning outcomes and track record in delivering informal learning support. The Technology Enhanced Enterprise Education (TE3) initiative aims to provide a solution to this problem by funding the development of technology supported learning solutions delivered through a collaborative network of UK Higher Education Institutions. This paper reports on the first phase of development of a knowledge transfer project, part funded through TE3, which designed to encourage innovation and improve the capability of SMEs in the West Midlands region of the UK.
Hand Motion Prediction for Distributed Virtual Environments
Authors: Addison Chan, Rynson Lau, Lewis Li
Venue: IEEE Transactions on Visualization and Computer Graphics (2008)

We use our hands to manipulate objects in our daily life. The hand is capable of accomplishing diverse tasks such as pointing, gripping, twisting and tearing. However, there is not much work that considers using the hand as input in distributed virtual environments (DVEs), in particular over the Internet. The main reasons are that the Internet suffers from high network latency, which affects interaction, and the hand has many degrees of freedom, which adds additional challenges to synchronizing the collaboration. In this paper, we propose a prediction method specifically designed for human hand motion to address the network latency problem in DVEs. Through a thorough analysis of finger motion, we have identified various finger motion constraints and we propose a constraint-based motion prediction method for hand motion. To reduce the average prediction error under high network latency, e.g., over the Internet, we further propose a revised dead reckoning scheme here. Our performance results show that the proposed prediction method produces a lower prediction error than some popular methods while the revised dead reckoning scheme produces a lower average prediction error than the traditional dead reckoning scheme, in particular at high network latency.
An Efficient and Truthful Leader IDS Election Mechanism for MANET
Authors: Hadi Otrok, Noman Mohammed, Lingyu Wang, Mourad Debbabi, Prabir Bhattacharya
Venue: Proceedings of the Third IEEE International Conference on Wireless and Mobile Computing, Networking and Communications (2007)

In this paper, we consider the problem of increasing the effectiveness of an Intrusion Detection System (IDS) for a cluster of nodes in ad hoc networks. To solve such a prob- lem, a head cluster is elected by the nodes to handle the de- tection service. Current solution elects a leader randomly without considering the energy level of nodes. Such solu- tion is vulnerable to selfish nodes that do not provide IDS service to others while at the same time benefiting from oth- ers' services. From our experiments, selfish nodes reduce the effectiveness of an IDS since less packets are inspected over time. Here, we are modeling a distributed, truthful, and efficient mechanism for electing a leader IDS that han- dles the detection process in a cluster. Our solution is able to balance the energy among all the nodes and increase the overall lifetime of an IDS in a cluster. In our model, incen- tives are given in the form of reputation to encourage the nodes to cooperate in the leader election process. The rep- utation is used to track the cooperative behavior of nodes where miss-behaving nodes are punished by withholding the cluster's services. Reputations are calculated based on the truth-telling mechanism design known as Vickrey, Clarke, and Groves (VCG). Our analysis prove that truth-telling is the dominant strategy for all the nodes and therefore effi- ciency is guaranteed. Finally, simulation results show that our mechanism improves the performance of an IDS in an- alyzing packets and punishes misbehaving nodes.
An Experimental Digital Interactive Facility
Authors: L. A. Gambino
Venue: Computer (1977)

About 2-½ years ago the Army's Engineer Topographic Laboratories and Defense Mapping Agency began developing a digital image processing system for use in map making. Today that system, if it has not yet supplanted conventional approaches to map making, has nevertheless demonstrated the feasibility of digital techniques in photo-interpretation, stereo compilation, and automated cartography.
Sustainable virtual world ecosystems
Authors: John Campbell, Gordon Fletcher, Anita Greenhill
Venue: ACM SIGMIS Database (2007)

This paper outlines an agenda for research that contributes to the development of sustainable virtual world ecosystems. It provides direction for understanding the social aspects of both trust and conflict. Trust is often referred to in research to examine the social interactions observed in virtual communities. It is an important theoretical factor affecting user intention to give and receive information. However, trust is a problematic construct, as it is based on culturally and historically specific assumptions about human association and social organization. Conflict and disagreement are usually viewed as undesirable behaviors in virtual worlds. The management of these behaviors is a difficult task in virtual environments where physical social controls are not available. Consequently, the moderation of participant behavior is seen as a challenge for virtual world creators, particularly as virtual world governance is likely to have a significant influence on member retention rates. A conflict-oriented research agenda provides a useful vehicle for interpreting the simultaneous pressures for both collaboration and competition in virtual worlds. Conflict is an integral structural element of the social interrelations found in both physical and virtual worlds. In this context, both agreement and disagreement are necessary to maintain the intricate social networks necessary for sustainable virtual world ecosystems.
The Design and Realization of CAT with Cognitive Diagnosis based on Formal Concept Analysis
Authors: Shuqun Yang, Shuliang Ding, Xiaodong Zhu, Qiulin Ding
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 02 (2007)

In this paper, combined with Tatsuoka's Rule Space Model and the Attribute hierarchy Method (AHM), Formal Concept Analysis (FCA) is firstly applied into Computerized Adaptive Testing (CAT). Based on FCA, an initiatory and systemic CAT with cognitive diagnosis (CD) is designed, which diagnoses examinees real time. The result of Monte Carlo study shows that examinees' knowledge states are well diagnosed and the precision in examinees' abilities estimation is satisfied.
A Pattern-Based Constraint Description Approach for Web Services
Authors: Qianxiang Wang, Min Li, Na Meng, Yonggang Liu, Hong Mei
Venue: Proceedings of the Seventh International Conference on Quality Software (2007)

Current WSDL-based description specifies only the operation signatures and locations of Web services. It is widely recognized that a richer description is needed. WS-Security, WS-Reliable, WSOL, and service interaction protocols are all typical efforts toward this direction. Based on the cognition that a complete description of service is impossible, this paper proposes a pattern based constraint description approach for Web services. We illustrate the approach with a constraint pattern hierarchy which focuses on the messages exchanged between client and server. And a RDF based constraint description language is proposed, so as to give explicit semantics to the specified constraint descriptions. The application on a web-based auction system shows that our approach is feasible.
Fault Diagnosis in Combinational Tree Networks
Authors: Z. Kohavi
Venue: IEEE Transactions on Computers (1975)

In this paper, which is a follow up to [8], we are concerned with the problem of generating minimal experiments to locate and diagnose faults in combinational tree networks. We establish lower bounds on the necessary number of fault-locating tests and show how, in a systematic way, such experiments can be obtained. Two types of testing procedures are considered adaptive and preset.
On the use of virtual animals with artificial fear in virtual environments
Authors: Carlos Delgado-Mata, Jesus Ibamez Martinez, Simon Bee, Rocio Ruiz-Rodarte, Ruth Aylett
Venue: New Generation Computing (2007)

Virtual environments are often static and empty of life. One way of combating this problem is by populating the environment with autonomous agents that behave in a life-like manner. This paper discusses the incorporation of animals into such environments and the definition of appropriate behaviours that enrich the experience. Reynolds' flocking algorithm is extended to incorporate the effects of emotions, in this case fear. Deer are used as an example of flocking mammals and an autonomous agent architecture with an action selection mechanism incorporating the effects of emotion is linked to the extended flocking rules. Olfaction is used to transmit emotion between animals, through pheromones modelled as particles in a free expansion gas. Two experiments are reported that provide some insight into the impact of the various behaviours. The combination of reaction and naturalistic behaviours are concluded to be important in enhancing the virtual environment.
Bandwidth efficient MT-DS-SS via reduced subcarrier frequency spacing
Authors: Indranil Sen, David W. Matolak
Venue: Wireless Personal Communications: An International Journal (2007)

We investigate modifications to conventional multitone direct-sequence spread spectrum (MT-DS-SS) signaling to improve spectral efficiency, for high-data-rate systems with small processing gain. Reduction in subcarrier frequency spacing to half the symbol rate improves bandwidth efficiency at no cost in complexity or performance. Via both analysis and simulations, we provide example results that illustrate the attractive performance and throughputs attainable with reduced frequency spacing. We extend study to synchronous multiuser transmission, and show that our best spectrally efficient MT-DS-SS scheme outperforms the conventional MT-DS-SS in a dispersive multiuser environment.
Removing Noise and Ambiguities from Comparative Maps in Rearrangement Analysis
Authors: Chunfang Zheng, Qian Zhu, David Sankoff
Venue: IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB) (2007)

Comparison of genomic maps is hampered by errors and ambiguities introduced by mapping technology, incorrectly resolved paralogy, small samples of markers and extensive genome rearrangement. We design an analysis to remove or resolve most of these problems and to extract corrected data where markers occur in consecutive strips in both genomes. To do this we introduce the notion of pre-strip, an efficient way of generating these, and a compatibility analysis culminating in a Maximum Weighted Clique (MWC) search. The output can be directly analyzed with genome rearrangement algorithms, allowing the restoration of some of the data not incorporated into the clique solution. We investigate the trade-off between criteria for discarding excessive pre-strips to make MWC feasible, in terms of retaining as many markers as possible in the solution and producing an economical rearrangement analysis. We explore these questions through simulation and through comparison of the rice and sorghum genomes.
Supporting ontology-based semantic matching in RDBMS
Authors: Souripriya Das, Eugene Inseok Chong, George Eadon, Jaannathan Srinivasan
Venue: Proceedings of the Thirtieth international conference on Very large data bases - Volume 30 (2004)

Ontologies are increasingly being used to build applications that utilize domain-specific knowledge. This paper addresses the problem of supporting ontology-based semantic matching in RDBMS. Specifically, 1) A set of SQL operators, namely ONT_RELATED, ONT_EXPAND, ONT_DISTANCE, and ONT_PATH, are introduced to perform ontology-based semantic matching, 2) A new indexing scheme ONT_INDEXTYPE is introduced to speed up ontology-based semantic matching operations, and 3) System-defined tables are provided for storing ontologies specified in OWL. Our approach enables users to reference ontology data directly from SQL using the semantic match operators, thereby opening up possibilities of combining with other operations such as joins as well as making the ontology-driven applications easy to develop and efficient. In contrast, other approaches use RDBMS only for storage of ontologies and querying of ontology data is typically done via APIs. This paper presents the ontology-related functionality including inferencing, discusses how it is implemented on top of Oracle RDBMS, and illustrates the usage with several database applications.