ppxscal/embedding_network huggingface dataset:
Proxy-based Security for the Session Initiation Protocol (SIP)
Authors: Holger Schmidt, Chi-Tai Dang, Franz J. Hauck
Venue: Proceedings of the Second International Conference on Systems and Networks Communications (2007)

There is a trend towards voice-over-IP systems based on the Session Initiation Protocol (SIP), which is a protocol for session management in general. However, as signalling data is transferred using the Internet, systems face security problems. Thus, at least authentication of the participants and confidentiality of signalling data have to be ensured as basic mechanism. In this work, we propose a mechanism for assuring the identity of a group of users fulfilling the same role (e.g., employees of a customer call centre). Using our concept enables using only one certificate for the whole group for signing and encrypting messages according to the SIP standard. Our mechanism works transparently for users as we provide a special proxy server for this purpose, which significantly reduces administration efforts and resource needs on the participating nodes. Furthermore, such a proxy server can be used for transparently validating and decrypting SIP messages as well. This reduces efforts on the terminals, resulting in an improved resource-usage, e.g., on a Personal Digital Assistant. We provide an implementation of the concept based on the NIST SIP proxy server.
Boundedness of the nominal coefficients in Gaussian RBF neural networks
Authors: Juan Ignacio Mulero-Martínez
Venue: Neurocomputing (2007)

The paper analyzes the boundedness of the coefficients involved in Gaussian expansion series. These series arise from the reconstruction of bandlimited functions, applying the sampling theorem with Gaussians as reconstruction filters. The boundedness of the ideal coefficients is a previous requirement that should be imposed to the approximation function. This is due to the fact that the coefficient sequence should be absolutely summable. With this sort of requirements, the targeted function is guaranteed to exhibit finite energy so that it will be manageable from the viewpoint of the approximation theory. On the other hand, the bounds of the coefficients affect considerably to the approximation errors and consequently to the accuracy of the estimation. The major result of this work is formalized in a series of propositions where it is stated how the coefficients are upper bounded by a signal ''sinus cardinalis'' (sinc). Finally, an energy measure of the approximation error is determined as a mean square error. In this line, a number of results are presented in both the univariate and the multivariate case showing how these errors strongly depend on the coefficients in the Gaussian expansion.
Display Condensation of Program Text
Authors: J. Archer
Venue: IEEE Transactions on Software Engineering (1982)

In interactive systems that must display the text of programs, the size of the program is usually much larger than the capacity of the screen. While the obvious strategy is to simply choose k contiguous lines for display in a k-line window, in some cases it is useful to be able to represent m lines in a k-line window, where m > k, by "condensing" portions of the text. This paper is concerned with alternative strategies for controlling such condensation.
A Multiple Computer Linkage
Authors: O. Aberth
Venue: IEEE Transactions on Computers (1969)

A system of memory sharing is proposed as a means for computer communication.
Online Handwritten Japanese Character String Recognition Incorporating Geometric Context
Authors: X.-D. Zhou, J.-L. Yu, C.-L. Liu, T. Nagasaki, K. Marukawa
Venue: Proceedings of the Ninth International Conference on Document Analysis and Recognition - Volume 01 (2007)

This paper describes an online handwritten Japanese character string recognition system integrating scores of geometric context, character recognition, and linguistic context. We give a string evaluation criterion for better integrating the multiple scores while overcoming the effect of string length variability. For measuring geometric context, we propose a statistical method for modeling both single- character and between-character plausibility. Our experimental results on TUAT HANDS databases show that the geometric context improves the character segmentation accuracy remarkably.
Diagnosis in Traditional Chinese Medicine Using Artificial Neural Networks: State-of-the-art and Perspectives
Authors: Minghui Shi, Changle Zhou
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 02 (2007)

