ppxscal/embedding_network huggingface dataset:
Recommendations for a multi-service access architecture from the European MUSE project
Authors: Peter Vetter, François Fredricx, Govinda Rajan, Karsten Oberle
Venue: Bell Labs Technical Journal (2008)

Multi-Service Access Everywhere (MUSE) is a large European research project that addresses multi-service access networks. The consortium is led by Alcatel-Lucent and consists of major operators, vendors, and research institutes in Europe. A general network architecture and an open business model were defined. Requirements and methods for the authentication of users or devices to such multi-service access networks were elaborated. The concept of Internet Protocol (IP) sessions was reviewed and options for monitoring IP sessions were compared. Pragmatic recommendations for the implementation of resource admission control and policy decisions were formulated. The paper also describes how the requirement to support nomadic services influenced some of the architectural choices for the authentication and policy framework. A dedicated section addresses solutions at the application layer for session continuity. &copy; 2008 Alcatel-Lucent.
Verification of IP-Core Based SoC's
Authors: Anil Deshpande
Venue: Proceedings of the 9th international symposium on Quality Electronic Design (2008)

With rapid strides in Semiconductor processing technologies, the density of transistors on the die is increasing in line with Moore’s law which in turn is increasing the complexity of the whole SoC design. With manufacturing yield and time-to-market schedules crucial for a SoC, it is important to select verification and analysis solutions that offer best possible performance, while minimizing iteration time and data volume. With the advent of cutting edge technology applications like set top boxes, HDTV, an increasingly evident need has been that of incorporating the SoC the whole system - on a single silicon i.e., Silicon On Chip (SoC) using standard IP-Cores. In an IP-Core based SoC design, a streamlined verification and analysis flow can contribute significantly to the success of a product. A strategy is devised for a more streamlined approach in IP-core based SoC verification which helps in smooth transition from design to chip tape-out stage.
k-Version of finite element method in 2D-polymer flows: Upper convected Maxwell model
Authors: K. S. Surana, S. Bhola, J. N. Reddy, P. W. TenPas
Venue: Computers and Structures (2008)

In this paper, a new mathematical framework based on h, p, k and variational consistency (VC) of the integral forms is utilized to develop a finite element computational process for steady two dimensional polymer flows with upper convected Maxwell constitutive model (UCMM). Alternate forms of choices of dependent variables in the governing differential equations (GDEs) are considered and it is concluded that u, v, p, @t choice yielding strong form of the GDEs is meritorious. Since, the differential operators for all possible choices of dependent variables are non-linear, Galerkin method and Galerkin method with weak form are variationally inconsistent (VIC). The coefficient matrices in these processes are non-symmetric and hence may have partial or completely complex basis and the resulting computational processes may yield spurious solutions. Furthermore, since the VC of VIC integral forms cannot be restored through any mathematically justifiable means, the computational processes in these approaches may remain spurious. Least squares processes utilizing GDEs in u, v, p, @t or any other variables are always variationally consistent. The coefficient matrices are symmetric, positive definite and hence always have real basis and thus naturally yield computational processes that are free of spurious solutions. The theoretical solution of GDEs are generally of higher order global differentiability. Numerical simulations of such solutions in which higher order global differentiability characteristics of the theoretical solutions are preserved, undoubtedly require local approximations in scalar product spaces H^k^,^p(@W@?"x"y^e) containing higher order global differentiability local approximations. LSP with local approximation in H^k^,^p(@W@?"x"y^e) spaces provides an excellent mathematical and computational framework in which it is possible to incorporate desired characteristics of the theoretical solution in the computational process. Numerical studies are presented for fully developed flow between parallel plates and a lid driven square cavity. M1 fluid is used in all numerical studies. The range of applicability of UCMM or lack of it is examined for both model problems for increasing De. A regularization of the velocity of the lid at the corners where stationary wall meets the lid is presented and is shown to simulate the real physics when the local approximations are in higher order spaces and when h"d->0. For both model problems shear rate @c@?@? is examined in the flow domain to establish validity of the UCMM constitutive model.
A FPGA Optimization Tool Based on a Multi-island Genetic Algorithm Distributed over Grid Environments
Authors: Manuel Rubio-Solar, Miguel A. Vega-Rodríguez, Juan Manuel Sánchez Pérez, Antonio Gómez-Iglesias, Miguel Cárdenas-Montes
Venue: Proceedings of the 2008 Eighth IEEE International Symposium on Cluster Computing and the Grid (2008)

