ppxscal/embedding_network huggingface dataset:
TCP Quick-Adjust by Utilizing Explicit Link Characteristic Information
Authors: Ji Zhang, Jouni Korhonen, SooHong Park, David Pearce
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications - Workshops (2008)

This paper investigates the utilization of explicit bottleneck link characteristic information in order to enhance TCP behaviors. We propose the TCP Quick-Adjust algorithm as an extension of TCP Quick-Start, to allow end nodes to quickly adjust their sending rate for ongoing connections according to the reported bottleneck link bandwidth. Our scheme is considered to be especially suitable to use in a mobile operator’s controlled network domain, where it is possible to provide a subscribed mobile node with reasonably accurate access link and path information. The link characteristic information is piggybacked in IP mobility signaling in this paper. Using simulations, we show that TCP Quick-Adjust provides good performance in terms of link capacity utilization in the scenarios where vertical handovers can happen between two links with very different characteristics.
An Integrated Approach for Modeling Learning Patterns of Students in Web-Based Instruction: A Cognitive Style Perspective
Authors: Sherry Y. Chen, Xiaohui Liu
Venue: ACM Transactions on Computer-Human Interaction (TOCHI) (2008)

Web-based instruction (WBI) programs, which have been increasingly developed in educational settings, are used by diverse learners. Therefore, individual differences are key factors for the development of WBI programs. Among various dimensions of individual differences, the study presented in this article focuses on cognitive styles. More specifically, this study investigates how cognitive styles affect students' learning patterns in a WBI program with an integrated approach, utilizing both traditional statistical and data-mining techniques. The former are applied to determine whether cognitive styles significantly affected students' learning patterns. The latter use clustering and classification methods. In terms of clustering, the K-means algorithm has been employed to produce groups of students that share similar learning patterns, and subsequently the corresponding cognitive style for each group is identified. As far as classification is concerned, the students' learning patterns are analyzed using a decision tree with which eight rules are produced for the automatic identification of students' cognitive styles based on their learning patterns. The results from these techniques appear to be consistent and the overall findings suggest that cognitive styles have important effects on students' learning patterns within WBI. The findings are applied to develop a model that can support the development of WBI programs.
Manufacturing substrate nano-grooves for studying cell alignment and adhesion
Authors: F. C. M. J. M. van Delft, F. C. van den Heuvel, W. A. Loesberg, J. te Riet, P. Schön, C. G. Figdor, S. Speller, J. J. W. A. van Loon, X. F. Walboomers, J. A. Jansen
Venue: Microelectronic Engineering (2008)

Nano-scale pattern templates have been manufactured in order to study the differences in cell behaviour between fibroblasts cultured on smooth and on grooved substrata. The pattern templates were made on silicon wafers using electron beam lithography in hydrogen silsesquioxane (HSQ) and subsequent reactive ion etching (RIE). These masters were replicated in polystyrene cell culture material using solvent casting. The replicas were assessed with atomic force microscopy (AFM). After seeding with fibroblasts, morphological characteristics were investigated using scanning electron microscopy (SEM) and light microscopy, in order to obtain qualitative and quantitative information on cell alignment. It appears that both groove depth and width determine the cellular alignment on patterns with a ridge/groove ratio of 1:1. On smooth substrata, cells always spread out in a random fashion. There appears to be a threshold groove barrier size of around 70-80nm, above which random cell spreading is not possible anymore and contact guidance occurs. It is speculated that this threshold size may be associated with the size of contact molecules at the cell extensions, which grow and find anchoring spots preceding cell spread out and cell alignment.
A Fair Channel Scheduling Algorithm in Optical Burst-Switched Networks
Authors: Ching-Fang Hsu, Li-Cheng Yang, Ke-Kuan Hsu
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications (2008)

