ppxscal/embedding_network huggingface dataset:
Face recognition with semi-supervised learning and multiple classifiers
Authors: Neamat El Gayar, Shaban A. Shaban, Sayed Hamdy
Venue: Proceedings of the 5th WSEAS International Conference on Computational Intelligence, Man-Machine Systems and Cybernetics (2006)

Face recognition using labeled and unlabelled data has received considerable amount of interest in the past years. In the same time, multiple classifier systems (MCS) have been widely successful in various pattern recognition applications such as face recognition. MCS have been very recently investigated in the context of semi-supervised learning. Very few attention has been devoted to verifying the usefulness of the newly developed semi-supervised MCS models for face recognition. In this work we attempt to access and compare the performance of several semi-supervised MCS training algorithms when applied to the face recognition problem. Experiments on a data set of face images are presented. Our experiments use nonhomogenous classifier ensemble, majority voting rule and compare between a three semi-supervised learning models: the self-trained single classifier model, the ensemble driven model and a newly proposed modified co-training model. Experimental results reveal that the investigated semi-supervised models are successful in the exploitation of unlabelled data to enhance the classifier performance and their combined output. The proposed semi-supervised learning model has shown a significant improvement of the classification accuracy compared to existing models.
Evaluation of fully-integrated switching regulators for CMOS process technologies
Authors: Jaeseo Lee, Geoff Hatcher Lieven Vandenberghe, Chih-Kong Ken Yang
Venue: IEEE Transactions on Very Large Scale Integration (VLSI) Systems (2007)

This paper presents a feasibile study of fully-integrated switching voltage regulators for power-optimized systems-on-chip (SoCs). In order to evaluate the power efficiency across a number of design variables, a compact macro-model of a regulator is created and validated. A key focus of the study is on the characteristics of the active and passive devices that are needed in order to maximize the efficiency of an on-chip regulator. With the macro-model, geometric programming is used to find the optimal characteristics for a given set of constraints such as load condition, process technology, and area. The achievable efficiencies for various current loads and across a range of technologies from 0.35-µm to 90-nm CMOS process are analyzed. The power efficiency is found to be strongly dependent on the inductor technology and over 70% efficiency is possible with advanced inductor technologies.
Holistic Information Security: ISO 27001 and Due Care
Authors: Edward H. Freeman
Venue: Information Systems Security (2007)

"The only truly secure system is one that is powered off, cast in a block of concrete and sealed in a lead-lined room with armed guards-and even then I have my doubts."-Gene Spafford, Professor of Computer Science, Purdue University
Abstract interpretation and types for systems biology
Authors: François Fages, Sylvain Soliman
Venue: Theoretical Computer Science (2008)

Abstract interpretation is a theory of abstraction that has been introduced for the analysis of programs. In particular, it has proved useful for organizing the multiple semantics of a given programming language in a hierarchy corresponding to different detail levels, and for defining type systems for programming languages and program analyzers in software engineering. In this paper, we investigate the application of these concepts to systems biology formalisms. More specifically, we consider the Systems Biology Markup Language SBML, and the Biochemical Abstract Machine BIOCHAM with its differential, stochastic, discrete and boolean semantics. We first show how all of these different semantics, except the differential one, can be formally related by simple Galois connections. Then we define three type systems: one for checking or inferring the functions of proteins in a reaction model, one for checking or inferring the activation and inhibition effects of proteins in a reaction model, and another one for checking or inferring the topology of compartments or locations. We show that the framework of abstract interpretation elegantly applies to the formalization of these further abstractions, and to the implementation of linear or quadratic time type checking as well as type inference algorithms. Furthermore, we show a theorem of independence of the graph of activation and inhibition effects from the kinetic expressions in the reaction model, under general conditions. Through some examples, we show that the analysis of biochemical models by type inference provides accurate and useful information. Interestingly, such a mathematical formalization of the abstractions commonly used in systems biology already provides some guidelines for the extensions of biochemical reaction rule languages.
IMPROVING THE STUDENT EXPERIENCE-HOW CAN THE LIBRARY HELP?
Authors: Jean Sykes
Venue: The New Review of Information Networking (2007)

