ppxscal/embedding_network huggingface dataset:
Brief paper: Probabilistic sorting and stabilization of switched systems
Authors: Hideaki Ishii, Roberto Tempo
Venue: Automatica (Journal of IFAC) (2009)

In this paper, we consider Lyapunov stability of switched linear systems whose switching signal is constrained to a subset of indices. We propose a switching rule that chooses the most stable subsystem among those belonging to the subset. This rule is based on an ordering of the subsystems using a common Lyapunov function. We develop randomized algorithms for finding the ordering as well as for finding a subset of systems for which a common Lyapunov function exists. It is shown that the class of randomized algorithms known as the Las Vegas type is useful in the design procedure. A third-order example illustrating the efficacy of the approach is presented.
Robust Visual Content Representation Using Compression Modes Driven Low-level Visual Descriptors
Authors: Charith Abhayaratne, Farooq Muzammil
Venue: Proceedings of the 15th International Multimedia Modeling Conference on Advances in Multimedia Modeling (2009)

In conventional visual content representation, low-level visual features are usually extracted from the highest quality and resolutions of visual contents. When visual content is scalable coded and utilised, their bit streams can be adapted at various nodes in multimedia usage chains to cater the variations in network bandwidths, display device resolutions and resources and usage preferences by just discarding insignificant resolution-quality layers. This can result in the existence of different version of the same content with dissimilar low-level visual features. Therefore, mapping of low level visual descriptors into content resolution-quality spaces is important in order to obtain low-level visual features that are robust to such content adaptations. A new scalable domain feature extraction using the compression modes and decisions is presented and its content based image retrieval performance is evaluated. The proposed scheme outperforms MPEG-7 visual descriptors in both the original image and scaled resolution-quality space domains.
Distributed route repair for increasing reliability and reducing control overhead for multicasting in wireless MANET
Authors: Ben-Jye Chang, Ying-Hsin Liang, Yan-Min Lin
Venue: Information Sciences: an International Journal (2009)

The Multicast Ad hoc On-Demand Distance Vector (MAODV) routing protocol is proposed for achieving multicast in a Mobile Ad hoc Network (MANET) while reducing bandwidth waste and energy power consumption. In MANET, packets transmission through a multicast tree may always have unreliable links caused by node mobility or lack of energy, and thus significantly degrades the performance. MAODV uses a broadcast-type local repair mechanism to find an alternative route to the multicast tree when some breaks happen on the tree. Although the local repair mechanism provides a specified time-to-live (TTL) to limit the repair range and the hop-count to the group leader, a large number of broadcast-type Route Request (RREQ) messages extensively yields control overhead and requires a large amount of power consumption to send control messages. Thus, this paper proposes a unicast-type multihop local repair protocol for multicast MANETs to recover lost links efficiently while achieving several advantages: increasing network reliability, increasing packet delivery rate, minimizing the number of control messages and reducing repair delay. Moreover, the optimal number of hops used in the multihop neighbor table is analyzed mathematically. Numerical results indicate that the proposed approach outperforms other repair approaches in terms of successful repair rate, control message overhead and packet delivery rate.
Kernel Functions Based on Derivation
Authors: Koichiro Doi, Akihiro Yamamoto
Venue: New Frontiers in Applied Data Mining: PAKDD 2008 International Workshops, Osaka, Japan, May 20-23, 2008. Revised Selected Papers (2009)

In this paper we explain the fundamental idea of designing a class of kernel functions, called the intentional kernel, for structured data. The intentional kernel is designed with the property that every structured data is defined by derivation. Derivation means transforming a data or an expression into another. Typical derivation can be found in the field of formal language theory: A grammar defines a language in the sense that a sequence belongs to a language if it is transformed from a starting symbol by repeated application of the production rules in the grammar. Another example is in mathematical logic: A formula is proved if it is obtained from axioms by repeated application of inference rules. Combining derivation with the kernel-based learning mechanism derives the class of the intentional kernel.
PL study of oxygen defect formation in ZnO nanorods
Authors: C. Chandrinou, N. Boukos, C. Stogios, A. Travlos
Venue: Microelectronics Journal (2009)

