ppxscal/embedding_network huggingface dataset:
A Complete Characterization of a Family of Solutions to a Generalized Fisher Criterion
Authors: Marco Loog
Venue: The Journal of Machine Learning Research (2007)

Recently, Ye (2005) suggested yet another optimization criterion for discriminant analysis and proposed a characterization of the family of solutions to this objective. The characterization, however, merely describes a part of the full solution set, that is, it is not complete and therefore not at all a characterization. This correspondence first gives the correct characterization and afterwards compares it to Ye's.
Improved generalization of neural classifiers with enforced internal representation
Authors: Iveta Mrázová, Dianhui Wang
Venue: Neurocomputing (2007)

In standard BP-networks, hidden neuron outputs are usually spread over the whole interval (0,1). In this paper, we propose an efficient framework to enforce a transparent internal knowledge representation in BP-networks during training. We want the formed internal representations to differ as much as possible for different outputs. At the same time, the hidden neuron outputs will be forced to group around three possible values, namely 1, 0 and 0.5. We will call such an internal representation unambiguous and condensed. The performance of BP-networks with enforced internal representations will be examined in a case study devoted to semantic image classification.
Tutorial Series 8 Data Communication Using the Telecommunication Network
Authors: M. F. Slana
Venue: Computer (1981)

Advances in LSI and digital communication technologies are encouraging telecommunication growth embodying end-to-end digital transmission and switching facilities.
Test Generation for Timing-Critical Transition Faults
Authors: Xijiang Lin, Mark Kassab, Janusz Rajski
Venue: Proceedings of the 16th Asian Test Symposium (2007)

Timing-aware ATPG [1] has been shown to be an effective method for generating high-quality test sets that detect small delay defects through the longest paths. However, this method usually results in a much higher test pattern count than the traditional transition fault test generation. In this paper, we propose a new criterion that identifies a subset of transition faults to be targeted by the timing-aware ATPG in order to reduce test pattern count while minimizing the impact on the overall delay test quality. The new criterion utilizes the minimal static slack to classify certain transition faults as timing-critical. The test pattern count reduction is achieved by restricting the timing-aware ATPG to targeting the timing-critical transition faults while using traditional transition fault test generation for the remaining transition faults. The experimental results for the industrial circuits show the effectiveness of the proposed method.
Expertise drift and query expansion in expert search
Authors: Craig Macdonald, Iadh Ounis
Venue: Proceedings of the sixteenth ACM conference on Conference on information and knowledge management (2007)

Pseudo-relevance feedback, or query expansion, has been shown to improve retrieval performance in the adhoc retrieval task. In such a scenario, a few top-ranked documents are assumed to be relevant, and these are then used to expand and refine the initial user query, such that it retrieves a higher quality ranking of documents. However, there has been little work in applying query expansion in the expert search task. In this setting, query expansion is applied by assuming a few top-ranked candidates have relevant expertise, and using these to expand the query. Nevertheless, retrieval is not improved as expected using such an approach. We show that the success of the application of query expansion is hindered by the presence of topic drift within the profiles of experts that the system considers. In this work, we demonstrate how topic drift occurs in the expert profiles, and moreover, we propose three measures to predict the amount of drift occurring in an expert's profile. Finally, we suggest and evaluate ways of enhancing query expansion in expert search using our new insights. Our results show that, once topic drift has been anticipated, query expansion can be successfully applied in a general manner in the expert search task.
ANTS: Efficient Vehicle Locating Based on Ant Search in ShanghaiGrid
Authors: Hongzi Zhu, Yanmin Zhu, Minglu Li, Lionel M. Ni
Venue: Proceedings of the 2007 International Conference on Parallel Processing (2007)

Intelligent transportation systems have become increasingly important for the public transportation in Shanghai. In response, ShanghaiGrid aims to provide abundant intelligent transportation services to improve the traffic condition. A fundamental service in ShanghaiGrid is to locate the nearest desirable vehicles for users. In this paper we propose an innovative protocol ANTS to locate a desirable vehicle close to the querying user. The protocol finely mimics the efficient searching strategy adopted by a lost desert ant in searching for its nest. Taking query locality into account, ANTS can retrieve the nearest vehicles satisfying the query with high probability but incurs small query latency and modest network traffic. ANTS is a fully distributed and robust protocol and therefore has good scalability. Extensive simulations based on the real road network and the trace data of vehicle movements in Shanghai demonstrate the efficacy of ANTS.
Under storage constraints of epidemic backup node selection using HyMIS architecture for data replication in mobile peer-to-peer networks
Authors: Constandinos X. Mavromoustakis, Helen D. Karatza
Venue: Journal of Systems and Software (2008)

