ppxscal/embedding_network huggingface dataset:
Positive almost periodic solutions for a class of Liénard-type systems with multiple deviating arguments
Authors: Yimin Meng, Bingwen Liu, Lihong Huang
Venue: Journal of Computational and Applied Mathematics (2008)

This paper considers the Lienard-type systems with multiple deviating arguments. Sufficient conditions for the existence and exponential stability of positive almost periodic solutions are established, which are new and complement previously known results.
Do secure information system design methods provide adequate modeling support?
Authors: Mikko Siponen, Juhani Heikka
Venue: Information and Software Technology (2008)

Information system development (ISD) methods lack security features. To address this problem, various secure information system (SIS) design methods have been proposed. An important feature of these methods is modeling support, which manifests itself through modeling notations. This paper explores the extent to which the alternative SIS design methods offer modeling support. The results suggest that extant SIS design methods provide only limited modeling support. No single SIS design method offers comprehensive modeling support. This result has implications for practice and research. Practitioners may need to combine different SIS design methods for the development of secure information systems (IS). In turn, scholars and SIS design method developers should ensure that future SIS design methods offer comprehensive modeling support. Finally, empirical studies should be conducted to explore the usability of the current conceptual models of secure systems design methods in practice.
A 1.8/2.4-ghz dualband cmos low noise amplifier using miller capacitance tuning
Authors: Depak Balemarthy, Roy Paily
Venue: Proceeding of the 13th international symposium on Low power electronics and design (2008)

This paper describes an inductively source degenerated dual-band low noise amplifier (LNA) designed in a standard CMOS 0.18 µm TSMC process. The dual-band LNA can be tuned to 1.8-GHz and 2.4-GHz. The impedance matching is obtained at the required frequency bands using Miller-capacitance tuning. The designed LNA exhibits a gain of 18.2dB and 16.2dB and a noise figure of 5.0dB and 3.7dB at 1.8 and 2.4-GHz respectively. The LNA design is carried out using Mentor Graphics Eldo software.
Finite-State Modeling and Testing of Image Based Authentication System
Authors: Nitin, Durg Singh Chauhan, Vivek Kumar Sehgal, Ankit Mahanot, Pallavi Singh, Sohit Ahuja, Utkarsh Shrivastava, Manisha Rana, Vineet Punjabi, Shivam Vinay, Nakul Sharma
Venue: Proceedings of the Seventh IEEE/ACIS International Conference on Computer and Information Science (icis 2008) (2008)

Secure environments protect their resources against unauthorized access by enforcing access control mechanisms. So when increasing security is an issue text based passwords are not enough to counter such problems. This is where Image Based Authentication (IBA) comes into play. IBA enhances the security level in an exceptionally user friendly way. This paper is a comprehensive study and comparison of proposed Jaypee University of Information Technology–IBA System with the University of Florida–IBA System on the subject of using images as the password set. Furthermore the paper introduces a holistic view of Completed Finite State Automation (CFSA) modeling that can be carried out as a complementary step to system modeling, enabling a precise scalability of the test process, revealing much rationalization potential. Finite-state based notions enable to introduce efficient algorithms to generate Legal Interaction Pairs (IPs), Faulty Interaction Pairs, and Regular Expression (RegEx).
SNOBFIT -- Stable Noisy Optimization by Branch and Fit
Authors: Waltraud Huyer, Arnold Neumaier
Venue: ACM Transactions on Mathematical Software (TOMS) (2008)

The software package SNOBFIT for bound-constrained (and soft-constrained) noisy optimization of an expensive objective function is described. It combines global and local search by branching and local fits. The program is made robust and flexible for practical use by allowing for hidden constraints, batch function evaluations, change of search regions, etc.
The Semantics of Mobile TV
Authors: Bryan Copeland
Venue: Proceedings of the Communication Networks and Services Research Conference (2008)

In order for a ubiquitous Semantic Web-enabled global network to emerge, it is evident that many significant sub-domains must first evolve. A sub-domain, in this sense, can be thought of as a structured representation of a set of concepts and their associated attributes and terms within a given domain. Domains, which are a logical grouping of sub-domains, may span many different applications, websites, portals, organizations or even industries. Domains must be capable of harmoniously exchanging data with others when requested, regardless of whether requests come from a human or a machine. This article will explain why one emerging domain – that of “Mobile TV” – is an appropriate if not prerequisite candidate domain for the Semantic Web.
Wafer-level modular testing of core-based SoCs
Authors: Sudarshan Bahukudumbi, Krishnendu Chakrabarty
Venue: IEEE Transactions on Very Large Scale Integration (VLSI) Systems (2007)

