ppxscal/embedding_network huggingface dataset:
On the Practical and Security Issues of Batch Content Distribution Via Network Coding
Authors: Qiming Li, Dah-ming Chiu, John C. S. Lui
Venue: Proceedings of the Proceedings of the 2006 IEEE International Conference on Network Protocols (2006)

File distribution via network coding has received a lot of attention lately. However, direct application of network codingmay have security problems. In particular, attackers can inject "faked" packets into the file distribution process to slowdown the information dispersal or even deplete the network resource. Therefore, content verification is an important and practicalissue when network coding is employed. When network coding is used, it is infeasible for the source of the content to provideall the hash values or signatures required for verification, and hence the traditional "hash-and-sign" methods are no longerapplicable. Recently, a new on-the-fly verification technique is proposed by Krohn et al. for rateless erasure codes [1].However, their scheme requires a large number of hash values to be distributed in advance, and all of them are needed to verifyeven for a single packet. We propose a new batch delivery and verification scheme that is similar to the classical scenariowhere the authentication information of a message is embedded with the message and is sufficient for the verification purpose.We investigate how our technique can be applied when random linear network coding is employed, and show that both the computationaland the bandwidth overhead can be greatly reduced by using a variant of the random network coding. We further show by simulationthat this variant is sufficiently effective in practice.
Synchronizing a multicellular system by external input
Authors: Ruiqi Wang, Luonan Chen, Kazuyuki Aihara
Venue: Bioinformatics (2006)

Motivation: Although there are significant advances on elucidating the collective behaviors on biological organisms in recent years, the essential mechanisms by which the collective rhythms arise remain to be fully understood, and further how to synchronize multicellular networks by artificial control strategy has not yet been well explored. Results: A control strategy is developed to synchronize gene regulatory networks in a multicellular system when spontaneous synchronization cannot be achieved. We first construct an impulsive control system to model the process of periodically injecting coupling substances with constant or random impulsive control amounts into the common extracellular medium, and further study its effects on the dynamics of individual cells. We derive the threshold of synchronization induced by the periodic substance input. Therefore, we can synchronize the multicellular network to a specific collective behavior by changing the frequency and amplitude of the periodic stimuli. Moreover, a two-stage scheme is proposed to facilitate the synchronization in this paper. We show that the presence of the external input may also initiate different dynamics. The multicellular network of coupled repressilators is used to show the effectiveness of the proposed method. The results not only provide a perspective to understand the interactions between external stimuli and intrinsic physiological rhythms, but also may lead to development of realistic artificial control strategy and medical therapy. Availability: Contact: aihara@sat.t.u-tokyo.ac.jp
From Scores to Face Templates: A Model-Based Approach
Authors: Pranab Mohanty, Sudeep Sarkar, Rangachar Kasturi
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2007)

Regeneration of templates from match scores has security and privacy implications related to any biometric authentication system. We propose a novel paradigm to reconstruct face templates from match scores using a linear approach. It proceeds by first modeling the behavior of the given face recognition algorithm by an affine transformation. The goal of the modeling is to approximate the distances computed by a face recognition algorithm between two faces by distances between points, representing these faces, in an affine space. Given this space, templates from an independent image set (break-in) are matched only once with the enrolled template of the targeted subject and match scores are recorded. These scores are then used to embed the targeted subject in the approximating affine (non-orthogonal) space. Given the coordinates of the targeted subject in the affine space, the original template of the targeted subject is reconstructed using the inverse of the affine transformation. We demonstrate our ideas using three, fundamentally different, face recognition algorithms: Principal Component Analysis (PCA) with Mahalanobis cosine distance measure, Bayesian intra-extrapersonal classifier (BIC), and a feature-based commercial algorithm. To demonstrate the independence of the break-in set with the gallery set, we select face templates from two different databases: Face Recognition Grand Challenge (FRGC) and Facial Recognition Technology (FERET) Database (FERET). With an operational point set at 1% False Acceptance Rate (FAR) and 99% True Acceptance Rate (TAR) for 1196 enrollments (FERET gallery), we show that at most 600 attempts (score computations) are required to achieve a 73% chance of breaking in as a randomly chosen target subject for the commercial face recognition system. With similar operational set up, we achieve a 72% and 100% chance of breaking in for the Bayesian and PCA based face recognition systems, respectively. With three different levels of score quantization, we achieve 69%, 68% and 49% probability of break-in, indicating the robustness of our proposed scheme to score quantization. We also show that the proposed reconstruction scheme has 47% more probability of breaking in as a randomly chosen target subject for the commercial system as compared to a hill climbing approach with the same number of attempts. Given that the proposed template reconstruction method uses distinct face templates to reconstruct faces, this work exposes a more severe form of vulnerability than a hill climbing kind of attack where incrementally different versions of the same face are used. Also, the ability of the proposed approach to reconstruct actual face templates of the users increases privacy concerns in biometric systems.
Corrections of costs to feasible solutions of economic lot scheduling problems
Authors: Kristina Nilsson, Anders Segerstedt
Venue: Computers and Industrial Engineering (2008)