The attainment of high reliability and availability is very difficult to be achieved in very complex wireless infrastructureless networks. Reliability concept describes essentially the transmission characteristics of infrastructureless networks, such as packet loss probability, packet duplication, data misinsertion, and corruption of packets. Some other metrics nowadays, aggregate and contribute to the aggravation of end to end reliability. In this work a new scheme for end to end reliable file/resource sharing is studied, among mobile peer-to-peer users. The proposed scheme uses the Hybrid Mobile Infostation System (HyMIS) to maintain and enhance the reliability of file/resource sharing process among wireless devices. Under various storage constraints the epidemic backup node selection is adopted, merging the advantages of epidemic file dissemination through purely mobile Infostations, using the HyMIS architecture. Examination through simulation is performed, taking into account many newly introduced storage metrics, for the performance evaluation of the proposed scheme. These storage metrics are tuned into certain bounded values to enable high packet delivery ratio. Results show that this scheme under certain storage requirements offer a reliable and robust solution for sharing resources of any capacity in dynamic mobile peer-to-peer wireless environments.
High-Performance Computing Acquisitions Based on the Factors that Matter
Authors: Larry P. Davis, Roy L. Campbell Jr., William A. Ward Jr., Cray J. Henry
Venue: Computing in Science and Engineering (2007)

The US Department of Defense High Performance Computing Modernization Program has developed an evaluation process that combines qualitative usability factors with quantitative performance and price-per-performance factors to determine which HPC systems to acquire in its annual modernization process.
Measuring Improvements in Program Clarity
Authors: R. D. Gordon
Venue: IEEE Transactions on Software Engineering (1979)

The sharply rising cost incurred during the production of quality software has brought with it the need for the development of new techniques of software measurement. In particular, the ability to objectively assess the clarity of a program is essential in order to rationally develop useful engineering guidelines for efficient software production and language development.
A Software Chasm: Software Engineering and Scientific Computing
Authors: Diane F. Kelly
Venue: IEEE Software (2007)

The domain-independent solutions proffered by the software engineering community have led to the isolation of the scientific-computing community.
Proper partial geometries with Singer groups and pseudogeometric partial difference sets
Authors: Ka Hin Leung, Siu Lun Ma, Bernhard Schmidt
Venue: Journal of Combinatorial Theory Series A (2008)

A partial geometry admitting a Singer group G is equivalent to a partial difference set in G admitting a certain decomposition into cosets of line stabilizers. We develop methods for the classification of these objects, in particular, for the case of abelian Singer groups. As an application, we show that a proper partial geometry @P=pg(s+1,t+1,2) with an abelian Singer group G can only exist if t=2(s+2) and G is an elementary abelian 3-group of order (s+1)^3 or @P is the Van Lint-Schrijver partial geometry. As part of the proof, we show that the Diophantine equation (3^m-1)/2=(2^r^w-1)/(2^r-1) has no solutions in integers m,r>=1, w>=2, settling a case of Goormaghtigh's equation.
Using Bayesian Network for combining classifiers
Authors: Claudio De Stefano, Ciro D'Elia, Angelo Marcelli, Alessandra Scotto di Freca
Venue: Proceedings of the 14th International Conference on Image Analysis and Processing (2007)

In the framework of multiple classifier systems, we suggest to reformulate the classifier combination problem as a pattern recognition one. Following this approach, each input pattern is associated to a feature vector composed by the output of the classifiers to be combined. A Bayesian Network is used to automatically infer the probability distribution for each class and eventually to perform the final classification. We propose to use Bayesian Networks because they not only provide a basis for efficient probabilistic inference, but also a natural and compact way to encode exponentially sized joint probability distributions. Two systems adopting an ensemble of Back-Propagation neural network and an ensemble of Learning Vector Quantization neural network, respectively, have been tested on the Image database from the UCI repository. The performance of the proposed systems have been compared with those exhibited by multi-expert systems adopting the same ensembles, but the Majority Vote, the Weighted Majority vote and the Borda Count for combining them.
Efficiency Evaluation for University Laboratory Based on Multi-layer SVM Classifier
Authors: Xiumei Wang, Yanbin Cui, Chenguang Yang
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 01 (2007)

In order to evaluate efficiency in university laboratory in a reasonable way, the index system for efficiency evaluation is established, and the efficiency class is separated into three classes-good, fair, and poor. To classify the efficiency of three classes, the evaluation model of multi-layer support vector machines (SVM) classifier is established. In order to verify the effectiveness of the method, 41 universities laboratories which are chosen from 211 project are used, and Levenberg--Marquardt neural network is also used to classify the same data and make comparison. The experiment results show that multi-layer SVM classifier is effective in efficiency evaluation for university laboratory when the training data set is not too much, and the method achieves better performance than Levenberg-- Marquardt neural network.
Unsupervised Graph-basedWord Sense Disambiguation Using Measures of Word Semantic Similarity
Authors: Ravi Sinha, Rada Mihalcea
Venue: Proceedings of the International Conference on Semantic Computing (2007)

