ppxscal/embedding_network huggingface dataset:
Stability and Delay Analysis for Multi-Hop Single-Sink Wireless Sensor Networks
Authors: Muhammad Farukh Munir, Arzad Alam Kherani, Fethi Filali
Venue: Proceedings of the 2008 Sixth Annual IEEE International Conference on Pervasive Computing and Communications (2008)

Wireless sensor networks are commonly used to monitor and control the physical world. To provide a meaningful service such as disaster and emergency surveillance, meeting real-time constraints and the stability of transmit queues are the basic requirements of communication protocols in such networks. Abstract--- In this paper, we propose a closed architecture with two transmit queues at each sensor i, i.e., one for its own generated data, and the other for forwarding traffic. Our first main result concerns the stability of the forwarding queues at the nodes. It states that whether or not the forwarding queues can be stabilized (by appropriate choice of weighted fair queueing weights) depends only on routing and channel access rates of the sensors. Further, the weights of the weighted fair queues play a role in determining the tradeoff between the power allocated for forwarding and the delay of the forwarding traffic. We finally propose a distributed routing scheme for a broad class of wireless sensor networks. Each link is assigned a weight and the objective is to route through minimum weight paths using iterative updating scheme. The proposal is validated by analytical analysis and simulations.
Free form projection display and application
Authors: Daisuke Kondo, Yuichi Shiwaku, Ryugo Kijima
Venue: Proceedings of the 5th ACM/IEEE International Workshop on Projector camera systems (2008)

Free Form Projection Display is a novel display technology to superimpose a virtual object onto real object by image projection. The method is based on the distortion cancellation algorithm to project an image onto curved screen without distortion. The virtual objects are represented as if it is located inside the screen. This system allows the user to handle the screen object directly, and gives the user a feel of motion parallax. This system gives the user the ease of perception of positional relationship between the surface of screen and the internal virtual object.
Constructing spectral schemes of the immersed interface method via a global description of discontinuous functions
Authors: An Liang, Xiaodong Jing, Xiaofeng Sun
Venue: Journal of Computational Physics (2008)

A global description of discontinuous functions is introduced in this paper. By expressing a discontinuous function as the sum of a smooth function and a correction term determined by jump conditions, we turn the unknown function from a discontinuous one into a sufficiently smooth one when solving a differential equation. Spectral schemes are developed based on this concept with the intention of eliminating or reducing the Gibbs oscillation. Finite difference schemes are also constructed as an alternative of the current immersed interface methods. Both spectral and finite difference schemes are tested on one- and two-dimensional cases.
A bundle method for solving equilibrium problems
Authors: T. T. V. Nguyen_aff1n2, J. J. Strodiot, V. H. Nguyen
Venue: Mathematical Programming: Series A and B (2008)

We present a bundle method for solving nonsmooth convex equilibrium problems based on the auxiliary problem principle. First, we consider a general algorithm that we prove to be convergent. Then we explain how to make this algorithm implementable. The strategy is to approximate the nonsmooth convex functions by piecewise linear convex functions in such a way that the subproblems are easy to solve and the convergence is preserved. In particular, we introduce a stopping criterion which is satisfied after finitely many iterations and which gives rise to &#x0394;-stationary points. Finally, we apply our implementable algorithm for solving the particular case of singlevalued and multivalued variational inequalities and we find again the results obtained recently by Salmon et&#x00a0;al. [18].
Model-based Theory Combination
Authors: Leonardo de Moura, Nikolaj Bjørner
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2008)

Traditional methods for combining theory solvers rely on capabilities of the solvers to produce all implied equalities or a pre-processing step that introduces additional literals into the search space. This paper introduces a combination method that incrementally reconciles models maintained by each theory. We evaluate the practicality and efficiency of this approach.
Phylogenetic Analysisof Trichomonade Xylosyltransferases
Authors: Kuo-Yuan Hwa, Hsing-Hsang Hung, Chen-Hsing Chen
Venue: Proceedings of the 2007 Frontiers in the Convergence of Bioscience and Information Technologies (2007)

Our goal is to search for xylosyltransferase genes from the T. vaginalis EST genome database by bioinformatics approaches. First, we have constructed a theoretical model of conserved xylosyltransferase sequences based on a Hidden Markov Models (HMM) built from known xylosyltransferases sequences. Eight candidate sequences of xylosyltransferase are detected in T. vaginalis genome. We have also confirmed the results by blasting through NCBI's non-redundant protein database. To analyze which family of xylosyltransferase these sequences belongs to, we have constructed an unrooted dendrogram of xylosyltransferease protein family, based on distance-matrix method. The result suggests that the T. vaginalis xylosyltransferase sequences are more closely related to beta-1,2-xylosyltransferases, but not to O-linked xylosyltransferase. All our in silico results are consistent with the structural data of T. vaginalis N-linked glycans.
Evaluation of the Processing Workload for Two Models of Communication Control in IP Networks
Authors: Kazuya Odagiri, Giuseppe De Marco, Nao Tanoue, Rihito Yaegashi, Masaharu Tadauchi, Naohiro Ishii
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications (2008)

