ppxscal/embedding_network huggingface dataset:
Using back-propagation to learn association rules for service personalization
Authors: Yo-Ping Huang, Wei-Po Chuang, Ya-Hui Ke, Frode-Eika Sandnes
Venue: Expert Systems with Applications: An International Journal (2008)

A novel, practical and efficient strategy for providing personalization for online shoppers is proposed. Based on shoppers' previous purchasing behavior and the customer's previous choices the strategy is capable of suggesting relevant and desirable products to each customer accurately. The strategy is based on training a back-propagation neural network with association rules that are mined from a transactional database. Unlike most strategies that only consider the relationship between the purchased items, the proposed strategy also incorporates additional influential attributes such as the price of items and their merchandise category. A powerful confidence estimate is used to rank the suggestions. Experimental evidence is provided to demonstrate the effectiveness of the proposed strategy.
More than meets the eye: transforming the user experience of home network management
Authors: Erika Shehan Poole, Marshini Chetty, Rebecca E. Grinter, W. Keith Edwards
Venue: Proceedings of the 7th ACM conference on Designing interactive systems (2008)

As computing migrates from the workplace to the home, householders must tackle problems of home network maintenance. Often they lack the technical knowledge or motivation to complete these tasks, making the user experience of home network maintenance frustrating. In response to these difficulties, many householders rely on handwritten reminders or interactive networking tools that are ill-suited for the home environment. In this paper, we seek to understand how to design better home network management tools through a study of sketches created by 40 people in 18 households. In our study, we obtained information about householders' knowledge, practices and needs with respect to home networking. Based on our results, we present guidelines for transforming the user experience of home network management.
An adaptive EMD embedding method by condensing secret messages based on consecutive ones transformation and token substitution
Authors: Chin-Feng Lee, Yi-Ren Wang, Chin-Chen Chang
Venue: Proceedings of the 2nd international conference on Ubiquitous information management and communication (2008)

A new exploiting modification direction embedding method (also called the EMD embedding for short) was proposed by Zhang et al. to show that their proposed method has high embedding capacity and high stego-image quality as well because at most one cover pixel need increase/decrease by one among n cover pixels. Adopting the advantages of the EMD embedding method, we develop a condensed technique based on consecutive ones transformation and token representation to squeeze out of more embedding spaces for secret data to be embedded in a cover image. This contributes data embedding capacity.
Some implications of the modified forms of the first and the second laws of thermodynamics and the variational principles in chemically reactive systems
Authors: Siavash H. Sohrab
Venue: Proceedings of the 9th WSEAS International Conference on Systems (2005)

The application of a scale-invariant statistical theory of fields to statistical thermodynamics is discussed. Defining the Boltzmann constant as Kk = k = mk < vk > c =1.381×10-23 J/K, Kelvin absolute temperature scale becomes a length scale. The thermal equilibrium between matter and radiation fields is described. The modified definition of temperature results in the speed of sound in atmosphere 358 m/s and a modified mechanical equivalent of heat equal to the universal gas constant J = Rº. The physical foundation of the first and the second laws of thermodynamics are described in terms of two new state variables defining the reversible heat Qrev = TS and the reversible work Wrev = PV. The variational principles in reactive systems are described in terms of an invariant Lagrangian defined as Lβ =Uβ = Qβ - Wβ + Gβ = Kβ - Πβ + Lβ-1.
Automated Diagnosis System to Support Colon Cancer Treatment: MATCH
Authors: Jawed Siddiqi, Babak Akhgar, Alicja Gruzdz, Ghasem Zaefarian, Aleksandra Ihnatowicz
Venue: Proceedings of the Fifth International Conference on Information Technology: New Generations (2008)

The most uncertain and difficult medical decision in Colon Cancer (CC) is the selection of the most personalized treatment option [1, 4, 5, 7, 12, 13]. MATCH Automated Diagnosis System has been primarily developed to target those obstacles, assisting clinicians in the post-diagnosis phases of the investigations. MATCH system is being currently fed with hundreds of data samples that range from clinical information (including follow-up from every treatment applied), tumor markers [1], proteomic sequences, gene suppressors and SNPs functional correlations. Each dimension of the data is described in MATCH CC ontology. The importance of all data attributes and the corresponding processing information is modifiable, but the default statistical model has been developed together with oncology experts from Jagiellonian Medial College and FONDAZIONE IOM. Health professionals using MATCH system will be able to query the database of anonymised clinical and molecular information. In this paper we will present a design of the MATCH system with the special emphasis on the semantic modeling as the authors' contribution to the project. The MATCH CC ontology, created as a part of knowledge management layer, is a basis of MATCH logical architecture and processing [2, 3]. The MATCH system is developed with Web-Services, which assure the interoperability between hospitals, pharmaceutical laboratories and research centers, which have access and possibility to exchange samples, mined information and data models
Self-oscillating auxiliary medium open loop power supply deploying Boost EIE converter
Authors: L. C. Gomes de Freitas, F. R. S. Vincenzi, E. A. A. Coelho, J. B. Vieira,  Jr., L. C. de Freitas
Venue: Proceedings of the 9th International Conference on Circuits (2005)

