764 results
Search Results
2. Call for Papers.
- Subjects
- *
TESTING , *SYSTEMS design , *COMPUTER network resources - Abstract
A call for papers on topics concerning network testing series to evaluate the defects in design and implementation of a system is presented.
- Published
- 2013
- Full Text
- View/download PDF
3. Two ways to Access the IEEE Member Digital Library.
- Subjects
- *
PUBLISHED articles , *CONFERENCE papers , *COMPUTER network resources - Abstract
The article offers information on the journal's digital library for accessing any article or conference paper published in the journal which includes Journal's Member Digital Library and Journal's Member Digital Library Basic.
- Published
- 2014
- Full Text
- View/download PDF
4. Call For Papers.
- Subjects
TECHNOLOGICAL innovations ,CONFERENCES & conventions ,WEBSITES ,WORLD Wide Web ,AUTHORS ,COMPUTER network resources - Abstract
Authors addressing advancement and innovation in topics of interest to AMTA are invited to submit a 200-word abstract for review and possible presentation at the Symposium. Visit the AMTA 2012 website at www.AMTA.org for a detailed list of paper topics. [ABSTRACT FROM PUBLISHER]
- Published
- 2012
- Full Text
- View/download PDF
5. A Comprehensive Reliability Analysis Framework for NTC Caches: A System to Device Approach.
- Author
-
Gebregiorgis, Anteneh, Bishnoi, Rajendra, and Tahoori, Mehdi B.
- Subjects
ENERGY consumption ,INTEGRATED circuit design ,RELIABILITY in engineering ,AGING ,SOFT errors ,CACHE memory ,COMPUTER network resources - Abstract
Near threshold computing (NTC) has significant role in reducing the energy consumption of modern very large scale integrated circuits designs. However, NTC designs suffer from functional failures and performance loss. Understanding the characteristics of the functional failures and variability effects is of decisive importance in order to mitigate them, and get the utmost NTC benefits. This paper presents a comprehensive cross-layer reliability analysis framework to assess the effect of soft error, aging, and process variation in the operation of near threshold voltage caches. The objective is to quantify the reliability of different SRAM designs, evaluate voltage scaling potential of caches, and to find a reliability-performance optimal cache organization for an NTC microprocessor. In this paper, the soft error rate (SER) and static noise margin (SNM) of 6T and 8T SRAM cells and their dependencies on aging and process variation are investigated by considering device, circuit, and architecture level analysis. Their experimental results show that in NTC, process variation and aging-induced SNM degradation is $2.5{\boldsymbol \times }$ higher than in the super threshold domain while SER is $8{\boldsymbol \times }$ higher. At NTC, the use of 8T instead of 6T SRAM cells can reduce the system-level SNM and SER by 14% and 22%, respectively. Besides, we observe that we can find the right balance between performance and reliability by using an appropriate cache organization at NTC which is different from the super threshold. [ABSTRACT FROM AUTHOR]
- Published
- 2019
- Full Text
- View/download PDF
6. IEEE Transactions on Robotics information for authors.
- Subjects
MANUSCRIPTS ,INFORMATION resources management ,COPYRIGHT ,COMPUTER network resources - Abstract
The article offers information about the journal including the submission of manuscripts and multimedia material, copyright and the publication of information through an electronic form.
- Published
- 2016
- Full Text
- View/download PDF
7. Social Bookmarking for Scholarly Digital Libraries.
- Author
-
Farooq, Umer, Yang Song, Carroll, John M., and Giles, C. Lee
- Subjects
DIGITAL library use studies ,DIGITAL libraries ,WEBSITE use studies ,WEBSITES ,COMPUTER network resources ,WEB analytics ,SOCIAL media - Abstract
Social bookmarking services have recently gained popularity among Web users. Whereas numerous studies provide a historical account of tagging systems, the authors use their analysis of a domain-specific social bookmarking service called CiteULike to reflect on two metrics for evaluating tagging behavior: tag growth and tag reuse. They examine the relationship between these two metrics and articulate design implications for enhancing social bookmarking services. The authors briefly reflect on their own work developing a social bookmarking service for CiteSeer. [ABSTRACT FROM AUTHOR]
- Published
- 2007
- Full Text
- View/download PDF
8. Scitopia.org.
- Subjects
- *
CONFERENCE papers , *RESEARCH periodicals , *SCHOLARLY peer review , *COMPUTER network resources - Abstract
The article offers information on the website scitopia.org, which offers quality content related to science and technology research from peer-reviewed articles and conference papers.
- Published
- 2012
- Full Text
- View/download PDF
9. The Global Packing Number of a Fat-Tree Network.
- Author
-
Lo, Yuan-Hsun, Zhang, Yijin, Chen, Yi, Fu, Hung-Lin, and Wong, Wing Shing
- Subjects
COMPUTER network resources ,DATA structures ,ROUTING (Computer network management) ,DATA libraries ,TREE graphs - Abstract
Data centers play an important role in today’s Internet development. Research to find scalable architecture and efficient routing algorithms for data center networks has gained popularity. The fat-tree architecture, which is essentially a folded version of a Clos network, has proved to be readily implementable and is scalable. In this paper, we investigate routing on a fat-tree network by deriving its global packing number and by presenting explicit algorithms for the construction of optimal, load-balanced routing solutions. Consider an optical network that employs wavelength division multiplexing in which every user node sets up a connection with every other user node. The global packing number is basically the number of wavelengths required by the network to support such a traffic load, under the restriction that each source-to-destination connection is assigned a wavelength that remains constant in the network. In mathematical terms, consider a bidirectional, simple graph, G and let N\subseteq V(G) be a set of nodes. A path system \mathcal P of G with respect to N consists of |N|(|N|-1) directed paths, one path to connect each of the source-destination node pairs in N . The global packing number of a path system , denoted by \Phi (G,N,\mathcal {P}) , is the minimum integer k to guarantee the existence of a mapping \phi :\mathcal P\to \1,2,\ldots, k\ , such that \phi (P)\neq \phi (\widehat P) if P and \widehat {P} have common arc(s). The global packing number of (G,N) , denoted by \Phi (G,N) , is defined to be the minimum \Phi (G,N,\mathcal {P}) among all possible path systems \mathcal {P} . In additional to wavelength division optical networks, this number also carries significance for networks employing time division multiple access. In this paper, we compute by explicit route construction the global packing number of (\text Tn,N) , where Tn denotes the topology of the n -ary fat-tree network, and $N$ is considered to be the set of all edge switches or the set of all supported hosts. We show that the constructed routes are load-balanced and require minimal link capacity at all network links. [ABSTRACT FROM AUTHOR]
- Published
- 2017
- Full Text
- View/download PDF
10. All Roads Lead to Computing: Making, Participatory Simulations, and Social Computing as Pathways to Computer Science.
- Author
-
Brady, Corey, Orton, Kai, Weintrop, David, Anton, Gabriella, Rodriguez, Sebastian, and Wilensky, Uri
- Subjects
COMPUTER science ,SOCIAL computing ,COMPUTER simulation ,COMPUTER programming ,STUDENT-centered learning ,HARDWARE ,COMPUTER network resources - Abstract
Computer science (CS) is becoming an increasingly diverse domain. This paper reports on an initiative designed to introduce underrepresented populations to computing using an eclectic, multifaceted approach. As part of a yearlong computing course, students engage in Maker activities, participatory simulations, and computing projects that foreground the social and collaborative aspects of CS. Collectively, these activities are designed to introduce learners to the growing diversity of what CS looks like in the 21st century. This paper lays out the practical and theoretical motivations for the Computational Thinking for Girls (CT4G) project, specifically highlighting the use of Making through physical and social computing as ways to engage students in CS. A snapshot of one activity from the program is provided—Wearing the Web—in which students use open-hardware programmable badges to explore the underlying structure and technology that enables the Internet. Data from the first year of the CT4G program are presented to show the positive effects that this diverse introduction to CS is having on the students with respect to their attitudes toward CS. [ABSTRACT FROM PUBLISHER]
- Published
- 2017
- Full Text
- View/download PDF
11. On-the-Fly Nearest-Shelter Computation in Event-Dependent Spatial Networks in Disasters.
- Author
-
Tsai, Pei-Hsuan, Lin, Chun-Lung, and Liu, Jyun-Nan
- Subjects
EMERGENCY management ,EMERGENCY management -- Communication systems ,ROBOTIC path planning ,QUERYING (Computer science) ,APPROXIMATION algorithms ,MOBILE communication systems ,COMPUTER network resources - Abstract
Numerous approaches have been proposed to solve shortest path query problems (SPQPs) in either static or time-dependent spatial networks; however, these approaches are neither appropriately nor efficiently used to find the nearest shelter with fastest paths in disaster evacuations. In disasters, segments of a path computed and saved as the fastest might become impassable. The nearest shelter differs for people depending on their locations and can also change on the basis of an unpredictable and highly dynamic edge cost (e.g., maximum passable vehicle speed), which is influenced by disaster events. To solve this problem, this paper proposes a dynamic network model, which is called an event-dependent network, to represent a spatial network in a disaster. Effective approaches using multiple algorithms are proposed for on-the-fly computation of the nearest shelter and fastest paths in a disaster. A distributed system consisting of a server and multiple mobile clients using our approaches is presented for navigating the fastest paths for people to evacuate a disaster area. Real-world maps, such as a map of California, were used in our experiments. The results revealed that our approaches require less than 2 ms to find a new nearest shelter and its fastest paths, which is faster than other approaches for solving the fastest-path problem. [ABSTRACT FROM AUTHOR]
- Published
- 2016
- Full Text
- View/download PDF
12. Track Everything: Limiting Prior Knowledge in Online Multi-Object Recognition.
- Author
-
Wong, Sebastien C., Stamatescu, Victor, Kearney, David, Lee, Ivan, McDonnell, Mark D., and Gatt, Adam
- Subjects
OBJECT recognition (Computer vision) ,TRACKING algorithms ,IMAGE ,EVALUATION ,DECISION making ,COMPUTER network resources - Abstract
This paper addresses the problem of online tracking and classification of multiple objects in an image sequence. Our proposed solution is to first track all objects in the scene without relying on object-specific prior knowledge, which in other systems can take the form of hand-crafted features or user-based track initialization. We then classify the tracked objects with a fast-learning image classifier, that is based on a shallow convolutional neural network architecture and demonstrate that object recognition improves when this is combined with object state information from the tracking algorithm. We argue that by transferring the use of prior knowledge from the detection and tracking stages to the classification stage, we can design a robust, general purpose object recognition system with the ability to detect and track a variety of object types. We describe our biologically inspired implementation, which adaptively learns the shape and motion of tracked objects, and apply it to the Neovision2 Tower benchmark data set, which contains multiple object types. An experimental evaluation demonstrates that our approach is competitive with the state-of-the-art video object recognition systems that do make use of object-specific prior knowledge in detection and tracking, while providing additional practical advantages by virtue of its generality. [ABSTRACT FROM PUBLISHER]
- Published
- 2017
- Full Text
- View/download PDF
13. Digital Libraries and Autonomous Citation Indexing.
- Author
-
Lawrence, Steve and Giles, C. Lee
- Subjects
SCIENTIFIC literature ,INDEXING ,WEBSITES ,COMPUTER network resources - Abstract
Provides information on scientific literature on the Web. Information on citation indexing; Details on autonomous citation indexing (ACI); Processing and parsing documents. INSET: Obtaining CiteSeer.
- Published
- 1999
- Full Text
- View/download PDF
14. Combining Computational Analyses and Interactive Visualization for Document Exploration and Sensemaking in Jigsaw.
- Author
-
Gorg, Carsten, Liu, Zhicheng, Kihm, Jaeyeon, Choo, Jaegul, Park, Haesun, and Stasko, John
- Subjects
GRID computing ,INTERACTIVE computer graphics ,SENSEMAKING theory (Communication) ,JIGSAW puzzles ,DATA visualization ,VISUAL analytics ,ACQUISITION of data ,COMPUTER network resources - Abstract
Investigators across many disciplines and organizations must sift through large collections of text documents to understand and piece together information. Whether they are fighting crime, curing diseases, deciding what car to buy, or researching a new field, inevitably investigators will encounter text documents. Taking a visual analytics approach, we integrate multiple text analysis algorithms with a suite of interactive visualizations to provide a flexible and powerful environment that allows analysts to explore collections of documents while sensemaking. Our particular focus is on the process of integrating automated analyses with interactive visualizations in a smooth and fluid manner. We illustrate this integration through two example scenarios: An academic researcher examining InfoVis and VAST conference papers and a consumer exploring car reviews while pondering a purchase decision. Finally, we provide lessons learned toward the design and implementation of visual analytics systems for document exploration and understanding. [ABSTRACT FROM AUTHOR]
- Published
- 2013
- Full Text
- View/download PDF
15. Multipumping Flexible DSP Blocks for Resource Reduction on Xilinx FPGAs.
- Author
-
Ronak, Bajaj and Fahmy, Suhaib A.
- Subjects
DIGITAL signal processing ,FIELD programmable gate arrays ,COMPUTER network resources ,DIGITAL communications - Abstract
For complex datapaths, resource sharing can help reduce area consumption. Traditionally, resource sharing is applied when the same resource can be scheduled for different uses in different cycles, often resulting in a longer schedule. Multipumping is a method whereby a resource is clocked at a frequency that is a multiple of the surrounding circuit, thereby offering multiple executions per global clock cycle. This allows a single resource to be shared among multiple uses in the same cycle. This concept maps well to modern field-programmable gate arrays (FPGAs), where hard macro blocks are typically capable of running at higher frequencies than most designs implemented in the logic fabric. While this technique has been demonstrated for static resources, modern digital signal processing (DSP) blocks are flexible, supporting varied operations at runtime. In this paper, we demonstrate multipumping for resource sharing of the flexible DSP48E1 macros in Xilinx FPGAs. We exploit their dynamic programmability to enable resource sharing for the full set of supported DSP block operations, and compare this to multipumping only multipliers and DSP blocks with fixed configurations. The proposed approach saves on average 48% DSP blocks at a cost of 74% more LUTs, effectively saving 30% equivalent LUT area and is feasible for the majority of designs, in which clock frequency is typically below half the maximum supported by the DSP blocks. [ABSTRACT FROM PUBLISHER]
- Published
- 2017
- Full Text
- View/download PDF
16. Quantifying Interdependent Privacy Risks with Location Data.
- Author
-
Olteanu, Alexandra-Mihaela, Huguenin, Kevin, Shokri, Reza, Humbert, Mathias, and Hubaux, Jean-Pierre
- Subjects
CELL phone users ,ONLINE social networks ,INTERNET protocol address ,TAGS (Metadata) ,PRIVACY ,COMPUTER network resources ,LOCATION data - Abstract
Co-location information about users is increasingly available online. For instance, mobile users more and more frequently report their co-locations with other users in the messages and in the pictures they post on social networking websites by tagging the names of the friends they are with. The users’ IP addresses also constitute a source of co-location information. Combined with (possibly obfuscated) location information, such co-locations can be used to improve the inference of the users’ locations, thus further threatening their location privacy: As co-location information is taken into account, not only a user's reported locations and mobility patterns can be used to localize her, but also those of her friends (and the friends of their friends and so on). In this paper, we study this problem by quantifying the effect of co-location information on location privacy, considering an adversary such as a social network operator that has access to such information. We formalize the problem and derive an optimal inference algorithm that incorporates such co-location information, yet at the cost of high complexity. We propose some approximate inference algorithms, including a solution that relies on the belief propagation algorithm executed on a general Bayesian network model, and we extensively evaluate their performance. Our experimental results show that, even in the case where the adversary considers co-locations of the targeted user with a single friend, the median location privacy of the user is decreased by up to 62 percent in a typical setting. We also study the effect of the different parameters (e.g., the settings of the location-privacy protection mechanisms) in different scenarios. [ABSTRACT FROM AUTHOR]
- Published
- 2017
- Full Text
- View/download PDF
17. Incident-Supporting Visual Cloud Computing Utilizing Software-Defined Networking.
- Author
-
Gargees, Rasha, Morago, Brittany, Pelapur, Rengarajan, Chemodanov, Dmitrii, Calyam, Prasad, Oraibi, Zakariya, Duan, Ye, Palaniappan, Kannappan, and Seetharaman, Guna
- Subjects
NATURAL disasters ,STREAMING video & television ,CLOUD computing ,SOFTWARE-defined networking ,EXPERIENCE ,COMPUTER network resources - Abstract
In the event of natural or man-made disasters, providing rapid situational awareness through video/image data collected at salient incident scenes is often critical to the first responders. However, computer vision techniques that can process the media-rich and data-intensive content obtained from civilian smartphones or surveillance cameras require large amounts of computational resources or ancillary data sources that may not be available at the geographical location of the incident. In this paper, we propose an incident-supporting visual cloud computing solution by defining a collection, computation, and consumption (3C) architecture supporting fog computing at the network edge close to the collection/consumption sites, which is coupled with cloud offloading to a core computation, utilizing software-defined networking (SDN). We evaluate our 3C architecture and algorithms using realistic virtual environment test beds. We also describe our insights in preparing the cloud provisioning and thin-client desktop fogs to handle the elasticity and user mobility demands in a theater-scale application. In addition, we demonstrate the use of SDN for on-demand compute offload with congestion-avoiding traffic steering to enhance remote user quality of experience in a regional-scale application. The optimization between fogs computing at the network edge with core cloud computing for managing visual analytics reduces latency, congestion, and increases throughput. [ABSTRACT FROM PUBLISHER]
- Published
- 2017
- Full Text
- View/download PDF
18. Second bibliography on transmission access issues.
- Author
-
McCalley, James D. and Asgarpoor, Sohrab
- Subjects
ELECTRICAL engineering ,ELECTRIC power systems ,BIBLIOGRAPHY ,COMPUTER network resources - Abstract
Presents the second bibliography on issues related to transmission access in electric power systems. Citations referenced in the bibliography; List of web sites devoted to energy and power engineering; Government web sites; Conclusions.
- Published
- 1997
- Full Text
- View/download PDF
19. Ultra-Fast Bloom Filters using SIMD Techniques.
- Author
-
Lu, Jianyuan, Wan, Ying, Li, Yang, Zhang, Chuwen, Dai, Huichen, Wang, Yi, Zhang, Gong, and Liu, Bin
- Subjects
INFORMATION filtering systems ,ENCODING ,NETWORK routers ,COMPUTER network resources ,MEMBERSHIP - Abstract
The network link speed is growing at an ever-increasing rate, which requires all network functions on routers/switches to keep pace. Bloom filter is a widely-used membership check data structure in networking applications. Correspondingly, it also faces the urgent demand of improving the performance in membership check speed. To this end, this paper proposes a new Bloom filter variant called Ultra-Fast Bloom Filters (UFBF), by leveraging the Single Instruction Multiple Data (SIMD) techniques. We make three improvements for UFBF to accelerate the membership check speed. First, we develop a novel hash computation algorithm which can compute multiple hash functions in parallel with the use of SIMD instructions. Second, we elaborate a Bloom filter’s bit-test process from sequential to parallel, enabling more bit-tests per unit time. Third, we improve the cache efficiency of membership check by encoding an element’s information to a small block so that it can fit into a cache-line. We further generalize UFBF, called c-UFBF, to make UFBF supporting large number of hash functions. Both theoretical analysis and extensive evaluations show that the UFBF greatly outperforms the state-of-the-art Bloom filter variants on membership check speed. [ABSTRACT FROM AUTHOR]
- Published
- 2019
- Full Text
- View/download PDF
20. Dynamic Resource Scheduling in Mobile Edge Cloud with Cloud Radio Access Network.
- Author
-
Wang, Xinhou, Wang, Kezhi, Wu, Song, Di, Sheng, Jin, Hai, Yang, Kun, and Ou, Shumao
- Subjects
RADIO access networks ,CLOUD computing ,CUSTOMER services ,CELL phones ,DYNAMICAL systems ,COMPUTER network resources - Abstract
Nowadays, by integrating the cloud radio access network (C-RAN) with the mobile edge cloud computing (MEC) technology, mobile service provider (MSP) can efficiently handle the increasing mobile traffic and enhance the capabilities of mobile devices. But the power consumption has become skyrocketing for MSP and it gravely affects the profit of MSP. Previous work often studied the power consumption in C-RAN and MEC separately while less work had considered the integration of C-RAN with MEC. In this paper, we present an unifying framework for the power-performance tradeoff of MSP by jointly scheduling network resources in C-RAN and computation resources in MEC to maximize the profit of MSP. To achieve this objective, we formulate the resource scheduling issue as a stochastic problem and design a new optimization framework by using an extended Lyapunov technique. Specially, because the standard Lyapunov technique critically assumes that job requests have fixed lengths and can be finished within each decision making interval, it is not suitable for the dynamic situation where the mobile job requests have variable lengths. To solve this problem, we extend the standard Lyapunov technique and design the VariedLen algorithm to make online decisions in consecutive time for job requests with variable lengths. Our proposed algorithm can reach time average profit that is close to the optimum with a diminishing gap (1/V) for the MSP while still maintaining strong system stability and low congestion. With extensive simulations based on a real world trace, we demonstrate the efficacy and optimality of our proposed algorithm. [ABSTRACT FROM AUTHOR]
- Published
- 2018
- Full Text
- View/download PDF
21. Enhanced Security for Online Exams Using Group Cryptography.
- Author
-
Jung, Im Y. and Yeom, Heon Y.
- Subjects
ONLINE education ,CRYPTOGRAPHY research ,COMPUTER security software ,ONLINE data processing ,EXAMINATIONS ,TECHNOLOGICAL innovations ,COMPUTER network resources ,SECURITY systems - Abstract
While development of the Internet has contributed to the spread of online education, online exams have not been widely adopted. An online exam is defined here as one that takes place over the insecure Internet, and where no proctor is in the same location as the examinees. This paper proposes an enhanced secure online exam management environment mediated by group cryptography using remote monitoring and control of ports and input. The target domain of this paper is that of online exams for math or English contests in middle or high school, as well as exams in online university courses with students in remote locations. [ABSTRACT FROM AUTHOR]
- Published
- 2009
- Full Text
- View/download PDF
22. Routing Connections With Differentiated Reliability Requirements in WDM Mesh Networks.
- Author
-
Hongbin Luo, Lemin Li, and Hongfang Yu
- Subjects
NETWORK routers ,COMPUTER networks ,INTERNETWORKING devices ,COMPUTER network resources ,DATA transmission systems ,ELECTRONIC data processing - Abstract
Reliability has been well recognized as an important design objective in the design of modern high-speed networks. While traditional approaches offer either 100% protection in the presence of single link failure or no protection at all, connections in real networks may have multiple reliability requirements. The concept of differentiated reliability (DiR) has been introduced in the literature to provide multiple reliability requirements in protection schemes that provision spare resources. In this paper, we consider the problem of routing connections with differentiated reliability in wavelength-division multiplexing (WDM) mesh networks when backup sharing is not allowed. Our objective is to route connections with minimum network cost (e.g., network resources) while meeting their required reliability cannot be used for achieving efficiency, the goal is to achieve efficiency by improved path selection. In this paper, we first present an integer linear programming (ILP) formulation for the problem. By solving the ILP formulation, we can obtain an optimal solution with respect to the current network state for each dynamic arrival. To solve the ILP formulation, however, is time consuming for large networks. We thus propose two approximation algorithms for the problem. The first one, called Shortest-Path-Pair-based Auxiliary graph (SPPA), can obtain an r-approximation solution whose cost is at most 1 + ϵ times the optimum in O((n
2 (n+ 1) + 2mn)(log log(2n) + 1/ϵ)) time, where n and m are the number of nodes and links in a network, respectively. To reduce the computational complexity of the first algorithm, the second algorithm, called Auxiliary graph-based Two-Step Approach (ATSA), is proposed and can obtain a near optimal solution with cost at most 2 + ϵ times that of the optimal solution in O(mn(log log n+ 1/ϵ)) time. [ABSTRACT FROM AUTHOR]- Published
- 2009
- Full Text
- View/download PDF
23. Shape Registration by Optimally Coding Shapes.
- Author
-
Jiang, Yifeng, Xie, Jun, and Tsui, Hung-Tat
- Subjects
MINIMUM description length (Information theory) ,STRUCTURAL optimization ,MEDICAL imaging systems ,COMPUTERS ,COMPUTER algorithms ,MEDICAL errors ,COMPUTER network resources - Abstract
This paper formulates shape registration as an optimal coding problem. It employs a set of landmarks to establish the correspondence between shapes, and assumes that the best correspondence can be achieved when the polygons formed by the landmarks optimally code all the shape contours, i.e., obtain their minimum description length (MDL). This is different from previous MDL-based shape registration methods, which code the landmark locations. In this paper, each contour is discretized to be a set of points to make the coding feasible, and a number of strategies are adopted to tackle the difficult optimization problem involved. The resulting algorithm, called CAP, is able to yield statistical shape model with better quality in terms of model generalization error, which is demonstrated on both synthetic and biomedical shapes. [ABSTRACT FROM AUTHOR]
- Published
- 2008
- Full Text
- View/download PDF
24. AdaptiviTree: Adaptive Tree Visualization for Tournament-Style Brackets.
- Author
-
Tan, Desney S., Smith, Greg, Lee, Bongshin, and Robertson, George G.
- Subjects
SPORTS ,SPORTS tournaments ,DATA visualization ,TREE graphs ,TOURNAMENTS (Graph theory) ,COMPUTER network resources - Abstract
Online pick'em games, such as the recent NCAA college basketball March Madness tournament, form a large and rapidly growing industry. In these games, players make predictions on a tournament bracket that defines which competitors play each other and how they proceed toward a single champion. Throughout the course of the tournament, players monitor the brackets to track progress and to compare predictions made by multiple players. This is often a complex sensemaking task. The classic bracket visualization was designed for use on paper and utilizes an incrementally additive system in which the winner of each match-up is rewritten in the next round as the tournament progresses. Unfortunately, this representation requires a significant amount of space and makes it relatively difficult to get a quick overview of the tournament state since competitors take arbitrary paths through the static bracket. In this paper, we present AdaptiviTree, a novel visualization that adaptively deforms the representation of the tree and uses its shape to convey outcome information. AdaptiviTree not only provides a more compact and understandable representation, but also allows overlays that display predictions as well as other statistics. We describe results from a lab study we conducted to explore the efficacy of AdaptiviTree, as well as from a deployment of the system in a recent real-world sports tournament. [ABSTRACT FROM AUTHOR]
- Published
- 2007
- Full Text
- View/download PDF
25. Web-Based Electronic Data Collection System to Support Electrochemotherapy Clinical Trial.
- Author
-
Pavlović, Ivan and Miklavćić, Damijan
- Subjects
CLINICAL trials ,AUTOMATION ,MEDICAL care ,MEDICAL records ,AUTOMATIC data collection systems ,COMMUNICATION & technology ,INTERNET ,DATA analysis ,DATABASE searching ,COMPUTER network resources - Abstract
Many branches of the healthcare industry are being influenced by information and communication technology (ICT). Clinical trials are not an exception. Despite this fact, more than 75 % of clinical trials data are being collected on paper records. Recent ICT advances, such as broad acceptance of lnternet Technology which are rapidly improving electronic data collection IEDCI tools, however, may soon reduce this percentage of "paper" supported clinical trials. In this paper, we present our Web-based EDC system designed to support a small-scale research-oriented clinical trial for establishing standard operating procedures (SOP) for electrochemotherapy with a new medical device, named Cliniporator. The definition of the SOP can only be based on a comprehensive analysis of collected data and results of clinical trial. Therefore, it is necessary to record treatment efficiency and, in this respect, to carefully follow and collect treatment parameters. We thus established central database and the Web application for filling database with data submitted by users from distant medical centers across Europe. Also, we enabled transmitting of data stored on the local Cliniporator medical devices to the central database as well as submitting of tumor images and marking of tumor nodules on interactive human map developed in Macromedia Flash. We provided users with dynamically generated basic statistics, and, several times during data collection process, we performed statistical data analysis. In order to assure high quality of data in a database, we included several mechanisms: automatic data validation, digital signatures, the form completeness notification system, e-mail alerting of completed forms, and "check tables." After 13 months of using the systems, we performed a simple usability evaluation of the system by asking users to answer to a questionnaire, and here we present the results. [ABSTRACT FROM AUTHOR]
- Published
- 2007
- Full Text
- View/download PDF
26. A Semantics-Aware Approach to the Automated Network Protocol Identification.
- Author
-
Yun, Xiaochun, Wang, Yipeng, Zhang, Yongzheng, and Zhou, Yu
- Subjects
INTERNET protocols ,COMPUTER network resources ,IP networks ,INTERNET traffic ,DATA packeting - Abstract
Traffic classification, a mapping of traffic to network applications, is important for a variety of networking and security issues, such as network measurement, network monitoring, as well as the detection of malware activities. In this paper, we propose Securitas, a network trace-based protocol identification system, which exploits the semantic information in protocol message formats. Securitas requires no prior knowledge of protocol specifications. Deeming a protocol as a language between two processes, our approach is based upon the new insight that the n-grams of protocol traces, just like those of natural languages, exhibit highly skewed frequency-rank distribution that can be leveraged in the context of protocol identification. In Securitas, we first extract the statistical protocol message formats by clustering n-grams with the same semantics, and then use the corresponding statistical formats to classify raw network traces. Our tool involves the following key features: 1) applicable to both connection oriented protocols and connection less protocols; 2) suitable for both text and binary protocols; 3) no need to assemble IP packets into TCP or UDP flows; and 4) effective for both long-live flows and short-live flows. We implement Securitas and conduct extensive evaluations on real-world network traces containing both textual and binary protocols. Our experimental results on BitTorrent, CIFS/SMB, DNS, FTP, PPLIVE, SIP, and SMTP traces show that Securitas has the ability to accurately identify the network traces of the target application protocol with an average recall of about 97.4% and an average precision of about 98.4%. Our experimental results prove Securitas is a robust system, and meanwhile displaying a competitive performance in practice. [ABSTRACT FROM AUTHOR]
- Published
- 2016
- Full Text
- View/download PDF
27. On Channel Failures, File Fragmentation Policies, and Heavy-Tailed Completion Times.
- Author
-
Nair, Jayakrishnan, Andreasson, Martin, Andrew, Lachlan L. H., Low, Steven H., and Doyle, John C.
- Subjects
INTERNET protocols ,COMPUTER network resources ,DATA packeting ,FILE Transfer Protocol (Computer network protocol) ,COMPUTER files - Abstract
It has been recently discovered that heavy-tailed completion times can result from protocol interaction even when file sizes are light-tailed. A key to this phenomenon is the use of a restart policy where if the file is interrupted before it is completed, it needs to restart from the beginning. In this paper, we show that fragmenting a file into pieces whose sizes are either bounded or independently chosen after each interruption guarantees light-tailed completion time as long as the file size is light-tailed; i.e., in this case, heavy-tailed completion time can only originate from heavy-tailed file sizes. If the file size is heavy-tailed, then the completion time is necessarily heavy-tailed. For this case, we show that when the file size distribution is regularly varying, then under independent or bounded fragmentation, the completion time tail distribution function is asymptotically bounded above by that of the original file size stretched by a constant factor. We then prove that if the distribution of times between interruptions has nondecreasing failure rate, the expected completion time is minimized by dividing the file into equal-sized fragments; this optimal fragment size is unique but depends on the file size. We also present a simple blind fragmentation policy where the fragment sizes are constant and independent of the file size and prove that it is asymptotically optimal. Both these policies are also shown to have desirable completion time tail behavior. Finally, we bound the error in expected completion time due to error in modeling of the failure process. [ABSTRACT FROM AUTHOR]
- Published
- 2016
- Full Text
- View/download PDF
28. IEEE Transactions on Antennas and Propagation.
- Subjects
GUIDELINES ,PUBLICATIONS ,SCHOLARLY periodicals ,AUTHORS ,INFORMATION dissemination ,MANUSCRIPTS ,COPYRIGHT ,OPEN access publishing ,STANDARDS ,COMPUTER network resources - Abstract
These instructions give guidelines for preparing papers for this publication. Presents information for authors publishing in this journal. [ABSTRACT FROM PUBLISHER]
- Published
- 2016
- Full Text
- View/download PDF
29. DAWN: Delay-Aware Wi-Fi Offloading and Network Selection.
- Author
-
Cheung, Man Hon and Huang, Jianwei
- Subjects
TRAFFIC engineering ,CELL phone users ,IEEE 802.11 (Standard) ,QUALITY of service ,FILE transfer (Computer science) ,COMPUTER algorithms ,DYNAMIC programming ,COMPUTER network resources - Abstract
To accommodate the explosive growth in mobile data traffic, both mobile cellular operators and mobile users are increasingly interested in offloading the traffic from cellular networks to Wi-Fi networks. However, previously proposed offloading schemes mainly focus on reducing the cellular data usage, without paying too much attention on the quality of service (QoS) requirements of the applications. In this paper, we study the Wi-Fi offloading problem with delay-tolerant applications under usage-based pricing. We aim to achieve a good tradeoff between the user's payment and its QoS characterized by the file transfer deadline. We first propose a general
D elay-A wareW i-Fi Offloading andN etwork Selection (DAWN) algorithm for a general single-user decision scenario. We then analytically establish the sufficient conditions, under which the optimal policy exhibits a threshold structure in terms of both the time and file size. As a result, we propose a monotone DAWN algorithm that approximately solves the general offloading problem, and has a much lower computational complexity comparing to the optimal algorithm. Simulation results show that both the general and monotone DAWN schemes achieve a high probability of completing file transfer under a stringent deadline, and require the lowest payment under a non-stringent deadline as compared with three heuristic schemes. [ABSTRACT FROM AUTHOR]- Published
- 2015
- Full Text
- View/download PDF
30. Optimal Tracking Guidance for Aeroassisted Spacecraft Reconnaissance Mission Based on Receding Horizon Control.
- Author
-
Chai, Runqi, Savvaris, Al, Tsourdos, Antonios, Chai, Senchun, and Xia, Yuanqing
- Subjects
PREDICTIVE control systems ,PREDICTION models ,RECONNAISSANCE operations ,SPACE trajectories ,SPACE vehicle tracking ,CONJUGATE gradient methods ,TRACKING algorithms ,COMPUTER network resources - Abstract
This paper focuses on the application of model predictive control (MPC) for the spacecraft trajectory tracking problems. The motivation of the use of MPC, also known as receding horizon control, relies on its ability in dealing with control, state, and path constraints that naturally arise in practical trajectory planning problems. Two different MPC schemes are constructed to solve the reconnaissance trajectory tracking problem. Since the MPC solves the online optimal control problems at each sampling instant, the computational cost associated with it can be high. In order to decrease the computational demand due to the optimization process, a newly proposed two-nested gradient method is used and embedded in the two MPC schemes. Simulation results are provided to illustrate the effectiveness and feasibility of the two MPC tracking algorithms combined with the improved optimization technique. [ABSTRACT FROM AUTHOR]
- Published
- 2018
- Full Text
- View/download PDF
31. Self-Dimensioning and Planning of Small Cell Capacity in Multitenant 5G Networks.
- Author
-
Munoz, Pablo, Sallent, Oriol, and Perez-Romero, Jordi
- Subjects
5G networks ,FEMTOCELLS ,WIRELESS communications ,CAPACITY requirements planning ,COMPUTER network resources - Abstract
An important concept in the fifth generation of mobile networks is multitenancy, which allows diverse operators sharing the same wireless infrastructure. To support this feature in conjunction with the challenging performance requirements of future networks, more automated and faster planning of the required radio capacity is needed. Likewise, installing small cells is an effective resource to provide greater performance and capacity to both indoor and outdoor places. This paper proposes a new framework for automated cell planning in multitenant small cell networks. In particular, taking advantage of the available network data, a set of detailed planning specifications over time and space domains are generated in order to meet the contracted capacity by each tenant. Then, the network infrastructure and configuration are updated according to an algorithm that considers different actions such as adding/removing channels and adding or relocating small cells. The simulation results show the effectiveness of various methods to derive the planning specifications depending on the correlation between the tenant's and network's traffic demands. [ABSTRACT FROM PUBLISHER]
- Published
- 2018
- Full Text
- View/download PDF
32. An Online Data-Driven Technique for the Detection of Transformer Winding Deformations.
- Author
-
Hong, Tianqi, Deswal, Digvijay, and de Leon, Francisco
- Subjects
ELECTRIC windings ,ELECTRIC transformers ,DEFORMATIONS (Mechanics) ,LISSAJOUS' curves ,BUTTERWORTH filters (Signal processing) ,LOWPASS electric filters ,NOISE ,ELECTRIC inductance ,DATA analysis ,COMPUTER network resources - Abstract
This paper presents a novel online diagnostics method capable of detecting winding deformations in two-winding single-phase transformers. The main idea is to identify changes in the short-circuit impedance. The combination of 3-D Lissajous curve methods with a Butterworth low-pass filter allows for the accurate determination of winding deformation of large power transformers in real time. The method is very robust and capable of detecting deformations at the early stage even when the measurements are noisy. Only information already available to the differential protection relay is needed. The proposed diagnostics method has been validated with circuit and finite-element simulations plus a lab experiment. The results show that the proposed online diagnostics technique has the ability to identify winding deformation problems under severe conditions, such as nonsinusoidal input, nonlinear loading, and measurement noise. Under ideal conditions (no signal noise), the inductive identification error of the proposed online diagnostics method identifies the parameters with less than 0.09% error. When accepting a measurement noise of 1%, the error on the identification of inductance is less than 0.13%. [ABSTRACT FROM PUBLISHER]
- Published
- 2018
- Full Text
- View/download PDF
33. Utility-Centric Networking: Balancing Transit Costs With Quality of Experience.
- Author
-
Phan, Truong Khoa, Griffin, David, Maini, Elisa, and Rio, Miguel
- Subjects
UTILITY functions ,QUALITY of service ,INTERNET software ,PROGRAM transformation ,COMPUTER networks ,LINEAR programming ,COMPUTER network resources - Abstract
This paper is focused on techniques for maximizing utility across all users within a total network transit cost budget. We present a new method for selecting between replicated servers distributed over the Internet. First, we introduce a novel utility framework that factors in quality of service metrics. Then we design an optimization algorithm, solvable in polynomial time, to allocate user requests to servers based on utility while satisfying network transit cost constraints, mapping service names to service instance locators. We then describe an efficient, low overhead distributed model which only requires knowledge of a fraction of the data required by the global optimization formulation. Next, a load-balancing variant of the algorithm is explored that substantially reduces blocking caused by congested servers. Extensive simulations show that our method is scalable and leads to higher user utility compared with mapping user requests to the closest service replica, while meeting network traffic cost constraints. We discuss several options for real-world deployment that require no changes to end-systems based on either the use of SDN controllers or extensions to the current DNS system. [ABSTRACT FROM AUTHOR]
- Published
- 2018
- Full Text
- View/download PDF
34. Clarifying Trust in Social Internet of Things.
- Author
-
Lin, Zhiting and Dong, Liang
- Subjects
CYBERCULTURE ,COMPUTER network resources ,COMPUTER systems ,PUBLISHING ,INFORMATION services - Abstract
A social approach can be exploited for the Internet of Things (IoT) to manage a large number of connected objects. These objects operate as autonomous agents to request and provide information and services to users. Establishing trustworthy relationships among the objects greatly improves the effectiveness of node interaction in the social IoT and helps nodes overcome perceptions of uncertainty and risk. However, there are limitations in the existing trust models. In this paper, a comprehensive model of trust is proposed that is tailored to the social IoT. The model includes ingredients such as trustor, trustee, goal, trustworthiness evaluation, decision, action, result, and context. Building on this trust model, we clarify the concepts of trust in the social IoT in five aspects such as: 1) mutuality of trustor and trustee; 2) inferential transfer of trust; 3) transitivity of trust; 4) trustworthiness update; and 5) trustworthiness affected by dynamic environment. With network connectivities that are from real-world social networks, a series of simulations are conducted to evaluate the performance of the social IoT operated with the proposed trust model. An experimental IoT network is used to further validate the proposed trust model. [ABSTRACT FROM PUBLISHER]
- Published
- 2018
- Full Text
- View/download PDF
35. A 2-MHz Wide-Input Hybrid Resonant Converter With Ultracompact Planar Coupled Inductor for Low-Power Integrated On-Chip Applications.
- Author
-
Zhao, Xiaonan, Yeh, Chih-Shen, Zhang, Lanhua, Lai, Jih-Sheng, and Labella, Thomas
- Subjects
RESONANT power convertors ,SYSTEMS on a chip ,POWER inductors ,SWITCHING circuits -- Design & construction ,MAGNETICS ,EQUIPMENT & supplies ,COMPUTER network resources - Abstract
A trend for low-power conversion system is to integrate every component to a single chip. Magnetic component has been the key to determine the power density of the integrated switching power converter. In this paper, a hybrid resonant buck-type converter with an ultracompact custom-designed coupled inductor is presented for low-power integrated on-chip applications. This converter achieves zero-voltage switching for the high-side switch and near zero-voltage zero-current switching for low-side and auxiliary switches. The soft-switching condition allows the circuit operating at high switching frequencies. An ultracompact planar coupled inductor with a dimension of 5.25 mm × 1.95 mm × 3.86 mm is designed and customized for future integrated on-chip applications. The high-power density of this magnetics component is achieved by high switching frequency and optimized printed circuit board (PCB) windings design. A hardware prototype with 24 to 60-V input and 3.3 to 5-V, 3-A output operating at 2–3 MHz is presented to verify the circuit operation. The prototype achieves a peak efficiency of 90.7% using silicon devices at 2-MHz switching frequency. [ABSTRACT FROM PUBLISHER]
- Published
- 2018
- Full Text
- View/download PDF
36. Agent Cooperation Mechanism for Decentralized Manufacturing Scheduling.
- Author
-
Jules, Guiovanni and Saadat, Mozafar
- Subjects
MANUFACTURED products ,SCHEDULING ,DISTRIBUTED computing ,COMPUTER network resources - Abstract
This paper presents an agent cooperation mechanism for scheduling operations in a manufacturing network, while allowing manufacturers to absolutely control their scheduling activities. The study includes a thorough review of recent publications, a real-life industrial use case of a manufacturing network, an agent-based model of the network simulated with recursive porous agent simulation toolkit, the Muth and Thompson (MT10) scheduling data set, and the visualization of results in Microsoft Project. Results of a study of a four-layer cooperation mechanism showed that for the MT10 problem, manufacturer arrangement 0–5–7–2–3–8–1–9–6–4–0 was found to maximize the utilitarian social welfare of the manufacturing network. In terms of make-span, the network achieved a maximum of 1125 which was beyond the known optimal 930. Results suggest that manufacturers could express their scheduling goals and their preferences with whom they wanted to cooperate. These were measured by the time incentive and compatibility indicators. The latter could also be used to track the optimality loss in make-span optimization when implementing the decentralized scheduling approach in the context of manufacturing networks. [ABSTRACT FROM PUBLISHER]
- Published
- 2017
- Full Text
- View/download PDF
37. Guest Editorial: Switching and Routing for Scalable and Energy-Efficient Networking.
- Author
-
Smiljanic, A., Chao, J., Minkenberg, C., Oki, E., and Hamdi, M.
- Subjects
COMPUTER network management ,NETWORK routing protocols ,COMPUTER networks ,SCALABILITY ,ENERGY consumption ,CLOUD computing ,SWITCHING power supplies ,COMPUTER network resources - Abstract
The articles i nthis special issue focus on switching and routing applications for scalable and energy efficient networking. [ABSTRACT FROM PUBLISHER]
- Published
- 2014
- Full Text
- View/download PDF
38. Detecting Localized Categorical Attributes on Graphs.
- Author
-
Chen, Siheng, Yang, Yaoqing, Zong, Shi, Singh, Aarti, and Kovacevic, Jelena
- Subjects
CHARTS, diagrams, etc. ,SIGNAL processing ,ONLINE social networks ,RECOMMENDER systems ,SUBGRAPHS ,VIRUSES ,CYBER physical systems ,DATA mining ,COMPUTER network resources - Abstract
Do users from Carnegie Mellon University form social communities on Facebook? Do signal processing researchers tightly collaborate with each other? Do Chinese restaurants in Manhattan cluster together? These seemingly different problems share a common structure: an attribute that may be localized on a graph. In other words, nodes activated by an attribute form a subgraph that can be easily separated from other nodes. In this paper, we thus focus on the task of detecting localized attributes on a graph. We are particularly interested in categorical attributes such as attributes in online social networks, ratings in recommender systems, and viruses in cyber-physical systems because they are widely used in numerous data mining applications. To solve the task, we formulate a statistical hypothesis testing problem to decide whether a given attribute is localized or not. We propose two statistics: Graph wavelet statistic and graph scan statistic, both of which are provably effective in detecting localized attributes. We validate the robustness of the proposed statistics on both simulated data and two real-world applications: High air-pollution detection and keyword ranking in a coauthorship network collected from IEEE Xplore. Experimental results show that the proposed graph wavelet statistic and graph scan statistic are effective and efficient. [ABSTRACT FROM PUBLISHER]
- Published
- 2017
- Full Text
- View/download PDF
39. Multilayer and Multidomain Resilience in Optical Networks.
- Author
-
Schupke, Dominic A.
- Subjects
OPTICAL communications ,TELECOMMUNICATION systems ,INTERNET protocols ,COMPUTER network resources ,TRANSBORDER data flow ,OPTICAL fibers ,SERVICE level agreements - Abstract
This paper details approaches to resilience in optical multilayer and multidomain networks. Principal challenges and solutions have been described using exemplary settings and models. In addition, we have also shared an outlook to future research topics within this paper. [ABSTRACT FROM PUBLISHER]
- Published
- 2012
- Full Text
- View/download PDF
40. Determining Content Power Users in a Blog Network: An Approach and Its Applications.
- Author
-
Lim, Seung-Hwan, Kim, Sang-Wook, Park, Sunju, and Lee, Joon Ho
- Subjects
COMPUTER network resources ,BLOGS ,APPLICATION software ,INTERNET users ,BUSINESS models ,ELECTRIC network topology ,SOCIAL networks ,PERFORMANCE evaluation - Abstract
In a blog network, there are special users who induce other users to actively utilize blogs. Identifying such influential users is important when establishing business policy and business models for the blog network. This paper defines the users whose contents exhibit significant influence over other users as content power users (CPUs) and proposes a method of identifying them. We analyze the performance of the proposed method by applying it to an actual blog network and comparing its results with those of preexisting methods for determining power users. The experimental results demonstrate that the definition of CPUs is adequate to address the dynamic nature of the blogosphere and the main concerns of the blog industry. We also discuss the business models based on CPUs that could be used to stimulate user activities in a blog network. [ABSTRACT FROM PUBLISHER]
- Published
- 2011
- Full Text
- View/download PDF
41. On Throughput Optimality With Delayed Network-State Information.
- Author
-
Ying, Lei and Shakkottai, Sanjay
- Subjects
COMPUTER networks ,ROUTING (Computer network management) ,SCHEDULING ,AD hoc computer networks ,QUEUEING networks ,DATA transmission systems ,COMPUTER algorithms ,COMPUTER network resources - Abstract
The problem of routing/scheduling in a wireless network with partial/delayed network (channel and queue) state information (NSI) is studied in this paper. Two cases are considered: (i) centralized routing/scheduling, where a central controller obtains heterogeneously delayed information from each of the nodes (thus, the controller has NSI with different delays from different nodes), and makes routing/scheduling decisions; (ii) decentralized routing/scheduling, where each node makes a decision based on its current channel and queue states along with homogeneous delayed NSI from other nodes. For each of the cases (with additional flow restrictions for the decentralized routing/scheduling case), the optimal network throughput regions are characterized under the above described NSI models and it is shown that the throughput regions shrinks with the increase of delay. Further, channel and queue length based routing/scheduling algorithms that achieve the above throughput regions are proposed in this paper. [ABSTRACT FROM PUBLISHER]
- Published
- 2011
- Full Text
- View/download PDF
42. A 48-Core IA-32 Processor in 45 nm CMOS Using On-Die Message-Passing and DVFS for Performance and Power Scaling.
- Author
-
Howard, Jason, Dighe, Saurabh, Vangal, Sriram R., Ruhl, Gregory, Borkar, Nitin, Jain, Shailendra, Erraguntla, Vasantha, Konow, Michael, Riepen, Michael, Gries, Matthias, Droege, Guido, Lund-Larsen, Tor, Steibl, Sebastian, Borkar, Shekhar, De, Vivek K., and Van Der Wijngaart, Rob
- Subjects
TILES ,COMPUTER architecture ,VOLTAGE regulators ,COMPUTER software ,BANDWIDTHS ,ROUTING (Computer network management) ,COLLATERALIZED mortgage obligations ,TRANSISTORS ,COMPUTER network resources - Abstract
This paper describes a multi-core processor that integrates 48 cores, 4 DDR3 memory channels, and a voltage regulator controller in a 6\,\times\,4 2D-mesh network-on-chip architecture. Located at each mesh node is a five-port virtual cut-through packet-switched router shared between two IA-32 cores. Core-to-core communication uses message passing while exploiting 384 KB of on-die shared memory. Fine grain power management takes advantage of 8 voltage and 28 frequency islands to allow independent DVFS of cores and mesh. At the nominal 1.1 V supply, the cores operate at 1 GHz while the 2D-mesh operates at 2 GHz. As performance and voltage scales, the processor dissipates between 25 W and 125 W. The 567~\ mm^2 processor is implemented in 45 nm Hi-K CMOS and has 1.3 billion transistors. [ABSTRACT FROM AUTHOR]
- Published
- 2011
- Full Text
- View/download PDF
43. Supervised Self-Organization of Homogeneous Swarms Using Ergodic Projections of Markov Chains.
- Author
-
Chattopadhyay, Ishanu and Ray, Asok
- Subjects
MARKOV processes ,COMPUTER network resources ,COMPUTER programming ,ALGORITHMS ,ACCELERATION of convergence in numerical analysis - Abstract
This paper formulates a self-organization algorithm to address the problem of global behavior supervision in engineered swarms of arbitrarily large population sizes. The swarms considered in this paper are assumed to be homogeneous collections of independent identical finite-state agents, each of which is modeled by an irreducible finite Markov chain. The proposed algorithm computes the necessary perturbations in the local agents' behavior, which guarantees convergence to the desired observed state of the swarm. The ergodicity property of the swarm, which is induced as a result of the irreducibility of the agent models, implies that while the local behavior of the agents converges to the desired behavior only in the time average, the overall swarm behavior converges to the specification and stays there at all times. A simulation example illustrates the underlying concept. [ABSTRACT FROM AUTHOR]
- Published
- 2009
- Full Text
- View/download PDF
44. Opportunistic Optical Hyperchannel and Its Distributed QoS Assuring Access Control.
- Author
-
Cheri, J., Wang, J., Vu, H., and Zheng, S.-Q.
- Subjects
INTERNET protocols ,COMPUTER network resources ,OPTICAL communications ,ACCESS control ,QUALITY of service - Abstract
Light-trail is proposed as a candidate to carry IP traffic over wavelength-division multiplexing optical networks given its capability of enabling high-speed provisioning and accommodating multigranularity traffic. In a light-trail, the optical shutters at the start node and the end node are configured to be in OFF state and the optical shutters at the intermediate nodes are configured to be in ON state. Thus, an optical bus is formed, allowing traffic multiplexing without the state change of any optical shutter. This, however, limits the system throughput and also makes it impossible to implement a fully distributed medium access control (MAC) protocol to assure quality of service (QoS) in a light-trail. With the recent development on ultrafast optical shutter, we propose an improved light-trail architecture, called opportunistic hyperchannel in this paper. In an opportunistic hyperchannel, an intermediate node can dynamically control its optical shutter which makes it possible to design a fully distributed QoS assuring MAC protocol. We then present a QoS assuring distributed dynamic scheduling protocol, namely, minimum source round robin (minSrcRR) protocol, for opportunistic hyperchannels. Theoretical analysis on the effectiveness of the proposed QoS assuring protocol and the worst-case delay bound are also derived in this paper. The simulation results quantitatively demonstrate the advantage of opportunistic hyperchannels and the effectiveness of minSrcRR protocol. [ABSTRACT FROM AUTHOR]
- Published
- 2009
- Full Text
- View/download PDF
45. From the Guest Editors: IPTV in Multimedia Broadcasting.
- Author
-
Wei Li, Herfet, Thorsten, Jacquenet, Christian, and Hong Liu
- Subjects
INTERNET protocols ,COMPUTER network resources - Abstract
The article discusses various reports published within the issue, including one by Julien Maisonneuve, Muriel Deschanel, Juergen Heiles on Internet Protocol Television (IPTV) standards development, one by Gyu Myoung Lee, Chae Sub Lee, and Woo Seop Rhee on the functional architecture for next generation network and IPTV, and one by Marcel Wagner, Ivan Kopilovic, and Harald Fuchs on two major transport protocols for IPTV.
- Published
- 2009
- Full Text
- View/download PDF
46. Constant-Power Allocation With Average and Peak Power Constraints in Nakagami-m Fading Channels.
- Author
-
Young-Jun Hong and Dan Keun Sung
- Subjects
RADIO transmitter fading ,RADIO resource management ,ON-demand computing ,CONSTRAINT satisfaction ,COMPUTER network resources ,COMPUTER systems - Abstract
This paper considers the performance of time-domain power-allocation schemes with average and peak power constraints and proposes a constant-power allocation (CPA) scheme. In a Nakagami-m fading environment, an exact closed-form expression for the ergodic capacity of the proposed CPA scheme is derived, and the effect of the fading parameter m on the performance degradation due to a peak power constraint is investigated. The proposed scheme shows a near-optimum performance within 5% of the optimal capacity and provides a noticeable performance improvement as it reduces the peak-to-average power ratio (PAPR) with a signal-to-noise ratio (SNR) gain of approximately 8.5 dB while also mitigating the intercell interference in the uplink. [ABSTRACT FROM AUTHOR]
- Published
- 2009
- Full Text
- View/download PDF
47. Communication-Aware Supernode Shape.
- Author
-
Goumas, Georgios, Drosinos, Nikolaos, and Koziris, Nectarios
- Subjects
NETWORK analysis (Communication) ,ALGORITHM software ,SCHEDULING ,MAGNETIC memory (Computers) ,TILES ,ELECTRON tube grids ,SIMULATION methods & models ,APPLICATION software ,COMPUTER network resources - Abstract
In this paper, we revisit the supernode-shape selection problem, which has been widely discussed in the bibliography. In general, the selection of the supernode transformation greatly affects the parallel execution time of the transformed algorithm. Since the minimization of the overall parallel execution time via an appropriate supernode transformation is very difficult to accomplish, researchers have focused on scheduling-aware supernode transformations that maximize parallelism during the execution. In this paper, we argue that the communication volume of the transformed algorithm is an important criterion, and its minimization should be given high priority. For this reason, we define the metric of the per-process communication volume and propose a method to minimize this metric by selecting a communication-aware supernode shape. Our approach is equivalent to defining a proper Cartesian process grid with MPI_Cart_Create, which means that it can be incorporated in applications in a straightforward manner. Our experimental results illustrate that by selecting the tile shape with the proposed method, the total parallel execution time is significantly reduced due to the minimization of the communication volume, despite the fact that a few more parallel execution steps are required. [ABSTRACT FROM AUTHOR]
- Published
- 2009
- Full Text
- View/download PDF
48. On the Computational Complexity and Effectiveness of N-Hub Shortest-Path Routing.
- Author
-
Cohen, Reuven and Nakibly, Gabi
- Subjects
NETWORK routers ,COMPUTER networks ,COMPUTER network resources ,COMPUTER network protocols ,COMPUTATIONAL complexity ,ELECTRONIC data processing - Abstract
In this paper, we study the computational complexity and effectiveness of a concept we term "N-hub Shortest-Path Routing" in IP networks. N-hub Shortest-Path Routing allows the ingress node of a routing domain to determine up to N intermediate nodes ("hubs") through which a packet will pass before reaching its final destination. This facilitates better utilization of the network resources, while allowing the network routers to continue to employ the simple and well-known shortest-path routing paradigm. Although this concept has been proposed in the past, this paper is the first to investigate it in depth. We apply N-hub Shortest-Path Routing to the problem of minimizing the maximum load in the network. We show that the resulting routing problem is NP-complete and hard to approximate. However, we propose efficient algorithms for solving it both in the online and the offline contexts. Our results show that N-hub Shortest-Path Routing can increase network utilization significantly even for N = 1. Hence, this routing paradigm should be considered as a powerful mechanism for future datagram routing in the Internet. [ABSTRACT FROM AUTHOR]
- Published
- 2008
- Full Text
- View/download PDF
49. A Hybrid Token-CDMA MAC Protocol for Wireless Ad Hoc Networks.
- Author
-
I-Sheng Liu, Takawira, Fambirai, and Hong-Jun Xu
- Subjects
COMPUTER access control ,MOBILE communication systems ,CODE division multiple access ,FILTERING software ,WIRELESS communications ,COMPUTER network resources - Abstract
Token-passing medium access control (MAC) protocols are gaining interest among wireless ad hoc network researchers as they provide unrivaled advantages over the existing IEEE 802.11 standards. This paper introduces a hybrid token-code division multiple access (CDMA) MAC protocol that is based on a token-passing scheme with the incorporation of CDMA. With its unique CDMA feature, the proposed MAC is able to support multiple simultaneous transmissions. The proposed protocol provides both quality of service (QoS) and high network resource utilization while ensuring the stability of the network. This paper examines the performance of the proposed MAC scheme by simulation and compares its performance against that of other MAC protocols that have appeared in the literature. Simulation results demonstrate that our proposed MAC scheme is effective in decreasing the packet delay and significantly shortens the length of the queue. The input traffic model used in the simulation is a two-state Markov-Modulated Poisson Process (MMPP). The data rate QoS is enforced by implementing a modified leaky bucket mechanism in the proposed MAC scheme. The simulation also takes into account channel link errors caused by the wireless link by implementing a multilayered Gilbert-Elliot model. [ABSTRACT FROM AUTHOR]
- Published
- 2008
- Full Text
- View/download PDF
50. DeuceScan: Deuce-Based Fast Handoff Scheme in IEEE 802.11 Wireless Networks.
- Author
-
Yuh-Shyan Chen, Ming-Chin Chuang, and Chung-Kai Chen
- Subjects
IEEE 802.11 (Standard) ,WIRELESS communications ,WIRELESS LANs ,TELECOMMUNICATION systems ,END-to-end delay ,MOBILE communication systems ,VEHICLES ,COMPUTER simulation ,COMPUTER networks ,COMPUTER network resources - Abstract
The IEEE 802.11 standard has enabled low-cost and effective wireless local area network (WLAN) services. It is widely believed that WLANs will become a major portion of the fourth-generation cellular system. The seamless handoff problem in WLANs is a very important design issue to support the new astounding and amazing applications in WLANs, particularly for a user in a mobile vehicle. The entire delay time of a handoff is divided into probe, authentication, and reassociation delay times. Because the probe delay occupies most of the handoff delay time, efforts have mainly focused on reducing the probe delay to develop faster handoff schemes. This paper presents a new fast handoff scheme (i.e., the DeuceScan scheme) to further reduce the probe delay for IEEE-802.11-based WLANs. The proposed scheme can be useful to improve wireless communication qualities on vehicles. A spatiotemporal approach is developed in this paper to utilize a spatiotemporal graph to provide spatiotemporal information for making accurate handoff decisions by correctly searching for the next access point. The DeuceScan scheme is a prescan approach that efficiently reduces the Iayer-2 handoff latency. Two factors of stable signal strength and variable signal strength are used in our developed DeuceScan scheme. Finally, simulation results illustrate the performance achievements of the DeuceScan scheme in reducing handoff delay time and packet loss rate and improving link quality. [ABSTRACT FROM AUTHOR]
- Published
- 2008
- Full Text
- View/download PDF
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.