ppxscal/embedding_network huggingface dataset:
Cultural influences and differences in software process improvement programs
Authors: Bernard Wong, Sazzad Hasan
Venue: Proceedings of the 6th international workshop on Software quality (2008)

Implementing software process improvement (SPI) program successfully in a software organization is possibly the most challenging issue that the industry faces today. It is even more challenging to implement an SPI program in software organizations of developing countries like Bangladesh because of the difference in norms and values of the national culture, and organizational culture as compared to those of the developed European and Western countries. This research extends the prior research on SPI in Bangladesh (Wong & Hasan, 2006) and addresses the factors involved in the implementation of SPI programs in software organizations. A study of ten top software companies in Bangladesh was conducted to investigate whether cultural factors hindered the process improvement program and whether this hindrance led to deterioration of the business goals. The results showed that the lack of cultural awareness and lack of skills from the management perspective acted as barriers during the implementation of SPI programs and so affected the business goals sought by these organizations.
On leakage currents: sources and reduction for transistors, gates, memories and digital systems
Authors: Wolfgang Nebel, Domenik Helms
Venue: Proceeding of the 13th international symposium on Low power electronics and design (2008)

In only 5 years, leakage developed from an academic corner phenomenon to a central problem of embedded system design. In sub 90nm designs the leakage power is already exceeding the dynamic power. The intention of this tutorial is to first review the mechanisms causing leakage and the parameters and imperfections causing leakage variation as the dependencies on physical parameters as temperature, voltage levels, device geometry, doping levels, etc. Afterwards, the state-of-the-art in leakage reduction and management methodologies is presented with a first focus on transistor design including well engineering, high-k, strained silicon, SGOI devices, fully depleted ultra thin body SOI, as well as FinFETs. Then, technical aspects on the leakage management techniques power gating, body and supply voltage scaling and minimum leakage vector are discussed. Finally, low leakage SRAM cell design and different cache decay techniques are presented.
Physically-based dynamic cell representation with consistent cell neighbor relationships
Authors: Ding Cai, Won-Sook Lee, Chris Joslin
Venue: Proceedings of the 2008 C3S2E conference (2008)

In this paper, we study a novel way to dynamically represent cellular materials' characteristics using Voronoi diagram and. Mass-Spring System (MSS). MSS is the key component which is applied on Delaunay edges. Once some selected site points are moved, MSS will drive the other connected site points and keep redistributing them until the internal forces between the Voronoi cells are balanced. The restriction imposed on cell neighbor relationships preserves the consistency of the deformable cellar material's topology.
Tame functions are semismooth
Authors: J&#x00e9;r&#x00f4;me Bolte, Aris Daniilidis, Adrian Lewis
Venue: Mathematical Programming: Series A and B (2008)

Superlinear convergence of the Newton method for nonsmooth equations requires a &#x201c;semismoothness&#x201d; assumption. In this work we prove that locally Lipschitz functions definable in an o-minimal structure (in particular semialgebraic or globally subanalytic functions) are semismooth. Semialgebraic, or more generally, globally subanalytic mappings present the special interest of being &#x03b3;-order semismooth, where &#x03b3; is a positive parameter. As an application of this new estimate, we prove that the error at the kth step of the Newton method behaves like $$O(2^{-{(1+\gamma)}^k})$$.
Strongly Diagnosable Product Networks Under the Comparison Diagnosis Model
Authors: Sun-Yuan Hsieh, Yu-Shu Chen
Venue: IEEE Transactions on Computers (2008)

The notion of diagnosability has long played an important role in measuring the reliability of multiprocessor systems. Such a system is $t$-diagnosable if all faulty nodes can be identified without replacement when the number of faults does not exceed $t$, where $t$ is some positive integer. Furthermore, a system is strongly $t$-diagnosable if it can achieve $(t+1)$-diagnosability, except for the case where a node's neighbors are all faulty. In this paper, we investigate the strong diagnosability of a class of product networks, under the comparison diagnosis model. Based on our results, we can determine the strong diagnosability of several widely used multiprocessor systems, such as hypercubes, mesh-connected $k$-ary $n$-cubes, torus-connected $k$-ary $n$-cubes, and hyper Petersen networks.
On the number of minima of a random polynomial
Authors: Jean-Pierre Dedieu, Gregorio Malajovich
Venue: Journal of Complexity (2008)

