ppxscal/embedding_network huggingface dataset:
Effects of route optimization on out-of-order packet delivery in mobile IP networks
Authors: Yung-Chang Wong, Tsan-Pin Wang, Yi-Bing Lin
Venue: Information Sciences&mdash;Informatics and Computer Science: An International Journal (2005)

Packet sequence disruption caused by route optimization may result in degradation of mobile TCP/IP performance. In this paper, we propose an analytic model to investigate the impact of route optimization on out-of-order packet delivery in Mobile IP networks. When a mobile node (MN) moves to a new location, the packets sent from the corresponding node (CN) to the MN are routed indirectly through the home agent (HA). After route optimization, the subsequent packets will be sent from the CN to the MN directly. Let p be a packet traveling through the triangle path to the MN (via the HA), and q be the first packet sent via the optimized path to the MN. Packet p is sent from the CN earlier than q is. We derive the probability that packet p arrives at the MN later than packet q does, and validate the analytic model by simulation experiments. Our simulation experiments are extended to investigate how the transmission delay distributions affect the probability of out-of-order delivery. The results provide a guideline in adjusting the routing priority of binding updates to improve the end-to-end network performance.
Review of "The Hedonistic Neuron: A Theory of Memory, Learning, and Intelligence by A. Harry Klopf"; Hemisphere Publishing Corporation, Washington, 1982.
Authors: Stephen W. Smoliar
Venue: Issue 84 (April 1983) (1983)

In an age in which verbose obfuscation becomes more fashionable with every new government appointment, one has to appreciate an author who can give a cogent summary of his entire book in the second paragraph of his Preface:The book examines a theory of brain function based on the postulate that neurons "seek" excitation and "avoid" inhibition, this goal being pursued within well-defined limits that preclude an epileptic outcome (except under pathological circumstances that, indeed, we know do arise). In the development of the theory, it will be seen that a plausible adaptive mechanism exists that can account, in mechanistic terms, for the postulated neuronal behavior. Also, the notion of an excitation-seeking, inhibition-avoiding neuron will be shown to be consistent with experimentally observed neuronal behavior. Neuronal and cortical polarization studies, the mirror focus, and epileptic foci appear to be understandable in light of the proposed neuronal model. At a psychological level, habituation, dishabituation, classical and operant conditioning, and extinction can be shown to be straightforward consequences of a goal-seeking neuron like the kind proposed. None of this is to suggest that the validity of the proposed theory is demonstrated here. Far from it. Difficult experiments will have to be performed at the neuronal level to test the theory rigorously. Until these experiments are accomplished, the significance of the theory lies in its offering a fundamentally new view of brain function, a view that suggests alternative, and perhaps more productive, experiments.
A note on resolution, connection graphs, and subsumption
Authors: Dennis de Champeaux
Venue: Issue 81 (July 1982) (1982)

Completeness is endangered by the combination in connection graph of subsumption deletion rules and the run time pure literal rule. With some care we can restore completeness.
Mapping cityscapes into cyberspace for visualization: Research Articles
Authors: Jiang Yu Zheng, Min Shi
Venue: Computer Animation and Virtual Worlds (2005)

This work establishes a cyberspace of a real urban area for visiting on the Internet. By registering entire scenes along every street and at many locations, viewers can visually travel around and find their destinations in cyberspace. The issues we discuss here are mapping of a large-scale area to image domains in a small amount of data, and effective display of the captured scenes for various applications. Route Panoramas captured along streets and panoramic views captured at widely opening sites are associated to a city map to provide navigation functions. This paper focuses on the properties of our extended images&mdash;route panorama, addressing the archiving process applied to an urban area, an environment developed to transmit image data as streaming media, and display for scene traversing on the WWW in real time. The created cyberspaces of urban areas have broad applications such as city tour, real estate searching, e-commerce, heritage preservation, urban planning and construction, and vehicle navigation. Copyright &copy; 2005 John Wiley & Sons, Ltd.
Tracking privacy compliance in B2B networks
Authors: Liam Peyton, Max Nozin
Venue: Proceedings of the 6th international conference on Electronic commerce (2004)

