ppxscal/embedding_network huggingface dataset:
Class Noise and Supervised Learning in Medical Domains: The Effect of Feature Extraction
Authors: Mykola Pechenizkiy, Alexey Tsymbal, Seppo Puuronen, Oleksandr Pechenizkiy
Venue: Proceedings of the 19th IEEE Symposium on Computer-Based Medical Systems (2006)

Inductive learning systems have been successfully applied in a number of medical domains. It is generally accepted that the highest accuracy results that an inductive learning system can achieve depend on the quality of data and on the appropriate selection of a learning algorithm for the data. In this paper we analyze the effect of class noise on supervised learning in medical domains. We review the related work on learning from noisy data and propose to use feature extraction as a pre-processing step to diminish the effect of class noise on the learning process. Our experiments with 8 medical datasets show that feature extraction indeed helps to deal with class noise. It clearly results in higher classification accuracy of learnt models without the separate explicit elimination of noisy instances.
Post-reboot Equivalence and Compositional Verification of Hardware
Authors: Zurab Khasidashvili, Marcelo Skaba, Daher Kaiss, Ziyad Hanna
Venue: Proceedings of the Formal Methods in Computer Aided Design (2006)

We introduce a finer concept of a Hardware Machine, where the set of post-reboot operation states is explicitly a part of the FSM definition. We formalize an ad-hoc flow of combinational equivalence verification of hardware, the way it was performed over the years in the industry. We define a concept of post-reboot bisimulation, which better suits the Hardware Machines, and show that a right form of combinational equivalence is in fact a form of post-reboot bisimulation. Further, we show that alignability equivalence is a form of post-reboot bisimulation, too, and the latter is a refinement of alignability in the context of compositional hardware verification. We find that post-reboot bisimulation has important advantages over alignability also in the wider context of formal hardware verification, where equivalence verification is combined with formal property verification and with validation of a reboot sequence. As a result, we propose a more comprehensive, compositional, and fullyformal framework for hardware verification. Our results are extendible to other forms of labeled transition systems and adaptable to other forms of bisimulation used to model and verify complex hardware and software systems.
Complete Complementary Orthogonal (CCO) Code-Based CDMA Using Natural Mapping QAM Constellations
Authors: Mario E. Magaña, Thunyawat Rajatasereekul
Venue: Wireless Personal Communications: An International Journal (2006)

In this short paper we propose a CCO code-based CDMA system that uses a natural mapping QAM scheme, in order to conserve both bandwidth and average transmitted power. We also suggest a design approach to obtain an optimal QAM mapping to further improve system performance. This is in contrast to the original CCO code-based system which used PAM transmission over twice as many channels. Here we present preliminary results for the 2-user case and the downlink.
How to Make It Faster and at Lower Cost? B2B Integration with Semantic Web Services
Authors: Silvestre Losada, Dariusz Keczek, Richard Benjamins, Jesus Contreras, Oscar Corcho, Jose Luis Bas, Sergio Bellido
Venue: Proceedings of the 17th International Conference on Database and Expert Systems Applications (2006)

Web services and service oriented architectures present a new approach to application integration. While it is reasonable inside an enterprise, it has certain deficiencies when applied in a B2B environment. This deficiencies apply to the discovery, invocation and composition phases, which require considerable manual effort. In the paper, we show on example of a mortgage simulator how these deficiencies can be overcome by applying semantic web services. The application is compatible with the Web Services Modelling Ontology and makes use of an execution environment automating the processes of discovery, composition and invocation of semantic web services, enabling faster and cheaper B2B application integration.
Punishment and ethics deterrents: A study of insider security contravention
Authors: Michael Workman, John Gathegi
Venue: Journal of the American Society for Information Science and Technology (2007)

Information security is a growing concern among the general population. For instance, it has been estimated by the U.S. Department of Justice (2004) that one in three people will become victims of identity theft at some point in their lifetime. The bulk of the research into information security has gone into the investigation of technological aspects of security, and there are gaps in the literature relative to contravention of security measures. Drawing from deterrence theory and using the theory of planned behavior as a general framework, this empirical field study investigated the effects of punishment and ethics training on behaviors related to contravention of information security measures among information professionals to fill an important gap in the literature. We found that both punishment and ethics training can be effective in mitigating the threat of software and information security, but that these depend on certain underlying motivational factors of individuals. The results of this study suggest a need to develop and refine the theoretical models, and we offer suggestions for getting at the root of behavioral issues surrounding information security. &copy; 2007 Wiley Periodicals, Inc.
Mining relational data through correlation-based multiple view validation
Authors: Hongyu Guo, Herna L. Viktor
Venue: Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining (2006)