Traditional Chinese Medicine (TCM), one of China's splendid cultural heritages, is the science dealing with human physiology, pathology, diagnosis, treatment and prevention of diseases. With the development of modern science, people come to consider the way of the modernization of TCM. Recently, many researchers mainly in China attempt to realize Diagnosis in TCM based on Artificial Neural Networks (DTCMANN). This paper aims at providing an overview of recent DTCMANN studies in TCM field, and focuses on the introduction and summarization of the existing research work about DTCMANN. A review of five major situations, where DTCMANN approaches are applied, has been presented. For each situation, the DTCMANN approaches employed are outlined, as well as the corresponding results. Current research on DTCMANN shows that it is both feasible and promising, and that it is still nearly a piece of virgin soil. The future research direction of DTCMANN is also pointed out based on a discussion of the existing research work.
LBSR: Routing Protocol for MANETs with Unidirectional Links
Authors: Hiroaki Higaki
Venue: Proceedings of the Third IEEE International Conference on Wireless and Mobile Computing, Networking and Communications (2007)

In an ad-hoc network, a routing protocol which de- tects a transmission route from a source mobile com- puter to a destination one is critical due to mobil- ity and limited battery capacity of mobile computers. Here, a communication link between two mobile com- puters is not always bi-directional, i.e. uni-directional, since transmission power of mobile computers is not the same. Though some ad-hoc routing protocols, e.g. DSR, support routing with uni-directional links, mul- tiple floodings (successive broadcasting) are used and communication overhead is high. This paper proposes a novel routing protocol LBSR supporting uni-directional links and based on combination of a single flooding and multiple unicast message transmissions. In LBSR, route cache mechanism works better than DSR in an environment with uni-directional links. Simulation re- sults show the efficiency of route cache in LBSR.
A Hierarchical Clustering Based on Overlap Similarity Measure
Authors: Jun Qu, Qingshan Jiang, Fangfei Weng, Zhiling Hong
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 03 (2007)

Selecting the appropriate number of clusters and distinguishing partially overlapping and irregular data are two important problems in clustering. Hierarchical clustering provides a good solution to them. Similarity measure is the key of controlling the iterative process of hierarchical clustering. In this paper, we give a definition of overlap similarity measure and proposed a hierarchical clustering algorithm based on it without specified number of clusters in advance, whose appropriate value can be decided in the iterative process. The algorithm stops clustering according to the overlap similarity between clusters. Clustering analysis is a useful approach to unsupervised image segmentation. After discussing some related topics, we applied it to synthetic and real image segmentation to evaluate the performance of the clustering algorithm and compared it with other algorithms. Moreover, we estimated parameters of the algorithm in image segmentation. Experimental results show that this approach can be effectively applied to image segmentation.
Early Software Product Improvement with Sequential Inspection Sessions: An Empirical Investigation of Inspector Capability and Learning Effects
Authors: Dietmar Winkler, Bettina Thurnher, Stefan Biffl
Venue: Proceedings of the 33rd EUROMICRO Conference on Software Engineering and Advanced Applications (2007)

Software inspection facilitates product improvement in early phases of software development by detecting defects in various types of documents, e.g., requirements and design specifications. Empirical study reports show that usage-based reading (UBR) techniques can focus inspectors on most important use cases. However, the impact of inspector qualification and learning effects in the context of inspecting a set of documents in several sessions is still not well understood. This paper contributes a model for investigating the impact of inspector capability and learning effects on inspection effectiveness and efficiency in a large-scale empirical study in an academic context. Main findings of the study are (a) the inspection technique UBR better supported the performance inspectors with lower experience in sequential inspection cycles (learning effect) and (b) when inspecting objects of similar complexity significant improvements of defect detection performance could be measured.
Gene Identification Based on Geometrical Representation of DNA Sequence
Authors: JiaWei Luo, Li Yang, YingChun Zhou
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 02 (2007)

