ppxscal/embedding_network huggingface dataset:
Hierarchical Trust Architecture in a Mobile Ad-Hoc Network Using Ant Algorithms
Authors: Cristina Satizábal, Jordi Forné, Rafael Martínez-Peláez, Franciso Rico-Novella
Venue: Proceedings of the 2008 Third International Conference on Availability, Reliability and Security (2008)

Trust relationships change frequently in ad-hoc networks, so it is difficult to build certification paths among their nodes. When trust relationships are bidirectional, certification path discovery becomes more difficult because multiple paths can exist between two entities and all the options do not lead to the target entity. On the other hand, certificates can establish relationships of different trust level. In this paper, we propose a protocol that establishes a virtual hierarchy from a peer-to-peer web of trust. This protocol uses swarm intelligence to obtain information about the certification paths and to establish the trustworthiness of each node. Our protocol does not require to issue new certificates among network entities, facilitates the certification path discovery process and the maximum path length can be adapted to the characteristics of users with limited processing and storage capacity.
Program Safety via Programmer Safety
Authors: Joseph Kiniry
Venue: Proceedings of the Second International Symposium on Leveraging Applications of Formal Methods, Verification and Validation (2006)

Static program checkers rely upon push-button automation to provide quality feedback to programmers . . .programmers who are not typically well-versed in a tool's foundations. Thus, ensuring program correctness is as much about program safety as it is about programmer safety.Our tool, ESC/Java, has recently incorporated a number of new programmer-centric features whose focus is on increasing programmer safety. We will discuss these features in detail as well as give some perspective on our continued work on proving program safety properties and evidencing programmer safety properties.
NFP Ontology for Discovery and Sharing Web Services in Distributed Registries
Authors: Abramowicz Witold, Haniewicz Konstanty, Kaczmarek Monika, Palma Raul, Zyskowski Dominik
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications - Workshops (2008)

The success of Web services technology depends heavily on the effective discovery and sharing of services in distributed environments using various registries. These tasks should take into account both functional and non-functional properties (NFP) of a service. Such properties may be for example: execution time, reliability, security, cost or provider’s reputation. However, currently known approaches focus mainly on the functional attributes of Web services and there is an ongoing discussion on the scope and methods that should be used to express the non-functional side of WS. This article presents an ontology of non-functional properties and shows, on the example of the WebSter registry, how it may be used within the WS discovery process in distributed environments.
Graph labeling and radio channel assignment
Authors: J. van den Heuvel, R. A. Leese, M. A. Shepherd
Venue: Journal of Graph Theory (1998)

The vertex-labeling of graphs with nonnegative integers provides a natural setting in which to study problems of radio channel assignment. Vertices correspond to transmitter locations and their labels to radio channels. As a model for the way in which interference is avoided in real radio systems, each pair of vertices has, depending on their separation, a constraint on the difference between the labels that can be assigned. We consider the question of finding labelings of minimum span, given a graph and a set of constraints. The focus is on the infinite triangular lattice, infinite square lattice, and infinite line lattice, and optimal labelings for up to three levels of constraint are obtained. We highlight how accepted practice can lead to suboptimal channel assignments. &copy; 1998 John Wiley & Sons, Inc. J Graph Theory 29: 263&ndash;283, 1998
Electronic institutions for B2B: dynamic normative environments
Authors: Henrique Lopes Cardoso, Eugénio Oliveira
Venue: Artificial Intelligence and Law (2008)

