ppxscal/embedding_network huggingface dataset:
Dependable Service- Oriented Computing
Authors: Asit Dan, Priya Narasimhan
Venue: IEEE Internet Computing (2009)

In the past few years, interest has been increasing in dependable service-oriented computing (SOC), both in industry and academia. SOC can extend the scope of developing dependable solutions beyond runtime protocols by focusing on independently developed services' entire life cycles — design, development, deployment, and runtime management.
Efficient discovery of risk patterns in medical data
Authors: Jiuyong Li, Ada Wai-chee Fu, Paul Fahey
Venue: Artificial Intelligence in Medicine (2009)

Objective: This paper studies a problem of efficiently discovering risk patterns in medical data. Risk patterns are defined by a statistical metric, relative risk, which has been widely used in epidemiological research. Methods: To avoid fruitless search in the complete exploration of risk patterns, we define optimal risk pattern set to exclude superfluous patterns, i.e. complicated patterns with lower relative risk than their corresponding simpler form patterns. We prove that mining optimal risk pattern sets conforms an anti-monotone property that supports an efficient mining algorithm. We propose an efficient algorithm for mining optimal risk pattern sets based on this property. We also propose a hierarchical structure to present discovered patterns for the easy perusal by domain experts. Results: The proposed approach is compared with two well-known rule discovery methods, decision tree and association rule mining approaches on benchmark data sets and applied to a real world application. The proposed method discovers more and better quality risk patterns than a decision tree approach. The decision tree method is not designed for such applications and is inadequate for pattern exploring. The proposed method does not discover a large number of uninteresting superfluous patterns as an association mining approach does. The proposed method is more efficient than an association rule mining method. A real world case study shows that the method reveals some interesting risk patterns to medical practitioners. Conclusion: The proposed method is an efficient approach to explore risk patterns. It quickly identifies cohorts of patients that are vulnerable to a risk outcome from a large data set. The proposed method is useful for exploratory study on large medical data to generate and refine hypotheses. The method is also useful for designing medical surveillance systems.
Goldreich's One-Way Function Candidate and Myopic Backtracking Algorithms
Authors: James Cook, Omid Etesami, Rachel Miller, Luca Trevisan
Venue: Proceedings of the 6th Theory of Cryptography Conference on Theory of Cryptography (2009)

Goldreich (ECCC 2000) proposed a candidate one-way function construction which is parameterized by the choice of a small predicate (over d = O(1) variables) and of a bipartite expanding graph of right-degree d. The function is computed by labeling the n vertices on the left with the bits of the input, labeling each of the n vertices on the right with the value of the predicate applied to the neighbors, and outputting the n-bit string of labels of the vertices on the right.Inverting Goldreich's one-way function is equivalent to finding solutions to a certain constraint satisfaction problem (which easily reduces to SAT) having a "planted solution," and so the use of SAT solvers constitutes a natural class of attacks.We perform an experimental analysis using MiniSat, which is one of the best publicly available algorithms for SAT. Our experiment shows that the running time required to invert the function grows exponentially with the length of the input, and that such an attack becomes infeasible already with small input length (a few hundred bits).Motivated by these encouraging experiments, we initiate a rigorous study of the limitations of back-tracking based SAT solvers as attacks against Goldreich's function. Results by Alekhnovich, Hirsch and Itsykson imply that Goldreich's function is secure against "myopic" backtracking algorithms (an interesting subclass) if the 3-ary parity predicate P(x 1,x 2,x 3) = x 1 ¿ x 2 ¿ x 3 is used. One must, however, use non-linear predicates in the construction, which otherwise succumbs to a trivial attack via Gaussian elimination.We generalized the work of Alekhnovich et al. to handle a more general class of predicates, and we present a lower bound for the construction that uses the predicate P d (x 1,...,x d ) : = x 1 ¿ x 2 ¿ ¿ ¿ x d ¿ 2 ¿ (x d ¿ 1 ¿ x d ) and a random graph.
Mobile Learning against Forgetting
Authors: Yuan Miao
Venue: Proceedings of the 2008 The Second International Conference on Next Generation Mobile Applications, Services, and Technologies (2008)

This paper presents a practice based learning model. This model allows learners practice the learning content according to the forgetting curve. The reinforce phase of the learning is performed through a sequence of mini-practice unit, which boost the memory against forgetting. The model is designed on mobile platform like tablets or PDAs. Learners are able to practice on buses, at beach or during the interval of play ground games. Simulation result shows that it can be significantly improve the learning performance.
Path projection for user-centered static analysis tools
Authors: Yit Phang Khoo, Jeffrey S. Foster, Michael Hicks, Vibha Sazawal
Venue: Proceedings of the 8th ACM SIGPLAN-SIGSOFT workshop on Program analysis for software tools and engineering (2008)