We consider a new 4D representation of DNA sequence, which has the advantage of not only containing all the information in the DNA sequence but also avoiding the overlapping. Based on this representation, we define a new Common Frequency Coefficient and apply it to gene identification. The identification result of the S.cerevisiae genome illustrates the superior performance of our approach.
Teasing Apart Two Trees
Authors: M. A. Steel, L. A. Szekely
Venue: Combinatorics, Probability and Computing (2007)

A widely studied model for generating binary sequences is to ‘evolve’ them on a tree according to a symmetric Markov process. We show that under this model distinguishing the true (model) tree from a false one is substantially ‘easier’ (in terms of the sequence length needed) than determining the true tree. The key tool is a new and near-tight Ramsey-type result for binary trees.
Realization of a Class of Switching Functions by Threshold-Logic Networks
Authors: S. S. Yau, D. L. Ostapko
Venue: IEEE Transactions on Computers (1968)

Abstract In this note, a class of switching functions, called threshold-product functions, whose definition is analogous to that of threshold functions (which will be called threshold-sum functions), is studied in detail. It is shown that both threshold functions and parity functions are special cases of threshold-product functions. A simple and economical threshold-logic realization method is established for threshold-product functions. This economical realization method is based on constrained solutions for threshold-product functions. A systematic technique for finding a constrained solution for a threshold-product function is obtained, and this technique can be employed for testing whether a switching function is a threshold-product function as well. When the number of variables in a switching function is not large, say no more than 6, a simpler method for the above purposes is found. Furthermore, a threshold-logic realization method which yields a minimal realization for certain threshold-product functions is obtained.
That's what friends are for: facilitating 'who knows what' across group boundaries
Authors: N. Sadat Shami, Y. Connie Yuan, Dan Cosley, Ling Xia, Geri Gay
Venue: Proceedings of the 2007 international ACM conference on Supporting group work (2007)

We describe the design and evaluation of K-net, a social matching system to help people learn 'who knows what' in an organization by matching people with skills with those who need them. Transactive memory theory predicts that K-net will improve individuals' awareness of 'who knows what'. This should lead to improved performance through sharing knowledge across group boundaries. We evaluate K-net in terms of these predictions in an experiment with 41 students in seven groups working on software engineering projects. Accurate recommendations improved awareness of 'who knows what' versus 'random' recommendations, but did not improve performance. Our results highlight issues related to the evaluation of systems for sharing knowledge across group boundaries.
An Optimal Illumination Region Algorithm for Convex Polygons
Authors: D. T. Lee
Venue: IEEE Transactions on Computers (1982)

For the convex polygon P having n vertices entirely contained in a convex polygon K having m vertices, an optimal algorithm with running time O(n + m) is presented to compute and name regions in the boundary of K from which it is possible to illuminate the exterior of P. It is also shown that this illumination region algorithm can be used to improve the worst case O(nm) running time of a related two dimensional simplex coverability algorithm so that it too has running time O(n + m), and is thus optimal to within a constant factor.
Stress testing cluster Bro
Authors: Nicholas Weaver, Robin Sommer
Venue: Proceedings of the DETER Community Workshop on Cyber Security Experimentation and Test on DETER Community Workshop on Cyber Security Experimentation and Test 2007 (2007)

In previous work we have build a NIDS cluster as a scalable solution for realizing high-performance, stateful network intrusion detection on commodity hardware. Prototypes of our cluster, consisting of up to 10 PCs, are already operating at two major network sites. In this work we are now gaging the scalability of our approach on the DETER testbed to identify potential performance bottlenecks when using larger number of nodes. Due to privacy concerns we can only use synthetic traffic for our evaluation and therefore start by building a new load-balancer element which can replicate small packet traces by several orders of magnitude. We then use this element to generate a network-load suitable for stress-testing the NIDS cluster from traffic captured on a single workstation. While this approach cannot take into account many characteristics of site-specific live traffic, it still allows us to perform a first assessment of the cluster's underlying scalability hypothesis.
Minimally Invasive Migration to Software Product Lines
Authors: Hans Peter Jepsen, Jan Gaardsted Dall, Danilo Beuche
Venue: Proceedings of the 11th International Software Product Line Conference (2007)