The regulation of the activity of multiple autonomous entities represented in a multi-agent system, in environments with no central design (and thus with no cooperative assumption), is gaining much attention in the research community. Approaches to this concern include the use of norms in so-called normative multi-agent systems and the development of electronic institution frameworks. In this paper we describe our approach towards the development of an electronic institution providing an enforceable normative environment. Within this environment, institutional services are provided that assist agents in forming cooperative structures whose commitments are made explicit through contracts. Our normative framework borrows some concepts from contract law theory. Contracts are formalized using norms which are used by the institution while monitoring agents' activities, thus making our normative environment dynamic. We regard the electronic institution as a means to facilitate both the creation and the enforcement of contracts between agents. A model of "institutional reality" is presented that allows for monitoring the fulfillment of norms. The paper also distinguishes our approach from other developments of the electronic institution concept. We address the application of our proposal in the B2B field, namely regarding the formation of Virtual Organizations.
Active Learning by Spherical Subdivision
Authors: Falk-Florian Henrich, Klaus Obermayer
Venue: The Journal of Machine Learning Research (2008)

We introduce a computationally feasible, "constructive" active learning method for binary classification. The learning algorithm is initially formulated for separable classification problems, for a hyperspherical data space with constant data density, and for great spheres as classifiers. In order to reduce computational complexity the version space is restricted to spherical simplices and learning procedes by subdividing the edges of maximal length. We show that this procedure optimally reduces a tight upper bound on the generalization error. The method is then extended to other separable classification problems using products of spheres as data spaces and isometries induced by charts of the sphere. An upper bound is provided for the probability of disagreement between classifiers (hence the generalization error) for non-constant data densities on the sphere. The emphasis of this work lies on providing mathematically exact performance estimates for active learning strategies.
High aspect ratio GaAs nanowires made by ICP-RIE etching using Cl2/N2 chemistry
Authors: Laurent Jalabert, Pascal Dubreuil, Franck Carcenac, Sébastien Pinaud, Ludovic Salvagnac, Hugues Granier, Chantal Fontaine
Venue: Microelectronic Engineering (2008)

We report an experimental study of GaAs etching by ICP-RIE based on Cl"2:N"2 chemistry. The influence of the RF source power, the chlorine dilution, the RF platen power, and the process pressure at several substrate temperatures are investigated. An optimized process is proposed to get routinely GaAs nanowires of 1@mm high and about 30nm in diameter with a full top-down approach combining electron beam lithography and Ni lift-off steps.
Some decision and counting problems of the Duquenne-Guigues basis of implications
Authors: Sergei O. Kuznetsov, Sergei Obiedkov
Venue: Discrete Applied Mathematics (2008)

Implications of a formal context obey Armstrong rules, which allows one to define a minimal (in the number of implications) implication basis, called Duquenne-Guigues basis or stem base in the literature. In this paper we show how implications are reduced to functional dependencies and prove that the problem of determining the size of the stem base is a #P-complete problem.
Application and numerical investigation of wavelet transform for traffic data denoising
Authors: Shih-Ching Lo, Chih-Ku Fan
Venue: Proceedings of the 5th WSEAS International Conference on Applied Mathematics (2004)

Good fitting of traffic data is important to traffic study because initial and boundary conditions of dynamic traffic models and relationships among traffic variables are dependent on the calibration of data. In this paper, a denoising method of traffic data, such as speed, density and flow, is proposed and discussed numerically. The denoising procedure is based on Daubechies wavelet transform and soft thresholding method. An empirical study with eight Daubechies wavelet transforms and five degree of smoothing are discussed and compared. We find db8 with 80% degree of smoothing presents the best denoising result. After denoising, r-square value of speed-density fitting is improved from 0.863 to 0.956.
The equivalence and learning of probabilistic automata
Authors: W.-G. Tseng
Venue: Proceedings of the 30th Annual Symposium on Foundations of Computer Science (1989)

