ppxscal/embedding_network huggingface dataset:
Software architecture and mobility: a perfect marriage or an uneasy alliance?
Authors: Nenad Medvidovic
Venue: Proceedings of the 1st international workshop on Software architectures and mobility (2008)

Developments in the area of software architecture over the past decade have pushed it to the forefront of a number of critical software engineering activities: modeling, design, analysis, simulation, implementation, deployment, and evolution. Architecture is advocated as an effective conceptual tool for addressing the many challenges of developing large, complex, distributed systems. Largely in parallel to these developments, significant advances have also been made in the domain of mobile computing. Many mobile systems are also large, complex, and distributed, yet a majority of the advances in this domain appear not to have resulted from an explicit software architectural focus. Despite this, architecture appears to offer clear benefits in this domain, as evidenced by some recent approaches. In this talk, I will overview the state-of-the-art in the area of mobile computing, with a specific focus on the role software architecture should and does play in this domain. I will highlight the characteristics of software architectures as well as specific architecture-based approaches that make them particularly suitable to developing mobile systems. I will also highlight several impediments, both real and perceived, to the wholesale adoption of architectural principles in this area.
Generating summary keywords for emails using topics
Authors: Mark Dredze, Hanna M. Wallach, Danny Puller, Fernando Pereira
Venue: Proceedings of the 13th international conference on Intelligent user interfaces (2008)

Email summary keywords, used to concisely represent the gist of an email, can help users manage and prioritize large numbers of messages. We develop an unsupervised learning framework for selecting summary keywords from emails using latent representations of the underlying topics in a user's mailbox. This approach selects words that describe each message in the context of existing topics rather than simply selecting keywords based on a single message in isolation. We present and compare four methods for selecting summary keywords based on two well-known models for inferring latent topics: latent semantic analysis and latent Dirichlet allocation. The quality of the summary keywords is assessed by generating summaries for emails from twelve users in the Enron corpus. The summary keywords are then used in place of entire messages in two proxy tasks: automated foldering and recipient prediction. We also evaluate the extent to which summary keywords enhance the information already available in a typical email user interface by repeating the same tasks using email subject lines.
Feature Extraction in Spatially-Conserved Regions and Protein Functional Classification
Authors: Bum Ju Lee, Heon Gyu Lee, Dae-sung Kim, Keun Ho Ryu
Venue: Proceedings of the 2007 Frontiers in the Convergence of Bioscience and Information Technologies (2007)

One of the most challenging problems in bioinformatics is prediction of protein functions and structures in unknown protein sequences. The sequence similarity-based approach is the most effective method for the prediction of protein function, but the approach often fails to identify the relevant proteins when similarity does not exist or exists at very low levels. Therefore, it is important to develop prediction and classification methods of protein function without sequence similarity. Our aim is to suggest protein function classification using protein properties without sequence similarity. In this paper, we propose feature extraction in spatially-conserved region sequences and apply high-ranked features through the selection of attributes for the classification of protein function. The experimental results demonstrate that RMSE and MAE rates decrease after low-ranked attributes are discarded from our classification. Our method points out classification using only important short sequences such as motif or conserved regions.
SNMP Proxy for Wireless Sensor Network
Authors: Yen Yang Lim, Marco Messina, Frank Kargl, Leena Ganguli, Martin Fischer, Tommy Tsang
Venue: Proceedings of the Fifth International Conference on Information Technology: New Generations (2008)

In this paper the authors describe the implementation of a wireless sensor network of Micaz motes as a viable and effective solution for a health monitoring application that is connected to the Internet for global and remote monitoring. An Architecture for this purpose has been developed. First, the network of wireless sensors gathers environmental and medical data and, using an enhanced Graphical User Interface (GUI) based on the CodeBlue software, then displays and stores data on the PC. The locally stored data are available for remote access via an SNMP-proxy connection. Finally a network management system installed on the remote server analyses the data collected. This approach provides a straightforward solution for an effective remote health monitoring application. The system has been tested using a series of experimental scenarios that have been established in the laboratory to (1) determine the reliability of the data collected from the mobile sensor network, and (2) determine the parameters for future expansion of the health monitoring network by introducing new sensors, alarm triggering algorithms, advanced security techniques, and location tracking capabilities.
Construct Small Worlds in Wireless Networks Using Data Mules
Authors: Chang-Jie Jiang, Chien Chen, Je-Wei Chang, Rong-Hong Jan, Tsun Chieh Chiang
Venue: Proceedings of the 2008 IEEE International Conference on Sensor Networks, Ubiquitous, and Trustworthy Computing (sutc 2008) (2008)