A new proposal of switched power oscillator with reduced conduction losses, zero voltage and zero current turning on, and zero voltage turning off, is presented in this paper. The proposed topology consists on a Boost EIE converter operating in continuous conduction mode (CCM) associated to a self-oscillating LC series resonant circuit. This new self-oscillating power oscillator can be applied as an inverter stage of electronic Ballast for fluorescent lamps as well as medium open loop power supply. Circuit description, simplified design guide line and experimental results of a 15.7 W self-oscillating auxiliary medium open loop power supply implemented in laboratory are presented.
Why the grass may not be greener on the other side: a comparison of locking vs. transactional memory
Authors: Paul E. McKenney, Maged M. Michael, Jonathan Walpole
Venue: Proceedings of the 4th workshop on Programming languages and operating systems (2007)

The advent of multi-core and multi-threaded processor architectures highlights the need to address the well-known shortcomings of the ubiquitous lock-based synchronization mechanisms. The emerging transactional-memory synchronization mechanism is viewed as a promising alternative to locking for high-concurrency environments, including operating systems. This paper presents a constructive critique of locking and transactional memory: their strengths, weaknesses, and challenges
Optimal bi-weighted binary trees and the complexity of maintaining partial sums
Authors: H. Hampapuram, M. L. Fredman
Venue: Proceedings of the 1993 IEEE 34th Annual Foundations of Computer Science (1993)

Let A be an array. The partial sum problem concerns the design of a data structure for implementing the following operations. The operation update(j,x) has the effect, A[j]/spl larr/A[j]+x, and the query operation sum(j) returns the partial sum, /spl Sigma//sub i=1//sup j/A[i]. Our interest centers upon the optimal efficiency with which sequences of such operations can be performed, and we derive new upper and lower bounds in the semi-group model of computation. Our analysis relates the optimal complexity of the partial sum problem to optimal binary trees relative to a type of weighting scheme that defines the notion of bi-weighted binary tree.
Exact solutions of discrete complex cubic Ginzburg-Landau equation via extended tanh-function approach
Authors: Chao-Qing Dai, Xu Cen, Sheng-Sheng Wu
Venue: Computers Mathematics with Applications (2008)

In this paper, we obtained rich solutions for the discrete complex cubic Ginzburg-Landau equation by means of the extended tanh-function approach. These solutions include chirpless bright soliton, chirpless dark soliton, triangular function solutions and some solutions with alternating phases, and so on. Meanwhile, the range of parameters where some exact solution exists is given.
A hybrid wavelet analysis and support vector machines in forecasting development of manufacturing
Authors: Xuesong Guo, Linyan Sun, Gang Li, Song Wang
Venue: Expert Systems with Applications: An International Journal (2008)

This paper proposes a hybrid methodology that exploits strengths of wavelet analysis and support vector machine model in forecasting time series, and deals with the application of proposed methodology in manufacturing time series forecasting. This method is characteristic of the preprocessing of sample data using wavelet transformation for forecast, i.e., the data sequence of evolvement of share of some sectors in manufacturing is first mapped into several time-frequency domains, and then a support vector machine is established for each domain. The final forecasting results are the algebraic sums of all the forecasted components obtained by respective support vector machine models corresponding to different time-frequency domains. Nevertheless, one of disadvantages of the method is dilemma of selection of values of parameters in support vector machine because the way of selecting values for the parameters will affect the generalization performance remarkably. In this paper, chaos optimization is applied to accomplish selection of values of parameters. Results of experiments based on gross values of textile product in Japan suggest that this hybrid method can both achieve higher accuracy in manufacturing forecasting.
Localized multiple kernel learning
Authors: Mehmet Gönen, Ethem Alpaydin
Venue: Proceedings of the 25th international conference on Machine learning (2008)

Recently, instead of selecting a single kernel, multiple kernel learning (MKL) has been proposed which uses a convex combination of kernels, where the weight of each kernel is optimized during training. However, MKL assigns the same weight to a kernel over the whole input space. In this paper, we develop a localized multiple kernel learning (LMKL) algorithm using a gating model for selecting the appropriate kernel function locally. The localizing gating model and the kernel-based classifier are coupled and their optimization is done in a joint manner. Empirical results on ten benchmark and two bioinformatics data sets validate the applicability of our approach. LMKL achieves statistically similar accuracy results compared with MKL by storing fewer support vectors. LMKL can also combine multiple copies of the same kernel function localized in different parts. For example, LMKL with multiple linear kernels gives better accuracy results than using a single linear kernel on bioinformatics data sets.
Experiences with Electronic Health Records
Authors: Jens Edlef Møller, Henrik Vosegaard
Venue: IT Professional (2008)