The paper considers the problem of choosing order quantities and a cyclic production pattern for several products that are produced in a common capacity constrained facility. The heuristic method from Segerstedt [Segerstedt, A. (1999). Lot sizes in a capacity constrained facility with available initial inventories. International Journal of Production Economics, 59, 469-475] is modified and improved. The method is compared with the heuristic technique according to Doll [Doll, C. L., & Whybark, D. C. (1973). An iterative procedure for the single-machine multi-product lot scheduling problem. Management Science, 20(1), 50-55; Goyal, S. K. (1975). Scheduling a single-machine multi-product system: A new approach. International Journal of Production Research, 13, 487-493]; the differences and similarities between the methods are illustrated in a common numerical example. It shows that feasible solutions can be found, both with our method and others; where the production can be scheduled during a time interval, the initial inventory level is the same as the final and the schedule can be repeated in a cyclic pattern without shortages. (This definition of feasibility differs from traditional.) However, it shows that the common approximation for the inventory holding costs (q"i2h"i(1-d"i/p"i)) does not fit. The real inventory holding cost becomes different compared to the approximated that is used in the calculations. The real inventory holding cost depends on the chosen scheduling, which makes it difficult to find an optimal solution. Different solutions and extensions are discussed.
An Experimental Delay Test Generator for LSI Logic
Authors: J. D. Lesser
Venue: IEEE Transactions on Computers (1980)

Delay testing is a test procedure to verify the timing performance of manufactured logic networks. When a level-sensitive scan design (LSSD) discipline is used, all networks are combinational. Appropriate test patterns are selected on the basis of certain theoretical criteria. These criteria are embodied in an experimental test generation program. The program has successfully produced sets of delay tests for large logic networks. The average coverage achieved by these tests faDs within 95.8 percent to 99.9 percent of optimal.
Pattern detection from web using AFA set theory
Authors: Ikumi Horie, Kazunori Yamaguchi, Kenji Kashiwabara
Venue: Proceedings of the 9th annual ACM international workshop on Web information and data management (2007)

Recurring patterns of the same link structure can often be observed on Web sites. Patterns are important for site administrators in revising Web sites but are difficult to find empirically. We propose a method for detecting such patterns. The first step in the method is viewing a Web site as a directed graph, and identifying pages that have the same substructure by the Anti-Foundation Axiom (AFA). The AFA is a non-standard set theory that allows for a circular structure. The pages identified by AFA are divided into connected components. Then, meaningful sets of pages are selected as patterns by using the Galois lattice of the binary relation between the pages and the connected components. We apply our method to three actual Web sites and succeed in detecting patterns within the target sites.
Development of formal models and conformance testing for systems with asynchronous interfaces and telecommunications protocols
Authors: N. V. Pakulin, A. V. Khoroshilov
Venue: Programming and Computing Software (2007)