Among various signaling protocols designed for OBS networks, the most popular one is Just-Enough-Time (JET) protocol. JET can utilize the network capacity efficiently and reduce end-to-end transmission delay effectively. However, it may suffer from an intrinsic deficiency –fairness problem. Fairness problem is a traditional problem existing in various kinds of networks. It not only results in a phenomenon that bursts with shorter hops are generally favored but also deteriorates the networks utilization. In this paper, we investigated this problem and proposed a fair channel scheduling algorithm as a solution. Generally speaking, there is usually a tradeoff between fairness and blocking performance. Hence, our objective is to keep balanced between the two conflicting metrics. It gives each burst a dynamic priority which is defined by several characteristics of the burst. When a contention occurs, the proposed scheme picks the preferable burst and drops the other one according to their priorities then. Simulation results show that our scheme can improve fairness without degrading dropping performance too much. In addition, it increases the effective link utilizations as well.
Parfait: designing a scalable bug checker
Authors: Cristina Cifuentes, Bernhard Scholz
Venue: Proceedings of the 2008 workshop on Static analysis (2008)

We present the design of Parfait, a static layered program analysis framework for bug checking, designed for scalability and precision by improving false positive rates and scale to millions of lines of code. The Parfait framework is inherently parallelizable and makes use of demand driven analyses. In this paper we provide an example of several layers of analyses for buffer overflow, summarize our initial implementation for C, and provide preliminary results. Results are quantified in terms of correctly-reported, false positive and false negative rates against the NIST SAMATE synthetic benchmarks for C code.
Three fundamental misconceptions of Artificial Intelligence
Authors: Pei Wang
Venue: Journal of Experimental Theoretical Artificial Intelligence (2007)

In discussions on the limitations of Artificial Intelligence (AI), there are three major misconceptions, identifying an AI system with an axiomatic system, a Turing machine, or a system with a model-theoretic semantics. Though these three notions can be used to describe a computer system for certain purposes, they are not always the proper theoretical notions when an AI system is under consideration. These misconceptions are not only the basis of many criticisms of AI from the outside, but also responsible for many problems within AI research. This paper analyses these misconceptions, and points out the common root of them: treating empirical reasoning as mathematical reasoning. Finally, an example intelligent system called NARS is introduced, which is neither an axiomatic system nor a Turing machine in its problem-solving process, and does not use model-theoretic semantics, but is still implementable in an ordinary computer.
Issues in computational resource allocation in cooperative control
Authors: John P. Murphy, Luke M. Wachter, Laura E. Ray
Venue: Proceedings of the 1st international conference on Robot communication and coordination (2007)

This paper considers the problem of computational resource allocation for a team of dynamic mobile robots subject to limited communication and processing bandwidth, and uncertain state information. We describe a robot test bed, the Dynabot, that exhibits these constraints and characterize its information flow and state estimation accuracy. These models are used for simulating formation of a group of Dynabots, while illustrating resource allocation tradeoffs.
The Combination of Amplitude and Sample Entropy in EEG and its Application to Assessment of Cerebral Injuries in Piglets
Authors: Zhang Dandan, Ding Haiyan, Hou Xinlin, Liu Yunfeng, Zhou Congle, Ye Datian
Venue: Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics - Volume 02 (2008)

Amplitude and Sample entropy are independent features of electroencephalography. They could reflect cerebral states in different aspects: amplitude denotes the intensity of synchronous neural activities in cortex while SampEn represents the signal complexity of these bioelectrical processes. Yet both of them have limits when applied to estimation of cerebral functions. Present paper introduces a new parameter called Samplitude by combining amplitude and SampEn of EEG. Then amplitude, SampEn and Samplitude are applied to a set of experimental EEGs. The results prove that Samplitude, which has a high separating capacity and a superior noise-proof ability, is a more suitable parameter to estimate cerebral functions.
Tivoli Management Services Warehouse and Reporting, 2007
Authors: IBM Redbooks
Venue:  (2007)