Commercial relational databases currently store vast amounts of real-world data. The data within these relational repositories are represented by multiple relations, which are inter-connected by means of foreign key joins. The mining of such interrelated data poses a major challenge to the data mining community. Unfortunately, traditional data mining algorithms usually only explore one relation, the so-called target relation, thus excluding crucial knowledge embedded in the related so-called background relations. In this paper, we propose a novel approach for classifying relational such domains. This strategy employs multiple views to capture crucial information not only from the target relation, but also from related relations. This information is integrated into the relational mining process. The framework presented here, firstly, explore the relational domain to partition its features space into multiple subsets. Subsequently, these subsets are used to construct multiple uncorrelated views, based on a novel correlation-based view validation method, against the target concept. Finally, the knowledge possessed by multiple views are incorporated into a meta-learning mechanism to augment one another. Based on this framework, a wide range of conventional data mining methods can be applied to mine relational databases. Our experiments on benchmark real-world data sets show that the proposed method achieves promising results both in terms of overall accuracy obtained and run time, when compared with two other relational data mining approaches.
Some results about the chaotic behavior of cellular automata
Authors: F. Blanchard, J. Cervelle, E. Formenti
Venue: Theoretical Computer Science (2005)

We study the behavior of cellular automata (CA for short) in the Cantor, Besicovitch and Weyl topologies. We solve an open problem about the existence of transitive CA in the Besicovitch topology. The proof of this result has some interest of its own since it is obtained by using Kolmogorov complexity. To our knowledge it is the first result about discrete dynamical systems obtained using Kolmogorov complexity. We also prove that in the Besicovitch topology every CA has either a unique periodic point (thus a fixed point) or an uncountable set of periodic points. This result underlines the fact that CA have a great degree of stability; it may be considered a further step towards the understanding of CA periodic behavior.Moreover, we prove that in the Besicovitch topology there is a special set of configurations, the set of Toeplitz configurations, that plays a role similar to that of spatially periodic configurations in the Cantor topology, that is, it is dense and has a central role in the study of surjectivity and injectivity. Finally, it is shown that the set of spatially quasi-periodic configurations is not dense in the Weyl topology.
An Ant Colony Optimization Algorithm for Multiple Travelling Salesman Problem
Authors: Pan Junjie, Wang Dingwei
Venue: Proceedings of the First International Conference on Innovative Computing, Information and Control - Volume 1 (2006)

Multiple travelling salesman problem (MTSP) is a typical computationally complex combinatorial optimization problem,which is an extension of the famous travelling salesman problem (TSP). The MTSP can be generalized to a wide variety of routing and scheduling problems.It is known that classical optimization procedures are not adequate for this problem.The paper makes the attempt to show how the ant colony optimization(ACO) can be applied to the MTSP with ability constraint. In this paper,we compare it with MGA by testing several standard problems from TSPLIB.The computational results show that the proposed algorithm can find competitive solutions even not all of the best solutions within rational time, especially for large scale problems.
Effects of innovation versus efficiency tasks on recall and transfer in individual and collaborative learning contexts
Authors: David A. Sears
Venue: Proceedings of the 7th international conference on Learning sciences (2006)

Two experiments tested the effects of a framework for promoting productive collaboration and transfer. The framework uses the dimensions of innovation and efficiency to characterize learning tasks according to the types of knowledge they should promote. Innovation tasks involve the construction of novel solutions to unfamiliar problems while efficiency tasks feature repeated application of optimal solutions. The former are intended to help students appreciate key features of an expert solution while the latter aim to increase speed and accuracy. The overarching hypothesis was that having an opportunity to innovate would promote productive collaboration and learning more than efficiently copying and studying correct answers. The first experiment, involving third graders, found benefits of innovation for individual learning. The second, with university students working collaboratively, found effects of innovation on interaction.
Conceptual simulation modeling of warehousing operations
Authors: Ming Zhou, Kitti Setavoraphan, Zhimin Chen
Venue: Proceedings of the 37th conference on Winter simulation (2005)

This study focuses on the simulation modeling of warehousing operations commonly seen at general merchandize distribution centers. The key processes and their structural and behavioral characteristics were identified and analyzed. Robust representations and patterns were developed to represent the elements and logic of the simulation models for these processes to facilitate efficient and effective construction of the models. The issues of conceptual modeling such as synthesis, abstraction and specialization were also discussed.
A Feature-Oriented Requirements Tracing Method: A Study of Cost-benefit Analysis
Authors: Sangim Ahn, Kiwon Chong
Venue: Proceedings of the 2006 International Conference on Hybrid Information Technology - Volume 02 (2006)