Photoluminescence (PL) study of needle-like ZnO nanorods grown under standard and oxygen-rich conditions is presented. The yellow-orange band at ~580nm increases with excess oxygen during growth. Subsequent annealing in a reducing atmosphere shows the disappearance of this band. The yellow-orange emission is attributed to oxygen interstitials (O"i).
Test-driven design in Java for novice programmers
Authors: Viera K. Proulx
Venue: Journal of Computing Sciences in Colleges (2009)

The tutorial will show how testing and test-first design can be incorporated into every introductory course on object-oriented programming using Java. We will show the syntax for the tests that use our novice-friendly tester library, and describe the pedagogy we use to enforce test-first design from the very first program students write. The tester library is freely available on our web site with extensive documentation that shows how to use it with Eclipse, NetBeans, BlueJ, or just command-line Java compilation.
Iris Recognition System Using Statistical Features for Biometric Identification
Authors: Khin Sint Sint Kyaw
Venue: Proceedings of the 2009 International Conference on Electronic Computer Technology (2009)

Iris recognition is a proven, accurate means to identify people. In this paper, it includes the preprocessing system, segmentation, feature extraction and recognition. Especially it focuses on image segmentation and statistical feature extraction for iris recognition process. The performance of iris recognition system highly depends on segmentation. For instance, even an effective feature extraction method would not be able to obtain useful information from an iris image that is not segmented properly. This paper presents a straightforward approach for segmenting the iris patterns. The used method determines an automated global threshold and the pupil center. Experiments are performed using iris images obtained from CASIA database. (Institute of Automation, Chinese Academy of Sciences) and Matlab application for its easy and efficient tools in image manipulation.
Modular design and implementation of FPGA-based tap-selective maximum-likelihood channel estimator
Authors: Jeng-Kuang Hwang, Yuan-Ping Li
Venue: WSEAS Transactions on Signal Processing (2008)

The modular design of the optimal tap-selective maximum-likelihood (TSML) channel estimator based on field-programmable gate array (FPGA) technology is studied. A novel range reduction algorithm is included in the natural logarithmic function (NLF) emulator based on the coordinate rotation digital computer (CORDIC) methodology and is integrated into the TSML channel estimator system. The low-complexity TSML algorithm, which is employed for sparse multipath channel estimation, is proposed for long-range broadband block transmission systems. Furthermore, the proposed range reduction algorithm aims to solve the limited interval problem in the CORDIC algorithm base on Xilinx's SG platforms. The modular approach facilitates the reuse of modules.
A quadratic time 2-approximation algorithm for block sorting
Authors: Wolfgang W. Bein, Lawrence L. Larmore, Linda Morales, I. Hal Sudborough
Venue: Theoretical Computer Science (2009)

The block sorting problem is the problem of minimizing the number of steps to sort a list of distinct items, where a sublist of items which are already in sorted order, called a block, can be moved in one step. We give an approximation algorithm for the block sorting problem with an approximation ratio of 2 and run time O(n^2). The approximation algorithm is based on the related concept of block deletion. We show that finding an optimum block deletion sequence can be done in O(n^2) time, even though block sorting is known to be NP-hard. Block sorting has importance in connection with optical character recognition (OCR) and is related to transposition sorting in computational biology.
Information resource management for corporate decision support
Authors: William H. Gruber, George Sonnemann
Venue: Proceedings of the May 16-19, 1983, national computer conference (1983)

Decision support systems were a major force that ended the monopoly of information processing resources once held by the traditional corporate data processing function. In order to gain direct access to the data and models that the decision makers needed but could not get from data processing, users increasingly turned to the microprocessor and the use of timesharing from outside vendors. This created a proliferation of information technology to support management decisions. During the very early history of this move toward decision support systems, the corporate data processing function remained focused on its initial mission of processing accounting transactions. This paper traces the next stage in the management of decision support systems, whereby both corporate data processing, or the information systems function, and the user share the responsibility for decision support as a team. This new integration of the information systems function and users provides an extraordinary improvement in the effectiveness of decision support via the sharing of data and modeling; the integration of decision makers' and corporate functions; and the teaming of information systems professionals knowledgeable in the technology with users who are experts in the management of the business. A case study demonstrates the effectiveness of this integration between information systems and the users and the management of corporate decision support services.
Automatic WS-BPEL Composition of Medical Support Services in the ICU
Authors: Sofie Van Hoecke, Kristof Steurbaut, Yannick Beheyt, Frederik Debruyne, Bart Dhoedt, Johan Decruyenaere, Filip De Turck
Venue: Proceedings of the 2009 International Conference on eHealth, Telemedicine, and Social Medicine (2009)

Since the ICU is an extremely data-intensive environment, automated data processing is needed in the ICU.The Intensive Care Service Platform facilitates the abstraction of relevant information and supports the physicians through medical support services. These medical support services can be reused as building blocks to create new more advanced services as WS-BPEL compositions. WS-BPEL compositions are however static and need off-line creation. Therefore, in this paper, we present the extension of the Intensive Care Service Platform (ICSP) with support for automatic composition of medical support services. The on-line created new medical support services are automatically deployed within ICSP so that physicians can immediately use these medical support services. As a result, the automatic composition of medical support services is a major improvement since now physicians can create new medical support services on the fly without the intervention of programmers, resulting in greater development efficiency and an increasing number of implemented medical support services.
Towards a theory for securing time synchronization in wireless sensor networks
Authors: Murtuza Jadliwala, Qi Duan, Shambhu Upadhyaya, Jinhui Xu
Venue: Proceedings of the second ACM conference on Wireless network security (2009)

Time synchronization in highly distributed wireless systems like sensor and ad hoc networks is extremely important in order to maintain a consistent notion of time throughout the network and to support the various timing-based applications. But, cheating behavior by the participating nodes in the network can severely jeopardize the accuracy of the associated time synchronization process. Despite recent advances in this direction, a key fundamental question still remains unanswered: Is it theoretically feasible to secure distributed time synchronization protocols, given complete (or global) time and time difference information in the network? In this paper, we attempt to answer this question with the help of sound mathematical modeling and analysis. We first formulate the problem of distributed time synchronization as a Constraint Satisfaction Problem (CSP) in a graph-based model of the network. Then, we prove that efficiently eliminating cheating behavior in distributed time synchronization protocols is combinatorially hard (NP-hard), i.e., it is highly unlikely that there exists an algorithm that solves, or even approximates, this problem in polynomial (in terms of total number of nodes) time. Due to this negative result for the general case, we focus on studying the problem for a special case of the graph-based model of the network, namely completely connected graphs. We derive an upper bound on the best possible solution quality for this problem, propose two polynomial-time approximation strategies, and present an empirical evaluation of their performance.
Structured D-chart: a diagrammatic methodology in structured programming
Authors: C. Jinshong Hwang
Venue: Proceedings of the June 7-10, 1982, national computer conference (1982)

The rules and principles of structured programming resemble the rules and principles of good musicianship. Good programmer performance depends on both a competent programmer and the proper logic design methodologies. This paper presents a new diagrammatic methodology for such programming that accurately depicts the restricted control structures and their close correlation with natural thought process. A good programming style and coding indentation are the direct results of the use of structured D-charts.
A grid redistribution method for singular problems
Authors: Adi Ditkowski, Nir Gavish
Venue: Journal of Computational Physics (2009)

Many physical phenomena develop singular, or nearly singular behavior in localized regions, e.g. boundary layers or blowup solutions. Using uniform grids for such problems becomes computationally prohibitive as the solution approaches singularity. Ren and Wang developed a semi-static adaptive grid method [W. Ren, X.P. Wang, An iterative grid redistribution method for singular problems in multiple dimensions, J. Comput. Phys. 159 (2000) 246-273] for the solution of these problems, known as the iterative grid redistribution (IGR) method. In this study we develop a theoretical basis for semi-static adaptive grid method for singular problems. Based on this theory, we obtain the key result of this study - a methodology for designing robust weight functionals which ensures grid resolution in the singular region, as well as control of the maximal grid spacing in the outer region. Using this methodology, we introduce a semi-static adaptive grid method, which does not involve an iterative procedure for grid redistribution, as in the IGR method. We demonstrate the efficacy of this method with numerical examples of solutions which localize by more than nine orders of magnitude.
A fuzzy neighborhood-based training algorithm for feedforward neural networks
Authors: Mounir Ben Nasr, Mohamed Chtourou
Venue: Neural Computing and Applications (2009)

In this work we present a new hybrid algorithm for feedforward neural networks, which combines unsupervised and supervised learning. In this approach, we use a Kohonen algorithm with a fuzzy neighborhood for training the weights of the hidden layers and gradient descent method for training the weights of the output layer. The goal of this method is to assist the existing variable learning rate algorithms. Simulation results show the effectiveness of the proposed algorithm compared with other well-known learning methods.
Derivation of Excess Mean-Square Error for Affine Projection Algorithms Using the Condition Number
Authors: Chang Woo Lee, Hyeonwoo Cho, Sang Woo Kim
Venue: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (2008)

This letter presents a new mathematical expression for the excess mean-square error (EMSE) of the affine projection (AP) algorithm. The proposed expression explicitly shows the proportional relationship between the EMSE and the condition number of the input signals.
A framework for mining top-k frequent closed itemsets using order preserving generators
Authors: R V Nataraj, S Selvan
Venue: Proceedings of the 2nd Bangalore Annual Compute Conference (2009)

In this paper, we propose OP-TKC (Order Preserving Top K Closed itemsets) algorithm for mining top-k frequent closed itemsets. Our methodology visits the closed itemsets lattice in breadth first manner and generates all the top-k closed itemsets without generating all the closed itemsets of a given dataset i.e. in the search space, only closed itemsets that belongs to top-k are expanded and all other closed itemsets are pruned off. Our algorithm computes all the top-k closed itemsets with O(D+ k) space complexity, where D is the dataset. Experiments involving publicly available datasets show that our algorithm takes less memory and running time than TFP algorithm.
Garbage collecting the grid: a complete DGC for activities
Authors: Denis Caromel, Guillaume Chazarain, Ludovic Henrio
Venue: Proceedings of the ACM/IFIP/USENIX 2007 International Conference on Middleware (2007)

Grids are becoming more and more dynamic, running parallel applications on large scale and heterogeneous resources. Explicitly stopping a whole distributed application is becoming increasingly difficult. In that context, there is a strong need to free resources a soon as they become useless, leading to automatic termination, using distributed garbage collecting techniques. We propose in this paper a new distributed garbage collector for active objects taking into account cycles but with a complexity similar to the distributed garbage collector of Java/RMI. The algorithm is based on a different approach to collect acyclic and cyclic garbage. On one hand, acyclic garbage is collected by knowing the immediate referencers of an active object and detecting the lack of these referencers. This behavior with respect to acyclic garbage is common to the distributed garbage collector of RMI. On the other hand, cyclic garbage is detected by considering the recursive closure of all the referencers of an active object and finding cycles of active objects waiting for requests. These cycles are found by letting idle active objects make a consensus on a common final activity. The algorithm is fully distributed and has been implemented with no modifications to the local garbage collector. Benchmarks have shown the scalability of the algorithm in a grid context.
Generic operations and capabilities in the JR concurrent programming language
Authors: Hiu Ning (Angela) Chan, Andrew J. Gallagher, Appu S. Goundan, Yi Lin William Au Yeung, Aaron W. Keen, Ronald A. Olsson
Venue: Computer Languages, Systems and Structures (2009)

The JR concurrent programming language extends Java with additional concurrency mechanisms, which are built upon JR's operations and capabilities. JR operations generalize methods in how they can be invoked and serviced. JR capabilities act as reference to operations. Recent changes to the Java language and implementation, especially generics, necessitated corresponding changes to the JR language and implementation. This paper describes the new JR language features (known as JR2) of generic operations and generic capabilities. These new features posed some interesting implementation challenges. The paper describes our initial implementation (JR21) of generic operations and capabilities, which works in many, but not all, cases. It then describes the approach our improved implementation (JR24) uses to fully implement generic operations and capabilities. The paper also describes the benchmarks used to assess the compilation and execution time performances of JR21 and JR24. The JR24 implementation reduces compilation times, mainly due to reducing the number of files generated during JR program translation, without noticeably impacting execution times.
Identifying leaders and laggards-A method and application to US local telephone companies
Authors: Padma Sastry
Venue: Telecommunications Policy (2009)

Performance attributes of public utilities vary in definition according to the stakeholder: service provider, customer or regulator. A framework is provided for defining, measuring and ranking service quality from multiple perspectives by developing a ''quadrant analysis'' method. This method is applied and US local telephone companies are ranked over time as leaders and laggards or biased according to one, two and three stakeholder perspectives. Application of the method to 1994-2001 data for the US local telephone industry suggests that some local companies hold their position consistently as leaders among their peers in the industry and some continue to lag behind. While the leaders could be studied for best practices the analysis of the laggards' practices would also yield valuable insights regarding good practice as perceived by the different stakeholders.
On a Class of Almost Orthogonal Polynomials
Authors: Bratislav Danković, Predrag Rajković, Sladjana Marinković
Venue: Numerical Analysis and Its Applications: 4th International Conference, NAA 2008, Lozenetz, Bulgaria, June 16-20, 2008. Revised Selected Papers (2009)

In this paper, we define a new class of almost orthogonal polynomials which can be used successfully for modelling of electronic systems which generate orthonormal basis. Especially, for the classical weight function, they can be considered like a generalization of the classical orthogonal polynomials (Legendre, Laguerre, Hermite, ...). They are very suitable for analysis and synthesis of imperfect technical systems which are projected to generate orthogonal polynomials, but in the reality generate almost orthogonal polynomials.
Optimization of sparse matrix-vector multiplication on emerging multicore platforms
Authors: Samuel Williams, Leonid Oliker, Richard Vuduc, John Shalf, Katherine Yelick, James Demmel
Venue: Parallel Computing (2009)

We are witnessing a dramatic change in computer architecture due to the multicore paradigm shift, as every electronic device from cell phones to supercomputers confronts parallelism of unprecedented scale. To fully unleash the potential of these systems, the HPC community must develop multicore specific-optimization methodologies for important scientific computations. In this work, we examine sparse matrix-vector multiply (SpMV) - one of the most heavily used kernels in scientific computing - across a broad spectrum of multicore designs. Our experimental platform includes the homogeneous AMD quad-core, AMD dual-core, and Intel quad-core designs, the heterogeneous STI Cell, as well as one of the first scientific studies of the highly multithreaded Sun Victoria Falls (a Niagara2 SMP). We present several optimization strategies especially effective for the multicore environment, and demonstrate significant performance improvements compared to existing state-of-the-art serial and parallel SpMV implementations. Additionally, we present key insights into the architectural trade-offs of leading multicore design strategies, in the context of demanding memory-bound numerical algorithms.