It is proved that the equivalence problem for probabilistic automata is solvable in time O((n/sub 1/+n/sub 2/)/sup 4/), where n/sub 1/ and n/sub 2/ are numbers of states of two given probabilistic automata. This result improves the best previous upper bound of coNP. The algorithm has some interesting applications, for example, to the covering and equivalence problems for uninitiated probabilistic automata, the equivalence and containment problems for unambiguous nondeterministic finite automata, and the path-equivalence problem for nondeterministic finite automata. Using the same technique, a polynomial-time algorithm for learning probabilistic automata is developed. The learning protocol is learning by means of queries.
An algorithmic approach to geographic routing in ad hoc and sensor networks
Authors: Fabian Kuhn, Roger Wattenhofer, Aaron Zollinger
Venue: IEEE/ACM Transactions on Networking (TON) (2008)

The one type of routing in ad hoc and sensor networks that currently appears to be most amenable to algorithmic analysis is geographic routing. This paper contains an introduction to the problem field of geographic routing, presents a specific routing algorithm based on a synthesis of the greedy forwarding and face routing approaches, and provides an algorithmic analysis of the presented algorithm from both a worst-case and an average-case perspective.
Automating the DNA computer: solving n-Variable 3-SAT problems
Authors: Clifford R. Johnson
Venue: Natural Computing: an international journal (2008)

In the decade since the first molecular computation was performed, it has been shown that DNA molecules can perform sophisticated, massively parallel computations avoiding the Von Neumann bottleneck. However, progress in the field has been slow. The largest problem solved to date is an instance of the 20-variable 3-CNF SAT problem. Performing the computation took more than two man-weeks to complete because every aspect of the computation was performed by hand. Molecular computations are extremely labor intensive and error prone---automation is necessary for further progress.The next step, (the second generation DNA computer--that of taking the laborious, laboratory bench protocols performed by hand, and automating them), has been achieved with the construction of an automated DNA computer dubbed EDNAC. It employs the same paradigm that was used to solve the labor-intensive instance of the 20-variable 3-CNF SAT problem. Using a combinatorial DNA library and complementary probes, EDNAC solves instances of the n-variable 3-CNF SAT problem. A 10 variable instance of the 3-CNF SAT problem was essayed. The computation took 28 h to perform. EDNAC correctly computed nine of the 10 variables, with a tenth variable remaining ambiguous. This result is comparable to current results in the molecular computation community. This research tested the critical properties, such as complexity, robustness, reliability, and repeatability necessary for the successful automation of a molecular computer.
Dependence of Minimum Operating Voltage (VDDmin) on Block Size of 90-nm CMOS Ring Oscillators and its Implications in Low Power DFM
Authors: Taro Niiyama, Piao Zhe, Koichi Ishida, Masami Murakata, Makoto Takamiya, Takayasu Sakurai
Venue: Proceedings of the 9th international symposium on Quality Electronic Design (2008)

The minimum operating voltage (VDDmin) of 90-nm CMOS ring oscillators (RO’s) is investigated in order to clarify the lower limit of supply voltage (VDD) for logic circuits. The measured VDDmin is determined by the intra-die threshold voltage random variations and increased from 91 mV to 224 mV when the number of RO stages increased from 11 to 1001, which hinders the VDD scaling. Lowering VDDmin is difficult, since it would require an impractical inverter-by-inverter adaptive body bias control. Therefore, the fine-grain adaptive VDD control will be more effective for the ultra low voltage logic circuits to reduce the power consumption.
Distributed power allocation and scheduling for parallel channel wireless networks
Authors: Xiangping Qin, Randall A. Berry
Venue: Wireless Networks (2008)

In this paper we develop distributed approaches for power allocation and scheduling in wireless access networks. We consider a model where users communicate over a set of parallel multi-access fading channels, as in an orthogonal frequency division multiple access (OFDMA) system. At each time, each user must decide which channels to transmit on and howto allocate its power over these channels. We give distributed power allocation and scheduling policies, where each user's actions depend only on knowledge of their own channel gains. Assuming a collision model for each channel, we characterize an optimal policy which maximizes the system throughput and also give a simpler sub-optimal policy. Both policies are shown to have the optimal scaling behavior in several asymptotic regimes.
On the Relationships Among Various Diversity Measures in Multiple Classifier Systems
Authors: Yun-Sheng Chung, D. Frank Hsu, Chuan Yi Tang
Venue: Proceedings of the The International Symposium on Parallel Architectures, Algorithms, and Networks (2008)