As the amount of management data that is gathered continues to grow, the data is not being used effectively for IT business-relevant decisions. IBM Tivoli Data Warehouse helps solve this problem by being the central repository in which you can store historical data about your IT infrastructure. This includes network devices and connections, desktops, hardware, software, events, and other information. Stored data is subsequently analyzed and used to produce reports about the behavior of IT components and services. This IBM Redbook discusses all aspects of IBM Tivoli Data Warehouse V2.1 (the version that is shipped with IBM Tivoli Monitoring V6.1) including deployment best practices, scalability, performance optimization, external data integration, reporting, and troubleshooting. As part of the book, we provide a reporting solution for Tivoli Data Warehouse data, which is based on the Business Intelligence and Reporting Tools (BIRT) technology. BIRT is a free, Eclipse-based reporting tool. We also provide an example of a commercial reporting solution: The Crystal Reports solution from Business Objects. We also discuss two solutions that are published on IBM OPAL Web site: QuickReporter for IBM Tivoli Monitoring from Primeur and Warehouse Designer for IBM Tivoli Monitoring 6.1 from Axibase. Both products are IBM certified solutions, specifically designed for IBM Tivoli Monitoring. This book is a reference for IT professionals who implement and use a Tivoli Data Warehouse environment.
Index assignment for 3-description lattice vector quantization based on A2 lattice
Authors: Minglei Liu, Ce Zhu
Venue: Signal Processing (2008)

Multiple description lattice vector quantization (MDLVQ) is an effective technique to realize multiple description coding. In this paper, we investigate a 3-description lattice vector quantization (LVQ) design using A"2 lattice, which finds a 3-tuple combination of sublattice points to represent each fine lattice point, based on two principles that each edge of the triangle formed by the 3-tuple points needs to be as short as possible, and the gravity center of the triangle is as close as possible to the fine lattice point. Following a delicate sublattice partition, a well-designed construction and mapping of each fine lattice point to a 3-tuple of sublattice points is developed to minimize the side distortion. The proposed index assignment is shown to achieve smaller distortion (up to 0.58dB for Gaussian source) than some other 3-description index assignments. Compared with a 2-description LVQ, the 3-description LVQ achieves better expected rate-distortion performance in most cases of high description loss rates, while it also exhibits more graceful coding results with significantly smaller side distortions. Numerical analysis on Gaussian source and the simulations on image source validate the effectiveness of our proposed index assignment scheme.
A study into the effects of personality type and methodology on cohesion in software engineering teams
Authors: J. S. Karn, S. Syed-Abdullah, A. J. Cowling, M. Holcombe
Venue: Behaviour & Information Technology (2007)

The aim of the research described in this paper is to gain a qualitative understanding of how cohesiveness relates to personality type, performance and adherence to a particular software engineering methodology (XP). A variety of research methods were employed including ethnographic methods, questionnaires and interviews. An online personality test based on the Myers-Briggs Type Indicator (MBTI) was used to ascertain the personality types, and questionnaires were used throughout the project to measure levels of cohesiveness. Examples of how the teams worked together throughout the project are described, and whether and how this relates to the personality types of the individual members. The results indicate that certain teams were found to work consistently well over the project due to homogeneity in personality type and others were found to be very cohesive due to a mixture of types.
Shadow multiplexing for single camera visual hull reconstruction
Authors: Tom Cuypers, Yannick Francken, Philippe Bekaert
Venue: Proceedings of the 5th ACM/IEEE International Workshop on Projector camera systems (2008)

In this work we propose a technique for efficient extraction of multiviewpoint silhouettes using a single camera. To achieve this, we replace the cameras of a typical multi-camera setup with light sources and capture the multiplexed cast shadows. Because we only use a single camera, our setup is much cheaper than a classical setup, no camera synchronization is required, and less data has to be captured and processed. In addition, silhouette extraction is easy and robust, as we are segmenting the cast shadows instead of the background and objects' texture information. We evaluate our method on both a real and a virtual setup, and show that our technique works for a large variety of objects and materials.
Memory-constrained block processing for DSP software optimization
Authors: Ming-Yung Ko, Chung-Ching Shen, Shuvra S. Bhattachryya
Venue: Journal of Signal Processing Systems (2008)