Governments are now enacting comprehensive legislation that regulates how organizations collect and protect sensitive data about individuals. Typically, such legislation has focused on the relationship between consumer and business to ensure proper consent is obtained, procedures exist to safeguard data, and the consumer has recourse to challenge the business. In practice, such legislation places the entire administrative burden of tracking compliance on both the consumer and the business. More significantly, the legislation does not adequately address the sharing of private information between businesses that cooperate in providing services to consumers. In this paper, we introduce the concept of an "information transfer registry" as a mechanism to track compliance in a business to business network that is complementary to existing legislation and technical standards. We show that the concept has the added benefit of reducing the administrative burden on consumers and businesses.
B-spline enhanced time-spectrum analysis
Authors: Roger A. Green, Adnanul Haq
Venue: Signal Processing (2005)

A new technique for the time-spectrum analysis of non-stationary signals is presented. The proposed technique smoothly fits a system's time-varying spectral coefficients using the combined methods of Fourier analysis and B-splines. The resulting algorithm is efficient and generally effective. Algorithm assumptions and limitations are identified; performance is explored using simulated data. Provided certain conditions are met, the algorithm degenerates into the well-known cases of the simple and averaged periodograms. Methods are presented to calculate knot spacing based on the frequency and geometric properties of the ensuing time-spectrum curve. Near real-time capabilities are also discussed. Finally, the method is compared with other time-spectrum analysis techniques such as the evolutionary periodogram (EP).
Fast exact leave-one-out cross-validation of sparse least-squares support vector machines
Authors: Gavin C. Cawley, Nicola L. C. Talbot
Venue: Neural Networks (2004)

Leave-one-out cross-validation has been shown to give an almost unbiased estimator of the generalisation properties of statistical models, and therefore provides a sensible criterion for model selection and comparison. In this paper we show that exact leave-one-out cross-validation of sparse Least-Squares Support Vector Machines (LS-SVMs) can be implemented with a computational complexity of only O(ln2) floating point operations, rather than the O(l2n2) operations of a naïve implementation, where l is the number of training patterns and n is the number of basis vectors. As a result, leave-one-out cross-validation becomes a practical proposition for model selection in large scale applications. For clarity the exposition concentrates on sparse least-squares support vector machines in the context of non-linear regression, but is equally applicable in a pattern recognition setting.
Adaptive Coding and Modulation for Mobile Wireless Access Via High Altitude Platforms
Authors: Tomaž Javornik, Mihael Mohorčič, Aleš Švigelj, Igor Ozimek, Gorazd Kandus
Venue: Wireless Personal Communications: An International Journal (2005)

In this paper we are concerned with broadband wireless access via high altitude platform system, providing the Internet access and broadband multimedia services to passengers equipped with WLAN terminals connecting through a collective terminal mounted on the train. The main challenge in such scenario is the development of efficient and reliable radio interface for the broadband communication link in the mobile wireless access segment. We are focusing on performance analysis of the adaptive coding and modulation scheme in the communication link between a high altitude platform and a collective terminal on-board moving train. In order to increase the reliability of the communication system in a fading environment we also exploit space and platform diversity. The proposed approach significantly increases the throughput of the wireless access system, while bit error rate remains below the target value regardless of the considered propagation environment.
Handwritten Chinese Trajectories Prediction with an Improved Flat Functional-Link Neural Networks and Kalman Filter
Authors: Duan-Duan Yang, Lian-Wen Jin, Li-Xin Zhen, Jian-Cheng Huang
Venue: Proceedings of the Third International Conference on Image and Graphics (2004)

