ppxscal/embedding_network huggingface dataset:
Verified formal security models for multiapplicative smart cards
Authors: Gerhard Schellhorn, Wolfgang Reif, Axel Schairer, Paul Karger, Vernon Austel, David Toll
Venue: Journal of Computer Security (2002)

We present two generic formal security models for operating systems of multiapplicative smart cards. The models formalize the main security aspects of secrecy, integrity, secure communication between applications and secure downloading of new applications. The first model is as abstract as possible, whereas the second extends the first by adding practically relevant issues such as a structured file system. The models satisfy a common security policy consisting of authentication and intransitive noninterference. The policy extends the classical security policy of Bell/LaPadula and Biba models, but avoids the need for trusted processes that are allowed to circumvent the security policy. Instead trusted processes are incorporated directly in the model itself and are subject to the security policy. The security policy has been formally proven to be correct for both models.
Maximal nonrevisiting paths in simple polytopes
Authors: Fred B. Holt
Venue: Discrete Mathematics (2003)

Thirty years ago the connection was established between the presence of nonrevisiting paths in a d-polytope and the polytope's edge-diameter. The operation of wedging was used to establish the equivalence of the nonrevisiting conjecture and the Hirsch conjecture. Recently, wedging and other operations have again provided the best available results related to the Hirsch conjecture. In this paper we analyze the effect of wedging and these other operations on the number of maximal nonrevisiting paths in simple polytopes. Two results follow from this accounting. First, following up on the strong d-step conjecture, we establish a new upper bound for the minimum number of paths of length d connecting estranged vertices in a d-polytope with 2d facets. Second, we observe that not only do the operations considered fail to eliminate nonrevisiting paths, these operations do not even reduce the number of such paths.
Backward Euler discretization of fully nonlinear parabolic problems
Authors: C. González, A. Ostermann, C. Palencia, M. Thalhammer
Venue: Mathematics of Computation (2002)

This paper is concerned with the time discretization of nonlinear evolution equations. We work in an abstract Banach space setting of analytic semigroups that covers fully nonlinear parabolic initial-boundary value problems with smooth coefficients. We prove convergence of variable stepsize backward Euler discretizations under various smoothness assumptions on the exact solution. We further show that the geometric properties near a hyperbolic equilibrium are well captured by the discretization. A numerical example is given.
Relaxing consistency requirement for read-only transactions
Authors: Kwok-wa Lam, Sang H. Son, Victor C. S. Lee, Sheung-lun Hung
Venue: Information Sciences&mdash;Informatics and Computer Science: An International Journal (2002)

In this paper, we investigate the approach to relaxing consistency requirement of serializability to improve the performance of real-time database systems. We make use of the property that a read-only transaction (ROT) only reads, but does not update any data item. Since there is a significant proportion of ROTs in several real-time systems, it is important to investigate how to process ROTs effectively. We define a weaker form of consistency, view consistency, which allows ROTs to perceive different serialization orders of update transactions. Although view consistency permits non-serializablility, ROTs are still ensured to see consistent data. We devise a separate algorithm to process ROTs from update transactions for view consistency. For comparison, we devise another separate algorithm to process ROTs for strong consistency that is equivalent to serializability. Our simulation results show that the two separate algorithms outperform the locking and optimistic protocols significantly. Using separate algorithms reduces the interference between ROTs and update transactions. This reduced interference alleviates the impact of concurrency control on real-time priority-driven scheduling and improves the timeliness of the system. To our great surprise, the two separate algorithms perform almost the same. In our investigation, we found that most data conflicts between an ROT and update transactions are independent data conflicts. These independent data conflicts can be easily resolved by using a separate algorithm even under serializability. Thus, this observation indicates that using a separate algorithm to process ROTs from update transactions is more effective than relaxing consistency requirement.
NEBIC: A Dynamic Capabilities Theory for Assessing Net-Enablement
Authors: Bradley C. Wheeler
Venue: Information Systems Research (2002)