A small world phenomenon has been discovered in a wide range of disciplines, such as physics, biology, social science, information system, computer networks, etc. In a wireless network, the small world phenomenon is used in the development of novel routing strategies. However, past studies made use of wire lines as shortcuts to construct a small world in a wireless network. First, it’s difficult to determine the length of these wired shortcuts in advance. Second, wired lines are unsuitable in certain circumstances such as rural area, battlefield, etc. They are more costly in deployment and more vulnerable to unexpected damage. Finally, in wireless networks that lack central infrastructures such as mobile ad hoc networks (MANET) and wireless vehicular networks, fixed-length wired line shortcuts cannot be employed. This study proposes a new method to construct a small world in a wireless network. Instead of deploying wired lines as shortcuts. Variable length shortcuts are constructed by using mobile router nodes called data mules. Data mules move data between nodes which don’t have direct wireless communication link. These data mules imitate shortcuts in a small world. The small world phenomenon in connected and disconnected wireless networks containing various numbers of data mules is then discussed. Finally the small world phenomenon is considered in wireless sensor networks.
Formal Development of a Complex Information System
Authors: Cesar Andrés, Mercedes G. Merayo, Manuel Núñez
Venue: Proceedings of the Third International Conference on Systems (2008)

In this paper we present a new model to formally represent complex information systems. This new formalism is very suitable to specify time requirements (both time consumption due to the performance of tasks and timeouts) as well as to represent data communication among different components of a system. In addition to provide the theoretical framework, we show how this formalism, based on finite state machines, has been used as the basis to develop a real information system. This exercise convinced us that a formal approach to develop complex systems can facilitate some of the development phases. In particular, the testing phase, more precisely, how to choose which tests to apply, is simplified since tests are automatically extracted from the specification.
Optimization on array bound check and redundancy elimination
Authors: V. Vijay Kumar, K. V. N. Sunitha
Venue: Proceedings of the 5th WSEAS/IASME International Conference on Systems Theory and Scientific Computation (2005)

Compiler optimization technology has been steadily advancing as more sophisticated processors hit the market. For high end embedded processors, today's most advanced compilers take advantage of both CPU specific and application specific information to optimize code intelligently for optimal result. This paper discusses one such sophisticated optimization technique which combines array bound check optimization together with redundancy elimination combined with folding. The array bound check optimization described in this paper reduces the run time overhead by eliminating unnecessary bound checks. The results and comparisons demonstrate number of advantages of this method over the existing methods.
The connection between two ways of reasoning about partial functions
Authors: John S. Fitzgerald, Cliff B. Jones
Venue: Information Processing Letters (2008)

Undefined terms involving the application of partial functions and operators are common in program specifications and in discharging proof obligations that arise in design. One way of reasoning about partial functions with classical First-order Predicate Calculus (FoPC) is to use a non-strict equality notion so as to insulate logical operators from undefined operands. An alternative approach is to work only with strict (weak) equality but use an alternative Logic of Partial Functions (LPF)-a logic in which the ''Law of the Excluded Middle'' does not hold. This paper explores the relationships between the theorems that can be proved in the two approaches. The main result is that theorems in LPF using weak equality can be straightforwardly translated into ones that are true in FoPC; translation in the other direction results, in general, in more complicated expressions but in many cases these can be readily simplified. Such results are important if the laudable move towards interworking of formal methods tools is to be sound.
The future of ITiCSE
Authors: Lillian (Boots) Cassell
Venue: ACM SIGCSE Bulletin (2008)

Now that ITiCSE has reached its teenage years, it's time to take a look at where we've been, where we are, and where we'd like to go. The panelists will offer a historical perspective of the conference, what makes it stand out from other conferences, and give some ideas of how they would like to see ITiCSE mature. Come hear what they have to say, and there will be plenty of time for the audience to offer their own suggestions of where they would like to see ITiCSE go.
Simon's Intelligence Phase for Security Risk Assessment in Web Applications
Authors: Brunil Romero, Marianella Villegas, Marina Meza
Venue: Proceedings of the Fifth International Conference on Information Technology: New Generations (2008)

Organizations in this digital era use automated Information Technology Systems to process their information in order to support their missions. Web Applications (WA) offer services for business processes that imply handling organization valuable information. Their requirements have become more complex so as to guarantee Information Security. Security Risk Assessment (SRA) plays a critical role in protecting an organization’s information assets. The main query has to do with which is the best form to determine what needs to be protected. This research will be referencing Simon’s Pattern, specifically the intelligence phase, which is used to: a) examine and monitor SRA reality in WA, and b) identify and define essential problems in vulnerabilities determination and their consequences. This study establishes the bases for constructing an authentic problem pattern and how it can be attacked.
Visuals are not what they look
Authors: Karsten Bormann
Venue: Virtual Reality (2008)