In standard IP networks, the control of communication of individual connections is an important aspect of network management. Generally, we distinguish two models of communication control. One is based on the exploitation of standard mechanisms, such as IP filtering, port blocking, routing rules, deployed along the path between the client and the server. We refer to these mechanisms as Infrastructure-based Management model. On the other hand, the control can be carried out by controlling the client machines of every user. This new model is a Client-side Management model, and it has been realized in our previous work, by means of a dedicated framework we called DACS. Essentially, DACS distributes the control within the client machines. Therefore, also the network management processing workload is distributed. While in our previous work we investigated functions of DACS scheme and network services, here we are more concerned with analyzing the processing workload due to communication control demanded to the client machines in practical networks. In this regard, we evaluate DACS performance from the point of view of the processing load and demonstrate by some preliminary experiments that DACS framework is better than Infrastructure-based Management models. From this result, we conclude that , DACS outperforms existing solutions for the communication control problem, because it can control a whole local area network by distributed control of client machines, with an acceptable increase of the processing workload.
Epidemic live streaming: optimal performance trade-offs
Authors: Thomas Bonald, Laurent Massoulié, Fabien Mathieu, Diego Perino, Andrew Twigg
Venue: Proceedings of the 2008 ACM SIGMETRICS international conference on Measurement and modeling of computer systems (2008)

Several peer-to-peer systems for live streaming have been recently deployed (e.g. CoolStreaming, PPLive, SopCast). These all rely on distributed, epidemic-style dissemination mechanisms. Despite their popularity, the fundamental performance trade-offs of such mechanisms are still poorly understood. In this paper we propose several results that contribute to the understanding of such trade-offs. Specifically, we prove that the so-called random peer, latest useful chunk mechanism can achieve dissemination at an optimal rate and within an optimal delay, up to an additive constant term. This qualitative result suggests that epidemic live streaming algorithms can achieve near-unbeatable rates and delays. Using mean-field approximations, we also derive recursive formulas for the diffusion function of two schemes referred to as latest blind chunk, random peer and latest blind chunk, random useful peer. Finally, we provide simulation results that validate the above theoretical results and allow us to compare the performance of various practically interesting diffusion schemes terms of delay, rate, and control overhead. In particular, we identify several peer/chunk selection algorithms that achieve near-optimal performance trade-offs. Moreover, we show that the control overhead needed to implement these algorithms may be reduced by restricting the neighborhood of each peer without substantial performance degradation.
Website browsing aid: A navigation graph-based recommendation system
Authors: Youwei Wang, Weihui Dai, Yufei Yuan
Venue: Decision Support Systems (2008)

Websites nowadays are an important and popular source of publicly available information. However, due to their exploding scale and complexity, overcoming information overload to find relevant information is a major challenge. In addition to website maps and search engines, self-adaptive websites or websites with intelligent navigation aid are very useful tools in addressing this issue. In this paper, a navigation graph-based recommendation system is proposed, in which the navigation patterns of previous website visitors are utilized to provide recommendations for newcomers. The performance of the proposed recommendation algorithm is tested using the data collected from a real world website. Experimental results reveal that the proposed system can yield satisfactory recommendations, especially to the visitors in their early navigation steps.
Drawing services: towards a paper-based interface for end-user service orchestration
Authors: Björn Borggräfe, Christian Dörner, Jan Heß, Volkmar Pipek
Venue: Proceedings of the 4th international workshop on End-user software engineering (2008)

One of the challenges end-users face in order to maintain and enhance their IT infrastructures is the simplicity and ease of use of the configuration/design-time interfaces. In this paper we describe our approach of using existing technologies for paper-based interfaces to allow end-users to orchestrate services in a Service-Oriented Architecture (SOA). We gathered first experiences with paper-based interfaces for IT configuration by developing an end-user-developable paper-based remote interface for interactive TV applications. Further we conducted a workshop to evaluate how end-user can orchestrate services. Here, we discuss the usefulness of a paper-based interface for the orchestration of services, from an end-user perspective and how the experiences from our prototype and the workshop can inform the design of a paper-based orchestration prototype for SOA.
A distance model for rhythms
Authors: Jean-François Paiement, Yves Grandvalet, Samy Bengio, Douglas Eck
Venue: Proceedings of the 25th international conference on Machine learning (2008)