We propose the Net-Enabled Business Innovation Cycle (NEBIC) as an applied dynamic capabilities theory for measuring, predicting, and understanding a firm's ability to create customer value through the business use of digital networks. The theory incorporates both a variance and process view of net-enabled business innovation. It identifies four sequenced constructs: Choosing new IT, Matching Economic Opportunities with technology, Executing Business Innovation for Growth, and Assessing Customer Value, along with the processes and events that interrelate them as a cycle. The sequence of these theorized relationships for net-enablement (NE)Â¹ asserts that choosing ITprecedes rather than aligns with corporate strategy. The theory offers a logically consistent and falsifiable basis for grounding research programs on metrics of net-enabled business innovation.
A Lagrange multiplier and Hopfield-type barrier function method for the traveling salesman problem
Authors: Chuangyin Dang, Lei Xu
Venue: Neural Computation (2002)

A Lagrange multiplier and Hopfield-type barrier function method is proposed for approximating a solution of the traveling salesman problem. The method is derived from applications of Lagrange multipliers and a Hopfield-type barrier function and attempts to produce a solution of high quality by generating a minimum point of a barrier problem for a sequence of descending values of the barrier parameter. For any given value of the barrier parameter, the method searches for a minimum point of the barrier problem in a feasible descent direction, which has a desired property that lower and upper bounds on variables are always satisfied automatically if the step length is a number between zero and one. At each iteration, the feasible descent direction is found by updating Lagrange multipliers with a globally convergent iterative procedure. For any given value of the barrier parameter, the method converges to a stationary point of the barrier problem without any condition on the objective function. Theoretical and numerical results show that the method seems more effective and efficient than the softassign algorithm.
A heuristic method for resource constrained allocation in multi-project scheduling
Authors: S. M. T. Fatemi Ghomi, B. Ashjari
Venue: Iranian Journal of Science and Technology (2001)

This paper deals with the problem of scheduling activities of multiple projects when there is constraint on available resources. At the present time the general problem of multi-project resource allocation is formulated as a zero-one programming and goal programming models. But the problem of determining a schedule subject to precedence and resource constraints is difficult to solve. It would be even more complex when unforeseen changes are considered, for example in the level of resources. Therefore, the scheduling problem is decomposed into a series of multidimensional knapsack problem, and a heuristic procedure is proposed.
Scheduling algorithms for multicast traffic in TDM/WDM networks with arbitrary tuning latencies
Authors: A. Bianco, G. Galante, E. Leonardi, F. Neri, A. Nucci
Venue: Computer Networks: The International Journal of Computer and Telecommunications Networking (2003)

We consider all-optical Time Division Multiplexing (TDM)/Wavelength Division Multiplexing (WDM) broadcast and select networks with slotted operation. Each network access node is equipped with one fixed transmitter and one tunable receiver; tuning times are not negligible with respect to the fixed size slot time. We discuss efficient scheduling algorithms to assign TDM/WDM slots to multicast traffic in such networks. The problem is shown to be NP-hard; thus, heuristic algorithms based on the Tabu Search meta-heuristic are proposed, and their performance are assessed using randomly created request matrices based on two types of multicast traffic patterns. We show that significant advantages can be obtained by using these novel algorithms with respect to simpler greedy algorithms, even when restricting CPU times to realistic values to make the algorithms of practical use.
Performance analysis of connectionist paradigms for modeling chaotic behavior of stock indices
Authors: Ajith Abraham, Ninan Sajith Philip, Baikunth Nath, P. Saratchandran
Venue: Computational intelligence and applications (2002)