This paper proposed an improved Flat Functional-link Neural Network (FFNN) to predict handwritten Chinese moving trajectories. To solve the prediction problem of a non-stationary time series, convectional neural networks need a lot of time and samples to train, where FFNN can solve this problem very well. Considering the structure of Chinese characters, the paper makes improvements for FFNN, and promising experimental results have been obtained. Furthermore a comparison is performed between the predictions of the Flat NN and a Kalman filter. Experiments suggest that the improved FFNN predictor works better for the prediction of trajectories of handwritten Chinese characters.
Index Support for Frequent Itemset Mining in a Relational DBMS
Authors: Elena Baralis, Tania Cerquitelli, Silvia Chiusano
Venue: Proceedings of the 21st International Conference on Data Engineering (2005)

Many efforts have been devoted to couple data mining activities with relational DBMSs, but a true integration into the relational DBMS kernel has been rarely achieved. This paper presents a novel indexing technique, which represents transactions in a succinct form, appropriate for tightly integrating frequent itemset mining in a relational DBMS. The data representation is complete, i.e., no support threshold is enforced, in order to allow reusing the index for mining itemsets with any support threshold. Furthermore, an appropriate structure of the stored information has been devised, in order to allow a selective access of the index blocks necessary for the current extraction phase. The index has been implemented into the PostgreSQL open source DBMS and exploits its physical level access methods. Experiments have been run for various datasets, characterized by different data distributions. The execution time of the frequent itemset extraction task exploiting the index is always comparable with and sometime faster than a C++ implementation of the FP-growth algorithm accessing data stored on a flat file.
The Montagues and the Capulets: Conference Papers
Authors: Carole Goble, Chris Wroe
Venue: Comparative and Functional Genomics (2004)

Two households, both alike in dignity, In fair Genomics, where we lay our scene, (One, comforted by its logic's rigour, Claims ontology for the realm of pure, The other, with blessed scientist's vigour, Acts hastily on models that endure), From ancient grudge break to new mutiny, When &lsquo;being&rsquo; drives a fly-man to blaspheme. From forth the fatal loins of these two foes, Researchers to unlock the book of life; Whole misadventured piteous overthrows, Can with their work bury their clans' strife. The fruitful passage of their GO-mark'd love, And the continuance of their studies sage, Which, united, yield ontologies undreamed-of, Is now the hour's traffic of our stage; The which if you with patient ears attend, What here shall miss, our toil shall strive to mend. Copyright &copy; 2005 John Wiley & Sons, Ltd.
ZCZ-CDMA and OFDMA using M-QAM for broadband wireless communications: Research Articles
Authors: Jianfeng Weng, Tho Le-Ngoc, Yinglin Xu
Venue: Wireless Communications Mobile Computing (2004)

This paper considers direct-sequence code-division multiple-access with zero-correlation zone sequences (ZCZ-CDMA) and orthogonal frequency-division multiple-access (OFDMA) schemes using M-ary QAM signaling for broadband wireless communications. Their system structures, complexities and performances in both AWGN and multipath frequency-selective fading channels are evaluated and compared. For ZCZ-CDMA, joint suppression of the multipath fading interference and multiple-access interference can be achieved with a reduced family-size of the spreading sequences. For OFDMA, analytical and simulation results indicate that it has the same performance as ZCZ-CDMA in fast time-varying multipath fading channels. In time-invariant or slowly time-varying channels, where the channel information can be made available to transmitters, OFDMA outperforms ZCZ-CDMA, offers a higher capacity and is more flexible for system reconfiguration with a comparable computational complexity. Copyright &copy; 2004 John Wiley & Sons, Ltd.
Use of relative code churn measures to predict system defect density
Authors: Nachiappan Nagappan, Thomas Ball
Venue: Proceedings of the 27th international conference on Software engineering (2005)

Software systems evolve over time due to changes in requirements, optimization of code, fixes for security and reliability bugs etc. Code churn, which measures the changes made to a component over a period of time, quantifies the extent of this change. We present a technique for early prediction of system defect density using a set of relative code churn measures that relate the amount of churn to other variables such as component size and the temporal extent of churn.Using statistical regression models, we show that while absolute measures of code churn are poor predictors of defect density, our set of relative measures of code churn is highly predictive of defect density. A case study performed on Windows Server 2003 indicates the validity of the relative code churn measures as early indicators of system defect density. Furthermore, our code churn metric suite is able to discriminate between fault and not fault-prone binaries with an accuracy of 89.0 percent.
Service discovery and measurement based on DAML-QoS ontology
Authors: Chen Zhou, Liang-Tien Chia, Bu-Sung Lee
Venue: Special interest tracks and posters of the 14th international conference on World Wide Web (2005)