Product cost is a major driver in the consumer electronics market, which is characterized by low profit margins and the use of core-based system-on-chip (SoC) designs. Packaging has been recognized as a significant contributor to the product cost for such SoCs. To reduce packaging cost and the test cost for packaged chips, wafer-level testing (wafer sort) is used in the semiconductor industry to screen defective dies. However, since test time is a major practical constraint for wafer sort, even more so than for package test, not all the scan-based digital tests can be applied to the die under test. We present an optimal test-length selection technique for wafer-level testing of core-based SoCs. This technique, which is based on a combination of statistical yield modeling and integer linear programming, allows us to determine the number of patterns to use for each embedded core during wafer sort such that the probability of screening defective dies is maximized for a given upper limit on the SoC test time. We also present a heuristic method to handle large next-generation SoC designs. Simulation results are presented for five of the ITC'02 SoC Test benchmarks, and the optimal test-length selection approach is compared with the heuristic method.
Classification of floodplain vegetation by data fusion of spectral (CASI) and LiDAR data
Authors: G. W. Geerling, M. Labrador-Garcia, J. G. P. W. Clevers, A. M. J. Ragas, A. J. M. Smits
Venue: International Journal of Remote Sensing (2007)

To safeguard the goals of flood protection and nature development, a river manager requires detailed and up-to-date information on vegetation structures in floodplains. In this study, remote-sensing data on the vegetation of a semi-natural floodplain along the river Waal in the Netherlands were gathered by means of a Compact Airborne Spectrographic Imager (CASI; spectral information) and LiDAR (structural information). These data were used to classify the floodplain vegetation into eight and five different vegetation classes, respectively. The main objective was to fuse the CASI and LiDAR-derived datasets on a pixel level and to compare the classification results of the fused dataset with those of the non-fused datasets. The performance of the classification results was evaluated against vegetation data recorded in the field. The LiDAR data alone provided insufficient information for accurate classification. The overall accuracy amounted to 41% in the five-class set. Using CASI data only, the overall accuracy was 74% (five-class set). The combination produced the best results, raising the overall accuracy to 81% (five-class set). It is concluded that fusion of CASI and LiDAR data can improve the classification of floodplain vegetation, especially for those vegetation classes which are important to predict hydraulic roughness, i.e. bush and forest. A novel measure, the balance index, is introduced to assess the accuracy of error matrices describing an ordered sequence of classes such as vegetation structure classes that range from bare soil to forest.
An Interview with Wei Zhao
Authors: Ubiquity staff
Venue: Ubiquity (2008)

Wei Zhao is currently the Dean of the School of Science at Rensselaer Polytechnic Institute. Before he joined RPI in 2007, he was a Senior Associate Vice President for Research at Texas A M University. Between 2005 and 2007, he also served as the Director for the Division of Computer and Network Systems in the National Science Foundation. He completed his undergraduate program in physics at Shaanxi Normal University, Xi'an, China, in 1977. He received his M.Sc. and Ph.D. degrees in Computer and Information Sciences at the University of Massachusetts at Amherst in 1983 and 1986, respectively. During his career, he has also served as a faculty member at Amherst College, the University of Adelaide, and Texas A M University. This interview was conducted by Ubiquity editor-in-chief John Gehl.
Error estimates for interpolating div--curl splines under tension on a bounded domain
Authors: M. N. Benbourhim, A. Bouhamidi
Venue: Journal of Approximation Theory (2008)

This paper discusses error estimates and convergence for interpolation by div-curl spline under tension of a vector field in the classical vectorial Sobolev space on an open bounded set with a Lipschitz-continuous boundary. A property of convergence is also given when the set of interpolating points becomes more and more dense.
A Monte Carlo method for solving unsteady adjoint equations
Authors: Qiqi Wang, David Gleich, Amin Saberi, Nasrollah Etemadi, Parviz Moin
Venue: Journal of Computational Physics (2008)

Traditionally, solving the adjoint equation for unsteady problems involves solving a large, structured linear system. This paper presents a variation on this technique and uses a Monte Carlo linear solver. The Monte Carlo solver yields a forward-time algorithm for solving unsteady adjoint equations. When applied to computing the adjoint associated with Burgers' equation, the Monte Carlo approach is faster for a large class of problems while preserving sufficient accuracy.
Networks of evolutionary processors: UML architecture
Authors: Miguel Anel Peña, Miguel Angel Diaz, Nuria Gomez Blas
Venue: Proceedings of the 5th WSEAS International Conference on Computational Intelligence, Man-Machine Systems and Cybernetics (2006)

