ppxscal/embedding_network huggingface dataset:
A Study on the Dynamic Time Warping in Kernel Machines
Authors: Hansheng Lei, Bingyu Sun
Venue: Proceedings of the 2007 Third International IEEE Conference on Signal-Image Technologies and Internet-Based System (2007)

The Dynamic Time Warping (DTW) is state-of-the-art distance measure widely used in sequential pattern matching and it outperforms Euclidean distance in most cases because its matching is elastic and robust. It is tempting to substitute DTW distance for Euclidean distance in the Gaussian RBF kernel and plug it into the state-of-the art classifier Support Vector Machines (SVMs) for sequence classification. However, it is not straightforward that DTW also outperforms Euclidean distance in kernel machines. While counter-examples can be found to numerically provethat DTW is not Positive Definite Symmetric (PDS)acceptableby SVM, little is known why it can not be PDS theoretically. We analyze the DTW kernel and complete a theoretical proof via the connection between PDS kernel and Reproducing Kernel Hilbert Space (RKHS). Our analysis leads to a better understanding that all Hilbertian metrics can be be converted to a PDS kernel in the Gaussian form, while the reverse is not true. The proof can be extended to conclude that elastic matching distance is not eligible to construct PDS kernels (e.g., Edit distance). Experiments were conducted to compare the RBF-kernel and DTW kernel in SVM classifications and the results show that simple Euclidean distance outperforms DTW in kernel machines.
Mechanizing a Correctness Proof for a Lock-Free Concurrent Stack
Authors: John Derrick, Gerhard Schellhorn, Heike Wehrheim
Venue: Proceedings of the 10th IFIP WG 6.1 international conference on Formal Methods for Open Object-Based Distributed Systems (2008)

Distributed algorithms are inherently complex to verify. In this paper we show how to verify that a concurrent lock-free implementation of a stack is correct by mechanizing the proof that it is linearizable, linearizability being a correctness notion for concurrent objects. Our approach consists of two parts: the first part is independent of the example and derives proof obligations local for one process which imply linearizabilty. The conditions establish a (special sort of non-atomic) refinement relationship between the specification and the concurrent implementation. These are used in the second part to verify the lock-free stack implementation. We use the specification language Z to describe the algorithms and the KIV theorem prover to mechanize the proof.
A Developmental Gene Regulation Network for Constructing Electronic Circuits
Authors: Song Zhan, Julian F. Miller, Andy M. Tyrrell
Venue: Proceedings of the 8th international conference on Evolvable Systems: From Biology to Hardware (2008)