We give the upper bound 2(d-1)^(^n^+^1^)^/^2 for the expected number of critical points of a normal random polynomial with degree at most d and n variables. Using the large deviation principle for the spectral value of large random matrices we obtain the boundKexp-n^2ln34+n+12ln(d-1)for the expected number of minima of such a polynomial (here K is a positive constant). This proves that most normal random polynomials of fixed degree have only saddle points. Finally, we give a closed form expression for the expected number of maxima (resp. minima) of a random univariate polynomial, in terms of hypergeometric functions.
Double profiling methodology for video processing platform
Authors: Mathieu Dubois, Guy Bois, Yvon Savaria
Venue: Proceedings of the 4th WSEAS International Conference on Applied Informatics and Communications (2004)

Modeling Issues in SoCs is to use a high level abstraction level in design process and using appropriate tools together. Platform-based design requires methodology and flexibility to design quickly a SoC. This paper proposes a double profiling methodology based on Matlab, SystemC and Seamless. It uses a generic SoC platform to permit concurrent development and mechanisms to divide algorithm functionalities between designers. The proposed methodology is a progressive refinement based on IP components starting from Matlab algorithm to lower abstraction level. This new design flow has been applied for designing a multiprocessing environment.
Queueing Delay Analysis for the Joint Scheduling Exploiting Multiuser Diversity over a Fading Channel
Authors: Fumio Ishizaki, Gang Uk Hwang
Venue: Wireless Personal Communications: An International Journal (2008)

In this paper, we consider a joint packet scheduling algorithm for wireless networks and investigate its characteristics. The joint scheduling algorithm is a combination of the Knopp and Humblet (KH) scheduling, which fully exploits multiuser diversity, and the probabilistic weighted round-robin (WRR) scheduling, which does not use multiuser diversity at all. Under the assumption that the wireless channel process for each user is described by the Nakagami-m model, we develop a formula to estimate the tail distribution of the packet delay for an arbitrary user under the joint scheduling. Numerical results exhibit that under the joint scheduling, the ratio of the number of slots assigned for the WRR scheduling to that for the KH scheduling dominates the characteristics of the delay performance.
Combinatorial algorithms for the generalized circulation problem
Authors: A. V. Goldberg
Venue: Proceedings of the 29th Annual Symposium on Foundations of Computer Science (1988)

A generalization of the maximum-flow problem is considered in which the amounts of flow entering and leaving an arc are linearly related. More precisely, if x(e) units of flow enter an arc e, x(e) lambda (e) units arrive at the other end. For instance, nodes of the graph can correspond to different currencies, with the multipliers being the exchange rates. Conservation of flow is required at every node except a given source node. The goal is to maximize the amount of flow excess at the source. This problem is a special case of linear programming, and therefore can be solved in polynomial time. The authors present polynomial-time combinatorial algorithms for this problem. The algorithms are simple and intuitive.
Mobile web: web manipulation for small displays using multi-level hierarchy page segmentation
Authors: Aditya Gupta, Anuj Kumar, Mayank, V. N. Tripathi, S. Tapaswi
Venue: Proceedings of the 4th international conference on mobile technology, applications, and systems and the 1st international symposium on Computer human interaction in mobile technology (2007)