This paper presents a connectionist model that is widely used to solve NP-problems: Networks of Evolutionary Processors (NEP). A NEP is a set of processors connected by a graph, each processor only deals with symbolic information using rules, that is, symbols in a processor evolve according some rules. Communication through the graph is based on a filter set that permits (or not) symbols to go from one processor to another. This two steps: evolution and communication, makes NEPs able to solve NP-problems. This paper also proposes an UML architecture to implement NEPs. This work is actually under development and will be implemented in a distributed way, maybe using Java Agent Development Enviroment - JADE, in order to obtain similar results to theoretical ones: solution of NP-problems in linear time. Proposed UML architecture is based on the general behaviour of NEPs.
Analysis of time dependent polymer deformation based on a viscoelastic model in thermal imprint process
Authors: H. Takagi, M. Takahashi, R. Maeda, Y. Onishi, Y. Iriye, T. Iwasaki, Y. Hirai
Venue: Microelectronic Engineering (2008)

A finite element simulation tool for thermal imprint process has been developed. In the system, polymer is assumed to be a viscoelastic body represented by the generalized Maxwell model. We experimentally measured viscoelastic properties of a polymer material and derived parameters used in the simulation tool. Using the same polymer material, we performed imprint experiments to examine time dependent deformation. Comparing the polymer deformations in simulated results with those in experiments, we confirmed that the developed simulation tool and the measured material parameters were useful for analysis of thermal imprint process.
ChIPCodis
Authors: Federico Abascal, Pedro Carmona-Saez, Jose-Maria Carazo, Alberto Pascual-Montano
Venue: Bioinformatics (2008)

Motivation: Eukaryotic genes are often regulated by multiple transcription factors (TFs). Depending on the interactions among different TFs the expression of a gene can be tuned to respond to diverse environmental conditions. Chip-on-chip experiments provide a snapshot of which TF are in vivo bound to which genes in a particular condition, and have been applied to characterize the regulatory code of yeast under several experimental settings. ChIPCodis mines this data to provide new insights about how the expression of a particular group of genes is regulated. For a given list of yeast genes ChIPCodis determines which combinations of TFs are significantly over-represented in a series of environmental conditions. Availabilty: http://chipcodis.dacya.ucm.es Contact: pascual@fis.ucm.es Supplementary information: http://chipcodis.dacya.ucm.es/sm.html
Geometrical Structure of Entangled States and the Secant Variety
Authors: Hoshang Heydari
Venue: Quantum Information Processing (2008)

We investigate the geometrical structure of entangled and separable bipartite and multipartite states based on the secant variety of the Segre variety. We show that the Segre variety coincides with the space of separable multipartite state and the higher secant variety of the Segre variety coincides with the space of entangled multipartite states.
Design, implementation and evaluation of a QoS-aware transport protocol
Authors: Guillaume Jourjon, Emmanuel Lochin, Patrick Sénac
Venue: Computer Communications (2008)

In the context of a reconfigurable transport protocol framework, we propose a QoS-aware Transport Protocol (QSTP), specifically designed to operate over QoS-enabled networks with bandwidth guarantee. QSTP combines QoS-aware TFRC congestion control mechanism, which takes into account the network-level bandwidth reservations, with a Selective ACKnowledgment (SACK) mechanism in order to provide a QoS-aware transport service that fill the gap between QoS enabled network services and QoS constraint applications. We have developed a prototype of this protocol in the user-space and conducted a large range of measurements to evaluate this proposal under various network conditions. Our results show that QSTP allows applications to reach their negotiated QoS over bandwidth guaranteed networks, such as DiffServ/AF network, where TCP fails. This protocol appears to be the first reliable protocol especially designed for QoS network architectures with bandwidth guarantee.
Task detection for activity-based desktop search
Authors: Sergey Chernov
Venue: Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval (2008)

The desktop search tools provide powerful query capabilities and result presentation techniques. However, they do not take the user context into account. We propose to exploit collected information about user activities with desktop files and applications for activity-based desktop search. When I prepare for a project review and type in a search box the name of a colleague, I expect to find her last deliverable draft, but not her email with a paper review or our joint conference presentation. Ideally, the desktop search system should be able to infer my current task from the logs of my previous activities and present task-specific search results.
Avoiding transient loops during the convergence of link-state routing protocols
Authors: Pierre Francois, Olivier Bonaventure
Venue: IEEE/ACM Transactions on Networking (TON) (2007)

When using link-state protocols such as OSPF or IS-IS, forwarding loops can occur transiently when the routers adapt their forwarding tables as a response to a topological change. In this paper, we present a mechanism that lets the network converge to its optimal forwarding state without risking any transient loops and the related packet loss. The mechanism is based on an ordering of the updates of the forwarding tables of the routers. Our solution can be used in the case of a planned change in the state of a set of links and in the case of unpredictable changes when combined with a local protection scheme. The supported topology changes are link transitions from up to down, down to up, and updates of link metrics. Finally, we show by simulations that sub-second loop-free convergence is possible on a large Tier-1 ISP network.
Spin Wave Logic Circuit on Silicon Platform
Authors: Alexander Khitun, Mingqiang Bao, Yina Wu, Ji-Young Kim, Augustin Hong, Ajey Jacob, Kosmas Galatsis, Kang L. Wang
Venue: Proceedings of the Fifth International Conference on Information Technology: New Generations (2008)

