ppxscal/embedding_network huggingface dataset:
Neural Network Diagnosis System for 3-Dimensional Ultrasonography with Gabor Filter Aided Speckle Decorrelation
Authors: Wei-Ming Chen, Chi-Hsiang Lo, Han-Chieh Chao, Chun Cheng Chang, Dar-Ren Chen
Venue: Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics - Volume 02 (2008)

In this paper, a neural network diagnosis system for 3-dimensional ultrasonography using Gabor filters to eliminate the speckle noise is introduced. Since the importance of the relationship between surface features and internal architecture of the breast tumor, we applied our system using three dimensional (3D) inter-pixel correlation instead of 2D features. Furthermore, Gabor filters provide a multi-resolution representation of texture, which increasing the capabilities of ultrasound technology in the differential diagnosis of solid breast tumors. Our experiments show that the performance of the proposed diagnostic method is effective.
Advances in information and knowledge management
Authors: Aparna Varde, Jian Pei
Venue: ACM SIGIR Forum (2008)

Several research areas today overlap between the tracks of databases, information retrieval and knowledge management, such as natural language processing, semantic web, digital libraries, visualization, information quality and data mining. Inter-disciplinary research across these tracks encourages advances in the development of databases, the extraction of information and the discovery of knowledge. This is precisely the focus of our article. We explain the research issues addressed in a Ph.D. workshop recently held at the ACM Conference on Information and Knowledge Management. This workshop had presentations on novel ideas addressing challenges in information and knowledge management. It covered a broad range of topics such as XML architectures, sensor data streams, personal information managers and text pre-processing. In this article, we provide an overview of the research problems and solutions discussed in the Ph.D. workshop. Our article thus describes the latest technological developments in information and knowledge management as seen by academia. This cutting edge technology also finds practical applications in the corporate world.
Coupon replication systems
Authors: Laurent Massoulié, Milan Vojnovic
Venue: IEEE/ACM Transactions on Networking (TON) (2008)

Motivated by the study of peer-to-peer file swarming systems à la BitTorrent, we introduce a probabilistic model of coupon replication systems. These systems consist of users aiming to complete a collection of distinct coupons. Users enter the system with an initial coupon provided by a bootstrap server, acquire other coupons from other users, and leave once they complete their coupon collection. For open systems, with exogenous user arrivals, we derive stability condition for a layered scenario, where encounters are between users holding the same number of coupons. We also consider a system where encounters are between users chosen uniformly at random from the whole population. We show that sojourn time in both systems is asymptotically optimal as the number of coupon types becomes large. We also consider closed systems with no exogenous user arrivals. In a special scenario where users have only one missing coupon, we evaluate the size of the population ultimately remaining in the system, as the initial number of users Ngoes to infinity. We show that this size decreases geometrically with the number of coupons K. In particular, when the ratio K/log(N) is above a critical threshold, we prove that this number of leftovers is of order log(log(N)). These results suggest that, under the assumption that the bootstrap server is not a bottleneck, the performance does not depend critically on either altruistic user behavior or on load-balancing strategies such as rarest first.
Faster tree pattern matching
Authors: M. Dubiner
Venue: Proceedings of the 31st Annual Symposium on Foundations of Computer Science (1990)

Recently, R. Kosaraju (Proc. 30th IEEE Symp. on Foundations of Computer Science, 1989, p.178-83) gave an O(nm/sup 0.75/ polylog(m))-step algorithm for tree pattern matching. The authors improve this result by designing a simple O(n square root m polylog (m)) algorithm.
Robust filtering in a laser scanner point cloud
Authors: Sebastian Budzan
Venue: Machine Graphics Vision International Journal (2006)