There is a gap between the formal modeling and testing methods for modern protocols and asynchronous software systems: due to high complexity of such systems, attempts to include formal models in testing procedures fail. In this paper, we propose an approach to filling this gap based on a formalization of the behavior of systems with asynchronous interfaces using contract specifications followed by the use of these specifications to design adaptive test suites. This approach was used for testing various software systems including implementations of the IPv6 Internet protocols stack and implementations of the POSIX and Linux Standard Base software interfaces.
A New Class of Alternating Proximal Minimization Algorithms with Costs-to-Move
Authors: H. Attouch, P. Redont, A. Soubeyran
Venue: SIAM Journal on Optimization (2007)

Given two objective functions $f:\mathcal X\mapsto\R\cup\{+\infty\}$ and $g:\mathcal Y\mapsto\R\cup\{+\infty\}$ on abstract spaces $\mathcal X$ and $\mathcal Y$, and a coupling function $c:\mathcal X\times\mathcal Y\mapsto\R^+$, we introduce and study alternative minimization algorithms of the following type: $(x_0,y_0)\in\mathcal X\times\mathcal Y \mbox{ given; } (x_n,y_n)\rightarrow(x_{n+1},y_n)\rightarrow(x_{n+1},y_{n+1}) \mbox{ as follows: }\ \left\{\begin{array}{l} x_{n+1}\in\mbox{argmin} \{f(\xi)+\beta_n c(\xi,y_n)+\alpha_n h(x_n,\xi): \xi\in\mathcal X\},\ y_{n+1}\in\mbox{argmin} \{g(\eta)+\mu_n c(x_{n+1},\eta)+\nu_n k(y_n,\eta): \eta\in\mathcal Y\}. \end{array}\right.$ Their most original feature is the introduction of the terms $h:\mathcal X\times\mathcal X\mapsto\R^+$ and $k:\mathcal Y\times\mathcal Y\mapsto\R^+$ which are costs to change or to move (distance-like functions, relative entropies) accounting for various inertial, friction, or anchoring effects. These algorithms are studied in a general abstract framework. The introduction of the costs to change $h$ and $k$ leads to proximal minimizations with corresponding dissipative effects. As a result, the algorithms enjoy nice convergent properties. Coefficients $\alpha_n$, $\beta_n$, $\mu_n$, $\nu_n$ are nonnegative parameters. When taking $\alpha_n=\nu_n=0$ and quadratic costs on a Hilbert space, one recovers the classical alternating minimization algorithm, which itself is a natural extension of the alternating projection algorithm of von Neumann. A number of new significant results hold in general metric spaces. We pay particular attention to the following cases: (1.) $(\mathcal X,d_{\mathcal X})$ and $(\mathcal Y,d_{\mathcal Y})$ are complete metric spaces and $h\geq d_{\mathcal X}$, $k\geq d_{\mathcal Y}$ (&ldquo;high local costs to move&rdquo;); the algorithms then provide sequences that converge to Nash equilibria. (2.) $\mathcal X=\mathcal Y=\mathcal H$ is a Hilbert space, the costs to change are quadratic (&ldquo;low local costs to move&rdquo;) and the functions $f,g:\mathcal H\mapsto\R\cup\{+\infty\}$ are closed, convex, proper; then some of the classical convergence theorems for alternating convex minimization algorithms, including those of Acker and Prestel, are properly extended with original proofs.
Economics of shareware: How do uncertainty and piracy affect shareware quality and brand premium?
Authors: Wendy Hui, Byungjoon Yoo, Kar Yan Tam
Venue: Decision Support Systems (2008)

Increased network speed has opened up new opportunities for developers to distribute their products as shareware through the Internet. This paper analyzes the interrelationships among key issues that are central to the software industry, including uncertainty, piracy, shareware quality and full version price. We show that customers' aversion to uncertainty of software quality tends to increase shareware quality while piracy tends to decrease it. Counter-intuitively, the perceived quality of the full version software or the trust towards the software developer does not affect the full version price and the profit of the firm when piracy is prevalent.
Do information technology units have more power than other units in academic libraries?
Authors: Sook Lim
Venue: Journal of the American Society for Information Science and Technology (2007)

Systems offices that deal with library information technologies have played an important role in academic libraries; however, not much is known about how systems offices are positioned within academic libraries. This study examined the present status and the influence of systems offices by exploring the power differences among five principal functional units based on strategic contingencies theory. A mail questionnaire was sent to the principal functional unit heads of each of 95 university libraries belonging to the Association of Research Libraries in the United States. A total of 484 questionnaires were sent; 235 questionnaires were returned. The three major findings of this study were that (a) systems offices had more perceived power than all but public services; (b) systems offices had higher levels on contingency variables than did most of the other units; and finally, (c) criticality was a factor affecting perceived power between systems offices and most of the other units. The study findings imply that strategic contingencies theory may be partially applicable to library settings. Library staff or units may strategically increase their power by aligning their services with goals critical to their library and cooperating with other staff or other units.
H_2 Control design for fuzzy dynamic systems via LMI
Authors: Ning Zhang, Gang Feng
Venue: Journal of Intelligent Fuzzy Systems: Applications in Engineering and Technology (2000)

This paper addresses the robust H_2 control design of complex nonlinear systems which can be represented by a fuzzy dynamic model. Based on a continuous Lyapunov function and a piecewise continuous Lyapunov function respectively, two kinds of new control design methods are proposed using Lyapunov stability theory, robust H_2 control theory and Linear Matrix Inequalities (LMI) techniques. It is shown that the closed loop fuzzy control system is asymptotically stable with a white noise attenuation. The robust H_2 fuzzy controller can be obtained by using the LMI techniques. An example is given to demonstrate the application of the proposed design methods.
A Multi-layer Quantum Neural Networks Recognition System for Handwritten Digital Recognition
Authors: Daqi Zhu, Rushi Wu
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 01 (2007)

In this paper, a handwritten digital recognition system based on multi-level transfer function Quantum Neural Networks (QNN) and multi-layer classifiers is proposed. The recognition system proposed consists of two layer sub-classifiers, namely first-layer QNN coarse classifier and second-layer QNN numeral pairs classifier. Handwritten digital recognition experiments are performed by using data from MNIST database. Experiment results indicate the proposed QNN recognition system achieves excellent performance in terms of recognition rates and recognition reliability, and at the same time show the superiority and potential of QNN in solving pattern recognition problems.
Projection-based measure for efficient feature selection
Authors: Roberto Ruiz, José C. Riquelme, Jesús S. Aguilar-Ruiz
Venue: Journal of Intelligent Fuzzy Systems: Applications in Engineering and Technology (2002)

The attribute selection techniques for supervised learning, used in the preprocessing phase to emphasize the most relevant attributes, allow making models of classification simpler and easy to understand. Depending on the method to apply: starting point, search organization, evaluation strategy, and the stopping criterion, there is an added cost to the classification algorithm that we are going to use, that normally will be compensated, in greater or smaller extent, by the attribute reduction in the classification model. The method proposed in this work utilizes a measure based on projections to guide the selection of the attributes. The algorithm (SOAP: Selection of Attributes by Projection) has some interesting characteristics: lower computational cost (O(mn log n) m attributes and n examples in the data set) with respect to other typical algorithms due to the absence of distance and statistical calculations; its applicability to any labelled data set, that is to say, it can contain continuous and discrete variables, with no need for transformation. The performance of SOAP is analysed in two ways: percentage of reduction and classification. SOAP has been compared to CFS [4] and ReliefF [8]. The results are generated by C4.5 before and after the application of the algorithms.
Bisection Based Placement for the X Architecture
Authors: Satoshi Ono, Sameer Tilak, Patrick H. Madden
Venue: Proceedings of the 2007 Asia and South Pacific Design Automation Conference (2007)

Rising interconnect delay and power consumption have motivated the investigation of alternative integrated circuit routing architectures. In particular, the X Architecture, which features preferred routing in diagonal directions, has gained a measure of industry support, and has even been validated at 65nm. While there has been extensive study of Manhattan design methods, there are markedly fewer published results for non-Manhattan design. To help fill this gap, we study a patented placement method for the X Architecture; to our knowledge, there have been no prior published results for the method. Surprisingly, we find that the patented method in fact performs worse than traditional Manhattan methods - for both Manhattan and X routing metrics. We also present a theoretic formulation which explains why solution quality is degraded. Many groups in industry are evaluating the merits of non-Manhattan routing architectures. By providing concrete experimental results, we hope to improve the accuracy of these evaluations.
Computing and using residuals in time series models
Authors: José Alberto Mauricio
Venue: Computational Statistics Data Analysis (2008)

The most often used approaches to obtaining and using residuals in applied work with time series models are unified and documented with both partially known and new features. Specifically, three different types of residuals, namely ''conditional residuals'', ''unconditional residuals'' and ''innovations'', are considered with regard to (i) their precise definitions, (ii) their computation in practice after model estimation, (iii) their approximate distributional properties in finite samples, and (iv) potential applications of their properties in model diagnostic checking. The focus is on both conditional and unconditional residuals, whose properties have received very limited attention in the literature. However, innovations are also briefly considered in order to provide a comprehensive description of the various classes of residuals a time series analyst might find in applied work. Theoretical discussion is accompanied by practical examples, illustrating (a) that routine application of standard model-building procedures may lead to inaccurate models in cases of practical interest which are easy to come across, and (b) that such inaccuracies can be avoided by using some of the new results on conditional and unconditional residuals developed with regard to points (iii) and (iv) above. For ease and clarity of exposition, only stationary univariate autoregressive moving average models are considered in detail, although extensions to the multivariate case are briefly discussed as well.
Mining Evolutionary Event Patterns of Web Texts for Text Resource Aggregation
Authors: Cheng-li Zhao, Dong-yun Yi
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 04 (2007)

As an outcome of the overwhelming volume of internet resources, it is necessary to research methods integrating distributed autonomous resources connected to the internet to make them more effective and efficient. With the understanding of characteristics of internet resources, this paper will focus on solving the problem of text resource aggregation in open environment and its emergence showed during aggregation over time. We process these text resources both in space and time dimension through viewing them as an event stream evolving over time, and attempt to discover the evolutionary event patterns, furthermore, to mine the emergence of text content, such as revealing research trends in scientific literature. Experiments show that our methods can discover interesting evolutionary event patterns effectively.
Hierarchical Policy for Agent Grid Collaboration
Authors: Maoguang Wang, Zhongzhi Shi, Shifei Ding
Venue: Proceedings of the Sixth International Conference on Grid and Cooperative Computing (2007)

Agent grid is a heterogeneous, dynamic, open and varying software system, which is expected to provide intelligent collaboration and services sharing for users. Policy plays an important role in agent grid collaboration. This paper studies the complex collaboration model in agent grid environment and use policy to guide the complex system behaviors. Using formal policy representation language we define the agent actions, goals and utilities from low level to high level. And based on policy-driven we build an agent grid collaborative platform AGrIP
Resolving crises through automated bilateral negotiations
Authors: Sarit Kraus, Penina Hoz-Weiss, Jonathan Wilkenfeld, David R. Andersen, Amy Pate
Venue: Artificial Intelligence (2008)

We describe the development of an automated agent that can negotiate efficiently with people in crises. The environment is characterized by two negotiators, time constraints, deadlines, full information, and the possibility of opting out. The agent can play either role, with communications via a pre-defined language. The model used in constructing the agent is based on a formal analysis of the crises scenario using game-theoretic methods and heuristics for bargaining. The agent receives messages sent by its opponent, analyzes them and responds. It also initiates discussion on one or more parameters of an agreement. Experimental results of simulations of a fishing dispute between Canada and Spain indicate that the agent played at least as well as, and in the case of Spain, significantly better than a human player.