Establishing and maintaining traceability links places a big burden since complex systems have especially yield an enormous number of various artifacts although traceability links is useful for requirements change impact analysis, requirements conflict analysis, and requirements consistency checking. Hence, we propose a feature-oriented requirements tracing method including value consideration and intermediate catalysis. To achieve our goal in this paper, we present (1) a meta-model of feature-oriented requirements tracing, (2) a featureoriented requirement tracing process overview, and (3) cost-benefits analysis. The meta-model is a formalization of feature-oriented requirement tracing using UML notation. The feature-oriented requirement tracing process consists of requirements definition, feature modeling, feature prioritization, requirements linking, and traceability links evaluation. We also carry out cost-benefit analysis through a case study to demonstrate the feasibility of our approach.
Negotiating efficient outcomes over multiple issues
Authors: Sabyasachi Saha, Sandip Sen
Venue: Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems (2006)

It is difficult to reach optimal outcomes in bilateral negotiations with multiple issues when the agents' preferences and priorities of the issues are not common knowledge. Self-interested agents often end up negotiating inefficient agreements in such situations. Some existing multiagent negotiation frameworks involve agents revealing their preferences to a trusted mediator. But in real-life situations, such a third party, trusted by both the agents may not be found. We design a protocol for bilateral multi-issue negotiation. This protocol guarantees envy-free and Pareto optimal agreement with minimum revelation of their preferences when both negotiators are rational and have the same ordinal preferences. This protocol also leads rational agents to envy-free and near-optimal solution in all cases.
Toward sophisticated detection with distributed triggers
Authors: Ling Huang, Minos Garofalakis, Joseph Hellerstein, Anthony Joseph, Nina Taft
Venue: Proceedings of the 2006 SIGCOMM workshop on Mining network data (2006)

Recent research has proposed efficient protocols for distributed triggers, which can be used in monitoring infrastructures to maintain system-wide invariants and detect abnormal events with minimal communication overhead. To date, however, this work has been limited to simple thresholds on distributed aggregate functions like sums and counts. In this paper, we present our initial results that show how to use these simple threshold triggers to enable sophisticated anomaly detection in near-real time, with modest communication overheads. We design a distributed protocol to detect "unusual traffic patterns" buried in an Origin-Destination network flow matrix that: a) uses a Principal Components Analysis decomposition technique to detect anomalies via a threshold function on residual signals [10]; and b) efficiently tracks this threshold function in near-real time using a simple distributed protocol. In addition, we speculate that such simple thresholding can be a powerful tool for a variety of monitoring tasks beyond the one presented here, and we propose an agenda to explore additional sophisticated applications.
An Introduction to Aggregation Grid
Authors: Zhu Dingju, Fan Jianping
Venue: Proceedings of the Second International Conference on Semantics, Knowledge, and Grid (2006)

Aggregation grid enables all grid nodes connected with a hierarchical architecture into a world-wide grid which can provide all services to all grid nodes for anyone who visits any grid node in the aggregation grid. Once users submit service requests anywhere, the aggregation grid would find the service regardless of where the service is, and will provide the service to users' desktop. Service discovery is fast through lookup service snapshot, aggregation path table and aggregation route table, can find the best service provider through man-made response latency, and is safe through agent aggregation node's symmetrical password. The grid channel, which is very safeguarded by authentication of the display, the borrower node's public key for encryption, the lender node's public key for encryption, the grid channel's symmetrical password, directly connects users and services in order to cut down transfer time.
Metamodel-based Test Generation for Model Transformations: an Algorithm and a Tool
Authors: Erwan Brottier, Franck Fleurey, Jim Steel, Benoit Baudry, Yves Le Traon
Venue: Proceedings of the 17th International Symposium on Software Reliability Engineering (2006)

In a Model-Driven Development context (MDE), model transformations allow memorizing and reusing design know-how, and thus automate parts of the design and refinement steps of a software development process. A model transformation program is a specific program, in the sense it manipulates models as main parameters. Each model must be an instance of a "metamodel", a metamodel being the specification of a set of models. Programming a model transformation is a difficult and error-prone task, since the manipulated data are clearly complex. In this paper, we focus on generating input test data (called test models) for model transformations. We present an algorithm to automatically build test models from a metamodel.
Wavelet energy feature extraction and matching for palmprint recognition
Authors: Xiang-Qian Wu, Kuan-Quan Wang, David Zhang
Venue: Journal of Computer Science and Technology (2005)