The research and industrial communities have made great strides in developing sophisticated defect detection tools based on static analysis. To date most of the work in this area has focused on developing novel static analysis algorithms, but has neglected study of other aspects of static analysis tools, particularly user interfaces. In this work, we present a novel user interface toolkit called Path Projection that helps users visualize, navigate, and understand program paths, a common component of many tools' error reports. We performed a controlled user study to measure the benefit of Path Projection in triaging error reports from Locksmith, a data race detection tool for C. We found that Path Projection improved participants' time to complete this task without affecting accuracy, while participants felt Path Projection was useful and strongly preferred it to a more standard viewer.
Profit-aware overload protection in E-commerce Web sites
Authors: Chuan Yue, Haining Wang
Venue: Journal of Network and Computer Applications (2009)

Overload protection is critical to E-commerce Web sites. This paper presents a profit-aware admission control mechanism for overload protection in E-commerce Web sites. Motivated by the observation [Measure Twice, Cut Once-Metrics For Online Retailers, 2006, (http://www.techexchange.com/thelibrary/online_retail_metrics.html)] that once a client made an initial purchase, the buy-to-visit ratio of the client escalates from less than 1% to nearly 21%, the proposed mechanism keeps track of the purchase records of clients and utilizes them to make admission control decisions. We build two hash tables with full IP address and network ID prefix, which maintain the purchase records of clients in fine-grain and coarse-grain manners, respectively. We classify those clients who made purchases before as premium customers and those clients without prior purchase behavior as basic customers. Under overload conditions, our mechanism differentiates premium customers from basic customers based on the record hash tables, and admits premium customers with much higher probability than basic customers. In favor of premium customers, our mechanism maximizes the revenues of E-commerce Web sites. We evaluate the efficacy of the profit-aware mechanism using the industry-standard TCP-W workloads. Our experimental results demonstrate that under overload conditions, the profit-aware admission control mechanism not only achieves higher throughput and lower response time, but also dramatically increases the revenue received by E-commerce Web sites.
A Denotational Model for Web Services Choreography
Authors: Geguang Pu, Yongxin Zhao, Zheng Wang, Libo Feng, Huibiao Zhu, Jifeng He
Venue: Proceedings of the 5th International Conference on Distributed Computing and Internet Technology (2008)

In this paper, the denotational semantics for WS-CDL language dealing with web services choreography using UTP [5] technique is presented and the features related to choreographies are deeply studied. For instance, the passing channel, implicit concurrency and synchronization etc. mechanisms are explored, which brings us the insights for the design and implementation of CDL as well. Predicate space is used as the denotational model in this paper, which can facilitate us with reasoning about the behaviors of CDL programs.
Fuzzy scheduling of job orders in a two-stage flowshop with batch-processing machines
Authors: Alebachew D. Yimer, Kudret Demirli
Venue: International Journal of Approximate Reasoning (2009)

In this paper, we present a mixed-integer fuzzy programming model and a genetic algorithm (GA) based solution approach to a scheduling problem of customer orders in a mass customizing furniture industry. Independent job orders are grouped into multiple classes based on similarity in style so that the required number of setups is minimized. The family of jobs can be partitioned into batches, where each batch consists of a set of consecutively processed jobs from the same class. If a batch is assigned to one of available parallel machines, a setup is required at the beginning of the first job in that batch. A schedule defines the way how the batches are created from the independent jobs and specifies the processing order of the batches and that of the jobs within the batches. A machine can only process one job at a time, and cannot perform any processing while undergoing a setup. The proposed formulation minimizes the total weighted flowtime while fulfilling due date requirements. The imprecision associated with estimation of setup and processing times are represented by fuzzy sets.
User-Centred Design for Multimedia Applications
Authors: Alistair Sutcliffe
Venue: Proceedings of the IEEE International Conference on Multimedia Computing and Systems - Volume 2 (1999)

A method for multimedia presentation design is described. The method consists of media selection guidelines that utilise definition of information and media types, and techniques for directing the user's attention in multimedia sequences. Contact points are proposed for design effects to link content themes across dtflerent media. The method is illustrated with a theatre publicity application and the techniques for attention design are described by a medical training application. Method validation studies are described briefly followed by a discussion offuture work.
Electron Transport in Nanosystems, 1st edition
Authors: Janez Bonca, Sergei Kruchinin
Venue:  (2008)

The topics discussed at the NATO ARW included the new nanodevice applications, novel materials, mesoscopic superconductivity and biosensors. There have been many significant advances in the past two years and some entirely new directions of research are just opening up. Recent advances in nanoscience have demonstrated that fundamentally new physical phenomena are found when systems are reduced in size with dimensions, comparable to the fundamental microscopic length scales of the investigated material. Recent developments in nanotechnology and measurement techniques now allow experimental investigation of transport properties of nanodevices. Great interest in this research connected with development of spintronics, molecular electronics and quantum information processing.
Molecular communication on artificial cell membranes
Authors: Jun-ichi Kikuchi, Masaru Mukai, Yoshihiro Sasaki, Satoshi Hiyama, Yuki Moritani, Tatsuya Suda
Venue: Proceedings of the 3rd International Conference on Bio-Inspired Models of Network, Information and Computing Sytems (2008)

Molecular communication is a bio-inspired communication paradigm using molecules as information carriers. In this paper, we built an example molecular communication system in aqueous media, which includes propagation of molecular capsules capable of carrying molecular information between a molecular sender and a molecular receiver and followed amplification of the information at the receiver. A gemini peptide lipid as a molecular switch embedded in the lipid bilayer membranes logically controlled propagation of molecular capsules formed with small liposomes from a sender to a receiver each composed of a giant liposome, with input signals, such as chemical, photonic, and thermal signals. In addition, the molecular switch acted as an artificial receptor at the receiver, receiving a photonic signal to communicate with an enzyme as a signal amplifier by using Cu2+ ion as a mediator between the receptor and the amplifier.
Implementing a Parallel NetCDF Interface for Seamless Remote I/O Using Multi-dimensional Data
Authors: Yuichi Tsujita
Venue: High Performance Computing for Computational Science - VECPAR 2008: 8th International Conference, Toulouse, France, June 24-27, 2008. Revised Selected Papers (2008)

Parallel netCDF supports parallel I/O operations for a view of data as a collection of self-describing, portable, and array-oriented objects that can be accessed through a simple interface. Its parallel I/O operations are realized with the help of an MPI-I/O library. However, such the operations are not available in remote I/O operations. So, a remote I/O mechanism of a Stampi library was introduced in an MPI layer of the parallel netCDF to realize such the operations. This system was evaluated on two interconnected PC clusters, and sufficient performance was achieved with a huge amount of data.
FacetLens: exposing trends and relationships to support sensemaking within faceted datasets
Authors: Bongshin Lee, Greg Smith, George G. Robertson, Mary Czerwinski, Desney S. Tan
Venue: Proceedings of the 27th international conference on Human factors in computing systems (2009)

Previous research has shown that faceted browsing is effective and enjoyable in searching and browsing large collections of data. In this work, we explore the efficacy of interactive visualization systems in supporting exploration and sensemaking within faceted datasets. To do this, we developed an interactive visualization system called FacetLens, which exposes trends and relationships within faceted datasets. FacetLens implements linear facets to enable users not only to identify trends but also to easily compare several trends simultaneously. Furthermore, it offers pivot operations to allow users to navigate the faceted dataset using relationships between items. We evaluate the utility of the system through a description of insights gained while experts used the system to explore the CHI publication repository as well as a database of funding grant data, and report a formative user study that identified usability issues.
Why modelling matters
Authors: Mike Pidd
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

There has been an explosive growth in the capabilities of discrete simulation software in the last 20 years. There is no doubt that simulation software is much easier to use and is also much more powerful than it was. Some of this improvement has been driven by advances in computer hardware and software and some by demands from users. But amid all the hype about better, faster and more powerful tools, one thing hasn't changed -- the need to develop sensible models. These models need to be fit for purpose and this means, in most cases, that they help someone to understand or improve the system being simulated -- if it needs to be simulated. This in turn means that the models must be developed in an appropriate timescale and have a form that makes analysis as straightforward as possible. The presentation will consider different forms of model use and relate these to what we know about model building. It may also be fun.
Temporalization of Probabilistic Propositional Logic
Authors: Pedro Baltazar, Paulo Mateus
Venue: Proceedings of the 2009 International Symposium on Logical Foundations of Computer Science (2009)

In this paper we study several properties of the Exogenous Probabilistic Propositional Logic (EPPL ), a logic for reasoning about probabilities, with the purpose of introducing a temporal version - Exogenous Probabilistic Linear Temporal Logic (EPLTL). In detail, we give a small model theorem for EPPL and introduce a satisfaction and a model checking algorithm for both EPPL and EPLTL. We are also able to provide a (weakly) complete calculus for EPLTL. Finally, we conclude by pointing out some future work.
A Constraint Logic Programming Approach to Automated Testing
Authors: Hakim Belhaouari, Frédéric Peschanski
Venue: Proceedings of the 24th International Conference on Logic Programming (2008)

In this paper we present a new constraint solver for the automated generation of test cases from specifications. The specification language is inspired by the contract-oriented programming extended with a finite state machines. Beyond the generation of correct argument values for method calls, we generate full test scenarios thanks to the symbolic animation of the specifications. We propose a flexible CSP architecture that can operate not only on integer or bounded domains but also on arbitrary types. An original notion of type builder is used to establish the link between the type semantics and the CSP framework. We illustrate this with a string builder that can automatically generate string instances depending on combinations of constraints.
Design Trade-Offs in Packetizing Mechanism for Network-on-Chip
Authors: Shijun Lin, Li Su, Haibo Su, Depeng Jin, Lieguang Zeng
Venue: Proceedings of the 2009 Third International Conference on Digital Society (2009)

Network-on-Chip (NoC) design methodology is considered as an important trend for large System-on-Chip design because of the bandwidth and power constraints in traditional synchronous bus architecture. In the design of packet-based NoC, packetizing mechanism has great effect on communication performance, area, and energy consumption of NoC. In this paper, we carry out detailed simulation to evaluate several kinds of packetizing mechanisms of NoC based on topology of Ring and Spidergon. Simulation results show that Condition-Waiting adaptive packetizing mechanism (CW-APM) is the best trade-off packetizing mechanism in NoC design.
Evaluation of the Cognitive Process during Mental Imaging of Two- or Three-Dimensional Figures
Authors: Koji Kashihara
Venue: Proceedings of the 2009 Second International Conferences on Advances in Computer-Human Interactions (2009)

The reaction time and the accuracy in the brain images of 2D or 3D figures were studied. The image task for the frame of a 3D object from 2D figures (2D-3D task) in the brain had the longest reaction time (p, the probability value of a statistical hypothesis test,
Web 2.0 semantic systems: collaborative learning in science
Authors: Michael Shoffner, Jane Greenberg, Jacob Kramer-Duffield, David Woodbury
Venue: Proceedings of the 2008 International Conference on Dublin Core and Metadata Applications (2008)

The basic goal of education within a discipline is to transform a novice into an expert. This entails moving the novice toward the "semantic space" that the expert inhabits---the space of concepts, meanings, vocabularies, and other intellectual constructs that comprise the discipline.
Compression and Aggregation for Logistic Regression Analysis in Data Cubes
Authors: Ruibin Xi, Nan Lin, Yixin Chen
Venue: IEEE Transactions on Knowledge and Data Engineering (2009)

Logistic regression is an important technique for analyzing and predicting data with categorical attributes. In this paper, We consider supporting online analytical processing (OLAP) of logistic regression analysis for multi-dimensional data in a data cube where it is expensive in time and space to build logistic regression models for each cell from the raw data. We propose a novel scheme to compress the data in such a way that we can reconstruct logistic regression models to answer any OLAP query without accessing the raw data. Based on a first-order approximation to the maximum likelihood estimating equations, we develop a compression scheme that compresses each base cell into a small compressed data block with essential information to support the aggregation of logistic regression models. Aggregation formulae for deriving high-level logistic regression models from lower level component cells are given. We prove that the compression is nearly lossless in the sense that the aggregated estimator deviates from the true model by an error that is bounded and approaches to zero when the data size increases. The results show that the proposed compression and aggregation scheme can make feasible OLAP of logistic regression in a data cube.
OR-transition Colored Petri Net and its Application in Modeling Software System
Authors: Yong Yu, Tong Li, Qing Liu, Fei Dai, Na Zhao
Venue: Proceedings of the 2009 Second International Workshop on Knowledge Discovery and Data Mining (2009)

Petri nets are a graphical and mathematical modeling tool applicable to many systems. But there is a problem which bars Petri net development: too much nodes lead to “station explosion”, especially when analyzing a large and complicated system. To relieve the problem, a new extended Petri net—OR-transition Petri net is presented, and based on it, OR-transition colored Petri net is presented. This paper gives the basic relation between transitions in an OR-transition Petri net system. This paper also analyzes the properties of OR-transition colored Petri net, and introduces its application in modeling software system.
A high-speed voltage-follower based on a global feedback technique
Authors: N. Charalampidis, M. Spasos, N. Mallios, K. Hayatleh, B. L. Hart, J. F. Lidgey
Venue: Proceedings of the 7th conference on Circuits, systems, electronics, control and signal processing (2008)

This paper presents a novel voltage-follower, implemented in bipolar technology, based on a global feedback technique. The evaluation of the circuit has been carried out using extra fast complimentary transistors and the biasing circuitry followed the same design philosophy. The proposed design exhibits very high input and very low output impedance, due to the feedback technique, for operating frequencies beyond 1GHz. The small-signal bandwidth achieved is higher than 3GHz, the output voltage swing is some ±3.2V, the offset voltage is around 200uV while the input offset current is just above 130nA. The new circuit achieved gain flatness to within 0.1dB up to 170MHz, featuring total harmonic distortion better than -65dB and intermodulation distortion of around -70dB, for capacitive loads up to 10pF. The operation of the novel design is specified from -20°C to +100°C and the power dissipation is some 52mW on a ±5V power supply.