When developing virtual environments (VEs), most effort goes into developing the visuals. For many, the ideal is to create virtual worlds of photo-realistic quality or otherwise being of high fidelity. The purpose is to make the VE seem real to the user. This paper takes a closer look at subjects&#x2019; ratings of the visuals, and of the extent to which the VE feels real to the subjects, in the context of an experiment on audio in which subjects were to perform two search tasks: the first in an ordinary, textured house; the second in a bare structure consisting almost exclusively of the barren, white walls. Audio was never relevant to the search task in the first experiment, while in the second experiment it was relevant to the search task for half of the subjects. Subjects for whom audio was irrelevant to both their search tasks rated their visual involvement as large in the barren VE as in the higher quality one. However, subjects for which audio was relevant to their search task in the second experiment saw their visual involvement plummet, while their auditory involvement surged. Finally, the extent to which the VE felt real to the subjects did not correlate with their visual involvement but instead showed a strong correlation with the extent to which the interaction felt natural.
Reasoning about Airport Security Regulations Using the Focal Environment
Authors: David Delahaye, Jean-Frédéric Étienne, Véronique Viguié Donzeau-Gouge
Venue: Proceedings of the Second International Symposium on Leveraging Applications of Formal Methods, Verification and Validation (2006)

We present the validation of regulations intended to ensure airport security in the framework of civil aviation. In particular, we describe the proofs of correctness/completeness for two standards, one at the international level and the other at the European level, and we show how the properties of the European level refines those of the international level. These models are expressed using the Focal environment, an object-oriented specification and proof system, and the proofs described by means of a declarative-like language are processed by the automated theorem prover Zenon. We show how Zenon appears quite appropriate when dealing with abstract specifications like our case study, but also how it should be controlled to present readable proofs.
Secure Routing Protocol with Malicious Nodes Detection for Ad Hoc Networks
Authors: Chu-Hsing Lin, Wei-Shen Lai, Yen-Lin Huang, Mei-Chun Chou
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications - Workshops (2008)

An ad hoc network is a highly dynamic routing network cooperated by a set of wireless mobile nodes without any assistance of centralized access point. ARIADNE is a well-known secure on-demand ad hoc network routing protocol. After finishing the Route Discovery protocol, it just finds one route for the source and the destination nodes. However, the intermediate nodes can’t use that route to transmitting data for themselves. For reducing the Route Discovery broadcast packets and reusing the valid route for increasing the packet delivery ratio, we present a new secure on-demand routing protocol based on ARIADNE, called I-ARIADNE. We design the authentication mechanism for the intermediate nodes to verify the route information and reuse it for another route discovery request. Such design can reduce the broadcast packets. Later, they can use that route for transmitting data to other nodes on it. From simulation results, by using our protocol the performance of the entire network environment will be enhanced.
Short communication: Mining knowledge from data using Anticipatory Classifier System
Authors: Olgierd Unold, Krzysztof Tuszyński
Venue: Knowledge-Based Systems (2008)

The article demonstrates the capabilities of Anticipatory Classifier System in solving the data mining tasks. It is a first application of anticipatory learning to a real world exploration tasks. The results of experiments with Monk's, Voting-record and WBC problems are shown as well as comparison of these results with other systems is presented. ACS handles these tasks quite well even though it is designed for a different kind of problems.
Logical reducibility and monadic NP
Authors: S. S. Cosmadakis
Venue: Proceedings of the 1993 IEEE 34th Annual Foundations of Computer Science (1993)

It is shown that, by choosing appropriate encodings of instances as relational structures, several known polynomial-time many-one reductions can he described in first-order logic, and furthermore they are monadic. As a corollary, several known NP-complete problems in monadic NP are shown not to be in monadic co-NP. It is further shown that there is no monadic first-order reduction from connectivity to directed reachability, even in the presence of successor. Finally, some classes of syntactically restricted first-order reductions are shown to be incomparable.
BrowseRank: letting web users vote for page importance
Authors: Yuting Liu, Bin Gao, Tie-Yan Liu, Ying Zhang, Zhiming Ma, Shuyuan He, Hang Li
Venue: Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval (2008)

This paper proposes a new method for computing page importance, referred to as BrowseRank. The conventional approach to compute page importance is to exploit the link graph of the web and to build a model based on that graph. For instance, PageRank is such an algorithm, which employs a discrete-time Markov process as the model. Unfortunately, the link graph might be incomplete and inaccurate with respect to data for determining page importance, because links can be easily added and deleted by web content creators. In this paper, we propose computing page importance by using a 'user browsing graph' created from user behavior data. In this graph, vertices represent pages and directed edges represent transitions between pages in the users' web browsing history. Furthermore, the lengths of staying time spent on the pages by users are also included. The user browsing graph is more reliable than the link graph for inferring page importance. This paper further proposes using the continuous-time Markov process on the user browsing graph as a model and computing the stationary probability distribution of the process as page importance. An efficient algorithm for this computation has also been devised. In this way, we can leverage hundreds of millions of users' implicit voting on page importance. Experimental results show that BrowseRank indeed outperforms the baseline methods such as PageRank and TrustRank in several tasks.
Why should we do 3D integration?
Authors: Wilfried Haensch
Venue: Proceedings of the 45th annual Design Automation Conference (2008)