Mobile devices have made the world a small place. They are also being used widely, to access the Web. However, because most available web pages are designed for desktop PC in mind, it is inconvenient to browse these large web pages on a mobile device with a small screen. With the enormous increase in mobile users since last decade, to such an extent that it even exceeds the number of desktop users in many developing countries, it becomes crucial to design systems for Web Manipulation, there by providing easier and greater accessibility and device independence. In this paper, we propose a new browsing technique to facilitate efficient web access and provide a better user experience on a device with rather small screen as compared to the usual desktop. It also proposes a novel technique to handle multimedia content, especially the images and video on a web page. In order to solve the problem of incomplete tags in HTML, an equivalent XML is generated for the desired webpage. For efficient browsing, the web page is represented as a multi level hierarchy, with the index of major sections on the first level and the sections indexed again in to sub-sections on the second level and so on, until we reach sub-sections that can be represented as sub-pages that fit in the small screen. We also propose an efficient algorithm for navigating through the sub-pages, thereby providing better user experience. The proposed technique provides better and efficient web browsing on mobile small displays up to user satisfaction.
On solving constrained shape optimization problems for finding the optimum shape of a bar cross-section
Authors: H. H. Mehne
Venue: Applied Numerical Mathematics (2008)

The problems of optimization of cylindrical bar cross-sections are formulated in variational forms. The functional considered characterizes torsional and bending rigidities, and the area of cross-section of the bar. The shape of the boundary of the cross-section is taken as a design variable. The problem is first expressed as an optimal control problem. Then by using an embedding method, the class of admissible shapes is replaced by a class of positive Borel measures. The optimization problem in measure space is then approximated by a linear programming problem. The optimal measure representing optimal shape is approximated by the solution of this finite dimensional linear programming problem. Numerical examples are also given.
Minimizing CPU usage in soft shadow volumes algorithm
Authors: Jarosław Lipowski
Venue: Machine Graphics Vision International Journal (2006)

In this paper we present methods for reducing the CPU burden associated with the original implementation of the hardware-accelerated soft shadow volumes algorithm. We propose and implement two hardware-accelerated wedge construction methods: using the programmable vertex and fragment pipelines. New algorithms reducing the number of draw calls needed to render the shadow region (to three, two or even one) are also described. Tests performed using the current consumer level hardware show that our algorithms are no longer CPU-bound, and therefore can be over 2 times faster than the original algorithm.
Hyperspectral Image Coding Using 3D Transform and the Recommendation CCSDS-122-B-1
Authors: Fernando García-Vílchez, Joan Serra-Sagristà, Joan Bartrina-Rapesta, Francesc Aulí-Llinàs
Venue: Proceedings of the Data Compression Conference (2008)

In this paper a modification on the file syntax of the CCSDS Recommendation for Image Data Coding (CCSDS-122-B-1) is presented. With respect to the Recommendation, the proposed modification provides, among others, scalability by quality, spatial location, resolution, and component, and also allows multicomponent data coding. In addition, experimental results show that our proposal produces a meaningful improvement over the performance of the Recommendation. Reported results for hyperspectral data are alsocompetitive with JPEG2000, the reference technique.
LEDS: Providing Location-Aware End-to-End Data Security in Wireless Sensor Networks
Authors: Kui Ren, Wenjing Lou, Yanchao Zhang
Venue: IEEE Transactions on Mobile Computing (2008)

Providing desirable data security, i.e., confidentiality, authenticity and availability, in wireless sensor networks (WSNs) is challenging, as WSNs usually consist of a large number of resource constraint sensor nodes, deployed in unattended/hostile environments, and hence are exposed to many types of severe insider attacks due to node compromise. Existing security designs mostly provide a hop-by-hop security paradigm and thus are vulnerable to such attacks. Furthermore, existing security designs are also vulnerable to various DoS attacks, such as report disruption attacks and selective forwarding attacks and thus put data availability at stake. In this paper, we seek to overcome these vulnerabilities for large-scale static WSNs. We come up with a location-aware end-to-end security framework in which secret keys are bound to geographic locations. This location-aware property effectively limits the impact of compromised nodes only to their vicinity without affecting end-to-end data security. The proposed multi-functional key management framework assures both node-to-sink and node-to-node authentication along the report forwarding routes. Moreover, the proposed data delivery approach guarantees efficient en-route bogus data filtering, and is highly robust against DoS attacks. The evaluation demonstrates that the proposed design is highly resilient against an increasing number of compromised nodes and effective in energy savings.
Miniature SAW device for RF-wireless applications using MEMS technology
Authors: Amal Zaki, Hamed Elsimary, Mona Zaghloul
Venue: Proceedings of the 5th WSEAS International Conference on Circuits, Systems, Electronics, Control & Signal Processing (2006)