Classifier ensembles have been shown to outperform single classifier systems. An apparent necessary condition for ensembles to out¬perform single systems is that the classifier systems exhibit a reasonable degree of "diversity". It has also been demonstrated that diversity is an important predictive factor for the improvement. However, in lack of a universally accepted definition, various diversity measures have been proposed and applied in the literature. A natural question then follows: How can we compare, and hence choose among, various diversity mea¬sures? This work exploits analytically the relationships among several well-accepted diversity measures. These different diversity measures are proved to be closely related, which facilitates further research on classi¬fier ensembles since the effective number of diversity measures is reduced by such close relationships.
Rescue Knowledge M-Learning System by 3G Mobile Phones
Authors: Shu-Chen Cheng, Wei-Zhi Tsai, Yun-Zhong Chen
Venue: Proceedings of the Fifth IEEE International Conference on Wireless, Mobile, and Ubiquitous Technology in Education (2008)

Generally, people have insufficient knowledge with regard to first-aid. When people mention first-aid, they tend to focus on CPR instead of the introduction such as fracture or poisoning. Except for the medical personnel, people rarely have the opportunity to access to the rescue knowledge. Thus, this study aims to provide a rescue knowledge m-learning system by using the capabilities of wireless connection of mobile devices. Through simple operation, we can obtain the first-aid steps of certain diseases. With the rescue m-learning system, we can obtain the professional instructions. Users can connect to the knowledge server provided by this project via connection devices. The design of this project is relatively simple and allows learners to accomplish diseases or injuries searching by inputting the observed symptoms. Term frequency and inverse document frequency are applied for the information retrieval. After searching, we can learn and follow the first-aid instructions or ask for the experts’ opinions through the system.
Multicover inequalities on colored complexes
Authors: Shawn Austin Walker
Venue: Combinatorica (2007)

Suppose that C is a balanced simplicial complex. We show that its flag f-vector contains an interesting multiplicative structure. We define &#x03b7; s (C):= log2 f S (C), and characterize the convex cone in which this flag &#x03b7;-vector may lie. Additionally, we specialize our results to the case when C is a pure balanced simplicial complex, and when C is a graded poset.
Distribution of distinguishable objects to bins: generating all distributions
Authors: Muhammad Abdullah Adnan, Md. Saidur Rahman
Venue: International Journal of Computer Mathematics (2007)

In this paper we give an algorithm to generate all distributions of distinguishable objects to bins without repetition. Our algorithm generates each distribution in constant time. To the best of our knowledge, our algorithm is the first algorithm which generates each solution in O(1) time in the ordinary sense. As a byproduct of our algorithm, we obtain a new algorithm to enumerate all multiset partitions when the number of partitions is fixed and the partitions are numbered. In this case, the algorithm generates each multiset partitions in constant time (in the ordinary sense). Finally, we extend the algorithm to the case when the bins have priorities associated with them. Overall space complexity of the algorithm is O(mklgn), where there are m bins and the objects fall into k different classes. In a companion paper, the generation of all distributions of identical objects to bins is also considered.
Robust separations in inductive inference
Authors: M. A. Fulk
Venue: Proceedings of the 31st Annual Symposium on Foundations of Computer Science (1990)

Results in recursion-theoretic inductive inference have been criticized as depending on unrealistic self-referential examples. J.M. Barzdin (1974) proposed a way of ruling out such examples and conjectured that one of the earliest results of inductive inference theory would fall if his method were used. The author refutes Barzdin's conjecture and proposes a new line of research examining robust separations which are defined using a strengthening of Barzdin's original idea. Preliminary results are presented, and the most important open problem is stated as a conjecture. The extension of this work from function learning to formal language learning is discussed.
Effective decap insertion in area-array SoC floorplan design
Authors: Chao-Hung Lu, Hung-Ming Chen, Chien-Nan Jimmy Liu
Venue: ACM Transactions on Design Automation of Electronic Systems (TODAES) (2008)