In this work we present a Grid implementation of a FPGA optimization tool. The application is based on a Distributed Genetic Algorithm (DGA). It solves the placement and routing problem into the FPGA design cycle. The Grid infrastructure is based both on gLite middleware and GridWay metascheduler. The DGA’s different islands are sent to the Working Nodes (WN), where they evolve as remote jobs. We implemented a migration system between islands based on centralizing the exchanging data on a local node. Parting from this data, the local node builds new islands and the evolution continues until the stop criterion is reached. Obtained results show us that the main benefit of the distributed model is a large reduction of the execution time. By using the distributed platform users can launch more complex tasks and increase the number of experiments comparing with sequential execution, expending less amounts of time and effort.
Connectivity keeping edges in graphs with large minimum degree
Authors: Shinya Fujita, Ken-ichi Kawarabayashi
Venue: Journal of Combinatorial Theory Series B (2008)

The old well-known result of Chartrand, Kaugars and Lick says that every k-connected graph G with minimum degree at least 3k/2 has a vertex v such that G-v is still k-connected. In this paper, we consider a generalization of the above result [G. Chartrand, A. Kaigars, D.R. Lick, Critically n-connected graphs, Proc. Amer. Math. Soc. 32 (1972) 63-68]. We prove the following result: Suppose G is a k-connected graph with minimum degree at least @?3k/2@?+2. Then G has an edge e such that G-V(e) is still k-connected. The bound on the minimum degree is essentially best possible.
Workflow-based dynamic scheduling of job shop operations
Authors: H. C. Hwang, B. K. Choi
Venue: International Journal of Computer Integrated Manufacturing (2007)

In a job shop such as a mould-making shop, dispatching decisions as to which job should be loaded on a machine when it becomes free are termed dynamic scheduling. A practical approach to dynamic job-shop scheduling is the use of discrete event simulation, and their dedicated simulation-based dynamic scheduling systems, often known as manufacturing execution systems or advanced planning systems, are available. In the present paper, we propose a workflow-based dynamic scheduling framework, in which a workflow management system (WfMS) serves as a dynamic job-shop scheduler. For this purpose, we have developed an algorithm for embedding a discrete-event simulation mechanism into a WfMS, and have implemented a prototype job-shop scheduler. Illustrative performance evaluation shows that the proposed framework is logically valid and computationally efficient.
Catalan and Motzkin numbers modulo 4 and 8
Authors: Sen-Peng Eu, Shu-Chung Liu, Yeong-Nan Yeh
Venue: European Journal of Combinatorics (2008)

In this paper, we compute the congruences of Catalan and Motzkin numbers modulo 4 and 8. In particular, we prove the conjecture proposed by Deutsch and Sagan that no Motzkin number is a multiple of 8.
Implementation of Reinforcement and Reduction of Traditional Acupuncture and Moxibustion
Authors: Huang Zhen, Li Dongyu, Li Chengwei
Venue: Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics - Volume 01 (2008)