This paper describes an unsupervised graph-based method for word sense disambiguation, and presents comparative evaluations using several measures of word semantic similarity and several algorithms for graph centrality. The results indicate that the right combination of similarity metrics and graph centrality algorithms can lead to a performance competing with the state-of-the-art in unsupervised word sense disambiguation, as measured on standard data sets.
Linking visual attention and number processing in the brain: The role of the temporo-parietal junction in small and large symbolic and nonsymbolic number comparison
Authors: Daniel Ansari, Ian M. Lyons, Lucia van Eimeren, Fei Xu
Venue: Journal of Cognitive Neuroscience (2007)

There exists a long-standing debate regarding whether small and large numerosities engage different networks of processing. The ability to rapidly enumerate small (1--4) numerosities is referred to as “subitizing” and is thought to be qualitatively different from large numerosity processing. Functional neuro-imaging studies have attempted to dissociate neural correlates of small and large number processing by contrasting subitizing with counting of numerosities just outside the subitizing range. In the present study, we used functional magnetic resonance imaging (fMRI) to contrast the processing of numerosities in the “subitizing range” with numerosities requiring estimation. Participants compared sequentially presented slides of either dots or Arabic numerals for their relative magnitude. We show that comparison of nonsymbolic numerosities in the subitizing range led to activation of the right temporo-parietal junction, while at the same time this region was found to be suppressed during large numerosity processing. Furthermore, relative suppression of this region was strongly associated with faster response times. In previous studies, this region has been implicated in stimulus-driven attention.We therefore contend that activation of the temporo-parietal junction during small number processing and the suppression thereof during large numerosity comparisons reflects differential reliance on stimulus-driven versus goal-directed attentional networks in the brain.
Schema theory for genetic programming with one-point crossover and point mutation
Authors: Riccardo Poli, William B. Langdon
Venue: Evolutionary Computation (1998)

We review the main results obtained in the theory of schemata in genetic programming (GP), emphasizing their strengths and weaknesses. Then we propose a new, simpler definition of the concept of schema for GP, which is closer to the original concept of schema in genetic algorithms (GAs). Along with a new form of crossover, one-point crossover, and point mutation, this concept of schema has been used to derive an improved schema theorem for GP that describes the propagation of schemata from one generation to the next. We discuss this result and show that our schema theorem is the natural counterpart for GP of the schema theorem for GAs, to which it asymptotically converges.
An Integrated Video Compression, Encryption and Information Hiding Architecture based on the SCAN Algorithm and the Stretch Technology
Authors: G. Chrysos, A. Dollas, N. Bourbakis, S. Mertoguno
Venue: Proceedings of the 15th Annual IEEE Symposium on Field-Programmable Custom Computing Machines (2007)

SCAN is a class of formal languages for compression, encryption and information hiding. We have previously studied and reported separate hardware implementations of SCAN compression and encryption. This paper presents initial results on the design of a complete single-chip system for the SCAN compression, encryption and information hiding algorithm using the Stretch technology with reconfigurable and fixed resources. The result is a simple, low cost, embeddable core combining all three operations seamlessly and the design was fully mapped to the Stretch technology.
Dynamic Software Science with Applications
Authors: R. R. Oldehoeft
Venue: IEEE Transactions on Software Engineering (1979)

Two disciplines have been developed during the past few years for the study of computer software. Software physics has as its purpose the analysis of execution characteristics of programs. Basic measures of software work, time, and shortage occupancy are used to derive measures such as power, capacity usage, and storage work, with applications to the choice of processor and device speeds. Software science is related to information theory. Occurrences of operators and operands in the text of programs are counted to provide measures for a number of relationships; among them are estimates for program length, program and language level, and programming time.
On hyperbolic Coxeter polytopes with mutually intersecting facets
Authors: Anna Felikson, Pavel Tumarkin
Venue: Journal of Combinatorial Theory Series A (2008)

We prove that, apart from some well-known low-dimensional examples, any compact hyperbolic Coxeter polytope has a pair of disjoint facets. This is one of very few known general results concerning combinatorics of compact hyperbolic Coxeter polytopes. We also obtain a similar result for simple non-compact polytopes.
Slicing obfuscations: design, correctness, and evaluation
Authors: Anirban Majumdar, Stephen J. Drape, Clark D. Thomborson
Venue: Proceedings of the 2007 ACM workshop on Digital Rights Management (2007)