This paper presents a new effective and robust approach to noise reduction in a three-dimensional data measurement algorithm. In the literature, there are numerous algorithms for noise reduction. The proposed filter class is based on the nonparametric estimation of the density probability function in a sliding filter sphere. The main idea of the applied algorithm depends is to maximize the distance between points in the three-dimensional space - the nearest neighbors in sliding 3D sphere.
Computing the integer programming gap
Authors: Serkan Ho&#x015f;ten, Bernd Sturmfels
Venue: Combinatorica (2007)

We determine the maximal gap between the optimal values of an integer program and its linear programming relaxation, where the matrix and cost function are fixed but the right hand side is unspecified. Our formula involves irreducible decomposition of monomial ideals. The gap can be computed in polynomial time when the dimension is fixed.
6th workshop on parallel and distributed systems: testing and debugging (PADTAD '08)
Authors: Shmuel Ur, Scott D. Stoller, Eitan D. Farchi
Venue: Proceedings of the 2008 international symposium on Software testing and analysis (2008)

PADTAD brings together researchers from academia and researchers and practitioners from industry to promote the development of techniques and tools that aid in testing, analysis, and debugging of multi-threaded/parallel/distributed software.
Extending Always Best Connected Paradigm for Voice Communications in Next Generation Wireless Network
Authors: Tein-Yaw Chung, Fong-Ching Yuan, Yung-Mu Chen, Baw-Jhiune Liu, Ching-Chi Hsu
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications (2008)

Selecting transparently a proper network connection for voice communication will be a fundamental requirement in future multi-mode heterogeneous wireless network. This paper extends Always Best Connected (ABC) to a fine-grain paradigm called Always Best Network Connection (ABNC) to address this issue. Instead of selecting a best access network as in conventional ABC, ABNC enable users to select a best network connection, which consists of source and destination access network pair, to satisfy quality constraint and users' preference. To support ABNC, we develop a user profile to specify network connection priority. Meanwhile we extend SIP and propose a network selection information service (NSIS) based on MIH (Media Independent Handover) to collect information of both source and destination access networks for decision making. Finally, Analytic Hierarchy Process (AHP) is used to recommend a network connection with assistance of user profile and NSIS. An example is illustrated to show that AHP can successfully select a good network connection that fulfill the requirement of users.
Identity hiding by blind signature scheme
Authors: Salah Albermany, Hamza A. Ali, Abdulameer K. Hussain
Venue: Proceedings of the 2nd WSEAS International Conference on Electronics, Control and Signal Processing (2003)

Public key schemes use two keys, i.e. public key used for encryption and private key used for decryption. But still there is a major problem in these schemes, as cryptanalyst has access to the public key and the sender's identity, which might help him or her to break the system. This paper presents a method for public key hiding, i.e. the public key of the receiver will not be used directly in the encryption process rather a pseudo key will be used. This scheme guarantees reducing the risk of breaking both the encryption algorithm and the public-private key pair. Furthermore, this pseudo public key is generated independent of the sender, i.e. as blind signature is achieved by using another key as well as reduces breaking encryption method. This method is designed and experimented with to fit a group users-group manager environment.
Locomotion Monitoring Using Body Sensor Networks
Authors: Jaime Barnes, Vikram Ramachandra, Katherine Gilani, Eric Guenterberg, Hassan Ghasemzadeh, Roozbeh Jafari
Venue: Proceedings of the 7th international conference on Information processing in sensor networks (2008)

Body sensor networks (BSNs) create an enormous opportunity to revolutionalize the way we learn, work, entertain and live today. A particularly promising application of BSNs is in health monitoring. Research indicates that various disorders in aging ranging from mild cognitive impairment to dementia and Alzheimer’s could be diagnosed early based on the study of locomotion. Sensor platforms integrated into clothing provide the possibility of reliable locomotion monitoring. In this work, we demonstrate a real-time wireless sensor system that quantitatively measures some of the factors involved in locomotion.
Scientific Exploration in the Era of Ocean Observatories
Authors: António Baptista, Bill Howe, Juliana Freire, David Maier, Cláudio T. Silva
Venue: Computing in Science and Engineering (2008)

The authors introduce an ocean observatory, offer a vision of observatory-enabled scientific exploration, and discuss the requirements and approaches for generating provenance-aware products in such environments.
Link structures, information flow, and social processes
Authors: Jon M. Kleinberg
Venue: Proceedings of the nineteenth ACM conference on Hypertext and hypermedia (2008)

In the ongoing movement toward socially-produced information resources, we are increasingly able to look through the content being created and see the individuals, incentives, and larger social processes at work. Designing and working with large-scale participatory social computing applications requires that we think not just about technological issues, but also about fundamental principles of human social interaction. Through the digital traces that these applications generate, we can begin to quantify and reason about such principles at unprecedented levels of scale and resolution. In this talk, we consider a crucial type of social process in this setting - the mechanisms by which information flows through groups of people engaged in sharing and synthesizing knowledge. As information, ideas, opinions, and beliefs spread through an underlying social network, their dynamics resemble that of an epidemic, moving "contagiously" from person to person. But social contagion is different from biological contagion in many respects; understanding the analogies and contrasts between these two kinds of processes leads us to consider the rich temporal characteristics of information flow within a network and the complex decision rules by which people choose to act on new information. The result is a richer picture of the communities that create knowledge and its interlinkages, and of the resources that ultimately arise from these processes.
Proceedings of the 1st international workshop on Business impact of process improvements
Venue: International Conference on Software Engineering (2008)

It is our great pleasure to welcome you to the first "Business Impact of Process Improvements" (BIPI-2008) workshop. The workshop is held in conjunction with the ICSE-2008 and addresses the software engineering community -- specifically those who care for business impact and business value of changes and investments. The topic of this workshop is achieving tangible and sustainable business impact from process improvements. The focus is on approaches that are both practical and quantifiable. The kinds of process improvements addressed include, but are not limited to, the introduction of iterative, agile or "lean" approaches, improved requirements engineering, risk management, usage of process improvement reference frameworks, and improved quality control and assurance. The business impact should be illustrated through either increasing the value of what is delivered to the customer or reducing the cost (for example by reduction of rework effort). The audience will share experiences how to reliably set-up, measure and achieve business-oriented process improvements in order to increase return on investment in software engineering. The goal of the "Business Impact of Process Improvements" (BIPI) workshop is to establish a forum where practical and quantifiable value in process improvement is reviewed and consolidated to advance software engineering improvement programs. Too often, there is too little connection to the impact for the business and in such a way that the recommended approaches are able to be applied in practice. We explicitly strive to serve as an appropriate forum for bridging the academic, research, business, and industrial practice communities. We hope that you will find this program interesting, thought-provoking, and especially give you useful ideas on measuring and improving the business impact of many kinds of process improvements. We hope also that through this workshop you had a valuable opportunity to share ideas with other researchers and practitioners from institutions around the world on this important topic.
Design issues in next-generation merchant switch fabrics
Authors: François Abel, Cyriel Minkenberg, Ilias Iliadis, Ton Engbersen, Mitchell Gusat, Ferdinand Gramsamer, Ronald P. Luijten
Venue: IEEE/ACM Transactions on Networking (TON) (2007)

Packet-switch fabrics with widely varying characteristics are currently deployed in the domains of both communications and computer interconnection networks. For economical reasons, it would be highly desirable that a single switch fabric could accommodate the needs of a variety of heterogeneous services and applications from both domains. In this paper, we consider the current requirements, technological trends, and their implications on the design of an ASIC chipset for a merchant switch fabric. We then identify the architecture upon which such a suitable and generic switch fabric could be based, and we present the general characteristics of an implementation of this switching fabric within the bounds of current state-of-the-art technology. To our knowledge, this is the first attempt to design a chipset that can be used for both communications and computer interconnection networks.
Cost-effective multicast approaches for time-critical applications in dynamic network environments
Authors: Xiaorong Li, Bharadwaj Veeravalli
Venue: Journal of High Speed Networks (2007)

In this paper, we address the issue of optimizing the per request cost and maximizing the number of requests that can be served by a networked system that demands staging of data at vantage sites. In order to provide a guaranteed Quality of Services, generation of multicast trees with end-to-end delay constraints is recommended to minimize the costs. Since such an issue has been proved to be NP-complete in a networked environment, we proposed two efficient and practically realizable heuristic algorithms, referred to as Source-Initiated Scheduling (SIS) algorithm and Client-Initiated Scheduling (CIS) algorithm to solve the problem in polynomial time. Both SIS and CIS algorithms judiciously combine the concept of QoS-constrained multicast routing and network caching, so that the copies of data to be staged can be dynamically cached in the network. These strategies are carefully designed to consider the underlying resource constraints imposed by the dynamic network environments, such as link bandwidth availability, data availability on the network, and the storage capabilities of a site. We analyze and quantify the performance under several influencing parameters such as link availability, cache capacity and the data availability. Simulation results show that both of the proposed algorithms are able to reduce the service cost and achieve a high acceptance ratio.
Dynamic output feedback H∞ control of discrete-time fuzzy systems: a fuzzy-basis-dependent Lyapunov function approach
Authors: James Lam, Shaosheng Zhou
Venue: International Journal of Systems Science (2007)

This article deals with an output feedback H∞ control problem for a class of discrete-time fuzzy dynamic systems. A full-order dynamic output feedback H∞ control design approach is developed by combining a fuzzy-basis-dependent Lyapunov function and a transformation on the controller parameters, which leads to sufficient conditions in the form of strict linear matrix inequalities (LMIs). The fuzzy-basis-dependent results are less conservative due to the generality of the fuzzy-basis-dependent Lyapunov function used which includes the fuzzy-basis-independent one as a special case. It has been shown that the underling full-order dynamic output feedback H∞ control problem can be solved as LMI optimization problems that can be computed numerically very efficiently. Finally, two numerical examples, concerning the control of a discrete-time chaotic Lorenz system and an inverted pendulum, are given to demonstrate the applicability of the proposed approach.
Reliability of reverse properties of power semiconductor devices
Authors: V. Pape, B. Kojecký, D. Šámal
Venue: Microelectronics Journal (2008)

Reliability of reverse properties of power semiconductor devices is an important condition for their practical application. Usual standard tests do not reveal total information concerning the technological genetic aspects of devices production. These aspects can be linked with individual technological operations, most frequently with preparation of semiconductor surface and its protection by dielectric layers. Properties of dielectric layers influence the time stability of reverse currents by means of a change of dielectric permittivity. This article analyses some physical causes of the time-instable behaviour of devices and also presents a special method and equipment for reliable tests.
Robust output-feedback model predictive control for systems with unstructured uncertainty
Authors: Christian Løvaas, María M. Seron, Graham C. Goodwin
Venue: Automatica (Journal of IFAC) (2008)

In this paper, we present novel results that parameterize a broad class of robust output-feedback model predictive control (MPC) policies for discrete-time systems with constraints and unstructured model uncertainty. The MPC policies we consider employ: (i) a linear state estimator, (ii) a pre-determined feedback gain (iii) a set of ''tighter constraints'' and (iv) a quadratic cost function in the degrees of freedom and the estimated state. Contained within the class, we find both well-known control policies and policies with novel features. The unifying aspect is that all MPC policies within the class satisfy a robust stability test. The robust stability test is suited to synthesis and incorporates a novel linear matrix inequality (LMI) condition which involves the parameters of the cost function. The LMI is shown to always be feasible under an appropriate small-gain condition on the pre-determined feedback gain and the state estimator. Moreover, we show, by means of both theoretical and numerical results, that choosing the cost function parameters subject to the proposed condition often leads to good nominal performance whilst at the same time guaranteeing robust stability.
Evaluation of economic indicators of EU countries by DEA
Authors: Yeliz Ekinci
Venue: Proceedings of the 12th WSEAS International Conference on Applied Mathematics (2007)

One of the most important unions in the world with the power of directing the world economy is the European Union (EU), which has 27 members by the year 2007. Starting with 6 members in 1957, the EU expanded with new participations. Participation of other members brought up the discussion of the economical and social differences and imbalances between the member countries. This paper deals with this discussion's economical side and brings a mathematical view with Data Envelopment Anaysis which is a mathematical modelling method of calculating relative efficiencies of Decision Making Units (DMUs), based on predetermined inputs and outputs. DMUs are the EU member countries and inputs-outputs are economic indicators. After finding the relative efficiencies of the member countries, the results are discussed.
Civitas: Toward a Secure Voting System
Authors: Michael R. Clarkson, Stephen Chong, Andrew C. Myers
Venue: Proceedings of the 2008 IEEE Symposium on Security and Privacy (2008)

Civitas is the first electronic voting system that is coercion-resistant, universally and voter verifiable, and suitable for remote voting. This paper describes the design and implementation of Civitas. Assurance is established in the design through security proofs, and in the implementation through information-flow security analysis. Experimental results give a quantitative evaluation of the tradeoffs between time, cost, and security.
Delay learning and polychronization for reservoir computing
Authors: Hélène Paugam-Moisy, Régis Martinez, Samy Bengio
Venue: Neurocomputing (2008)

We propose a multi-timescale learning rule for spiking neuron networks, in the line of the recently emerging field of reservoir computing. The reservoir is a network model of spiking neurons, with random topology and driven by STDP (spike-time-dependent plasticity), a temporal Hebbian unsupervised learning mode, biologically observed. The model is further driven by a supervised learning algorithm, based on a margin criterion, that affects the synaptic delays linking the network to the readout neurons, with classification as a goal task. The network processing and the resulting performance can be explained by the concept of polychronization, proposed by Izhikevich [Polychronization: computation with spikes, Neural Comput. 18(2) (2006) 245-282], on physiological grounds. The model emphasizes that polychronization can be used as a tool for exploiting the computational power of synaptic delays and for monitoring the topology and activity of a spiking neuron network.
Model reduction of uncertain discrete systems having an interval structure using genetic algorithms
Authors: Chen-Chien Hsu, Tsung-Chi Lu, Wei-Yen Wang
Venue: Proceedings of the 5th WSEAS/IASME International Conference on Systems Theory and Scientific Computation (2005)

In this paper, an evolutionary approach is proposed to obtain a reduced-order discrete interval model for uncertain discrete-time systems having interval uncertainties based on resemblance of discrete sequence energy between the original and reduced systems. System performance of the discrete interval model obtained by using the proposed evolutionary approach is then verified based on time responses of the resulting model in comparison to existing methods to demonstrate the effectiveness of the proposed approach.
Simple and Flexible Random Key Predistribution Schemes for Wireless Sensor Networks Using Deployment Knowledge
Authors: Sinan Emre Tasçi, Ersoy Bayramoglu, Albert Levi
Venue: Proceedings of the 2008 International Conference on Information Security and Assurance (isa 2008) (2008)

Sensor nodes are tiny, low-power, computationally limited and battery constrained electromechanical devices that are usually deployed for sensing some type of data in the field. Random key predistribution mechanisms have been proposed to provide security for wireless sensor networks. In the literature, there are well known random key predistribution schemes. Some of these schemes are secure, but quite complex to apply, while some other are easily applicable but they do not offer reasonable security. In this paper, we propose random key predistribution schemes for wireless sensor networks that provide varying ranges of security and that are easily applicable due to their simplicity. In this respect, our schemes serve as a tradeoff. Moreover, our proposed schemes show a good extensibility property. We assume prior deployment knowledge. We examine performance of our schemes and compare them with well known random key predistribution schemes.