The use of intelligent systems for stock market predictions has been widely established. In this paper, we investigate how the seemingly chaotic behavior of stock markets could be well represented using several connectionist paradigms and soft computing techniques. To demonstrate the different techniques, we considered Nasdaq-100 index of Nasdaq Stock MarketTM and the S&P CNX NIFTY stock index. We analyzed 7 year's Nasdaq 100 main index values and 4 year's NIFTY index values. This paper investigates the development of a reliable and efficient technique to model the seemingly chaotic behavior of stock markets. We considered an artificial neural network trained using Levenberg-Marquardt algorithm, Support Vector Machine (SVM), Takagi-Sugeno neuro-fuzzy model and a Difference Boosting Neural Network (DBNN). This paper briefly explains how the different connectionist paradigms could be formulated using different learning methods and then investigates whether they can provide the required level of performance, which are sufficiently good and robust so as to provide a reliable forecast model for stock market indices. Experiment results reveal that all the connectionist paradigms considered could represent the stock indices behavior very accurately.
Extremal properties of regular and affine generalized m-gons as tactical configurations
Authors: V. A. Ustimenko, A. J. Woldar
Venue: European Journal of Combinatorics (2003)

The purpose of this paper is to derive bounds on the sizes of tactical configurations of large girth which provide analogues to the well-known bounds on the sizes of graphs of large girth. Let exα(v,g) denote the greatest number of edges in a tactical configuration of order v, bidegree a, aα and girth at least g. We establish the upper bound exα (v,g) = 0(v1+1/τ), where τ = 1/4(α + 1)g -1 for g = 0(mod 4) and τ = 1/4(α + 1)g + ½(α - 3) for g ≡ = 2(mod 4). We further demonstrate this bound to be sharp for the regular and affine generalized m-gons but not for the nonregular generalized m-gons. Finally, we derive lower bounds on exα(v, g) via explicit group theoretic constructions.
Managing single echelon inventories through demand aggregation and the feasibility of a correlation matrix
Authors: Kefeng Xu, Philip T. Evers
Venue: Computers and Operations Research (2003)

This paper examines the assertion that partial pooling of customers is sometimes favored over complete pooling on the sole basis of demand correlation. First, the management of inventory within a supply chain is discussed, with specific attention paid to risk-pooling. Then, the claim that partial pooling can dominate is theoretically discussed. The conditions under which previous research found that partial aggregation could, at times, be preferable are investigated next. From this, methods are proposed for checking correlation matrices to ensure their validity. It is concluded that partial pooling can never do better and that examples supporting partial aggregation are based on inconsistent correlation matrices.
The ERP systems development approach to achieving an adaptive enterprise: the impact of enterprise process modelling tools
Authors: Sue Kelly, Chris Holland
Venue: Systems engineering for business process change: new directions (2002)

Organisations are now being forced to change radically and quickly in response to the dynamic, fast moving environment in which they operate. The creation of an "adaptive enterprise" is becoming crucial and the move towards a sense-and-respond business model becomes increasingly important. Efficient and effective systems development continues to be of major consequence in the IS field. However, many methodologies have been developed from practices and concepts relevant to an outdated organisational environment. ERP systems have driven systems development into a new phase of maturity. The development of enterprise process modelling tools within ERP systems have been instrumental in bringing about a more business-focused systems development methodology and we would argue that these tools, through the alignment of business processes with the standard ERP package, can prove a valuable aid to facilitating the move towards the creation of an "adaptive enterprise". This paper attempts to provide insight into systems development issues surrounding the use of enterprise process modelling tools and their role in moving towards an adaptive enterprise.
A Rollout Policy for the Vehicle Routing Problem with Stochastic Demands
Authors: Nicola Secomandi
Venue: Operations Research (2001)

The paper considers the single vehicle routing problem with stochastic demands. While most of the literature has studied the a priori solution approach, this work focuses on computing a reoptimization-type routing policy. This is obtained by sequentially improving a given a priori solution by means of a rollout algorithm. The resulting rollout policy appears to be the first computationally tractable algorithm for approximately solving the problem under the reoptimization approach. After describing the solution strategy and providing properties of the rollout policy, the policy behavior is analyzed by conducting a computational investigation. Depending on the quality of the initial solution, the rollout policy obtains 1% to 4% average improvements on the a priori approach with a reasonable computational effort.
Implementation experience with MANET routing protocols
Authors: Kwan-Wu Chin, John Judge, Aidan Williams, Roger Kermode
Venue: ACM SIGCOMM Computer Communication Review (2002)