The healthcare system in Denmark is well known for its high level of IT support and interoperability. Not surprisingly, some of the solutions developed here apply elsewhere, but others have turned out to be harder to migrate.
Research issues in next generation DBMS for mobile platforms
Authors: Sang-Won Lee, Gap-Joo Na, Jae-Myung Kim, Joo-Hyung Oh, Sang-Woo Kim
Venue: Proceedings of the 9th international conference on Human computer interaction with mobile devices and services (2007)

Recently, flash memory(in particular, NAND) is being rapidly deployed as data storage for mobile platforms such as PDAs, MP3 players, mobile phones and digital cameras, mainly because of its many advantages over its competitor, hard disk, including its low electronic power, non-volatile storage, high performance, physical stability, smaller size, light weight, and portability. Considering its rapid technical improvement both in capacity and speed, it will have a competitive advantage over its rivalry minidrive (i.e. a small size hard disk) under 100 Gbytes within a few years, As the applications in next generation mobile platforms become large, complex, and more data-oriented, they requires the database technology, because the file interface is too complex to manage their complicated data requirements. However, flash memory, compared to hard disk, has a few unique characteristics, and thus the traditional disk-based database technology does not seem to go well with flash memory. Therefore, we need to revisit almost every aspect of DBMS implementation techniques from the perspectives of flash memory. In this paper, we introduce the technical characteristics of flash memory, which we think might have huge impact on database performance to database community that are 1) no-overwrite (erase-before-write paradigm), 2) asymmetric read and write speed, and 3) no seek or rotation time. These small differences necessitate us to revisit all the major DBMS modules which have evolved over the several decades. Based on the characteristics, we identify several key issues in implementing major DBMS modules, and suggest alternative approaches to solve the issues. The topics covered in this article are neither comprehensive nor in-depth, but the main goal of this article is just to issue that a practical and urgent research topic is ahead and it poses us many challenges and opportunities.
High-order validated representation of Poincaré maps
Authors: Johannes Grote, Kyoko Makino, Martin Berz
Venue: Proceedings of the 5th WSEAS/IASME International Conference on Systems Theory and Scientific Computation (2005)

For many questions in dynamical systems theory it is desirable to have Poincaré maps available as a tool to study long-term behavior of the dynamical system under consideration. In a validated setting, the Poincaré map should be defined over as large a domain as possible. Taylor model based validated integrators relate final coordinates to initial conditions via a high-order polynomial and a small remainder bound, which usually is many orders of magnitude smaller than the initial domain. It is shown how it is possible to obtain a Taylor model representation of the Poincaré map from the original Taylor model flow representation of the ODE. First a high-order polynomial approximation of the time necessary to reach the plane of the Poincaré map is determined as a function of the initial conditions. This is achieved by reducing the problem to a non-validated polynomial inversion. This approximate representation is inserted into the Taylor model of the time-dependent flow, leading to an approximate Poincaré map. A validated correction is performed that provides a rigorous enclosure of the Poincaré map.
Recognition of Moving Terrestrial Targets in the Presence of Terrestrial Clutters with a Pulse Doppler RADAR
Authors: Mohammad Alaee, Hamidreza Amindavar, Ali Moghaddamjoo Reza
Venue: Proceedings of the Tenth International Conference on Computer Modeling and Simulation (2008)

In this paper we propose an automatic target recognitionalgorithm to recognize and distinguish of three classes oftargets: personnel, wheeled vehicles and animals, based on thedoppler signatures they produce when moving, using a low-resolutionground surveillance pulse doppler RADAR. Using signal processingtechniques such as the short-time Fourier transform (STFT)and the chirplet transform, various parameters of the targets canbe extracted from the signal. This paper proposed classification ofmoving targets with use of the chirplet transform. The algorithmwas trained and tested on real radar signatures of multiple examplesof moving targets from each class and the performance wasshown to be invariant to target speed and orientation.
A simple linear time certifying LBFS-based algorithm for recognizing trivially perfect graphs and their complements
Authors: Frank Pok Man Chu
Venue: Information Processing Letters (2008)