A miniature SAW device is designed and fabricated at 1 GHz for wireless communication system. A 5 ???m thin film of ZnO is successfully deposited using RF sputtering technique on PECVD SiO2 layer of 1µm on top of Si wafer under various operating conditions. The c-axis oriented ZnO film exhibit a sharp diffraction peak corresponding to the (002) reflection at 2θ=34.42. The fabrication process utilizing the MEMS technology of the SAW device is described. Simulation of the RF SAW filter is performed. Measurements and experimental work are presented for the RF SAW device.
An end-user oriented graph-based visualization for spreadsheets
Authors: Bennett Kankuzi, Yirsaw Ayalew
Venue: Proceedings of the 4th international workshop on End-user software engineering (2008)

One of the difficulties in understanding and debugging spreadsheets is due to the invisibility of the data flow structure which is associated with cell formulas. In this paper, we present a spreadsheet visualization approach that is mainly based on the Markov Clustering (MCL) algorithm in an attempt to help spreadsheet users understand and debug their spreadsheets. The MCL algorithm helps in visualizing large graphs by generating clusters of cells. In our visualization approach, we also use compound fisheye views and treemaps to help in the navigation of the generated clusters. Compound fish eye views help to view members of a particular cluster while showing their linkages with other clusters. Treemaps help to visualize the depth we are at while navigating a cluster tree. Our initial experiments show that graph-based spreadsheet visualization using the MCL algorithm generates clusters which match with the corresponding logical areas of a given spreadsheet. Our experiments also show that analysis of the clusters helps us to identify some errors in the spreadsheets.
Rescheduling and optimization of logistic processes using GA and ACO
Authors: C. A. Silva, J. M. C. Sousa, T. A. Runkler
Venue: Engineering Applications of Artificial Intelligence (2008)

This paper presents a comparative study of genetic algorithms (GA) and ant colony optimization (ACO) applied the online re-optimization of a logistic scheduling problem. This study starts with a literature review of the GA and ACO performance for different benchmark problems. Then, the algorithms are compared on two simulation scenarios: a static and a dynamic environment, where orders are canceled during the scheduling process. In a static optimization environment, both methods perform equally well, but the GA are faster. However, in a dynamic optimization environment, the GA cannot cope with the disturbances unless they re-optimize the whole problem again. On the contrary, the ant colonies are able to find new optimization solutions without re-optimizing the problem, through the inspection of the pheromone matrix. Thus, it can be concluded that the extra time required by the ACO during the optimization process provides information that can be useful to deal with disturbances.
Towards adaptive management of QoS-aware service compositions
Authors: Mariusz Momotko, Michał Gajewski, André Ludwig, Ryszard Kowalczyk, Marek Kowalkiewicz, Jian Ying Zhang
Venue: Multiagent and Grid Systems (2007)

Service compositions enable users to realize their complex needs as a single request. Despite intensive research, especially in the area of business processes, web services and grids, an open and valid question is still how to manage service compositions in order to satisfy both functional and non-functional requirements as well as adapt to dynamic changes. This article describes an approach towards adaptive management of QoS aware service compositions. This approach integrates well known concepts and techniques and proposes various execution strategies based on dynamic selection and negotiation of services included in a service composition, contracting based on service level agreements, service enactment with flexible support for exception handling, monitoring of service level objectives, and profiling of execution data. An important element of the approach is an open architecture for adaptive service composition management. Its first prototypical implementation has been developed within an EU-funded Adaptive Service Grid project.
Implementing Wilson-Dirac operator on the cell broadband engine
Authors: Khaled Z. Ibrahim, Francois Bodin
Venue: Proceedings of the 22nd annual international conference on Supercomputing (2008)