Digital signal processing (DSP) applications involve processing long streams of input data. It is important to take into account this form of processing when implementing embedded software for DSP systems. Task-level vectorization, or block processing, is a useful dataflow graph transformation that can significantly improve execution performance by allowing subsequences of data items to be processed through individual task invocations. In this way, several benefits can be obtained, including reduced context switch overhead, increased memory locality, improved utilization of processor pipelines, and use of more efficient DSP oriented addressing modes. On the other hand, block processing generally results in increased memory requirements since it effeclively increases the sizes of the input and output values associated with processing tasks. In this paper, we investigate the memory-performance trade-off associated with block processing. We develop novel block processing algorithms that carefully take into account memory constraints to achieve efficient block processing configurations within given memory space limitations. Our experimental results indicate that these methods derive optimal memory-constrained block processing solutions most of the time. We demonstrate the advantages of our block processing techniques on practical kernel functions and applications in the DSP domain.
Versatile multiplier architectures in GF(2k) fields using the Montgomery multiplication algorithm
Authors: Apostolos P. Fournaris, O. Koufopavlou
Venue: Integration, the VLSI Journal (2008)

Many sequential multipliers for polynomial basis GF(2^k) fields have been proposed using the LSbit and MSbit multiplication algorithm. However, all those designs are defined over fixed size GF(2^k) fields and sometimes over fixed special form irreducible polynomials (AOL, trinomials, pentanomials). When such architectures are redesigned for arbitrary GF(2^k) fields and generic irreducible polynomials, therefore made versatile, they result in high space complexity (gate-latch number), low frequency (high critical path) and high latency designs. In this paper a Montgomery multiplication element (MME) architecture specially designed for arbitrary GF(2^k) fields defined over general irreducible polynomials, is proposed, based on an optimized version of the Montgomery multiplication (MM) algorithm for GF(2^k) fields. To evaluate the proposed MME and prove the efficiency of the MM algorithm in versatile designing, three distinct versatile Montgomery multiplier architectures are presented using this proposed MME. They achieve small gate-latch number and high clock frequency compared to other sequential versatile designs.
Computational aspects of monotone dualization: A brief survey
Authors: Thomas Eiter, Kazuhisa Makino, Georg Gottlob
Venue: Discrete Applied Mathematics (2008)

Dualization of a monotone Boolean function represented by a conjunctive normal form (CNF) is a problem which, in different disguise, is ubiquitous in many areas including Computer Science, Artificial Intelligence, and Game Theory to mention some of them. It is also one of the few problems whose precise tractability status (in terms of polynomial-time solvability) is still unknown, and now open for more than 25 years. In this paper, we briefly survey computational results for this problem, where we focus on the famous paper by Fredman and Khachiyan [On the complexity of dualization of monotone disjunctive normal forms, J. Algorithms 21 (1996) 618-628], which showed that the problem is solvable in quasi-polynomial time (and thus most likely not co-NP-hard), as well as on follow-up works. We consider computational aspects including limited nondeterminism, probabilistic computation, parallel and learning-based algorithms, and implementations and experimental results from the literature. The paper closes with open issues for further research.
Towards a methodology for lifelong validation of service compositions
Authors: Domenico Bianculli, Carlo Ghezzi
Venue: Proceedings of the 2nd international workshop on Systems development in SOA environments (2008)

We argue that the dynamic nature of compositions in service-oriented architectures requires re-thinking the whole lifetime of an application, from requirements, to design and implementation, to deployment, to operation. In particular, the traditional boundary between design time and run time is blurring. Validation, which traditionally pertains to design time, must now extend to run time. This position paper digs into the requirements and outlines a research agenda, based on the experience gained in previous research projects, to engineer dependable service compositions.
Island wake circulation off Maldives during boreal winter, as visualised with MODIS derived chlorophyll-a data and other satellite measurements
Authors: S. K. Sasamal
Venue: International Journal of Remote Sensing (2007)