As more and more Web services are deployed, Web service's discovery mechanisms become essential. Similar services can have quite different QoS behaviors. For service selection and management purpose, it is necessary to clearly specify QoS constraints and metrics definitions for Web services. We investigate on the semantic QoS specification and introduce our design principles on it. Based on the specification refinement and conformance, we introduce the QoS matchmaking algorithm with multiple matching degrees. The matchmaking prototype is designed to prove the feasibility. Well-defined Metrics can be further utilized by measurement organizations to monitor and evaluate the promised service level objectives.
Comparison of higher-order accurate schemes for solving the two-dimensional unsteady Burgers' equation
Authors: Samir F. Radwan
Venue: Journal of Computational and Applied Mathematics (2005)

This paper is devoted to the testing and comparison of numerical solutions obtained from higher-order accurate finite difference schemes for the two-dimensional Burgers' equation having moderate to severe internal gradients. The fourth-order accurate two-point compact scheme, and the fourth-order accurate Du Fort Frankel scheme are derived. The numerical stability and convergence are presented. The cases of shock waves of severe gradient are solved and checked with the fourth-order accurate Du Fort Frankel scheme solutions. The present study shows that the fourth-order two-point compact scheme is highly stable and efficient in comparison with the fourth-order accurate Du Fort Frankel scheme.
Multi Lane Line Reconstruction for Highway Application with a Signal View
Authors: Xin Zhou, Xi-yue Huang
Venue: Proceedings of the Third International Conference on Image and Graphics (2004)

In the intelligent transportation systems, the automatic navigation system is the active research domain. The lane lines reconstruction based on the computer vision is the kernel technique. This paper describes the multi-lane line reconstruction with a single view for highway application. We calibrate the camera and get the model of the road. Then, detect the white lane lines and reconstruct themulti-lane lines. This paper also analysis the basic way to keeping the road based on the vision model and the lane line model. We have experimented the system with the algorithms on highway at 150km/h in Sichuan province and Chongqing city in China. The result shows that the algorithms can work perfectly.
Flooding and Drying in Discontinuous Galerkin Finite-Element Discretizations of Shallow-Water Equations. Part 1: One Dimension
Authors: Onno Bokhove
Venue: Journal of Scientific Computing (2005)

Free boundaries in shallow-water equations demarcate the time-dependent water line between ``flooded'' and ``dry'' regions. We present a novel numerical algorithm to treat flooding and drying in a formally second-order explicit space discontinuous Galerkin finite-element discretization of the one-dimensional or symmetric shallow-water equations. The algorithm uses fixed Eulerian flooded elements and a mixed Eulerian--Lagrangian element at each free boundary. When the time step is suitably restricted, we show that the mean water depth is positive. This time-step restriction is based on an analysis of the discretized continuity equation while using the HLLC flux. The algorithm and its implementation are tested in comparison with a large and relevant suite of known exact solutions. The essence of the flooding and drying algorithm pivots around the analysis of a continuity equation with a fluid velocity and a pseudodensity (in the shallow water case the depth). It therefore also applies, for example, to space discontinuous Galerkin finite-element discretizations of the compressible Euler equations in which vacuum regions emerge, in analogy of the above dry regions. We believe that the approach presented can be extended to finite-volume discretizations with similar mean level and slope reconstruction.
Learning a Hidden Subgraph
Authors: Noga Alon, Vera Asodi
Venue: SIAM Journal on Discrete Mathematics (2005)