We analyze spin wave-based logic circuits for information transmission and processing in integrated magneto-electric circuits. A bit of information is encoded into the phase of the spin wave propagating in the magnetic waveguide referred to as spin wave bus. It makes possible to transmit and process a number of bits at constant time. By exploiting sin wave superposition, a set of logic gates such as AND, OR, and Majority gate can be realized in one circuit. This paper presents the realization of a spin-wave based logic circuit fabricated on a silicon platform. The prototype micrometer scale circuit operates in the GHz frequency range and offers exciting potential as a multifunctional logic gate that could be scaled down to 0.1um2 with energy per bit as low as attoJ. Another potential advantage of the spin wave-based logic circuitry is the ability to implement logic gates with fewer elements as compared to CMOS-based circuits in achieving same functionality. The shortcomings and disadvantages of the spin wave-based devices are discussed.
Stability and synchronization of random brain networks with a distribution of connection strengths
Authors: R. T. Gray, P. A. Robinson
Venue: Neurocomputing (2008)

The impact of stability and synchronization of electrical activity on the structure of random brain networks with a distribution of connection strengths is investigated using a physiological model of brain activity. Connection strength is measured by the gain of the connection, which describes the effect of changes in the firing rate of neurons in one component on the neurons of another component. The stability of a network is calculated from the eigenvalue spectrum of the network's matrix of gains. Using random matrix theory, we predict and numerically verify the eigenvalue spectrum of randomly connected networks with gain values determined by a probability distribution. From the eigenvalue spectrum, the probability that a network is stable is calculated and shown to constrain the structural and physiological parameters of the network. In particular, stability constrains the variance of the gains. The complex vector of component amplitudes, or mode, corresponding to each dispersion root is an eigenvector of the network's gain matrix and is used to calculate the synchronization of each component's electrical activity. Synchronization is shown to decrease as the variance of the connection gain increases and inhibitory connections become more likely. Brain networks with large gain variance are shown to have multiple eigenvalues close to the stability boundary and to be partially synchronized. Such a network would have multiple partially synchronized modes strongly excited by a stimulus.
Objective quality assessment of color images based on a generic perceptual reduced reference
Authors: Mathieu Carnec, Patrick Le Callet, Dominique Barba
Venue: Image Communication (2008)

When an image is supposed to have been transformed by a process like image enhancement or lossy image compression for storing or transmission, it is often necessary to measure the quality of the distorted image. This can be achieved using an image processing method called ''quality criterion''. Such a process must produce objective quality scores in close relationship with subjective quality scores given by human observers during subjective quality assessment tests. In this paper, an image quality criterion is proposed. This criterion, called C4, is fully generic (i.e., not designed for predefined distortion types or for particular images types) and based on a rather elaborate model of the human visual system (HVS). This model describes the organization and operation of many stages of vision, from the eye to the ventral and dorsal pathways in the visual cortex. The novelty of this quality criterion relies on the extraction, from an image represented in a perceptual space, of visual features that can be compared to those used by the HVS. Then a similarity metric computes the objective quality score of a distorted image by comparing the features extracted from this image to features extracted from its reference image (i.e., not distorted). Results show a high correlation between produced objective quality scores and subjective ones, even for images that have been distorted through several different distortion processes. To illustrate these performances, they have been computed using three different databases that employed different contents, distortions type, displays, viewing conditions and subjective protocols. The features extracted from the reference image constitute a reduced reference which, in a transmission context with data compression, can be computed at the sender side and transmitted in addition to the compressed image data so that the quality of the decompressed image can be objectively assessed at the receiver side. More, the size of the reduced reference is flexible. This work has been integrated into freely available applications in order to formulate a practical alternative to the PSNR criterion which is still too often used despite its low correlation with human judgments. These applications also enable quality assessment for image transmission purposes.
Steiner distance and convexity in graphs
Authors: J. Cáceres, A. Márquez, M. L. Puertas
Venue: European Journal of Combinatorics (2008)

We use the Steiner distance to define a convexity in the vertex set of a graph, which has a nice behavior in the well-known class of HHD-free graphs. For this graph class, we prove that any Steiner tree of a vertex set is included into the geodesical convex hull of the set, which extends the well-known fact that the Euclidean convex hull contains at least one Steiner tree for any planar point set. We also characterize the graph class where Steiner convexity becomes a convex geometry, and provide a vertex set that allows us to rebuild any convex set, using convex hull operation, in any graph.