In traditional acupuncture, reinforcement and reduction are conducted to stimulate the channel Qi by puncturing or heating the points with specific manners so as to regulate the functional activities of the internal organs. Reinforcement and reduction manners played an important role in clinical practice of traditional Chinese medicine, especially in disease curing. And the non-invasive nature of laser acupuncture has made lasers an attractive alternative in Medical Acupuncture at the last 25 years. The objective of this paper was to introduce the methods to implement reinforcement and reduction in laser acupuncture. According to reinforcement and reduction of traditional acupuncture and the theory of laser optics, lifting and thrusting of acupuncture, twisting and twirling of acupuncture and sparrow-pecking moxibustion are implemented.
Utilization of intelligent agents for supporting citizens in their access to e-government services
Authors: Pasquale De Meo, Giovanni Quattrone, Giorgio Terracina, Domenico Ursino
Venue: Web Intelligence and Agent Systems (2007)

This paper aims at studying the utilization of Intelligent Agents for supporting citizens to access e-government services. For this purpose, it proposes a multi-agent system capable of suggesting to the citizens the most interesting services for them; these suggestions are determined by considering both their needs/preferences and the capabilities of the devices used by them. The paper first describes the proposed system and, then, reports various experimental results. Finally, it presents a comparison between the proposed system and other related ones already presented in the literature.
An efficient hierarchical multicasting scheme for virtual structures in ad hoc networks
Authors: Shih-hao Shen, Yueh-min Huang, Jim-Min Lin
Venue: Proceedings of the 2nd international conference on Ubiquitous information management and communication (2008)

Large scale ad hoc networks always have a dilemma that is difficult to reduce controlling messages. However, multicasting protocols often try to control their routes to reduce traffics. This study is based on an eclectic approach that uses clustering as well as multicasting to keep flexibility while concerning the efficiency. To be complete in both respects, the scheme achieves the goal of lightweight controlling overhead. Besides, this paper contains a major contribution that exploits the multicast scheme to construct virtual structures in a large scale ad hoc network. The simulation provides agreeable results to show the advantage of this scheme.
A Novel Hybrid Model for Information Processing Basing on Rough Sets and Fuzzy SVM
Authors: Guang-ming Xian, Bi-qing Zeng
Venue: Proceedings of the 2008 International Conference on Multimedia and Ubiquitous Engineering (2008)

Rough set theory (RST) is a new effective tool in dealing with vagueness and uncertainty information from a large number of data. Fuzzy support vector machine (FSVM) has become the focus of research in machine learning. And it greatly improves the capabilities of fault-tolerance and generalization of standard support vector machine. The hybrid model of RS-FSVM inherits the merits of RS and FSVM, and is applied into fused image quality evaluation in this paper. RST is used as preprocessing step to improve the performances of FSVM. A large number of experimental results show that when the number training samples are enough RS-SVM can achieve higher precision of classification than methods of FSVM and SVM.
Man-made object detection in aerial images using multi-stage level set evolution
Authors: G. Cao, X. Yang
Venue: International Journal of Remote Sensing (2007)

The detection of man-made objects is important for scene understanding, image retrieval and surveillance. A modified Chan-Vese model based level set method for detecting man-made objects in aerial images is presented. The method applies a fractal error metric with an additional constraint-texture edge descriptor to realize a more accurate segmentation. Man-made objects are extracted from the natural areas by changing the geometric active contours, which are governed by a partial differential equation based on the modified Chan-Vese model. Benefiting from the level set method, the extracted man-made object contours may change topology easily during the evolution. Our method does not need to select a threshold to separate the fractal error image in cases where segmentation errors may result from using an unsuitable threshold. We validate the proposed algorithm by numerical results of real aerial images.
System Content and Packet Delay in Discrete-Time Queues with Session-Based Arrivals
Authors: Laurence Hoflack, Stijn De Vuyst, Sabine Wittevrongel, Herwig Bruneel
Venue: Proceedings of the Fifth International Conference on Information Technology: New Generations (2008)