We consider the problem of learning a labeled graph from a given family of graphs on n vertices in a model where the only allowed operation is to query whether a set of vertices induces an edge. Questions of this type are motivated by problems in molecular biology. In the deterministic nonadaptive setting, we prove nearly matching upper and lower bounds for the minimum possible number of queries required when the family is the family of all stars of a given size or all cliques of a given size. We further describe some bounds that apply to general graphs.
Analysis of fault detection coverage of a self-test program
Authors: Vehbi Tasar
Venue: ACM SIGDA Newsletter (1978)

A method for determining the percent fault detection coverage of a self-test software program and a method to improve the coverage are presented. These methods are applied to analyze a self-test software program used to check the functional operation of the BDX-910 minicomputer Central Processing Unit (CPU). The results of each analysis are presented. The concepts, tools, assumptions, requirements and constructs of each method are discussed.
An integrated computer-aided design system for custom LSI circuits
Authors: Donald E. Barnes
Venue: ACM SIGDA Newsletter (1979)

An integrated computer aided design system for the design, layout and layout verification of integrated circuits is described. The imagery required for photofabrication of an integrated circuit is created by computer from a place and interconnect data base and a design library system. The imagery created by the computer is analyzed to verify conformance to design rules and proper interconnections. Simulation files are produced for additional verification of interconnects and circuit design.
Saturated simplicial complexes
Authors: V. B. Mnukhin, J. Siemons
Venue: Journal of Combinatorial Theory Series A (2005)

Among shellable complexes a certain class has maximal modular homology, and these are the so-called saturated complexes. We extend the notion of saturation to arbitrary pure complexes and give a survey of their properties. It is shown that saturated complexes can be characterized via the p-rank of incidence matrices and via the structure of links. We show that rank-selected subcomplexes of saturated complexes are also saturated, and that order complexes of geometric lattices are saturated.
Do SQA Programs Work - CMM Works. A Meta Analysis
Authors: Daniel Galin, Moti Avrahami
Venue: Proceedings of the IEEE International Conference on Software - Science, Technology & Engineering (2005)

Many software development professionals and managers of software development organizations are not fully convinced in the profitability of investments for the advancement of SQA systems. The results included in each of the articles we found, , cannot lead to general conclusions on the impact of investments in upgrading an SQA system. Our meta analysis was based on CMM level transition (CMMLT) analysis of available publications and was for the seven most common performance metric. The CMMLT analysis is applicable for combined analysis of empirical data from many sources. Each record in our meta analysis database is calculated as "after-before ratio", which is nearly free of the studied organization's characteristics. Because the CMM guidelines and SQA requirement are similar, we claim that the results for CMM programs are also applicable to investments in SQA systems. The extensive database of over 1,800 projects from a variety of 19 information sources leading to the meta analysis results - proved that investments in CMM programs and similarly in SQA systems contribute to software development performance.
Routing Optimization for Waste Management
Authors: Surya Sahoo, Seongbae Kim, Byung-In Kim, Bob Kraas, Alexander Popov Jr.
Venue: Interfaces (2005)

Waste Management (WM) obtains one third of its revenue from landfill disposals and two-thirds from waste-collection services. As most of the revenue comes from collecting trash, improving efficiency in operating the fleet improves the bottom line. After a flurry of acquisitions and a merger with USA Waste, WM found itself with a large fleet of vehicles whose routing, dispatching, maintenance, and management were decentralized. WM recognized that it could reduce operating costs by improving its use of assets. It contracted with the Institute of Information Technology to develop WasteRoute, a comprehensive route-management system that took into account WM's specific routing concerns and provided broad benefits. Initially, the target audience of the system was the dispatchers and indirectly the drivers. Sales and customer service also benefited because WasteRoute integrated the sales, customer service, and operations departments. The system reduced operating costs, provided better customer service, and determined appropriate prices. WM deployed WasteRoute across the nation beginning in March 2003. By the end of 2003, WM had 984 fewer routes, saving $18 million. It estimated that its savings for 2004 due to the reduction will be $44 million. As it extends the system to additional areas, it expects additional route reductions.