Danfoss Drives - one of the largest producers of frequency converters in the world - is in a situation like many others: it has to produce a number of product series with an increasing number of variants, while at the same time decreasing time-to-market and keeping development costs low. As part of the strategy to master this challenge, Danfoss Drives decided to reduce software development efforts by migrating to a product line approach. This paper describes the approach Danfoss Drives took to successfully introduce Software Product Line Principles into its organization.
A Proactive Secure Multisecret Sharing Threshold Scheme
Authors: Feng Li, Jianwei Shang, Daxing Li
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 01 (2007)

This paper presents a new proactive secure multisecret sharing threshold scheme. In the scheme, participants can share multiple secrets and compute sub-secret for rebuilding efficiently and securely, and sub-secret hold by participant is verifiable. The scheme uses verifiable secret sharing technique to against cheating by dealer and cheating by participants. Our scheme is proactive secure, participants will update the sub-secret periodically without dealer's intervention, old sub-secret will be obsolete and adversary can't get any useful information from these. At the end, it is demonstrated that the scheme is correct, secure and efficient.
Modeling Sub-90nm On-Chip Variation Using Monte Carlo Method for DFM
Authors: Jun-Fu Huang, Victor C. Y. Chang, Sally Liu, Kelvin Y. Y. Doong, Keh-Jeng Chang
Venue: Proceedings of the 2007 Asia and South Pacific Design Automation Conference (2007)

For sub-9Onm technology nodes and below, random fluctuations of within-die physical process properties are also known as random on-chip variation (OCV). It impacts on the VLSI/SoC design yields significantly. This paper presents a recent silicon test chip experiment result which uses a set of innovative nanometer test structures and Monte-Carlo-based three-dimensional electromagnetic RC simulations to achieve silicon-correlated corner modeling of OCV that can be applied to the upcoming statistics-based timing analysis (SSTA) for design for manufacturability (DFM). Modeling and correlating OCV based on the randomly varying physical process parameters is therefore achieved for the realistic corner modeling of advanced copper and low-K.
Tilings of nonorientable surfaces by Steiner triple systems
Authors: F. I. Solov'Eva
Venue: Problems of Information Transmission (2007)

A Steiner triple system of order n (for short, STS(n)) is a system of three-element blocks (triples) of elements of an n-set such that each unordered pair of elements occurs in precisely one triple. Assign to each triple (i,j,k) ¿ STS(n) a topological triangle with vertices i, j, and k. Gluing together like sides of the triangles that correspond to a pair of disjoint STS(n) of a special form yields a black-and-white tiling of some closed surface. For each n ¿ 3 (mod 6) we prove that there exist nonisomorphic tilings of nonorientable surfaces by pairs of Steiner triple systems of order n. We also show that for half of the values n ¿ 1 (mod 6) there are nonisomorphic tilings of nonorientable closed surfaces.
A Two-Space Solution to the Hidden Line Problem for Plotting Functions of Two Variables
Authors: T. J. Wright
Venue: IEEE Transactions on Computers (1973)

A fast algorithm for eliminating hidden linies from perspective representations of single-valued functions of two variables is presented. Compared with the most widely used algorithm for this problem, the algorithm presented here is as versatile, but much faster. Compared with a recently published algorithm for this problem, the algorithm presented here is more powerful and as fast. Compared with more general algorithms, the one presented here is much less complicated, since this algorithm is tailored to this problem.
Capital-Intensive Software Technology
Authors: P. Wegner
Venue: IEEE Software (1984)

Each section of this four-part article deals with a different aspect of capital-intensive software technology. Together, they present an integrated view of the subject.
Computer-Aided-Design Research at the Ge Microelectronics Center
Authors: David Hightower, Aart Geus, Patrick Fasang, Robert Griffin, Gary Leive
Venue: IEEE Design Test (1986)