The north equatorial current (NEC) is a seasonal current that exhibits variability in its strength and transport. In this paper, the westward flow of the NEC in the Indian Ocean has been observed during the northeast monsoon. The NEC passes through the Maldives, a group of coral islands in the central part of the equatorial Indian Ocean along 73° E. This flow has been shown to enhance biological productivity on the west coast of the Maldives during boreal winter. This was visualized with chlorophyll-a data derived using a Moderate Resolution Imaging Spectroradiometer (MODIS) sensor on 11 December 2003. The plumes of chlorophyll-a showing the progress of the westward flow through the Kardive channel on the west coast of the Maldives during the winter of 2003 to 2004 were studied. Analysis of weekly chlorophyll-a data from November to March 2000 to 2004 also indicated westward flow with distinct inter-annual and intra-season variations. The surface wind, obtained from Quicksat scatterometer data, and the mean sea level anomaly, obtained from altimeter data corresponding to the flow were also analysed. Hydrographic observations studied with ARGO floats around the area also provided supporting evidence of the flow through the Maldives group of islands in the Indian Ocean.
Study on Customer Desired Value Change in a Business to Consumer Market
Authors: Wei Jia, Mingli Zhang
Venue: Proceedings of the Fifth International Conference on Information Technology: New Generations (2008)

The change of customer desired value has been analyzed in this paper. Then a theoretical framework has been constructed, which includes the following three parts: factors that affect the change of customer desired value; form and intensity of the change; corporations’ reactions to the change of customer desired value. Finally, this paper conducts an empirical research based on the practical data from the mobile phone market in university. The research includes two parts, the first of which is to measure the structure of customer desired value in university and the second part is to measure the change of customer desired value. The research confirms the theoretical framework.
Analysis and Semantic Querying in Large Biomedical Image Datasets
Authors: Vijay S. Kumar, Sivaramakrishnan Narayanan, Tahsin Kurc, Jun Kong, Metin N. Gurcan, Joel H. Saltz
Venue: Computer (2008)

Biomedical image analysis plays an important role in diagnosing, prognosing, and treating complex diseases. The authors describe a set of techniques for analyzing, processing, and querying large image datasets using semantic and spatial information.
Architecture-driven software mobility in support of QoS requirements
Authors: Marija Mikic-Rakic, Sam Malek, Nenad Medvidovic
Venue: Proceedings of the 1st international workshop on Software architectures and mobility (2008)

Over the past decade researchers have shown that software architecture provides an appropriate level of granularity for assessing a system's Quality of Service (QoS) properties (e.g., latency). Similarly, many previous works have adopted an architecture-centric approach to reason about the runtime adaptation, including component mobility, of software systems. However, the relationship between software architecture, QoS, and mobility is not clearly understood. In this paper, we present a framework that takes an explicit software architecture perspective for assessing the system's QoS properties, and improving it through architectural mobility. We describe the implementation of the framework, as well as some of the remaining challenges that frame our ongoing work.
Optimal control of multi-vehicle-systems under communication constraints using mixed-integer linear programming
Authors: Christian Reinl, Oskar von Stryk
Venue: Proceedings of the 1st international conference on Robot communication and coordination (2007)

A new planning method for optimal cooperative control of heterogeneous multi-vehicle systems is investigated which enables to account for each vehicle's nonlinear physical motion dynamics in a structured environment as well as for connectivity constraints of wireless communication. A general formulation as nonlinear hybrid optimal control problem (HOCP) is presented. A transformation technique is proposed to reduce the large computational efforts for solving HOCPs towards a future online application of this approach. Hereby the general problem is transcribed to a linearized mixed-integer linear programming problem (MILP) which can be solved much more efficiently. The proposed approach is successfully applied to the numerical solution of a representative, cooperative monitoring problem involving heterogeneous vehicles and conditions.