We present a method for constructing electronic circuits that uses analogues of biological multi-cellular development, genetic regulatory networks, and transcription and translation processes to build circuits. We show how small circuits may be evolved and how they may be reused to build larger circuits. We also demonstrate that the artificial `organisms' are capable of regeneration so that circuit functionality can be recovered after damage.
Characteristics analysis for small data set learning and the comparison of classification methods
Authors: Fengming M. Chang
Venue: Proceedings of the 7th WSEAS International Conference on Artificial intelligence, knowledge engineering and data bases (2008)

In recent years, there has been a tremendous growth in the studies of the small data set learning methods in the condition of the paucity of data. Without double, information in data of small size is scarced and have some learning limit. As well as each classification method has its property. A method is the best solution for one data but is not the best for another. This article analyzes the characteristics of small data set learning. The Mega-fuzzification method for small data set learning is applied mainly. The comparison of different classification methods for small data set learning is also presented.
Transactions on Rough Sets VIII, 1 edition
Authors: James F. Peters, Andrzej Skowron
Venue: Lecture Notes In Computer Science (2008)

The LNCS journal Transactions on Rough Sets is devoted to the entire spectrum of rough sets related issues, from logical and mathematical foundations, through all aspects of rough set theory and its applications, such as data mining, knowledge discovery, and intelligent information processing, to relations between rough sets and other approaches to uncertainty, vagueness, and incompleteness, such as fuzzy sets and theory of evidence. This book, which constitutes the eighth volume of the Transactions on Rough Sets series, contains a wide spectrum of contributions to the theory and applications of rough sets. The17 papers presented explore several research streams and introduce a number of new advances in the foundations and applications of artificial intelligence, engineering, logic, mathematics, and science.
Finding Synchronization-Free Slices of Operations in Arbitrarily Nested Loops
Authors: Anna Beletska, Wlodzimierz Bielecki, Krzysztof Siedlecki, Pierluigi San Pietro
Venue: Proceedings of the international conference on Computational Science and Its Applications, Part II (2008)

This paper presents a new approach for extracting synchronization-free parallelism being represented by dependent statement instances of an arbitrarily nested loop. Presented algorithms can be applied to both uniform and non-uniform loops. The main advantage is that more synchronization-free parallelism may be extracted than that yielded by existing techniques. Our approach, based on operations on relations and sets, requires exact dependence analysis, such as the one by Pugh and Wonnacott, where dependences are found in the form of tuple relations. Results of experiments with the NAS benchmark are presented.
The effects of change control and management review on software flexibility and project performance
Authors: Eric T. G. Wang, Pei-Hung Ju, James J. Jiang, Gary Klein
Venue: Information and Management (2008)

Software flexibility and project efficiency are deemed to be desirable but conflicting goals during software development. We considered the link between project performance, software flexibility, and management interventions. Specially, we examined software flexibility as a mediator between two recommended management control mechanisms (management review and change control) and project performance. The model was empirically evaluated using data collected from 212 project managers in the Project Management Institute. Our results confirmed that the level of control activities during the system development process was a significant facilitator of software flexibility, which, in turn, enhanced project success. A mediator role of software flexibility implied that higher levels of management controls could achieve higher levels of software flexibility and that this was beneficial not only to the maintainability of complex applications but also to project performance.
Improvements BER with convolutional codes and multilevel coded modulation
Authors: Marius-Cristian Niculescu, Elena Niculescu
Venue: Proceedings of the 7th WSEAS International Conference on Electronics, Hardware, Wireless and Optical Communications (2008)

The paper compares some new methods for coded modulation constructions using multilevel codes obtained by combining channel coding and digital modulation. As reference examples are presented schemes based on phase shift keying. The comparison parameter is the bit error rate and consequently structures for optimal receivers are discussed. In particular it is shown how multistage decoding can be improved by using interleaving blocks between the three levels of the decoding structure and which are the advantages obtained - the increase in reliability, additional coding gains, a modest complexity of the structure, but with an undesired increased decoding delay. Finally the role of time diversity encoding in improving transmission performances on nongaussian channels is presented.
Artificial Neural Networks Models with Fuzziness and Chaos Phenomena
Authors: Algis Garliauskas
Venue: Informatica (2003)

We consider a generalized model of neural network with a fuzziness and chaos. The origin of the fuzzy signals lies in complex biochemical and electrical processes of the synapse and dendrite membrane excitation and the inhibition mechanism. The mathematical operations included into fuzzy neural network modeling are: the scalar product between inputs of layers and synaptic weights is replaced by a fuzzy logic multiplication, the sum of products changes to the fuzzy logic sums, and the operators such as supremum, maximum, and minimum are presented for a fuzzy description. The algorithm of varying membership functions, built basing on a backpropagation paradigm and a method of fuzzy neural optimization, has been considered. Both fuzzy properties and a chaos phenomenon are analyzed basing upon experimental computations.
Consumer perceptions of apparel products in internet shopping
Authors: Mi-Jung Kim
Venue:  (2007)

The purpose of the present study was to determine consumer perceptions of apparel products in Internet shopping. According to the existing literature, four categories of perceptions play primary roles for apparel shopping consumer decisions: apparel appearance, apparel comfort, fabric characteristics, and apparel fit. The present study aimed to observe how consumers examine apparel products and focused on the role of consumers&rsquo; apparel product perceptions in making their purchase decisions within an Internet shopping environment. Research methods resulting in qualitative data were utilized to observe how consumers navigate Web sites and search for the information needed to make purchase decisions. Participants were asked to access their favorite apparel Web site and go through their decision making process for selecting one apparel item to purchase. Observations were made regarding navigation patterns. Participants were also asked about specific product perceptions. Interviews were conducted with 26 female participants and lasted from 30 minutes to 1 hour. All interviews were audio-recorded and transcribed. Emergent themes from the interviews were identified and factors related to consumers&rsquo; decision making processes were outlined. The results of the study showed how participants shopped for apparel products on the Web site using certain information. First, participants mentioned both positive and negative perceptions with Internet apparel shopping in general. Second, participants preferred certain Web sites based on their Internet shopping motivations. Third, based on Web site navigational patterns, five types of Internet apparel shoppers were identified: category shopper, bargain shopper, trend seeker, brand shopper, and visual shopper. Fourth, perceptions of apparel product value and quality were based on specific perceptions of image, comfort, fabric characteristics, and fit. The factors in each of these categories were examined and evaluated in relation to their importance in consumers&rsquo; purchase decisions. Lastly, additional factors were used by participants in Internet apparel shopping decision making including: price, country of origin, shipping and handling fees, and return policies. The results of this study further our understanding of consumer behavior of the apparel products in the Internet environment and can provide needed information to Internet apparel retailers as they strive to create effective and useful Internet shopping environments. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
The convergence of wireless, mobility, and the Internet and its relevance to enterprises
Authors: Andrew M. Seybold
Venue: Information-Knowledge-Systems Management (2008)

Convergence will have an effect on every aspect of an enterprise. Exactly what is convergence and how will we get there? This paper examines how new technologies have traditionally entered the workplace, how this process is changing and the implications for enterprises as they enter a new world of converged communications. Part of the convergence experience is to make information easily available no matter what type of device we are using or where we are. Convergence, based on a set of smart networks, smart devices and a new approach to the Wireless Internet, will help us manage all of our telecommunications requirements on an ongoing basis.
Designing a Scanning On-Screen Keyboard for People with Severe Motor Disabilities
Authors: Yun-Lung Lin, Ting-Fang Wu, Ming-Chung Chen, Yao-Ming Yeh, Hwa-Pey Wang
Venue: Proceedings of the 11th international conference on Computers Helping People with Special Needs (2008)

This study aims to explore the effectiveness of a scanning on-screen keyboard for persons with severe motor disabilities. In order to enhance the typing performance, the on-screen keyboard employs the group-row-column scanning and a frequency-of-use layout. Besides the international alphabetical layout, the on-screen keyboard also provides two Chinese selection layouts for Chinese users. The usability evaluation was carried out with simulations and experiments. The usability evaluation was conducted to compare the performance with that of the QWERTY layout of block scanning built in Microsoft Windows XP. The results demonstrated that the performance of using the scanning on-screen keyboard was better than that of using the Windows XP. No significant difference between the error rates of the two different keyboards was found.
Variable precision rough set for group decision-making: An application
Authors: Gang Xie, Jinlong Zhang, K. K. Lai, Lean Yu
Venue: International Journal of Approximate Reasoning (2008)

This study uses the variable precision rough set (VPRS) model as a tool to support group decision-making (GDM) in credit risk management. We consider the case that the classification in decision tables consisting of risk exposure (RE) may be partially erroneous, and use a variable precision factor @b"k to adjust the classification error. In this paper, we firstly combine VPRS and AHP to obtain the weight of condition attribute sets decided by each decision-maker (DM). Then, the integrated risk exposure (IRE) of attributes is obtained based on the three VPRS-based models. Subsequently, a new procedure of obtaining @b"k-stable intervals for DM"k is investigated. To verify the effectiveness of these proposed methods, an illustrative example is presented. The experimental results suggest that the VPRS-based IRE have advantages in recognizing important attributes.
A Confident Majority Voting Strategy for Parallel and Modular Support Vector Machines
Authors: Yi-Min Wen, Bao-Liang Lu
Venue: Proceedings of the 4th international symposium on Neural Networks: Advances in Neural Networks, Part III (2007)

Support vector machines (SVMs) have been accepted as a fashionable method in machine learning community, but they cannot be easily scaled to handle large scale problems because their time and space complexities are around quadratic in the number of training samples. To overcome this drawback of conventional SVMs, we propose a new confident majority voting (CMV) strategy for SVMs in this paper. We call the SVMs using the CMV strategy CMV-SVMs. In CMV-SVMs, a large-scale problem is divided into many smaller and simpler sub-problems in training phase and some confident component classifiers are chosen to vote for the final outcome in test phase. We compare CMV-SVMs with the standard SVMs and parallel SVMs using majority voting (MV-SVMs) on several benchmark problems. The experiments show that the proposed method can significantly reduce the overall time consumed in both training and test. More importantly, it can produce classification accuracy, which is almost the same as that of standard SVMs and better than that of MV-SVMs.
A wireless ad hoc protocols comparison study: DSR, AODV and IWAR
Authors: Hamed El-Afandi, Hossein Hosseini, K. Vairavan
Venue: Journal of Computational Methods in Sciences and Engineering (2006)

Wireless ad hoc networks are relatively new and are gaining ground in research due to promises they offer. Wireless ad hoc networks do not require predefined configuration and have no fixed infrastructure. They are self-organizing and self-configuring networks. Several protocols have been developed that vary in the performance and complexity. Dynamic Source Routing (DSR) is a well-known pure on-demand protocol. It is a simple protocol and it was designed to have low overhead. But it does not select the optimal routes all the times. Ad Hoc On-Demand Distance-Vector (AODV) protocol is a wireless ad hoc protocol that makes its routing decision based on the distance vector. The Intelligent Wireless Ad hoc Routing (IWAR) is newly introduced protocol that it is also dynamic on-demand protocol. It implements more complex algorithm to select optimal routes and provide load balancing. This paper describes the DSR and AODV protocols, presents the design of the IWAR protocol, and compares the complexity, optimality, overhead traffic and fault tolerance of these protocols.
Enterprise configuration management in a service-oriented architecture environment delivering it services
Authors: Gary Grimes
Venue:  (2007)

Information Technology (IT) is a collaboration environment for business and engineering. The past decade has seen a reduction in business understanding of engineering principles because of the lack of trained engineers working in IT, while businesses have become increasingly dependent upon new and complex technologies. These new technologies, often still evolving, are system-of-systems environments and present significant challenges to early implementers. Service-Oriented Architecture (SOA) is one such system-of-systems that pushes the discipline of Software Configuration Management (SCM) beyond traditionally defined bounds. Evolving standards associated with SOA and the nature of SOA contribute to these challenges of governance and management: loose coupling of service operations, brokerage of third-party services, and virtualization of workspaces and environments. This study resulted from an effort to bring a complex application with SOA Web Services (WS) under Configuration Management (CM) in parallel with defining CM process and procedures for the IT division of a Fortune 100 financial corporation. Research into the discipline of CM and the implementation of process management identified the need for further research into the CM of information-based rather than product-based systems. Capability Maturity Model Integration (CMMI) is a process improvement strategy widely used by software &ldquo;product&rdquo; development and manufacturing, which includes engineering processes. Typically identified as a level 2 maturity process, applying CM in an unstructured environment in which a knowledge of engineering principles is lacking correlates to building the second floor of a building with no foundation or first floor. IT Service Management (ITSM), as implemented through the IT Infrastructure Library (ITIL), can provide the foundation and structured framework required for businesses delivering information-based services to successfully apply the engineering discipline of CM. As depicted in ITIL version 2, two major issues were corrected through the application and integration of engineering fundamentals: (1) consolidation of the processes for configuration, change, and release management following IEEE SCM standards and (2) defining IT Awareness System (ITAS) requirements suggested in the ITIL Configuration Management Database (CMDB)/IT Service Catalog. Research results have contributed to the bodies of knowledge for software engineering, engineering management, and communications engineering.
Development and Validation of a Physics-Based Brain Atlas
Authors: Chunping Gao, Francis E. H. Tay, Wieslaw L. Nowinski
Venue: Proceedings of the 2008 International Conference on Convergence and Hybrid Information Technology (2008)

This paper aims to develop and validate an innovative digital model of the human brain for medical applications. This model, or physics-based brain atlas, combines inputs from both medical imaging processing and biomechanics of the brain. Emphasis is given to the validation aspect of this model for which both geometric and biomechanical validation was carried out. Quantitative measurements of the model's accuracy were studied. An indentation experiment was conducted with its numerical simulation. The results suggested the proposed model, with qualitative measurements of its fidelity obtained from its validation process, may be adopted as a useful tool in brain deformation applications.
Systematic Website Verification for Privacy Protection
Authors: Ji-Hee Jeoung, Eun-Ji Shin, Seng-Phil Hong, Sung-Hoon Kim, In-Ho Kim, Min-Woo Lee
Venue: Proceedings of the 2008 The Fourth International Conference on Information Assurance and Security (2008)

The Internet is now a prime vehicle for business, community, and personal interactions. The privacy of individuals sensitive information has become a major concern of consumers who use the Web to purchase goods or obtain services in web-based computing environments. In this paper, we analyze the risks pertaining to various websites in Korea, and propose the Dynamic Website Verification System (DWVS) for minimizing illegal sharing of sensitive information. We also demonstrate the feasibility of our framework through a proof-of concept implementation.
Impact of QoS on Replica Placement in Tree Networks
Authors: Anne Benoit, Veronika Rehn, Yves Robert
Venue: Proceedings of the 7th international conference on Computational Science, Part I: ICCS 2007 (2007)

This paper discusses and compares several policies to place replicas in tree networks, subject to server capacity and QoS constraints. The client requests are known beforehand, while the number and location of the servers are to be determined. We study three strategies. The first two strategies assign each client to a unique server while the third allows requests of a client to be processed by multiple servers. The main contribution of this paper is to assess the impact of QoS constraints on the total replication cost. In this paper, we establish the NP-completeness of the problem on homogeneous networks when the requests of a given client can be processed by multiple servers. We provide several efficient polynomial heuristic algorithms for NP-complete instances of the problem.
Logic for Automated Mechanism Design and Analysis
Authors: Michael Wooldridge
Venue: Proceedings of the 6th German conference on Multiagent System Technologies (2008)

Recent years have witnessed an explosion of interest in the issues surrounding the use of social choice mechanisms and economic resource allocation mechanisms in settings where the participants are computer programs. Algorithmic mechanism design, and the recent emergence of computational social choice theory are two examples of this growth of interest. If we take seriously the idea that computational agents will participate in economically inspired mechanisms, then it is natural to consider the questions of knowledge representation and reasoning for them. In this talk, we describe our work in this area, particularly as it relates to the specification and verification of social choice mechanisms, and coordination mechanisms such as social laws. We motivate and introduce the main research issues in the area, discussing, for example, the succinct representation of social choice rules, the complexity of reasoning with such representations, and the handling of preferences. We conclude by showing discussing the relationship of our work to mechanism design as it is understood in economics. The talk will report joint work with Thomas Agotnes (Bergen), Wiebe van der Hoek (Liverpool), Marc Pauly (Stanford), and Paul E. Dunne (Liverpool).