This article begins by looking at changes in the student body in recent years as useful indicators of how libraries need to alter and adapt their student library provision. Among the concepts explored are the student as consumer-customer, the Google generation, greater than ever competition among students especially for the job market, new technology as fashion accessory as much as learning tool, the widening participation agenda for higher education, and the almost ubiquitous presence of multi-functional electronic devices. There is an examination of some challenges for librarians in meeting the needs and demands of this new generation of students. These include the balancing of electronic and print provision, the future of the physical library environment, push rather than pull to deliver library services, anytime anywhere access to information, integration with other university services, and helping to fit students for the world of work. The main message of the article is that librarians are not under threat from the giant search engines as long as they embrace the interactive technologies which students so willingly and expertly use, and adapt them to get library services out to students as customers.
Fast communication: A low complexity double-talk detector based on the signal envelope
Authors: Grzegorz Szwoch, Andrzej Czyewski, Maciej Kulesza
Venue: Signal Processing (2008)

A new algorithm for double-talk detection, intended for use in the acoustic echo canceller for voice communication applications, is proposed. The communication system developed by the authors required the use of a double-talk detection algorithm with low complexity and good accuracy. The authors propose an approach to double-talk detection based on the signal envelopes. For each of three signals: the far-end speech, the microphone signal and the echo estimate, an envelope is detected. Next, using these envelopes, a detection function is determined and compared to the threshold. Additionally, a dynamic threshold is introduced in order to improve the accuracy of the algorithm. The results of the simulations presented in the paper proved that the accuracy of double-talk detection obtained using the proposed algorithm is higher than in the Geigel algorithm and comparable to the correlation-based methods, while the computational complexity of the proposed method remains at an acceptable level. The double-talk detection algorithm presented here may be used in voice communication systems having limited resources, allowing for accurate double-talk detection and, as a consequence, efficient acoustic echo cancellation.
End-user development: new challenges for service oriented architectures
Authors: Christian Dörner, Volkmar Pipek, Moritz Weber, Volker Wulf
Venue: Proceedings of the 4th international workshop on End-user software engineering (2008)

Service Oriented Architectures (SOA) evolved as an important architectural concept in software engineering. Although the services of an SOA are loosely coupled and reusable, there have been few considerations of SOA in terms of End User Development (EUD). In this paper we will analyze the potential of SOA for the development of adaptable systems and propose challenges, which have to be solved to reach this goal. Our analysis is based on empirical studies and on requirements for EUD systems, taken from earlier research. If SOAs are extended with structures for in-use-modifications (even beyond software technologies), it will be possible to design a new generation of user-adaptable systems.
A Cause-Based Approach to Preventing Software Vulnerabilities
Authors: David Byers, Nahid Shahmehri
Venue: Proceedings of the 2008 Third International Conference on Availability, Reliability and Security (2008)

Security is often an afterthought in software development, sometimes even bolted on during deployment or in maintenance through add-on security software and penetrate-and-patch maintenance. We think that security needs to be an integral part of software development and that preventing vulnerabilities by addressing their causes is as important as detecting and fixing them. In this paper we present a method for determining how to prevent vulnerabilities from being introduced during software development. Our method allows developers to select the set of activities that suits them best while being assured that those activities will prevent vulnerabilities.Our method is based on formal modeling of vulnerability causes and is independent of the software development process being used.
On obstruction-free transactions
Authors: Rachid Guerraoui, Michal Kapalka
Venue: Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures (2008)

This paper studies obstruction-free software transactional memory systems (OFTMs). These systems are appealing, for they combine the atomicity property of transactions with a liveness property that ensures the commitment of every transaction that eventually encounters no contention. We precisely define OFTMs and establish two of their fundamental properties. First, we prove that the consensus number of such systems is 2. This indicates that OFTMs cannot be implemented with plain read/write shared memory, on the one hand, but, on the other hand, do not require powerful universal objects, such as compare-and-swap. Second, we prove that OFTMs cannot ensure disjoint-access-parallelism (in a strict sense). This may result in artificial "hot spots" and thus limit the performance of OFTMs.
Open source software in Slovenian primary and secondary schools
Authors: Mojca Tomazin, Miro Gradisar
Venue: Informatics in education (2007)

This article deals with the use of Open Source Software (OSS) at the primary and secondary level of education in Slovenia. The challenges and advantages of using OSS in educational processes are discussed. The main advantages of OSS are: economic freedom, stability, reliability and a possibility of making modifications but - on the other hand - the main problem for schools can be installation and support. The research carried out to determine the use of OSS in schools is described and the results are compared with the results of similar research studies in Germany, Sweden and UK. The results of both surveys show, that Linux and OpenOffice.org are the most popular OSS applications on computer desktops. The most important conclusion (according to our research) is that lack of knowledge prevents a faster introduction of OSS in education.
Efficient Data Dissemination in Mobile P2P Ad-Hoc Networks for Ubiquitous Computing
Authors: Do Hoon Kim, Myoung Rak Lee, Longzhe Han, Hoh Peter In
Venue: Proceedings of the 2008 International Conference on Multimedia and Ubiquitous Engineering (2008)