We introduce a simple, linear time algorithm for recognizing trivially perfect (TP) graphs. It improves upon the algorithm of Yan et al. [J.-H. Yan, J.-J. Chen, G.J. Chang, Quasi-threshold graphs, Discrete Appl. Math. 69 (3) (1996) 247-255] in that it is certifying, producing a P"4 or a C"4 when the graph is not TP. In addition, our algorithm can be easily modified to recognize the complement of TP graphs (co-TP) in linear time as well. It is based on lexicographic BFS, and in particular the technique of partition refinement, which has been used in the recognition of many other graph classes [D.G. Corneil, Lexicographic breadth first search-a survey, in: WG 2004, in: Lecture Notes in Comput. Sci., vol. 3353, Springer, 2004, pp. 1-19].
Efficient transmission of vector data over the Internet
Authors: Bisheng Yang, Ross Purves, Robert Weibel
Venue: International Journal of Geographical Information Science (2007)

This paper proposes and implements a new methodology for progressive transmission of vector lines and polygons over the Internet. The methodology generates continuous vector data through constrained remove operations of vertices on the server side, maintains consistent topology via a set of constraint rules, and restores original vector data through a reconstruction operator on the client side. The prototype system was implemented to investigate the performance of the methodology in terms of the preservation of consistent topology, transmission time, and qualities of the resulting visualizations. The method is shown to be scalable to large data sets, to produce graphically acceptable results and to maintain topology.
Toward governance of emergent processes and adaptive organizations
Authors: Peri Tarr, Clay Williams, Brent Hailpern
Venue: Proceedings of the 1st international workshop on Software development governance (2008)

We propose to treat software development processes and software development organizations as adaptive and emergent entities: ones whose properties are not decidable a priori, but rather, which result from ongoing and continuous response to external stimuli, such as evolving requirements, new enterprise priorities, and changes in available resources. In this paper, we present a view of some important issues that must be addressed to govern such organizations. We provide what we think are interesting starting points for a discussion, as well as a few important questions to address during the workshop.
Actionable business intelligence: how to make it available through service-oriented architectures
Authors: Zeljko Panian
Venue: Proceedings of the 2nd WSEAS International Conference on Computer Engineering and Applications (2008)

The paper discusses the main characteristics of Service-oriented Architecture and examines the feasible ways of using business intelligence solutions as Web services in an SOA environment. With the evolution of Web services, organizations are becoming more sophisticated in their goals for and requirements of this technology as it offers faster and more flexible deployment, customization and easy integration of BI solutions. Those organizations that choose a Web services strategy will be best positioned to deliver BI content across and beyond the enterprise, making BI accessible to everyone, wherever they work, at a lower cost and in more innovative ways.
Stream firewalling of xml constraints
Authors: Michael Benedikt, Alan Jeffrey, Ruy Ley-Wild
Venue: Proceedings of the 2008 ACM SIGMOD international conference on Management of data (2008)

As XML-based messages have become common in many client-server protocols, there is a need to protect application servers from invalid or dangerous messages. This leads to the XML stream firewalling problem; that of applying integrity constraints against a large number of simultaneous streams. We conduct the first investigation of a constraint engine optimized for the generation of XML stream firewalls. We isolate a class of DTDs and XPath constraints which support the generation of low-space filters, and provide algorithms for generating firewalls with low per-input-character time and per-stream space. We give experimental results which show that we have achieved these goals in practice.
A Study on Composite System Vulnerability through CC Analysis
Authors: Jae-gu Song, Seoksoo Kim
Venue: Proceedings of the 2008 International Conference on Multimedia and Ubiquitous Engineering (2008)

In this study, CC Version 3.0 is analyzed to Propose a method and a set of standards for evaluating vulnerability of the composite system for conducting the serviceable range per composite product class and TOE analysis, secure protection and guidelines for composite product.
Towards generic and flexible web services for e-assessment
Authors: Mario Amelung, Peter Forbrig, Dietmar Rösner
Venue: Proceedings of the 13th annual conference on Innovation and technology in computer science education (2008)

In computer science education, lectures are typically accompanied by exercise courses and/or lab practices are essential for the learning effect since they provide opportunities for students to apply their theoretical knowledge to practical problems. The automatic testing and assessment of assignments in a Web-based environment offers students more learning possibilities (e.g., time and location-independent) with immediate feedback and helps teachers to reduce their workload so they can concentrate on issues regarding content and didactics. In this paper we present a generic, flexible, and reusable Web-based system architecture and its implementation for automatic testing of programming assignments and assignments in other formal systems. We also describe our practical experience gathered with this approach in computer science courses at two different universities.
Arcade - A Formal, Extensible, Model-Based Dependability Evaluation Framework
Authors: Hichem Boudali, Pepijn Crouzen, Boudewijn R. Haverkort, Matthias Kuntz, Mariëlle Stoelinga
Venue: Proceedings of the 13th IEEE International Conference on on Engineering of Complex Computer Systems (2008)

This paper discusses the requirements that a suitable formalism for dependability modeling/evaluation should possess. We also discuss the outline of Arcade, an architectural dependability formalism that we are developing.