This paper outlines our experience with the implementation and deployment of two MANET routing protocols on a five node, four hop, network. The work was prompted by the lack of published results concerning the issues associated with the implementation of MANET routing protocols on actual wireless networks, as opposed to results of simulation experiments. We examined implementations of two distance vector MANET routing protocols and found a number of problems with both protocols during the course of our experiments. The most significant was that neither protocol could provide a stable route over any multi-hop network connection. The route discovery process of both protocols is fooled by the transient availability of network links to nodes that were more than one hop away. Packets transmitted over a fading channel cause the routing protocol to conclude incorrectly that there is a new one hop neighbor that could provide a lower metric (hop count) route to even more distant nodes. This can occur even when nodes are stationary, mobility resulted in even less route stability. We implemented a simple signal strength based neighbor selection procedure to test our assertion that fading channels and unreliable network links were the cause of the failure of the routing protocols. The result was that neighbor discovery and the filtering for neighbors with which nodes could communicate reliably enables the creation of reliable multihop routes. Based on our experiences, we outline several recommendations for future work in MANET research.
On natural living room communication with "ComAdapter": adapting to the differences in room structure
Authors: Kazuyuki Iso, Takashi Yagi, Minoru Kobayashi, Satoshi Iwaki, Satoshi Ishibashi
Venue: CHI '03 extended abstracts on Human factors in computing systems (2003)

Aiming at rich and useful communication in our daily home life, we propose a novel communication concept, "ComAdapter", in which people can mutually share their intention and emotion by exchanging their spontaneous behavior. ComAdapter can create shared space communication that allow us to communicate with another party in a remote location as though other party has entered our room. To achieve this, ComAdapter offsets the differences in the configurations of the rooms. In a simple preliminary system, body motions are successfully adapted and transmitted between two rooms with different layout. The success of the experiment confirms the validity and potential of ComAdapter.
A new exclusion test
Authors: Kurt Georg
Venue: Journal of Computational and Applied Mathematics (2003)

Exclusion tests are a well-known tool for obtaining all solutions of a nonlinear system of equations, see, e.g., the work of Krawczyk or Moore. Recently, Yamamura and collaborators have developed Linear Programming exclusion tests that turned out to be highly successful for nonlinear problems in electrical networking. The author has developed higher order exclusion tests based on Taylor expansions. In the present paper it is shown that the ideas behind both approaches can be combined: We present a new class of higher order Linear Programming exclusion tests, investigate their computational complexity, and illustrate their performance on several examples.
Java Communication Interfaces for Control Systems
Authors: Zhaoxia Huang, Shengxi Zhou, Shengru Tu
Venue: Proceedings of the 21st International Computer Software and Applications Conference (1997)

This paper reports an effort to uplift the conceptual level of Java programming for communications in control systems to the level of CODARTS interfaces. Having implemented every component of the communication interfaces defined by CODARTS, we have constructed a Java class library that facilitates a direct mapping from CODARTS design diagram to Java program components. This will not only simplify the programming but also improve the quality of software. The use of this class library is illustrated by an implementation of a CORDARTS design of a distributed elevator system.
Problems and results on judicious partitions
Authors: B. Bollobás, A. D. Scott
Venue: Random Structures Algorithms (2002)

We present a few results and a larger number of questions concerning partitions of graphs or hypergraphs, where the objective is to maximize or minimize several quantities simultaneously. We consider a variety of extremal problems; many of these also have algorithmic counterparts.
Numerical solution of problems with non-linear boundary conditions
Authors: Petr Sváček, Karel Najzar
Venue: Mathematics and Computers in Simulation (2003)