As VLSI technology enters the nanometer era, supply voltages continue to drop due to the reduction of power dissipation, but it makes power integrity problems even worse. Employing decoupling capacitances (decaps) in floorplan stage is a common approach to alleviating supply noise problems. Previous researches overestimate the decap budget and do not fully utilize the empty space of the floorplan. A floorplan usually has a lot of available space that can be used to insert the decap without increasing the floorplan area. Therefore, the goal of this work is to develop a better model to calculate the required decap to solve the power supply noise problem in area-array based designs, and increase the usage of available space in the floorplan to reduce the area overhead caused by decap insertion. The experimental results of this work are encouraging. Compared with previous approaches, our methodology reduces 38&percnt; of the decap budget in average for MCNC benchmarks but can still meet the power supply noise requirements. The final floorplan areas with decap are also smaller than the numbers reported in previous works.
Theoretical analysis of binding specificity of influenza viral hemagglutinin to avian and human receptors based on the fragment molecular orbital method
Authors: Tatsunori Iwata, Kaori Fukuzawa, Katsuhisa Nakajima, Sachiko Aida-Hyugaji, Yuji Mochizuki, Hirofumi Watanabe, Shigenori Tanaka
Venue: Computational Biology and Chemistry (2008)

The hemagglutinin (HA) protein of the influenza virus binds to the host cell receptor in the early stage of viral infection. A change in binding specificity from avian @a2-3 to human @a2-6 receptor is essential for optimal human-to-human transmission and pandemics. Therefore, it is important to reveal the key factors governing the binding affinity of HA-receptor complex at the molecular level for the understanding and prediction of influenza pandemics. In this work, on the basis of ab initio fragment molecular orbital (FMO) method, we have carried out the interaction energy analysis of HA-receptor complexes to quantitatively elucidate the binding specificity of HAs to avian and human receptors. To discuss the binding property of influenza HA comprehensively, a number of HAs from human H1, swine H1, avian H3 and avian H5 viruses were analyzed. We performed detailed investigations about the interaction patterns of complexes of various HAs and receptor analogues, and revealed that intra-molecular interactions between conserved residues in HA play an important role for HA-receptor binding. These results may provide a hint to understand the role of conserved acidic residues at the receptor binding site which are destabilized by the electrostatic repulsion with sialic acid. The calculated binding energies and interaction patterns between receptor and HAs are consistent with the binding specificities of each HA and thus explain the receptor binding mechanism. The calculated results in the present analysis have provided a number of viewpoints regarding the models for the HA-receptor binding specificity associated with mutated residues. Examples include the role of Glu190 and Gln226 for the binding specificity of H5 HA. Since H5 HA has not yet been adapted to human receptor and the mechanism of the specificity change is unknown, this result is helpful for the prediction of the change in receptor specificity associated with forthcoming possible pandemics.
Sketching hairstyles
Authors: Hongbo Fu, Yichen Wei, Chiew-Lan Tai, Long Quan
Venue: Proceedings of the 4th Eurographics workshop on Sketch-based interfaces and modeling (2007)

This paper presents an intuitive sketching interface for interactive hairstyle design, made possible by an efficient numerical updating scheme. The user portrays the global shape of a desired hairstyle through a few 3D style curves which are manipulated by interactively sketching freeform strokes. Our approach is based on a vector field representation which is obtained by solving a sparse linear system with the style curves acting as boundary constraints. The key observation is that the specific sparseness pattern of the linear system enables an efficient incremental numerical updating scheme. This gives rise to a sketching interface that provides interactive visual feedback to the user. Interesting hairstyles can be easily created in minutes.