Computing the actions of Wilson-Dirac operator contributes most of the CPU time for the grand challenge problem of simulating Lattice Quantum Chromodynamics (Lattice QCD). This routine exhibits many challenges in implementation on most computational environments because of the multiple patterns of accessing the same data, making it difficult to align the data efficiently at compile time. Additionally, the low computation to memory access ratio makes this computation bounded by the memory bandwidth and the memory latency. In this work, we present an implementation of this routine on the Cell Broadband Engine. We propose runtime data fusion, an approach that aims at re-aligning data at runtime, for data that cannot be aligned optimally at compile time, thus improving the performance of SIMDized execution. We also show a DMA optimization technique that reduces the impact of bandwidth limits on performance. Our implementation for this routine achieves 31.2 GFlops for single precision computations and 8.75 GFlops for double precision computations.
Minimize presentation lag by sequencing media objects for auto-assembled presentations from digital libraries
Authors: Feng-Cheng Lin, Chien-Yin Lai, Jen-Shin Hong
Venue: Data Knowledge Engineering (2008)

When delivering and presenting a multimedia document through a high-delay network, presentation lag is a major and critical factor affecting the service quality of the presentation. A dynamically generated multimedia document from a digital library often includes sets of both unconstrained objects and temporally-constrained objects. The order of the objects in a prefetch-enabled presentation environment has an impact on the overall presentation lag. This study explores techniques for optimizing the object sequence for an auto-assembled multimedia presentation to minimize the overall presentation lag. We adapt techniques developed in conventional two-machine flowshop research for computing or approximating the optimal sequences. We extensively discuss a variety of settings for commonly found applications with auto-assembled multimedia presentations. For each problem setting, the formulation and solutions were explored. We implemented a prototype system with which a number of problems have been evaluated. The numerical simulations and real-life experiments with 3G wireless networks show clearly that a computed optimal or near-optimal sequence significantly reduces the presentation lag as compared to random sequences.
Optimal adaptive solution of initial-value problems with unknown singularities
Authors: Bolesław Kacewicz, Paweł Przybyłowicz
Venue: Journal of Complexity (2008)

The optimal solution of initial-value problems in ODEs is well studied for smooth right-hand side functions. Much less is known about the optimality of algorithms for singular problems. In this paper, we study the (worst case) solution of scalar problems with a right-hand side function having r continuous bounded derivatives in R, except for an unknown singular point. We establish the minimal worst case error for such problems (which depends on r similarly as in the smooth case), and define optimal adaptive algorithms. The crucial point is locating an unknown singularity of the solution by properly adapting the grid. We also study lower bounds on the error of an algorithm for classes of singular problems. In the case of a single singularity with nonadaptive information, or in the case of two or more singularities, the error of any algorithm is shown to be independent of r.
A time--frequency approach for noise reduction
Authors: Hamid Hassanpour
Venue: Digital Signal Processing (2008)

This paper proposes a technique for reducing noise from a signal's time series using a time-frequency distribution. The technique is based on the SVD of the matrix associated with the time-frequency representation of the signal. In this approach the time-frequency representation of the signal is initially divided into signal subspace and noise subspace using singular values of the time-frequency matrix as a criterion for space division. Since singular vectors are the span bases of the matrix, reducing the effect of noise from the singular vectors and using them in reproducing the matrix enhances the information embedded in the time-frequency representation of the signal. The proposed approach utilizes the Savitzky-Golay low-pass filter for noise attenuation from the singular vectors. The results of applying the proposed method on both synthetic signals and newborn EEGs indicate superiority of the proposed technique over the existing one in reducing noise from signals.