This paper considers a discrete-time queueing model with infinite storage capacity and one single output line. Users can start and end sessions during which they are active and send packets to the queueing system. Each active user generates a random but strictly positive number of packets per time slot: this results in a session-based arrival process of packets. This model can for instance be applied to study the traffic of a file server, where one file download by a user corresponds to one session. The steady-state probability generating functions of the number of active sessions, buffer occupancy (number of packets stored in the buffer) and packet delay are derived. We also derive an approximation for the tail probabilities of the buffer occupancy. This allows us to study the influence of the different system parameters: some examples are presented.
Analysis and Design of Warning Delivery Service in Intervehicular Networks
Authors: Roberta Fracchia, Michela Meo
Venue: IEEE Transactions on Mobile Computing (2008)

This paper focuses on inter-vehicular networks providing warning delivery service. As soon as a danger is detected, the propagation of a warning message is triggered, with the aim of guaranteeing a safety area around the point in which the danger is located. Multiple broadcast cycles can be generated so that a given lifetime of the safety area is guaranteed. The service is based on multi-hop ad hoc inter-vehicular communications with a probabilistic choice of the relay nodes. The scenario we consider consists of high speed streets, such as highways, in which vehicles exhibit one-dimensional movements along the direction of the road. We propose an analytical model for the study of this service and derive performance indices such as the probability that a vehicle is informed, the average number of duplicate messages received by a vehicle and the average delay. Moreover, we use the model to discuss system design issues, which include the proper setting of the forwarding probability at each vehicle, so that a given probability to receive the warning can be guaranteed to all vehicles in the safety area. The model is validated against simulation results. Since it is very accurate, the model can be instrumental to the performance evaluation and design of broadcasting techniques in inter-vehicular networks.
Using Automated Event Handling for a Simulation-Based Process Coverage in Supply Networks
Authors: W. Dangelmaier, Andre Döring, Christoph Laroque, Thorsten Timm
Venue: Proceedings of the Tenth International Conference on Computer Modeling and Simulation (2008)

The project AC/DC, funded by the European Commission (contract number FP6-SST-031520), deals with new logistical concepts for planning and control of supply networks that enhance automotive manufacturing radically. To handle upcoming disturbances within the regarded supply network structure, a real-time event management system is developed in order to automatically handle occurring events in a highly reactive way based on reliable processes. The simulation-based approach of identification, classification and especially the automated evaluation of handling actions are introduced in this paper.
Are wait-free algorithms fast?
Authors: H. Attiya, N. Lynch, N. Shavit
Venue: Proceedings of the 31st Annual Symposium on Foundations of Computer Science (1990)

The time complexity of wait-free algorithms in so-called normal executions, where no failures occur and processes operate at approximately the same speed, is considered. A lower bound of log n on the time complexity of any wait-free algorithm that achieves approximate agreement among n processes is proved. In contrast, there exists a non-wait-free algorithm that solves this problem in constant time. This implies an Omega (log n)-time separation between the wait-free and non-wait-free computation models. An O(log n)-time wait-free approximate agreement algorithm is presented. Its complexity is within a small constant of the lower bound.
CO-irredundant Ramsey numbers for graphs
Authors: E. J. Cockayne, G. MacGillivray, J. Simmons
Venue: Journal of Graph Theory (2000)

The study of the CO-irredundant Ramsey numbers t(n1, &middot;&middot;&middot;, nk) is initiated. It is shown that several values and bounds for these numbers may be obtained from the well-studied generalized graph Ramsey numbers and the values of t(4, 5), t(4, 6) and t(3, 3, m) are calculated. &copy; 2000 John Wiley & Sons, Inc. J Graph Theory 34: 258&ndash;268, 2000
Low complexity bit parallel multiplier for GF (2m) generated by equally-spaced trinomials
Authors: Haibin Shen, Yier Jin
Venue: Information Processing Letters (2008)

Based on the shifted polynomial basis (SPB), a high efficient bit-parallel multiplier for the field GF(2^m) defined by an equally-spaced trinomial (EST) is proposed. The use of SPB significantly reduces time delay of the proposed multiplier and at the same time Karatsuba method is combined with SPB to decrease space complexity. As a result, with the same time complexity, approximately 3/4 gates of previous multipliers are used in the proposed multiplier.
Gene ontology annotation as text categorization: An empirical study
Authors: Kazuhiro Seki, Javed Mostafa
Venue: Information Processing and Management: an International Journal (2008)