The goal of obfuscation is to transform a program, without affecting its functionality, such that some secret information within the program can be hidden for as long as possible from an adversary armed with reverse engineering tools. Slicing is a form of reverse engineering which aims to abstract away a subset of program code based on a particular program point and is considered to be a potent program comprehension technique. Thus, slicing could be used as a way of attacking obfuscated programs. It is challenging to manufacture obfuscating transforms that are provably resilient to slicing attacks.We show in this paper how we can utilise the information gained from slicing a program to aid us in designing obfuscations that are more resistant to slicing. We extend a previously proposed technique and provide proofs of correctness for our transforms. Finally, we illustrate our approach with a number of obfuscating transforms and provide empirical results using software engineering metrics.
Discovery of Non-Interesting Attribute in Mining Outliers Pattern
Authors: Faizah Shaari, Azuraliza A.B, Abdul H. Razak
Venue: Proceedings of the The 2007 International Conference Computational Science and its Applications (2007)

An outlier in a dataset is a point or a class of points that is considerably dissimilar to or inconsistent with the remainder of the data. Detection of outliers is important for many applications and has always attracted attention among data mining research community. In this paper, we present a new method in detecting outlier by discovering Non-IntAttrb from the information system (IS). Non-IntAttrb is set of attributes from IS that may contain outliers. We discover the computation of Non-IntAttrb by defining indiscernibility matrix modulo (iDMM) and indiscernibility function modulo(iDFM). We define a measurement called RSetOF(Rough Set Outlier Factor Value) to detect outlier objects. The experimental results show that our approach is a fast outlier detection method.
Semantic-Aware and QoS-Aware Image Caching in Ad Hoc Networks
Authors: Bo Yang, Ali R. Hurson
Venue: IEEE Transactions on Knowledge and Data Engineering (2007)

Caching has been widely used in the mobile environments to improve system performance. However, traditional semantic caching methodology was proposed for structural data such as 2-D location, and cannot be directly used for image data accessing: First, traditional caching relies on exact match and therefore is unsuitable for similarity-based queries. Second, the description of cached data is defined based on query context instead of data content, which leads to inefficient use of storage. Third, the description of cached data does not reflect the popularity of the data, making it inefficient in providing QoS-related services. To facilitate content-based image retrieval in mobile environments, we propose a semantic-aware image caching scheme (SAIC) in this paper. The proposed scheme can efficiently utilize the cache space and significantly reduce the cost of image retrieval. The proposed SAIC scheme is based on several innovative ideas: 1) multi-level partitioning of the semantic space, 2) association and Bayesian probability based content prediction, 3) constraint-based representation method showing the semantic similarity between images, 4) non-flooding query processing, and 5) adaptive QoS-aware cache consistency maintenance. The proposed model is introduced and through extensive simulation its behavior has been compared against two state-of-the-art caching schemes as advanced in the literature.
Database Access Control in the Presence of Context Dependent Protection Requirements
Authors: D. K. Hsiao
Venue: IEEE Transactions on Software Engineering (1979)

Data items in a database are semantically related. Thus, the access control mechanism of a database system must be concerned with the possibility that access to one item may violate a denied access to another item. This study concentrates on two basic semantic relations for protection requirements. By utilizing a graph-theoretic approach, some of the fundamental properties of the protection relations can be readily identified. These properties can then be used as a basis for understanding more general context dependent protection requirements. Two fundamental properties of the two protection relations are found. The first property addresses the question: given a database with a set of protection relations, is it possible to find a maximal subset of the database such that access to one item of the subset will not lead to any violation of a denied access to another item? The second property addresses the question: given a database with a set of protection relations, is it possible to find a sequence of accesses such that the protection requirement is enforced with no violation?
An Internet Voting Protocol with Receipt-Free and Coercion-Resistant
Authors: Bo Meng
Venue: Proceedings of the 7th IEEE International Conference on Computer and Information Technology (2007)

Internet voting protocols is the base of the Internet voting systems. In this paper an Internet voting protocol applied designated verifier proof and proof of knowledge of two ciphertexts of the same plaintext is introduced. The proposed Internet voting protocol has the properties of universal verifiability, receipt-free and coercion-resistant and don't use the strong physical constraints. We only assume that there is a one way anonymous channel from authorities to voters
The Solution of Differential Equations on Short-Word-Length Computing Devices
Authors: P. W. Baker
Venue: IEEE Transactions on Computers (1979)

When the numerical solution of differential equations (DE's) for dynamical simulation is performed with short-word-length computing devices, it is essential that truncation (round-off) error be understood and controlled where possible. This paper presents a simple but enlightening analysis of truncation errors in the computer solution of DE's, an analysis which develops the rationale for the residue register, the distinguishing feature of the digital differential analyzer (DDA), for the suppression of (second-order) truncation error. The analysis is extended formally to complete the theory of nth order truncation error suppression in linear DE's. After discussing the application of residue retention techniques to higher order integration formulas, the utility of third-order truncation error suppression strategy is illustrated in the suppression of "limit cycle" oscillations that occur in marginally damped oscillatory systems. The use of residue retention is then shown to be more critical in the case of DE's with multiplicative nonlinearities. Finally, design strategies are discussed briefly.