In this paper we propose Rank-Based Broadcast (RBB) algorithm using High Order Markov Chain (HOMC) with weight values in mobile p2p ad-hoc networks (MOPNET) for ubiquitous. RBB using HOMC focuses on the first step to improve the performance of Ubiquitous broadcast computing. The proposed model is characterized by its ability to optimize the receiving query and sending report for broadcasting with probabilistic priority by Markov assumption. Moreover, our model enhanced the reliability of broadcasting by weight value. In this paper we also set up a mobile p2p ad-hoc networks by Qualnet simulator which created the value of the specific configuration of mobile units and estimated the performance our model with other algorithm or ideal case.
Implementation and Analysis of a New Selection Strategy for Adaptive Routing in Networks-on-Chip
Authors: Giuseppe Ascia, Vincenzo Catania, Maurizio Palesi, Davide Patti
Venue: IEEE Transactions on Computers (2008)

Efficient and deadlock-free routing is critical to the performance of networks-on-chip. The effectiveness of any adaptive routing algorithm strongly depends on the underlying selection strategy. A selection function is used to select the output channel where the packet will be forwarded on. In this paper we present a novel selection strategy that can be coupled with any adaptive routing algorithm. The proposed selection strategy is based on the concept of Neighbors-on-Path the aims of which is to exploit the situations of indecision occurring when the routing function returns several admissible output channels. The overall objective is to choose the channel that will allow the packet to be routed to its destination along a path that is as free as possible of congested nodes. Performance evaluation is carried out by using a flit-accurate simulator under traffic scenarios generated by both synthetic and real applications. Results obtained show how the proposed selection strategy applied to the Odd-Even routing algorithm yields an improvement in both average delay and saturation point up to 20% and 30% on average respectively, with a minimal overhead in terms of area occupation. In addition, a positive effect on total energy consumption is also observed under near-congestion packet injection rates.
Web-based tool for automatic acceptance test execution and scripting for programmers and customers
Authors: Bruno C. Araújo, Anne Caroline Rocha, Arthur Xavier, Ana Isabella Muniz, Francilene P. Garcia
Venue: Proceedings of the 2007 Euro American conference on Telematics and information systems (2007)

Software testing is a software engineering practice that improves the quality of developed computer systems. It is a testing discipline strongly related to the agile software development method Extreme Programming (XP) [2], thus this paper examines acceptance tests mostly from a XP viewpoint. Nowadays, there are many online portals in which a large database of software projects can be found. If developers intent to run acceptance tests in those software, they must always have a complete development environment installed. In this paper, we present FLOAppTest, a visual online (remote) tool integrated to a collaborative environment (like Source Forge) that makes Java projects testing easy by offering a fashion to generate executable acceptance scripts with EasyAccept framework support.
Globally speaking
Authors: Trevor Wishart
Venue: Organised Sound (2008)

Cheaply available high-quality digital recording equipment, and the ubiquity of computer music tools and the Internet make the creation of electroacoustic music in diverse localities, and its dissemination around the globe, extremely easy. This raises important questions about the relationship of local sound worlds and cultural experience to a potentially global audience. This quandary is examined through the compositions Globalalia (which deals explicitly with speech material from many languages) and Fabulous Paris – a virtual oratorio whcih uses speech in different ways to contrast our relationship to the local and personal with our relationship to the mass experience of the globalised mega-city. The problems in relating to both a local and a global audience are considered in relation to the composer's current project recording speech materials in local communities in the North East of England.
Analysis on OPF and operational economy of electricity market: compositive impacts of slack bus voltage
Authors: Du Songhuai, Jiang Chuanwen
Venue: Proceedings of the 5th WSEAS/IASME International Conference on Systems Theory and Scientific Computation (2005)

OPF is an essential tool to study interconnected systems and electricity markets. One of the main goals of PX and electric utilities is to find out the scheme with minimum generation cost. When grid topology and load are determined, the change of slack-bus voltage will affect the operational results of OPF and economic performances of electricity market. For the first time, this topic is presented and quantitatively studied in the paper by optimizing tool. Some important and useful conclusions are obtained through test examples. The results show that using optimizing approaches can remarkably reduce the total generation cost; keeping appropriate slack-bus voltage is helpful to reduce the generation cost and MW losses, and bring utilities extra benefits; To the grid with negative MVAR losses, voltage stability and security of power systems must be paid more attentions.
Telecom mashups: enabling web 2.0 for telecom services
Authors: Nilanjan Banerjee, Koustuv Dasgupta
Venue: Proceedings of the 2nd international conference on Ubiquitous information management and communication (2008)