According to the fact that the basic features of a palmprint, including principal lines, wrinkles and ridges, have different resolutions, in this paper we analyze palmprints using a multi-resolution method and define a novel palmprint feature, which called wavelet energy feature (WEF), based on the wavelet transform. WEF can reflect the wavelet energy distribution of the principal lines, wrinkles and ridges in different directions at different resolutions (scales), thus it can efficiently characterize palmprints. This paper also analyses the discriminabilities of each level WEF and, according to these discriminabilities, chooses a suitable weight for each level to compute the weighted city block distance for recognition. The experimental results show that the order of the discriminabilities of each level WEF, from strong to weak, is the 4th, 3rd, 5th, 2nd and 1st level. It also shows that WEF is robust to some extent in rotation and translation of the images. Accuracies of 99.24% and 99.45% have been obtained in palmprint verification and palmprint identification, respectively. These results demonstrate the power of the proposed approach.
Parallel Real-Time Task Scheduling on Multicore Platforms
Authors: James H. Anderson, John M. Calandrino
Venue: Proceedings of the 27th IEEE International Real-Time Systems Symposium (2006)

We propose a scheduling method for real-time systems implemented on multicore platforms that encourages individual threads of multithreaded real-time tasks to be scheduled together. When such threads are cooperative and share a common working set, this method enables more effective use of on-chip shared caches.
Object Recognition using Fourier Descriptors: Some Experiments and Observations
Authors: M. Sarfraz
Venue: Proceedings of the International Conference on Computer Graphics, Imaging and Visualisation (2006)

In many image analysis and computer vision applications, object recognition is the ultimate goal. This work presents study and experimentation for object recognition when isolated objects are under discussion. The circumstances of similarity transformations, presence of noise, and occlusion have been included as the part of the study. For simplicity, instead of objects, outline of the objects have been used for the whole process of the recognition. Fourier Descriptors have been used as features of the objects. Various similarity measures have been used and compared for recognition. The test objects are matched with the model objects in database and the object with the least similarity measure is taken as the recognized object. A detailed experimental study has been made under different conditions and circumstances.
High-resolution signal synthesis for time-frequency distributions
Authors: G. S. Cuningham, W. J. Williams
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1993. ICASSP-93 Vol 4., 1993 IEEE International Conference on - Volume 04 (1993)

Bilinear time-frequency distributions (TFDs) offer improved resolution over linear time-frequency representations (TFRs), but many TFDs are costly to evaluate and are not associated with signal synthesis algorithms. The spectrogram (SP) decomposition and weighted reversal correlator decomposition have been used to define low-cost, high-resolution TFDs. The authors show that the vector-valued square-root of a TFD (VVTFR) provides a representational underpinning for the TFD. By synthesizing signals from modified VVTFRs, they define high-resolution signal synthesis algorithms associated with TFDs. The signal analysis and synthesis packages can be implemented as weighted sums of SP/short-time Fourier transform (STFT) signal analysis and synthesis packages. The algorithms exhibit desirable properties, and yield results superior to STFT signal synthesis for a simple example.
A Motion-Compensated Error Concealment Scheme for H.264 Video Transmission
Authors: Chun-Ting Hung, Jin-Jang Leou
Venue: Proceedings of the 2006 International Conference on Intelligent Information Hiding and Multimedia (2006)

For an entropy-coded video sequence, a transmission error in a codeword will not only affect the underlying codeword but may also affect subsequent codewords, resulting in a great degradation of received video frames. In this study, a motion-compensated error concealment scheme is proposed for H.264 video transmission. For H.264 inter-coded P frames, the predicted motion vector (PMV) for each corrupted block is first determined by the spatially neighboring motion vectors (MVs) around the corrupted block and the temporally motion-projected overlapping MVs in the previous frame. With the PMV being the central search point, three rood search patterns are developed for motioncompensated error concealment of small-, medium-, and large-motion corrupted blocks. Then error concealment refinement using Lagrange interpolation is performed on all the initially concealed blocks. Finally, the improved ELA (edge based line average) algorithm [11] is employed to refine each concealed block in P frames.
Wireless Emulator Demonstration
Authors: Glenn Judd, Peter Steenkiste
Venue: Proceedings of the Seventh IEEE Workshop on Mobile Computing Systems & Applications (2006)

Researchers have long faced a fundamental tension between the experimental realism of wireless testbeds on one hand, and the control and repeatability of simulation on the other hand. To overcome the stark tradeoff of these traditional alternatives, we are developing a wireless emulator that enables both realistic and repeatable experimentation by leveraging physical layer emulation.
Aggregate modeling for TCP sessions
Authors: H. Hassan, J.-M. Garcia
Venue: Proceedings of the 2nd ACM international workshop on Wireless multimedia networking and performance modeling (2006)

In this paper, we characterize the superposition of TCP sessions and we study the influence of transmission parameters on traffic burstiness. Particularly, we show the relation between TCP traffic characteristics and the loss rate observed on transmission links. Then we propose aggregate traffic model for TCP sessions allowing faster execution while preserving TCP sessions dynamic behavior. The results show that our aggregate TCP session model is suitable when activity periods are very short compared to idle periods. In particular, this is true in wireless networks