Modeling long-term dependencies in time series has proved very difficult to achieve with traditional machine learning methods. This problem occurs when considering music data. In this paper, we introduce a model for rhythms based on the distributions of distances between subsequences. A specific implementation of the model when considering Hamming distances over a simple rhythm representation is described. The proposed model consistently outperforms a standard Hidden Markov Model in terms of conditional prediction accuracy on two different music databases.
Interview with David Harris, MTV New Media
Authors: Newton Lee
Venue: Computers in Entertainment (CIE) (2008)

David Harris was born in Puerto Rico, raised in Texas, and received his undergraduate degree in Film, Animation, and Video from the Rhode Island School of Design. He worked as the creative director for Love Advertising, producer for ADV Films, Inc. (one of America's leading anim&eacute; companies), and lived in Paris for a year in between. In 2003, he relocated to Los Angeles to pursue his MFA from UCLA in Film, TV and Digital Media. His thesis project, HOWDOISAYTHIS.COM, was sponsored by mtvU and Cisco and won the 2007 SXSW Web Award for Best Student Site. Since launching HOWDOISAYTHIS.COM, Harris worked in the development think tank at Fox Television Studios before taking his current position at MTV New Media, where he is working on the Players project, Jackass World, and a number of interactive projects that are as exciting as they are secret. In the video interview, you will hear David's answers to the following questions: 1. You call yourself the "MacGyver" at MTV New Media. Could you elaborate on your role at MTV? 2. How does MTV New Media compete with MySpace and YouTube in reaching the MTV audience on the Internet? 3. What is your experience in working with the AFI Digital Content Lab? 4. What suggestions do you have that would make the Digital Content Lab more innovative, useful, and rewarding? 5. What is the innovation of the "Players" project that you are working on at the Digital Content Lab? 6. If you can do anything you want at MTV, what will you do?
C#.NET programming course
Authors: Donald Hsu
Venue: Journal of Computing Sciences in Colleges (2008)

Since 2002, C#.NET has generated significant headway in enterprise system development of Fortune 500 firms. Dice.com lists 950+ C# .NET jobs in the New York tristate area daily!
SOSRAID-6: A Self-Organized Strategy of RAID-6 in the Degraded Mode
Authors: Suzhen Wu, Dan Feng, Bo Mao, Jianxi Chen, Lingfang Zeng
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications - Workshops (2008)

The distinct benefit of RAID-6 is that it provides higher reliability than the other RAID levels for toler-ating double disk failures. Whereas, when a disk fails the read/write operations on the failed disk will be re-directed to all the surviving disks, which will increase the burden of the surviving disks, the probability of the disk failure and the energy consumption along with the degraded performance issue. In this paper, we present a Self-Organized Strategy (SOS) to improve the performance of RAID-6 in the degraded mode. SOS organizes the data on the failed disks to the corresponding parity locations on first ac-cess. Then the later accesses to the failed disks will be redirected to the parity locations rather than all the surviving disks. Besides the performance improvement the SOSRAID-6 reduces the failure probability of the survived disks and is more energy efficient compared with the Traditional RAID-6. With the theoretical evaluation we find that the SOSRAID-6 is more pow-erful than the TRAID-6.
Lossy trapdoor functions and their applications
Authors: Chris Peikert, Brent Waters
Venue: Proceedings of the 40th annual ACM symposium on Theory of computing (2008)

We propose a new general primitive called lossy trapdoor functions (lossy TDFs), and realize it under a variety of different number theoretic assumptions, including hardness of the decisional Diffie-Hellman (DDH) problem and the worst-case hardness of lattice problems. Using lossy TDFs, we develop a new approach for constructing several important cryptographic primitives, including (injective) trapdoor functions, collision-resistant hash functions, oblivious transfer, and chosen ciphertext-secure cryptosystems. All of the constructions are simple, efficient, and black-box. These results resolve some long-standing open problems in cryptography. They give the first known injective trapdoor functions based on problems not directly related to integer factorization, and provide the first known CCA-secure cryptosystem based solely on the worst-case complexity of lattice problems.
A study of learning a merge model for multilingual information retrieval
Authors: Ming-Feng Tsai, Yu-Ting Wang, Hsin-Hsi Chen
Venue: Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval (2008)

This paper proposes a learning approach for the merging process in multilingual information retrieval (MLIR). To conduct the learning approach, we also present a large number of features that may influence the MLIR merging process; these features are mainly extracted from three levels: query, document, and translation. After the feature extraction, we then use the FRank ranking algorithm to construct a merge model; to our knowledge, this practice is the first attempt to use a learning-based ranking algorithm to construct a merge model for MLIR merging. In our experiments, three test collections for the task of crosslingual information retrieval (CLIR) in NTCIR3, 4, and 5 are employed to assess the performance of our proposed method; moreover, several merging methods are also carried out for a comparison, including traditional merging methods, the 2-step merging strategy, and the merging method based on logistic regression. The experimental results show that our method can significantly improve merging quality on two different types of datasets. In addition to the effectiveness, through the merge model generated by FRank, our method can further identify key factors that influence the merging process; this information might provide us more insight and understanding into MLIR merging.
Designing planned route based interactions for context-aware applications
Authors: Ling Chen, Steve Benford
Venue: Proceedings of the 4th international conference on mobile technology, applications, and systems and the 1st international symposium on Computer human interaction in mobile technology (2007)

In order to counter the low efficiency problem of location-aware applications, we present planned route based interactions in this paper. The methods to acquire the planned routes of users are described, and an innovative self-reporting method is proposed. The design of information adaptation and two possible implementations in a spatial database are described. The design of human-human interactions with respect to the planned routes of users is given with three sample systems: traffic information sharing, casual chat, and audio-video sharing. Finally, we present a concrete pervasive game named Your Way Your Missions which employs the planned route based interactions.
Towards Adaptability Support in Collaborative Business Processes
Authors: Ismaïl Khriss, Enrico Lévesque, Guy Tremblay, André Jacques
Venue: Proceedings of the 2008 International MCETECH Conference on e-Technologies (2008)

Service-oriented architecture (SOA) brings new perspectives not only to software architecture but also to enterprise business processes. SOA promotes the use of loosely coupled services to automate business processes. The automation of business processes raises several challenges for enterprises. One of those challenges relates to the maintenance of business processes, more precisely how to facilitate changes within existing business processes, possibly even at run-time. Furthermore, changing a collaborative business process can have an impact on the contract specified between the parties involved. Thus, a business process may need to adapt to meet a new contract. Some approaches propose solutions to support business process adaptability; however, they do not handle adaptability in the context of multi-partner collaborative business processes. In this paper, we propose a new approach to support adaptability for such collaborative processes. This approach uses a protocol, called Change Protocol for Collaboration (CPC), for managing the changes that can have incidence on the contract.
A general obligation model and continuity: enhanced policy enforcement engine for usage control
Authors: Basel Katt, Xinwen Zhang, Ruth Breu, Michael Hafner, Jean-Pierre Seifert
Venue: Proceedings of the 13th ACM symposium on Access control models and technologies (2008)

The usage control model (UCON) has been proposed to augment traditional access control models by integrating authorizations, obligations, and conditions and providing the properties of decision continuity and attribute mutability. Several recent work have applied UCON to support security requirements in different computing environments such as resource sharing in collaborative computing systems and data control in remote platforms. In this paper we identify two individual but interrelated problems of the original UCON model and recent implementations: oversimplifying the concept of usage session of the model, and the lack of comprehensive ongoing enforcement mechanism of implementations. We extend the core UCON model with continuous usage sessions thus extensively augment the expressiveness of obligations in UCON, and then propose a general, continuity-enhanced and configurable usage control enforcement engine. Finally we explain how our approach can satisfy flexible security requirements with an implemented prototype for a healthcare information system.
A case study in reasoning about processes
Authors: Chunping Li
Venue: Proceedings of the 5th WSEAS International Conference on Computational Intelligence, Man-Machine Systems and Cybernetics (2006)

In this paper, we give a case study to show how a high level semantics of processes can be integrated with the event calculus to reason about complex, continuous processes. We present a formal method to specify the semantics of processes in the event calculus and implement the automated reasoning about processes and continuous change in the logical programming framework.
Lindley distribution and its application
Authors: M. E. Ghitany, B. Atieh, S. Nadarajah
Venue: Mathematics and Computers in Simulation (2008)

A treatment of the mathematical properties is provided for the Lindley distribution. The properties studied include: moments, cumulants, characteristic function, failure rate function, mean residual life function, mean deviations, Lorenz curve, stochastic ordering, entropies, asymptotic distribution of the extreme order statistics, distributions of sums, products and ratios, maximum likelihood estimation and simulation schemes. An application to waiting time data at a bank is described.
A Heuristic Coordinate Filtering Scheme to Aid Online Indexing of Spatio-Temporal Trajectories
Authors: Hamimah Ujir, Irwandi Hipni Mohamad Hipiny
Venue: Proceedings of the 2008 Second Asia International Conference on Modelling & Simulation (AMS) (2008)

Traditional online indexing of spatio-temporal trajectories requires indexing coordinates at fixed intervals or each time the moving object changes direction or velocity. We propose a heuristic coordinate filtering scheme to help evaluate each periodically sampled coordinate candidacy forindexing. Successful coordinates are the minimum trajectory's coordinates required as control points during the cubic spline interpolation process; invoked whenever a spatio-temporal historical query is made on the indexed trajectory. Using our heuristic coordinate filtering scheme, the number of indexed coordinates is significantly reduced to 25% - 35% of the original amount required by the traditional indexing methods, yet the indexed trajectory'sintegrity is well preserved. Both heuristic coordinate filtering and cubic spline interpolation step require minimal time penalty, hence allowing our method for online uses.