Gene ontology (GO) consists of three structured controlled vocabularies, i.e., GO domains, developed for describing attributes of gene products, and its annotation is crucial to provide a common gateway to access different model organism databases. This paper explores an effective application of text categorization methods to this highly practical problem in biology. As a first step, we attempt to tackle the automatic GO annotation task posed in the Text Retrieval Conference (TREC) 2004 Genomics Track. Given a pair of genes and an article reference where the genes appear, the task simulates assigning GO domain codes. We approach the problem with careful consideration of the specialized terminology and pay special attention to various forms of gene synonyms, so as to exhaustively locate the occurrences of the target gene. We extract the words around the spotted gene occurrences and used them to represent the gene for GO domain code annotation. We regard the task as a text categorization problem and adopt a variant of kNN with supervised term weighting schemes, making our method among the top-performing systems in the TREC official evaluation. Furthermore, we investigate different feature selection policies in conjunction with the treatment of terms associated with negative instances. Our experiments reveal that round-robin feature space allocation with eliminating negative terms substantially improves performance as GO terms become specific.
Communication performance of 802.11 WLANs
Authors: Shakil Akhtar
Venue: Proceedings of the 10th WSEAS International Conference on APPLIED MATHEMATICS (2006)

Results from simulation model of an 802.11 WLAN system that suffers in performance due to multiple stations interference are presented. The system communication performance is studied by changing the data packet fragmentation thresholds and the amount of traffic sent, received, and retransmission attempts with and without RTS/CTS mechanism. Two scenarios, with three and five interfering stations have been analyzed and steps to minimize the interference suggested. Specifically, the uses of fragmentation thresholds and RTS/CTS mechanism to control the interference are illustrated via the simulation. It is shown that for the modeled WLAN communications systems, the threshold value should not exceed 1024 bytes causing minimal interference with least number of retransmissions and a higher throughput.
Secure Web Browsing with the OP Web Browser
Authors: Chris Grier, Shuo Tang, Samuel T. King
Venue: Proceedings of the 2008 IEEE Symposium on Security and Privacy (2008)

Current web browsers are plagued with vulnerabilities, providing hackers with easy access to computer systems via browser-based attacks. Browser security efforts that retrofit existing browsers have had limited success because the design of modern browsers is fundamentally flawed. To enable more secure web browsing, we design and implement a new browser, called the OP web browser, that attempts to improve the state-of-the-art in browser security. Our overall design approach is to combine operating system design principles with formal methods to design a more secure web browser by drawing on the expertise of both communities. Our overall design philosophy is to partition the browser into smaller subsystems and make all communication between subsystems simple and explicit. At the core of our design is a small browser kernel that manages the browser subsystems and interposes on all communications between them to enforce our new browser security features. To show the utility of our browser architecture, we design and implement three novel security features. First, we develop novel and flexible security policies that allows us to include plugins within our security framework. Our policy removes the burden of security from plugin writers, and gives plugins the flexibility to use innovative network architectures to deliver content while still maintaining the confidentiality and integrity of our browser, even if attackers compromise the plugin. Second, we use formal methods to prove that the address bar displayed within our browser user interface always shows the correct address for the current web page. Third, we design and implement a browser-level information-flow tracking system to enable post-mortem analysis of browser-based attacks. If an attacker is able to compromise our browser, we highlight the subset of total activity that is causally related to the attack, thus allowing users and system administrator to determine easily which web site lead to the compromise and to assess the damage of a successful attack. To evaluate our design, we implemented OP and tested both performance and file system impact. To test performance, we measure latency to verify OP's performance penalty from security features will be minimal from a users perspective. Our experiments show that on average the speed of the OP browser is comparable to Firefox and the audit log footprint for the same pages average around 80KB.