The emerging Web 2.0 marketplace presents an important opportunity for Telecom operators to sell their own capabilities and content as services. Operators have a wealth of content associated with their network as well as core network enablers, e.g. call control, presence and messaging, which could serve as potential new revenue streams in a Web 2.0 world. Moreover, with the looming threat from Internet companies, there is an increasing need for operators to make both core and value-added functions reusable and mashable. In this paper, we highlight the design principles of a Telecom Mashup architecture and describe a prototype application built using this architecture
Editorial
Authors: Eduardo Bayro-corrochano
Venue: Robotica (2008)

Robotic sensing is a relatively new field of activity compared with the design and control of robot mechanisms. In both areas the role of geometry is natural and necessary for the development of devices, their control and use in challenging environments. At the very beginning odometry, tactile and touch sensors dominated robot sensing. More recently, due to the fall in the price of laser devices, they have become more attractive to the community. On the other hand, progress in photogrametry, particularly during the nineties as the n-view geometry in projective geometry matured, boot-strapped the use of computer vision as an extra powerful sensor technique for robot guidance. Cameras were used in monocular or stereoscopic fashion, catadioptric systems for ominidirectional vision, fish-eye cameras and camera networks made the use of computer vision even more diverse. Researchers started to combine sensors for 2D and 3D sensing by fusing sensor data in a projective framework. Thanks to the continuous progress in mechatronics, the low prices of fast computers and increasing accuracy of sensor systems, one can build a robot to perceive its surroundings, reconstruct, plan and ultimately act intelligently. In these perception-action systems there is of course, the urgent need for a geometric stochastic framework to deal with uncertainty in the sensing, planning and action in a robust manner. Here geometry can play a central role for the representation and computing in higher dimensions using projective geometry and differential geometry on Lie groups manifolds with a pseudo Euclidean metric. Let us review briefly the developments towards modern geometry that have been often overlooked by the robotic researchers and practitioners.
Research of English-Chinese Alignment at Word Granularity on Parallel Corpora
Authors: Yang Xu, Hou-feng Wang, Xue-qiang Lü
Venue: Proceedings of the Seventh IEEE/ACIS International Conference on Computer and Information Science (icis 2008) (2008)

Bilingual alignment is a crucial problem in the research of natural language processing, and word alignment is a nodus among all granularities of alignment. This paper describes an English-Chinese word alignment model based on a bilingual lexicon and some language knowledge, which works on bilingual corpora. The model is built on the theory of formal optimal partition of the bilingual sentence pairs, and is ubiquitous to sentences pairs of any natural language. Particularly, we obtain some alignment strategies which are independent to alignment direction by denoting some definitions and proving a theorem. The model deals with part-matching cases, solves multi-appear-word problems and remedies the deficiency of bilingual lexicon. The experimental results show that the model can align bilingual corpora at word level effectively with a high accuracy, and maintain the grammar structure of the original sentences at the same time.
NSYNC: network synchronization for peer-to-peer streaming overlay construction
Authors: Hongbo Jiang, Shudong Jin
Venue: Proceedings of the 2006 international workshop on Network and operating systems support for digital audio and video (2006)

In peer-to-peer streaming applications such as IP television and live shows, a key problem is how to construct an overlay network to provide high-quality, almost real-time media relay in an efficient and scalable manner. Much work has focused on the construction of tree and graph network topology, often based on the inference of network characteristics such as delay and bandwidth. Less attention has been paid to improving the liveness of media delivery, and to exploiting the flexibility of applications to construct better overlay networks. We propose the NSYNC, an ongoing work on constructing low-latency overlay networks for live streaming. It aims at solving the following problems. In typical applications, peers must buffer a portion of a real-time event, e.g., for at least a few seconds, to limit the impact of adversary network conditions. Thus, it introduces both (1) delay, especially long delay for peers that are many hops away from the origin servers, and (2) partial ordering between the peers. With NSYNC, the application media players can slightly increase or decrease the speed of playing media. Thus, the peers in a network can be synchronized to achieve two effects. First, late peers can catch early peers and the origin server such that the entire peer networks improve liveness. Second, the client/server roles between a pair of neighboring peers can be reversed, allowing opportunities for constructing more efficient overlay networks. NSYNC can be used in various peer-to-peer streaming systems.