In this paper, we are concerned with an elliptic problem in a bounded two-dimensional domain equipped with a non-linear Newton boundary condition. This problem appears, e.g. in the modelling of electrolysis procedures. We assume that the non-linearity has a polynomial behaviour. The problem is discretized by the finite element (FE) method with conforming piecewise linear or polynomial approximations. This problem has been investigated in [Num. Math. 78 (1998) 403; Num. Funct. Anal. Optimiz. 20 (1999) 835] in the case of a polygonal domain, where the convergence and error estimates are established. In [Feistauer et al., On the Finite Element Analysis of Problems with Non-linear Newton Boundary Conditions in Non-polygonal Domains, in press] the convergence of the FE approximations to the exact solution is proved in the case of a nonpolygonal domain with curved boundary. The analysis of the error estimates leads to interesting results. The non-linearity in boundary condition causes the decreas of the approximation error. Further decreas is caused by the application of the numerical integration in the computation of boundary integrals containing the non-linear terms. In [Feistauer et al., Numerical analysis of problems with non-linear Newton boundary conditions, in: Proceedings of the Third Conference of ENUMATH'99, p. 486], numerical experiments prove that this decreas is not the result of a poor analysis, but it really appears.In our paper, we give a brief of the results. The main attention is paid to the development of the error estimates for higher-order FE method. The error estimates are compared with experiments.
Citation-Based Retrieval for Scholarly Publications
Authors: Y. He, S. C. Hui, A. C. M. Fong
Venue: IEEE Intelligent Systems (2003)

Many scholarly publications are currently available on the Internet and in digital libraries. However, existing search engines have proved mostly ineffective in searching these publications. Using scholarly literature published on the Internet as a case study, the authors developed a publication retrieval system that consists of a citation indexing agent and an intelligent retrieval agent. The citation indexing agent searches the Internet for relevant scholarly publications and generates a citation database accordingly. The intelligent retrieval agent then helps retrieve the scholarly publications. The retrieval technique is based on Kohonen's self-organizing map. The proposed technique comprises a training process of mining the citation database to generate cluster information and a retrieval process for retrieving and ranking the publications according to user input queries. This technique offers fast retrieval speeds and high retrieval precision in terms of document relevance.
The money of invention: how venture capital creates new wealth
Authors: Paul A. Gompers, Josh Lerner
Venue: Ubiquity (2002)

Ninety percent of new entrepreneurial businesses that don't attract venture capital fail within three years.
An interdisciplinary laboratory for computer science and engineering technology
Authors: Ray Bachnak, Carl Steidley
Venue: Journal of Computing Sciences in Colleges (2002)

This paper describes the development of a new Data Acquisition and Control Laboratory at Texas A&M University-Corpus Christi (A&M-CC). The laboratory is being equipped with state-of-the-art instruments that offer several capabilities, including internet-based experimentation, process variable measurements and analysis, control system modeling and design, signal and image processing, and sensor technology applications. This paper presents the major components of the laboratory, describes the interfacing of the components into fully operational systems, and discusses the interdisciplinary educational and research capabilities that the new laboratory supports.
Cell phone communication and driver visual behavior: the impact of cognitive distraction
Authors: Patricia Trbovich, Joanne L. Harbluk
Venue: CHI '03 extended abstracts on Human factors in computing systems (2003)

With the advent of new technology in vehicles, drivers can access information in many different forms (email, address books, Web pages) and from many information sources (cell phones, PDAs, driver support systems). With these new information sources finding their way into cars comes increasing concern about the potential adverse effects resulting from drivers' interactions with such multi-function devices. This paper examines the disruptive impact of complex, interactive, hands-free cell phone communications upon the visual awareness of drivers proceeding through high volume intersections. The present study documents changes in driver visual behavior, resulting from cognitive distraction of speech-based interactions, that may contribute to intersection crashes. The results of this research raise significant HCI implications for the design of interactive Intelligent Transportation Systems (ITS) within the automotive sector.