In late 1980, the GE Microelectronics Center (MEC) was established to develop a proprietary gate array program for infusingJC technology into GE products. One team developed a CAD system helping engineers through the complete design cycle from circuitdescription capture and simulation to layout, post-layout simulation, processing, and test. Another team developed a gatearray CMOS process at the 1 ? fabrication facility in North Carolina's Research Triangle Park opened in June 1982.
Applications of Digital Computers to Air Traffic Control in the United States
Authors: H. J. Kirshner
Venue: Computer (1972)

Digital computers are being applied in large numbers to air traffic control operations in the United States. By the mid-1970's, all U.S. en route traffic control centers and all busy terminals will be equipped with systems featuring digital computers which process flight plans and radar and beacon data into displays for air traffic controllers. Work is underway to further apply computers to such control functions as ground-based conflict prediction, sequencing and spacing, and flow control. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Relational Data Base Machines
Authors: D. C. P. Smith
Venue: Computer (1979)

Relational data base machines using head-per-track disk technology or its electronic equivalent can move processing logic closer to the data, providing simplified storage organizations for large-scale applications.
Anisotropic finite element modeling for patient-specific mandible
Authors: Sheng-Hui Liao, Ruo-Feng Tong, Jin-Xiang Dong
Venue: Computer Methods and Programs in Biomedicine (2007)

This paper presents an ad hoc modular software tool to quasi-automatically generate patient-specific three-dimensional (3D) finite element (FE) model of the human mandible. The main task is taking into account the complex geometry of the individual mandible, as well as the inherent highly anisotropic material law. At first, by computed tomography data (CT), the individual geometry of the complete range of mandible was well reproduced, also the separation between cortical and cancellous bone. Then, taking advantage of the inherent shape nature as 'curve' long bone, the algorithm employed a pair of B-spline curves running along the entire upper and lower mandible borders as auxiliary baselines, whose directions are also compatible with that of the trajectory of maximum material stiffness throughout the cortical bone of the mandible. And under the guidance of this pair of auxiliary baselines, a sequence of B-spline surfaces were interpolated adaptively as curve cross-sections to cut the original geometry. Following, based on the produced curve contours and the corresponding curve cross-section surfaces, quite well structured FE volume meshes were constructed, as well as the inherent trajectory vector fields of the anisotropic material (orthotropic for cortical bone and transversely isotropic for cancellous bone). Finally, a sensitivity analysis comprising various 3D FE simulations was carried out to reveal the relevance of elastic anisotropy for the load carrying behavior of the mandible.
A Stochastic Model for Closed-Loop Preemptive Microprocessor I/O Organizations
Authors: J. M. Van Campenhout
Venue: IEEE Transactions on Computers (1978)

A stochastic model of closed-loop priority I/O systems is developed in which request generation is assumed to be exponential but service time distributions are arbitrary. This model reflects the code granularity caused by the implementation. Using this model, an interrupt-driven system is compared to a similar system with polled I/O on the basis of latency times and CPU utilization.
Semantic Web Service provision
Authors: Paul M.K. Gordon, Quang Trinh, Christoph W. Sensen
Venue: Bioinformatics (2007)

Summary: Several semantic Web Services clients for Bioinformatics have been released, but to date no support systems for service providers have been described. We have created a framework (‘MobyServlet’) that very simply allows an existing Java application to conform to the MOBY-S semantic Web Services protocol. Using an existing Java program for codon-pair bias determination as an example, we enumerate the steps required for MOBY-S compliance. With minimal programming effort, such a deployment has the advantages of: (1) wider exposure to the user community by automatic inclusion in all MOBY-S client programs and (2) automatic interoperability with other MOBY-S services for input and output. Complex on-line analysis will become easier for biologists as more developers adopt MOBY-S. Availability: The framework and documentation are freely available from the Java developer's section of http://www.biomoby.org/. Contact: gordonp@ucalgary.ca