3D integration offers a technology that meets the requirements of the current trend in high performance microprocessors.
RFID authentication protocol for low-cost tags
Authors: Boyeon Song, Chris J. Mitchell
Venue: Proceedings of the first ACM conference on Wireless network security (2008)

In this paper, we investigate the possible privacy and security threats to RFID systems, and consider whether previously proposed RFID protocols address these threats. We then propose a new authentication protocol which provides the identified privacy and security features and is also efficient. The new protocol resists tag information leakage, tag location tracking, replay attacks, denial of service attacks, backward traceability, forward traceability (under an assumption), and server impersonation (also under an assumption). We also show that it requires less tag-side storage and computation than other similarly structured RFID protocols.
Original papers: Assessment of nitrogen losses to the environment with a Nitrogen Trading Tool (NTT)
Authors: J. A. Delgado, M. J. Shaffer, H. Lal, S. P. McKinney, C. M. Gross, H. Cover
Venue: Computers and Electronics in Agriculture (2008)

Nitrogen (N) losses from agriculture often contribute to reduced air, groundwater, and surface water quality. The minimization of these N losses is desirable from an environmental standpoint, and a recent interest in discounted reductions of agricultural N losses that might apply to a project downstream from an agricultural area has resulted in the concept of N credits and associated N trading. To help quantify management-induced reductions in N losses at the farm field level (essential components of a Nitrogen Trading Tool), we defined a Nitrogen Trading Tool difference in reactive N losses (NTT-DNL"r"e"a"c) as the comparison between a baseline and new management scenarios. We used a newly released Windows XP version of the Nitrogen Losses and Environmental Assessment Package (NLEAP) simulation model with Geographic Information System (GIS) capabilities (NLEAP-GIS) to assess no-till systems from a humid North Atlantic US site, manure management from a Midwestern US site, and irrigated cropland from an arid Western US site. The new NTT-DNL"r"e"a"c can be used to identify the best scenario that shows the greatest potential to maximize field-level savings in reactive N for environmental conservation and potential N credits to trade. A positive NTT-DNL"r"e"a"c means that the new N management practice increases the savings in reactive N with potential to trade these savings as N credits. A negative number means that there is no savings in reactive N and no N available to trade. The new NLEAP-GIS can be used to quickly identify the best scenario that shows the greatest potential to maximize field-level savings in reactive N for environmental conservation and earning N credits for trade.
Human GITRLaa50-177 Expressed in Bac-to-Bac Baculovirus Expression System
Authors: Li Tang, Sheng-Jun Wang, Chao-Ming Mao, Jun Chen, Zheng-Jun Hu, Jun-Feng Bao, Qi-Xiang Shao, Hua-Xi Xu
Venue: Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics - Volume 01 (2008)

Glucocorticoid induced tumor necrosis factor receptor ligand (GITRL) is a type II transmembrane protein with homology to TNF receptor superfamily members, and its human receptor (hGITR), an ortholog of the recently discovered murine glucocorticoid-induced TNFR-related (mGITR) protein. Ligation of murine GITR/GITRL can enhance immunity reactions via several signal pathways. However, so far the certain function of hGITR is not clear. In this study, we first used Bac-to-Bac baculovirus expression system to express hGITRLaa50-177 recombinant protein, then identified the recombinant protein by SDS-PAGE, western blot and indirect immunofluorescence staining.
A performance investigation of web caching architectures
Authors: R. T. Hurley, B. Y. Li
Venue: Proceedings of the 2008 C3S2E conference (2008)

Web caching has been recognized as an effective approach to improve performance by storing frequently-accessed documents from originating servers at storage sites "closer" to requesting clients in order to reduce the load on the network bandwidth which in turn can reduce user response time. In this paper, we examine the performance of various architectures for cache cooperation in a web environment. The architectures under consideration include: distributed, hierarchical, and a hybrid of the two. A hierarchical web caching architecture utilizes a series of caches placed at different levels of the network (i.e. client, institutional, regional, and national) and user requests are satisfied at the lowest level possible (the first one that stores the desired document). Distributed web caching incorporates multiple cooperating caches all at the same level. The hybrid approach chosen in this paper contains a hierarchy of distributed caches in the hopes of exploiting advantages from both distributed and hierarchical caching. Using simulation as the tool, we compare the performance (mean response time, overall cache hit rates) of these architectures under a variety of different scenarios in an attempt to identify the conditions under which each is beneficial.